Zeitschriftenartikel: „Transaction systems (Computer systems)“

1

Кучук, Н. Г., Г. М. Зубрицький und Г. А. Кучук. „Resource distribution method in computer systems on integrated software platforms“. Системи обробки інформації, Nr. 1 (168) (10.02.2022): 36–42. http://dx.doi.org/10.30748/soi.2022.168.04.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

Computer Systems on Integrated Software Platforms are gaining popularity among users. They have a number of advantages over other platforms. In particular, this is a reduction in maintenance costs and the ability to quickly deploy additional Hardware & Software without stopping the system. But there are also a number of disadvantages. The most significant of these is an increase in the processing time for transactions of users using data warehouses. One of the directions of its solution is the formation of resource distribution, which is focused on minimizing resource costs. A mathematical model of resource distribution during transactions in CS on ISP is proposed. The distribution quality is determined by the criterion of minimizing the total transaction execution time. The admissible set of distributions is formed using the method of penalties for the execution of transactions. This further refines the integrated infrastructure. Simulation modeling of the process of distributing a computing resource with a selected plan made it possible to formulate requirements for the algorithm for solving the problem of scheduling transactions in an integrated environment. The proposed method also makes it possible to carry out operational rescheduling of transaction execution and reduce time costs when making operational changes to the transaction execution plan.

2

Polovina, Simon. „A Transaction-Oriented Architecture for Enterprise Systems“. International Journal of Intelligent Information Technologies 9, Nr. 4 (Oktober 2013): 69–79. http://dx.doi.org/10.4018/ijiit.2013100105.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

Many enterprises risk business transactions based on information systems that are incomplete or misleading, given that 80-85% of all corporate information remains outside of their processing scope. It highlights that the bulk of information is too unstructured for these systems to process, but must be taken into account if those systems are to provide effective support. Computer technology nonetheless continues to become more and more predominant, illustrated by SAP A.G. recognising that 65-70% of the world's transactions are run using their technology. Using SAP as an illustrative case study, and by bringing in the benefits of technologies such as Service-Oriented Architecture (SOA), Business Process Management (BPM), Enterprise Architecture Frameworks (EA) and Conceptual Structures, a practical roadmap is identified to a Transaction-Oriented Architecture (TOA) that is predicated on the Transaction Concept. This concept builds upon the Resources-Events-Agents (REA) modelling pattern that is close to business reality. Enterprise systems can thus better incorporate that missing 80-85% of hitherto too-unstructured information thereby allowing enterprise systems vendors such as SAP, their competitors, customers, suppliers and partners to do an ever better job with the world's transactions.

3

Marifati, Imam Soleh, und Vadlya Maarif. „Sistem Informasi Akuntansi Pemesanan dan Pembayaran (Ordering and Billing) Makanan dan Minuman Berbasis Android Pada RM. Ayam Goreng “Padamara” Purbalingga“. Indonesian Journal on Software Engineering (IJSE) 4, Nr. 2 (23.07.2019): 33–38. http://dx.doi.org/10.31294/ijse.v4i2.5978.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

Abstract - Ordering and billing transactions of food and beverages in a restaurant business are in the revenue cycle. Transactions in the revenue cycle have an important role for the company because from this transaction the company gets cash income. The use of information technology to support the transaction process can increase the effectiveness of the transaction process. Transactions can be processed quickly and accurately. Restaurant business can use accounting information systems to improve the effectiveness and efficiency of transaction processes in the revenue cycle. A computer-based accounting information system is needed in processing transactions. In this study, the authors developed the application of accounting information systems to process transactions in the revenue cycle for restaurant business activities. This application processes transaction data starting from ordering, payment and making revenue reports from restaurant business activities. Keywords: Order, Billing, Accounting Information System

4

RUSINKIEWICZ, MAREK, PIOTR KRYCHNIAK und ANDRZEJ CICHOCKI. „TOWARDS A MODEL FOR MULTIDATABASE TRANSACTIONS“. International Journal of Cooperative Information Systems 01, Nr. 03n04 (Dezember 1992): 579–617. http://dx.doi.org/10.1142/s0218215792000155.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

In many application areas the information that may be of interest to a user is stored under the control of multiple, autonomous database systems. To support global transactions in a multidatabase environment, we must coordinate the activities of multiple Database Management Systems that were designed for independent, stand-alone operation. The autonomy and heterogeneity of these systems present a major impediment to the direct adaptation of transaction management mechanisms developed for distributed databases. In this paper we introduce a transaction model designed for a multidatabase environment. A multidatabase transaction is defined by providing a set of (local) sub-transactions, together with their precedence and dataflow requirements. Additionally, the transaction designer may specify failure atomicity and execution atomicity requirements of the multidatabase transaction. These high-level specifications are then used by the scheduler of a multidatabase transaction to assure that its execution satisfies the constraints imposed by the semantics of the application. Uncontrolled interleaving of multidatabase transactions may lead to the violation of interdatabase integrity constraints. We discuss the issues involved in a concurrent execution of multidatabase transactions and propose a new concurrency control correctness criterion that is less restrictive than global serializability. We also show how the multidatabase SQL can be extended to allow the user to specify multidatabase transactions in a nonprocedural way.

5

Stewart, Brian H. „Transaction exchange management systems for successful systems integration“. Computers & Industrial Engineering 17, Nr. 1-4 (Januar 1989): 536–41. http://dx.doi.org/10.1016/0360-8352(89)90119-8.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Baldoni, R. „Consistent Checkpointing for Transaction Systems“. Computer Journal 44, Nr. 2 (01.02.2001): 92–100. http://dx.doi.org/10.1093/comjnl/44.2.92.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Appelbaum, Deniz, und Robert A. Nehmer. „Auditing Cloud-Based Blockchain Accounting Systems“. Journal of Information Systems 34, Nr. 2 (25.10.2019): 5–21. http://dx.doi.org/10.2308/isys-52660.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

