检索结果-内蒙古大学图书馆

OpenPDM-based product data exchange among heterogeneous PDM systems in a distributed environment

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2009年第9-10期40卷 1033-1043页

作者： Yang, Jeongsam Han, Soonhung Grau, Matthias Mun, Duhwan Ajou Univ Div Ind & Informat Syst Engn Suwon 443749 South Korea Korea Adv Inst Sci & Technol Dept Mech Engn Taejon 305701 South Korea PROSTEP ITS GmbH D-21129 Hamburg Germany KORDI Adv Transportat Syst Res Div Maritime & Ocean Engn Res Inst Taejon 305343 South Korea

In a global product development environment, more and more companies are implementing distributed engineering processes in order to shorten the time to market and merge different core competences. One of the important issues in collaborative product development during the whole product creation is to easily and quickly access the digital product definition models and documents of relevant partners. The essential problems of product data distribution are that each partner has to know what information to find in which system, how to collect the necessary information from individual systems, and how to assemble partial information so that it becomes complete. Even more difficult is the need to ensure the partner adapts to every change in the distribution model of information. To solve these problems, we propose the OpenPDM-based product data exchange method among heterogeneous PDM systems, which is a concept of a virtual data warehouse that provides data access to all partners in a distributed environment. The method is effective for partners who require real-time access to data residing in multiple heterogeneous PDM systems. We also implemented an integrated PDM system for logically linking product data which are physically distributed, and we used this system in a data exchange experiment.

关键词： data exchange distributed data management OpenPDM PDTnet Product data management (PDM) STEP PDM schema

来源：评论

学校读者我要写书评

暂无评论

Integration of end-user Cloud storage for CMS analysis

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2018年第Part3期78卷 1079-1082页

作者： Riahi, Hassen Aimar, Alberto Ayllon, Alejandro Alvarez Balcas, Justas Ciangottini, Diego Hernandez, Jose M. Keeble, Oliver Magini, Nicolo Manzi, Andrea Mascetti, Luca Mascheroni, Marco Tanasijczuk, Andres Jorge Vaandering, Eric Wayne European Org Nucl Res CH-1211 Geneva 23 Switzerland CALTECH Pasadena CA 91125 USA Univ Perugia Via Alessandro Pascoli I-06123 Perugia Italy INFN Perugia Via Alessandro Pascoli I-06123 Perugia Italy CIEMAT E-28040 Madrid Spain Fermi Natl Lab Batavia IL 60510 USA Univ Calif San Diego La Jolla CA 92093 USA

End-user Cloud storage is increasing rapidly in popularity in research communities thanks to the collaboration capabilities it offers, namely synchronisation and sharing. CERN IT has implemented a model of such storage named, CERNBox, integrated with the CERN AuthN and AuthZ services. To exploit the use of the end-user Cloud storage for the distributed data analysis activity, the CMS experiment has started the integration of CERNBox as a Grid resource. This will allow CMS users to make use of their own storage in the Cloud for their analysis activities as well as to benefit from synchronisation and sharing capabilities to achieve results faster and more effectively. It will provide an integration model of Cloud storages in the Grid, which is implemented and commissioned over the world's largest computing Grid infrastructure, Worldwide LHC Computing Grid (WLCG). In this paper, we present the integration strategy and infrastructure changes needed in order to transparently integrate end-user Cloud storage with the CMS distributed computing model. We describe the new challenges faced in data management between Grid and Cloud and how they were addressed, along with details of the support for Cloud storage recently introduced into the WLCG data movement middleware, FTS3. The commissioning experience of CERNBox for the distributed data analysis activity is also presented. (C) 2017 Published by Elsevier B.V.

关键词： data transfer protocols Cloud storage distributed data management distributed data analysis

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Approach Processing Scheme Based on BLAST for Improving Search Speed of Bioinformatics

引用

WIRELESS PERSONAL COMMUNICATIONS 2019年第2期105卷 405-426页

作者： Jeong, Yoon-Su Shin, Seung-Soo Mokwon Univ Dept Informat Commun Engn 88 Doanbuk Ro Daejeon 35349 South Korea Tongmyong Univ Dept Informat Secur 428 Sinseonno Busan 48520 South Korea

As researchers on bioinformatics using heuristic algorithms have been increasingly studied, information management used in various bioinformatics fields (new drug development, medical diagnosis, agricultural product improvement, etc.) has been studied mainly on BLAST algorithm. However, many of the algorithms that are being used in the large genome database use a complete sorting procedure, which takes a lot of time to search the database for proteins or nucleic acid sequences, which causes many problems in processing large amounts of bio information. We propose a BLAST-based probabilistic access processing method that can manage, analyze and process a large amount of bio data distributed based on information communication infrastructure and IT technology. The proposed method aims to improve the accessibility of data by linking weighted bioinformatics information with probability factors to easily access large capacity bio data. In addition, the proposed scheme classifies the priority information allocated to the bioinformatics information by hierarchical grouping according to the degree of similarity, thereby ensuring high accuracy of the search results of the bioinformatics information, and at the same time, the goal is to obtain low processing time by classifying information (type, attribute, priority, etc.) into weights by property. Previous researchers have suggested clustering algorithms for fragmentation of genetic information to solve the problem of haplotype assembly in genetics, or proposed particle swarm optimization methods similar to existing genetic algorithms using heuristic clustering method based on MEC model. In the performance evaluation, the proposed method improved the accuracy by average 13.5% and the efficiency of the data retrieval by average 19.7% more than previous scheme. The overhead of Bioinformatics information processing was 8.8% lower and the processing time was average 13.5% lower.

