A Novel High-Efficiency Transaction Verification Scheme for Blockchain Systems

Blockchain can realize the reliable storage of a large amount of data that is chronologically related and verifiable within the system.This technology has been widely used and has developed rapidly in big data systems across various fields.An increasing number of users are participating in application systems that use blockchain as their underlying architecture.As the number of transactions and the capital involved in blockchain grow,ensuring information security becomes imperative.Addressing the verification of transactional information security and privacy has emerged as a critical challenge.Blockchain-based verification methods can effectively eliminate the need for centralized third-party organizations.However,the efficiency of nodes in storing and verifying blockchain data faces unprecedented challenges.To address this issue,this paper introduces an efficient verification scheme for transaction security.Initially,it presents a node evaluation module to estimate the activity level of user nodes participating in transactions,accompanied by a probabilistic analysis for all transactions.Subsequently,this paper optimizes the conventional transaction organization form,introduces a heterogeneous Merkle tree storage structure,and designs algorithms for constructing these heterogeneous trees.Theoretical analyses and simulation experiments conclusively demonstrate the superior performance of this scheme.When verifying the same number of transactions,the heterogeneous Merkle tree transmits less data and is more efficient than traditional methods.The findings indicate that the heterogeneous Merkle tree structure is suitable for various blockchain applications,including the Internet of Things.This scheme can markedly enhance the efficiency of information verification and bolster the security of distributed systems.

Optimized scheduling of integrated energy systems for low carbon economy considering carbon transaction costs

With the introduction of the“dual carbon”goal and the continuous promotion of low-carbon development,the integrated energy system(IES)has gradually become an effective way to save energy and reduce emissions.This study proposes a low-carbon economic optimization scheduling model for an IES that considers carbon trading costs.With the goal of minimizing the total operating cost of the IES and considering the transferable and curtailable characteristics of the electric and thermal flexible loads,an optimal scheduling model of the IES that considers the cost of carbon trading and flexible loads on the user side was established.The role of flexible loads in improving the economy of an energy system was investigated using examples,and the rationality and effectiveness of the study were verified through a comparative analysis of different scenarios.The results showed that the total cost of the system in different scenarios was reduced by 18.04%,9.1%,3.35%,and 7.03%,respectively,whereas the total carbon emissions of the system were reduced by 65.28%,20.63%,3.85%,and 18.03%,respectively,when the carbon trading cost and demand-side flexible electric and thermal load responses were considered simultaneously.Flexible electrical and thermal loads did not have the same impact on the system performance.In the analyzed case,the total cost and carbon emissions of the system when only the flexible electrical load response was considered were lower than those when only the flexible thermal load response was taken into account.Photovoltaics have an excess of carbon trading credits and can profit from selling them,whereas other devices have an excess of carbon trading and need to buy carbon credits.

TRADE DEPENDENCIES AND TRANSACTION COSTS: THE OC-CUPATION OF DECELEA HIGHLIGHTS BOTH THE BENEFITS AND THE DRAWBACKS OF A MARITIME ECONOMY

Thucydides asserts that the occupation of Decelea by the Spartans in 413 BC made the grain supply for Athens costly by forcing the transport from land onto the sea.This calls into question the well-established consensus that sea transport was far cheaper than land transport.This paper contends that the cost of protecting supply lines-specifically the expenses associated with the warships which escorted the supply ships-rendered the grain transported on the new route exceptionally costly.In this paper,the benefits and drawbacks of a maritime economy,including transaction costs,trade dependencies,and the capabilities of warships and supply ships are discussed.

Current Trends in the Management of Distributed Transactions in Micro-Services Architectures: A Systematic Literature Review

In the evolving landscape of software engineering, Microservice Architecture (MSA) has emerged as a transformative approach, facilitating enhanced scalability, agility, and independent service deployment. This systematic literature review (SLR) explores the current state of distributed transaction management within MSA, focusing on the unique challenges, strategies, and technologies utilized in this domain. By synthesizing findings from 16 primary studies selected based on rigorous criteria, the review identifies key trends and best practices for maintaining data consistency and integrity across microservices. This SLR provides a comprehensive understanding of the complexities associated with distributed transactions in MSA, offering actionable insights and potential research directions for software architects, developers, and researchers.

Transaction在PAR平台中的实现方法及应用研究

