Entropic nonclassicality and quantum non-Gaussianity tests via beam splitting

We propose entropic nonclassicality criteria for quantum states of light that can be readily tested using homodyne detection with beam splitting operation. Our method draws on the fact that the entropy of quadrature distributions for a classical state is non-increasing under an arbitrary loss channel. We show that our test is strictly stronger than the variance-based squeezing condition and that it can also be extended to detect quantum non-Gaussianity in conjunction with phase randomization. Furthermore, we address how our criteria can be used to identify single-mode resource states to generate two-mode states demonstrating EPR paradox, i.e., quantum steering, via beam-splitter setting.

An Efficient Memetic Algorithm for the Minimum Load Coloring Problem

Given a graph G with n vertices and l edges, the load distribution of a coloring q: V → {red, blue} is defined as dq = (rq, bq), in which rq is the number of edges with at least one end-vertex colored red and bq is the number of edges with at least one end-vertex colored blue. The minimum load coloring problem (MLCP) is to find a coloring q such that the maximum load, lq = 1/l × max{rq, bq}, is minimized. This problem has been proved to be NP-complete. This paper proposes a memetic algorithm for MLCP based on an improved K-OPT local search and an evolutionary operation. Furthermore, a data splitting operation is executed to expand the data amount of global search, and a disturbance operation is employed to improve the search ability of the algorithm. Experiments are carried out on the benchmark DIMACS to compare the searching results from memetic algorithm and the proposed algorithms. The experimental results show that a greater number of best results for the graphs can be found by the memetic algorithm, which can improve the best known results of MLCP.

Structural Networks and the Experience of Musical Time

The network model of temporal structure allows for many generalized concepts of musical time that can be applied across different modalities (rhythmic, tonal, and formal). This chapter defines network depths, distances, paths, centers, skew, and bias, and partially classifies network types such as piles, tortoises, and starfish. A splitting operation on networks is defined and applied to the problem of relating networks in different modalities and finding true disjunctions.

On 3-connected es-splitting binary matroids

The es-splitting operation on a [Formula: see text]-connected binary matroid may not preserve the [Formula: see text]-connectedness of the matroid. In this paper, we provide a sufficient condition for a [Formula: see text]-connected binary matroid to yield a [Formula: see text]-connected binary matroid under the es-splitting operation. We derive a splitting lemma for [Formula: see text]-connected binary matroids as an application of this result.

A characterization of n-connected splitting matroids

The splitting operation on an n-connected binary matroid may not yield an n-connected binary matroid. In this paper, we characterize n-connected binary matroids which yield n-connected binary matroids by the generalized splitting operation.

Merging and Splitting Petri Net Models within Distributed Embedded Controller Design

Design of distributed embedded controllers can benefit from the adoption of a model-based development attitude, where Petri nets modeling can provide support for a comprehensive specification and documentation of the system together with verification capabilities and automatic deployment into implementation platforms. This chapter presents a Petri nets-based development flow based on composition and decomposition of Petri net models, using Input-Output Place-Transition Petri nets (IOPT nets) as the underlying formalism, allowing reusability of models in new situations through a net addition operation, as well as partitioning of the model into components using a net splitting operation. Distributed embedded controllers are addressed adding the concept of time domains to IOPT nets. Finally, a tool chain framework is presented supporting the whole development process, from specification to implementation, including property verification, simulation, and automatic code generation for deployment into implementation platforms (considering hardware-based implementation and VHDL coding or software-oriented implementation and C coding).

MDA-Based Methodology for Verifying Distributed Execution of Embedded Systems Models

Model-based development for embedded system design has been used to accommodate the increase in system’s complexity. Several modeling formalisms proved to be well matched for usage within this area. The goal of this chapter is to present a model-based development methodology for embedded systems design. One of the main aims of this methodology is to contribute for usage of Petri nets as a system specification language within model-based development of embedded systems integrating MDA (Model-Driven Architecture) proposals as a reference for the development flow. Distributed execution of the initial developed platform-independent models is achieved through model partitioning into platform-specific sub-modules. System model decomposition is obtained through a net splitting operation. Two types of implementation platforms are considered: compliant and non-compliant with zero time delay for communication between modules (in other words, compliant or not with synchronous paradigm). Using a model-checking framework, properties associated to the execution of the distributed models in both types of platforms are compared with the execution of the initial model.

Some Results Involving the Splitting Operation on Binary Matroids

We obtain some results concerning the planarity and graphicness of the splitting matroids. Further, we explore the effect of splitting operation on the sum of two matroids.