A Model for Mechanism Data Storage

1992 ◽  
Author(s):  
Wan Wang
Keyword(s):  
Data Storage ◽  
Data Model ◽  
Computer Time ◽  
Kinematic Structure ◽  
Topological Graph ◽  
Complete Set ◽  
Isomorphism Identification

Abstract A data model for kinematic structure of mechanisms and its coding principle are proposed, based on the topological graph and contract graph. In the model every basic chain is mapped by a code of 5 decimal digits and a mechanism is mapped by a set of code of basic chains. The model occupies minimal memory, and contains a complete set of useful primary parameters of structure, and significantly reduce computer time for isomorphism identification.

scholarly journals Storing Hypergraph-Based Data Models in Non-hypergraph Data Storage and Applications for Information Systems

2021 ◽  
pp. 1-21
Author(s):  
Bálint Molnár ◽  
András Béleczki ◽  
Bence Sarkadi-Nagy
Keyword(s):  
Information Systems ◽  
Data Storage ◽  
Data Model ◽  
Relational Data ◽  
Complex Data ◽  
Graph Representations ◽  
Relational Data Model ◽  
Rich Information ◽  
The Relationship

Data structures and especially the relationship among the data entities have changed in the last couple of years. The network-like graph representations of data-model are becoming more and more common nowadays, since they are more suitable to depict these, than the well-established relational data-model. The graphs can describe large and complex networks — like social networks — but also capable of storing rich information about complex data. This was mostly of relational data-model trait before. This also can be achieved with the use of the knowledge representation tool called “hypergraphs”. To utilize the possibilities of this model, we need a practical way to store and process hypergraphs. In this paper, we propose a way by which we can store hypergraphs model in the SAP HANA in-memory database system which has a “Graph Core” engine besides the relational data model. Graph Core has many graph algorithms by default however it is not capable to store or to work with hypergraphs neither are any of these algorithms specifically tailored for hypergraphs either. Hence in this paper, besides the case study of the two information systems, we also propose pseudo-code level algorithms to accommodate hypergraph semantics to process our IS model.

scholarly journals New developments on EDR (Event Data Recorder) for automated vehicles

2020 ◽  
Vol 10 (1) ◽  
pp. 140-146
Author(s):  
Klaus Böhm ◽  
Tibor Kubjatko ◽  
Daniel Paula ◽  
Hans-Georg Schweiger
Keyword(s):  
Data Base ◽  
Data Storage ◽  
Data Model ◽  
Working Group ◽  
Storage System ◽  
Data Access ◽  
Event Data ◽  
Automated Vehicles ◽  
Automated Driving ◽  
Quantum Leap

AbstractWith the upcoming new legislative rules in the EU on Event Data Recorder beginning 2022 the question is whether the discussed data base is sufficient for the needs of clarifying accidents involving automated vehicles. Based on the reconstruction of real accidents including vehicles with ADAS combined with specially designed crash tests a broader data base than US EDR regulation (NHTSA 49 CFR Part 563.7) is proposed. The working group AHEAD, to which the authors contribute, has already elaborated a data model that fits the needs of automated driving. The structure of this data model is shown. Moreover, the special benefits of storing internal video or photo feeds form the vehicle camera systems combined with object data is illustrated. When using a sophisticate 3D measurement method of the accident scene the videos or photos can also serve as a control instance for the stored vehicle data. The AHEAD Data Model enhanced with the storage of the video and photo feeds should be considered in the planned roadmap of the Informal Working Group (IWG) on EDR/ DSSAD (Data Storage System for Automated Driving) reporting to UNECE WP29. Also, a data access over the air using technology already applied in China for electric vehicles called Real Time Monitoring would allow a quantum leap in forensic accident reconstruction.

scholarly journals PyCOMPSs: Parallel computational workflows in Python

2016 ◽  
Vol 31 (1) ◽  
pp. 66-82 ◽  
Author(s):  
Enric Tejedor ◽  
Yolanda Becerra ◽  
Guillem Alomar ◽  
Anna Queralt ◽  
Rosa M Badia ◽  
...  
Keyword(s):  
Data Storage ◽  
Message Passing ◽  
Programming Model ◽  
Runtime System ◽  
Data Dependencies ◽  
Parallel Tasks ◽  
Complete Set ◽  
Scientific Libraries ◽  
Python Programming ◽  
Big Data Storage