随着电子商务和金融软件应用日益广泛,提高这类软件系统的可靠性和安全性就显得特别重要。虽然能够提高这类软件可靠性的事务处理技术早在数据库管理系统中普遍使用,近几年在Java软件开发环境中也新增了事务处理接口JTA,但是在基于模型驱动架构设计的建模语言中嵌入事务处理机制的成功案例尚不多见。论文在已有体现模型驱动软件架构思想的PAR方法和PAR平台中,融入抽象事务处理机制,并使用融入了事务处理机制的PAR平台及其建模语言开发了具有事务处理功能的金融软件模型,通过PAR平台的模型自动转换工具生成了Java和SQL程序。实验证明融入了事务处理机制的PAR方法和PAR平台具有建模简单、实用,软件开发效率高,便于形式化推导和证明等特点。

A Semantics-based Cooperative Transaction Model

In CSCW system, there are many long-time, cooperative, interactive transactions. Traditional transaction model and advanced transaction model do not effectively support transaction processing in CSCW system. In this paper, a semantics-based cooperative transaction model(SCTM) is put forward. This model is based on the semantics information of cooperative process and data objects, and can satisfy the demands of transaction processing in CSCW system.

基于Transaction模式的SoC软硬件协同验证策略

SoC的验证越来越成为集成电路发展的突出问题,而传统的信号级别的验证方法由于工作量巨大,已经很难满足系统的要求。研究了基于Transaction模式的验证方法,并通过开发的验证平台,用实验进行了验证。该方法在Transaction级别上实现对系统的验证,提高了验证速度,可以缩短设计周期,降低设计成本。

A Storage Optimization Scheme for Blockchain Transaction Databases

As the typical peer-to-peer distributed networks, blockchain systemsrequire each node to copy a complete transaction database, so as to ensure newtransactions can by verified independently. In a blockchain system (e.g., bitcoinsystem), the node does not rely on any central organization, and every node keepsan entire copy of the transaction database. However, this feature determines thatthe size of blockchain transaction database is growing rapidly. Therefore, with thecontinuous system operations, the node memory also needs to be expanded tosupport the system running. Especially in the big data era, the increasing networktraffic will lead to faster transaction growth rate. This paper analyzes blockchaintransaction databases and proposes a storage optimization scheme. The proposedscheme divides blockchain transaction database into cold zone and hot zone usingexpiration recognition method based on Least Recently Used (LRU) algorithm. Itcan achieve storage optimization by moving unspent transaction outputs outsidethe in-memory transaction databases. We present the theoretical analysis on theoptimization method to validate the effectiveness. Extensive experiments showour proposed method outperforms the current mechanism for the blockchaintransaction databases.

Nested Transaction Concurrency Control in Parallel Real-Time Dat-abases

An integrated method for concurrency control in parallel real-time databases has been proposed in this paper. The nested transaction model has been investigated to offer more atomic execution units and finer grained control within in a transaction. Based on the classical nested locking protocol and the speculative concurrency control approach, a two-shadow adaptive concurrency control protocol, which combines the Sacrifice based Optimistic Concurrency Control (OPT-Sacrifice) and High Priority two-phase locking (HP2PL) algorithms together to support both optimistic and pessimistic shadow of each sub-transaction, has been proposed to increase the likelihood of successful timely commitment and to avoid unnecessary replication overload.

Implementation of Transaction Level AMBA Bus Models Using SystemC

This paper deals with how to implement AMBA bus transaction level modeling in SystemC. There are two main techniques used in the whole modeling process, which consist of starting the platform modeling at the transaction level and using the uniformed modeling language— System C. According to the concepts of interface, port and hierarchical channel introduced in SystemC 2.0, the system of master-channel (AMBA bus) slave is created as the architecture of the AMBA bus transaction level model, which can make it more extendable. The port and interface classes of the model that are prone to program are defined in accordance with the SoC hierarchical design methodology. In addition, method calls, not signal communication, are used between different modules in the model, so the higher-level abstraction is achieved and the simulation performance is improved. The AMBA bus transaction level model is analyzed and certified by simulation experiment, and proved to be completely compliant to the AMBA specification 2.0. Key words AMBA - transaction level - SystemC - SoC CLC number TP 393 Foundation item: Supported by the National High Technology Development 863 Program of China (2002AA1Z1490)Biography: He Zhen (1979-), male, Master candidate, research direction: system level modeling in SoC hardware/software co-design.

