Search

Periodic high utility sequential pattern mining (PHUSPM) has attracted much attention because it can find more practical regular patterns in time series. However, existing PHUSPM algorithms struggle to effectively handle incremental updates and overlook the downward closure property and complexity of the algorithm in large-scale data. To solve this problem, this paper proposed an IncPUS-Miner algorithm, which effectively realized the incremental mining of periodic high-utility sequential patterns (PHUSPs). IncPUS-Miner introduced a novel data structure called pu-tree. Each tree node corresponded to an updated utility list(UUL) to store the auxiliary information of the corresponding sequence. When incremental data was added, this structure allowed flexible updates to project information, thereby enhancing the dynamic adaptability and scalability of the algorithm. In addition, this paper proposed two new upper bounds of sequence utility, PUB and EUB, and two corresponding pruning strategies, which effectively reduced the computational burden. The experimental results show that the IncPUS-Miner algorithm effectively realizes the incremental mining of PHUSPs on real data, and shows superior performance compared with other algorithms. [ABSTRACT FROM AUTHOR]

Natural resources and geographic information big data are regarded as essential productive factors in the context of digital government, and an important component of the national integrated government big data system. Due to data dispersion and isolated application program existing in the various departments, it is difficult to realize data sharing and application across departments and businesses, leading to the low utilization rate of data. In response to the issues mentioned above, the digital government spatio-temporal data center was designed with the demands for natural resource and geographic information big data services. The critical components, including storage computation, data structure and application support were introduced clearly. By integrating the natural resources and geographic information database with the population comprehensive database and legal person comprehensive database, an organic composition of people, enterprises and geographic locations was established, which was explained by the specific application practices. [ABSTRACT FROM AUTHOR]

Compared with the traditional government environmental governance model, the government′s use of algorithms to carry out environmental governance has obvious positive effects: it can improve the accuracy, predictability, and efficiency of environmental governance. However, embedding algorithms into government environmental governance can easily lead to risks in three dimensions: ethics, tools, and the rule of law. The ethical dimension faces the risk of value imbalance; the tool dimension includes the risk of insufficient environmental data structure and insufficient transparency of environmental algorithm models; and the legal dimension includes the risk of abuse of power and uneven distribution of responsibilities by those who control the environmental algorithm models. Therefore, it is necessary to address the risks induced by embedding algorithms in government environmental governance and to build a systematic legal regulation system, thereby fully leveraging the advantages of algorithmic automated decision-making in environmental governance. In the selection of regulatory paths, the potential risks of algorithms embedded in government environmental governance should be systematically regulated based on the guidance of basic macro principles and the design of specific regulatory plans. At a macro level, algorithms embedded in government environmental governance should follow the basic principles of legal governance, fairness and justice, floating proportions, and due process. In terms of specific regulatory plans, it is necessary to establish a support structure for algorithms embedded in government environmental governance to take advantage of these algorithms. It is also necessary to make appropriate rule changes based on the loopholes of the algorithms themselves, using the 'supportive structures and adaptive flow phase balance' method to improve the feasibility of specific regulatory plans. The structure of the specific regulatory plan should adhere to the perspective of whole-process governance and achieve the unity of prevention beforehand, supervision during the incident, and accountability after the incident. The pre-prevention part requires that algorithms embedded in government environmental governance effectively meet ethical requirements, and a complete environmental data approval, feedback, and protection mechanism, along with an explanation mechanism for environmental algorithm models, should be established. The interim supervision part should establish departments and social organizations where algorithms are embedded in government environmental governance as well as a public supervision system. The ex post facto attribution part needs to embed the algorithm into the responsibility allocation system of government environmental governance. [ABSTRACT FROM AUTHOR]

