Linearly tapered meander line cross dipole circularly polarized antenna for UHF RFID tag applications

In this article, a circularly polarized antenna for ultra‐high frequency radio frequency identification (RFID) tag is presented. The circular polarization is realized by two orthogonal, unequal length linearly tapered meander line cross dipoles. The meander structure with capacitive tip loading is used for size miniaturization of the antenna. A modified T‐match network is employed to feed the cross dipole structure. The measured 10‐dB return loss bandwidth of the cross dipole antenna is 17 MHz (908‐923 MHz) and the corresponding 3‐dB axial ratio bandwidth is 6 MHz (912‐918 MHz). The overall size of the proposed antenna is 0.17λ₀ × 0.17λ₀ at 915 MHz. The maximum read range between the reader and the tag with the proposed antenna is 4.7 m larger than the analogous linearly polarized tag antenna due to the reduction in polarization loss between the tag and reader antennas. Thus, a maximum read range of 15.66 m with the gain of 1.28 dBic is achieved at 915 MHz.     

Illumination and scale invariant relevant visual features with hypergraph-based learning for multi-shot person re-identification

Person re-identification which aims at matching people across disjoint cameras has received increasing attention due to the widespread use of video surveillance applications. Existing methods concentrate either on robust feature extraction or view-invariant feature transformation. However, the extracted features suffer from various limitations such as color inconsistency and scale variations. Besides, during matching, a probe is compared against each gallery instance which represents only the pairwise relationship and ignores the high order relationship among them. To address these issues, we propose a multi-shot person re-identification framework that first performs a preprocessing task on images to address illumination variations for maintaining the color consistency. Subsequently, we formulate an approach to handle scale variations in the pedestrian appearances for keeping them with relatively a fixed scale ratio. Overlapped visual patches representing appearance cues are then extracted from the processed images. A structured multi-class feature selection approach is employed to select a set of relevant patches that simultaneously discriminates all distinct persons. These selected patches use a hypergraph to represent the visual association among a probe and gallery images. Finally, for matching, we formulate a hypergraph-based learning scheme, which considers both the pairwise and high-order association among the probe and gallery images. The hypergraph structure is then optimized to yield an improved similarity score for a probe against each gallery instance. The effectiveness of our proposed framework is validated on three public datasets and comparison with state-of-the-art methods shows the superior performance of our framework.

     

Engineering self-organizing referral networks for trustworthy service selection

Developing, maintaining, and disseminating trust in open, dynamic environments is crucial. We propose self-organizing referral networks as a means for establishing trust in such environments. A referral network consists of autonomous agents that model others in terms of their trustworthiness and disseminate information on others' trustworthiness. An agent may request a service from another; a requested agent may provide the requested service or give a referral to someone else. Possibly with its user's help, each agent can judge the quality of service obtained. Importantly, the agents autonomously and adaptively decide with whom to interact and choose what referrals to issue, if any. The choices of the agents lead to the evolution of the referral network, whereby the agents move closer to those that they trust. This paper studies the guidelines for engineering self-organizing referral networks. To do so, it investigates properties of referral networks via simulation. By controlling the actions of the agents appropriately, different referral networks can be generated. This paper first shows how the exchange of referrals affects service selection. It identifies interesting network topologies and shows under which conditions these topologies emerge. Based on the link structure of the network, some agents can be identified as authorities. Finally, the paper shows how and when such authorities emerge. The observations of these simulations are then formulated into design recommendations that can be used to develop robust, self-organizing referral networks.     

An analytic algorithm for the space–time fractional advection–dispersion equation

Fractional advection–dispersion equation (FADE) is a generalization of the classical ADE in which the first order time derivative and first and second order space derivatives are replaced by Caputo derivatives of orders 0<α?1, 0<β?1 and 1<γ?2, respectively. We use Caputo definition to avoid (i) mass balance error, (ii) hyper-singular improper integral, (iii) non-zero derivative of constant, and (iv) fractional derivative involved in the initial condition which is often ill-defined. We present an analytic algorithm to solve FADE based on homotopy analysis method (HAM) which has the advantage of controlling the region and rate of convergence of the solution series via the auxiliary parameter ? over the variational iteration method (VIM) and homotopy perturbation method (HPM). We find that the proposed method converges to the numerical/exact solution of the ADE as the fractional orders α, β, γ tend to their integral values. Numerical examples are given to illustrate the proposed algorithm. Example 5 describes the intermediate process between advection and dispersion via Caputo fractional derivative.     