ABSTRACT In this research, we often refer to Nakamoto's (2008) seminal paper, “Bitcoin: A Peer-to-Peer Electronic Cash System,” to consider his proposed abstracted characteristics and how auditors could look at companies' transactions interfacing to a private/semi-private blockchain with Nakamoto's general characteristics and address the related audit domain for such transactions. We then take these design requirements for auditors and, using design science research (DSR), we consider the transaction processing and contracting contexts that match those requirements in permissioned blockchains.The blockchains discussed in this paper would typically be business-to-business or business-to-consumer, private or semi-private, and residing in either a private, semi-private, or public cloud. Those blockchains will each have their own design and operational procedures, including validation procedures (the miners). We consider the audit issues of data reliability, data security, and transaction transparency in accounting transactions that lend themselves to a permissioned blockchain as well as other contextual issues.

8

Raza, Zeeshan, Irfan ul Haq, Muhammad Muneeb und Omair Shafiq. „Energy Efficient Multiprocessing Solo Mining Algorithms for Public Blockchain Systems“. Scientific Programming 2021 (31.10.2021): 1–13. http://dx.doi.org/10.1155/2021/9996132.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

Blockchain as a decentralized distributed ledger is revolutionizing the world with a secure design data storage mechanism. In the case of Bitcoin, mining involves a process of packing transactions in a block by calculating a random number termed as a nonce. The nonce calculation is done by special nodes called miners, and all the miners follow the Proof of Work (PoW) mining mechanism to perform the mining task. The transaction verification time in PoW-based blockchain systems, i.e., Bitcoin, is much slower than other digital transaction systems such as PayPal. It needs to be quicker if a system adapts PoW-based blockchain solutions, where there are thousands of transactions being computed at a time. Besides this, PoW mining also consumes a lot of energy to calculate the nonce of a block. Mining pools resulting into aggregated hashpower have been a popular solution to speed up the PoW mining, but they can be attacked by using different types of attacks. Parallel computing can be used to speed up the solo mining methods by utilizing the multiple processes of the contributing processors. In this research, we analyze various consensus mechanisms and see that the PoW-based blockchain systems have the limitations of low transaction confirmation time and high energy consumption. We also analyze various types of consensus layer attacks and their effects on miners and mining pools. To tackle these issues, we propose parallel PoW nonce calculation methods to accelerate the transaction verification process especially in solo mining. We have tested our techniques on different difficulty levels, and our proposed techniques yield better results than the traditional nonce computation mechanisms.

9

Alekhin, V. A. „Designing Electronic Systems Using SystemC and SystemC–AMS“. Russian Technological Journal 8, Nr. 4 (06.08.2020): 79–95. http://dx.doi.org/10.32362/2500-316x-2020-8-4-79-95.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

Current trends in the design of electronic systems is the use of embedded systems based on systems on a chip (System-on-Chip (SoC)) or (VLSI SoC). The paper discusses the design features of electronic systems on a chip using the SystemC design and verification language. For the joint design and simulation of digital systems hardware and software, seven modeling levels are presented and discussed: executable specification, disabled functional model, temporary functional model, transaction-level model, behavioral hardware model, accurate hardware model, register transfer model. The SystemC design methodology with functional verification is presented, which reduces development time.The architecture of the SystemC language and its main components are shown. The expansion of SystemC–AMS for analog and mixed analog-digital signals and its use cases in the design of electronic systems are considered. Computing models are discussed: temporary data stream (TDF), linear signal stream (LSF) and electric linear networks (ELN). The architecture of the SystemC–AMS language standard is shown and examples of its application are given. It is shown that the design languages SystemC and SystemC–AMS are widely used by leading developers of computer-aided design systems for electronic devices.

10

SCHWARZ, KERSTIN, CAN TÜRKER und GUNTER SAAKE. „INTEGRATING EXECUTION DEPENDENCIES INTO THE TRANSACTION CLOSURE FRAMEWORK“. International Journal of Cooperative Information Systems 08, Nr. 02n03 (Juni 1999): 111–38. http://dx.doi.org/10.1142/s0218843099000071.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

The transaction closure framework provides means to describe and reason about different kind of dependencies between interrelated transactions. In this paper, we investigate execution dependencies for describing certain control flows among related transactions of a transaction closure. In particular, we consider the transitivity property for all kinds of transaction execution dependencies and present a complete and minimal set of rules for reasoning about the transitivity of execution dependencies. Furthermore, we analyze the relationship between execution and termination dependencies and point out that some dependency combinations are incompatible. Using derived transitive dependencies, we are able to conclude how arbitrary transactions of a transaction closure are transitively interrelated and, thus, to detect contradictory dependency specifications as well as superfluous transactions.

11

Bai, Tian, Zhijie Li und Bo Fan. „Multiprocessor Scheduling of Sensor Transactions for Real-Time Data Quality Maintenance“. Mobile Information Systems 2020 (21.09.2020): 1–13. http://dx.doi.org/10.1155/2020/8834383.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

In cyber-physical systems, sensor transactions should be effectively scheduled to maintain the temporal validity of real-time data objects. Previous studies on sensor transaction scheduling mainly focus on uniprocessor systems. In this paper, we study the problem of data quality-based scheduling of sensor transactions on multiprocessor platforms. The data quality is defined to describe the validity degree of real-time data objects. Two methods, named the Partitioned Scheduling for Quality Maximization (P-QM) and the improved P-QM scheduling (IP-QM), are proposed. P-QM maximizes the data quality by judiciously determining the preallocated computation time of each sensor transaction and assigns the transactions to different processors. IP-QM improves the data quality obtained from P-QM by adaptively executing transaction instances on each processor based on the current status of the system. It is demonstrated through experiments that IP-QM can provide higher data quality than P-QM under different system workloads.

12

BOCCHI, LAURA, und EMILIO TUOSTO. „Attribute-based transactions in service oriented computing“. Mathematical Structures in Computer Science 25, Nr. 3 (10.11.2014): 619–65. http://dx.doi.org/10.1017/s0960129512000904.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