Design of ECC based Secured Cloud Storage Mechanism for Transaction Rich Applications

Cloud computing is the highly demanded technology nowadays.Due to the service oriented architecture,seamless accessibility and other advantages of this advent technology,many transaction rich applications are making use of it.At the same time,it is vulnerable to hacks and threats.Hence securing this environment is of at most important and many research works are being reported focusing on it.This paper proposes a safe storage mechanism using Elliptic curve cryptography(ECC)for the Transaction Rich Applications(TRA).With ECC based security scheme,the security level of the protected system will be increased and it is more suitable to secure the delivered data in the portable devices.The proposed scheme shields the aligning of different kind of data elements to each provider using an ECC algorithm.Analysis,comparison and simulation prove that the proposed system is more effective and secure for the Transaction rich applications in Cloud.

Optimal proportional reinsurance and dividend payments with transaction costs and internal competition

We study the dividend optimization problem for an insurance company under the consideration of internal competition between different units inside company and transaction costs when dividends occur. The management of the company controls the reinsurance rate, the timing and the amount of dividends paid out to maximize the expected total dividends paid out to the shareholders until ruin time. By solving the corresponding quasi-variational inequality, we obtain the optimal return function and the optimal strategy.

FOREIGN CURRENCY OPTION PRICING WITH PROPORTIONAL TRANSACTION COSTS

The purpose of present work is to examine the financial problem of finding the universal reservation prices of a European call option written on exchange rate when there is proportional transaction costs of trading foreign currency in the market. An approach is suggested to compute the reservation bid-ask price of foreign currency call option based on maximizing the investor＇s expected utility. Option prices are determined from the investor＇s basic portfolio selection problem, without the need to solve a more complex optimization problem involving the insertion of the option payoffs into the terminal value function. Option prices are computed numerically in a Markov chain approximation for the case of exponential utility. Numerical results show that the option price bounds are almost independent of the alternative risk aversion parameter, but the bounds of NT region becomes narrower and the range of values of the initial holding for which the fair price lies within the bid-ask spread is shifted to a lower value when the risk aversion parameter increases.

Analysis on Land Ticket Transaction System of Chongqing Municipality

On the basis of analyzing essence of land ticket system of Chongqing Municipality and its transaction process,this paper studies the relationship between government and farmers and between city and countryside,and discusses the drawbacks of land ticket system in Chongqing Municipality. Results show that inherent drawbacks of land ticket system and wrong guidance of policies lead to suspicion of land ticket system occupying rural resources. Interregional exploitation and intergenerational exploitation are inherent mechanism of city exploiting countryside. Finally,it proposes increasing construction land index to satisfy demand of new socialist countryside construction primarily,to ensure rural social stability; Later,use land ticket index to fill the gap of construction land in economically developed areas,so as to alleviate conflict of urban land use and maximize circulation value of rural construction land. It is expected to provide theoretical reference for relevant departments to regulate land ticket transaction system and realize the harmonious development,between urban and rural areas.

Data Flow&Transaction Mode Classification and An Explorative Estimation on Data Storage&Transaction Volume

The public has shown great interest in the data factor and data transactions,but the current attention is overly focused on personal behavioral data and transactions happening at Data Exchanges.To deliver a complete picture of data flaw and transaction,this paper presents a systematic overview of the flow and transaction of personal,corporate and public data on the basis of data factor classification from various perspectives.By utilizing various sources of information,this paper estimates the volume of data generation&storage and the volume&trend of data market transactions for major economies in the world with the following findings:(i)Data classification is diverse due to a broad variety of applying scenarios,and data transaction and profit distribution are complex due to heterogenous entities,ownerships,information density and other attributes of different data types.(ii)Global data transaction has presented with the characteristics of productization,servitization and platform-based mode.(iii)For major economies,there is a commonly observed disequilibrium between data generation scale and storage scale,which is particularly striking for China.(i^v)The global data market is in a nascent stage of rapid development with a transaction volume of about 100 billion US dollars,and China s data market is even more underdeveloped and only accounts for some 10%of the world total.All sectors of the society should be flly aware of the diversity and complexity of data factor classification and data transactions,as well as the arduous and long-term nature of developing and improving relevant institutional systems.Adapting to such features,efforts should be made to improve data classification,enhance computing infrastructure development,foster professional data transaction and development institutions,and perfect the data governance system.

