Separability in relativistic Hamiltonian particle dynamics

The problem of separability in recent models of classical relativistic interacting particles is examined. This physical requirement is shown to be more subtle than naive separability of all the constraints defining the system: it is adequate to be able to canonically transform the time-fixing constraints from an unseparated to a separated form when clusters emerge. Viewing separability in this way, and within a specific framework, we are led to a new no-interaction theorem which states the incompatibility of nontrivial interaction with relativistic invariance, separability, and invariant world lines for more than two particles.

Forms of relativistic dynamics with World Line Condition and separability

he Dirac generator formalism for relativistic Hamiltonian dynamics is reviewed along with its extension to constraint formalism. In these theories evolution is with respect to a dynamically defined parameter, and thus time evolution involves an eleventh generator. These formulations evade the No-Interaction Theorem. But the incorporation of separability reopens the question, and together with the World Line Condition leads to a second no-interaction theorem for systems of three or more particles. Proofs are omitted, but the results of recent research in this area is highlighted.

A Fast Linear Separability Test by Projection of Positive Points on Subspaces

A geometric and non parametric procedure for testing if two finite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that determines if a strictly positive point h > 0 exists in the range of a matrix A (related to the points in the two finite sets). The algorithm proposed in the paper iteratively checks if a strictly positive point exists in a subspace by projecting a strictly positive vector with equal co-ordinates (p), on the subspace. At the end of each iteration, the subspace is reduced to a lower dimensional subspace. The test is completed within r ≤ min(n, d + 1) steps, for both linearly separable and non separable problems (r is the rank of A, n is the number of points and d is the dimension of the space containing the points). The worst case time complexity of the algorithm is O(nr3) and space complexity of the algorithm is O(nd). A small review of some of the prominent algorithms and their time complexities is included. The worst case computational complexity of our algorithm is lower than the worst case computational complexity of Simplex, Perceptron, Support Vector Machine and Convex Hull Algorithms, if d

Does linear separability really matter? Complex visual search is explained by simple search

Visual search in real life involves complex displays with a target among multiple types of distracters, but in the laboratory, it is often tested using simple displays with identical distracters. Can complex search be understood in terms of simple searches? This link may not be straightforward if complex search has emergent properties. One such property is linear separability, whereby search is hard when a target cannot be separated from its distracters using a single linear boundary. However, evidence in favor of linear separability is based on testing stimulus configurations in an external parametric space that need not be related to their true perceptual representation. We therefore set out to assess whether linear separability influences complex search at all. Our null hypothesis was that complex search performance depends only on classical factors such as target-distracter similarity and distracter homogeneity, which we measured using simple searches. Across three experiments involving a variety of artificial and natural objects, differences between linearly separable and nonseparable searches were explained using target-distracter similarity and distracter heterogeneity. Further, simple searches accurately predicted complex search regardless of linear separability (r = 0.91). Our results show that complex search is explained by simple search, refuting the widely held belief that linear separability influences visual search.

Relativistic particle models with separable interactions

We present relativistic, classical particle models that possess Poincaré invariance, invariant world lines, particle interaction, and separability.

Quantum entanglement in a noncommutative system

We explore the effect of two-dimensional position-space noncommutativity on the bipartite entanglement of continuous-variable systems. We first extend the standard symplectic framework for studying entanglement of Gaussian states of commutative systems to the case of noncommutative systems residing in two dimensions. Using the positive partial transpose criterion for separability of bipartite states, we derive a condition on the separability of a noncommutative system that is dependent on the noncommutative parameter theta. We then consider the specific example of a bipartite Gaussian state and show the quantitative reduction in entanglement originating from noncommutative dynamics. We show that such a reduction in entanglement for a noncommutative system arising from the modification of the variances of the phase-space variables (uncertainty relations) is clearly manifested between two particles that are separated by small distances.

Testing threshold functions using implied minterm structure

A geometrical structure called the implied minterm structure (IMS) has been developed from the properties of minterms of a threshold function. The IMS is useful for the manual testing of linear separability of switching functions of up to six variables. This testing is done just by inspection of the plot of the function on the IMS.

An RNS based transform Architecture for H.264/AVC

This paper presents the architecture and the VHDL design of an integer 2-D DCT used in the H.264/AVC. The 2-D DCT computation is performed by exploiting it’s orthogonality and separability property. The symmetry of the forward and inverse transform is used in this implementation. To reduce the computation overhead for the addition, subtraction and multiplication operations, we analyze the suitability of carry-free position independent residue number system (RNS) for the implementation of 2-D DCT. The implementation has been carried out in VHDL for Altera FPGA. We used the negative number representation in RNS, bit width analysis of the transforms and dedicated registers present in the Logic element of the FPGA to optimize the area. The complexity and efficiency analysis show that the proposed architecture could provide higher through-put.

Criteria for prediction of flow instabilities and microstructural manifestations during warm working of AISI 304L stainless steel

The deformation characteristics of 304L stainless steel in compression in the temperature range 20–700°C and strain rate range 0·001–100 s−1 have been studied with the aim of characterising the .flow instabilities occurring in the microstructure. At higher temperatures and strain rates the stainless steel exhibits flow localisation, whereas at temperatures below 500°C and strain rates lower than 0·1 s−1 the flow instabilities are due to dynamic strain aging. Strain induced martensite formation is responsible for the flow instabilities at room temperature and low strain rates (0·01 s−1). In view of the occurrence of these instabilities, cold working is preferable to warm working to achieve dimensional tolerance and reproducible properties in the product. Among the different criteria tested to explain the occurrence of instabilities, the continuum criterion, developed on the basis of the principles of maximum rate of entropy production and separability of the dissipation function, predicts accurately all the above instability features.

