On Random Planar Curves and Their Scaling Limits

Planar curves arise naturally as interfaces between two regions of the plane. An important part of statistical physics is the study of lattice models. This thesis is about the interfaces of 2D lattice models. The scaling limit is an infinite system limit which is taken by letting the lattice mesh decrease to zero. At criticality, the scaling limit of an interface is one of the SLE curves (Schramm-Loewner evolution), introduced by Oded Schramm. This family of random curves is parametrized by a real variable, which determines the universality class of the model. The first and the second paper of this thesis study properties of SLEs. They contain two different methods to study the whole SLE curve, which is, in fact, the most interesting object from the statistical physics point of view. These methods are applied to study two symmetries of SLE: reversibility and duality. The first paper uses an algebraic method and a representation of the Virasoro algebra to find common martingales to different processes, and that way, to confirm the symmetries for polynomial expected values of natural SLE data. In the second paper, a recursion is obtained for the same kind of expected values. The recursion is based on stationarity of the law of the whole SLE curve under a SLE induced flow. The third paper deals with one of the most central questions of the field and provides a framework of estimates for describing 2D scaling limits by SLE curves. In particular, it is shown that a weak estimate on the probability of an annulus crossing implies that a random curve arising from a statistical physics model will have scaling limits and those will be well-described by Loewner evolutions with random driving forces.

Planar pursuit-evasion with variable speeds, part 1, extremal trajectory maps

Pursuit evasion in a plane is formulated with both players allowed to vary their speeds between fixed limits. A suitable choice of real-space coordinates confers open-loop optimality on the game. The solution in the small is described in terms of the individual players'' extremal trajectory maps (ETM). Each map is independent of role, adversary, and capture radius. An ETM depicts the actual real-space trajectories. A template method of generating constant control arcs is described. Examples of ETM for an aircraft flying at a constant altitude with fixed and varying speeds are presented.

Planar pursuit-evasion with variable speeds, part 2, barrier sections

An iterative method of constructing sections of the game surfaces from the players'' extremal trajectory maps is discussed. Barrier sections are presented for aircraft pursuit-evasion at constant altitude, with one aircraft flying at sustained speed and the other varying its speed.

Acoustic emission source location and damage detection in a metallic structure using a graph-theory-based geodesic pproach

A geodesic-based approach using Lamb waves is proposed to locate the acoustic emission (AE) source and damage in an isotropic metallic structure. In the case of the AE (passive) technique, the elastic waves take the shortest path from the source to the sensor array distributed in the structure. The geodesics are computed on the meshed surface of the structure using graph theory based on Dijkstra's algorithm. By propagating the waves in reverse virtually from these sensors along the geodesic path and by locating the first intersection point of these waves, one can get the AE source location. The same approach is extended for detection of damage in a structure. The wave response matrix of the given sensor configuration for the healthy and the damaged structure is obtained experimentally. The healthy and damage response matrix is compared and their difference gives the information about the reflection of waves from the damage. These waves are backpropagated from the sensors and the above method is used to locate the damage by finding the point where intersection of geodesics occurs. In this work, the geodesic approach is shown to be suitable to obtain a practicable source location solution in a more general set-up on any arbitrary surface containing finite discontinuities. Experiments were conducted on aluminum specimens of simple and complex geometry to validate this new method.

Acoustic emission source location in composite structure by Voronoi construction using geodesic curve evolution

Conventional analytical/numerical methods employing triangulation technique are suitable for locating acoustic emission (AE) source in a planar structure without structural discontinuities. But these methods cannot be extended to structures with complicated geometry, and, also, the problem gets compounded if the material of the structure is anisotropic warranting complex analytical velocity models. A geodesic approach using Voronoi construction is proposed in this work to locate the AE source in a composite structure. The approach is based on the fact that the wave takes minimum energy path to travel from the source to any other point in the connected domain. The geodesics are computed on the meshed surface of the structure using graph theory based on Dijkstra's algorithm. By propagating the waves in reverse virtually from these sensors along the geodesic path and by locating the first intersection point of these waves, one can get the AE source location. In this work, the geodesic approach is shown more suitable for a practicable source location solution in a composite structure with arbitrary surface containing finite discontinuities. Experiments have been conducted on composite plate specimens of simple and complex geometry to validate this method.

Using a glow graph to represent data flow and dependency in event logs

The idea of extracting knowledge in process mining is a descendant of data mining. Both mining disciplines emphasise data flow and relations among elements in the data. Unfortunately, challenges have been encountered when working with the data flow and relations. One of the challenges is that the representation of the data flow between a pair of elements or tasks is insufficiently simplified and formulated, as it considers only a one-to-one data flow relation. In this paper, we discuss how the effectiveness of knowledge representation can be extended in both disciplines. To this end, we introduce a new representation of the data flow and dependency formulation using a flow graph. The flow graph solves the issue of the insufficiency of presenting other relation types, such as many-to-one and one-to-many relations. As an experiment, a new evaluation framework is applied to the Teleclaim process in order to show how this method can provide us with more precise results when compared with other representations.

A geometric approach for determining inner and exterior boundaries of workspaces of planar manipulators

