Applied Mechanics and Materials
Vol. 421
Vol. 421
Applied Mechanics and Materials
Vol. 420
Vol. 420
Applied Mechanics and Materials
Vol. 419
Vol. 419
Applied Mechanics and Materials
Vol. 418
Vol. 418
Applied Mechanics and Materials
Vols. 416-417
Vols. 416-417
Applied Mechanics and Materials
Vol. 415
Vol. 415
Applied Mechanics and Materials
Vols. 411-414
Vols. 411-414
Applied Mechanics and Materials
Vols. 409-410
Vols. 409-410
Applied Mechanics and Materials
Vols. 405-408
Vols. 405-408
Applied Mechanics and Materials
Vol. 404
Vol. 404
Applied Mechanics and Materials
Vols. 401-403
Vols. 401-403
Applied Mechanics and Materials
Vols. 397-400
Vols. 397-400
Applied Mechanics and Materials
Vols. 395-396
Vols. 395-396
Applied Mechanics and Materials Vols. 411-414
Paper Title Page
Abstract: During the past fifty years, many metadata schemas have been developed in a variety of disciplines. In this paper, we delve into five state-of-the-art metadata schemas that are widely used in scientific publishing areas and most related to our research, i.e. Dublin Core, LOM, BiBTeX, Schema.org and SKO Types.
349
Abstract: The multiple-institutions-based collaborated researchers securely exchange information and data sharing to gain insight into complex, variable diseases from many different types of information in various institutions. A novel approach to biorepository management scheme for information integration is presented. It integrates a large number of data types through a unified standardization. Local biorepository is the largest collection of local data. Central biorepository that integrates of all the local biorepository information can be shared and is the largest available collection of shared information resources. The key point between central biorepository and local biorepository is in two ways: The integration of local biorepository data; local biorepository queries and downloads the data from the database system. This method realizes a good harvesting feature from local biorepository to central biorepository; local biorepository can also access database system to obtain data sharing in a distributed environment.
353
Abstract: The data management of urban and rural planning is very important and special. It is quite necessary to customize a thematic database system for urban and rural planning. According to their characteristics and classifications, the requirements of this system are firstly analyzed in this paper. With the integration of traditional relation database management system and geographical information system, an extendable data model for this thematic database is proposed. In this model, Client/Server architecture is adopted, Oracle is extended to store both attribute data and spatial data, and spatial database engine is utilized to access the spatial data in Oracle. At the client side, some functional modules such as data import and export, browse and display, query and retrieval, update and maintain, and security management are designed and developed. Finally, a case study of the thematic database system is applied. It is concluded that the customized spatial database management system for urban and rural planning is not only able to unify and store all types of data, but also able to improve the efficiency and visualization.
357
Abstract: In this paper, we study the characteristics of analytical query processing and proposed a histogram based approximate method for query processing over massive data. We implemented this approach into Hive system and evaluate it with Hive and BlinkDB cluster, the experimental results verified that our method is significantly fast than these existing techniques.
362
Abstract: In high-dimensional index, overflow split has been verified to be critical to the performance of kNN query processing. A node is split into two parts in the traditional way, however, these methods tend to result in many overlap regions in high-dimensional spaces which will significantly degrade the performance of retrieval. In this paper, we propose a method named KSR-Tree, it making use of a clustering based split algorithm to divides the node into multiple parts, and most of overlap regions will guarantee to be placed into the same node. This approach not only increased the capacity for newly arrived records, but also decreases the splitting overhead and reduces the overlap regions, thus the frequency of node splitting will reduced and meanwhile the retrieval performance obtains improvement. In the experiments, our results showed that the performance KSR-Tree significantly improved the performance of kNN query processing.
366
Abstract: This paper mainly introduces the design idea of real-time database in embedded configuration software. According to the characteristics of real-time database, this paper using three layer storage structures which consist of shared memory, file system and general database. It improves the access efficiency of real-time database and data reliability in a timely manner.
370
Abstract: Irrigation experimental data is the basement of irrigation engineering design, area water resources optimization, agricultural water management and the future water right allocation and management. According to the backward situation that the management, coordinating, pigeonholing, inquiring of the irrigation experimental data was still accomplished manually at preset. This paper provides an overview of database technology. And it describes the design of irrigation information management system database. With current technology development, the paper analyzes the prospects for technology analysis, showing the importance of the technology.
377
Abstract: The traditional metadata cluster write reliability was guaranteed by the large journals. If suddenly the system is powered down, the system crashes, failure of the storage medium bit error in the incident of writing the data and it could cause a loss of metadata and resulting in corruption of the reliability. This will have a huge negative impact on the user application. In this paper we propose a method of Asymmetric Based Update Strategy (ABUS), which can be a good safeguard to keep reliable of the metadata update and can solve the problem of inconsistent between the memory and the disk. It can effectively increasing the metadata cluster update reliability by the way of self-healing in the case of failure and ensure the efficiency of the metadata I/O.
382
Abstract: Negative frequent itemsets (NFIS) like (a1a2¬a3a4) have played important roles in real applications because we can mine valued negative association rules from them. In one of our previous work, we proposed a method, named e-NFIS to mine NFIS from positive frequent itemsets (PFIS). However, e-NFIS only uses single minimum support, which implicitly assumes that all items in the database are of the same nature or of similar frequencies in the database. This is often not the case in real-life applications. So a lot of methods to mine frequent itemsets with multiple minimum supports have been proposed. These methods allow users to assign different minimum supports to different items. But these methods only mine PFIS, doesn’t consider negative ones. So in this paper, we propose a new method, named e-msNFIS, to mine NFIS from PFIS based on multiple minimum supports. E-msNFIS contains three steps: 1) using existing methods to mine PFIS with multiple minimum supports; 2) using the same method in e-NFIS to generate NCIS from PFIS got in step 1; 3) calculating the support of these NCIS only using the support of PFIS and then getting NFIS. Experimental results show that the e-msNFIS is efficient.
386
Abstract: Propose a model extraction approach to abstract the DTD document rapidly, and to eliminate the nested ring in DTD document by using redefining the node name. Map the DTD document that removing ring out to XML document. Analyzes the XQuery query, and does the responding pre-processing, realizes the XQuery program with nested ring structure.
390