Video traffic analytics for large scale surveillance

The video traffic analysis is the most important issue for large scale surveillance. In the large scale surveillance system, huge amount of live digital video data is submitted to the storage servers through the number of externally connected scalable components. The system also contains huge amount of popular and unpopular old videos in the archived storage servers. The video data is delivered to the viewers, partly or completely on demand through a compact system. In real time, huge amount of video data is imported to the viewer’s node for various analysis purposes. The viewers use a number of interactive operations during the real time tracking suspect. The compact video on demand system is used in peer to peer mesh type hybrid architecture. The chunk of video objects move fast through the real time generated compact topological space. Video traffic analytics is required to transfer compressed multimedia data efficiently. In this work, we present a dynamically developed topological space, using mixed strategy by game approach to move the video traffic faster. The simulation results are well addressed in real life scenario.     

The interaction between skill, postures, forces and back pain in wool handling

Wool handling is an important rural occupation where workers process 200 or more fleeces daily, separating them into various quality components. Loads and postures they experience carry substantial risk of low back pain (LBP). Although a formal skill training structure exists, interaction with loads and LBP is unknown. We examined whether skill and LBP influenced trunk postures and loads of 60 wool handlers representing 3 skill levels. LBP prevalence ranged from 20% for junior (lowest skill) to 45% for open class (highest skill) wool handlers. Open class wool handlers demonstrated increased lateral bend and more axially twisted postures, generating greater medio-lateral shear forces and lateral bend and axial twist moments. LBP was associated with open class wool handlers spending more time in severe axially twisted postures. These findings suggest that skill-based training needs to be reviewed to reduce the quantity of axially twisted posture which may help reduce the prevalence of LBP in this workforce.     

Relational mountain (density) clustering method and web log analysis

The mountain clustering method and the subtractive clustering method are useful methods for finding cluster centers based on local density in object data. These methods have been extended to shell clustering. In this article, we propose a relational mountain clustering method (RMCM), which produces a set of (proto) typical objects as well as a crisp partition of the objects generating the relation, using a new concept that we call relational density. We exemplify RMCM by clustering several relational data sets that come from object data. Finally, RMCM is applied to web log analysis, where it produces useful user profiles from web log data. © 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 375–392, 2005.     

Semiconduction properties of some polyene-iodine charge-transfer complexes and their application in solid-state batteries

The conjugated polyenes -carotene, lutein, retinoic acid and -apo-8-carotenal are shown to form charge-transfer (CT) complexes with the electron acceptor iodine. The conductivity increases by several orders of magnitude and the activation energy decreases on CT complex formation. Using these complexes as cathodic material, batteries with the configuration Mg/(polyene-iodine CT complex) /graphite are developed. Different battery parameters are evaluated. The effects of ambient temperature and humidity on battery performance are also studied. Results show that a -apo-8-carotenal-l₂ based battery has the maximum power density and longest self-life and is suitable for use as a micro-electronic gadget energizer.     

Fuzzy medial axis transformation (fmat): Image representation,skeleton extraction and uncertainty management in computer vision

The problem of extraction of medial axis transformation of a gray image with reference to skeletonization, image representation and uncertainty management in a vision system has been addressed. The Fuzzy Medial Axis Transformation (fmat) of a fuzzy setf is a set of fuzzy disks whose sup isf. Unfortunately, specifying thefmat sometimes requires more storage space than specifyingf itself. The present paper describes some techniques to improve the compact representation offmat; thereby making it practically useful to an image for its skeleton extraction and compact representation, for shape analysis and template matching, for representation and retrieval, for uncertainty management in recognition and for creating new images of various poses. The algorithms involve reduction of redundancy infmat, its approximation, and reduction of the searching spaces for its computation. Computational aspects for the convenience of writing an efficient program have been described. Some applications of thefmat have also been mentioned. This work was done while SKP held annrc-nasa Senior Research Associateship at the Lyndon B Johnson Space Center, Houston, Texas.     

Wave propagation in a thinly two layered laminated medium with stress couples under initial stresses

Summary The present paper is an attempt to provide an approximate treatment based on Biots theory of incremental deformation to study the wave propagation in two thinly layered laminated medium under initial stresses. The cross-sectional distortion which plays an important role in the coupling of adherent layers is taken into account. The theory is derived in the context of plane strain deformation and the frequency equation for phase velocity of waves propagated has been obtained. It has been shown that under certain conditions when wave length becomes small compared to thickness of each layer, the wave approaches to Rayleigh waves at the two outer surfaces with the possibility of Stoneley waves at the interface.

Notation and Nomenclature

