Auction system design using open multithreaded transactions

Two complementary techniques have evolved for providing fault-tolerance in software: forward error recovery and backward error recovery. Few implementations permit both approaches to be combined within a particular application. Fewer techniques are available for the construction of fault-tolerant software for systems involving concurrent processes and multiple processors. Many schemes for supporting forward or backward recovery are based on some concept of an atomic action. The authors propose a mechanism for supporting an atomic action in a system of communicating sequential processes (CSP). The atomic action is used as the basic unit for providing fault-tolerance. The atomic action is called an FT-action, and both forward and backward error recovery are performed in the context of an FT-action.

Online bidding is known by several names, including electronic reverse bid auctions, reverse auctions or simply e-Auctions. Online bidding and auction system has been growing rapidly and extensively in Malaysia. It's become an increasingly popular method for transacting business, especially over the Internet. Online auction systems such as eBay and Lelong.com are the most visited and favorite's website by the users. This study will come out with a framework of bidding system where the registration number of new registered vehicle can be bid in a computerized environment. The framework is designed to be a simple and easy to use the system. It provides you with real-time information during the bidding so that you can check the current price for the registration number and use it as a reference when you submit or revise your bid. With this system, it could help users to obtain a number plate through an unsealed or open bidding process to own and drive a car. An agent will notify the winner by sending an email. With the features like bid notification, it will help the user to know the status of their bids.

Practical exception handling and resolution in concurrent programs

THE Internet, along with its related technologies, has created an interconnected world in which information flows easily and tasks are processed collaboratively. To make service-oriented applications more robust, Web services must be examined from a transactional perspective. By transactional, we mean first defining the actions that guide the execution of Web services when failures arise and then the states that permit claiming the success of this execution following the handling of these failures. A variety of transactional models are reported in the database community. Some of these models can be leveraged and enhanced in response to Web services characteristics while others are not suitable for Web services due to the dynamic nature of Web services, the long-running execution scenarios that Web services take part in, and the successful execution of Web services despite other peers’ failure. Today’s service-oriented applications require advanced transactional models that guarantee integrity and continuity of business processes despite the dynamic nature of the features of the environments hosting the execution of these applications. This special section sheds light on the latest advances in the fields of Web services and transactional models in order to better address advanced research on and experience with transactional Web services. Four papers out of 19 submissions were selected for inclusion in this special section. Each submission was subject to a double-review process by at least three peer reviewers. In the first paper, entitled “Event-Based Design and Runtime Verification of Composite Service Transactional Behavior,” Gaaloul et al. propose an event-driven approach to validate the transactional behavior of Web services taking part in compositions. A composition life cycle consists of four phases, namely, design, execution, monitoring, and reengineering. The verification of this behavior throughout this life cycle is done either at design time to validate recovery mechanisms’ consistency or after runtime to detect execution deviations and repair design errors, and, therefore, formally ensure the execution reliability of Web services. In addition, this verification is based on the Event Calculus formalism, which offers a sound definition for this reliability. In the second paper, entitled “FACTS: A Framework for Fault-Tolerant Composition of Transactional Web Services,” Liu et al. note that delivering reliable compositions over unreliable Web services is challenging. To address this challenge, Liu et al. identify a set of high-level exception handling strategies and a new taxonomy of transactional Web services to devise a fault-tolerant mechanism that combines exception handling and transaction techniques. In addition, Liu et al. devise two modules, known as specification and verification, to assist service designers in constructing fault handling logic conveniently and correctly. This logic is automatically injected into WS-BPEL. In the third paper, entitled “Rule-Based Coordination of Distributed Web Service Transactions,” von Riegen et al. study the distributed transactional activity control problem in the context of service choreographies. In such a context, many participants are allowed to work together to achieve a global, common goal, and the initiator of a process is not always the one who is able to commit or cancel a transaction. Von Riegen et al. introduce a framework that allows autonomous coordination of dynamic processes. This framework extends WSBusinessActivity to strengthen the role of the coordinator. Predicate rules are developed to let participants cancel or complete a process and help the coordinators decide on the completion processes and the confirmation or cancellation of the participants’ works. In the fourth paper, entitled “TQoS: Transactional and QoS-Aware Selection Algorithm for Automatic Web Service Composition,” El Haddad et al. focus on the issues of selecting and composing Web services. A design-time selection algorithm is proposed in which transactional and QoS requirements are both integrated into the selection process. This algorithm is based on the notion of risk that indicates if execution outcomes can either be compensated for or not. Two risk levels of execution in a transactional system are considered: Risk 0, meaning that if the execution is successful, the obtained outcomes can be compensated for by the user, and Risk 1, meaning that the system does not guarantee successful execution, but if it achieves it, the outcomes cannot be compensated for by the user. We hope this special section inspires researchers to develop new transactional models that would guarantee service-oriented applications integrity and continuity. 30 IEEE TRANSACTIONS ON SERVICES COMPUTING, VOL. 3, NO. 1, JANUARY-MARCH 2010

This research paper explores the concept of e-Auction, an increasingly form of online procurement. There is fixed delivery policy. This is a fully dynamic system which can be easily operated by the users. This research paper explores all the increasing form of online procurement. Online e auction system is gaining popularity day by day because of its ease of making online bidding and selling or buying. Users can freely go the website and register there and it’s ready for selling or buying their product. The main thing that is needed to be there is trust among the users, so that they can easily register and take part in the process without having any doubt regarding security. The aim of any online system are related with two points that are: 1.Customer satisfaction 2.Business purpose. Therefore, to meet these requirements there must be need of making enhancements in the online auction system. This paper will explore the all forms of online procurement that we can make to improve the current system.

