Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic

A symmetric solution X satisfying the matrix equation XA = AtX is called a symmetrizer of the matrix A. A general algorithm to compute a matrix symmetrizer is obtained. A new multiple-modulus residue arithmetic called floating-point modular arithmetic is described and implemented on the algorithm to compute an error-free matrix symmetrizer.

Diagnosis of dominant forcing factors for large-scale vertical velocities during active and break phases of the monsoon

An attempt to diagnose the dominant forcings which drive the large-scale vertical velocities over the monsoon region has been made by computing the forcings like diabatic heating fields,etc. and the large-scale vertical velocities driven by these forcings for the contrasting periods of active and break monsoon situations; in order to understand the rainfall variability associated with them. Computation of diabatic heating fields show us that among different components of diabatic heating it is the convective heating that dominates at mid-tropospheric levels during an active monsoon period; whereas it is the sensible heating at the surface that is important during a break period. From vertical velocity calculations we infer that the prime differences in the large-scale vertical velocities seen throughout the depth of the atmosphere are due to the differences in the orders of convective heating; the maximum rate of latent heating being more than 10 degrees Kelvin per day during an active monsoon period; whereas during a break monsoon period it is of the order of 2 degrees Kelvin per day at mid-tropospheric levels. At low levels of the atmosphere, computations show that there is large-scale ascent occurring over a large spatial region, driven only by the dynamic forcing associated with vorticity and temperature advection during an active monsoon period. However, during a break monsoon period such large-scale spatial organization in rising motion is not seen. It is speculated that these differences in the low-level large-scale ascent might be causing differences in convective heating because the weaker the low level ascent, the lesser the convective instability which produces deep cumulus clouds and hence lesser the associated latent heat release. The forcings due to other components of diabatic heating, namely, the sensible heating and long wave radiative cooling do not influence the large-scale vertical velocities significantly.

On computing an equivalent symmetric matrix for a nonsymmetric matrix

A real or a complex symmetric matrix is defined here as an equivalent symmetric matrix for a real nonsymmetric matrix if both have the same eigenvalues. An equivalent symmetric matrix is useful in computing the eigenvalues of a real nonsymmetric matrix. A procedure to compute equivalent symmetric matrices and its mathematical foundation are presented.

A Hub System for Cloud-Computing Based Business-Collaboration: Automating Ontology-Enabled Electronic Business-Service Discovery

The management and coordination of business-process collaboration experiences changes because of globalization, specialization, and innovation. Service-oriented computing (SOC) is a means towards businessprocess automation and recently, many industry standards emerged to become part of the service-oriented architecture (SOA) stack. In a globalized world, organizations face new challenges for setting up and carrying out collaborations in semi-automating ecosystems for business services. For being efficient and effective, many companies express their services electronically in what we term business-process as a service (BPaaS). Companies then source BPaaS on the fly from third parties if they are not able to create all service-value inhouse because of reasons such as lack of reasoures, lack of know-how, cost- and time-reduction needs. Thus, a need emerges for BPaaS-HUBs that not only store service offers and requests together with information about their issuing organizations and assigned owners, but that also allow an evaluation of trust and reputation in an anonymized electronic service marketplace. In this paper, we analyze the requirements, design architecture and system behavior of such a BPaaS-HUB to enable a fast setup and enactment of business-process collaboration. Moving into a cloud-computing setting, the results of this paper allow system designers to quickly evaluate which services they need for instantiationg the BPaaS-HUB architecture. Furthermore, the results also show what the protocol of a backbone service bus is that allows a communication between services that implement the BPaaS-HUB. Finally, the paper analyzes where an instantiation must assign additional computing resources vor the avoidance of performance bottlenecks.

Polarization studies in electromagnetic scattering by small Solar-system particles

In remote-sensing studies, particles that are comparable to the wavelength exhibit characteristic features in electromagnetic scattering, especially in the degree of linear polarization. These features vary with the physical properties of the particles, such as shape, size, refractive index, and orientation. In the thesis, the direct problem of computing the unknown scattered quantities using the known properties of the particles and the incident radiation is solved at both optical and radar spectral regions in a unique way. The internal electromagnetic fields of wavelength-scale particles are analyzed by using both novel and established methods to show how the internal fields are related to the scattered fields in the far zone. This is achieved by using the tools and methods that were developed specifically to reveal the internal field structure of particles and to study the mechanisms that relate the structure to the scattering characteristics of those particles. It is shown that, for spherical particles, the internal field is a combination of a forward propagating wave with the apparent wavelength determined by the refractive index of the particle, and a standing wave pattern with the apparent wavelength the same as for the incident wave. Due to the surface curvature and dielectric nature of the particle, the incident wave front undergoes a phase shift, and the resulting internal wave is focused mostly at the forward part of the particle similar to an optical lens. This focusing is also seen for irregular particles. It is concluded that, for both spherical and nonspherical particles, the interference at the far field between the partial waves that originate from these concentrated areas in the particle interior, is responsible for the specific polarization features that are common for wavelength-scale particles, such as negative values and local extrema in the degree of linear polarization, asymmetry of the phase function, and enhancement of intensity near the backscattering direction. The papers presented in this thesis solve the direct problem for particles with both simple and irregular shapes to demonstrate that these interference mechanisms are common for all dielectric wavelength-scale particles. Furthermore, it is shown that these mechanisms can be applied to both regolith particles in the optical wavelengths and hydrometeors at microwave frequencies. An advantage from this kind of study is that it does not matter whether the observation is active (e.g., polarimetric radar) or passive (e.g., optical telescope). In both cases, the internal field is computed for two mutually perpendicular incident polarizations, so that the polarization characteristics can then be analyzed according to the relation between these fields and the scattered far field.

