There are plentiful and diverse applications of graph data management and mining in the real-world scientific research and business activities. As one of the most basic operations, uniform path pattern query processin...
详细信息
ISBN:
(纸本)9781479967209
There are plentiful and diverse applications of graph data management and mining in the real-world scientific research and business activities. As one of the most basic operations, uniform path pattern query processing on graph data faces three big challenges. In this paper, we deal with these challenges by the following points. Firstly, a new query language on graph, called G-Path, is presented, which focuses on complex path pattern query processing on a very large graph. Also, the design of a system called HDGL is proposed, which is based on a BSP-like model as well as MapReduce model, and can effectively handle distributed graph data operations and queries. Secondly, the implementation of HDGL on the de facto cloud platform - Hadoop - is brought forward. Based on the concept of distributed state machine, the query processing of a G-Path statement in HDGL is detailed. In addition, as the query optimization of G-Path queries, several tricks are utilized to improve dramatically the performance of query execution. Finally, extensive experiments on several graph data sets are conducted to show the usability of G-Path query language and the effectiveness of HDGL.
This paper presents an ultra-low quiescent current output capacitor-less Low-dropout (LDO) regulator with a novel slew-rate-enhanced (SRE) circuit. By adopting the novel SRE circuit, the transient response of the regu...
详细信息
This paper presents an ultra-low quiescent current output capacitor-less Low-dropout (LDO) regulator with a novel slew-rate-enhanced (SRE) circuit. By adopting the novel SRE circuit, the transient response of the regulator was improved apparently. Simulation results show that, the LDO regulator consumes a quiescent current of only 930nA at steady state.
Named Data Network (NDN) is gaining increasingly concerns, as an important direction of the future Internet architecture research centered on content. Content caching has played a key role in NDN. Existing cache repla...
详细信息
Named Data Network (NDN) is gaining increasingly concerns, as an important direction of the future Internet architecture research centered on content. Content caching has played a key role in NDN. Existing cache replacement policies like Least Frequently Used (LFU) and Least Recently Used (LRU) have failed to make full use of the popularity of contents, which leads to a low cache efficiency in the dynamic network. In order to make the best use of content popularity in the cache strategy, this paper has proposed a cache replacement policy based on content popularity (CCP), and designed the data structure format and replacement algorithm. For fully studying and analyzing the performance of different cache policies in NDN in terms of network throughput, server load and cache hit ratio, we have done a lot of simulations to show how they will improve the network. The simulation results show that our proposed CCP can significantly decrease the server load with a higher cache hit ratio and increase the network capacity at the same time compared with LRU and LFU. And the average throughput is reduced significantly by nearly 47% in comparison to that of the case without in-networking caching. Moreover, it also shows the performance under different sizes of content store. The effectiveness of the CCP strategy is proved during the simulation.
Importance of proteins are different to perform functions of cells in living organisms according to the relevant experiment results, and more essential proteins is the most important kind of proteins. There are recent...
详细信息
The aim of this paper was to apply spectral index to estimate winter wheat LAI and further to compare prediction accuracy and stability of four proposed typical spectral indices based on four kinds of resampling multi...
详细信息
ISBN:
(纸本)9781634399999
The aim of this paper was to apply spectral index to estimate winter wheat LAI and further to compare prediction accuracy and stability of four proposed typical spectral indices based on four kinds of resampling multispectral and hyperspectral sensors data. The results show that VIUPD has the best prediction accuracy and stability for estimation of winter wheat LAI on the basis of four different resampling sensors data, which reaffirms that VIUPD is comparatively sensor independent and illustrates its potential ability in the area of estimating vegetation biochemical parameters.
A hardware/software field programmable gate array (FPGA)-based driver system was proposed and demonstrated for the KAF-39000 large area high resolution charge coupled device (CCD). The requirements of the KAF-3900...
详细信息
A hardware/software field programmable gate array (FPGA)-based driver system was proposed and demonstrated for the KAF-39000 large area high resolution charge coupled device (CCD). The requirements of the KAF-39000 driver system were analyzed. The structure of "microprocessor with application specific integrated circuit (asic) chips" was implemented to design the driver system. The system test results showed that dual channels of imaging analog data were obtained with a frame rate of 0.87frame/s. The frequencies of horizontal timing and vertical timing were 22.9MHz and 28.7kHz, respectively, which almost reached the theoretical value of 24 MHz and 30kHz, respectively.
Temporal induction is one of the most popular SAT-based model checking techniques. It consists of two parts, the base case and the induction step. With the search length increment, both parts generate a sequence of SA...
详细信息
Temporal induction is one of the most popular SAT-based model checking techniques. It consists of two parts, the base case and the induction step. With the search length increment, both parts generate a sequence of SAT problems. This paper focuses on learnt clause replication and reuse in incremental temporal induction. Firstly, with the aid of assumption literals, we present an alternative clause replication scheme, which is much easier to implement than existing works. Secondly, based on our clause replication scheme, we present several clause reuse schemes to maximally explore the learnt clauses and their replications in temporal induction. Based on above ideas, we propose two new incremental temporal induction algorithms. Experimental results on a large number of benchmarks show significant performance improvement of our technique.
With the rapid emerging of novelty Web services and cloud services, privacy information and documents of users become increasingly easy to be exposed in the Internet. To tackle the issue of lifecycle security of the p...
详细信息
With the rapid emerging of novelty Web services and cloud services, privacy information and documents of users become increasingly easy to be exposed in the Internet. To tackle the issue of lifecycle security of the privacy information and documents in the Internet, in this paper, we propose the idea of combining the three security methods of multilevel security, identity-based encryption (IBE), and distributed hash table (DHT) network. And we further propose an IBE-based secure self-destruction (ISS) scheme to protect the confidentiality and privacy of the Internet content by self-destruction after a predefined time. In our proposed ISS security scheme, the Internet content is first partitioned into many segments with diverse security levels, and each segment is encrypted with a symmetric key to obtain primitive ciphertext. By applying the methods of association and extraction, the primitive ciphertext is turned to associated ciphertext, which is then divided into extracted ciphertext and encapsulated ciphertext. The latter is encapsulated into the Internet content self-destructing object (CDO), which is stored into the storage services provider. Furthermore, to protect the privacy security when the CDO expired, the symmetric key is encrypted using the IBE algorithm based on the identity of the authorized user. The combination of this key's ciphertext and the extracted ciphertext, by means of Lagrange polynomial processing, generates mixture ciphertext shares. Then those shares are distributed into nodes within the DHT network and will be automatically discarded over the deadline when the primitive ciphertext and the symmtric key are unrecoverable. Consequently, the ISS scheme achieves the aim of secure self-destruction. Comprehensive analysis shows that the ISS scheme is able to satisfy all the design demands and is more secure than existing schemes. The ISS scheme can resist against not only the traditional cryptanalysis and brute-force attack, but also the Sybil
A new dynamic circuit scheme to realize voltage-mode ternary circuit using floating-gate MOS (FGMOS) transistor is presented. The dynamic ternary inverter and literal circuits with the less complex structure are desig...
详细信息
ISBN:
(纸本)9781479932849
A new dynamic circuit scheme to realize voltage-mode ternary circuit using floating-gate MOS (FGMOS) transistor is presented. The dynamic ternary inverter and literal circuits with the less complex structure are designed, and they can be implemented by the standard CMOS process with a double-poly layer without any modification of the thresholds. In the proposed scheme, the circuit output is always brought to logic 1 during the pre-charge phase, to avoid charge sharing in cascaded gates, and then the disadvantage of buffering between stages is eliminated. All the proposed circuits are verified by HSPICE simulation results with TSMC 0.35μm 2-ploy 4-metal CMOS technology.
As in computational geometry, CAD/CAM and computer graphics, the basic algorithm of computing of the area of the union of circles is widely used in many fields. In order to solve the problems of judging constraint arc...
详细信息
As in computational geometry, CAD/CAM and computer graphics, the basic algorithm of computing of the area of the union of circles is widely used in many fields. In order to solve the problems of judging constraint arcs' direction vaguely and computing some overlap region's area repeatedly on [2], this paper proposes an improved algorithm for computing the area of union of circles. The improved algorithm can calculate united area of circles with distribution at any possible positions, and experimental comparison shows that the algorithm not only solves those problems, but also has more reliability.
暂无评论