Design of interval networks based on neural network and Choquet integral

Design and learning of networks best suited for a particular application is a never-ending process. But this process is restricted due to problems like stability, plasticity, computation and memory consumption. In this paper, we try to overcome these problems by proposing two interval networks (INs), based on a simple feed-forward neural network (NN) and Choquet integral (CI). They have simple structures that reduce the problems of computation and memory consumption. The use of Lyapunov stability (LS) in combination with fuzzy difference (FD) based learning algorithm evolve the converging and diverging process which in turn assures the stability. FD gives a range of variation of parameters having the lower and the upper bounds within which the system is stable thus defining the plasticity. Effectiveness and applicability of the NN and CI based network models are investigated on several benchmark problems dealing with both identification and control.     

Near-Optimal Reinforcement Learning in Polynomial Time

We present new algorithms for reinforcement learning and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decision processes. After observing that the number of actions required to approach the optimal return is lower bounded by the mixing time T of the optimal policy (in the undiscounted case) or by the horizon time T (in the discounted case), we then give algorithms requiring a number of actions and total computation time that are only polynomial in T and the number of states and actions, for both the undiscounted and discounted cases. An interesting aspect of our algorithms is their explicit handling of the Exploration-Exploitation trade-off.     

The effects of adverse condition warning system characteristics on driver performance: an investigation of alarm signal type and threshold level

This study addresses the issues concerning the design of adverse condition warning systems (ACWS). ACWS are designed to sense adverse road and weather conditions as well as system states that can negatively impact driving performance leading to skids or accidents, and alert drivers to these conditions. In this case, an ACWS was designed to sense when a car was likely to skid. A virtual-driving environment was used to test two levels of alarm sensitivity (low and high) and two types of auditory alarm signal (Binary ON/OFF and Graded) along with a no-alarm control group. Dependent measures reflected driver performance, response to the alarm signal and trust in the alerting system. Results indicated that participants had fewer skids in the low sensitivity and graded alarm signal condition compared to some other alerting system configurations. Participants in the graded alarm signal condition also had a greater degree of lateral control over the vehicle. Additionally, trust was found to be lower for the high vs. low sensitivity alarm condition, indicating a reduction in trust when the alerting system activated more often, perhaps because participants did not feel the system was accurately reflecting a dangerous condition. This simulator-based research emphasizes the fact that while ACWS may provide an advantage in terms of vehicle control, characteristics of both the alerting signal and system configuration should be considered.     

A comparative study of signal transformation techniques in automated spectral unmixing of infrared spectra for remote sensing applications

From geological and planetary exploration perspectives, automated sub-pixel classification of hyperspectral data is the most difficult task as it involves blind unmixing with library spectra of minerals. In this study, we demonstrate a procedure involving spectral transformation and linear unmixing to achieve the above task. For this purpose, infrared spectra of rocks from the spectral library, field, and remotely sensed hyperspectral image cube were used. Potential spectra of minerals for unmixing rock spectra were drawn from the library based on similarity of absorption features measured using Pearson correlation coefficient. Eight transformation techniques namely, first derivative, fast Fourier transform, discrete wavelet transform, Hilbert–Huang transform, crude low pass filter, S-transform, binary encoding, spectral effective peak matching, and two sparsity-based techniques (orthogonal matching pursuit, sparse unmixing via variable splitting, and augmented Lagrangian) were evaluated. Subsequently, minerals identified by above techniques were unmixed by linear mixture model (LMM) to decipher mineralogical composition and abundance. Results of LMM achieved using fully constrained least-square-estimation-based quadratic programming optimization approach were evaluated by conventional procedures such as X-ray diffraction and microscopy. In the case of image cube, endmembers derived using minimum noise fraction and pixel purity index were subjected to above procedure. It is evident that the discrete-wavelet-transformation-based approach produced excellent and meaningful results due to its flexibility in scaling the data and capability to handle noisy spectra. It is interesting to note that the adopted procedure could perform sub-pixel classification of image cube automatically and identify predominance of dolomite in limestone and sodium in alunite based on subtle differences in absorption positions.