Topology-based geometric modeling tackles the issue of representing objects with data structures that encode topological subdivision modeled in vertices, edges, faces, and volumes. Such subdivisions can be represented graphs labeled by dimensions on arcs, while operations used to edit formalized as graph transformations. Among existing models, we consider generalized oriented maps, defined cons...

This research addresses )The morphological compounding of the Kurdish language(, which attempted to illustrate foundation and background production. Focusing on products, study dealt with processes their products are outcome these processes, consequently, itself results in producing compounds morphology. Based same principle, is also illustrated. way, information obtained through used produce s...

The question of the linguistic personality description character a work art through analysis lexical and syntactic markers is considered. A review main trends in development theory made, which determine objectivity identifying lexical-syntactic marker as unit that integrates units various levels. results functioning word ‘yasno’ [clear], marks protagonist novel “We” by E. Zamyatin, are presente...

The aim of staged compilation is to enable metaprogramming in a way such that we have guarantees about the well-formedness code output, and can also mix together object-level meta-level concise convenient manner. In this work, observe two-level type theory (2LTT), system originally devised for purpose developing synthetic homotopy theory, serves as with dependent types. 2LTT has numerous good p...

Abstract In this paper, we present a novel technique to automatically synthesize consistent, diverse and structurally realistic domain-specific graph models. A model is (1) consistent if it metamodel-compliant satisfies the well-formedness constraints of domain; (2) local neighborhoods nodes are highly different; synthetic at close distance representative real according various metrics used in ...

Euler diagrams allow the visual representation of set systems and their intersection relations. Every set is represented by a collection of closed curves such that elements of two or more collections intersect if and only if the intersection of the corresponding sets is non-empty. In the area-proportional case each intersection’s area conveys numerical information. There exist several well-form...

\_' (lescribe PVS's capabilities for representing tabular specifications of the kind advocated t)y Parnas and others, and show how PVS's Type Correctness Conditions (TCCs) are used to ensure certain well-formedness properties. We then show how these and other capabilities of PVS can be used to represent the AND/OR tables of Leveson and the Decision Tables of Sherry, and we demonstrate how PVS_s...

Abstract In the last decade, demand for readily accessible corpora has touched all areas of natural language processing, including coreference resolution. However, it is one least considered sub-fields in recent developments. Moreover, almost existing resources are only available English language. To overcome this lack, work proposes a methodology to create corpus resolution Italian exploiting ...

Data-flow reactive systems (DFRSs) form a class of embedded whose inputs and outputs are always available as signals. Input signals can be seen data provided by sensors, whereas the output to system actuators. In previous works, verifying well-formedness properties DFRS models was accomplished in programmatic way, with no formal guarantees, test cases were generated translating these into other...

Model Management with Relation Types Michalis Famelis Master of Science Graduate Department of Computer Science University of Toronto 2010 Software development in application domains where model-based techniques are employed faces challenges related to managing sets of inter-dependent models of various types. In such settings, capturing the semantic structure of sets of models, as well as being...