A geodesic constant method for computing high-frequency mutual coupling between antennas on general quadric cylinders

A Geodesic Constant Method (GCM) is outlined which provides a common approach to ray tracing on quadric cylinders in general, and yields all the surface ray-geometric parameters required in the UTD mutual coupling analysis of conformal antenna arrays in the closed form. The approach permits the incorporation of a shaping parameter which permits the modeling of quadric cylindrical surfaces of desired sharpness/flatness with a common set of equations. The mutual admittance between the slots on a general parabolic cylinder is obtained as an illustration of the applicability of the GCM.

A Sub-Nyquist Sampling Method For Computing The Level-crossing-times Of An Analog Signal: Theory And Applications

We address the problem of computing the level-crossings of an analog signal from samples measured on a uniform grid. Such a problem is important, for example, in multilevel analog-to-digital (A/D) converters. The first operation in such sampling modalities is a comparator, which gives rise to a bilevel waveform. Since bilevel signals are not bandlimited, measuring the level-crossing times exactly becomes impractical within the conventional framework of Shannon sampling. In this paper, we propose a novel sub-Nyquist sampling technique for making measurements on a uniform grid and thereby for exactly computing the level-crossing times from those samples. The computational complexity of the technique is low and comprises simple arithmetic operations. We also present a finite-rate-of-innovation sampling perspective of the proposed approach and also show how exponential splines fit in naturally into the proposed sampling framework. We also discuss some concrete practical applications of the sampling technique.

Parallel computing concepts and methods for floquet analysis of helicopter trim and stability

Floquet analysis is widely used for small-order systems (say, order M < 100) to find trim results of control inputs and periodic responses, and stability results of damping levels and frequencies, Presently, however, it is practical neither for design applications nor for comprehensive analysis models that lead to large systems (M > 100); the run time on a sequential computer is simply prohibitive, Accordingly, a massively parallel Floquet analysis is developed with emphasis on large systems, and it is implemented on two SIMD or single-instruction, multiple-data computers with 4096 and 8192 processors, The focus of this development is a parallel shooting method with damped Newton iteration to generate trim results; the Floquet transition matrix (FTM) comes out as a byproduct, The eigenvalues and eigenvectors of the FTM are computed by a parallel QR method, and thereby stability results are generated, For illustration, flap and flap-lag stability of isolated rotors are treated by the parallel analysis and by a corresponding sequential analysis with the conventional shooting and QR methods; linear quasisteady airfoil aerodynamics and a finite-state three-dimensional wake model are used, Computational reliability is quantified by the condition numbers of the Jacobian matrices in Newton iteration, the condition numbers of the eigenvalues and the residual errors of the eigenpairs, and reliability figures are comparable in both the parallel and sequential analyses, Compared to the sequential analysis, the parallel analysis reduces the run time of large systems dramatically, and the reduction increases with increasing system order; this finding offers considerable promise for design and comprehensive-analysis applications.

Computing Fractal Dimension of Signals using Multiresolution Box-counting Method

In this paper, we have developed a method to compute fractal dimension (FD) of discrete time signals, in the time domain, by modifying the box-counting method. The size of the box is dependent on the sampling frequency of the signal. The number of boxes required to completely cover the signal are obtained at multiple time resolutions. The time resolutions are made coarse by decimating the signal. The loglog plot of total number of boxes required to cover the curve versus size of the box used appears to be a straight line, whose slope is taken as an estimate of FD of the signal. The results are provided to demonstrate the performance of the proposed method using parametric fractal signals. The estimation accuracy of the method is compared with that of Katz, Sevcik, and Higuchi methods. In ddition, some properties of the FD are discussed.

Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems

Given an undirected unweighted graph G = (V, E) and an integer k ≥ 1, we consider the problem of computing the edge connectivities of all those (s, t) vertex pairs, whose edge connectivity is at most k. We present an algorithm with expected running time Õ(m + nk3) for this problem, where |V| = n and |E| = m. Our output is a weighted tree T whose nodes are the sets V1, V2,..., V l of a partition of V, with the property that the edge connectivity in G between any two vertices s ε Vi and t ε Vj, for i ≠ j, is equal to the weight of the lightest edge on the path between Vi and Vj in T. Also, two vertices s and t belong to the same Vi for any i if and only if they have an edge connectivity greater than k. Currently, the best algorithm for this problem needs to compute all-pairs min-cuts in an O(nk) edge graph; this takes Õ(m + n5/2kmin{k1/2, n1/6}) time. Our algorithm is much faster for small values of k; in fact, it is faster whenever k is o(n5/6). Our algorithm yields the useful corollary that in Õ(m + nc3) time, where c is the size of the global min-cut, we can compute the edge connectivities of all those pairs of vertices whose edge connectivity is at most αc for some constant α. We also present an Õ(m + n) Monte Carlo algorithm for the approximate version of this problem. This algorithm is applicable to weighted graphs as well. Our algorithm, with some modifications, also solves another problem called the minimum T-cut problem. Given T ⊆ V of even cardinality, we present an Õ(m + nk3) algorithm to compute a minimum cut that splits T into two odd cardinality components, where k is the size of this cut.