In this paper a method to determine the internal and external boundaries of planar workspaces, represented with an ordered set of points, is presented. The sequence of points are grouped and can be interpreted to form a sequence of curves. Three successive curves are used for determining the instantaneous center of rotation for the second one of them. The two extremal points on the curve with respect to the instantaneous center are recognized as singular points. The chronological ordering of these singular points is used to generate the two envelope curves, which are potentially intersecting. Methods have been presented in the paper for the determination of the workspace boundary from the envelope curves. Strategies to deal with the manipulators with joint limits and various degenerate situations have also been discussed. The computational steps being completely geometric, the method does not require the knowledge about the manipulator's kinematics. Hence, it can be used for the workspace of arbitrary planar manipulators. A number of illustrative examples demonstrate the efficacy of the proposed method.

A kinematic theory for radially foldable planar linkages

By using the algebraic locus of the coupler curve of a PRRP planar linkage, in this paper, a kinematic theory is developed for planar, radially foldable closed-loop linkages. This theory helps derive the previously invented building blocks, which consist of only two inter-connected angulated elements, for planar foldable structures. Furthermore, a special case of a circumferentially actuatable foldable linkage (which is different from the previously known cases) is derived from the theory, A quantitative description of some known and some new properties of planar foldable linkages, including the extent of foldability, shape-preservation of the interior polygons, multi-segmented assemblies and heterogeneous circumferential arrangemants, is also presented. The design equations derived here make the conception of even complex planar radially foldable linkages systematic and straightforward. Representative examples are presented to illustrate the usage of the design equations and the construction of prototypes. The current limitations and some possible extensions of the theory are also noted. (c) 2007, Elsevier Ltd. All ri-hts reserved.

Bond graph model of doubly fed three phase induction motor using the Axis Rotator element for frame transformation

Induction motor is a typical member of a multi-domain, non-linear, high order dynamic system. For speed control a three phase induction motor is modelled as a d–q model where linearity is assumed and non-idealities are ignored. Approximation of the physical characteristic gives a simulated behaviour away from the natural behaviour. This paper proposes a bond graph model of an induction motor that can incorporate the non-linearities and non-idealities thereby resembling the physical system more closely. The model is validated by applying the linearity and idealities constraints which shows that the conventional ‘abc’ model is a special case of the proposed generalised model.

New approximation algorithms for minimum cycle bases of graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Planar Edgeless Detectors for the TOTEM Experiment at the LHC

The TOTEM experiment at the LHC will measure the total proton-proton cross-section with a precision better than 1%, elastic proton scattering over a wide range in momentum transfer -t= p^2 theta^2 up to 10 GeV^2 and diffractive dissociation, including single, double and central diffraction topologies. The total cross-section will be measured with the luminosity independent method that requires the simultaneous measurements of the total inelastic rate and the elastic proton scattering down to four-momentum transfers of a few 10^-3 GeV^2, corresponding to leading protons scattered in angles of microradians from the interaction point. This will be achieved using silicon microstrip detectors, which offer attractive properties such as good spatial resolution (<20 um), fast response (O(10ns)) to particles and radiation hardness up to 10^14 "n"/cm^2. This work reports about the development of an innovative structure at the detector edge reducing the conventional dead width of 0.5-1 mm to 50-60 um, compatible with the requirements of the experiment.

Topological properties of the one dimensional exponential random geometric graph

In this article we study the one-dimensional random geometric (random interval) graph when the location of the nodes are independent and exponentially distributed. We derive exact results and limit theorems for the connectivity and other properties associated with this random graph. We show that the asymptotic properties of a graph with a truncated exponential distribution can be obtained using the exponential random geometric graph. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008.

Switchable-feed reconfigurable ultra-wide band planar antenna

Reconfigurable antennas capable of radiating in only specific desired directions increase system functionality in applications like direction finding and beam steering. This paper presents the design simulation, fabrication and measurement of a horizontally polarized, direction reconfigurable Vivaldi antenna, designed for the lower-band UWB (2-6 GHz). This design employs eight circularly distributed independent Vivaldi antennas with a common port, electronically controlled by PIN diodes acting as RF switches. Experimental results show that the reconfigurable antenna has a bandwidth of 4 GHz (2-6 GHz), with 5 dB gain in the desired direction and capable of steering over the 360° range.

Electronically-reconfigurable horizontally polarized wide-band planar antenna

Antennas are a necessary and critical component of communications and radar systems, but their inability to adjust to new operating scenarios can sometimes limit the system performance. Reconfigurable antennas capable of radiating in only specific desired directions can ameliorate these restrictions and help to achieve increased functionality in applications like direction finding and beam steering. This paper presents the design simulation, fabrication and measurement of a wide-band, horizontally polarized, direction reconfigurable microstrip antenna operating at 2.45 GHz. The design employs a central horizontally polarized omnidirectional active element surrounded by electronically reconfigurable parasitic microstrip elements, controlled by PIN diodes acting as RF switches. Experimental results show that the reconfigurable antenna has a bandwidth of 40% (2-3 GHz), with 3 dB gain in the desired direction and capable of steering over the 360° range.