The use of the Python programming language for scientific computing has been gaining momentum in the last years. The fact that it is compact and readable and its complete set of scientific libraries are two important characteristics that favour its adoption. Nevertheless, Python still lacks a solution for easily parallelizing generic scripts on distributed infrastructures, since the current alternatives mostly require the use of APIs for message passing or are restricted to embarrassingly parallel computations. In that sense, this paper presents PyCOMPSs, a framework that facilitates the development of parallel computational workflows in Python. In this approach, the user programs her script in a sequential fashion and decorates the functions to be run as asynchronous parallel tasks. A runtime system is in charge of exploiting the inherent concurrency of the script, detecting the data dependencies between tasks and spawning them to the available resources. Furthermore, we show how this programming model can be built on top of a Big Data storage architecture, where the data stored in the backend is abstracted and accessed from the application in the form of persistent objects.

Intelligent Design of Mechanism Kinematic Chains by Advanced Optimal Methods

2011 ◽  
Vol 201-203 ◽  
pp. 2182-2185
Author(s):  
Miao Zhang ◽  
Ning Bo Liao ◽  
Chen Zhou ◽  
Xi Tao
Keyword(s):  
Graph Theory ◽  
Intelligent Design ◽  
Kinematic Structure ◽  
Kinematic Chains ◽  
Complicated Problem ◽  
Optimal Methods ◽  
Advantages And Disadvantages ◽  
Mechanism Kinematic ◽  
Isomorphism Identification ◽  
Structure Enumeration

When using graph theory to conduct intelligent design for kinematic structure enumeration, the isomorphism identification of graphs is an important and complicated problem. In this paper, the methodology of transferring isomorphism identification into optimization issue was introduced. Then the recent development of applying advanced optimal methods for isomorphism identification was reviewed, the advantages and disadvantages of there methods were discussed.

scholarly journals Cooler: scalable storage for Hi-C data and other genomically-labeled arrays

2019 ◽  
Author(s):  
Nezar Abdennur ◽  
Leonid Mirny
Keyword(s):  
Data Storage ◽  
Data Model ◽  
Full Range ◽  
Random Access ◽  
Scalable Algorithms ◽  
Data Resolution ◽  
Data Density ◽  
Cross Platform ◽  
Data Collections ◽  
Python Package

Most existing coverage-based (epi)genomic datasets are one-dimensional, but newer technologies probing interactions (physical, genetic, etc.) produce quantitative maps with two-dimensional genomic coordinate systems. Storage and computational costs mount sharply with data resolution when such maps are stored in dense form. Hence, there is a pressing need to develop data storage strategies that handle the full range of useful resolutions in multidimensional genomic datasets by taking advantage of their sparse nature, while supporting efficient compression and providing fast random access to facilitate development of scalable algorithms for data analysis. We developed a file format called cooler, based on a sparse data model, that can support genomically-labeled matrices at any resolution. It has the flexibility to accommodate various descriptions of the data axes (genomic coordinates, tracks and bin annotations), resolutions, data density patterns, and metadata. Cooler is based on HDF5 and is supported by a Python library and command line suite to create, read, inspect and manipulate cooler data collections. The format has been adopted as a standard by the NIH 4D Nucleome Consortium. Cooler is cross-platform, BSD-licensed, and can be installed from the Python Package Index or the bioconda repository. The source code is maintained on Github at https://github.com/mirnylab/cooler.

scholarly journals Design and Implementation of Police Mobile GIS Command System

2018 ◽  
Vol 1 (1) ◽  
pp. 12
Author(s):  
Chao Wang
Keyword(s):  
Data Storage ◽  
Mobile Internet ◽  
General Idea ◽  
Public Security ◽  
Mobile Gis ◽  
Design And Implementation ◽  
Complete Set ◽  
Integration Data ◽  
Office System ◽  
Information Networking

The current situation and demand of police management based on geographic information, networking, cloud computing, webService, arcgisServer and Wencheng public security, put forward the general idea to build a set of mobile police office system, and discusses the SOA architecture, data integration, data mining, data storage and visualization of mobile Internet the key content of the final completion of a complete set of police mobile command system GIS.

Implementation of an approach for variable data insertion procedures synthesis for structureindependent databases