As campus network and shopping online have grown up, the development of online auction system becomes integrity. The online auction system based on the campus network provides a trading platform for university students, and does not deal with the trading process. So the online auction system must increase its quality of service to attract students. In this paper, we present a scheme for the online auction system using the unified modeling language (UML) technique. We adopt the two steps to design the scheme, and the design scheme of the system is made up of use case diagrams, activity diagrams, class diagrams, sequence diagrams, deployment diagrams. In addition, the scheme can provide certain reference values for constructing the campus electronic commerce and realizing the digital campus.

A high volume of goods and services is being traded using online auction systems. This growth requires a larger size and complexity in order to support the online auction systems. This chapter proposes that there be an analysis of the patterns to identify best practices in the development of online auction information systems. These patterns should help both IT managers and software engineers during the requirements specifications phase of developing an online auction system.

This paper presents a study on the security challenges faced by online auction systems and proposes strategies to address them. The research methodology involved a literature review of existing studies. The main findings of the study suggest that the most common security threats faced by online auction systems include hacking, phishing, and fraud, which can have serious consequences for both buyers and sellers. To address these threats, the paper proposes a number of strategies, including the use of encryption, two-factor authentication, and secure payment systems. The study concludes that improved security measures in online auction systems can help to increase trust and confidence among users, which in turn can lead to greater participation and revenue for the industry. The implications of the study for the online auction industry and potential directions for future research are also discussed.

It has been widely recognized that traditional transaction models with ACID(Atomicity, Consistency, Isolation and Durability) properties generally are not applicable to cooperative applications. Though many advanced transaction models have been proposed to address the problems, they are too database-centered or too rigid to be useful in real environments. This paper presents a new transaction model named CovaTM, which provides sophisticated but flexible control over cooperative process as well as support for error recovery and exception handling. The most distinguished feature of this model is that user intervention is explicitly introduced into transaction processing. This paper details the features and structural elements of this model. An example is also given to illustrate how it works in real world settings.

Today, high volume of goods and services is being traded using online auction systems. The growth in size and complexity of architectures to support online auctions requires the use of distributed and cooperative software techniques. In this context, the agent software development paradigm seems ap-propriate both for their modeling, development and implementation. This chapter proposes an agent-oriented patterns analysis of best practices for online auction. The patterns are intended to help both IT managers and software engineers during the requirement specification of an on-line auction system while integrating benefits of agent software engineering.

A method for fault handling is presented, designed for multiprocessor systems supporting concurrent processes co-operating through message exchange. The proposal is described in reference to a specific system, i.e. the MuTEAM prototype developed in Pisa. The requirement was that no erroneous output should be generated by the system under a single-fault hypothesis. The fault-handling model adopted is based on backward error recovery. The set of all the application processes is partitioned into disjoint subsets (called families), which represent the atomic unit of recovery. Recovery points are established on communications among families. A single consistent recovery line is maintained, thereby avoiding the domino effect. The model does not rely on the use of mass storage devices; rather, the recovery information pertinent to all the processes is kept in the distributed main memory of the system.

This chapter focuses on the reliability of a specific class of systems on chip which are able to be reconfigured dynamically and partially. The possibility of using their Partial Dynamic Reconfiguration (PDR) capability for hardening applications on FPGAs is explored. We propose the use of checkpoint approaches and context restoration for tolerance against transient faults. PDR is used for managing the context of hardware tasks present on the application. The use of PDR reduces changes to the original system and therefore the complexity of the resulting system. After identifying the limitations of the “Backward Error Recovery” approach into SRAM-based FPGAs platforms, we propose a new resource placement algorithm on FPGA to minimize the access time needed by check-pointing and rolling back operations of hardware tasks. The evaluation of the overall reliability of this approach is achieved through fault injection campaigns on a demonstration platform running on a Virtex-5 that integrates the proposed reliability controller and hosts a data encryption application.

International audience

Component-based software systems built out of reusable software components are being used in a wide range of applications which have high dependability requirements. In order to accomplish the required levels of dependability, it is necessary to incorporate into these complex systems means for to cope with software faults. Exception handling is a well-known technique for adding forward error recovery to software systems supported by various mainstream programming languages. However, exception handling for component-based applications at the architectural level introduces new challenges which are not addressed by traditional exception handling systems, such as unavailability of source code, specially when off-the-shelf components are employed. In this paper, we present an exception handling system which adds fault tolerance to component-based systems at the architectural level. Our solution considers issues which are specific to component-based applications, such as unavailability of source code. We also present a framework which implements the proposed exception handling system for applications built using the C2 architectural style.KeywordsService RequestException HandlingArchitectural LevelDependable SoftwareClient ComponentThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

The growing need for transparency, security, and fairness in online auction systems has highlighted the limitations of conventional centralized platforms, which are often prone to data manipulation, fraudulent activities, and lack of trust among participants. This research proposes a Blockchain-powered E-Auction Platform that leverages smart contracts and decentralized ledger technology to ensure secure, transparent, and tamper-proof bidding processes To enhance user engagement and communication, the platform integrates an AI-powered chatbot that acts as an intelligent mediator between buyers and sellers. The chatbot assists users throughout the auction process—answering queries, providing product details, guiding new participants, and facilitating smooth negotiation, this ensure a proper negotiation and commnucication between the buyer and the seller at all points of time.