We present a theory for the design and verification of distributed transactions in dynamically reconfigurable systems. Despite several formal approaches have been proposed to study distributed transactional behaviours, the inter-relations between failure propagation and dynamic system reconfiguration still need investigation. We propose a formal model for transactions in service oriented architectures (SOAs) inspired by the attribute mechanisms of the Java Transaction API. Technically, we model services in ATc (after ‘Attribute-basedTransactionalcalculus’), a CCS-like process calculus where service declarations are decorated with atransactional attribute. Such attribute disciplines, upon service invocation, how the invoked service is executed with respect to the transactional scopes of the invoker. A type system ensures that well-typed ATc systems do not exhibit run-time errors due to misuse of the transactional mechanisms. Finally, we define a testing framework for distributed transactions in SOAs based on ATc and prove that under reasonable conditions some attributes are observationally indistinguishable.

13

HWANG, JUNSEOK, SO YOUNG KIM, HAK-JIN KIM und JIHYOUN PARK. „AN OPTIMAL TRUST MANAGEMENT METHOD TO PROTECT PRIVACY AND STRENGTHEN OBJECTIVITY IN UTILITY COMPUTING SERVICES“. International Journal of Information Technology & Decision Making 10, Nr. 02 (März 2011): 287–308. http://dx.doi.org/10.1142/s0219622011004336.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

Utility computing services constitute business opportunities in the customer-to-customer (C2C) marketplace. Providers deal with the risks and uncertainties faced by users while transacting with unfamiliar counterparts. Ensuring trustworthy transactions among unfamiliar users is an important condition of utility-computing service. Many peer-to-peer (P2P) sites utilize reputation systems; however, such systems are subject to lack of reviewer objectivity and robustness against attacks as well as unfair ratings. In this study, we propose the manual adjustment of reputation ratings by means of transaction monitoring and establish that the resulting enhanced objectivity and robustness in utility-computing service transactions will strengthen the trust management system. We also propose the optimal level of monitoring and penalizing activities based on the level of privacy concerns among users and the appropriate complementary service.

14

Khan, Mohammad Monirujjaman, Nesat Tasneem RoJa, Faris A. Almalki und Maha Aljohani. „Revolutionizing E-Commerce Using Blockchain Technology and Implementing Smart Contract“. Security and Communication Networks 2022 (31.05.2022): 1–8. http://dx.doi.org/10.1155/2022/2213336.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

The days of storing data manually are behind us. We are opting for the online form of data storage and transfer. The new era of data digitization comes with its own perks and detriments. Cybersecurity is still a crucial concern today. As more data transfer occurs through an online medium, the risks of a breach and cyberattacks are inevitable. The whole foundation of e-commerce is based on the online transfer of goods and transactions without the need to travel. Transferring transactional data and transactions in e-commerce are prone to cyber threats. Our research’s major objective is to develop a system that protects against such mishaps, especially during the transfer of transactional data, and also implement an automated system that ensures these transactions occur without any errors. To implement this, we are taking advantage of new emerging technologies called blockchain and smart contract. Blockchain allows a decentralized, immutable digital ledger to safely store and transfer data across the network. Blockchain technology is used in e-commerce to transfer transactions in a safe, secure, and faster way. Blockchain enables a peer-to-peer transaction system and data encryption that enables the safe transfer of transactional data. Blockchain is used to transfer transactional data. A smart contract is a special program that enables, verifies, and enforces the terms of a contract digitally. It provides transactional security as the contact is in place. The blockchain, coupled with smart contracts, will revolutionize the future of e-commerce. We have combined blockchain technology to ensure data security and user privacy with smart contracts to ensure that the protocol for the transaction is maintained. The results are presented by building and implementing the proposed system that provides the solution for transactional data privacy.

15

Murthy, Uday S., und Guido L. Geerts. „An REA Ontology-Based Model for Mapping Big Data to Accounting Information Systems Elements“. Journal of Information Systems 31, Nr. 3 (01.05.2017): 45–61. http://dx.doi.org/10.2308/isys-51803.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

ABSTRACT The term “Big Data” refers to massive volumes of data that grow at an increasing rate and encompass complex data types such as audio and video. While the applications of Big Data and analytic techniques for business purposes have received considerable attention, it is less clear how external sources of Big Data relate to the transaction processing-oriented world of accounting information systems. This paper uses the Resource-Event-Agent Enterprise Ontology (REA) (McCarthy 1982; International Standards Organization [ISO] 2007) to model the implications of external Big Data sources on business transactions. The five-phase REA-based specification of a business transaction as defined in ISO (2007) is used to formally define associations between specific Big Data elements and business transactions. Using Big Data technologies such as Apache Hadoop and MapReduce, a number of information extraction patterns are specified for extracting business transaction-related information from Big Data. We also present a number of analytics patterns to demonstrate how decision making in accounting can benefit from integrating specific external Big Data sources and conventional transactional data. The model and techniques presented in this paper can be used by organizations to formalize the associations between external Big Data elements in their environment and their accounting information artifacts, to build architectures that extract information from external Big Data sources for use in an accounting context, and to leverage the power of analytics for more effective decision making.

16

Krumeich, Julian, Timo Bredehöft, Dirk Werth und Peter Loos. „Computer-Assisted E-Customs Transactions“. International Journal of Electronic Government Research 11, Nr. 1 (Januar 2015): 21–38. http://dx.doi.org/10.4018/ijegr.2015010102.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

E-government aims to ease administrative processes based on an electronic handling. While larger enterprises can often benefit from electronically integrated governmental transaction services, small and medium-sized enterprises (SME) regularly face certain obstacles. For instance, this can be observed in the context of e-customs transactions. According to a United Nations study, an inefficient customs clearance is responsible for 7% of international trade costs. Hence, governments across the world aimed to reduce administrative burdens by introducing electronic customs systems. The paper at hand examines existing approaches of electronically declaring exports to e-customs systems focusing the German ATLAS system. Based on an evaluation regarding the appropriateness of existing approaches from the perspective of SME, the paper concludes that none of them sufficiently meets their specific requirements. To tackle this status-quo, the paper presents the concept of computer-assisted e-customs transactions as well as the EXPORT system, which is a prototypical implementation of the proposed concept.

