The MeshRouter Architecture

The Joint Forces Command (JFCOM) Experimentation Directorate (J9)'s recent Joint Urban Operations (JUO) experiments have demonstrated the viability of Forces Modeling and Simulation in a distributed environment. The JSAF application suite, combined with the RTI-s communications system, provides the ability to run distributed simulations with sites located across the United States, from Norfolk, Virginia to Maui, Hawaii. Interest-aware routers are essential for communications in the large, distributed environments, and the current RTI-s framework provides such routers connected in a straightforward tree topology. This approach is successful for small to medium sized simulations, but faces a number of significant limitations for very large simulations over high-latency, wide area networks. In particular, traffic is forced through a single site, drastically increasing distances messages must travel to sites not near the top of the tree. Aggregate bandwidth is limited to the bandwidth of the site hosting the top router, and failures in the upper levels of the router tree can result in widespread communications losses throughout the system. To resolve these issues, this work extends the RTI-s software router infrastructure to accommodate more sophisticated, general router topologies, including both the existing tree framework and a new generalization of the fully connected mesh topologies used in the SF Express ModSAF simulations of 100K fully interacting vehicles. The new software router objects incorporate the scalable features of the SF Express design, while optionally using low-level RTI-s objects to perform actual site-to-site communications. The (substantial) limitations of the original mesh router formalism have been eliminated, allowing fully dynamic operations. The mesh topology capabilities allow aggregate bandwidth and site-to-site latencies to match actual network performance. The heavy resource load at the root node can now be distributed across routers at the participating sites

New Constructions in Local Quantum Physics

Among several ideas which arose as consequences of modular localization there are two proposals which promise to be important for the classification and construction of QFTs. One is based on the observation that wedge-localized algebras may have particle-like generators with simple properties and the second one uses the structural simplification of wedge algebras in the holographic lightfront projection. Factorizable d=1+1 models permit to analyse the interplay between particle-like aspects and chiral field properties of lightfront holography. Pacs 11.10.-z, 11.55.-mComment: 21 pages, conference report, references adde

Integrable Systems and Poisson-Lie T-duality: a finite dimensional example

We study the deep connection between integrable models and Poisson-Lie T-duality working on a finite dimensional example constructed on SL(2,C) and its Iwasawa factors SU(2) and B. We shown the way in which Adler-Kostant-Symes theory and collective dynamics combine to solve the equivalent systems from solving the factorization problem of an exponential curve in SL(2,C). It is shown that the Toda system embraces the dynamics of the systems on SU(2) and B.Comment: 34 page

A Compact CMOS Memristor Emulator Circuit and its Applications

Conceptual memristors have recently gathered wider interest due to their diverse application in non-von Neumann computing, machine learning, neuromorphic computing, and chaotic circuits. We introduce a compact CMOS circuit that emulates idealized memristor characteristics and can bridge the gap between concepts to chip-scale realization by transcending device challenges. The CMOS memristor circuit embodies a two-terminal variable resistor whose resistance is controlled by the voltage applied across its terminals. The memristor 'state' is held in a capacitor that controls the resistor value. This work presents the design and simulation of the memristor emulation circuit, and applies it to a memcomputing application of maze solving using analog parallelism. Furthermore, the memristor emulator circuit can be designed and fabricated using standard commercial CMOS technologies and opens doors to interesting applications in neuromorphic and machine learning circuits.Comment: Submitted to International Symposium of Circuits and Systems (ISCAS) 201

Geometry Modeling for Unstructured Mesh Adaptation

The quantification and control of discretization error is critical to obtaining reliable simulation results. Adaptive mesh techniques have the potential to automate discretization error control, but have made limited impact on production analysis workflow. Recent progress has matured a number of independent implementations of flow solvers, error estimation methods, and anisotropic mesh adaptation mechanics. However, the poor integration of initial mesh generation and adaptive mesh mechanics to typical sources of geometry has hindered adoption of adaptive mesh techniques, where these geometries are often created in Mechanical Computer- Aided Design (MCAD) systems. The difficulty of this coupling is compounded by two factors: the inherent complexity of the model (e.g., large range of scales, bodies in proximity, details not required for analysis) and unintended geometry construction artifacts (e.g., translation, uneven parameterization, degeneracy, self-intersection, sliver faces, gaps, large tolerances be- tween topological elements, local high curvature to enforce continuity). Manual preparation of geometry is commonly employed to enable fixed-grid and adaptive-grid workflows by reducing the severity and negative impacts of these construction artifacts, but manual process interaction inhibits workflow automation. Techniques to permit the use of complex geometry models and reduce the impact of geometry construction artifacts on unstructured grid workflows are models from the AIAA Sonic Boom and High Lift Prediction are shown to demonstrate the utility of the current approach

Three-Hilbert-Space Formulation of Quantum Mechanics

In paper [Znojil M., Phys. Rev. D 78 (2008), 085003, 5 pages, arXiv:0809.2874] the two-Hilbert-space (2HS, a.k.a. cryptohermitian) formulation of Quantum Mechanics has been revisited. In the present continuation of this study (with the spaces in question denoted as ${\cal H}^{\rm (auxiliary)}$ and ${\cal H}^{\rm (standard)}$) we spot a weak point of the 2HS formalism which lies in the double role played by ${\cal H}^{\rm (auxiliary)}$. As long as this confluence of roles may (and did!) lead to confusion in the literature, we propose an amended, three-Hilbert-space (3HS) reformulation of the same theory. As a byproduct of our analysis of the formalism we offer an amendment of the Dirac's bra-ket notation and we also show how its use clarifies the concept of covariance in time-dependent cases. Via an elementary example we finally explain why in certain quantum systems the generator $H_{\rm (gen)}$ of the time-evolution of the wave functions may differ from their Hamiltonian $H$

Estimation of distribution algorithms in logistics : Analysis, design, and application

This thesis considers the analysis, design and application of Estimation of Distribution Algorithms (EDA) in Logistics. It approaches continouos nonlinear optimization problems (standard test problems and stochastic transportation problems) as well as location problems, strategic safety stock placement problems and lotsizing problems. The thesis adds to the existing literature by proposing theoretical advances for continuous EDAs and practical applications of discrete EDAs. Thus, it should be of interest for researchers from evolutionary computation, as well as practitioners that are in need of efficient algorithms for the above mentioned problems

Reformulation and decomposition of integer programs

In this survey we examine ways to reformulate integer and mixed integer programs. Typically, but not exclusively, one reformulates so as to obtain stronger linear programming relaxations, and hence better bounds for use in a branch-and-bound based algorithm. First we cover in detail reformulations based on decomposition, such as Lagrangean relaxation, Dantzig-Wolfe column generation and the resulting branch-and-price algorithms. This is followed by an examination of Benders’ type algorithms based on projection. Finally we discuss in detail extended formulations involving additional variables that are based on problem structure. These can often be used to provide strengthened a priori formulations. Reformulations obtained by adding cutting planes in the original variables are not treated here.Integer program, Lagrangean relaxation, column generation, branch-and-price, extended formulation, Benders' algorithm