Graph analysis can be done at scale by using Spark GraphX which loading data into memory and running graph analysis in parallel.In this way,we should take data out of graph databases and put it into memory.Considering...Graph analysis can be done at scale by using Spark GraphX which loading data into memory and running graph analysis in parallel.In this way,we should take data out of graph databases and put it into memory.Considering the limitation of memory size,the premise of accelerating graph analytical process reduces the graph data to a suitable size without too much loss of similarity to the original graph.This paper presents our method of data cleaning on the software graph.We use SEQUITUR data compression algorithm to find out hot code path and store it as a whole paths directed acyclic graph.Hot code path is inherent regularity of a program.About 10 to 200 hot code path account for 40%-99%of a program’s execution cost.These hot paths are acyclic contribute more than 0.1%-1.0%of some execution metric.We expand hot code path to a suitable size which is good for runtime and keeps similarity to the original graph.展开更多
Nonlinear solution of reinforced concrete structures, particularly complete load-deflection response, requires tracing of the equilibrium path and proper treatment of the limit and bifurcation points. In this regard, ...Nonlinear solution of reinforced concrete structures, particularly complete load-deflection response, requires tracing of the equilibrium path and proper treatment of the limit and bifurcation points. In this regard, ordinary solution techniques lead to instability near the limit points and also have problems in case of snap-through and snap-back. Thus they fail to predict the complete load-displacement response. The arc-length method serves the purpose well in principle, received wide acceptance in finite element analysis, and has been used extensively. However modifications to the basic idea are vital to meet the particular needs of the analysis. This paper reviews some of the recent developments of the method in the last two decades, with particular emphasis on nonlinear finite element analysis of reinforced concrete structures.展开更多
Bit-interleaved coded modulation (BICM) is suitable to bandwidth-efficient communication systems. Hybrid automatic repeat request (HARQ) can provide more reliability to high-speed wireless data transmission. A new pat...Bit-interleaved coded modulation (BICM) is suitable to bandwidth-efficient communication systems. Hybrid automatic repeat request (HARQ) can provide more reliability to high-speed wireless data transmission. A new path weight complementary convolutional (PWCC) code used in the type-Ⅱ BICM-HARQ system is proposed. The PWCC code is composed of the original code and the complimentary code. The path in trellis with large hamming weight of the complimentary code is designed to compensate for the path in trellis with small hamming weight of the original code. Hence, both of the original code and the complimentary code can achieve the performance of the good code criterion of corresponding code rate. The throughput efficiency of the BICM-HARQ system wit PWCC code is higher than repeat code system, a little higher than puncture code system in low signal-to-noise ratio (SNR) values and much higher than puncture code system, the same as repeat code system in high SNR values. These results are confirmed by the simulation.展开更多
基金This research work is supported by Hunan Provincial Education Science 13th Five-Year Plan(Grant No.XJK016BXX001)Social Science Foundation of Hunan Province(Grant No.17YBA049)+2 种基金Hunan Provincial Natural Science Foundation of China(Grant No.2017JJ2016)The work is also supported by Open foundation for University Innovation Platform from Hunan Province,China(Grand No.16K013)the 2011 Collaborative Innovation Center of Big Data for Financial and Economical Asset Development and Utility in Universities of Hunan Province.National Students Platform for Innovation and Entrepreneurship Training(Grand No.201811532010).
文摘Graph analysis can be done at scale by using Spark GraphX which loading data into memory and running graph analysis in parallel.In this way,we should take data out of graph databases and put it into memory.Considering the limitation of memory size,the premise of accelerating graph analytical process reduces the graph data to a suitable size without too much loss of similarity to the original graph.This paper presents our method of data cleaning on the software graph.We use SEQUITUR data compression algorithm to find out hot code path and store it as a whole paths directed acyclic graph.Hot code path is inherent regularity of a program.About 10 to 200 hot code path account for 40%-99%of a program’s execution cost.These hot paths are acyclic contribute more than 0.1%-1.0%of some execution metric.We expand hot code path to a suitable size which is good for runtime and keeps similarity to the original graph.
文摘Nonlinear solution of reinforced concrete structures, particularly complete load-deflection response, requires tracing of the equilibrium path and proper treatment of the limit and bifurcation points. In this regard, ordinary solution techniques lead to instability near the limit points and also have problems in case of snap-through and snap-back. Thus they fail to predict the complete load-displacement response. The arc-length method serves the purpose well in principle, received wide acceptance in finite element analysis, and has been used extensively. However modifications to the basic idea are vital to meet the particular needs of the analysis. This paper reviews some of the recent developments of the method in the last two decades, with particular emphasis on nonlinear finite element analysis of reinforced concrete structures.
基金the National Natural Science Foundation of China(Nos. 60302006 and 60462002)
文摘Bit-interleaved coded modulation (BICM) is suitable to bandwidth-efficient communication systems. Hybrid automatic repeat request (HARQ) can provide more reliability to high-speed wireless data transmission. A new path weight complementary convolutional (PWCC) code used in the type-Ⅱ BICM-HARQ system is proposed. The PWCC code is composed of the original code and the complimentary code. The path in trellis with large hamming weight of the complimentary code is designed to compensate for the path in trellis with small hamming weight of the original code. Hence, both of the original code and the complimentary code can achieve the performance of the good code criterion of corresponding code rate. The throughput efficiency of the BICM-HARQ system wit PWCC code is higher than repeat code system, a little higher than puncture code system in low signal-to-noise ratio (SNR) values and much higher than puncture code system, the same as repeat code system in high SNR values. These results are confirmed by the simulation.