17

Kozaczynski, Wojtek, und Norman Wilde. „On the re-engineering of transaction systems“. Journal of Software Maintenance: Research and Practice 4, Nr. 3 (September 1992): 143–62. http://dx.doi.org/10.1002/smr.4360040304.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Marifati, Imam Soleh, und Ubaidillah Ubaidillah. „Sistem Informasi Akuntansi Siklus Pendapatan Pada Usaha Bengkel Budi Barokah Sokaraja“. Indonesian Journal on Software Engineering (IJSE) 5, Nr. 1 (28.06.2019): 44–51. http://dx.doi.org/10.31294/ijse.v5i1.5863.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

Abstract: Computer-based accounting information systems can be used by companies to improve the efficiency, effectiveness and accuracy of the processes of business transactions that occur in the company. The income accounting cycle which is one of the cycles in an accounting information system needs attention because this cycle produces revenue transactions which are a financial source for the company. The use of computer-based systems in this cycle can also provide added value in the form of improving services to customers. To implement a computer-based accounting information system, a software is needed to process revenue transactions. In this study, the authors developed an application of accounting information systems to process transactions in the income cycle found in vehicle workshop businesses. This application processes transaction data starting from ordering repair services, recording spare parts usage, repair service fees, bill payments and and making income reports on workshop business activities. Keywords: revenue cycle, repairation service, accounting information system

19

Suardana, Ida Bagus Raka, Luh Kadek Budi Martini, Nyoman Sri Subawa und Made Setini. „Quality factors in technology system capability decision interest in transactions using mobile banking“. International Journal of Data and Network Science 6, Nr. 1 (2022): 1–8. http://dx.doi.org/10.5267/j.ijdns.2021.11.003.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

The purpose of this study was to determine the effect of ease of use, transaction success rate, and technological system capability on trust and to determine the effect of ease of use, transaction success rate, technology system capability and interest in transaction using mobile banking. This research was conducted at PT Bank NIAGA which is located in Denpasar. The data collection technique used a questionnaire to 160 PT Bank NIAGA customers who were selected as samples. Data were analyzed by Structural Equation Modeling (SEM) with AMOS program. Ease of use, transaction success rate, and technology system capability have a positive and significant influence on trust and interest in transacting using mobile banking. This means that the better the ease of use, the success rate of transactions, and the capability of the technology system, the higher the customer trust and interest in transactions using mobile banking.

20

Xie, Yi-Yang, Xiu-Bo Chen und Yi-Xian Yang. „A New Lattice-Based Blind Ring Signature for Completely Anonymous Blockchain Transaction Systems“. Security and Communication Networks 2022 (01.09.2022): 1–12. http://dx.doi.org/10.1155/2022/4052029.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

Blockchain technology has been widely applied in numerous industries with its decentralization, verifiability, distributivity, and immutability. However, the identity privacy security of blockchain users is facing serious threats because of the openness of traditional blockchain transaction information. Moreover, numerous traditional cryptographic algorithms used by blockchain transaction networks are difficult to attack quantum computing. In this paper, we propose a new lattice-based blind ring signature scheme in allusion to completely anonymous blockchain transaction systems. There into, the blind ring signature can implement the complete anonymity of user identity privacy in blockchain transactions. Meanwhile, lattice cryptography can availably resist quantum computing attacks. Firstly, the proposed signature scheme has strong computational security based on the small integer solution (SIS) problem and a high sampling success rate by utilizing the techniques of rejection sampling from bimodal Gaussian distribution. Secondly, the proposed signature scheme can satisfy the correctness and security under the random oracle model, including anonymity, blindness, and one-more unforgeability. Thirdly, we construct a blockchain transaction system based on the proposed blind ring signature algorithm, which realizes the completely anonymous and antiquantum computing security of the blockchain users’ identity privacy. Finally, the performance evaluation results show that our proposed blind ring signature scheme has lower latency, smaller key size, and signature size than other similar schemes.

21

Saba, Farhad. „Concepts: Integrated telecommunications systems and instructional transaction“. American Journal of Distance Education 2, Nr. 3 (Januar 1988): 17–24. http://dx.doi.org/10.1080/08923648809526632.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Chen, Lei, und Yanbin Tu. „Enhancing Online Auction Transaction Likelihood“. International Journal of E-Business Research 15, Nr. 2 (April 2019): 116–32. http://dx.doi.org/10.4018/ijebr.2019040107.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

This article compares four data mining models (discriminant analysis, logistic regression, decision tree, and multilayer neural networks) for online auction transaction predictions. It aims to choose the best model in terms of prediction accuracy and to identify determinants significant for auction transactions. By using datasets from eBay, the authors find that the best data mining model for auction transactions is multilayer neural networks. Logistic regression and decision tree models can be used to identify determinants significant for auction transaction such as seller's feedback profile, listing picture, listing files size, return policies, and others. By adjusting these listing options, sellers could increase the auction transaction likelihood. This study will help sellers improve their auction listings by constructing effective selling strategies so that they can enhance the likelihood of online auction transactions. All these efforts will help improve their online auction performances and finally lead to a more efficient electronic marketplace.

23

Kolobanova, M. S., S. M. Klyushin, V. K. Kozlov und T. N. Prokopenko. „COMPREHENSIVE APPROACH TO MODELING AND CONSTRUCTION OF FUNCTIONAL DEVICES BASED ON SPACEWIRE CONTROLLERS AND SPACEFIBRE CONTROLLERS OF MULTICOR SERIES“. Issues of radio electronics, Nr. 8 (20.08.2018): 124–32. http://dx.doi.org/10.21778/2218-5453-2018-8-124-132.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

