The modular tool switching problem

This article analyzes the complexity of the modular tool switching problem arising in flexible manufacturing environments. A single, numerically controlled placement machine is equipped with an online tool magazine consisting of several changeable tool feeder modules. The modules can hold a number of tools necessary for the jobs. In addition to the online modules, there is a set of offline modules which can be changed to the machine during a job change. A number of jobs are processed by the machine, each job requiring a certain set of tools. The sequence of jobs is given as part of the input and fixed. Tools between jobs can be switched individually, or by replacing a whole module containing multiple tools. We consider the complexity of the problem of arranging tools into the modules, so that the work for module and tool loading is minimized. Tools are of uniform size and have unit loading costs. We show that the general problem is NP-hard, and in the case of fixed number of modules and fixed module capacity the problem is solvable in polynomial time.</p

The Algorithmic Complexity of Modular Decomposition

Modular decomposition is a thoroughly investigated topic inmany areas such as switching theory, reliability theory, game theory andgraph theory. We propose an O(mn)-algorithm for the recognition of amodular set of a monotone Boolean function f with m prime implicantsand n variables. Using this result we show that the computation ofthe modular closure of a set can be done in time O(mn2). On the otherhand, we prove that the recognition problem for general Boolean functions is NP-complete. Moreover, we introduce the so called generalizedShannon decomposition of a Boolean functions as an efficient tool forproving theorems on Boolean function decompositions.computational complexity;Boolean functions;decomposition algorithm;modular decomposition;substitution decomposition

The Algorithmic Complexity of Modular Decomposition

Modular decomposition is a thoroughly investigated topic in many areas such as switching theory, reliability theory, game theory and graph theory. We propose an O(mn)-algorithm for the recognition of a modular set of a monotone Boolean function f with m prime implicants and n variables. Using this result we show that the computation of the modular closure of a set can be done in time O(mn2). On the other hand, we prove that the recognition problem for general Boolean func tions is NP-complete. Moreover, we introduce the so called generalized Shannon decomposition of a Boolean functions as an efficient tool for proving theorems on Boolean function decompositions

Algorithmic Aspects of Switch Cographs

This paper introduces the notion of involution module, the first generalization of the modular decomposition of 2-structure which has a unique linear-sized decomposition tree. We derive an O(n^2) decomposition algorithm and we take advantage of the involution modular decomposition tree to state several algorithmic results. Cographs are the graphs that are totally decomposable w.r.t modular decomposition. In a similar way, we introduce the class of switch cographs, the class of graphs that are totally decomposable w.r.t involution modular decomposition. This class generalizes the class of cographs and is exactly the class of (Bull, Gem, Co-Gem, C_5)-free graphs. We use our new decomposition tool to design three practical algorithms for the maximum cut, vertex cover and vertex separator problems. The complexity of these problems was still unknown for this class of graphs. This paper also improves the complexity of the maximum clique, the maximum independant set, the chromatic number and the maximum clique cover problems by giving efficient algorithms, thanks to the decomposition tree. Eventually, we show that this class of graphs has Clique-Width at most 4 and that a Clique-Width expression can be computed in linear time

Power loss investigation in HVDC for cascaded H-bridge multilevel inverters (CHB-MLI)

In the last decade, the use of voltage-source multilevel inverters in industrial and utility power applications has been increased significantly mainly due to the many advantages of multilevel inverters, compared to conventional two level inverters. These advantages include: 1) higher output voltage at low switching frequency, 2) low voltage stress (dv/dt), 3) lower total harmonic distortion (THD), 4) less electro-magnetic interference (EMI), 5) smaller output filter, and 6) higher fundamental output. However, the computation of multilevel inverter power losses is much more complicated compared to conventional two level inverters. This paper presents a detailed investigation of CHB-MLI losses for HVDC. Different levels, and IGBT switching devices have been considered in the study. The inverter has been controlled using selective harmonic elimination in which the switching angles were determined using the Genetic Algorithm (GA). MATLAB-SIMULINK is used for the modelling and simulation. This investigation should result in a deeper knowledge and understanding of the performance of CHB-MLI using different IGBT switching devices

LTE Spectrum Sharing Research Testbed: Integrated Hardware, Software, Network and Data

This paper presents Virginia Tech's wireless testbed supporting research on long-term evolution (LTE) signaling and radio frequency (RF) spectrum coexistence. LTE is continuously refined and new features released. As the communications contexts for LTE expand, new research problems arise and include operation in harsh RF signaling environments and coexistence with other radios. Our testbed provides an integrated research tool for investigating these and other research problems; it allows analyzing the severity of the problem, designing and rapidly prototyping solutions, and assessing them with standard-compliant equipment and test procedures. The modular testbed integrates general-purpose software-defined radio hardware, LTE-specific test equipment, RF components, free open-source and commercial LTE software, a configurable RF network and recorded radar waveform samples. It supports RF channel emulated and over-the-air radiated modes. The testbed can be remotely accessed and configured. An RF switching network allows for designing many different experiments that can involve a variety of real and virtual radios with support for multiple-input multiple-output (MIMO) antenna operation. We present the testbed, the research it has enabled and some valuable lessons that we learned and that may help designing, developing, and operating future wireless testbeds.Comment: In Proceeding of the 10th ACM International Workshop on Wireless Network Testbeds, Experimental Evaluation & Characterization (WiNTECH), Snowbird, Utah, October 201

SOTER: A Runtime Assurance Framework for Programming Safe Robotics Systems

The recent drive towards achieving greater autonomy and intelligence in robotics has led to high levels of complexity. Autonomous robots increasingly depend on third party off-the-shelf components and complex machine-learning techniques. This trend makes it challenging to provide strong design-time certification of correct operation. To address these challenges, we present SOTER, a robotics programming framework with two key components: (1) a programming language for implementing and testing high-level reactive robotics software and (2) an integrated runtime assurance (RTA) system that helps enable the use of uncertified components, while still providing safety guarantees. SOTER provides language primitives to declaratively construct a RTA module consisting of an advanced, high-performance controller (uncertified), a safe, lower-performance controller (certified), and the desired safety specification. The framework provides a formal guarantee that a well-formed RTA module always satisfies the safety specification, without completely sacrificing performance by using higher performance uncertified components whenever safe. SOTER allows the complex robotics software stack to be constructed as a composition of RTA modules, where each uncertified component is protected using a RTA module. To demonstrate the efficacy of our framework, we consider a real-world case-study of building a safe drone surveillance system. Our experiments both in simulation and on actual drones show that the SOTER-enabled RTA ensures the safety of the system, including when untrusted third-party components have bugs or deviate from the desired behavior