For Medium—I M _i, L_i elastic coefficients - C _i bending moment - h _i thickness - P _i initial stress - _i fraction of the total thickness occupied by theith layer - b _i couple-stress coefficient For the equivalent anisotropic continuum H total thickness - M, L elastic coefficients - P average initial stress - s ₁₁ ⁽¹⁾ ,s ₂₂,s ₁₂ ⁽¹⁾ incremental stress components - u ₁,v ₁ displacement components alongx, y directions respectively - ₁ density - e _xx,e _yy,e _xy ⁽¹⁾ strain components with respect to rotated axes - w ₁ rotational component aboutz-axis - f ₁ x, f ₁ y components of incremental boundary forces per unit initial area For Medium-II N _j,Q _j elastic coefficients - D _j bending moment - K _j thickness - R _j initial stress - _j fraction of the total thickness occupied by thejth layer - g _j couple-stress coefficients For the equivalent anisotropic continuum K total thickness - N, Q elastic coefficients - R average initial stress - s ₁₁ ⁽²⁾ ,s ₂₂,s ₁₂ ⁽²⁾ incremental stress components - u ₂,v ₂ displacement components alongx, y directions respectively - ₂ density - e _xx, e_yy,e _xy ⁽²⁾ strain components with respect to rotated axes - w ₂ rotational component aboutz-axis - f ₂ x, f ₂ y components of incremental boundary forces per unit initial area With 5 Figures     

An improved microfluidics approach for monitoring real-time interaction profiles of ultrafast molecular recognition

Our study illustrates the development of a microfluidics (MF) platform combining fluorescence microscopy and femtosecond/picosecond-resolved spectroscopy to investigate ultrafast chemical processes in liquid-phase diffusion-controlled reactions. By controlling the flow rates of two reactants in a specially designed MF chip, sub-100 ns time resolution for the exploration of chemical intermediates of the reaction in the MF channel has been achieved. Our system clearly rules out the possibility of formation of any intermediate reaction product in a so-called fast ionic reaction between sodium hydroxide and phenolphthalein, and reveals a microsecond time scale associated with the formation of the reaction product. We have also used the developed system for the investigation of intermediate states in the molecular recognition of various macromolecular self-assemblies (micelles) and genomic DNA by small organic ligands (Hoechst 33258 and ethidium bromide). We propose our MF-based system to be an alternative to the existing millisecond-resolved "stopped-flow" technique for a broad range of time-resolved (sub-100 ns to minutes) experiments on complex chemical∕biological systems.     

Scheduling light-trails on WDM rings

We consider the problem of scheduling communication on optical WDM (wavelength division multiplexing) networks using the light-trails technology. We seek to design scheduling algorithms such that the given transmission requests can be scheduled using a minimum number of wavelengths (optical channels). We provide algorithms and close lower bounds for two versions of the problem on an n$n$ processor linear array/ring network. In the stationary   version, the pattern of transmissions (given) is assumed to not change over time. For this, a simple lower bound is c$c$, the congestion or the maximum total traffic required to pass through any link. We give an algorithm that schedules the transmissions using O(c+logn)$O(c+logn)$ wavelengths. We also show a pattern for which Ω(c+logn/loglogn)$\Omega (c+logn/loglogn)$ wavelengths are needed. In the on-line   version, the transmissions arrive and depart dynamically, and must be scheduled without upsetting the previously scheduled transmissions. For this case we give an on-line algorithm which has competitive ratio Θ(logn)$\Theta (logn)$. We show that this is optimal in the sense that every on-line algorithm must have competitive ratio Ω(logn)$\Omega (logn)$. We also give an algorithm that appears to do well in simulations (for the classes of traffic we consider), but which has competitive ratio between Ω(log²n/loglogn)$\Omega ({log}^{2}n/loglogn)$ and O(log²n)$O\left({log}^{2}n\right)$. We present detailed simulations of both our algorithms.     

Algorithms for computing diffuse reflection paths in polygons

Let s be a point source of light inside a polygon P of n vertices. A polygonal path from s to some point t inside P is called a diffuse reflection path if the turning points of the path lie on edges of?P. A?diffuse reflection path is said to be optimal if it has the minimum number of reflections on the path. The problem of computing a diffuse reflection path from s to t inside P has not been considered explicitly in the past. We present three different algorithms for this problem which produce suboptimal paths. For constructing such a path, the first algorithm uses a greedy method, the second algorithm uses a transformation of a minimum link path, and the third algorithm uses the edge–edge visibility graph of?P. The first two algorithms are for polygons without holes, and they run in O(n+klogn) time, where k denotes the number of reflections in the constructed path. The third algorithm is for polygons with or without holes, and it runs in O(n ²) time. The number of reflections in the path produced by this third algorithm can be at most three times that of an optimal diffuse reflection path. Though the combinatorial approach used in the third algorithm gives a better bound on the number of reflections on the path, the first and the second algorithms stand on the merit of their elegant geometric approaches based on local geometric information.