Spatial index is a data structure arranged in a specific order according to the shapes, positions and spatial relationships of spatial objects. This structure can provide an efficient way of data organization and management method to support the mining and analysis of massive spatial data In view of the problems existing in spatial index, such as unclear knowledge system and difficulty in selecting spatial indexes, with the help of literature survey method and CiteSpace tool, spatial index is divided into four categories by spatial subdivision and mapping methods: tree structure, grid, space-filling curves and address coding. This paper reviews their principles, spatial structures and scope of applications in detail, and provides an outlook on the research of spatial indexes in data organization, efficient computing, visualization, reliability and so on. The conclusion is as follows: spatial indexes based on tree structure are the most versatile and can handle multi-dimensional and multi-level data, while their query performance depends on the balance of the tree structure and the distribution of data; spatial indexes based on grid can evenly divide the space to facilitate efficient range query, but are not suitable for unstructured or dynamic data sets; spatial indexes based onspace-filling curves can achieve dimensional compression while maintaining local proximity, but inserting or deleting data may make the reconstruction of the entire curve hard to update frequently; spatial indexes based on address coding can convert semantic address information into coded information to facilitate efficient retrieval, however, there are still large deviations and uncertainties in semantic address matching. The research findings can be used as a reference for researchers in spatial data organization and structure design. [ABSTRACT FROM AUTHOR]

Aiming at the problems of large amount of track electronic map data, heavy workload of manual compilation and low accuracy, this paper proposes a high-precision track electronic map source data description method and data structure. A high-precision track electronic map generation system suitable for medium and low traffic volume rail transit is designed and implemented. The system can automatically complete data processing and data verification in simulation and actual scenarios, and finally generate electronic map data file. Through the establishment of mobile positioning data acquisition platform, the system has been applied in Wuhu rail transit line 1 and 2. The application results show that the high-precision track electronic map generated by the system can accurately and effectively realize the functions of vehicle position matching and graphical display. [ABSTRACT FROM AUTHOR]

There is a need to upgrade the maintenance measures associated with balise equipment, by improving the management method of balise telegrams dominated by manual operation, to continuously enhance management efficiency. To this end, this paper studies the management of balise telegrams. It briefly describes the main functions and roles of the balise telegram management system. Then, it analyzes the overall requirements for the balise telegram management system, proposes an overall design scheme, and elaborates on the network structure design and functional module partition of the balise telegram management system. Moreover, it describes such issues as the relevant technologies and specific data structures, module functions and operation interfaces to implement the software. Thanks to the intelligent management system of balise telegram based on real-time parameterized data, a whole-process safety management system of balise telegram has been established, with the railway bureau performing the integrated management, and the signaling personnel at all levels performing the dynamic management of the balise telegrams under the "cloud-edge" collaboration framework, to provide reliable guarantee for the safe train operation of high-speed railways. [ABSTRACT FROM AUTHOR]

Copyright of Machine Tool & Hydraulics is the property of Guangzhou Mechanical Engineering Research Institute (GMERI) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Shipin Kexue/ Food Science is the property of Food Science Editorial Department and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Systems Engineering & Electronics is the property of Journal of Systems Engineering & Electronics Editorial Department and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Harbin Institute of Technology. Social Sciences Edition / Haerbin Gongye Daxue Xuebao. Shehui Kexue Ban is the property of Harbin Institute of Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Cryptologic Research (2095-7025) is the property of Editorial Board of Journal of Cryptologic Research and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of China Mechanical Engineering is the property of Editorial Board of China Mechanical Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