2021 ◽  
pp. 86-89
Author(s):  
A.S. Grishchenko ◽  
Keyword(s):  
Data Storage ◽  
Data Model ◽  
Property Value ◽  
Storage Unit ◽  
Object Property ◽  
Minimum Data ◽  
Database Structure ◽  
Successful Testing ◽  
Variable Data ◽  
Semantically Heterogeneous

The aim of this work is to implement an approach for the synthesis of variable data insertion procedures for structureindependent databases. This approach makes it possible to synthesize procedures for inserting data into databases, in which two types of inhomogeneities will be absent: inhomogeneities associated with various forms of representation of minimal structural units; semantic heterogeneities associated with the use of elements that are semantically heterogeneous to the elements of the structure of a structure-independent database. Due to the absence of these inhomogeneities, the productivity of the procedures will be increased in comparison with the initial one. The approbation is carried out on the example of a structure-independent database based on the Tenzer data model. As a result of the work carried out, the following were obtained: the minimum unit of data storage for the database, built on the basis of the Tenzer model; algorithm of action using the developed minimum data storage unit; procedure code. As the minimum data storage unit, a triple of the form <Object, Property, Value> was chosen, and checking the obtained algorithm of actions showed that all the elements present are homogeneous to the database structure based on the Tenzer data model, which indicates the successful testing of this approach.

Construction of Baranov Trusses Using a Single Universal Construction Rule

2016 ◽  
Author(s):  
Elad Hahn ◽  
Offer Shai
Keyword(s):  
Graph Theory ◽  
Construction Rule ◽  
Graph Representation ◽  
Kinematic Structure ◽  
Mathematical Basis ◽  
Synthesis Of Mechanisms ◽  
Complete Set ◽  
Universal Construction ◽  
Planar Linkages ◽  
Mechanism Theory

The kinematic structure of Baranov trusses has been widely studied in the field of mechanism theory. Baranov trusses are seen as the fundamental planar linkages which are a basis for all other planar linkages. As such, they have been used for synthesis of mechanisms as well as their analysis. However, up until now only a limited number Baranov trusses are known and cataloged. In this paper, a method is proposed for generation of Baranov trusses using a new graph representation suitable for linkages of the sort. This method, named the Universal construction rule, is capable of generating a complete set of all feasible Baranov trusses with any number of links. The method has been proven using a mathematical basis from rigidity theory. It is based on the correspondence between Baranov trusses and Assur groups, which are reformulated in terms of graph theory to be known as Assur graphs.

Mechanism isomorphism identification based on artificial fish swarm algorithm

2021 ◽  
pp. 095440622097756
Author(s):  
Huijun Yi ◽  
Jianpei Wang ◽  
Yongle Hu ◽  
Ping Yang
Keyword(s):  
High Efficiency ◽  
Kinematic Chain ◽  
Topological Graph ◽  
Artificial Fish Swarm Algorithm ◽  
Cad System ◽  
Fish Model ◽  
Artificial Fish Swarm ◽  
Swarm Algorithm ◽  
Mechanism Kinematic ◽  
Isomorphism Identification

The aim of this paper is to propose a practical solution for mechanism kinematic chain isomorphism identification – an artificial fish swarm algorithm. The artificial fish model of mechanism isomorphism identification is established, and behavioral way of the artificial fish is designed. According to isomorphism identification features of topological graph, the process of mechanism isomorphism identification based on artificial fish swarm algorithm is confirmed. The rationality and reliability of artificial fish swarm algorithm on the isomorphic identification of mechanism have been illustrated by a specific example, which provides a new method for intelligent CAD system design of mechanism. It builds a basis for future work in isomorphism identification of mechanism with high efficiency. Isomorphic identification of mechanism will contribute to rational qualitative analysis of mechanism design, perfection of irrationality can be done timely, which is the key factor for mechanical manufacturing. In this paper, we introduce the mechanism kinematic chain firstly, then optimization of artificial fish swarm algorithm is illustrated, and it is shown that how fish swarm algorithm is applied to mechanism kinematic chain. Finally, the feasibility and efficiency of the method are verified by the example of 10 bars, and the complex mechanism can be identified by the example of 14 bars and 18 bars.

Sign in / Sign up

Export Citation Format

Share Document