Development of Alignment-Based Parametric Data Exchange Schema for Bridge Geometry

2014 ◽  
Vol 2460 (1) ◽  
pp. 22-30 ◽  
Author(s):  
Hanjin Hu ◽  
Stuart S. Chen ◽  
Rohit Srikonda ◽  
Najaf Ali
Keyword(s):  
Data Exchange ◽  
Parametric Data

Systematic Derivation of a Standard Set of Declarative Constraints for Shape Definition in CAD

1999 ◽  
Author(s):  
Bernie Bettig ◽  
Jami Shah
Keyword(s):  
Computer Aided Design ◽  
Data Exchange ◽  
Mechanical Design ◽  
Constraint Solving ◽  
Mathematical Basis ◽  
Parametric Data ◽  
Geometrical Constraints ◽  
Standard Set ◽  
Aided Design ◽  
Systematic Derivation

Abstract This paper describes the derivation of a consistent and comprehensive set of geometrical constraints for shape definition in Computer-Aided Design. These are needed to enable compatibility in parametric data exchange and to promote both standard capabilities and predictable solutions from constraint solving software kernels. The paper look at the mathematical basis for constraints present in the literature and elaborates about all types of constraints that can be described by the same mathematical basis. The approach considers all combinations of distance and angle constraints, on one point or all points of curves and surfaces, as well as transformations and mappings that are required in mechanical design.

Three-Dimensional Parametric Data Exchange for Curved Steel Bridges

2013 ◽  
Vol 2331 (1) ◽  
pp. 27-34 ◽  
Author(s):  
S. Gokhan Karaman ◽  
Stuart S. Chen ◽  
Benny J. Ratnagaran
Keyword(s):  
Data Exchange ◽  
Three Dimensional ◽  
Steel Bridges ◽  
Parametric Data ◽  
Curved Steel

A Programming Language Approach to Parametric CAD Data Exchange

2011 ◽  
Author(s):  
John Altidor ◽  
Jack Wileden ◽  
Jeffrey McPherson ◽  
Ian Grosse ◽  
Sundar Krishnamurty ◽  
...  
Keyword(s):  
Programming Language ◽  
Information Integration ◽  
Computer Aided Design ◽  
Data Exchange ◽  
Cad Systems ◽  
Cad System ◽  
Parametric Data ◽  
Language Research ◽  
Parametric Cad ◽  
Aided Design

Data exchange between different computer-aided design (CAD) systems is a major problem inhibiting information integration in collaborative engineering environments. Existing CAD data format standards such as STEP and IGES enable geometric data exchange. However, they ignore construction history, features, constraints, and other parametric-based CAD data. As a result, they are inadequate for supporting modification, extension and other important higher-level functionality when accessing an imported CAD model from another CAD system. Achieving such higher-level functionality therefore often requires a time-consuming, error-prone, tedious process of manually recreating the model in the target CAD system. Based on techniques adapted from programming language research, this paper presents an approach to exchanging parametric data between CAD systems using formally-defined conversion semantics. We have demonstrated the utility of our approach by developing a prototype implementation that automates the conversion of 2D sketches between two popular CAD systems: Pro/ENGINEER and SolidWorks. We present examples showing that our approach is able to accurately convert parametric CAD data even in cases where models were constructed using operations from the source CAD system that have no direct counterpart in the target CAD system. Although the case study focuses on 2D interoperability, our approach provides formal foundations for supporting 3D and semantic interoperability between CAD systems.

Machine-Scored Syntax: Comparison of the CLAN Automatic Scoring Program to Manual Scoring

2020 ◽  
Vol 51 (2) ◽  
pp. 479-493
Author(s):  
Jenny A. Roberts ◽  
Evelyn P. Altenberg ◽  
Madison Hunter
Keyword(s):  
Data Exchange ◽  
Child Language ◽  
Exchange System ◽  
Absolute Point ◽  
Language Analysis ◽  
Search Patterns ◽  
Language Data ◽  
Report Accuracy ◽  
Point To Point ◽  
Automatic Scoring

Purpose The results of automatic machine scoring of the Index of Productive Syntax from the Computerized Language ANalysis (CLAN) tools of the Child Language Data Exchange System of TalkBank (MacWhinney, 2000) were compared to manual scoring to determine the accuracy of the machine-scored method. Method Twenty transcripts of 10 children from archival data of the Weismer Corpus from the Child Language Data Exchange System at 30 and 42 months were examined. Measures of absolute point difference and point-to-point accuracy were compared, as well as points erroneously given and missed. Two new measures for evaluating automatic scoring of the Index of Productive Syntax were introduced: Machine Item Accuracy (MIA) and Cascade Failure Rate— these measures further analyze points erroneously given and missed. Differences in total scores, subscale scores, and individual structures were also reported. Results Mean absolute point difference between machine and hand scoring was 3.65, point-to-point agreement was 72.6%, and MIA was 74.9%. There were large differences in subscales, with Noun Phrase and Verb Phrase subscales generally providing greater accuracy and agreement than Question/Negation and Sentence Structures subscales. There were significantly more erroneous than missed items in machine scoring, attributed to problems of mistagging of elements, imprecise search patterns, and other errors. Cascade failure resulted in an average of 4.65 points lost per transcript. Conclusions The CLAN program showed relatively inaccurate outcomes in comparison to manual scoring on both traditional and new measures of accuracy. Recommendations for improvement of the program include accounting for second exemplar violations and applying cascaded credit, among other suggestions. It was proposed that research on machine-scored syntax routinely report accuracy measures detailing erroneous and missed scores, including MIA, so that researchers and clinicians are aware of the limitations of a machine-scoring program. Supplemental Material https://doi.org/10.23641/asha.11984364

Geoenvironmental and Geotechnical Data Exchange: Setting the Standard

2008 ◽  
Author(s):  
Scot D. Weaver ◽  
Thomas E. Lefchik ◽  
Marc I. Hoit ◽  
Kirk Beach
Keyword(s):  
Data Exchange ◽  
Geotechnical Data

Computing Cores for Existential Rules with the Standard Chase and ASP

2020 ◽  
Author(s):  
Markus Krötzsch
Keyword(s):  
Large Class ◽  
Data Exchange ◽  
Answer Set Programming ◽  
Query Answering ◽  
Universal Model ◽  
The Core ◽  
Universal Models ◽  
General Terms ◽  
Special Cases ◽  
The Many

To reason with existential rules (a.k.a. tuple-generating dependencies), one often computes universal models. Among the many such models of different structure and cardinality, the core is arguably the “best”. Especially for finitely satisfiable theories, where the core is the unique smallest universal model, it has advantages in query answering, non-monotonic reasoning, and data exchange. Unfortunately, computing cores is difficult and not supported by most reasoners. We therefore propose ways of computing cores using practically implemented methods from rule reasoning and answer set programming. Our focus is on cases where the standard chase algorithm produces a core. We characterise this desirable situation in general terms that apply to a large class of cores, derive concrete approaches for decidable special cases, and generalise these approaches to non-monotonic extensions of existential rules.

Sign in / Sign up

Export Citation Format

Share Document