Proposed is an effective integrated approach to the modelling of functional units (FU), on-board computers and embedded systems at the hardware development phase. It is applicable to enterprises with a complete production cycle of industrial systems, including on-board control and information processing devices, space and aeronautical systems and others. In the traditional approach, the driver and on-board software (BPO) are debugged and verified after the manufacture of the product or computer, which significantly increases the lead time for the finished product. The complex approach to modeling the hardware at the transaction level [1] using the SystemC library [2], encapsulating the work with the driver with SpaceWire and SpaceFibre controllers allows to speed up the development of FU and computers, as well as to detect a number of errors and limitations of the system being designed.

24

Alqahtani, Mohammed, und Aad van Moorsel. „Risk Assessment Methodology For EMV Financial Transaction Systems“. Electronic Notes in Theoretical Computer Science 340 (Oktober 2018): 137–50. http://dx.doi.org/10.1016/j.entcs.2018.09.010.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Kang, I. E., und T. F. Keefe. „Reliable Nested Transaction Processing for Multidatabase Systems“. Integrated Computer-Aided Engineering 2, Nr. 1 (01.01.1995): 49–67. http://dx.doi.org/10.3233/ica-1995-2105.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Coronado, Jose Jaime Arana, Jos Bijman, Onno Omta und Alfons Oude Lansink. „Relationship characteristics and performance in fresh produce supply chains: the case of the Mexican avocado industry“. Journal on Chain and Network Science 10, Nr. 1 (01.01.2010): 1–15. http://dx.doi.org/10.3920/jcns2010.x101.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

Inter-organisational relations research has shown that relationship characteristics can influence performance in seller-buyer transactions. Using a transaction cost economics approach, this research shows that relational elements such as expectation of continuity reduce the transaction risks related to behavioural uncertainty or asset specificity. However, transaction costs are not only caused by transaction risks but also by the need to coordinate the individual activities of the buyer and the seller. Inter-organisational coordination is important in transactions with perishable products and products with credence attributes, such as in fresh produce supply chains. To study the impact of different relationship characteristics on the efficiency of transactions in a fresh produce supply chain, we collected and analyzed data from 122 avocado producers in Mexico. We found that information exchange and producer expectation of continuity of the relationship positively affect performance in the seller-buyer transaction. While expectation of continuity leads to lower transaction costs associated with behavioural uncertainty, information exchange facilitates the efficient alignment of interdependent activities.

27

Irawan, Yuda. „Sistem Informasi Pengadaan Peralatan dan Perlengkapan Kantor pada Dinas Kehutanan Propinsi Riau Berbasis Web“. JTIM : Jurnal Teknologi Informasi dan Multimedia 1, Nr. 1 (14.05.2019): 45–48. http://dx.doi.org/10.35746/jtim.v1i1.13.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

In the development of increasingly advanced and sophisticated technology, tools are needed that help facilitate a job, one of which is a computer. Computers are the main choice in the progress of agencies in general because an agency aims to maximize agencies can grow and develop as expected. Designing Procurement Information Systems for Web-Based Office Equipment and Supplies is to provide complete information about Procurement of Office Equipment, Procurement Information Systems Equipment and Office Supplies at Riau Province Forestry Services Using PHP and MySQL database is a software that can be used to process equipment data office where transaction reports for ATK request transactions, ATK stock reduction can be known every day automatically if all transactions have been sent to the system. Thus work from the Finance and Equipment Section can be helped and will make time effective

28

Domb, M. A. „Transaction independence: The road to cooperative systems“. Mathematical and Computer Modelling 29, Nr. 1 (Januar 1999): 1–31. http://dx.doi.org/10.1016/s0895-7177(98)00176-9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Suomi, R. „Removing transaction costs with interorganizational information systems“. Information and Software Technology 33, Nr. 3 (April 1991): 205–11. http://dx.doi.org/10.1016/0950-5849(91)90135-x.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Wang, Yan, Jixin Li, Wansheng Liu und Aiping Tan. „Efficient Concurrent Execution of Smart Contracts in Blockchain Sharding“. Security and Communication Networks 2021 (18.02.2021): 1–15. http://dx.doi.org/10.1155/2021/6688168.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

Throughput performance is a critical issue in blockchain technology, especially in blockchain sharding systems. Although sharding proposals can improve transaction throughput by parallel processing, the essence of each shard is still a small blockchain. Using serial execution of smart contract transactions, performance has not significantly improved, and there is still room for improvement. A smart contract concurrent execution strategy based on concurrency degree optimization is proposed for performance optimization within a single shard. This strategy is applied to each shard. First, it characterizes the conflicting contract feature information by executing a smart contract, analyzing the factors that affect the concurrent execution of the smart contracts, and clustering the contract transaction. Second, in shards with high transaction frequency, considering the execution time, conflict rate, and available resources of contract transactions, finding a serializable schedule of contract transactions by redundant computation and a Variable Shadow Speculative Concurrency Control (SCC-VS) algorithm for smart contract scheduling is proposed. Finally, experimental results show that the strategy increases the concurrency of smart contract execution by 39% on average and the transaction throughput of the whole system by 21% on average.

31

Chen, Runyu, Lunwen Wang, Chuang Peng und Rangang Zhu. „An Effective Sharding Consensus Algorithm for Blockchain Systems“. Electronics 11, Nr. 16 (19.08.2022): 2597. http://dx.doi.org/10.3390/electronics11162597.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

Sharding is the widely used approach to the trilemma of simultaneously achieving decentralization, security, and scalability in traditional blockchain systems. However, existing schemes generally involve problems such as uneven shard arithmetic power and insecure cross-shard transaction processing. In this study, we used the Practical Byzantine Fault Tolerance (PBFT) as the intra-shard consensus and, here, we propose a new sharding consensus mechanism. Firstly, we combined a jump consistent hash algorithm with signature Anchorhash to minimize the mapping of the node assignment. Then, we improved the process of the cross-shard transaction and used the activity of nodes participating in intra-shard transactions as the criterion for the shard reconfiguration, which ensured the security of the blockchain system. Meanwhile, we analyzed the motivation mechanism from two perspectives. Finally, through theoretical analysis and related experiments, we not only verified that the algorithm can ensure the security of the entire system, but also further clarified the necessary conditions to ensure the effectiveness of the shards and the system on the original basis.