As a critical part of desision tree (DT） growth, its nodes can be split to grow by either axis- or nonaxis-aligned way based on such splitting criteria as purity and misclassification error. However, these have nothing to do with the geometric structure of data, e. g. multicentric data or single-center data. In order to compensate for this, two splitting criteria are proposed by combining the between-class margin in the same inner node (BCM） and the between-node margin within the same class (BNM） respectively with the purity measure in weighting and the two-step method. Unlike traditional greedy growth of DT which only finds the current locally optimal splitting point, the proposed method first selects the top-k purity splitting nodes, then determines the optimal one by maximizing BCM and minimizing BNM. Since not only alleviating purity-based local optimality but also considering global structures of the data, our method greatly improves the division of descendant nodes and generalization of the formed trees, while enhancing the interpretability. In addition, two aforementioned splitting criteria can be combined to further boost the performance. The comparison results on 21 benchmark datasets show an improvement in predictive performance of new trees with reduction in complexity, while also are competitive with many other DTs using hybrid splitting criteria. [ABSTRACT FROM AUTHOR]

Copyright of Experimental Technology & Management is the property of Experimental Technology & Management Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

【Objective】 The spatial variability and scale effect of soil available nitrogen content in maize propagation base were investigated, and reasonable sampling interval was determined to provide a theoretical basis for accurate soil sampling design. 【Method】 Taking the perennial southern maize propagation plot as the test plot, soil samples were collected at 10 m sampling interval with original scale, and sampled successively at 20, 30 and 40 m to form different sampling interval data sets. Spatial autocorrelation Moran index, semi-variogram and fractal dimension were used to analyze the spatial structure changes of soil available nitrogen content under different sampling interval conditions. 【Result】 The average content of soil available nitrogen in the test site was 90.24 mg/kg, belonging to the medium level, and the coefficient of variation was 19.77%, belonging to the medium range of variation. At the sampling intervals of 10, 20, 30 and 40 m, the data structure of soil available nitrogen samples did not change notably, only the coefficient of variation was different greatly. The coefficient of variation at the sampling interval of 20 m was the largest 29.37 %, while that at the other sampling intervals was little different. With the increase of sampling interval, the spatial autocorrelation Moran index of soil available nitrogen content decreased and its spatial aggregation became weaker, while the nugget value, block base ratio and fractal dimension showed an increasing trend, indicating that the spatial variation caused by random factors gradually increased, while the spatial variation caused by random factors gradually weakened the spatial variation caused by structural factors, making the spatial correlation gradually weakened. The spatial distribution of soil available nitrogen content with a 20 m sampling interval was consistent with the original scale of a 10 m sampling interval, and the root mean square error value of spatial prediction was the smallest, indicating that the spatial prediction accuracy was highest. 【Conclusion】 With the increase of sampling interval, the spatial autocorrelation of soil available nitrogen content gradually weakened, indicating that the spatial variability caused by random factors gradually increased, and the spatial variation caused by structural factors gradually weakened. The spatial variation characteristics and distribution of soil available nitrogen content at 20 m sampling interval were similar to those of 10 m sampling interval with the original scale and the spatial prediction accuracy was highest, which was a reasonable sampling interval in this study. It provided technical support for precise application and management of nitrogen fertilizer in maize propagation base. [ABSTRACT FROM AUTHOR]

Due to the lack of tailored security and privacy technology in many fields such as Internet of Things, artificial intelligence and big data, the system based on distributed ledger technology (DLT) can well meet their the security requirements as a decentralized data management method. Consequently, systems based on distributed ledger technology emerge in an endless stream. In order to help subsequent researchers understand the field of distributed ledger technology more comprehensively and quickly, this paper reviewed the research results based on distributed ledger technology in recent years. It analyzed the blockchain in depth from the perspectives of data structure, technical principle, consensus mechanism and performance, and compared and analyzed some recent advances in distributed ledger technology in detail based on the current research status, such as Hashgraph, Holochain and Truechain. Finally, this paper summarized the future development prospect of this field. [ABSTRACT FROM AUTHOR]

In the complex product research and experimental development project, activities overlapping is usually used to shorten project duration. Currently, most meth- ods for resource constrained project scheduling problem with activities overlapping are based on heuristic algorithm. This method has the advantages of fast-speed conver- gence and large-scale calculation, but cannot obtain the optimal solution. The accurate algorithm is an effective method to solve the optimal solution of the above problem. Therefore, a branch and bound method is designed to obtain the optimal solution according to examine the impact of overlapping activities on project scheduling. Firstly, the optimality of the algorithm is proved in theory. The optimal solution can be obtained only by considering the minimum delay substitution set, and cut set domination rule and left shift domination rule in pruning operation is proved. Secondly, in the algorithm design, the data structure{stack is used to store the node information on the search tree, and for the activities overlapping constraint, a new decision point and a new representation method of the search tree node are defined. Finally, the feasibility and effectiveness of the algorithm are verified by a large number of instances. In conclusion, the proposed algorithm has high research value with mature theoretical significance and accurate calculation results. [ABSTRACT FROM AUTHOR]

In order to solve the problem of effective verification of radar real-time signal processing function and performance, a wideband and narrowband integrated radar echo playback system with multiple channels is designed and implemented. The system transfers the radar echo data to the real-time signal processing system according to the time sequence and data rate of the radar operation, so as to reproduce the target tracking scene and realize the effective verification of the real-time signal processing function and performance of the radar. The data playback system comprises a disk array server and two PCIe fiber boards. Based on the Xilinx series products, the PCIe DMA control process and response mechanism are further adjusted according to the system characteristics, and the high-speed batch transmission of radar echo data from the server to the fiber board is realized. According to the working mechanism of the radar and the echo data structure, the FPGA playback control state machine and related function modules are designed, and the radar echo data is transmitted from the optical fiber board to the real-time processing system in strict accordance with the working sequence and data rate of the radar. To ensure the synchronization between multiple boards when wideband and narrowband echo playback is carried out at the same time, the study proposes two methods based on software and hardware respectively. The test results show that the system realizes the synchronous playback of wide-band and narrow-band radar echo data between boards, each data type supports 6 parallel data channels, and the peak data playback rate can reach 1 920 MB·s-1.The designed system can be directly integrated in the origin radar hardware platform, without adding extra circuit boards or cables, which has good generality and convenience. The system has been successfully applied in a multi-function phased array radar. [ABSTRACT FROM AUTHOR]

Copyright of Shipin Kexue/ Food Science is the property of Food Science Editorial Department and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of South China Normal University (Natural Science Edition) / Huanan Shifan Daxue Xuebao (Ziran Kexue Ban) is the property of Journal of South China Normal University (Natural Science Edition) Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Coal Science & Technology (0253-2336) is the property of Coal Science & Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Unsupervised Domain Adaptation(UDA) learns a target model by knowledge transfer from a related source domain, and commonly assumes the direct access to source data. Due to privacy or security concerns, only source model is available in some real applications. How to effectively utilize target data to reduce noise-like output or feature is a learning challenge of source-free domain adaptation. To address this paper proposed a method which is source-free domain adaptation with dual-correction mechanism(DCM). First, it attempted to exploit the target data structure to refine the noise-like prediction. Second, the teacher-student model is used to guide the learning of features, maximizing the consistency between high-confidence features and the difference between low-confidence features. Finally, experiments on Digit, Office-31 and Office-Home datasets show the effectiveness of DCM. [ABSTRACT FROM AUTHOR]

Copyright of Railway Signalling & Communication Engineering is the property of Railway Signalling & Communication Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Coal Science & Technology (0253-2336) is the property of Coal Science & Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The immutability of traditional blockchain limits the development of blockchain technology, research on modifiable blockchain is still in its infancy, many schemes still have many deficiencies in system efficiency and security. To deal with these problems, firstly, this paper proposes an improved blockchain data structure to make it suitable for modifiable functions; Secondly, a master private key synthesis algorithm is designed using homomorphic encryption technology to ensure the security of the private key used for data modification on the chain during the synthesis process; At the same time, a matching mechanism is designed to reduce the communication amount in the private key synthesis process; Finally, an auditing method for modification requests is designed to ensure the rationality and security of auditing modification requests. The experimental results show that the scheme in this paper not only has the characteristics of decentralization, but also improves the system security and communication efficiency compared with other schemes. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Zhengzhou University (Natural Science Edition) is the property of Journal of Zhengzhou University (Natural Science Edition) Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Autonomous agricultural vehicle (AAV) is believed to play a significant role in smart agriculture. In future periods, AAV will still be dominated by fuel engines, and the transmission technology will be upgraded from manual shifting to power shifting or CVT (Continuously Variable Transmission) simultaneously for which to improve the power and economy. In response to the demand of AAV, this study devotes to developing an autonomous driving and operation system based on ROS (Robot Operating System) and CVT tractor. The proposed system includes safety, planning, control and CAN bus communication modules. To do that, we integrated and deployed hardware on CVT tractor, designed a CAN bus protocol and implemented data structure for communication between ROS and CAN bus. A close-range anti-collision capability of the tractor is realized based on radar, and a lateral controller based on PID algorithm is adopted. To further validation, a corn sowing experiment was carried out in Miyun District, Beijing, with a total operating area of 2.4 hectares. This research takes DF2204 CVT tractor as the test platform according to the working requirements of autonomous tractors. We also designed the hardware platform of AAV, which was divided into computing layer, sensing layer and actuation layer. Based on the idea of modularization and hierarchy, a software architecture that meets the job requirements was developed with ROS as the middleware, which includes localization, planning, control, CAN communication, and safety modules. And a CAN bus protocol to meet the needs of vehicle control was developed. According to the control characteristics and operation requirements of the CVT tractor, a lateral control module and a longitudinal velocity control module were designed. We counted 22 straight working paths with a total working time of 5 943 s (excluding supplemental seeds and fertilizers), of which the total working time of the straight working stage was 4 037 s and the time of the U-turn stage was 1 906 s, approximately 32% of the total working time. The efficiency of our system was 1.33 hm² /h, and the experimental result shows that the communication node could meet the communication requirements of 50 Hz.The target speed was set to 3 km/h when the tractor turns around, while the harrow was stopped and the seeder was lifted. The engine load was lower when the tractor makes a U-turn, and the torque percentage fluctuates between 10%-30%. After several seconds the engine load continued to increase, and the torque output percentage remained above 80%, with a maximum value of 94%. The engine and transmission will perform a torque reserve in order to meet the instantaneous torque demand (such as increased resistance, climbing, etc.). When the engine revs is higher than the revs corresponding to the torque peak, the increased load will cause the engine to overload, thereby reducing the revs and ego velocity, so as to output more torque. The average lateral error is 2.96 cm and the navigation error was 11.69 cm. The velocity RMSE is 0.98 km/h and MAE was 0.68 km/h. The steering angle RMSE was 1.91°, and MAE was 1.47°. This research shows that the tractor based on wire control technology and CVT tractor can fit the needs of autonomous agricultural vehicles, and the control and planning modules can meet sowing operations. This research could provide a reference for the unmanned upgrading of CVT tractors, and improve the intelligent level and operation efficiency of agricultural machinery. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Frontiers of Computer Science & Technology is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Railway Signalling & Communication Engineering is the property of Railway Signalling & Communication Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Ordnance Industry Automation is the property of Editorial Board for Ordnance Industry Automation and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Coal Science & Technology (0253-2336) is the property of Coal Science & Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Railway Signalling & Communication Engineering is the property of Railway Signalling & Communication Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Tunnel Construction / Suidao Jianshe (Zhong-Yingwen Ban) is the property of Tunnel Construction Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

With the development of the Internet and the expansion of the application of IPv6, the IP addressing engine must meet the three characteristics of high bandwidth, low search latency, and large capacity. However, the existing methods cannot simultaneously meet the above requirements. Therefore, a new IPv6 addressing algorithm is proposed here, which uses the prefix feature to construct a data structure to meet future application requirements. According to the prefix length distribution and density, it clusters them into clusters with similar characteristics, and then encodes them in a hybrid dictionary tree. The resulting data structure with memory efficiency and scalability can be stored in a low-latency memory, and allows parallelization and pipelining of the traversal process in order to support high bandwidth on the hardware. Experimental results show that the proposed algorithm reduces the amount of memory required for each prefix by 87%. In addition, when implemented on the most advanced field programmable gate array, the architecture can support processing 588 million packets per second. [ABSTRACT FROM AUTHOR]

Copyright of Railway Signalling & Communication Engineering is the property of Railway Signalling & Communication Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In order to solve the problem of low audit efficiency due to the use of power exponent, bilinear mapping, point hash mapping and other expensive operations in the existing certificateless cloud auditing scheme, an efficient certificateless cloud auditing scheme was designed in this paper. In the key generation stage, combined with the certificateless signature technology, the user's public and private keys were generated by the key generating center (KGC) in cooperation with the user, so that the strong dependence of auditing system security on KGC security was avoided. Consequently, the shortcomings of complex public key certificate management under the public key infrastructure (PKI) system and the inherent key escrow issues under the identity-based cloud audit scheme were solved. In the data preprocessing stage, the data was encrypted and divided into blocks. Therefore, the data content privacy was protected and the calculation and communication overhead of the scheme was reduced. In the data dynamic update stage, the virtual index data structure was used to realize the insertion, deletion and modification of data blocks. As a result, the extra computational overhead caused by label recalculation was avoided. In the data auditing stage, the task of users to verify the integrity evidence was replaced by a third party auditor (TPA), which reduces the user's computational burden. In the section of security analysis, it was proved that the substitution attack from the cloud was resisted, the privacy protection was achieved, and the forgery attacks by two types of adversaries were resisted. In the performance analysis part, numerical analysis and comparison of the proposed scheme with the existing schemes were carried out on the JPBC library. The experiments show that the proposed scheme significantly reduces the computational cost. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Mine Automation is the property of Industry & Mine Automation Editorial Department and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Guangxi Normal University - Natural Science Edition is the property of Gai Kan Bian Wei Hui and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

With the advent of the digital society, data has become an important factors of productivity. In order to fully realize the values of data, access control as a technology of data security sharing is a fundamental component of data security and data governance. Therefore, this paper proposed a cipher-text access control scheme based on blockchain aiming at improving security of cipher-text and secret key in distributed architecture. Firstly, this scheme verified the authenticity and integrity of outsourced cipher-text storage by using cipher-text generation algorithm and verifiable smart contract. Secondly, it designed an attribute key based on off-chain secure multi-party computation (SMC) to ensure the security of the user's secret key and the uniqueness of the secret key, which could reduce computational complexity of the single attribute authority, and could effectively protect the user's attribute privacy and avoided the single point of failure. Finally, through defining the formatted transaction data structure, it realized the whole process accountability of access control on the blockchain. Security analysis, performance analysis and experimental simulation results show that proposed scheme meets the requirements of general blockchain in terms of security and performance, and provides a general block chain access control scheme for data sharing. [ABSTRACT FROM AUTHOR]

Traditional time series prediction methods often confront problems such as different sampling frequency between variables and complex data correlation when dealing with complex and rich big data. Based on Lasso algorithm and mixed data sampling (MIDAS) method, this paper proposed a mixed-frequency time series prediction model Lasso-MIDAS without changing the data structure. It combined the mixed-frequency information processing mechanism of MIDAS and the compression characteristics of Lasso algorithm to achieve the estimation and prediction, and to modify the most effective set of mixed-frequency variables in real time. According to the common regularization method Ridge regression, this paper also designed a mixed-frequency data model Ridge-MIDAS for comparison. Experimental results show that Lasso-MIDAS is superior to the standard MIDAS model and comparison models in terms of prediction performance, which verifies the effectiveness of the this method in mixed-frequency time series prediction. [ABSTRACT FROM AUTHOR]

Traditional cache algorithms have problems such as low hit rate and high exchange rate. And the existing caching algorithm is not applicable in the distributed big data storage system. This paper proposed an adaptive caching strategy based on frequent sequence mining. This method used a data mining algorithm to mine the frequent sequences in the historical access window, and merged the frequent sequences to construct a set of matching patterns for query. When a new access coming, matched the subsequence within the fixed access length with the matching pattern set, and then prefetched the data according to the matching result, and combined with the modified S4 LRU (4-segmented least recently used) data structure for cache data exchange out. This paper conducted simulation experiments on the public big data processing trace set. The experimental results show that, under different cache sizes, compared with the existing typical cache algorithms, the proposed algorithm increases the average hit rate by 0.327 times and the average exchange rate reduces by 0.33 times, at the same time has the characteristics of low overhead and high time efficiency. This result shows that the proposed method is a more effective caching strategy than the traditional replacement algorithm. [ABSTRACT FROM AUTHOR]

Aiming at the sensor network lifetime problem (SNLP), a sensor network coverage model and its data structure are proposed, and the problem is equivalent to its dual problem, namely minimum weight sensor coverage problem. Firstly, SNLP is constructed as a package linear programming. After finding different sensor coverage satisfying sensor network constraints, the sensor network life is maximized by allocating time for each sensor coverage. Secondly, for solving SNLP, three centralized solving methods are proposed, which are based on Garg- Konemann algorithm, greedy algorithm considering partial sensor coverage and constant approximation algorithm considering communication cost. At the same time, a distributed solving method based on global reshuffle is proposed. The reshuffle is triggered when the initial energy supply of a sensor drops to a certain predefined threshold value H among active, idle and intermediate vulnerable states, thus the sensor network lifetime is improved by using smart self- organizing monitoring schedules. Simulation results show that the proposed SNLP, which is based on sensor network coverage model and data structure, and its solving method can achieve preferable running time, network life and network overhead. [ABSTRACT FROM AUTHOR]

Copyright of Control Theory & Applications / Kongzhi Lilun Yu Yinyong is the property of Editorial Department of Control Theory & Applications and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Piezoelectrics & Acoustooptics is the property of Piezoelectric & Acoustooptic and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)