A noninvasive method to predict fluid viscosity and nanoparticle size using total internal reflection fluorescence microscopy (TIRFM) imaging

This study examines the development of an automated particle tracking algorithm to predict the hindered Brownian movement of fluorescent nanoparticles within an evanescent wave field created using total internal reflection fluorescent microscopy. The two-dimensional motion of the fluorescent nanoparticles was tracked, with sub-pixel resolution, by fitting the intensity distribution of the particles to a known Gaussian distribution, thus providing the particle center within a single pixel. Spherical yellow-green polystyrene nanoparticles (200, 500, and 1000 nm in diameter) were suspended in deionized water (control), 10 wt% d-glucose, and 10 wt% glycerol solutions, with 1 mM of NaCl added to each. The motion of tracked nanoparticles was compared with the theoretical tangential hindered Brownian motion to estimate particle diameters and fluid viscosity using a nonlinear regression technique. The automatic tracking algorithm was initially validated by comparing the automated results with manually tracked particles, 1 µm in size. Our results showed that both particle size and solution viscosity were accurately predicted from the experimental mean square displacement. Specifically, the results show that the error of particle size prediction is below 10 % and the error of solution viscosity prediction is less than 1 %. The proposed automatic analysis tool could prove to be useful in bio-application fields for examination of single protein tracking, drug delivery, and cytotoxicity. Furthermore, the proposed tool could be useful in microfluidic areas such as particle tracking velocimetry and noninvasive viscosimetry.     

A pluggable service platform architecture for e-commerce

In the beginning of the e-commerce era, retailers mostly adopted vertically integrated solutions to control the entire e-commerce value chain. However, they began to realize that to achieve agility, a better approach would be to focus on certain core capabilities and then create a partner ecosystem around them. From a technical point of view, this means it is advised to have a lightweight platform architecture with small core e-commerce functionality which can be extended by additional services from third party providers. In a typical e-commerce ecosystem with diverse information systems of network partners, integration and interoperability become critical factors to enable seamless coordination among the partners. Furthermore an increasing adoption of cloud computing technology could be observed resulting in more challenging integration scenarios involving cloud services. Thus, an e-commerce platform is required that suites the advanced needs for flexible and agile service integration. Therefore, this paper aims to present a reference architecture of a novel pluggable service platform for e-commerce. We investigate on currently available online shop platform solutions and integration platforms in the market. Based on the findings and motivated by literature on service-oriented design, we develop an architecture of a service-based pluggable platform for online retailers. This design is then instantiated by means of a prototype for an e-commerce returns handling scenario to demonstrate the feasibility of our architecture design.     

Distributed formation control with relaxed motion requirements

Heterogeneous formation shape control with interagent bearing and distance constraints involves the design of a distributed control law that ensures the formation moves such that these interagent constraints are achieved and maintained. This paper looks at the design of a distributed control scheme to solve different formation shape control problems in an ambient two‐dimensional space with bearing, distance and mixed bearing and distance constraints. The proposed control law allows the agents in the formation to move in any direction on a half‐plane and guarantees that despite this freedom, the proposed shape control algorithm ensures convergence to a formation shape meeting the prescribed constraints. This work provides an interesting and novel contrast to much of the existing work in formation control where distance‐only constraints are typically maintained and where each agent's motion is typically restricted to follow a very particular path. A stability analysis is sketched, and a number of illustrative examples are also given. Copyright © 2014 John Wiley & Sons, Ltd.     

Safe Autonomous Agent Formation Operations Via Obstacle Collision Avoidance

In this paper, we consider the problem of flocking and shape‐orientation control of multi‐agent systems with inter‐agent and obstacle collision avoidance. We first consider the problem of forcing a set of autonomous agents to form a desired formation shape and orientation while avoiding inter‐agent collision and collision with convex obstacles, and following a trajectory known to only one of the agents, namely the leader of the formation. Then we build upon the solution given to this problem and solve the problem of guaranteeing obstacle collision avoidance by changing the size and the orientation of the formation. Changing the size and the orientation of the formation is helpful when the agents want to go through a narrow passage while the existing size or orientation of the formation does not allow this. We also propose collision avoidance algorithms that temporarily change the shape of the formation to avoid collision with stationary or moving nonconvex obstacles. Simulation results are presented to show the performance of the proposed control laws.     

Short‐Time Linear Quadratic Form Technique for Estimating Fast‐Varying Parameters in Feedback Loops

The precision of a closed‐loop controller system designed for an uncertain plant depends strongly upon the maximum extent to which it is possible to track the trend of time‐varying parameters of the plant. The aim of this study is to describe a new parameter estimation algorithm that is able to follow fast‐varying parameters in closed‐loop systems. The short‐time linear quadratic form (STLQF) estimation algorithm introduced in this paper is a technique for tracking time‐varying parameters based on short‐time analysis of the regressing variables in order to minimize locally a linear quadratic form cost function. The established cost function produces a linear combination of errors with several delays. To meet this objective, mathematical development of the STLQF estimation algorithm is described. To implement the STLQF algorithm, the algorithm is applied to a planar mobile robot with fast‐varying parameters of inertia and viscous and coulomb frictions. Next, performance of the proposed algorithm is assessed against noise effects and variation in the type of parameters.     

Sound source localization using compressive sensing-based feature extraction and spatial sparsity

In this paper, we propose a source localization algorithm based on a sparse Fast Fourier Transform (FFT)-based feature extraction method and spatial sparsity. We represent the sound source positions as a sparse vector by discretely segmenting the space with a circular grid. The location vector is related to microphone measurements through a linear equation, which can be estimated at each microphone. For this linear dimensionality reduction, we have utilized a Compressive Sensing (CS) and two-level FFT-based feature extraction method which combines two sets of audio signal features and covers both short-time and long-time properties of the signal. The proposed feature extraction method leads to a sparse representation of audio signals. As a result, a significant reduction in the dimensionality of the signals is achieved. In comparison to the state-of-the-art methods, the proposed method improves the accuracy while the complexity is reduced in some cases.     

An enhanced motion estimation approach using a genetic trail bounded approximation for H.264/AVC codecs

Genetic algorithm-based motion estimation schemes play a significant role in improving the results of H.264/AVC standardization efforts when addressing conversational and non-conversational video applications. In this paper, we present a robust motion estimation scheme that uses a noble genetic trail bounded approximation (GTBA) approach to speed up the encoding process of H.264/AVC video compression and to reduce the number of bits required to code frame. The proposed algorithm is utilized to enhance the fitness function strength by integrating trail information of motion vector and sum of absolute difference (SAD) information into a fitness function. Experimental results reveal that the proposed GTBA resolves conflict obstacles with respect to both the number of bits required to code frames and the execution time for estimation.