Performance Effects of Formal Modeling Language Differences: A Combined Abstraction Level and Construct Complexity Analysis

2006 ◽  
Vol 49 (2) ◽  
pp. 160-175 ◽  
Author(s):  
H.-H. Teo ◽  
H.C. Chan ◽  
K.K. Wei
Author(s):  
Adriana Pereira de Medeiros ◽  
Daniel Schwabe

AbstractThis article presents Kuaba, a new design rationale representation approach that enables employing design rationale to support reuse of model-based designs, particularly, software design. It is shown that this can be achieved through the adoption of an appropriate vocabulary that allows design rationale representations to be computationally processed. The architecture and implementation of an integrated design environment to support recording design rationale using Kuaba is also shown. The Kuaba approach integrates the design rationale representation model with the formal semantics provided by the metamodel of the design method or modeling language used for describing the artifact being designed. This integration makes the design rationale representations more specific according to the design methods and enables a type of software design reuse at the highest abstraction level, where rationales can be integrated and reemployed in designing a new artifact.


2020 ◽  
Vol 9 (5) ◽  
pp. 291 ◽  
Author(s):  
Mateusz Piech ◽  
Aleksander Smywinski-Pohl ◽  
Robert Marcjan ◽  
Leszek Siwik

Complementing information about particular points, places, or institutions, i.e., so-called Points of Interest (POIs) can be achieved by matching data from the growing number of geospatial databases; these include Foursquare, OpenStreetMap, Yelp, and Facebook Places. Doing this potentially allows for the acquisition of more accurate and more complete information about POIs than would be possible by merely extracting the information from each of the systems alone. Problem: The task of Points of Interest matching, and the development of an algorithm to perform this automatically, are quite challenging problems due to the prevalence of different data structures, data incompleteness, conflicting information, naming differences, data inaccuracy, and cultural and language differences; in short, the difficulties experienced in the process of obtaining (complementary) information about the POI from different sources are due, in part, to the lack of standardization among Points of Interest descriptions; a further difficulty stems from the vast and rapidly growing amount of data to be assessed on each occasion. Research design and contributions: To propose an efficient algorithm for automatic Points of Interest matching, we: (1) analyzed available data sources—their structures, models, attributes, number of objects, the quality of data (number of missing attributes), etc.—and defined a unified POI model; (2) prepared a fairly large experimental dataset consisting of 50,000 matching and 50,000 non-matching points, taken from different geographical, cultural, and language areas; (3) comprehensively reviewed metrics that can be used for assessing the similarity between Points of Interest; (4) proposed and verified different strategies for dealing with missing or incomplete attributes; (5) reviewed and analyzed six different classifiers for Points of Interest matching, conducting experiments and follow-up comparisons to determine the most effective combination of similarity metric, strategy for dealing with missing data, and POIs matching classifier; and (6) presented an algorithm for automatic Points of Interest matching, detailing its accuracy and carrying out a complexity analysis. Results and conclusions: The main results of the research are: (1) comprehensive experimental verification and numerical comparisons of the crucial Points of Interest matching components (similarity metrics, approaches for dealing with missing data, and classifiers), indicating that the best Points of Interest matching classifier is a combination of random forest algorithm coupled with marking of missing data and mixing different similarity metrics for different POI attributes; and (2) an efficient greedy algorithm for automatic POI matching. At a cost of just 3.5% in terms of accuracy, it allows for reducing POI matching time complexity by two orders of magnitude in comparison to the exact algorithm.


1994 ◽  
Vol 3 (3) ◽  
pp. 77-88 ◽  
Author(s):  
Celeste Roseberry-McKibbin

The number of children with limited English proficiency (LEP) in U.S. public schools is growing dramatically. Speech-language pathologists increasingly receive referrals from classroom teachers for children with limited English proficiency who are struggling in school. The speech-language pathologists are frequently asked to determine if the children have language disorders that may be causing or contributing to their academic difficulties. Most speech-language pathologists are monolingual English speakers who have had little or no coursework or training related to the needs of LEP children. This article discusses practical, clinically applicable ideas for assessment and treatment of LEP children who are language impaired, and gives suggestions for distinguishing language differences from language disorders in children with limited English proficiency.


Sign in / Sign up

Export Citation Format

Share Document