Laser-induced breakdown spectroscopy analysis of energetic materials

A number of energetic materials and explosives have been studied by laser-induced breakdown spectroscopy (LIBS). They include black powder, neat explosives such as TNT, PETN, HMX, and RDX (in various forms), propellants such as M43 and JA2, and military explosives such as C4 and LX-14. Each of these materials gives a unique spectrum, and generally the spectra are reproducible shot to shot. We observed that the laser-produced microplasma did not initiate any of the energetic materials studied. Extensive studies of black powder and its ingredients by use of a reference spectral library have demonstrated excellent accuracy for unknown identification. Finally, we observed that these nitrogen- and oxygen-rich materials yield LIBS spectra in air that have correspondingly different O:N peak ratios compared with air. This difference can help in the detection and identification of such energetic materials.     

On Some Nonlinear Measures of Diabetic Autonomic Dysfunction

Beat-to-beat heart rate was measured for 50 normal and 60 diabetic subjects. Autonomic dysfunction in diabetic subject was assessed by the Ewing test. Next we employed two nonlinear measures of cardiac interbeat interval dynamics: entropy-like measure on AIP diagram, and parameter "forbidden words" for symbolic dynamics. We test their performance in detecting diabetic autonomic dysfunction and show that there is a very significant relationship between the measures and the Ewing score.     

Simulation of stochastic metal-forming process for rigid-viscoplastic material

Numerical solution of stochastic metal-forming process is analysed. The theoretical formulation is described which presents probabilistic distributions for velocities and strains taking into account random initial and boundary conditions. Finite element equations for rigid-viscoplastic materials are solved for the first two probabilistic moments of the random velocity field. The example of ring compression with random parameters is presented.     

Event-driven Video Awareness Providing Physical Security

The Video Event Awareness Workbench (VEAW) analyzes surveillance video from thousands of video cameras and automatically detects complex events in near-real-time-at pace with their input video streams. For events of interest to security personnel, VEAW generates and routes alerts and related video evidence to subscribing security personnel. Complex event processing in VEAW is driven by user-authored awareness specifications comprised of inter-connected spatio-temporal stream and statistical operators that consume and produce events described in VEAW’s surveillance ontology. In this paper we introduce VEAW’s event driven architecture and describe its solutions for automating video surveillance, including the orchestration of continuous and tasked video analysis algorithms (e.g., for entity tracking and identification), fusion of events from multiple sources in an installation-specific “world” model, and proactive information gathering to deal with missing or incomplete information (this is done by tasking video analysis algorithms and security personnel to provide it). We also discuss how VEAW deals with late arriving information (due to out-of-band video analysis tasks and overhead), as well as a related resource optimization aimed at minimizing computation costs. We illustrate the benefits of VEAW by illustrating its application on the automation of real-world security policies.     

Analysis and online realization of the CCA approach for blind source separation.

A critical analysis of the canonical correlation analysis (CCA) approach in blind source separation (BSS) is provided. It is proved that by maximizing the autocorrelation functions of the recovered signals we can separate the source signals successfully. It is further shown that the CCA approach represents the same class of generalized eigenvalue decomposition (GEVD) problems as the matrix pencil method. Finally, online realizations of the CCA approach are discussed with a linear-predictor-based algorithm studied as an example.     

The EuQoS system: a solution for QoS routing in heterogeneous networks [Quality of Service based Routing Algorithms for Heterogeneous Networks]

EuQoS is the acronym for "end-to-end quality of service support over heterogeneous networks", which is a European research project aimed at building an entire QoS framework, addressing all the relevant network layers, protocols, and technologies. This framework, which includes the most common access networks (xDSL, UMTS, WiFi, and LAN) is being prototyped and tested in a multidomain scenario throughout Europe, composing what we call the EuQoS system. In this article we present the novel QoS routing mechanisms that are being developed and evaluated in the framework of this project. The preliminary performance results validate the design choices of the EuQoS system, and confirm the potential impact this project is likely to have in the near future     

Regularization of the inverse heat conduction problem by the discrete Fourier transform