关键词： Bioinformatics BLAST Probability distributed data management Algorithm Cloud Networking Computing

来源：评论

学校读者我要写书评

暂无评论

Managing Big Interval data with CINTIA: The Checkpoint INTerval Array

引用

IEEE TRANSACTIONS ON BIG data 2021年第2期7卷 285-298页

作者： Mavlyutov, Ruslan Cudre-Mauroux, Philippe Univ Fribourg eXascale Infolab CH-1700 Fribourg Switzerland

Intervals have become prominent in data management as they are the main data structure to represent a number of key data types such as temporal or genomic data. Yet, there exists no solution to compactly store and efficiently query big interval data. In this paper we introduce CINTIA-the Checkpoint INTerval Index Array-an efficient data structure to store and query interval data, which achieves high memory locality and outperforms state-of-the art solutions. We also propose a low-latency, Big data system that implements CINTIA on top of a popular distributed file system and efficiently manages large interval data on clusters of commodity machines. Our system can easily be scaled-out and was designed to accommodate large delays between the various components of a distributed infrastructure. We experimentally evaluate the performance of our approach on several datasets and show that it outperforms current solutions by several orders of magnitude in distributed settings.

关键词： Indexes Arrays Complexity theory Big data Bioinformatics Genomics Interval data low-latency scalability distributed data management

来源：评论

学校读者我要写书评

暂无评论

Concurrency control issues in Grid databases

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2007年第1期23卷 154-162页

作者： Taniar, David Goel, Sushant Monash Univ Clayton Sch Informat Technol Clayton Vic 3168 Australia Kaz Grp Ltd Turner ACT Australia

Grid architecture is a fast evolving distributed computing architecture. The working of databases in the Grid architecture is not well understood. In view of changing distributed architecture we strongly feel that concurrency control issues should be revisited and reassessed for this new and evolving architecture. Implementing global lock table and global log records may not be practically possible in the Grid architecture due to the scalability issues. In this paper, we propose a correctness criterion and the Grid concurrency control protocol, which has the capability to deal with heterogeneity, autonomy, distribution and high volume of data in Grids. We then prove the correctness of the protocol followed by performance evaluation of the protocol. (C) 2006 Elsevier B.V. All rights reserved.

关键词： Grid database data grid concurrency control protocol distributed data management transaction management

来源：评论

学校读者我要写书评

暂无评论

Building a scientific data grid with DIGS

引用

PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES 2009年第1897期367卷 2471-2481页

作者： Beckett, Mark G. Allton, Chris R. Davies, Christine T. H. Davis, Ilan Flynn, Jonathan M. Grant, Eilidh J. Hamilton, Russell S. Irving, Alan C. Kenway, R. D. Ostrowski, Radoslaw H. Perry, James T. Swedlow, Jason R. Trew, Arthur Univ Edinburgh Sch Phys & Astron Edinburgh EH9 3JZ Midlothian Scotland Univ Coll Swansea Dept Phys Swansea SA2 8PP W Glam Wales Univ Glasgow Dept Phys & Astron Glasgow G12 8QQ Lanark Scotland Univ Oxford Dept Biochem Oxford OX1 3QU England Univ Southampton Sch Phys & Astron Southampton SO17 1BJ Hants England Univ Liverpool Dept Math Sci Liverpool L69 3BX Merseyside England Univ Dundee Coll Life Sci Dundee DD1 5EH Scotland

We provide an insight into the challenge of building and supporting a scientific data infrastructure with reference to our experience working with scientists from computational particle physics and molecular biology. We illustrate how, with modern high-performance computing resources, even small scientific groups can generate huge volumes (petabytes) of valuable scientific data and explain how grid technology can be used to manage, publish, share and curate these data. We describe the DIGS software application, which we have developed to meet the needs of smaller communities and we have highlighted the key elements of its functionality.

关键词： scientific data infrastructure distributed data management grid molecular biology computational particle physics

来源：评论

学校读者我要写书评

暂无评论

A Structured Overlay Network Scheme Based on Multiple Different Time Intervals

引用

JOURNAL OF INFORMATION PROCESSING SYSTEMS 2020年第6期16卷 1447-1458页

作者： Kawakami, Tomoya Univ Fukui Grad Sch Engn Fukui Japan