Aware conflict detection of non-uniform memory access system and prevention for transactional memory

Most transactional memory (TM) research focused on multi-core processors, and others investigated at the clusters, leaving the area of non-uniform memory access (NUMA) system unexplored. The existing TM implementations made significant performance degradation on NUMA system because they ignored the slower remote memory access. To solve this problem, a latency-based conflict detection and a forecasting-based conflict prevention method were proposed. Using these techniques, the NUMA aware TM system was presented. By reducing the remote memory access and the abort rate of transaction, the experiment results show that the NUMA aware strategies present good practical TM performance on NUMA system.

MR-CLOPE: A Map Reduce based transactional clustering algorithm for DNS query log analysis

DNS(domain name system) query log analysis has been a popular research topic in recent years. CLOPE, the represented transactional clustering algorithm, could be readily used for DNS query log mining. However, the algorithm is inefficient when processing large scale data. The MR-CLOPE algorithm is proposed, which is an extension and improvement on CLOPE based on Map Reduce. Different from the previous parallel clustering method, a two-stage Map Reduce implementation framework is proposed. Each of the stage is implemented by one kind Map Reduce task. In the first stage, the DNS query logs are divided into multiple splits and the CLOPE algorithm is executed on each split. The second stage usually tends to iterate many times to merge the small clusters into bigger satisfactory ones. In these two stages, a novel partition process is designed to randomly spread out original sub clusters, which will be moved and merged in the map phrase of the second phase according to the defined merge criteria. In such way, the advantage of the original CLOPE algorithm is kept and its disadvantages are dealt with in the proposed framework to achieve more excellent clustering performance. The experiment results show that MR-CLOPE is not only faster but also has better clustering quality on DNS query logs compared with CLOPE.

Unit Commitment under the Environment of Wind Power and Large-Scale Bilateral Transactions

Bilateral electric power contract is settled based on contract output curve. This paper considered the bilateral transactions execution, new energy accommodation, power grid security and generation economy, considering the executive priority of different power components to establish a multi-objective coordination unit commitment model. Through an example to verify the effectiveness of the model in promoting wind power consumption, guaranteeing trade execution, and improving power generation efficiency, and analyzed the interactions to each other among the factors of wind power, trading and blocking. According to the results, when wind power causes reverse power flow in the congestion line, it will promote the implementation of contracts, the influence of wind power accommodation to trade execution should be analyzed combined with the grid block, the results can provide reference for wind power planning.

A sensor transaction scheduling algorithm for maintaining real-time data temporal validity

A new scheduling algorithm called deferrable scheduling with time slice exchange (DS-EXC) was proposed to maintain the temporal validity of real-time data. In DS-EXC, the time slice exchange method was designed to further defer the release time of transaction instances derived by the deferrable scheduling algorithm (DS-FP). In this way, more CPU time would be left for lower priority transactions and other transactions. In order to minimize the scheduling overhead, an off-line scheme was designed. In particular, the schedule for a transaction set is generated off-line until a repeating pattern is found, and then the pattern is used to construct the schedule on-line. The performance of DS-EXC was evaluated by sets of experiments. The results show that DS-EXC outperforms DS-FP in terms of increasing schedulable ratio. It also provides better performance under mixed workloads.

Massive Files Prefetching Model Based on LSTM Neural Network with Cache Transaction Strategy

In distributed storage systems,file access efficiency has an important impact on the real-time nature of information forensics.As a popular approach to improve file accessing efficiency,prefetching model can fetches data before it is needed according to the file access pattern,which can reduce the I/O waiting time and increase the system concurrency.However,prefetching model needs to mine the degree of association between files to ensure the accuracy of prefetching.In the massive small file situation,the sheer volume of files poses a challenge to the efficiency and accuracy of relevance mining.In this paper,we propose a massive files prefetching model based on LSTM neural network with cache transaction strategy to improve file access efficiency.Firstly,we propose a file clustering algorithm based on temporal locality and spatial locality to reduce the computational complexity.Secondly,we propose a definition of cache transaction according to files occurrence in cache instead of time-offset distance based methods to extract file block feature accurately.Lastly,we innovatively propose a file access prediction algorithm based on LSTM neural network which predict the file that have high possibility to be accessed.Experiments show that compared with the traditional LRU and the plain grouping methods,the proposed model notably increase the cache hit rate and effectively reduces the I/O wait time.