Optimization of cold and warm workability in 304 stainless steel using instability maps

The deformation characteristics of stainless steel type AISI 3O4 under compression in the temperature range 20 degrees C to 600 degrees C and strain-rate range 0.001 to 100 s(-1) have been studied with a view to characterizing the flow instabilities occurring in the microstructure. At strain rates less than 5 s(-1), 304 stainless steel exhibits flow localization, whereas dynamic strain aging occurs at intermediate temperatures and below 0.5 s(-1). At room temperatures and strain rates less than 10 s(-1), martensite formation is observed. To avoid the preceding microstructural instabilities, cold and warm working should be carried out at strain rates greater than 5 s(-1). The continuum criterion, developed on the basis of the principles of maximum rate of entropy production and separability of the dissipation function, predicts accurately all the preceding instability features.

Optimization of cold and warm workability in stainless steel type AISI 316L using instability maps

The deformation characteristics of stainless steel type AISI 316L under compression in the temperature range 20 to 600 degrees C and strain rate range 0.001 to 100 s(-1) have been studied with a view to characterizing the flow instabilities occurring in the microstructure. At temperatures lower than 100 degrees C and strain rates higher than 0.1 s(-1), 316L stainless steel exhibits flow localization whereas dynamic strain aging (DSA) occurs at intermediate temperatures and below 1 s(-1). To avoid the above flow instabilities, cold working should be carried out at strain rates less than 0.1 s(-1). Warm working of stainless steel type AISI 316L may be done in the temperature and strain rate regime of: 300 to 400 degrees C and 0.001 s(-1) 300 to 450 degrees C and 0.01 s(-1): 450 to 600 degrees C and 0.1 s(-1); 500 degrees C and 1 s(-1) since these regions are free from flow instabilities like DSA and flow localization. The continuum criterion, developed on the basis of the principles of maximum rate of entropy production and separability of the dissipation function, predicts accurately all the above instability features.

Instability map for cold and warm working of as-cast 304 stainless steel

The deformation characteristics of as-cast 304 stainless steel under compression in the temperature range 20-600 degrees C and strain rate range 0.001-100 s(-1) have been studied with a view to characterizing the flow instabilities occurring in the microstructure. Ar strain rates of less than 0.05 s(-1), as-cast 304 stainless steel exhibits flow localization in the temperature range 20-600 degrees C, whereas dynamic strain ageing occurs at intermediate temperatures and below 5 s(-1). At room temperatures and strain rates of less than 0.05 s(-1), martensite formation is observed. To avoid the above microstructural instabilities warm working should be carried out at strain rates greater than 10 s(-1) in the temperature range 400-600 degrees C and cold working could be done in the range of about 0.05-0.8 s(-1). The continuum criterion developed on the basis of the principles of maximum rate of entropy production and separability of the dissipation function, predicts accurately all of the above instability features. (C) 1997 Elsevier Science S.A.

On the Decidability of Model-Checking Information Flow Properties

Current standard security practices do not provide substantial assurance about information flow security: the end-to-end behavior of a computing system. Noninterference is the basic semantical condition used to account for information flow security. In the literature, there are many definitions of noninterference: Non-inference, Separability and so on. Mantel presented a framework of Basic Security Predicates (BSPs) for characterizing the definitions of noninterference in the literature. Model-checking these BSPs for finite state systems was shown to be decidable in [8]. In this paper, we show that verifying these BSPs for the more expressive system model of pushdown systems is undecidable. We also give an example of a simple security property which is undecidable even for finite-state systems: the property is a weak form of non-inference called WNI, which is not expressible in Mantel’s BSP framework.

An optimal transform Architecture for H.264/AVC

This paper presents the design of the area optimized integer two dimensional discrete cosine transform (2-D DCT) used in H.264/AVC codecs. The 2-D DCT calculation is performed by utilizing the separability property, in such a way that 2-D DCT is divided into two 1-D DCT calculation that are joined through a common memory. Due to its area optimized approach, the design will find application in mobile devices. Verilog hardware description language (HDL) in cadence environment has been used for design, compilation, simulation and synthesis of transform block in 0.18 mu TSMC technology.

FAST AND ACCURATE BILATERAL FILTERING USING GAUSS-POLYNOMIAL DECOMPOSITION

The bilateral filter is a versatile non-linear filter that has found diverse applications in image processing, computer vision, computer graphics, and computational photography. A common form of the filter is the Gaussian bilateral filter in which both the spatial and range kernels are Gaussian. A direct implementation of this filter requires O(sigma(2)) operations per pixel, where sigma is the standard deviation of the spatial Gaussian. In this paper, we propose an accurate approximation algorithm that can cut down the computational complexity to O(1) per pixel for any arbitrary sigma (constant-time implementation). This is based on the observation that the range kernel operates via the translations of a fixed Gaussian over the range space, and that these translated Gaussians can be accurately approximated using the so-called Gauss-polynomials. The overall algorithm emerging from this approximation involves a series of spatial Gaussian filtering, which can be efficiently implemented (in parallel) using separability and recursion. We present some preliminary results to demonstrate that the proposed algorithm compares favorably with some of the existing fast algorithms in terms of speed and accuracy.