32

Jiang, Yi, Xu Liu und Jun Dai. „A Novel Pricing Mechanism for User Coalition in Blockchain“. Wireless Communications and Mobile Computing 2020 (28.11.2020): 1–12. http://dx.doi.org/10.1155/2020/8885179.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

As the blockchain platform is widely used as a new trading way, both participants and transaction volume in the blockchain projects have been growing by leaps and bounds. The generic mechanisms of ranking transaction priorities are heavily dependent on the transaction fees the users append into each transaction; then, all transactions are ranked in the nonincreasing order according to the transaction fee amounts, and the selected transactions will be packed into a new created block in order based on the ranking results. However, more complex influence factors more than transaction fees on transaction priority ranking results are not taken into consideration in the generic transaction priority ranking mechanisms, and a single user is the objective to create transactions in these mechanisms. In order to optimize the generic transaction priority ranking mechanisms and enrich transaction creation modes, a novel user-coalition-based transaction pricing mechanism (UCTPM) is proposed, and the user coalition quality score, user coalition contribution degree, and the transaction type demand degree are formulated and introduced into the UCTPM mechanism. Our research findings indicate that the UCTPM mechanism satisfies the economic attributes of budget balanced, individual rationality, and incentive compatibility when the user coalition contribution degree increases through theoretical proof and experimental analysis. Moreover, the UCTPM mechanism allows all the transactions to be processed more efficiently by experimental analysis.

33

Sriratanaviriyakul, Narumon, Mathews Nkhoma und Hiep Pham. „Osaka Flower Coffee Shop: Transaction Processing Systems“. Journal of Information Technology Education: Discussion Cases 2 (2013): 08. http://dx.doi.org/10.28945/1879.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Johannsen, Wolfgang. „Transaction models for federative distributed database systems“. Future Generation Computer Systems 7, Nr. 2-3 (April 1992): 329–37. http://dx.doi.org/10.1016/0167-739x(92)90020-c.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Lim, J. B., und A. R. Hurson. „Transaction processing in mobile, heterogeneous database systems“. IEEE Transactions on Knowledge and Data Engineering 14, Nr. 6 (November 2002): 1330–46. http://dx.doi.org/10.1109/tkde.2002.1047771.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Tu, M., P. Li, L. Xiao, I. L. Yen und F. B. Bastani. „Replica placement algorithms for mobile transaction systems“. IEEE Transactions on Knowledge and Data Engineering 18, Nr. 7 (Juli 2006): 954–70. http://dx.doi.org/10.1109/tkde.2006.114.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Henglein, Fritz, Ken Friis Larsen, Jakob Grue Simonsen und Christian Stefansen. „POETS: Process-oriented event-driven transaction systems“. Journal of Logic and Algebraic Programming 78, Nr. 5 (Mai 2009): 381–401. http://dx.doi.org/10.1016/j.jlap.2008.08.007.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Sianturi, Fricles Ariwisanto. „ANALISA PENGARUH LOG TRANSAKSI PADA SISTEM KOMPUTER MENGGUNAKAN ALGORITMA RECOVERY BERBASIS LOG“. Journal Of Computer Networks, Architecture and High Performance Computing 1, Nr. 1 (18.12.2018): 6–9. http://dx.doi.org/10.47709/cnapc.v1i1.2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

This study aims to melakukakan analysis of the effect of the transaction log on a computer based system either on a single system tired, and two tiered through simulated transactions bank system with technology client / server to get a log of transactions on the database system Microsoft Windows SQL Server 2008 R2 management studio a data base. Methods or algorithms are used to analyze the transaction log on the system used is a log-based recovery algorithm.The results based on the analysis, showed that the use of query local database and query the database using sotere procedure to get the transaction log for troubleshooting transactions on the database system via a user interface is built to help job database administrator (DBA), much more good compared with conventional systems. Based on the experiments that the log of transactions to be controlled, in-undo, Re-do, or Rolled-Back, even deleted if no longer required automatically to maintain the scalability of computer users in the future, by setting the growth of a standard database from 10% to > 32%, and the establishment of a maintenance schedule to ensure that the reserve database is always available and up to date.

39

Ilk, Noyan, Guangzhi Shang, Shaokun Fan und J. Leon Zhao. „Stability of Transaction Fees in Bitcoin: A Supply and Demand Perspective“. MIS Quarterly 45, Nr. 2 (01.06.2021): 563–692. http://dx.doi.org/10.25300/misq/2021/15718.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

Cryptocurrencies such as Bitcoin are breakthrough financial technologies that promise to revolutionize the digital economy. Unfortunately, their long-term adoption in the business world is imperiled by a lack of stability that manifests as dramatic swings in transaction fees and severe participant dissatisfaction. To date, there has been little academic effort to study how system participants react to volatility in fee movements. Our study addresses this research gap by conceptualizing the Bitcoin platform as a data space market and studying how market equilibrium forms between users who demand data space while trying to avoid transaction delays, and miners who supply data space while trying to maximize fee revenues. Our empirical analysis based on past bitcoin transactions reveals the existence of a relatively flat downward-sloping demand curve and a much steeper upward-sloping supply curve. Regarding users, the inelastic nature of demand signals the utility of Bitcoin as a niche platform for transactions that are otherwise difficult to conduct. This result challenges the belief that users may easily abandon Bitcoin technology given rising transaction costs. We also find that the use of bitcoins as a trading asset is associated with higher levels of tolerance to fees. Regarding miners, the comparatively elastic nature of supply indicates that higher fees stimulate mining by a larger magnitude than suppressing demand. This finding implies that, ceteris paribus, the Bitcoin system turns to self-regulate transaction fees in an efficient manner. Our work has implications for the management of congestion in blockchain-based systems and more broadly for the stability of cryptocurrency markets.