This paper describes a structured overlay network scheme based on multiple different time intervals. Many types of data (e.g., sensor data) can be requested at specific time intervals that depend on the user and the system. These queries are referred to as "interval queries." A method for constructing an overlay network that efficiently processes interval queries based on multiple different time intervals is proposed herein. The proposed method assumes a ring topology and assigns nodes to a keyspace based on one-dimensional time information. To reduce the number of forwarded messages for queries, each node constructs shortcut links for each interval that users tend to request. This study confirmed that the proposed method reduces the number of messages needed to process interval queries. The contributions of this study include the clarification of interval queries with specific time intervals;establishment of a structured overlay network scheme based on multiple different time intervals;and experimental verification of the scheme in terms of communication load, delay, and maintenance cost.

关键词： Communication Load Reduction distributed data management Interval Query Ring-Shaped Overlay Network Sensor data Temporal data

来源：评论

学校读者我要写书评

暂无评论

COMPUTER-ASSISTED data-COLLECTION IN MULTICENTER EPIDEMIOLOGIC RESEARCH - THE ATHEROSCLEROSIS RISK IN COMMUNITIES STUDY

引用

CONTROLLED CLINICAL TRIALS 1990年第2期11卷 101-115页

作者： CHRISTIANSEN, DH HOSKING, JD DANNENBERG, AL WILLIAMS, OD NHLBI BETHESDA MD 20205 USA

The Atherosclerosis Risk in Communities (ARIC) Study uses a computer-assisted data collection (CADC) system in which staff at four Field Centers directly record into microcomputers much of the data obtained form the 16,000 study participants during 4 hours of interviews and exams. A pilot study was conducted to evaluate the feasibility of training, Field Center staff in the use fo a CADC system and to assess study participants'' reaction to such a system. When asked to compare CADC to a paper-based system, all five of the pilot study staff members preferred the CADC system. The 16 pilot study participants either had no preferene (63%) or preferred CADC (37%). With respect to data quality, no systematic differences between the two methods of data collection were evident in the pilot study. The CADC system required approximately 10% longer for data collection, keying, and editing than the paper-based system took for collection alone. Immediate data entry in a CADC system may improve data quality by eliminating a transcription step and by allowing prompt detection of suspicious values while the participant is still available to provide confirmation or correction. CADC simplifies data collection by automating complex branching questions and can enhance data completeness. The ARIC CADC systems is based on commercially available software customized by the study''s Coordinating Center. The microcomputer-based CADC system described in this report may serve as the prototype for future epidemiologic studies that collect standardized data on large numbers of participants at a small numbers of sites.

关键词： data collection in epidemiologic studies distributed data management remote data entry data quality control

来源：评论

学校读者我要写书评

暂无评论

FILE ALLOCATION IN A distributed COMPUTER-COMMUNICATION NETWORK

引用

IEEE TRANSACTIONS ON COMPUTERS 1983年第3期32卷 232-244页

作者： LANING, LJ LEONARD, MS UNIV MISSOURI DEPT IND ENGNCOLUMBIAMO 65201 UNIV CINCINNATI SCH BUSINESSCINCINNATIOH 45221

An algorithm is presented to determine locations for the storage of copies of files in store-and-forward computer communications networks. The algorithm determines storage locations which minimize the sum of network file storage costs and message transmission costs. Networks that use adaptive routing techniques are the primary focus. Feasible file locations must satisfy network performance requirements for file availability and delay by message class. An effective method of evaluating delay constraints for networks using adaptive routing techniques is introduced. The algorithm uses the solution to a p-median problem to identify initial candidate file placements. Interaction between a set of file movement rules and a network simulator is employed to modify initial placements to fmd near-optimal locations which satisfy the network performance constraints.

关键词： Adaptive routing P-median algorithm computer communication network distributed data management file"allocation heuristic mathematical programming network delay simulation

来源：评论

学校读者我要写书评

暂无评论

A COMPREHENSIVE MODEL FOR THE DESIGN OF distributed COMPUTER-SYSTEMS

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1987年第10期13卷 1092-1104页

作者： JAIN, HK Sch. Bus. Adm. Univ. Wisconsin Milwaukee WI 53201 USA

The task of finding the optimal integration of computers of varying power is complex, since the designer of a system may have conflicting objectives, including low investment and operating cost, fast response to user queries, and higher data availability. It may be difficult, if not impossible, to select proper alternatives without computational aid. The distributed computer system design problem of choosing a proper class of processor for each location and of allocating data files/databases is addressed. The initial design is based on the kinds of transactions and their volume and the number of files expected in the system. A goal programming approach is proposed to assist the designer in arriving at a good design in this multiobjective environment. The problem is formulated as a nonlinear goal programming problem, and a heuristic based on a modified pattern search approach is utilized to arrive at a good solution.

关键词： Software Path Length distributed data management distributed System File Allocation File Availability Goal Programming Processing Cost

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：