Analysis of conduction heat transfer problems in steady, 2D regions with circular holes using a special boundary integral method

A special boundary integral method developed for two-dimensional regions containing circular holes is used to calculate temperature and heat transfer on the boundaries of several selected regions. The geometrical configuration of the region is arbitrary and convective boundary conditions are assumed. An important feature of the method is analytic representation of temperature and its normal derivative on the interior circular holes in the form of a harmonic series. This makes the application of the boundary integral method convenient and free from conditioning problems associated with small interior boundaries. Heat transfer from circular isothermal interior holes are calculated for several illustrative examples using three terms of the harmonic series representation for heat transfer at each of the circular boundaries. The results are presented and discussed.     

A Cost-Effective Thickness Measurement Technique for Engine Propellers

This paper describes the design and development of a precision calliper system to measure the surface profile of an outboard marine engine propeller blade. Several instruments that are commonly used for measuring the surface profile of a propeller blade are reviewed in this paper. These include the pitch meter, the profilometer and the computer numerical control coordinate-measuring machine (CNC-CMM). However, the operating practices and availability of different facilities in industry necessitate a more cost-effective approach. An alternative method using a precision calliper system is therefore proposed. Details of the design criteria, principles of operation and the testing and verification of the system are presented. The paper concludes that the precision calliper system is a cost-effective method for measuring the surface profile of a propeller.     

Visual tracking using convolutional features with sparse coding

Artificial Intelligence Review - Visual object tracking has become one of the most active research topics in computer vision, and it has been applied in several commercial...     

Finite-time coordination in multiagent systems using sliding mode control approach

Finite-time stability in dynamical systems theory involves systems whose trajectories converge to an equilibrium state in finite time. In this paper, we use the notion of finite-time stability to apply it to the problem of coordinated motion in multiagent systems. Specifically, we consider a group of agents described by fully actuated Euler–Lagrange dynamics along with a leader agent with an objective to reach and maintain a desired formation characterized by steady-state distances between the neighboring agents in finite time. We use graph theoretic notions to characterize communication topology in the network determined by the information flow directions and captured by the graph Laplacian matrix. Furthermore, using sliding mode control approach, we design decentralized control inputs for individual agents that use only data from the neighboring agents which directly communicate their state information to the current agent in order to drive the current agent to the desired steady state. Sliding mode control is known to drive the system states to the sliding surface in finite time. The key feature of our approach is in the design of non-smooth sliding surfaces such that, while on the sliding surface, the error states converge to the origin in finite time, thus ensuring finite-time coordination among the agents in the network. In addition, we discuss the case of switching communication topologies in multiagent systems. Finally, we show the efficacy of our theoretical results using an example of a multiagent system involving planar double integrator agents.     

Exploring album structure for face recognition in online social networks

In this paper, we propose an album-oriented face-recognition model that exploits the album structure for face recognition in online social networks. Albums, usually associated with pictures of a small group of people at a certain event or occasion, provide vital information that can be used to effectively reduce the possible list of candidate labels. We show how this intuition can be formalized into a model that expresses a prior on how albums tend to have many pictures of a small number of people. We also show how it can be extended to include other information available in a social network. Using two real-world datasets independently drawn from Facebook, we show that this model is broadly applicable and can significantly improve recognition rates.     

The rare caribbean spongeLeucosolenia canariensis: Phospholipid fatty acids and sterols

The phospholipid fatty acid composition of the Calcarean spongeLeucosolenia canariensis was studied, and no Δ^5,9 fatty acids were detected. These results are in contrast to the phospholipids from sponges belonging to the class Demospongiae where Δ5,9 fatty acids are predominant. Odd branched-chain fatty acids between 17 and 19 carbons accounted for 26% of the total fatty acids ofL. canariensis, while straight-chain fatty acids between 16 and 22 carbons accounted for 61% of the total fatty acid composition. The sterol composition ofL. canariensis is also reported, and only Δ^5,7,22 sterols were observed.     

Speech enhancement with an adaptive Wiener filter

This paper proposes an adaptive Wiener filtering method for speech enhancement. This method depends on the adaptation of the filter transfer function from sample to sample based on the speech signal statistics; the local mean and the local variance. It is implemented in the time domain rather than in the frequency domain to accommodate for the time-varying nature of the speech signals. The proposed method is compared to the traditional frequency-domain Wiener filtering, spectral subtraction and wavelet denoising methods using different speech quality metrics. The simulation results reveal the superiority of the proposed Wiener filtering method in the case of Additive White Gaussian Noise (AWGN) as well as colored noise.     

An efficient singular value decomposition algorithm for digital audio watermarking

The singular value decomposition (SVD) mathematical technique is utilized, in this paper, for audio watermarking in time and transform domains. Firstly, the audio signal in time or an appropriate transform domain is transformed to a 2-D format. The SVD algorithm is applied on this 2-D matrix, and an image watermark is added to the matrix of singular values (SVs) with a small weight, to guarantee the possible extraction of the watermark without introducing harmful distortions to the audio signal. The transformation of the audio signal between the 1-D and 2-D formats is performed in the well-known lexicographic ordering method used in image processing. A comparison study is presented in the paper between the time and transform domains as possible hosting media for watermark embedding. Experimental results are in favor of watermark embedding in the time domain if the distortion level in the audio signal is to be kept as low as possible with a high detection probability. The proposed algorithm is utilized also for embedding chaotic encrypted watermarks to increase the level of security. Experimental results show that watermarks embedded with the proposed algorithm can survive several attacks. A segment-by-segment implementation of the proposed SVD audio watermarking algorithm is also presented to enhance the detectability of the watermark in the presence of severe attacks.