Algorithmic Method for the Design of Sequential Circuits with the Use of Logic Elements

This article presents issues related to the design of sequential control systems. The algorithmic design method of sequential control systems is discussed, which allows the design of a diagram of any sequential system. The algorithmic method uses the description in the form of a connection formula. The connection formula defines the order of actuations of driver elements, in this case actuators. The algorithmic method is used, among others, for systems with actuators cooperating with distributors controlled electrically on both sides. The process of creating a system graph has been characterized. The operation of the system has been shown graphically. On the basis of the created graph describing the functions of signal processing, a method for rapid programming of sequential electro-pneumatic systems with the use of logic elements has been provided. A separate dedicated timing unit has been used to perform memory functions. Its operation is based on successive states, in such a way that the next state deletes the previous one. Graph-based systems have been validated through simulation using Festo’s FluidSim computer-aided design software.

Distributed Graph Processing System and Processing-in-memory Architecture with Precise Loop-carried Dependency Guarantee

To hide the complexity of the underlying system, graph processing frameworks ask programmers to specify graph computations in user-defined functions (UDFs) of graph-oriented programming model. Due to the nature of distributed execution, current frameworks cannot precisely enforce the semantics of UDFs, leading to unnecessary computation and communication. It exemplifies a gap between programming model and runtime execution. This article proposes novel graph processing frameworks for distributed system and Processing-in-memory (PIM) architecture that precisely enforces loop-carried dependency; i.e., when a condition is satisfied by a neighbor, all following neighbors can be skipped. Our approach instruments the UDFs to express the loop-carried dependency, then the distributed execution framework enforces the precise semantics by performing dependency propagation dynamically. Enforcing loop-carried dependency requires the sequential processing of the neighbors of each vertex distributed in different nodes. We propose to circulant scheduling in the framework to allow different nodes to process disjoint sets of edges/vertices in parallel while satisfying the sequential requirement. The technique achieves an excellent trade-off between precise semantics and parallelism—the benefits of eliminating unnecessary computation and communication offset the reduced parallelism. We implement a new distributed graph processing framework SympleGraph, and two variants of runtime systems— GraphS and GraphSR —for PIM-based graph processing architecture, which significantly outperform the state-of-the-art.

Demonstrating the Generation of Bond Graphs From 3D Assemblies

The bond graph method provides a generic and simple way to compute differential equations and dynamic responses for complex mechatronic systems. This paper will illustrate the process of automatically generating bond graphs from 3D CAD assemblies of gear-trains. Using appropriate CAD application programming interfaces (APIs), information on parts and mates within an existing assembly is extracted. The extracted information is stored as an identity graph, which also stores all geometry and mass related information of every part. Grammar rules are then used to transform the identity graph to a system graph, which is then converted to bond graph using an existing bond graph generation program. The paper will discuss the process, challenges and planned future work.

Data-driven graph drawing techniques with applications for conveyor systems

The visualization of conveyor systems in the sense of a connected graph is a challenging problem. Starting from communication data provided by the IT system, graph drawing techniques are applied to generate an appealing layout of the conveyor system. From a mathematical point of view, the key idea is to use the concept of stress majorization to minimize a stress function over the positions of the nodes in the graph. Different to the already existing literature, we have to take care of special features inspired by the real-world problems.

Graph-Theory Based Optimal PMU Allocation Considering ZIB Effects

Continuous monitoring is the prerequisite for secure operation and efficient control of power system. This paper presents a new and straightforward approach to monitor the system efficiently. Optimal PMU placement (OPP) deals with the complete system observability with a minimum number of PMU. The Modified Graph theoretic configuration has been presented here to select some strategic locations for PMU installation. Initially, a new technique has been used here to form spanning tree from its system graph. Some standard bus systems i.e. IEEE 7-bus, IEEE 14-bus, and 30-bus have been used to test the effectiveness of the applied approach. The proposed approach has been carried out for normal operating conditions (NOC) as well as considering Zero Injection Bus (ZIB) effects. The simulation result of this efficient and state forward approach has been compared with some other established approaches.

A Novel Framework for Simultaneous Topology and Sizing Optimization of Complex, Multi-Domain Systems-of-Systems

This article presents a novel design framework for topology and component sizing optimization of multi-domain dynamic systems described by conservation laws. Multidisciplinary design optimization (MDO) is a powerful tool for minimizing metrics such as inefficiency and cost for these systems-of-systems (SoS). However, quality of the designs identified from the optimization procedure depends on model accuracy and ability to capture inter-system interactions. This work utilizes a conservation-based, graphical modeling approach to capture physical system dynamics and interactions, and expands it to be used in MDO techniques. This yields three contributions to the literature. First, an augmented graph-based model is provided, expressing continuous and discrete design variable values as changes to vertex size, edge size, and edge connections of the dynamic system graph. Second, a sizing and topology optimization framework is developed using the augmented graph-based model as a basis. Third, analytical and numerical sensitivity functions are derived for a cooling system design problem, stemming from application of the design framework. The design framework is applied to two case studies for cooling subsystem design and electric vehicle (EV) powertrain design, with the goal of optimizing thermal and electrical component sizes, as well as discrete choices in the topology of the system being designed. These case studies provide examples for how the design framework enables analysis of alternatives (AoA) during early design stages.

WESgraph: a graph database for the wind farm domain

The construction and management of a wind farm involve many disciplines. It is hard for a single designer or developer to keep an overview of all the relevant concepts, models, and tools. Nevertheless, this is needed when performing integrated modeling or analysis. To help researchers keep this overview, we have created WESgraph (the Wind Energy System graph), a knowledge base for the wind farm domain, implemented as a graph database. It currently contains 1222 concepts and 1725 relations between them. This paper presents the structure of this graph database – content stored in nodes and the relationships between them – as a foundational ontology, which classifies the domain's concepts. This foundational ontology partitions the domain in two: a part describing physical aspects and a part describing mathematical and computational aspects. This paper also discusses a number of generally difficult cases that exist when adding content to such a knowledge base. This paper furthermore discusses the potential applications of WESgraph and illustrates its use for computation pathway discovery – the application that triggered its creation. It also contains a description of our practical experience with its design and use as well as our thoughts about the community use and management of this tool.

Irregularity of Block Shift Networks and Hierarchical Hypercube Networks

There is extremely a great deal of mathematics associated with electrical and electronic engineering. It relies upon what zone of electrical and electronic engineering; for instance, there is much increasingly theoretical mathematics in communication theory, signal processing and networking, and so forth. Systems include hubs speaking with one another. A great deal of PCs connected together structure a system. Mobile phone clients structure a network. Networking includes the investigation of the most ideal method for executing a system. Graph theory has discovered a significant use in this zone of research. In this paper, we stretch out this examination to interconnection systems. Hierarchical interconnection systems (HINs) give a system to planning systems with diminished connection cost by exploiting the area of correspondence that exists in parallel applications. HINs utilize numerous levels. Lower-level systems give nearby correspondence, while more significant level systems encourage remote correspondence. HINs provide issue resilience within the sight of some defective nodes and additionally interfaces. Existing HINs can be comprehensively characterized into two classes: those that use nodes or potential interface replication and those that utilize reserve interface nodes.