40

Bodorik, P. „Multi-View Memory Support to Operating Systems in Locking for Transaction and Database Systems“. Computer Journal 41, Nr. 2 (01.02.1998): 84–97. http://dx.doi.org/10.1093/comjnl/41.2.84.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Helmstetter, C., F. Maraninchi und L. Maillet-Contoz. „Full simulation coverage for SystemC transaction-level models of systems-on-a-chip“. Formal Methods in System Design 35, Nr. 2 (09.06.2009): 152–89. http://dx.doi.org/10.1007/s10703-009-0075-z.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Xu, De, und Qing Yang. „The Systems Approach and Design Path of Electronic Bidding Systems Based on Blockchain Technology“. Electronics 11, Nr. 21 (28.10.2022): 3501. http://dx.doi.org/10.3390/electronics11213501.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

The electronic tendering and bidding system has realized the digitalization, networking, and high integration of the whole process of tendering, bidding, bid evaluation, and contract, which has a wide range of applications. However, the trust degree, cooperation, and transaction efficiency of the parties involved in electronic bidding are low, and bidding fraud and collusion are forbidden repeatedly. Blockchain technology has the characteristics of decentralization, transparent transactions, traceability, non-tampering and forgery detection, and data security. This paper proposes a design path of an electronic bidding system based on blockchain technology, which aims to solve the efficiency, trust, and security of the electronic trading process. By building the underlying architecture platform of blockchain and embedding the business process of electronic bidding, this realizes the transparency, openness, and traceability during the whole process of electronic bidding. This paper uses qualitative and quantitative methods to prove the effectiveness of the system.

43

Yu, Z., Y. Zuo und W. C. Xiong. „Concurrency Bug Avoiding Based on Optimized Software Transactional Memory“. Scientific Programming 2019 (03.02.2019): 1–19. http://dx.doi.org/10.1155/2019/9404323.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

Software transactional memory is an effective mechanism to avoid concurrency bugs in multithreaded programs. However, two problems hinder the adoption of such traditional systems in the wild world: high human cost for equipping programs with transaction functionality and low compatibility with I/O calls and conditional variables. This paper presents Convoider to solve these problems. By intercepting interthread operations and designating code among them as transactions in each thread, Convoider automatically transactionalizes target programs without any source code modification and recompiling. By saving/restoring stack frames and CPU registers on beginning/aborting a transaction, Convoider makes execution flow revocable. By turning threads into processes, leveraging virtual memory protection and customizing memory allocation/deallocation, Convoider makes memory manipulations revocable. By maintaining virtual file systems and redirecting I/O operations onto them, Convoider makes I/O effects revocable. By converting lock/unlock operations to no-ops, customizing signal/wait operations on condition variables, and committing memory changes transactionally, Convoider makes deadlocks, data races, and atomicity violations impossible. Experimental results show that Convoider succeeds in transparently transactionalizing twelve real-world applications with averagely incurring only 28% runtime overhead and perfectly avoid 94% of thirty-one concurrency bugs used in our experiments. This study can help efficiently transactionalize legacy multithreaded applications and effectively improve the runtime reliability of them.

44

Li, Rong, Shangping Wang und Na Xie. „A Novel Epoch-Based Transaction Consistency Sorting Protocol for DAG Distributed Ledger“. Security and Communication Networks 2022 (08.12.2022): 1–13. http://dx.doi.org/10.1155/2022/3930858.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

Because of the characteristics of decentralization, immutability, and transparency, blockchain has gradually become a new and revolutionary technology, which has far-reaching significance for the development of modern technology. However, the traditional Bitcoin blockchain that supports synchronous consensus suffers from the fatal flaw of low throughput. To improve throughput, a number of DAG distributed ledgers have been proposed that support asynchronous consensus, all of which allow multiple nodes to process concurrent transactions asynchronously. However, most DAG distributed ledgers do not implement consistent sorting of transactions, making it difficult to deploy smart contracts. To overcome this problem, in this paper, an epoch-based transaction consistency sorting protocol for DAG distributed ledger is proposed, which not only provides the possibility for the deployment of smart contracts but also can be used to resolve conflicting transactions in the ledger. Transaction consistency sorting protocol provides a more reasonably ordered list of all transactions by taking scalars, such as the set of their own past and future, parent block, and timestamp. In addition, through theoretical analysis, the stability and rationality of the transaction consistency sorting protocol are proved, and there is no Condorcet cycle. Finally, the simulation results demonstrate the protocol is efficient and achieve a throughput of at least 2000 transactions per second.

45

GREFEN, PAUL, und JOCHEM VONK. „A TAXONOMY OF TRANSACTIONAL WORKFLOW SUPPORT“. International Journal of Cooperative Information Systems 15, Nr. 01 (März 2006): 87–118. http://dx.doi.org/10.1142/s021884300600130x.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

Structured business processes are the veins of complex business organizations. Workflows have generally been accepted as a means to model and support these processes, be they interactive or completely automated. The fact that these processes require robustness and clear semantics has generally been observed and has led to the combination of workflow and transaction concepts. Many variations on this combination exist, leading to many approaches to transactional workflow support. No clear classification of these approaches has been developed, however, resulting in a badly understood field. To deal with this problem, we describe a clear taxonomy of transactional workflow models in this paper, based on the relation between workflow and transaction concepts. We show that the classes in the taxonomy can be directly related to specification language and architecture types for workflow and transaction management systems. We compare the various classes with respect to their characteristics and place existing approaches in the taxonomy. We cover both "traditional" workflow approaches and more recent web-based approaches, including inter-organizational workflow approaches. Together, this paper offers a well-structured and concise analysis of the field of transactional business process support.

46

