A novel computer-searchable representation for the three basic pictorial features, contour maps, region coverage, and line structures, is described. The representation, which has practical storage ...requirements, provides a rapid means of searching large files for data associated with geometric position as well as with attribute value. An application of this representation to handling terrain information illustrates its utility. The algebraic properties of the data structure make it computationally easy to determine whether a point lies within a closed boundary; compute the area contained by a closed boundary; generate the closed boundary representing the union or intersection of two closed boundaries; and determine the neighboring boundaries to a point and the minimum distances between them and the point.
This article is intended as a reference guide to various notions of monoidal categories and their associated string diagrams. It is hoped that this will be useful not just to mathematicians, but also ...to physicists, computer scientists, and others who use diagrammatic reasoning. We have opted for a somewhat informal treatment of topological notions, and have omitted most proofs. Nevertheless, the exposition is sufficiently detailed to make it clear what is presently known, and to serve as a starting place for more in-depth study. Where possible, we provide pointers to more rigorous treatments in the literature. Where we include results that have only been proved in special cases, we indicate this in the form of caveats.
A temporal graph grammar formalism Shi, Zhan; Zeng, Xiaoqin; Zou, Yang ...
Journal of visual languages and computing,
August 2018, 2018-08-00, Volume:
47
Journal Article
Peer reviewed
•We propose a new context-sensitive graph grammar formalism called TEGG in short.•TEGGs introduce some temporal mechanisms in order to tackle time-related issues.•A parsing algorithm for graphs’ ...structure and temporal sequence is presented.•The decidability and complexity of the parsing algorithm are proven.•A case study on an application with temporal requirements is provided.
As a useful formalism tool, graph grammars provide a rigorous but intuitive way to specify visual languages. This paper, based on the existing Edge-based Graph Grammar (EGG), proposes a new context-sensitive graph grammar formalism called the Temporal Edge-based Graph Grammar, or TEGG. TEGG introduces some temporal mechanisms to grammatical specifications, productions, operations and so on in order to tackle time-related issues. In the paper, formal definitions of TEGG are provided first. Then, a new parsing algorithm with a decidability proof is proposed to check the correctness of a given graph's structure, to analyze operations’ timing when needed, and to make the computer simulation of the temporal sequence in the graph available. Next, the complexity of the parsing algorithm is analyzed. Finally, a case study on an application with temporal requirements is provided to show how the parsing algorithm of TEGG works.
Summary
This paper proposes a discrete wavelet transform (DWT)‐based Graphical Language classifier algorithm for identification of high‐impedance fault (HIF) in medium voltage (MV) distribution ...network of 13.8 kV. The proposed method of classifier is developed using virtual instrumentation LabVIEW facility, for detection of various faults such as symmetrical, unsymmetrical, and HIF in the system. Initially, the MV distribution feeder network has been modeled in MATLAB/Simulink, and the DWT analysis has been carried out with the introduction of various faults in the network to extract the features. The extracted features such as SD and energy values from the fault current signals have been applied to the proposed classifier algorithm to identify the type of fault. The effectiveness of the presented method has been tested and compared with the similar conventional fuzzy‐based approach. The results indicate that the proposed classifier algorithm outperforms to give 100% accuracy, while the fuzzy‐based approach misclassifies the double line to ground fault (LLG), three‐phase fault (LLLG), and HIF. Furthermore, the proposed algorithm with LabVIEW facility is more flexible and can be implemented in real time using data acquisition unit for obtaining fault current signal from power system.
With the development of science and technology network in China, the development of language information is in a prosperous scene, a large number of information accelerates the spread of culture, and ...the language of images also presents a variety of expressions. The opportunity of image design industry is also increasing, the vision and form of art are constantly upgraded, and the integration of hand-drawn graphics language and computer graphics language will become a trend. Human beings are about to become a new future in the direction of artistic development, and in the process of exploration, they will face many problems to be explored. This paper studies the fusion of hand-drawn graphics language and computer graphics language, understands the communication mode in the process of language transmission, deeply studies the logical thinking of reconstructing graphics language, finds out the new art of beauty, and lets the graphic language pass on.
Multipartite quantum states constitute a (if not the) key resource for quantum computations and protocols. However obtaining a generic, structural understanding of entanglement in N-qubit systems is ...a long-standing open problem in quantum computer science. Here we show that multipartite quantum entanglement admits a compositional structure, and hence is subject to modern computer science methods.
Recall that two N-qubit states are SLOCC-equivalent if they can be inter-converted by stochastic local (quantum) operations and classical communication. There are only two SLOCC-equivalence classes of genuinely entangled 3-qubit states, the GHZ-class and the W-class, and we show that these exactly correspond with two kinds of internal commutative Frobenius algebras on ℂ2 in the symmetric monoidal category of Hilbert spaces and linear maps, namely ‘special’ ones and ‘anti-special’ ones. Within the graphical language of symmetric monoidal categories, the distinction between ‘special’ and ‘anti-special’ is purely topological, in terms of ‘connected’ vs. ‘disconnected’.
These GHZ and W Frobenius algebras form the primitives of a graphical calculus which is expressive enough to generate and reason about representatives of arbitrary N-qubit states. This calculus refines the graphical calculus of complementary observables in 5, ICALP’08, which has already shown itself to have many applications and admit automation. Our result also induces a generalised graph state paradigm for measurement-based quantum computing.
In the study of social science research, there are innumerable of well-established measurement instruments that include a blend of positive and negative worded statements. The purpose of this study ...is to seek alternative remedy on negative worded statement by using the Dillman's questionnaire principles. A model of Allen and Meyer (1991) were used with two different designs were distributed to two types of samples in present study. The findings reveal that there are differences in the qualities of responds between two samples. Interestingly, by improving the overall features of questionnaire, the respondents’ motivation and attention to the questionnaire are improved.
Domain-specific languages (DSLs) are popular for many reasons, such as increasing productivity for developers and improving communication with domain experts. Both textual and graphical DSLs are ...viable solutions with complementary pros and cons: while graphical DSLs shorten the learning curve and facilitate documentation and communication, textual DSLs aim at higher productivity thanks to more efficient editor functionalities. This paper presents the industrial experience on the adoption of a hybrid approach combining an existing textual DSL with a read-only graphical state machine representation (visualization), equipped with a selective abstraction functionality that offers user-specific, highly configurable views on states and transitions. Our approach is the result of an evolutionary process to improve the modelling experience, relying on frequent user feedback. We argue that a well-tailored visualization is a suitable way to shorten the learning curve and ease the adoption of model-driven approaches in industrial settings.
This chapter states and explains that a Learning Design is the result of a knowledge engineering process where knowledge and competencies, learning design and delivery models are constructed in an ...integrated framework. We present a general graphical language and a knowledge editor that has been adapted to support the construction of learning designs compliant with the IMS-LD specification. We situate LD within our taxonomy of knowledge models as a multi-actor collaborative system. We move up one step in the abstraction scale, showing that the process of constructing learning designs can itself be viewed as a unit-of-learning (or a “unit-of-design”): designers can be seen as learning by constructing learning designs, individually, in teams and with staff support. This viewpoint enables us to discuss and compare various “design plays”. Further, the issue of representing knowledge, cognitive skills and competencies is addressed. The association between these “content” models and learning design components can guide the construction of learning designs and help to classify them in repositories of LD templates.
PDF