Two methods of solving the inverse heat conduction problem with employment of the discrete Fournier transform are presented in this article. The first one operates similarly to the SVD algorithm and consists in reducing the number of components of the discrete Fournier transform which are taken into account to determine the solution to the inverse problem. The second method is related to the regularization of the solution to the inverse problem in the discrete Fournier transform domain. Those methods were illustrated by numerical examples. In the first example, an influence of the boundary conditions disturbance by a random error on the solution to the inverse problem (its stability) was examined. In the second example, the temperature distribution on the inner boundary of the multiply connected domain was determined. Results of calculations made in both ways brought very good outcomes and confirm the usefulness of applying the discrete Fournier transform to solving inverse problems.     

Formal Mathematics for Mathematicians

The collection of works for this special issue was inspired by the presentations given at the 2011 AMS Special Session on Formal Mathematics for Mathematicians: Developing Large Repositories of Advanced Mathematics. The issue features a collection of articles by practitioners of formalizing proofs who share a deep interest in making computerized mathematics widely available.     

Efficient broadcasting in radio networks with long-range interference

We study broadcasting, also known as one-to-all communication, in synchronous radio networks with known topology modeled by undirected (symmetric) graphs, where the interference range of a node is likely exceeding its transmission range. In this model, if two nodes are connected by a transmission edge they can communicate directly. On the other hand, if two nodes are connected by an interference edge they cannot communicate directly and transmission of one node disables recipience of any message at the other node. For a network $G,$ we term the smallest integer $d$ , s.t., for any interference edge $e$ there exists a simple path formed of at most $d$ transmission edges connecting the endpoints of $e$ as its interference distance $d_I$ . In this model the schedule of transmissions is precomputed in advance. It is based on the full knowledge of the size and the topology (including location of transmission and interference edges) of the network. We are interested in the design of fast broadcasting schedules that are energy efficient, i.e., based on a bounded number of transmissions executed at each node. We adopt $n$ as the number of nodes, $D_T$ is the diameter of the subnetwork induced by the transmission edges, and $\varDelta $ refers to the maximum combined degree (formed of transmission and interference edges) of the network. We contribute the following new results: (1) We prove that for networks with the interference distance $d_I\ge 2$ any broadcasting schedule requires at least $D_T+\varOmega (\varDelta \cdot \frac{\log {n}}{\log {\varDelta }})$ rounds. (2) We provide for networks modeled by bipartite graphs an algorithm that computes $1$ -shot (each node transmits at most once) broadcasting schedules of length $O(\varDelta \cdot \log {n})$ . (3) The main result of the paper is an algorithm that computes a $1$ -shot broadcasting schedule of length at most $4 \cdot D_T + O(\varDelta \cdot d_I \cdot \log ^4{n})$ for networks with arbitrary topology. Note that in view of the lower bound from (1) if $d_I$ is poly-logarithmic in $n$ this broadcast schedule is a poly-logarithmic factor away from the optimal solution.     

Genetic programming based approaches to identification and fault diagnosis of non-linear dynamic systems

System identification is one of the most important research directions. It is a diverse field which can be employed in many different areas. One of them is the model-based fault diagnosis. Thus, the problems of system identification and fault diagnosis are closely related. Unfortunately, in both cases, the research is strongly oriented towards linear systems, while the problem of identification and fault diagnosis of non-linear dynamic systems still remains open. There are, of course, many more or less sophisticated approaches to this problem, although they are not as reliable and universal as those related to linear systems, and the choice of the method to be used depends on the application. The purpose of this paper is to provide a new system identification framework based on a genetic programming technique. Moreover, a fault diagnosis scheme for non-linear systems is proposed. In particular, a new fault detection observer is presented, and the Lyapunov approach is used to show that the proposed observer is convergent under certain conditions. It is also shown how to use the genetic programming technique to increase the convergence rate of the observer. The final part of this paper contains numerical examples concerning identification of chosen parts of the evaporation station at the Lublin Sugar Factory S.A., as well as state estimation and fault diagnosis of an induction motor.