Wever, Mark, Nel Wognum, Jacques Trienekens und Onno Omta. „Managing transaction risks in interdependent supply chains: an extended transaction cost economics perspective“. Journal on Chain and Network Science 12, Nr. 3 (01.01.2012): 243–60. http://dx.doi.org/10.3920/jcns2012.x214.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

The present study examines the management of transaction risks in supply chains. Risk management studies often ignore the wider supply chain context in which individual transactions take place. However, risk management strategies which are suitable to use when only a single transaction is considered may be inappropriate when other transactions in the supply chain are taken into account. This study addresses this issue by examining: (1) how risks arise as a result of interdependencies between the various transactions making up the supply chain; and (2) what types of contractual-based strategies actors can use to manage their risk exposure. To realize these aims, the study applies an extended Transaction Cost Economics (TCE) framework with a supply chain orientation. The framework illustrates how different types of interdependencies - pooled, sequential and reciprocal - expose companies to different sources of risk. Three strategies companies can use when facing barriers to risk minimization in sequentially interdependent supply chains are analyzed: risk transferring, risk altering and risk sharing. Examples from the agri-food sector are discussed to demonstrate the functioning of these strategies.

47

GEORGAKOPOULOS, DIMITRIOS, und MARK F. HORNICK. „A FRAMEWORK FOR ENFORCEABLE SPECIFICATION OF EXTENDED TRANSACTION MODELS AND TRANSACTIONAL WORKFLOWS“. International Journal of Cooperative Information Systems 03, Nr. 03 (September 1994): 225–53. http://dx.doi.org/10.1142/s0218215794000144.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

A variety of extensions to the traditional (ACID) transaction model have resulted in a plethora of extended transaction models (ETMs). Many of these ETMs are application-specific, i.e. they are designed to provide correctness guarantees adequate for a particular application, but not others. Similarly, an application-specific ETM may impose restrictions that are unacceptable in one application, yet required in another. To define new ETMs, to determine whether an ETM is appropriate for an application, and to integrate ETMs to produce new ETMs, we need a framework for ETM specification and reasoning. In this paper, we describe such a framework. Our framework supports implementation-independent specification of ETMs described in terms of dependencies between transactions. Dependencies are specified using dependency descriptors. Unlike other transaction specification frameworks, dependency descriptors use a common set of primitives, and are enforceable, i.e. can be evaluated at any time during transaction execution to determine whether issued operations violate ETM specifications. We discuss specifications of (i) structure dependencies between transaction states, and (ii) correctness dependencies for serializability, various cooperative and temporal correctness criteria, and recoverability. We give ETM specification examples for a telecommunications application illustrating the definition of a new application-specific ETM using our framework.

48

Sidiq, Muhammad Iqbal, und Darius Antoni. „Mengidentifikasi Kebutuhan Sistem Penerimaan Mahasiswa Baru Dalam Penerapan Blockchain Pada Universitas Bina Darma Palembang“. Jurnal Pengembangan Sistem Informasi dan Informatika 2, Nr. 1 (23.11.2021): 43–57. http://dx.doi.org/10.47747/jpsii.v2i1.545.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

The development of an era that is increasingly sophisticated makes us have to keep up with the times, especially since we will enter the era of the industrial revolution 4.0, where almost all activities use technological systems that help and facilitate people in everyday life. Likewise with an educational institution that must keep up with the current developments. There are so many technological systems that have emerged today and one of the systems is Blockchain. Blockchain is a technology system for recording digital transaction data that is connected through cryptography managed by a group of computers, Blockchain is very helpful because transactions are made easier because they no longer require intermediaries. Looking at the Blockchain itself, it feels quite right to be applied on campus, because one of the advantages of Blockchain is that it is transparent, where every data transaction is carried out without the intervention of others without third parties, this technology is easy to cost, low cost and fast transactions.

49

ZHANG, YANCHUN, YAHIKO KAMBAYASHI, XIAOHUA JIA, YUN YANG und CHENGZHENG SUN. „ON INTERACTIONS BETWEEN COEXISTING TRADITIONAL AND COOPERATIVE TRANSACTIONS“. International Journal of Cooperative Information Systems 08, Nr. 02n03 (Juni 1999): 87–109. http://dx.doi.org/10.1142/s021884309900006x.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

In order to support the interaction betweeen coexisting traditional short transactions and long cooperative transactions, we propose a novel timestamp ordering approach. With this timestamp ordering method, short transactions can be processed in the traditional way, as if there were no cooperative transactions. Therefore they will not be blocked by cooperative transactions. Cooperative transactions will not be aborted when there is a conflict with short transactions. Rather, they will incorporate the recent updates into their own processing. The serializabilities, among short transactions, and between a cooperative transaction (group) and other short transactions, are all preserved.

50

Xie, Qingqing, Fan Dong und Xia Feng. „ECLB: Edge-Computing-Based Lightweight Blockchain Framework for Mobile Systems“. Security and Communication Networks 2021 (28.04.2021): 1–15. http://dx.doi.org/10.1155/2021/5510586.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Annotation:

The blockchain technology achieves security by sacrificing prohibitive storage and computation resources. However, in mobile systems, the mobile devices usually offer weak computation and storage resources. It prohibits the wide application of the blockchain technology. Edge computing appears with strong resources and inherent decentralization, which can provide a natural solution to overcoming the resource-insufficiency problem. However, applying edge computing directly can only relieve some storage and computation pressure. There are some other open problems, such as improving confirmation latency, throughput, and regulation. To this end, we propose an edge-computing-based lightweight blockchain framework (ECLB) for mobile systems. This paper introduces a novel set of ledger structures and designs a transaction consensus protocol to achieve superior performance. Moreover, considering the permissioned blockchain setting, we specifically utilize some cryptographic methods to design a pluggable transaction regulation module. Finally, our security analysis and performance evaluation show that ECLB can retain the security of Bitcoin-like blockchain and better performance of ledger storage cost in mobile devices, block mining computation cost, throughput, transaction confirmation latency, and transaction regulation cost.

Zeitschriftenartikel zum Thema „Transaction systems (Computer systems)“

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an