<?xml version="1.0" ?>
<rss version="2.0">
	<channel>
		<title><![CDATA[ Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on - new TOC ]]></title>
		<link>http://ieeexplore.ieee.org</link>
		<description>TOC Alert for Publication# 5326 </description>
		<year>2013</year>
		<month>February </month>
		<day>26</day>
		<item>
			<title><![CDATA[Table of contents]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6330041]]></link>
			<description><![CDATA[Presents the table of contents for this issue of the periodical.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6330041]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>C1</startPage>
			<endPage>4</endPage>
			<fileSize>92</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[IEEE Transactions on Systems, Man, and Cybernetics&#x2014;Part C: Applications and Reviews publication information]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6330043]]></link>
			<description><![CDATA[Provides a listing of current staff, committee members and society officers.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6330043]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>C2</startPage>
			<endPage>C2</endPage>
			<fileSize>135</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Sensor-Based Activity Recognition]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6208895]]></link>
			<description><![CDATA[Research on sensor-based activity recognition has, recently, made significant progress and is attracting growing attention in a number of disciplines and application domains. However, there is a lack of high-level overview on this topic that can inform related communities of the research state of the art. In this paper, we present a comprehensive survey to examine the development and current status of various aspects of sensor-based activity recognition. We first discuss the general rationale and distinctions of vision-based and sensor-based activity recognition. Then, we review the major approaches and methods associated with sensor-based activity monitoring, modeling, and recognition from which strengths and weaknesses of those approaches are highlighted. We make a primary distinction in this paper between data-driven and knowledge-driven approaches, and use this distinction to structure our survey. We also discuss some promising directions for future research.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6208895]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>790</startPage>
			<endPage>808</endPage>
			<fileSize>516</fileSize>
			<authors><![CDATA[Liming Chen;Hoey, J.;Nugent, C.D.;Cook, D.J.;Zhiwen Yu;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Sensor Technology Survey for a Stress-Aware Trading Process]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6148293]]></link>
			<description><![CDATA[The role of the global economy is fundamentally important to our daily lives. The stock markets reflect the state of the economy on a daily basis. Traders are the workers within the stock markets who deal with numbers, statistics, company analysis, news, and many other factors that influence the economy in real time. However, while making significant decisions within their workplace, traders must also deal with their own emotions. In fact, traders have one of the most stressful professional occupations. This survey merges current knowledge about stress effects and sensor technology by reviewing, comparing, and highlighting relevant existing research and commercial products that are available on the market. This assessment is made in order to establish how sensor technology can support traders to avoid poor decision making during the trading process. The purpose of this paper is: 1) to review the studies about the impact of stress on the decision-making process and on biological stress parameters that are applied in sensor design; 2) to compare different ways to measure stress by using sensors that are currently available in the market according to basic biometric principles under trading context; and 3) to suggest new directions in the use of sensor technology in stock markets.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6148293]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>809</startPage>
			<endPage>824</endPage>
			<fileSize>1683</fileSize>
			<authors><![CDATA[Fernandez, J.M.;Augusto, J.C.;Seepold, R.;Madrid, N.M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Brain&#x2013;Machine Interfaces: Basis and Advances]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6330046]]></link>
			<description><![CDATA[During the past 20 years, scientists have focused their efforts in the quest of real solutions in which the neural signals produced inside the human brain could be connected with computers or artificial prostheses that in a near future could be used to restore the mobility and communication abilities of patients with some damage in the central nervous system. In this paper, the procedure to control an artificial device with the thought is explained; the techniques used to extract the neural activity from the brain are classified and compared to establish their advantages, drawbacks, and future development. In addition, the main breakthroughs so far in brain-machine interfaces are described.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6330046]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>825</startPage>
			<endPage>836</endPage>
			<fileSize>584</fileSize>
			<authors><![CDATA[Becedas, J.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Social Security and Social Welfare Data Mining: An Overview]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6127920]]></link>
			<description><![CDATA[The importance of social security and social welfare business has been increasingly recognized in more and more countries. It impinges on a large proportion of the population and affects government service policies and people's life quality. Typical welfare countries, such as Australia and Canada, have accumulated a huge amount of social security and social welfare data. Emerging business issues such as fraudulent outlays, and customer service and performance improvements challenge existing policies, as well as techniques and systems including data matching and business intelligence reporting systems. The need for a deep understanding of customers and customer-government interactions through advanced data analytics has been increasingly recognized by the community at large. So far, however, no substantial work on the mining of social security and social welfare data has been reported. For the first time in data mining and machine learning, and to the best of our knowledge, this paper draws a comprehensive overall picture and summarizes the corresponding techniques and illustrations to analyze social security/welfare data, namely, social security data mining (SSDM), based on a thorough review of a large number of related references from the past half century. In particular, we introduce an SSDM framework, including business and research issues, social security/welfare services and data, as well as challenges, goals, and tasks in mining social security/welfare data. A summary of SSDM case studies is also presented with substantial citations that direct readers to more specific techniques and practices about SSDM.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6127920]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>837</startPage>
			<endPage>853</endPage>
			<fileSize>743</fileSize>
			<authors><![CDATA[Longbing Cao;]]></authors>
		</item>
		<item>
			<title><![CDATA[Either, Or: Exploration of an Emerging Decision Theory]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6162990]]></link>
			<description><![CDATA[A novel decision theory is emerging out of sparse findings in economics, mathematics and, most importantly, psychology and computational cognitive science. It rejects a fundamental assumption of the theory of rational decision making, namely, that uncertain belief rests on independent assessments of utility and probability, and includes envisioning possibilities within its scope. Several researchers working with these premises, independently of one another, have remarked that when decision is made, the positive features of the alternative that will be chosen are highlighted, and that this alternative is opposed to a loosing alternative, whose unpleasant aspects are stressed. By doing so, decision makers construct a coherent framework that provides them with a sense of direction in spite of an uncertain future. This paper frames together contributions from different disciplines, often unknown to one another, with the hope of improving the coordination of research efforts. Furthermore, it discusses the status of this emerging theory with respect to our current idea of rationality. This collection might be useful in order to develop theories and models of decision making in uncertain situations, where consequences are unknown and possibilities must be conceived. It does not provide a simple solution, but it may lay a base for future developments.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6162990]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>854</startPage>
			<endPage>864</endPage>
			<fileSize>607</fileSize>
			<authors><![CDATA[Fioretti, G.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Video-Based Abnormal Human Behavior Recognition&#x2014;A Review]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6129539]]></link>
			<description><![CDATA[Modeling human behaviors and activity patterns for recognition or detection of special event has attracted significant research interest in recent years. Diverse methods that are abound for building intelligent vision systems aimed at scene understanding and making correct semantic inference from the observed dynamics of moving targets. Most applications are in surveillance, video content retrieval, and human-computer interfaces. This paper presents not only an update extending previous related surveys, but also a focus on contextual abnormal human behavior detection especially in video surveillance applications. The main purpose of this survey is to extensively identify existing methods and characterize the literature in a manner that brings key challenges to attention.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6129539]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>865</startPage>
			<endPage>878</endPage>
			<fileSize>693</fileSize>
			<authors><![CDATA[Popoola, O.P.;Kejun Wang;]]></authors>
		</item>
		<item>
			<title><![CDATA[Mani-Web: Large-Scale Web Graph Embedding via Laplacian Eigenmap Approximation]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5976478]]></link>
			<description><![CDATA[The Web as a graph can be embedded in a low-dimensional space where its geometry can be visualized and studied in order to mine interesting patterns such as web communities. The existing algorithms operate on small-to-medium-scale graphs; thus, we propose a close to linear time algorithm called Mani-Web suitable for large-scale graphs. The result is similar to the one produced by the manifold-learning technique Laplacian eigenmap that is tested on artificial manifolds and real web-graphs. Mani-Web can also be used as a general-purpose manifold-learning/dimensionality-reduction technique as long as the data can be represented as a graph.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5976478]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>879</startPage>
			<endPage>888</endPage>
			<fileSize>1035</fileSize>
			<authors><![CDATA[Stamos, K.;Laskaris, N.A.;Vakali, A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Unsupervised Construction of an Indoor Floor Plan Using a Smartphone]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6060924]]></link>
			<description><![CDATA[Indoor pedestrian tracking extends location-based services to indoor environments. Typical indoor positioning systems employ a training/positioning model using Wi-Fi fingerprints. While these approaches have practical results in terms of accuracy and coverage, they require an indoor map, which is typically not available to the average user and involves significant training costs. A practical indoor pedestrian tracking approach should consider the indoor environment without a pretrained database or floor plan. In this paper, we present an indoor pedestrian tracking system, called SmartSLAM, which automatically constructs an indoor floor plan and radio fingerprint map for anonymous buildings using a smartphone. The scheme employs odometry tracing using inertial sensors, an observation model using Wi-Fi signals, and a Bayesian estimation for floor-plan construction. SmartSLAM is a true simultaneous localization and mapping implementation that does not necessitate additional devices, such as laser rangefinders or wheel encoders. We implemented the scheme on off-the-shelf smartphones and evaluated the performance in our university buildings. Despite inherent tracking errors from noisy sensors, SmartSLAM successfully constructed indoor floor plans.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6060924]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>889</startPage>
			<endPage>898</endPage>
			<fileSize>1079</fileSize>
			<authors><![CDATA[Hyojeong Shin;Yohan Chon;Hojung Cha;]]></authors>
		</item>
		<item>
			<title><![CDATA[Modeling the Strategic Process of Decision-Making Support Systems Implementations: A System Dynamics Approach Review]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6081982]]></link>
			<description><![CDATA[Implementing decision-making support systems (DMSS) is considered an organizationally complex and risky task that is influenced by dynamic technical and social-political issues. Consequently, DMSS implementation failures, with associated economic loses, are still reported. While several statistics-based (static) quantitative models of successful factors and qualitative (descriptive) models to implement DMSS are available, few quantitative dynamic models have been posed. In this paper, we illustrate how a dynamic simulation model of the DMSS implementation process can be designed. We use a system dynamics approach via an extended methodology, which is called critical realism-based methodology for studying soft systems dynamics. Validation is realized through 1) the theoretical validity of the model, 2) the model's capability in reproducing historical DMSS implementation paths, and 3) the model's capability in predicting new DMSS implementation paths from new cases. Simulation results suggest the adequacy of using these modeling methods to complement the knowledge on the DMSS implementation processes.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6081982]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>899</startPage>
			<endPage>912</endPage>
			<fileSize>3498</fileSize>
			<authors><![CDATA[Mora, M.;Cervantes-Pe&#x0301;rez, F.;Gelman-Muravchik, O.;Forgionne, G.A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Predicting DNA Motifs by Using Evolutionary Multiobjective Optimization]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6093976]]></link>
			<description><![CDATA[Bioinformatics and computational biology include researchers from many areas: biochemists, physicists, mathematicians, and engineers. The scale of the problems that are discussed ranges from small molecules to complex systems, where many organisms coexist. However, among all these issues, we can highlight genomics, which studies the genomes of microorganisms, plants, and animals. Predicting common patterns, i.e., motifs, in a set of deoxyribonucleic acid (DNA) sequences is one of the important sequence analysis problems, and it has not yet been resolved in an efficient manner. In this study, we study the application of evolutionary multiobjective optimization to solve the motif discovery problem, applied to the specific task of discovering novel transcription factor binding sites in DNA sequences. For this, we have designed, adapted, configured, and evaluated several types of multiobjective metaheuristics. After a detailed study, the results indicate that these metaheuristics are appropriate for discovering motifs. To find good approximations to the Pareto front, we use the hypervolume indicator, which has been successfully integrated into evolutionary algorithms. Besides the hypervolume indicator, we also use the coverage relation to ensure: Which is the best Pareto front? New results have been obtained, which significantly improve those published in previous research works.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6093976]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>913</startPage>
			<endPage>925</endPage>
			<fileSize>790</fileSize>
			<authors><![CDATA[Gonzalez-A&#x0301;lvarez, D.L.;Vega-Rodriguez, M.A.;Gomez-Pulido, J.A.;Sanchez-Pe&#x0301;rez, J.M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Energy-Efficiency-Based Gait Control System Architecture and Algorithm for Biped Robots]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6095382]]></link>
			<description><![CDATA[A novel systematic architecture and algorithm of gait control based on energy-efficiency optimization is represented, aiming at the fatal problem of high energy consumption for biped robots walking in unstructured environments. By designing an optimal controller to minimize the energy criterion, the proposed method provides a remarkable descend rate of energy consumption in the trunk-rotation walking mechanism. The proposed algorithm is able to optimize the trunk trajectory by minimizing the energy-related cost function while guaranteeing zero-moment point (ZMP) criterion. Simulations and experimental results show the validity of the method.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6095382]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>926</startPage>
			<endPage>933</endPage>
			<fileSize>506</fileSize>
			<authors><![CDATA[Zhi Liu;Liyang Wang;Chen, C.C.L.;Xiaojie Zeng;Yun Zhang;Yaonan Wang;]]></authors>
		</item>
		<item>
			<title><![CDATA[Graph-Based Multiprototype Competitive Learning and Its Applications]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6109358]]></link>
			<description><![CDATA[Partitioning nonlinearly separable datasets is a basic problem that is associated with data clustering. In this paper, a novel approach that is termed graph-based multiprototype competitive learning (GMPCL) is proposed to handle this problem. A graph-based method is employed to produce an initial, coarse clustering. After that, a multiprototype competitive learning is introduced to refine the coarse clustering and discover clusters of an arbitrary shape. The GMPCL algorithm is further extended to deal with high-dimensional data clustering, i.e., the fast graph-based multiprototype competitive learning (FGMPCL) algorithm. An experimental comparison has been performed by the exploitation of both synthetic and real-world datasets to validate the effectiveness of the proposed methods. Additionally, we apply our GMPCL/FGMPCL to two computer-vision tasks, namely, automatic color image segmentation and video clustering. Experimental results show that GMPCL/FGMPCL provide an effective and efficient tool with application to computer vision.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6109358]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>934</startPage>
			<endPage>946</endPage>
			<fileSize>1000</fileSize>
			<authors><![CDATA[Chang-Dong Wang;Jian-Huang Lai;Jun-Yong Zhu;]]></authors>
		</item>
		<item>
			<title><![CDATA[Application-Oriented Intelligent Middleware for Distributed Sensing and Control]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6180220]]></link>
			<description><![CDATA[In this paper, wireless sensor networks are proposed as a distributed sensing and control (DSC) approach for productivity and safety improvement of harsh and dynamic industrial systems, such as factory automation, oil and gas industries, and wind farms. The proposed approach focuses on DSC middleware, which considers both application requirements and network resource constraints. By embedding complex application knowledge at different levels and configuring network topology in real time, the DSC system can accomplish effective task assignment, optimal network deployment, and device-level intelligence. IEC 61499 function blocks and intelligent agents are employed as modeling tools for the middleware implementation.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6180220]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>947</startPage>
			<endPage>956</endPage>
			<fileSize>822</fileSize>
			<authors><![CDATA[Ningxu Cai;Gholami, M.;Litao Yang;Brennan, R.W.;]]></authors>
		</item>
		<item>
			<title><![CDATA[An Efficient Evolutionary Approach to Parameter Identification in a Building Thermal Model]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6105579]]></link>
			<description><![CDATA[Thermal models of buildings are often used to identify energy savings within a building. Given that a significant proportion of that energy is typically used to maintain building temperature, establishing the optimal control of the buildings thermal system is important. This requires an understanding of the thermal dynamics of the building, which is often obtained from physical thermal models. However, these models require detailed building parameters to be specified and these can often be difficult to determine. In this paper, we propose an evolutionary approach to parameter identification for thermal models that are formulated as an optimization task. A state-of-the-art evolutionary algorithm, i.e., SaNSDE+, has been developed. A fitness function is defined, which quantifies the difference between the energy-consumption time-series data that are derived from the identified parameters and that given by simulation with a set of predetermined target model parameters. In comparison with a conventional genetic algorithm, fast evolutionary programming, and two state-of-the-art evolutionary algorithms, our experimental results show that the proposed SaNSDE+ has significantly improved both the solution quality and the convergence speed, suggesting this is an effective tool for parameter identification for simulated building thermal models.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6105579]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>957</startPage>
			<endPage>969</endPage>
			<fileSize>855</fileSize>
			<authors><![CDATA[Zhenyu Yang;Xiaoli Li;Bowers, C.P.;Schnier, T.;Ke Tang;Xin Yao;]]></authors>
		</item>
		<item>
			<title><![CDATA[Classification of Upper Limb Motion Trajectories Using Shape Features]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6108375]]></link>
			<description><![CDATA[To understand and interpret human motion is a very active research area nowadays because of its importance in sports sciences, health care, and video surveillance. However, classification of human motion patterns is still a challenging topic because of the variations in kinetics and kinematics of human movements. In this paper, we present a novel algorithm for automatic classification of motion trajectories of human upper limbs. The proposed scheme starts from transforming 3-D positions and rotations of the shoulder/elbow/wrist joints into 2-D trajectories. Discriminative features of these 2-D trajectories are, then, extracted using a probabilistic shape-context method. Afterward, these features are classified using a k-means clustering algorithm. Experimental results demonstrate the superiority of the proposed method over the state-of-the-art techniques.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6108375]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>970</startPage>
			<endPage>982</endPage>
			<fileSize>1329</fileSize>
			<authors><![CDATA[Huiyu Zhou;Huosheng Hu;Honghai Liu;Jinshan Tang;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Negotiation-Based Capacity-Planning Model]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6109359]]></link>
			<description><![CDATA[Capacity planning deals with the conflicts among multiple factories. This study employs a negotiation framework to allow autonomous budget allocation among factories and make full use of manufacturing resources capacity scattered over individual factories. Factories are modeled as intelligent entities that exchange offer messages with one another. This study investigates the effects of the attitudes of a factory, while it bargains with other factories over the budget. Furthermore, individual factories apply a capacity-planning optimization model and a genetic algorithm to revise their capacity plan right after receiving new messages from other factories. This paper makes a contribution in successfully building a negotiation-based capacity-planning model applied to a multiple-factory environment. The outcome of the experiments shows the efficiency of the proposed model and the effect of different negotiation attitudes.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6109359]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>983</startPage>
			<endPage>993</endPage>
			<fileSize>808</fileSize>
			<authors><![CDATA[Kung-Jeng Wang;Shih-Min Wang;]]></authors>
		</item>
		<item>
			<title><![CDATA[A New Intelligent Agent-Based AGC Design With Real-Time Application]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6134685]]></link>
			<description><![CDATA[Automatic generation control (AGC) is one of the important control problems in electric power system design and operation, and is becoming more significant today because of increasing renewable energy sources such as wind farms. The power fluctuation caused by a high penetration of wind farms negatively contributes to the power imbalance and frequency deviation. In this paper, a new intelligent agent-based control scheme, using Bayesian networks (BNs), is addressed to design AGC system in a multiarea power system. Model independence and flexibility in specifying the control objectives identify the proposed approach as an attractive solution for AGC design in a real-world power system. The BN also provides a robust probabilistic method of reasoning under uncertainty, and moreover, using multiagent structure in the proposed control framework realizes parallel computation and a high degree of scalability. The proposed control scheme is examined on the 10-machine New England test power system. An experimental real-time implementation is also performed on the aggregated model of West Japan power system.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6134685]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>994</startPage>
			<endPage>1002</endPage>
			<fileSize>746</fileSize>
			<authors><![CDATA[Bevrani, H.;Daneshfar, F.;Hiyama, T.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Color Trend Forecasting of Fashionable Products with Very Few Historical Data]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6118333]]></link>
			<description><![CDATA[In time-series forecasting, statistical methods and various newly emerged models, such as artificial neural network (ANN) and grey model (GM), are often used. No matter which forecasting method one would apply, it is always a huge challenge to make a sound forecasting decision under the condition of having very few historical data. Unfortunately, in fashion color trend forecasting, the availability of data is always very limited owing to the short selling season and life of products. This motivates us to examine different forecasting models for their performances in predicting color trend of fashionable product under the condition of having very few data. By employing real sales data from a fashion company, we examine various forecasting models, namely ANN, GM, Markov regime switching, and GM+ANN hybrid models, in the domain of color trend forecasting with a limited amount of historical data. Comparisons are made among these models. Insights on the appropriate choice of forecasting models are generated.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6118333]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1003</startPage>
			<endPage>1010</endPage>
			<fileSize>372</fileSize>
			<authors><![CDATA[Tsan-Ming Choi;Chi-Leung Hui;Sau-Fun Ng;Yong Yu;]]></authors>
		</item>
		<item>
			<title><![CDATA[Kernel Ridge Regression with Lagged-Dependent Variable: Applications to Prediction of Internal Bond Strength in a Medium Density Fiberboard Process]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6177683]]></link>
			<description><![CDATA[Medium density fiberboard (MDF) is one of the most popular products in wood composites industry. Kernel-based regression approaches such as the support vector machine for regression have been used to predict the final product quality characteristics of MDF. However, existing approaches for the prediction do not consider the autocorrelation of observations while exploring the nonlinearity of data. To avoid such a problem, this paper proposes a kernel-based regression model with lagged-dependent variables (LDVs) to consider both autocorrelations of response variables and the nonlinearity of data. We will explore the nonlinear relationship between the response and both independent variables and past response variables using various kernel functions. In this case, it will be difficult to apply existing kernel trick because of LDVs. We derive the kernel ridge estimators with LDVs using a new mapping idea so that the nonlinear mapping does not have to be computed explicitly. In addition, the centering technique of the individual mapped data in the feature space is derived to consider an intercept term in kernel ridge regression (KRR) with LDVs. The performances of the proposed approaches are compared with those of popular approaches such as KRR, ordinary least squares (OLS) with LDVs using simulated and real-life datasets. Experimental results show that the proposed approaches perform better than KRR or ridge regression and yield consistently better results than OLS with LDVs, implying that it can be used as a promising alternative when there are autocorrelations of response variables.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6177683]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1011</startPage>
			<endPage>1020</endPage>
			<fileSize>386</fileSize>
			<authors><![CDATA[Kim, N.;Young-Seon Jeong;Myong-Kee Jeong;Young, T.M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Robust and Effective Component-Based Banknote Recognition for the Blind]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6134686]]></link>
			<description><![CDATA[We develop a novel camera-based computer vision technology to automatically recognize banknotes to assist visually impaired people. Our banknote recognition system is robust and effective with the following features: 1) high accuracy: high true recognition rate and low false recognition rate; 2) robustness: handles a variety of currency designs and bills in various conditions; 3) high efficiency: recognizes banknotes quickly; and 4) ease of use: helps blind users to aim the target for image capture. To make the system robust to a variety of conditions including occlusion, rotation, scaling, cluttered background, illumination change, viewpoint variation, and worn or wrinkled bills, we propose a component-based framework by using speeded up robust features (SURF). Furthermore, we employ the spatial relationship of matched SURF features to detect if there is a bill in the camera view. This process largely alleviates false recognition and can guide the user to correctly aim at the bill to be recognized. The robustness and generalizability of the proposed system are evaluated on a dataset including both positive images (with U.S. banknotes) and negative images (no U.S. banknotes) collected under a variety of conditions. The proposed algorithm achieves 100% true recognition rate and 0% false recognition rate. Our banknote recognition system is also tested by blind users.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6134686]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1021</startPage>
			<endPage>1030</endPage>
			<fileSize>888</fileSize>
			<authors><![CDATA[Hasanuzzaman, F.M.;Xiaodong Yang;Yingli Tian;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Fuzzy Intimacy Space Model to Develop Human&#x2013;Robot Attitudinal Relationship]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6164268]]></link>
			<description><![CDATA[This paper presents a novel method to develop a human-robot attitudinal relationship based on intimacy. For a robot to estimate human's intimacy, we propose a fuzzy space model to classify intimate human behavioral patterns. Proxemic, tactile, and oculesic behavioral features, which are dominantly used for intimacy exchange in human-human communication, are analyzed to develop the 3-D intimacy space. The proposed model provides social standards to develop an intimacy-based attitudinal relationship between a human and a robot. We analyze the generality of our model through a sample interaction scenario and discuss how intimacy can be incrementally learnt for a long-term interaction between a robot and a human.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6164268]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1031</startPage>
			<endPage>1041</endPage>
			<fileSize>1259</fileSize>
			<authors><![CDATA[Young-Min Kim;Munsang Kim;Dong-Soo Kwon;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Novel Approach to Optimization of Refining Schedules for Crude Oil Operations in Refinery]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6185692]]></link>
			<description><![CDATA[Short-term scheduling for crude oil operations is a combinatorial problem and involves extreme detail. Thus, it is very complicated and, up to now, there is no efficient technique and software tool for it. To search for efficient techniques, a two-layer hierarchical solution is proposed for it. At the upper level, one finds a realizable refining schedule to optimize some objectives. At the lower level, a detailed schedule is obtained to realize it. A methodology has been presented to solve the lower level problem from a control perspective by the authors of this paper. In this paper, the upper level problem for finding optimal refining schedules is addressed, and a novel method is proposed based on the results obtained at the lower level. This method solves a linear programming problem to determine the maximal production rate and a transportation problem to optimally assign crude oil types and volume to the distillers. This way, the method is computationally very efficient. An industrial case study is presented to show the application of the proposed method.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6185692]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1042</startPage>
			<endPage>1053</endPage>
			<fileSize>676</fileSize>
			<authors><![CDATA[NaiQi Wu;Liping Bai;MengChu Zhou;Feng Chu;Mammar, S.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Autonomous Application Recovery in Distributed Intelligent Automation and Control Systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6168853]]></link>
			<description><![CDATA[Over the past decade, a clear trend toward distributed automation in industrial systems was observable. This means that applications are executed at heterogeneous control devices and communication networks. One of the main drivers of this development was the availability of cheap computing and communication resources. Moreover, a strong market demand for operation and adaptation of automation and control services with no downtime is also often requested. As a result, appropriate approaches recovering and (re)configuring automation and control devices as well as even their services and functions during full operation are needed. The relatively new standard IEC 61499 &#x201C;Function Blocks&#x201D; provides a reference model for the development and implementation of distributed industrial process measurement and control systems (IPMCSs). It provides a scalable and open architecture to model distributed automation and control applications. The high-level goals of IEC 61499 can be summarized as interoperability, (re)configurability, and portability of distributed applications for IPMCS. Therefore, it provides a very good basis for dynamic (re)configuration and recovery of applications and status information in heterogeneous IPMCS and may master some of the shortcomings of present-day systems. The main purpose of this paper is to present and discuss a general concept for autonomous recovery of applications within the context of distributed automation and control systems which has been implemented using the IEC 61499 reference model.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6168853]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1054</startPage>
			<endPage>1070</endPage>
			<fileSize>1386</fileSize>
			<authors><![CDATA[Strasser, T.;Froschauer, R.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Optimal Periodic Scheduling Under Multimodel Per-Item Constraints in Wireless Systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6193229]]></link>
			<description><![CDATA[A novel periodic scheduling scheme for wireless environments is presented. The proposed scheme enables quality of service (QoS) agreements per data item, contrary to the per-dataset approach of existing solutions. Constraints abiding by any of the existing models (impatience, utility, and waiting time) are allowed to exist concurrently. The impact of individual agreements on the system's performance as a whole is analytically studied and quantified. Comparison with related approaches rendered the proposed scheme optimally efficient and flexible enough to serve as a basis for the implementation of specialized QoS metrics as well.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6193229]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1071</startPage>
			<endPage>1080</endPage>
			<fileSize>889</fileSize>
			<authors><![CDATA[Liaskos, C.K.;Papadimitriou, G.I.;]]></authors>
		</item>
		<item>
			<title><![CDATA[The Adaptive Recommendation Mechanism for Distributed Group in Mobile Environments]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6330047]]></link>
			<description><![CDATA[Tourism navigation systems have become an important research area because they help people strengthen their focus on the quality of the tourism. This paper proposes an adaptive recommendation mechanism that rests on a congestion-aware scheduling method for multigroup travelers on multidestination travels. This recommendation scheme uses the pheromone mechanism of an ant algorithm for group system distribution. In order to reduce congestion in the &#x201C;visiting multiple destinations&#x201D; problem that might beset the multiple groups, we present a tour group that could take adaptive recommendations from a system that would yield a high quality tour experience, wherein the group would visit a secondary destination first and then visit the primary destination. Simulation results reveal the strengths of the proposed &#x201C;adaptive recommendation mechanism&#x201D; model in terms of decreasing average waiting time, congestion, and the ratio of congestion avoiding to number of groups.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6330047]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1081</startPage>
			<endPage>1092</endPage>
			<fileSize>2545</fileSize>
			<authors><![CDATA[Sheng-Tzong Cheng;Gwo-Jiun Horng;Chih-Lun Chou;]]></authors>
		</item>
		<item>
			<title><![CDATA[An Evolutionary Multiobjective Sleep-Scheduling Scheme for Differentiated Coverage in Wireless Sensor Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6330048]]></link>
			<description><![CDATA[We propose an online, multiobjective optimization (MO) algorithm to efficiently schedule the nodes of a wireless sensor network (WSN) and to achieve maximum lifetime. Instead of dealing with traditional grid or uniform coverage, we focus on the differentiated or probabilistic coverage where different regions require different levels of sensing. The MO algorithm helps to attain a better tradeoff among energy consumption, lifetime, and coverage. The algorithm can be run every time a node failure occurs due to power failure of the node battery so that it may reschedule the network. This scheduling is modeled as a combinatorial, multiobjective, and constrained optimization problem with energy and noncoverage as the two objectives. The basic evolutionary multiobjective optimizer used is known as decomposition-based multiobjective evolutionary algorithm (MOEA/D) which is modified by integrating the concept of fuzzy Pareto dominance. The performance of the resulting algorithm, which is called MOEA/DFD, is compared with the performance of the original MOEA/D, which is another very well known MO algorithm called nondominated sorting genetic algorithm (NSGA-II), and an IBM optimization software package called CPLEX. In all the tests, MOEA/DFD is observed to outperform all other algorithms.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6330048]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1093</startPage>
			<endPage>1102</endPage>
			<fileSize>902</fileSize>
			<authors><![CDATA[Sengupta, S.;Das, S.;Nasir, M.;Vasilakos, A.V.;Pedrycz, W.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Attribute-Driven Hidden Markov Model Trees for Intention Prediction]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6212389]]></link>
			<description><![CDATA[In this paper, we introduce a novel approach to generate an intention prediction model of user interactions with systems. As part of this new approach, we include personal aspects, such as user characteristics, that can increase prediction accuracy. The model is automatically trained according to the user's fixed attributes (e.g., demographic data such as age and gender) and the user's sequences of actions in the system. The generated model has a tree structure. The building blocks of each node can be any probabilistic sequence model [such as hidden Markov models (HMMs) and conditional random fields (CRFs)] and each node is split according to user attributes. Thus, we refer to this algorithm as an attribute-driven model tree. The new model was first tested on simulated data in which users with different attributes (such as age and gender) behave differently when trying to accomplish various tasks. We then validated the ability of the algorithm to discover the relevant attributes. We tested our algorithm on two real datasets: from a web application and a mobile application dataset. The results were encouraging and indicate the capability of the proposed method to discover the correct user intention model and increasing intention prediction accuracy compared with single HMM or CRF models.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6212389]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1103</startPage>
			<endPage>1119</endPage>
			<fileSize>2424</fileSize>
			<authors><![CDATA[Antwarg, L.;Rokach, L.;Shapira, B.;]]></authors>
		</item>
		<item>
			<title><![CDATA[An Adaptive Recognition Model for Image Annotation]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6135819]]></link>
			<description><![CDATA[In this paper, an adaptive recognition model (ARM) is proposed for image annotation. The ARM consists of an adaptive classification network (CFN) and a nonlinear correlation network (CLN). The adaptive CFN aims to annotate an image with keywords, and the CLN is used to unveil the correlative information of keywords for annotation refinement. Image annotation is carried out by an ARM in two stages. In the first stage, the features extracted from regions of the input image are fed to a CFN to produce classification labels. In the second stage, the CLN uses keyword correlations learned from the training images to refine the classification result. The ARM works in a forward-propagating manner, resulting in high efficiency in image annotation. Furthermore, the computational time of an ARM is insensitive to the number of regions of the input image and the vocabulary size. In this paper, the effect of keyword correlation in image annotation is, comprehensively, investigated on a real image dataset and a synthetic image dataset. The exploitation of a controllable synthetic dataset helps to systematically study the function of keyword correlation and effectively analyze the performance of the ARM. Experimental results demonstrate the efficiency and effectiveness of the ARM.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6135819]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1120</startPage>
			<endPage>1127</endPage>
			<fileSize>596</fileSize>
			<authors><![CDATA[Zenghai Chen;Hong Fu;Zheru Chi;Feng, D.D.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Genetic Algorithm-Inspired UUV Path Planner Based on Dynamic Programming]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6135820]]></link>
			<description><![CDATA[Path planning can be viewed as an optimization process in which an optimum path between two points is to be found under some predefined constraints. Some typical constraints are path length, fuel consumption, and path safety factor. Exact algorithms such as linear programming (LP) and dynamic programming (DP) are widely adopted in vehicle maneuvering systems. However, as the problem domain scales up, exact algorithms suffer from high computational complexity. In contrast, metaheuristic algorithms such as evolutionary algorithms (EA) and genetic algorithms (GA) can provide suboptimum solutions without the full understanding of the problem domain. Metaheuristic algorithms are capable of providing decent solutions within a finite period of time, even for large-scaled problems. In this paper, a GA-inspired unmanned underwater vehicle (UUV) path planner based on DP is proposed. Simulation results show that the proposed algorithm can outperform a GA-based UUV path planner in terms of speed and solution quality.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6135820]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1128</startPage>
			<endPage>1134</endPage>
			<fileSize>722</fileSize>
			<authors><![CDATA[Chi-Tsun Cheng;Fallahi, K.;Leung, H.;Tse, C.K.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Fault Simulator Based on a Hardware-in-the-Loop Technique]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6153080]]></link>
			<description><![CDATA[Among motor faults, bearing, rotator, and stator failures are the most commonly reported. Because of the low-amplitude fault signatures in the current spectrum, they are also the most challenging to diagnose, even in line-driven motors. However, a fault simulator of induction motors has not been adequately investigated in the literature. The purpose of this paper is to build a hardware-in-the-loop (HIL) simulation system to model system failures of induction drives. The HIL system is based on a dynamical mathematical model, consisting of a dSPACE control system to process data and a real dc motor. The proposed system can produce bearing, rotator, stator, and sensor failures for testing of various fault diagnosis schemes. The experimental results show its functionality.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6153080]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1135</startPage>
			<endPage>1139</endPage>
			<fileSize>638</fileSize>
			<authors><![CDATA[Sunan Huang;Kok Kiong Tan;]]></authors>
		</item>
		<item>
			<title><![CDATA[Guest Editorial: Special Issue on Multimodal Human--Robot Interfaces]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392446]]></link>
			<description><![CDATA[The four papers in this special section focus on multimodal human robot interface technologies and applications.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392446]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1140</startPage>
			<endPage>1141</endPage>
			<fileSize>131</fileSize>
			<authors><![CDATA[Azor&#x00ED;n, J. M.;Pons, J. L.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Multimodal Communication for Human-Friendly Robot Partners in Informationally Structured Space]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392476]]></link>
			<description><![CDATA[This paper proposes a multimodal communication method for human-friendly robot partners based on various types of sensors. First, we explain informationally structured space to extend the cognitive capabilities of robot partners based on environmental systems. Next, we discuss the suitable measurement range for recognition technologies of touch interface, voice recognition, human detection, gesture recognition, and others. Based on the suitable measurement ranges, we propose an integration method to estimate human behaviors based on the human detection using color image and 3-D distance information, and gesture recognition by the multilayered spiking neural network using the time series of human-hand positions. Furthermore, we propose a conversation system to realize the multimodal communication with a person. Finally, we show several experimental results of the proposed method, and discuss the future direction of this research.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392476]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1142</startPage>
			<endPage>1151</endPage>
			<fileSize>877</fileSize>
			<authors><![CDATA[Kubota, N.;Toda, Y.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Multimodal Interfaces to Improve Therapeutic Outcomes in Robot-Assisted Rehabilitation]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392456]]></link>
			<description><![CDATA[The paper presents the developing of a new robotic system for the administration of a highly sophisticated therapy to stroke patients. This therapy is able to maximize patient motivation and involvement in the therapy and continuously assess the progress of the recovery from the functional viewpoint. Current robotic rehabilitation systems do not include patient information on the control loop. The main novelty of the presented approach is to close patient in the loop and use multisensory data (such as pulse, skin conductance, skin temperature, position, velocity, etc.) to adaptively and dynamically change complexity of the therapy and real-time displays of a virtual reality system in accordance with specific patient requirements. First, an analysis of subject's physiological responses to different tasks is presented with the objective to select the best candidate of physiological signals to estimate the patient physiological state during the execution of a virtual rehabilitation task. Then, the design of a prototype of multimodal robotic platform is defined and developed to validate the scientific value of the proposed approach.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392456]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1152</startPage>
			<endPage>1158</endPage>
			<fileSize>664</fileSize>
			<authors><![CDATA[Badesa, F.J.;Morales, R.;Garcia-Aracil, N.;Sabater, J.M.;Perez-Vidal, C.;Fernandez, E.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Multimodal Human&#x2013;Robot Interface to Drive a Neuroprosthesis for Tremor Management]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392454]]></link>
			<description><![CDATA[Tremor is the most prevalent movement disorder, and its incidence is increasing with aging. In spite of the numerous therapeutic solutions available, 65% of those suffering from upper limb tremor report serious difficulties during their daily living. This gives rise to research on different treatment alternatives, amongst which wearable robots that apply selective mechanical loads constitute an appealing approach. In this context, the current work presents a multimodal human-robot interface to drive a neuroprosthesis for tremor management. Our approach relies on the precise characterization of the tremor to modulate a functional electrical stimulation system that compensates for it. The neuroprosthesis is triggered by the detection of the intention to move derived from the analysis of electroencephalographic activity, which provides a natural interface with the user. When a prediction is delivered, surface electromyography serves to detect the actual onset of the tremor in the presence of volitional activity. This information in turn triggers the stimulation, which relies on tremor parameters-amplitude and frequency-derived from a pair of inertial sensors that record the kinematics of the affected joint. Surface electromyography also yields a first characterization of the tremor, together with precise information on the preferred stimulation site. Apart from allowing for an optimized performance of the system, our multimodal approach permits the implementation of redundant methods to both enhance the reliability of the system and adapt to the specific needs of different users. Results with a representative group of patients illustrate the performance of the interface presented here and demonstrate its feasibility.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392454]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1159</startPage>
			<endPage>1168</endPage>
			<fileSize>1038</fileSize>
			<authors><![CDATA[Gallego, J.A.;Ibanez, J.;Dideriksen, J.L.;Serrano, J.I.;del Castillo, M.D.;Farina, D.;Rocon, E.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A New Gaze-BCI-Driven Control of an Upper Limb Exoskeleton for Rehabilitation in Real-World Tasks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392463]]></link>
			<description><![CDATA[This paper proposes a new multimodal architecture for gaze-independent brain-computer interface (BCI)-driven control of a robotic upper limb exoskeleton for stroke rehabilitation to provide active assistance in the execution of reaching tasks in a real setting scenario. At the level of action plan, the patient's intention is decoded by means of an active vision system, through the combination of a Kinect-based vision system, which can online robustly identify and track 3-D objects, and an eye-tracking system for objects selection. At the level of action generation, a BCI is used to control the patient's intention to move his/her own arm, on the basis of brain activity analyzed during motor imagery. The main kinematic parameters of the reaching movement (i.e., speed, acceleration, and jerk) assisted by the robot are modulated by the output of the BCI classifier so that the robot-assisted movement is performed under a continuous control of patient's brain activity. The system was experimentally evaluated in a group of three healthy volunteers and four chronic stroke patients. Experimental results show that all subjects were able to operate the exoskeleton movement by BCI with a classification error rate of 89.4&#x00B1;5.0% in the robot-assisted condition, with no difference of the performance observed in stroke patients compared with healthy subjects. This indicates the high potential of the proposed gaze-BCI-driven robotic assistance for neurorehabilitation of patients with motor impairments after stroke since the earliest phase of recovery.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392463]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1169</startPage>
			<endPage>1179</endPage>
			<fileSize>1496</fileSize>
			<authors><![CDATA[Frisoli, A.;Loconsole, C.;Leonardis, D.;Banno, F.;Barsotti, M.;Chisari, C.;Bergamasco, M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Information-Theoretic Linear Feature Extraction Based on Kernel Density Estimators: A Review]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6185689]]></link>
			<description><![CDATA[In this paper, we provide a unified study of the application of kernel density estimators to supervised linear feature extraction by means of criteria inspired by information and detection theory. We enrich this study by the incorporation of two novel criteria to the study, i.e., the mutual information and the likelihood ratio test, and perform both a theoretical and an experimental comparison between the new methods and other ones previously described in the literature. The impact of the bandwidth selection of the density estimator in the classification performance is discussed. Some theoretical results that bound classification performance as a function or mutual information are also compiled. A set of experiments on different real-world datasets allows us to perform an empirical comparison of the methods, in terms of both accuracy and computational complexity. We show the suitability of these methods to determine the dimension of the subspace that contains the discriminative information.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6185689]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1180</startPage>
			<endPage>1189</endPage>
			<fileSize>1417</fileSize>
			<authors><![CDATA[Leiva-Murillo, J.M.;Artes-Rodri&#x0301;guez, A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Review of Smart Homes&#x2014;Past, Present, and Future]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6177682]]></link>
			<description><![CDATA[A smart home is an application of ubiquitous computing in which the home environment is monitored by ambient intelligence to provide context-aware services and facilitate remote home control. This paper presents an overview of previous smart home research as well as the associated technologies. A brief discussion on the building blocks of smart homes and their interrelationships is presented. It describes collective information about sensors, multimedia devices, communication protocols, and systems, which are widely used in smart home implementation. Special algorithms from different fields and their significance are explained according to their scope of use in smart homes. This paper also presents a concrete guideline for future researchers to follow in developing a practical and sustainable smart home.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6177682]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1190</startPage>
			<endPage>1203</endPage>
			<fileSize>1084</fileSize>
			<authors><![CDATA[Alam, M.R.;Reaz, M.B.I.;Ali, M.A.M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Iterative Deadlock Control by Using Petri Nets]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6185690]]></link>
			<description><![CDATA[Deadlocks should be eliminated in resource allocation systems such as flexible manufacturing systems. An iterative deadlock control policy is usually considered to be a natural solution with reasonable computational cost for a large-scale system where direct methods would be prohibitively expensive (and in some cases impossible) even with the best available computing power. This paper reviews the existing iterative deadlock prevention policies for discrete event systems that are modeled with Petri nets. A number of technical problems in the existing iterative deadlock control approaches are formulated and discussed. Their solutions are illustrated through case studies. We conclude that the suitability, effectiveness, and efficiency of an iterative deadlock control approach are sensitive to specific examples, and no general algorithm is found in the literature, which works well for all cases.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6185690]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1204</startPage>
			<endPage>1218</endPage>
			<fileSize>937</fileSize>
			<authors><![CDATA[AnRong Wang;Zhiwu Li;MengChu Zhou;Al-Ahmari, A.M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Toward Intelligent Security Robots: A Survey]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392475]]></link>
			<description><![CDATA[In this paper, a survey is being conducted on the investigation of a four-class taxonomy related to security robots that appeared over the past three decades. The survey emphasizes on state-of-the-art mobile technologies that have been developed for crime-fighting robots, capable of crafting critical situations with confrontation strategies. Throughout this investigation, 60 projects are being examined with respect to faculties and sensor apparatus being used. A statistical analysis, which is carried on the historical developments of the most attractive frameworks, reveals the popularity of the four security robot categories and their chronological progress over the past 30 years. The categories being evaluated regard teleoperated, distributed, surveillance, and law-enforcement robot architectures. In the survey, an attempt is made to explain the importance of intelligent methodologies, and their emergent effects in security tasks. The major findings of this analysis illustrate the minor contribution of intelligent architectures in crime-fighting robots, and what constitutes an intelligent security robot.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392475]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1219</startPage>
			<endPage>1230</endPage>
			<fileSize>605</fileSize>
			<authors><![CDATA[Theodoridis, T.;Huosheng Hu;]]></authors>
		</item>
		<item>
			<title><![CDATA[Problem-Solving Variability in Cognitive Architectures]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6332536]]></link>
			<description><![CDATA[Cognitive architectures provide a promising means to model human behavior in complex systems and problem domains. The fields of social simulation and cognitive architectures can be linked more effectively if cognitive variability can be modeled in a realistic way. In particular, if individual differences in the ways humans solve problems can be captured in computational models, the dynamic patterns of change and diversity in human systems can be explored in greater depth. Kirton's Adaption-Innovation theory provides a robust foundation for the study of creativity, problem solving, and decision making based on individual differences in cognitive level (capacity) and cognitive style (preferred approach) of problem solving. This paper examines four well-known cognitive architectures (SOAR, ACT-R, CLARION, and DUAL) in light of Adaption-Innovation theory to explore if and how cognitive style and level variables are manifested within them. This analysis leads to a proposed cognitive style continuum for cognitive architectures, as well as other possible architectural mechanisms to incorporate problem-solving variability.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6332536]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1231</startPage>
			<endPage>1242</endPage>
			<fileSize>497</fileSize>
			<authors><![CDATA[Kilicay-Ergin, N.H.;Jablokow, K.W.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Wireless Sensor Network Reliability and Security in Factory Automation: A Survey]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392470]]></link>
			<description><![CDATA[Industries can benefit a lot from integrating sensors in industrial plants, structures, machinery, shop floors, and other critical places and utilizing their sensing and monitoring power, communicating and processing abilities to deliver sensed information. Proper use of wireless sensor networks (WSNs) can lower the rate of catastrophic failures, and improve the efficiency and productivity of factory operations. Ensuring reliability and providing adequate security in these crucial services provided by WSNs will reinforce their acceptability as a viable and dependable technology in the factory and industrial domain. In this paper, we examine the reliability and security challenges of WSNs and survey their practicality for industrial adoption. We discuss the unique characteristics that distinguish the factory environment from the rest, elaborate on security and reliability issues with their respective solution measures, and analyze the existing WSN architectures and standards. A number of challenges and interesting research issues have emerged from this study and have been reported for further investigation.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392470]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1243</startPage>
			<endPage>1256</endPage>
			<fileSize>307</fileSize>
			<authors><![CDATA[Islam, K.;Weiming Shen;Xianbin Wang;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Review of Anomaly Detection in Automated Surveillance]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392472]]></link>
			<description><![CDATA[As surveillance becomes ubiquitous, the amount of data to be processed grows along with the demand for manpower to interpret the data. A key goal of surveillance is to detect behaviors that can be considered anomalous. As a result, an extensive body of research in automated surveillance has been developed, often with the goal of automatic detection of anomalies. Research into anomaly detection in automated surveillance covers a wide range of domains, employing a vast array of techniques. This review presents an overview of recent research approaches on the topic of anomaly detection in automated surveillance. The reviewed studies are analyzed across five aspects: surveillance target, anomaly definitions and assumptions, types of sensors used and the feature extraction processes, learning methods, and modeling algorithms.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392472]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1257</startPage>
			<endPage>1272</endPage>
			<fileSize>615</fileSize>
			<authors><![CDATA[Sodemann, A.A.;Ross, M.P.;Borghetti, B.J.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Nature-Inspired Techniques in the Context of Fraud Detection]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392447]]></link>
			<description><![CDATA[Electronic fraud is highly lucrative, with estimates suggesting these crimes to be worth millions of dollars annually. Because of its complex nature, electronic fraud detection is typically impractical to solve without automation. However, the creation of automated systems to detect fraud is very difficult as adversaries readily adapt and change their fraudulent activities which are often lost in the magnitude of legitimate transactions. This study reviews the most popular types of electronic fraud and the existing nature-inspired detection methods that are used for them. The common characteristics of electronic fraud are examined in detail along with the difficulties and challenges that these present to computational intelligence systems. Finally, open questions and opportunities for further work, including a discussion of emerging types of electronic fraud, are presented to provide a context for ongoing research.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392447]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1273</startPage>
			<endPage>1290</endPage>
			<fileSize>386</fileSize>
			<authors><![CDATA[Behdad, M.;Barone, L.;Bennamoun, M.;French, T.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Survey of Actor-Critic Reinforcement Learning: Standard and Natural Policy Gradients]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392457]]></link>
			<description><![CDATA[Policy-gradient-based actor-critic algorithms are amongst the most popular algorithms in the reinforcement learning framework. Their advantage of being able to search for optimal policies using low-variance gradient estimates has made them useful in several real-life applications, such as robotics, power control, and finance. Although general surveys on reinforcement learning techniques already exist, no survey is specifically dedicated to actor-critic algorithms in particular. This paper, therefore, describes the state of the art of actor-critic algorithms, with a focus on methods that can work in an online setting and use function approximation in order to deal with continuous state and action spaces. After starting with a discussion on the concepts of reinforcement learning and the origins of actor-critic algorithms, this paper describes the workings of the natural gradient, which has made its way into many actor-critic algorithms over the past few years. A review of several standard and natural actor-critic algorithms is given, and the paper concludes with an overview of application areas and a discussion on open issues.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392457]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1291</startPage>
			<endPage>1307</endPage>
			<fileSize>955</fileSize>
			<authors><![CDATA[Grondman, I.;Busoniu, L.;Lopes, G.A.D.;Babuska, R.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Gear Fault Location Detection for Split Torque Gearbox Using AE Sensors]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6153079]]></link>
			<description><![CDATA[In comparison with a traditional planetary gearbox, the split torque gearbox (STG) potentially offers lower weight, increased reliability, and improved efficiency. These benefits have driven helicopter object exchange models (OEMs) to develop products using STG. However, the unique structure of the STG creates a problem on how to locate the gear faults in an STG. As of today, only limited research on STG fault detection using vibration and acoustic emission (AE) sensors has been conducted. In this paper, an effective gear fault location detection methodology using AE sensors for STG is presented. The methodology uses wavelet transform to process AE sensor signals at different locations to determine the arrival time of the AE bursts. By analyzing the arrival time of the AE bursts, the gear fault location can be determined. The parameters of the wavelets are optimized by using an ant colony optimization algorithm. Real seeded gear fault experimental tests on a notional STG are conducted. AE signals at different locations of the gearbox with both healthy and damaged output driving gears are collected simultaneously to determine the location of the damaged gear. Experimental results have shown the effectiveness of the presented methodology.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6153079]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1308</startPage>
			<endPage>1317</endPage>
			<fileSize>1090</fileSize>
			<authors><![CDATA[Ruoyu Li;Seckiner, S.U.;He, D.;Bechhoefer, E.;Menon, P.;]]></authors>
		</item>
		<item>
			<title><![CDATA[T-Hive: Bilateral Haptic Interface Using Vibrotactile Cues for Presenting Spatial Information]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6171872]]></link>
			<description><![CDATA[The primary purpose of this research is to determine which is more effective, kinesthetic or vibrotactile cues, when presenting spatial information with haptic devices. Recent studies have explored the use of tactile cues; however, they were confined to a unilateral display device. Although many kinesthetic bilateral haptic devices have been developed to provide force feedback on an input handle, a vibrotactile stimulus has not been utilized when presenting directional information on the input handle. This paper attempts to adopt vibrotactile cues to design a bilateral device. In addition, a new six degrees of freedom bilateral haptic device, which provides a spatial sensation on the handle, is proposed. The sphere-shaped handle is, especially, designed to be covered by several vibrating panels. When a specific panel is activated, the user perceives the spatial location of the vibrotactile stimulus from that panel during the input operation. Control schemes that are based on the phantom sensation, one of haptic illusory phenomena, are proposed to achieve fine resolution with a limited number of tactors. Two experiments were conducted, in an effort to compare performance between a kinesthetic and a vibrotactile haptic device. The results showed that the vibrotactile cue provides a better method of perceiving the directional information as compared with kinesthetic feedback.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6171872]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1318</startPage>
			<endPage>1325</endPage>
			<fileSize>723</fileSize>
			<authors><![CDATA[Dongseok Ryu;Gi-Hun Yang;Sungchul Kang;]]></authors>
		</item>
		<item>
			<title><![CDATA[A New Inequality-Based Obstacle-Avoidance MVN Scheme and Its Application to Redundant Robot Manipulators]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6156798]]></link>
			<description><![CDATA[This paper proposes a new inequality-based criterion/constraint with its algorithmic and computational details for obstacle avoidance of redundant robot manipulators. By incorporating such a dynamically updated inequality constraint and the joint physical constraints (such as joint-angle limits and joint-velocity limits), a novel minimum-velocity-norm (MVN) scheme is presented and investigated for robotic redundancy resolution. The resultant obstacle-avoidance MVN scheme resolved at the joint-velocity level is further reformulated as a general quadratic program (QP). Two QP solvers, i.e., a simplified primal-dual neural network based on linear variational inequalities (LVI) and an LVI-based numerical algorithm, are developed and applied for online solution of the QP problem as well as the inequality-based obstacle-avoidance MVN scheme. Simulative results that are based on PA10 robot manipulator and a six-link planar robot manipulator in the presence of window-shaped and point obstacles demonstrate the efficacy and superiority of the proposed obstacle-avoidance MVN scheme. Moreover, experimental results of the proposed MVN scheme implemented on the practical six-link planar robot manipulator substantiate the physical realizability and effectiveness of such a scheme for obstacle avoidance of redundant robot manipulator.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6156798]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1326</startPage>
			<endPage>1340</endPage>
			<fileSize>1504</fileSize>
			<authors><![CDATA[Dongsheng Guo;Yunong Zhang;]]></authors>
		</item>
		<item>
			<title><![CDATA[Unsupervised Locating of WiFi Access Points Using Smartphones]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6168850]]></link>
			<description><![CDATA[WiFi positioning systems require radio maps in the form of either RF fingerprints or positions of WiFi access points (APs). In particular, knowledge of the AP positions is essential to enable a locating mechanism as well as to understand the nature of underlying WiFi networks, such as density, connectivity, interference characteristics, and so on. In this paper, we propose an approach called Serendipity, which locates WiFi APs in an unsupervised manner using radio scans collected by ordinary smartphone users. From the radio scans, we extract dissimilarities between all pairs of WiFi APs and estimate relative positions of APs by analyzing the dissimilarities based on a multidimensional scaling technique. We then find the absolute positions with additional radio scans whose positions are known. The discovered positions of WiFi APs are used for the positioning of smartphones or the management of the WiFi networks. To validate the proposed approach, we conducted experiments on several indoor locations.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6168850]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1341</startPage>
			<endPage>1353</endPage>
			<fileSize>849</fileSize>
			<authors><![CDATA[Jahyoung Koo;Hojung Cha;]]></authors>
		</item>
		<item>
			<title><![CDATA[Revealing miRNA Regulation and miRNA Target Prediction Using Constraint-Based Learning]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6193226]]></link>
			<description><![CDATA[The past decades have witnessed advances in genomic technology; and this has allowed laboratories to generate vast amount of biological data, including microarray gene expression data. Effective analysis of the data helps in better understanding the mechanisms behind the complex behavior of the cell. Actually, a huge body of research focuses on the role of gene regulatory networks (GRNs) in controlling the cell. However, studying the heterogeneous interactions between mRNA and miRNA has received less attention. Fortunately, revealing the targets of miRNAs started to gain some consideration from the research community. Further, integrating mRNA gene expression and miRNA expression data is receiving more attention; the target is to understand the role of miRNA in regulating mRNA in different cell contexts; this could lead to predicting miRNA targets and constructing miRNA-mRNA interaction networks. On the other hand, we have already demonstrated the power of constraint-based learning as a promising technique to learn the structure of GRN , which are homogeneous in the sense that they contain one type of nodes, namely, genes. In this study, we extend our previous work to show how constraint-based learning can be effectively applied to tackle a more challenging problem, namely, to learn the structure of heterogeneous networks, like mRNA-miRNA network. In other words, to build the whole picture of the heterogeneous interactions, we used constraint-based learning algorithms which usually perform well on sparse graphs to predict the interactions within heterogeneous networks, namely, miRNA-mRNA interactions. We are able to achieve this by extending our PCPDPr algorithm, which works on homogeneous networks. The extended version named htrPCPDPr is capable of handling networks connecting two heterogeneous sets of nodes into a bipartite graph. This way, we propose a new learning mechanism to predict miRNA targets from expression profiles of both mRNA and miRNA, in addition to-
sequence-based prior knowledge about the interactions. The method has been applied to different set of genes related to the Alzheimer disease; the results reported in this paper demonstrate the novelty, applicability, and effectiveness of the proposed approach.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6193226]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1354</startPage>
			<endPage>1364</endPage>
			<fileSize>548</fileSize>
			<authors><![CDATA[Alshalalfa, M.;Tan, M.;Naji, G.;Alhajj, R.;Polat, F.;Rokne, J.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Enhancing Interaction Design on the Semantic Web: A Case Study]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6168852]]></link>
			<description><![CDATA[The use of resource description framework-based ontologies as knowledge repositories has become increasingly popular over the past few years. The semantic web has rapidly spread, appearing as a new challenge for knowledge sharing and automatic processing. However, the reality is that the power of the semantic web is still barely used. This is mostly because of the fact that the semantic web is a powerful but complex technology that most end users cannot afford to use for their common problem-solving activities. This has probably made the semantic web to stay in the background of interactive technologies, unlike other new end-user-oriented paradigms (e.g., the so-called Web 2.0 and later approaches) that have very much increased along these years. Nevertheless, the semantic web can be considered as a highly valuable paradigm that has not been, conveniently, exploited yet. In this paper, we propose a semantic environment to exploit semantic interaction by end users in order to help them access semantic information easily. We follow a programming by demonstration approach, where the user navigates and modifies HTML presentation of data and the system, automatically, infers changes to the underlying semantic models. Furthermore, we provide an evaluation of the interaction, including the most important results obtained for the proposed approach.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6168852]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1365</startPage>
			<endPage>1373</endPage>
			<fileSize>950</fileSize>
			<authors><![CDATA[Maci&#x0301;as, J.A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Optimal Sensor Placement for a Constellation of Multistatic Narrowband Pixelated Sensors]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6171870]]></link>
			<description><![CDATA[This paper presents a novel approach to selecting the location of a constellation of multistatic RF sensors to optimize system detection and tracking. The method works by computing the posterior Crame&#x0301;r-Rao lower bound on localization error as a function of sensor positions, and then selecting sensor locations to minimize the bound. One important contribution of this study is the derivation of the bound for a non-Gaussian, nonlinear pixelated sensor model which includes transmit and receive beam patterns, direct path energy, and target impulse response. A second contribution is a report on the results of two field collections which illustrate the efficacy of the method.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6171870]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1374</startPage>
			<endPage>1383</endPage>
			<fileSize>709</fileSize>
			<authors><![CDATA[Kreucher, C.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Verification and Validation of Hierarchical Fault Diagnosis in Satellites Formation Flight]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6171869]]></link>
			<description><![CDATA[It is well known that for long-duration space missions, there is growing need for efficient utilization of telemetry data to enhance diagnostic performance and assist the less-experienced personnel in performing monitoring and diagnosis tasks. To address this need, we have, recently, developed a systematic and transparent fault diagnosis methodology within a hierarchical fault diagnosis framework for satellites formation flight. We developed our proposed hierarchical decomposition framework through a novel Bayesian network-based model, namely component dependence model (CDM). In this paper, we investigate the verification and validation of the CDM for fault diagnosis in satellites formation flight. We propose and develop a sensitivity analysis to verify the CDM by taking advantage of our systematic CDM development methodology. The proposed verification method satisfies the unique requirement of identifying CDM sensitivity when diagnostic performances of the algorithms that are deployed at one or more nodes of the CDM change. This implies that our verification approach and analysis are different from traditional sensitivity analysis that uses proportional scaling which is not applicable to the CDM methodology. Furthermore, in such analysis, a change in the model parameters under consideration is, typically, due to a change in the subjective judgment of an expert whose opinion is used in model development as opposed to the changes due to diagnostic performance variations. We demonstrate the proposed verification approach by using synthetic formation flight data, and show that our CDM development method does not lead to a fault diagnosis model that is sensitive to small variation in its parameters.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6171869]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1384</startPage>
			<endPage>1399</endPage>
			<fileSize>938</fileSize>
			<authors><![CDATA[Barua, A.;Khorasani, K.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Impedance Control for Legged Robots: An Insight Into the Concepts Involved]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6171868]]></link>
			<description><![CDATA[The application of impedance control strategies to modern legged locomotion is analyzed, paying special attention to the concepts behind its implementation which is not straightforward. In order to implement a functional impedance controller for a walking mechanism, the concepts of contact, impact, friction, and impedance have to be merged together. A literature review and a comprehensive analysis are presented compiling all these concepts along with a discussion on position-based versus force-based impedance control approaches, and a theoretical model of a robotic leg in contact with its environment is introduced. A theoretical control scheme for the legs of a general legged robot is also introduced, and some simulations results are presented.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6171868]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1400</startPage>
			<endPage>1411</endPage>
			<fileSize>691</fileSize>
			<authors><![CDATA[Arevalo, J.C.;Garcia, E.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Chaotic Oscillatory-Based Neural Network for Wind Shear and Turbulence Forecast With LiDAR Data]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6177684]]></link>
			<description><![CDATA[This paper focuses on the forecast of wind shear and turbulence at the Hong Kong International Airport. It presents a mesoscale prediction model that uses chaotic oscillatory-based neural networks (CONN) to forecast the evolution of wind fields along the glide path in the vicinity of the airport. This model makes use of accurate Doppler velocities measured by light detection and ranging (LiDAR) system and afterward collected by the Hong Kong Observatory. Simulation results show that the CONN model with a new learning algorithm is able to capture the occurrence, evolution, and sudden changes of the winds representing turbulence incidences in the region. Research findings show that Doppler velocities forecast using CONN can be transformed into headwind profiles and processed with the developed algorithm to identify the wind shear occurrence. These are shown to match actual observations made using LiDAR in terms of time, locations, and size of wind shear events with considerable accuracy. The model has better performance compared with that of the traditional multilayered perceptron model neural network. The results encourage further exploration and experimentation in the use of machine learning and chaotic neural network in weather forecast and alerting.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6177684]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1412</startPage>
			<endPage>1423</endPage>
			<fileSize>1353</fileSize>
			<authors><![CDATA[Liu, J.N.K.;Kwong, K.M.;Chan, P.W.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Supply Chain Coordination Using an Adaptive Distributed Search Strategy]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6212387]]></link>
			<description><![CDATA[A tree search strategy is said to be adaptive when it dynamically identifies which areas of the tree are likely to contain good solutions, using information that is gathered during the search process. This study shows how an adaptive approach can be used to enhance the efficiency of the coordination process of an industrial supply chain. The result is a new adaptive method (called the adaptive discrepancy search), intended for search in nonbinary trees, and that is exploitable in a distributed optimization context. For the industrial case studied (a supply chain in the forest products industry), this allowed reducing nearly half the time needed to obtain the best solution in comparison with a standard nonadaptive method. The method has also been evaluated for use with synthesized problems in order to validate the results that are obtained and to illustrate different properties of the algorithm.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6212387]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1424</startPage>
			<endPage>1438</endPage>
			<fileSize>1155</fileSize>
			<authors><![CDATA[Gaudreault, J.;Pesant, G.;Frayret, J.;D'Amours, S.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Model-Driven Development of Reconfigurable Protocol Stack for Networked Control Systems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6193227]]></link>
			<description><![CDATA[In networked control systems (NCS), the performance degradation introduced by the heterogeneous and dynamic environment has intensified the need for reconfigurable protocol stacks (RPS). In this paper, an IEC61499-based method is proposed for the model-driven development of RPS. The method is enabled by defining a novel RPS function block (FB), which unifies the communication behavior and interface of nodes in NCS. Beyond existing communication FBs in IEC61499, the parameter reconfiguration of routing and scheduling table in RPS FB is highlighted as the core of communication layer function to adapt environment and system variations. Furthermore, the method allows for the code reconfiguration on Java algorithms in RPS FB under different application requirements. Through porting the Java virtual machine on different platforms, the code reconfiguration is implemented by reloading the .class file for a specified protocol FB. A case study on the embedded platform, such as DSP/BIOS and ARM/Linux, is conducted to demonstrate the effectiveness and feasibility of the proposed reconfiguration method for maintaining stable and predictable behavior in NCS.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6193227]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1439</startPage>
			<endPage>1453</endPage>
			<fileSize>1979</fileSize>
			<authors><![CDATA[Chunjie Zhou;Hui Chen;Naixue Xiong;Xiongfeng Huang;Vasilakos, A.V.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Uncertainty Propagation in Quantitative Risk Assessment Modeling for Fire in Road Tunnels]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6190763]]></link>
			<description><![CDATA[Road tunnels are critical transportation infrastructures that provide underground passageways for motorists and commuters. Fire in road tunnels in combination with tunnel safety provisions failure may lead to catastrophic consequences, and thus, necessitates a robust and reliable approach to assess tunnel risks. This article proposes a quantitative risk assessment model for fire in road tunnel by taking into consideration two types of uncertainties. A Monte Carlo-based estimation method is developed to propagate parameter uncertainty in quantitative risk assessment model consisting of event tree analysis as well as consequence estimation models. The percentile-based individual risks and &#x03B1;-cut-based societal risks are put up and the risk indices are proven to be very useful for tunnel operators with distinct risk attitudes to assess the safety level of a road tunnel. Finally, the proposed research methodology is applied to Singapore KPE road tunnels.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6190763]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1454</startPage>
			<endPage>1464</endPage>
			<fileSize>771</fileSize>
			<authors><![CDATA[Qiang Meng;Xiaobo Qu;]]></authors>
		</item>
		<item>
			<title><![CDATA[Synthesizing Globally Asynchronous Locally Synchronous Systems With IEC 61499]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6198367]]></link>
			<description><![CDATA[The IEC 61499 standard defines a generic architecture for designing distributed industrial control systems based on function blocks. The standard, however, lacks a formal model of computation to describe the behavior of function block compositions. While various models have been prescribed in the literature to define the composite behavior on a single computational node, few have been proposed to directly address compositions in a distributed setting. This paper proposes a globally asynchronous locally synchronous (GALS) model for distributed function block systems. The model provides an abstract way to view communication between function blocks without implying yet any particular implementation. This abstraction can then be subsequently refined to obtain various implementations with different tradeoffs. We do so using an approach that is fully compatible with the standard's notion of communication function blocks, which abstract underlying communication mechanisms from the application. As a contribution, we have developed a compiler that automatically synthesizes separate programs for a given distributed function block system without needing any additional middleware or run-time environment to execute the resulting distributed code. The efficacy of the proposed approach is demonstrated through an industrial case study.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6198367]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1465</startPage>
			<endPage>1477</endPage>
			<fileSize>927</fileSize>
			<authors><![CDATA[Li Hsien Yoong;Shaw, G.D.;Roop, P.S.;Salcic, Z.;]]></authors>
		</item>
		<item>
			<title><![CDATA[K-Complex Detection Using a Hybrid-Synergic Machine Learning Method]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6190762]]></link>
			<description><![CDATA[Sleep stage identification is the first step in modern sleep disorder diagnostics process. K-complex is an indicator for the sleep stage 2. However, due to the ambiguity of the translation of the medical standards into a computer-based procedure, reliability of automated K-complex detection from the EEG wave is still far from expectation. More specifically, there are some significant barriers to the research of automatic K-complex detection. First, there is no adequate description of K-complex that makes it difficult to develop automatic detection algorithm. Second, human experts only provided the label for whether a whole EEG segment contains K-complex or not, rather than individual labels for each subsegment. These barriers render most pattern recognition algorithms inapplicable in detecting K-complex. In this paper, we attempt to address these two challenges, by designing a new feature extraction method that can transform visual features of the EEG wave with any length into mathematical representation and proposing a hybrid-synergic machine learning method to build a K-complex classifier. The tenfold cross-validation results indicate that both the accuracy and the precision of this proposed model are at least as good as a human expert in K-complex detection.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6190762]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1478</startPage>
			<endPage>1490</endPage>
			<fileSize>822</fileSize>
			<authors><![CDATA[Huy Quan Vu;Gang Li;Sukhorukova, N.S.;Beliakov, G.;Shaowu Liu;Philippe, C.;Amiel, H.;Ugon, A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Principal Line-Based Alignment Refinement for Palmprint Recognition]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6203425]]></link>
			<description><![CDATA[Image alignment is an important step in various biometric authentication applications such as palmprint recognition. Most of the existing palmprint alignment methods make use of some key points between fingers or in palm boundary to establish the local coordinate system for region of interest (ROI) extraction. The ROI is consequently used for feature extraction and matching. Such alignment methods usually yield a coarse alignment of the palmprint images, while many missed and false matches are actually caused by inaccurate image alignments. To improve the palmprint verification accuracy, in this paper, we present an efficient palmprint alignment refinement method. After extracting the principal lines from the palmprint image, we apply the iterative closest point method to them to estimate the translation and rotation parameters between two images. The estimated parameters are then used to refine the alignment of palmprint feature maps for a more accurate palmprint matching. The experimental results show that the proposed method greatly improves the palmprint recognition accuracy and it works in real time.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6203425]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1491</startPage>
			<endPage>1499</endPage>
			<fileSize>1033</fileSize>
			<authors><![CDATA[Wei Li;Zhang, B.;Lei Zhang;Jingqi Yan;]]></authors>
		</item>
		<item>
			<title><![CDATA[A New Feature Selection Method for One-Class Classification Problems]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392459]]></link>
			<description><![CDATA[Feature selection is a data processing method that is used to select a few important features among many input features and to remove any irrelevant one. Although feature selection in classification problems has been the focus of much research, few feature selection methods are available for use in one-class classification problems (i.e., anomaly detection). In particular, existing feature selection methods cannot be applied for the feature selection of the one-class classification problem when there are no available observations for the anomaly (or the second class). In this study, we propose two support vector data description (SVDD)-based feature selection methods: SVDD-radius-recursive feature elimination (RFE) and SVDD dual-objective RFE. The SVDD-radius-RFE method can be used to minimize the size of the boundary of describing normal observations measured through the value of its radius squared and the SVDD-dual-objective-RFE method can be applied to obtain a compact description in the dual space of SVDD. Experimental results using both simulated and real-life datasets demonstrate that the proposed methods show the improved performance compared with existing support vector machine RFE methods even for the classification problems when available observations for the anomaly are few.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392459]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1500</startPage>
			<endPage>1509</endPage>
			<fileSize>1286</fileSize>
			<authors><![CDATA[Young-Seon Jeong;In-Ho Kang;Myong-Kee Jeong;Dongjoon Kong;]]></authors>
		</item>
		<item>
			<title><![CDATA[Cooperative Search Using Agents for Cardinality Constrained Portfolio Selection Problem]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6211438]]></link>
			<description><![CDATA[This paper presents an agent-based model to select an investment portfolio with a restriction on the number of stocks in it. Daily movements of all the stocks in the market for the past few years are assumed to be available. The scheme deploys a federally structured consortium of agents in the stock market at the start of the historical period. Each agent starts with a pseudorandom portfolio and follows individual investment strategies as it walks through the past data. The agents are designed to emulate some of the characteristics of human investors-adjusting the weights of the stocks based on its own attitude toward risk, occasionally dropping and adding stocks to the portfolio, etc. Periodically, the agents share information about their performances and can switch portfolios. A final cardinality constrained portfolio is constructed by consolidating individual portfolios arrived at by the agents working on the historical data of the stocks. When tested in real markets of the U.K. and Japan, the model suggested portfolios that were quite competitive to, and frequently better than, the portfolios suggested by the mean-variance models.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6211438]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1510</startPage>
			<endPage>1518</endPage>
			<fileSize>723</fileSize>
			<authors><![CDATA[Kumar, R.;Bhattacharya, S.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Fuzzy Goal Programming Approach for Optimal Product Family Design of Mobile Phones and Multiple-Platform Architecture]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6204352]]></link>
			<description><![CDATA[Competitiveness of any manufacturing industry depends on its ability to respond quickly to market niches and to produce a variety of high-utility products at relatively low costs. The promising tool to achieve aforesaid goals is the development of an efficient product family design strategy. The collection of shared components across the product family is termed as a platform that allows the saving in additional cost. Unfortunately, a single platform is advantageous only up to a certain extent; firms have sensed the requirement of multiple platforms. In this context, this paper deals with the exploration of product family design and multiple-platform architecture with a view to maximize the overall utility and to minimize the total production cost. This multiobjective problem has two conflicting and incommensurate objectives; therefore, a fuzzy goal programming model is adopted for modeling. The adoption of fuzzy goal programming model aids in combining the two objectives as well as captures the inherent uncertainty involved in decision making. The problem is formulated as a mixed integer program, and, additionally, random search optimization techniques, namely, genetic algorithm, simulated annealing, and Tabu search are being used to resolve the underlying issues. Moreover, in order to illustrate the proposed framework, a hypothetical case study-a family of mobile phones-is considered. Extensive experiments are performed on the underlying case study, and computational results are reported to validate the efficacy of multiple platforms over the single platform.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6204352]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1519</startPage>
			<endPage>1530</endPage>
			<fileSize>1113</fileSize>
			<authors><![CDATA[Tyagi, S.;Kai Yang;Tyagi, A.;Verma, A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Visual Detection System for Rail Surface Defects]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6208896]]></link>
			<description><![CDATA[Discrete surface defects are the most common anomalies of rails and they should be carefully inspected. However, it is a challenge to detect such defects in a vision system because of illumination inequality and the variation of reflection property of rail surfaces. This paper presents an intelligent vision detection system (VDS) for discrete surface defects and focuses on two key issues of VDS: image enhancement and automatic thresholding. We propose the local Michelson-like contrast (MLC) measure to enhance rail images. MLC-based method is nonlinear and illumination independent; therefore, it notably improves the distinction between defects and background. In addition, we put forward the new automatic thresholding method-proportion emphasized maximum entropy (PEME) thresholding algorithm. PEME selects a threshold that maximizes the object entropy and meanwhile keeps the defect proportion in a low level. Our experimental results demonstrate that VDS detects the Type-II defects with a recall of 91.61% and Type-I defects with a recall of 88.53%, and the proposed MLC-based image enhancement method and PEME thresholding algorithm outperform the related well-established approaches.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6208896]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1531</startPage>
			<endPage>1542</endPage>
			<fileSize>1334</fileSize>
			<authors><![CDATA[Qingyong Li;Shengwei Ren;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Path-Planning Method for Human-Tracking Agents Based on Long-Term Prediction]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392474]]></link>
			<description><![CDATA[This paper deals with a multiagent path-planning problem where several robots track humans to obtain detailed information on human behaviors and characteristics. For this, agents' paths are planned on the basis of the similarity between the predicted positions of humans and the agents' field of view. The long-horizon path planned on the basis of an accurate long-horizon prediction improves the tracking performance. However, it requires heavy computation and is less useful if the prediction is inaccurate. Since the accuracy of the prediction depends on the situation, the prediction term is determined by the similarity between the current and previous predictions. The results of computer simulation showed that our path-planning method works well for trajectories of humans in a dynamic environment by changing the horizon length of the path planning.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392474]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1543</startPage>
			<endPage>1554</endPage>
			<fileSize>2172</fileSize>
			<authors><![CDATA[Takemura, N.;Nakamura, Y.;Matsumoto, Y.;Ishiguro, H.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Collaborative Strategies for the Search of 3-D Targets in Molecular Environments]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392445]]></link>
			<description><![CDATA[Collaborative virtual environments introduce new working methods allowing for the association of several experts in the same problem-solving process. These new platforms have the potential to improve the processing of complex environments with large amounts of data and require different skills. This paper proposes the study of a synchronous and colocated approach for molecular design tasks. More precisely, this study focuses on the collaborative search of targets during the molecular deformation process. The aim of this paper is to highlight the different working strategies that emerge according to different tasks and humans factors. Based on these working strategies, we propose to investigate the contribution of collaborative configurations of work according to different efficiency criteria such as the completion time, verbal communication, and manipulation distance. Finally, this study will highlight some issues related to conflict of actions, concurrent access, awareness, and communication processes.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392445]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1555</startPage>
			<endPage>1565</endPage>
			<fileSize>1176</fileSize>
			<authors><![CDATA[Simard, J.;Ammi, M.;Auvray, M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Employing Structural and Textual Feature Extraction for Semistructured Document Classification]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392444]]></link>
			<description><![CDATA[This paper addresses XML document classification by considering both structural and content-based features of the documents. This approach leads to better constructing a set of informative feature vectors that represents both structural and textual aspects of XML documents. For this purpose, we integrate soft clustering of words and feature reduction into the process. To extract structural information, we employ an existing frequent tree-mining algorithm combined with an information gain filter to retrieve the most informative substructures from XML documents. However, for extracting content information, we propose soft clustering of words using each cluster as a textual feature. We have conducted extensive experiments on a benchmark dataset, namely 20NewsGroups, and an XML documents dataset given in LOGML that describes the web-server logs of user sessions. With regards to the classifier built only using our textual features, the results show that it outperforms a naive support-vector-machine (SVM)-based classifier, as well as an information retrieval classifier (IRC). We further demonstrate the effectiveness of incorporating both structural and content information into the process of learning, by comparing our classifier model and several XML document classifiers. In particular, by applying SVM and decision tree algorithms using our feature vector representation of XML documents dataset, we have achieved 85.79% and 87.04% classification accuracy, respectively, which are higher than accuracy achieved by XRules, a well-known structural-based XML document classifier.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392444]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1566</startPage>
			<endPage>1578</endPage>
			<fileSize>993</fileSize>
			<authors><![CDATA[Khabbaz, M.;Kianmehr, K.;Alhajj, R.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Dynamical System Theory for the Detection of Anomalous Behavior in Computer Programs]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392448]]></link>
			<description><![CDATA[Code injection is a common approach which is utilized to exploit applications. We introduce some of the well-established techniques and formalisms of dynamical system theory into analysis of program behavior via system calls to detect code injections into an applications execution space. We accept a program as a blackbox dynamical system whose internals are not known, but whose output we can observe. The blackbox system observable in our model is the system calls the program makes. The collected system calls are treated as signals which are used to reconstruct the system's phase space. Then, by using the well-established techniques from dynamical system theory, we quantify the amount of complexity of the system's (program's) behavior. The change in the behavior of a compromised system is detected as anomalous behavior compared with the baseline established from a clean program. We test the proposed approach against DARPA-98 dataset and a real-world exploit and present code injection experiments to show the applicability of our approach.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392448]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1579</startPage>
			<endPage>1589</endPage>
			<fileSize>690</fileSize>
			<authors><![CDATA[Kanaskar, N.;Seker, R.;Jiang Bian;Phoha, V.V.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Feature Selection and Clustering of Gene Expression Profiles Using Biological Knowledge]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392465]]></link>
			<description><![CDATA[In this paper, a novel feature selection algorithm, which is governed by biological knowledge, is developed. Gene expression data being high dimensional and redundant, dimensionality reduction is of prime concern. We employ the algorithm clustering large applications based on RAN-domized search (CLARANS) for attribute clustering and dimensionality reduction based on gene ontology (GO) study. Feature selection with unsupervised learning is a difficult problem, with neither class labels present nor any guidance available to the search. Determination of the optimal number of clusters is another major issue, and has an impact on the resulting output. The use of GO analysis helps in the automated selection of biologically meaningful partitions. Tools such as Eisen plot and cluster profiles of these clusters help establish their coherence. Important representative features (or genes) are extracted from each correlated set of genes in such partitions. The algorithm is implemented on high-dimensional Yeast cell-cycle, Human Multiple Tissues, and Leukemia microarray data. In the second pass, clustering on the reduced gene space validates preservation of the inherent behavior of the original high-dimensional expression profiles. While the reduced gene set forms a biologically meaningful gene space, it simultaneously leads to a decrease in computational burden. External validation of the reduced subspace, using various well-known classifiers, establishes the effectiveness of the proposed methodology.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392465]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1590</startPage>
			<endPage>1599</endPage>
			<fileSize>748</fileSize>
			<authors><![CDATA[Mitra, S.;Ghosh, S.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Dealing With Uncertain Entities in Ontology Alignment Using Rough Sets]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392460]]></link>
			<description><![CDATA[Ontology alignment facilitates exchange of knowledge among heterogeneous data sources. Many approaches to ontology alignment use multiple similarity measures to map entities between ontologies. However, it remains a key challenge in dealing with uncertain entities for which the employed ontology alignment measures produce conflicting results on similarity of the mapped entities. This paper presents OARS, a rough-set based approach to ontology alignment which achieves a high degree of accuracy in situations where uncertainty arises because of the conflicting results generated by different similarity measures. OARS employs a combinational approach and considers both lexical and structural similarity measures. OARS is extensively evaluated with the benchmark ontologies of the ontology alignment evaluation initiative (OAEI) 2010, and performs best in the aspect of recall in comparison with a number of alignment systems while generating a comparable performance in precision.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392460]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1600</startPage>
			<endPage>1612</endPage>
			<fileSize>1097</fileSize>
			<authors><![CDATA[Jan, S.;Maozhen Li;Al-Raweshidy, H.;Mousavi, A.;Man Qi;]]></authors>
		</item>
		<item>
			<title><![CDATA[Adaptive-Differential-Evolution-Based Design of Two-Channel Quadrature Mirror Filter Banks for Sub-Band Coding and Data Transmission]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392451]]></link>
			<description><![CDATA[This paper proposes an improved and adaptive variant of the differential evolution algorithm for the design of two-channel quadrature mirror filters with linear phase characteristics. To match the ideal system response characteristics, the algorithm is employed to optimize the values of the filter bank coefficients. The filter response is optimized in both passband and stopband. The overall filter bank response aims at minimizing objectives like reconstruction error, mean square error in passband, and mean square error in stopband. Effective designing can be achieved by efficiently minimizing the objective function. The proposed algorithm is able to perform better than the other existing design methods. Five different design examples are presented to validate the effectiveness of the proposed approach over other conventional design techniques, as well as state-of-the-art evolutionary algorithms found in the literature.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392451]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1613</startPage>
			<endPage>1623</endPage>
			<fileSize>668</fileSize>
			<authors><![CDATA[Ghosh, P.;Das, S.;Zafar, H.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Fuzzy Control for Electric Power-Assisted Wheelchair Driving on Disturbance Roads]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392469]]></link>
			<description><![CDATA[This paper describes a driving control scheme of electric power-assisted wheelchairs for assistive driving on various large disturbance roads. The &#x201C;power-assisted wheelchair&#x201D; that assists the driving force by electric motors is expected to be widely used as a mobility support system for elderly people and disabled people; however, there are lots of large disturbance roads such as uphill roads and rough roads and operators need to push hand-rims with larger power load in order to obtain enough driving distance and velocity. For example, wheelchairs might move backward on uphill roads due to the driving torque shortage. Therefore, this study proposes a fuzzy-algorithm-based torque control scheme in order to realize the assistive driving on large disturbance roads. The proposed fuzzy controller has a simple structure because high-performance CPUs and controllers are difficult to be carried on practical wheelchairs. The assisted torque after the operator releases hand-rims will be adjusted so that the enough velocity is kept even on large disturbance roads. Driving experimental results and evaluation results are provided to verify the effectiveness of the proposed control system.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392469]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1624</startPage>
			<endPage>1632</endPage>
			<fileSize>2228</fileSize>
			<authors><![CDATA[Seki, H.;Tanohata, N.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Characteristic Model-Based Adaptive Discrete-Time Sliding Mode Control for the Swing Arm in a Fourier Transform Spectrometer]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392480]]></link>
			<description><![CDATA[This paper aims to guarantee high-precision tracking of the desired optical path difference velocity for a Fourier transform spectrometer (FTS) in a space exploration system with time-varying parameters and nonlinear dynamics. A novel characteristic model-based adaptive discrete-time sliding mode control (ADSMC) scheme is proposed. The design of the ADSMC includes characteristic modeling, characteristic model-based discrete-time sliding mode control, and the estimator of the uncertain coefficients. The stability analysis of the ADSMC is also given in this paper. Simulation and experimental results demonstrate that the proposed characteristic model-based ADSMC can achieve high-precision control over a Michelson interferometer-based FTS. The significant advantages of the proposed ADSMC are its robustness and better control performance over the external disturbance and internal parameter uncertainty of the system.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392480]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1633</startPage>
			<endPage>1643</endPage>
			<fileSize>1030</fileSize>
			<authors><![CDATA[Chunjie Zhou;Yufeng Shi;Shuang-Hua Yang;Quan Yin;Yuanqing Qin;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Comparative Study on Multiobjective Swarm Intelligence for the Routing and Wavelength Assignment Problem]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392467]]></link>
			<description><![CDATA[The future of designing optical networks is focused on the wavelength division multiplexing (WDM) technology. This technology divides the huge bandwidth of an optical fiber into different wavelengths, providing different available channels per link of fiber. However, when it is necessary to establish a set of demands, a problem comes up. This problem is known as a routing and wavelength assignment (RWA) problem. Depending on the traffic pattern, two varieties of a RWA problem have been considered in the literature: static and dynamic. In this paper, we present a comparative study among three multiobjective evolutionary algorithms (MOEAs) based on swarm intelligence to solve the RWA problem in real-world optical networks. Artificial bee colony (ABC) algorithm, gravitational search algorithm (GSA), and firefly algorithm (FA) are the selected evolutionary algorithms, but are adapted to multiobjective domain (MO-ABC, MO-GSA, and MO-FA, respectively). In order to prove the goodness of the swarm proposals, we have compared them with a standard MOEA: fast nondominated sorting genetic algorithm. Finally, we present a comparison among the metaheuristics based on swarm intelligence and several techniques published in the literature, coming to the conclusion that swarm intelligence is very suitable to solve the RWA problem, and presumably that it may obtain such quality results not only in diverse telecommunication optimization problems, but also in other engineering optimization problems.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392467]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1644</startPage>
			<endPage>1655</endPage>
			<fileSize>2218</fileSize>
			<authors><![CDATA[Rubio-Largo, A.;Vega-Rodriguez, M.A.;Gomez-Pulido, J.A.;Sanchez-Pe&#x0301;rez, J.M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Agent-Based Decision Support and Simulation for Wood Products Manufacturing]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392453]]></link>
			<description><![CDATA[A rough mill is a manufacturing plant where lumber of approximate dimensions is cut into components of specific sizes, priorities, and qualities to fill customer orders for wood products such as furniture, doors, and window frames. Lumber is a valuable natural resource that is a significant expense to the company. By improving the processes in the rough mill, cost can be reduced and waste of natural materials is decreased. We present an overview of research in agent-based manufacturing systems. The operations in a rough mill are described and the decisions that operators take are identified. A rough mill decision support and simulation system is designed and implemented. An agent ontology for rough mill operations is developed. A prototype system is implemented to demonstrate the architecture and interagent communication. This prototype is extended to two lines of production and the negotiation protocol is presented. Extension of the approach to multiple lines of production is discussed. The prototype system is used to implement a decision support and simulation system that is validated with historical data. Finally, we present a comparison of the advantages and disadvantages of using the multiagent paradigm in rough mill decision support.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392453]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1656</startPage>
			<endPage>1668</endPage>
			<fileSize>662</fileSize>
			<authors><![CDATA[Elghoneimy, E.;Gruver, W.A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[User Authentication Based on Representative Users]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392468]]></link>
			<description><![CDATA[User authentication based on username and password is the most common means to enforce access control. This form of access restriction is prone to hacking since stolen usernames and passwords can be exploited to impersonate legitimate users in order to commit malicious activity. Biometric authentication incorporates additional user characteristics such as the manner by which the keyboard is used in order to identify users. We introduce a novel approach for user authentication based on the keystroke dynamics of the password entry. A classifier is tailored to each user and the novelty lies in the manner by which the training set is constructed. Specifically, only the keystroke dynamics of a small subset of users, which we refer to as representatives, is used along with the password entry keystroke dynamics of the examined user. The contribution of this approach is twofold: it reduces the possibility of overfitting, while allowing scalability to a high volume of users. We propose two strategies to construct the subset for each user. The first selects the users whose keystroke profiles govern the profiles of all the users, while the second strategy chooses the users whose profiles are the most similar to the profile of the user for whom the classifier is constructed. Results are promising reaching in some cases 90% area under the curve. In many cases, a higher number of representatives deteriorate the accuracy which may imply overfitting. An extensive evaluation was performed using a dataset containing over 780 users.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392468]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1669</startPage>
			<endPage>1678</endPage>
			<fileSize>963</fileSize>
			<authors><![CDATA[Schclar, A.;Rokach, L.;Abramson, A.;Elovici, Y.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Machine Learning-Based Framework for Automatic Visual Inspection of Microdrill Bits in PCB Production]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392452]]></link>
			<description><![CDATA[In this paper, an automatic visual inspection scheme with phase identification of microdrill bits in printed circuit board (PCB) production is proposed. Different from conventional methods in which the geometric quantities of microdrill bits are measured to compare with the prior standards, the proposed method adopts a strategy of machine learning. Thus, it lowers the requirement for the enlargement of lens and the resolution of charge-coupled device; therefore, the cost of inspecting instrument can be relatively reduced. Our method mainly includes two procedures: First, the statistical shape models of microdrill bit are built to get the shape subspace, and then the phase identification is performed in the shape subspace using some pattern recognition techniques. In this paper, we compared the performance of two statistical model methods, principal component analysis (PCA) and linear discriminate analysis, together with three classifiers, support vector machines (SVMs), neural networks, and <i>k</i>-nearest neighbors, respectively, for phase identification of microdrill bits. The experimental results demonstrate that using low enlargement and resolution microdrill bit images the proposed method can measure up to high inspection accuracy, and provide a conclusion that the highest identification rates are obtained by PCA-SVMs, which are higher than that of the conventional method.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392452]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1679</startPage>
			<endPage>1689</endPage>
			<fileSize>771</fileSize>
			<authors><![CDATA[Guifang Duan;Hongcui Wang;Zhenyu Liu;Yen-Wei Chen;]]></authors>
		</item>
		<item>
			<title><![CDATA[Analyzing Log Files for Postmortem Intrusion Detection]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392466]]></link>
			<description><![CDATA[Upon an intrusion, security staff must analyze the IT system that has been compromised, in order to determine how the attacker gained access to it, and what he did afterward. Usually, this analysis reveals that the attacker has run an exploit that takes advantage of a system vulnerability. Pinpointing, in a given log file, the execution of one such an exploit, if any, is very valuable for computer security. This is both because it speeds up the process of gathering evidence of the intrusion, and because it helps taking measures to prevent a further intrusion, e.g., by building and applying an appropriate attack signature for intrusion detection system maintenance. This problem, which we call postmortem intrusion detection, is fairly complex, given both the overwhelming length of a standard log file, and the difficulty of identifying exactly where the intrusion has occurred. In this paper, we propose a novel approach for postmortem intrusion detection, which factors out repetitive behavior, thus, speeding up the process of locating the execution of an exploit, if any. Central to our intrusion detection mechanism is a classifier, which separates abnormal behavior from normal one. This classifier is built upon a method that combines a hidden Markov model with <i>k</i> -means. Our experimental results establish that our method is able to spot the execution of an exploit, with a cumulative detection rate of over 90%. In addition, we propose an entropy-based approach that speeds up the construction of a profile for ordinary system behavior.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392466]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1690</startPage>
			<endPage>1704</endPage>
			<fileSize>3078</fileSize>
			<authors><![CDATA[Garcia, K.A.;Monroy, R.;Trejo, L.A.;Mex-Perera, C.;Aguirre, E.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Using Multidimensional Bayesian Network Classifiers to Assist the Treatment of Multiple Sclerosis]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392464]]></link>
			<description><![CDATA[Multiple sclerosis is an autoimmune disorder of the central nervous system and potentially the most common cause of neurological disability in young adults. The clinical disease course is highly variable and different multiple sclerosis subtypes can be defined depending on the progression of the severity of the disease. In the early stages, the disease subtype is unknown, and there is no information about how the severity is going to evolve. As there are different treatment options available depending on the progression of the disease, early identification has become highly relevant. Thus, given a new patient, it is important to diagnose the disease subtype. Another relevant information to predict is the expected time to reach a severity level indicating that assistance for walking is required. Given that we have to predict two correlated class variables: disease subtype and time to reach certain severity level, we use multidimensional Bayesian network classifiers because they can model and exploit the relations among both variables. Besides, the obtained models can be validated by the physicians using their expert knowledge due to the interpretability of Bayesian networks. The learning of the classifiers is made by means of a novel multiobjective approach which tries to maximize the accuracy of both class variables simultaneously. The application of the methodology proposed in this paper can help a physician to identify the expected progression of the disease and to plan the most suitable treatment.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392464]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1705</startPage>
			<endPage>1715</endPage>
			<fileSize>1126</fileSize>
			<authors><![CDATA[Rodriguez, J.D.;Perez, A.;Arteta, D.;Tejedor, D.;Lozano, J.A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Path-Tracking Maneuvers With Industrial Robot Manipulators Using Uncalibrated Vision and Impedance Control]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392449]]></link>
			<description><![CDATA[This paper presents an interaction control strategy for industrial robot manipulators which consists of the combination of a calibration-free, vision-based control method with an impedance-control approach. The vision-based, robot control method known as camera-space manipulation is used to generate a given, previously defined trajectory over an arbitrary surface. Then, a kinematic impedance controller is implemented in order to regulate the interaction forces generated by the contact between the robot end-effector and the work surface where the trajectory is traced. The paper presents experimental evidence on how the vision-force sensory fusion is applied to a path-tracking task, using a Fanuc M16-iB industrial robot equipped with a force/torque sensor at the wrist. In this task, several levels of interaction force between the robot end-effector and the surface were defined. As discussed in the paper, such a synergy between the control schemes is seen as a viable alternative for performing industrial maneuvers that require force modulation between the tool held by the robot and the working surface.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392449]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1716</startPage>
			<endPage>1729</endPage>
			<fileSize>1305</fileSize>
			<authors><![CDATA[Bonilla, I.;Mendoza, M.;Gonzalez-Galva&#x0301;n, E.J.;Chavez-Olivares, C.;Loredo-Flores, A.;Reyes, F.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Chemical Detection Using the Receptor Density Algorithm]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392458]]></link>
			<description><![CDATA[This paper describes the application of the receptor density algorithm, an artificial immune system, as used to detect chemicals from data provided by various spectrometers. The system creates chemical signatures which are matched to a library of known chemicals, allowing the positive identification of hazardous substances. The performance of the system is tested against a publicly available mass-spectrometry dataset, against which it has previously been demonstrated as an effective anomaly detection algorithm. An autonomous chemical-detection device is then discussed, in which the algorithm is running on hardware embedded in a Pioneer robot carrying a portable chemical agent monitor.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392458]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1730</startPage>
			<endPage>1741</endPage>
			<fileSize>879</fileSize>
			<authors><![CDATA[Hilder, J.A.;Owens, N.D.L.;Neal, M.J.;Hickey, P.J.;Cairns, S.N.;Kilgour, D.P.A.;Timmis, J.;Tyrrell, A.M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Multiagent-Based Reinforcement Learning for Optimal Reactive Power Dispatch]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392462]]></link>
			<description><![CDATA[This paper proposes a fully distributed multiagent-based reinforcement learning method for optimal reactive power dispatch. According to the method, two agents communicate with each other only if their corresponding buses are electrically coupled. The global rewards that are required for learning are obtained with a consensus-based global information discovery algorithm, which has been demonstrated to be efficient and reliable. Based on the discovered global rewards, a distributed <i>Q</i>-learning algorithm is implemented to minimize the active power loss while satisfying operational constraints. The proposed method does not require accurate system model and can learn from scratch. Simulation studies with power systems of different sizes show that the method is very computationally efficient and able to provide near-optimal solutions. It can be observed that prior knowledge can significantly speed up the learning process and decrease the occurrences of undesirable disturbances. The proposed method has good potential for online implementation.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392462]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1742</startPage>
			<endPage>1751</endPage>
			<fileSize>686</fileSize>
			<authors><![CDATA[Yinliang Xu;Wei Zhang;Wenxin Liu;Ferrese, F.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Comparing Optical Flow Algorithms Using 6-DOF Motion of Real-World Rigid Objects]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392450]]></link>
			<description><![CDATA[The application of optical flow algorithms to guidance and navigation problems has gained considerable interest in recent years. This paper summarizes the results of a comparative study on the accuracy of nine different optical flow (OF) algorithms using videos that are captured from an on-board camera during the flight of an autonomous aircraft model. The comparison among the algorithms relies on two formulas that are used both to calculate the ideal OF generated by the motion of a rigid body in the camera field of view and to estimate the linear and angular velocity from the OF.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392450]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1752</startPage>
			<endPage>1762</endPage>
			<fileSize>868</fileSize>
			<authors><![CDATA[Mammarella, M.;Campa, G.;Fravolini, M.L.;Napolitano, M.R.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Neural Network-Based Active Learning in Multivariate Calibration]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392478]]></link>
			<description><![CDATA[In chemometrics, data from infrared or near-infrared (NIR) spectroscopy are often used to identify a compound or to analyze the composition of a material. This involves the calibration of models that predict the concentration of material constituents from the measured NIR spectrum. An interesting aspect of multivariate calibration is to achieve a particular accuracy level with a minimum number of training samples, as this reduces the number of laboratory tests and thus the cost of model building. In these chemometric models, the input refers to a proper representation of the spectra and the output to the concentrations of the sample constituents. The search for a most informative new calibration sample thus has to be performed in the output space of the model, rather than in the input space as in conventional modeling problems. In this paper, we propose to solve the corresponding inversion problem by utilizing the disagreements of an ensemble of neural networks to represent the prediction error in the unexplored component space. The next calibration sample is then chosen at a composition where the individual models of the ensemble disagree most. The results obtained for a realistic chemometric calibration example show that the proposed active learning can achieve a given calibration accuracy with less training samples than random sampling.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392478]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1763</startPage>
			<endPage>1771</endPage>
			<fileSize>1315</fileSize>
			<authors><![CDATA[Ukil, A.;Bernasconi, J.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Evolving a Multiagent Controller for Micro Aerial Vehicles]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392477]]></link>
			<description><![CDATA[Micro aerial vehicles (MAVs) are notoriously difficult to control as they are light, susceptible to minor fluctuations in the environment, and obey highly nonlinear dynamics. Indeed, traditional control methods, particularly those relying on difficult to obtain models of the interaction between an MAV and its environment, have been unable to provide adequate control beyond simple maneuvers. In this paper, we address the problem of controlling an MAV (which has segmented control surfaces) by evolving a neurocontroller and fine tuning it using multiagent coordination techniques. This approach is based on a control strategy that learns to map MAV states (position and velocity) to MAV actions (e.g., actuator position) to achieve good performance (e.g., flight time) by maximizing an objective function. The main difficulty with this approach is defining the objective functions at the MAV level that allow good performance. In addition, to provide added robustness, we investigate a multiagent approach to control where each control surface aims to optimize a local objective. Our results show that this approach not only provides good MAV control, but provides robustness to: 1) wind gusts by a factor of 6; 2) turbulence by a factor of 4; and 3) hardware failures by a factor of 8 over a traditional control method.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392477]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1772</startPage>
			<endPage>1783</endPage>
			<fileSize>890</fileSize>
			<authors><![CDATA[Salichon, M.;Tumer, K.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Ensemble Clustering for Internet Security Applications]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392461]]></link>
			<description><![CDATA[Due to their damage to Internet security, malware and phishing website detection has been the Internet security topics that are of great interests. Compared with malware attacks, phishing website fraud is a relatively new Internet crime. However, they share some common properties: 1) both malware samples and phishing websites are created at a rate of thousands per day driven by economic benefits; and 2) phishing websites represented by the term frequencies of the webpage content share similar characteristics with malware samples represented by the instruction frequencies of the program. Over the past few years, many clustering techniques have been employed for automatic malware and phishing website detection. In these techniques, the detection process is generally divided into two steps: 1) feature extraction, where representative features are extracted to capture the characteristics of the file samples or the websites; and 2) categorization, where intelligent techniques are used to automatically group the file samples or websites into different classes based on computational analysis of the feature representations. However, few have been applied in real industry products. In this paper, we develop an automatic categorization system to automatically group phishing websites or malware samples using a cluster ensemble by aggregating the clustering solutions that are generated by different base clustering algorithms. We propose a principled cluster ensemble framework to combine individual clustering solutions that are based on the consensus partition, which can not only be applied for malware categorization, but also for phishing website clustering. In addition, the domain knowledge in the form of sample-level/website-level constraints can be naturally incorporated into the ensemble framework. The case studies on large and real daily phishing websites and malware collection from the Kingsoft Internet Security Laboratory demonstrate the effectiveness and efficiency of -
ur proposed method.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392461]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1784</startPage>
			<endPage>1796</endPage>
			<fileSize>6698</fileSize>
			<authors><![CDATA[Weiwei Zhuang;Yanfang Ye;Yong Chen;Tao Li;]]></authors>
		</item>
		<item>
			<title><![CDATA[Elegant Object-Oriented Software Design via Interactive, Evolutionary Computation]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392390]]></link>
			<description><![CDATA[Design is fundamental to software development but can be demanding to perform. Thus, to assist the software designer, evolutionary computing is being increasingly applied using machine-based, quantitative fitness functions to evolve software designs. However, in nature, elegance and symmetry play a crucial role in the reproductive fitness of various organisms. In addition, subjective evaluation has also been exploited in interactive evolutionary computation (IEC). Therefore, to investigate the role of elegance and symmetry in software design, four novel elegance measures are proposed which are based on the evenness of distribution of design elements. In controlled experiments in a dynamic IEC environment, designers are presented with visualizations of object-oriented software designs, which they rank according to a subjective assessment of elegance. For three out of the four elegance measures proposed, it is found that a significant correlation exists between elegance values and reward elicited. These three elegance measures assess the evenness of distribution of 1) attributes and methods among classes; 2) external couples between classes; and 3) the ratio of attributes to methods. It is concluded that symmetrical elegance is in some way significant in software design, and that this can be exploited in dynamic, multiobjective IEC to produce elegant software designs.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392390]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1797</startPage>
			<endPage>1805</endPage>
			<fileSize>446</fileSize>
			<authors><![CDATA[Simons, C.L.;Parmee, I.C.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Using Coding-Based Ensemble Learning to Improve Software Defect Prediction]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392473]]></link>
			<description><![CDATA[Using classification methods to predict software defect proneness with static code attributes has attracted a great deal of attention. The class-imbalance characteristic of software defect data makes the prediction much difficult; thus, a number of methods have been employed to address this problem. However, these conventional methods, such as sampling, cost-sensitive learning, Bagging, and Boosting, could suffer from the loss of important information, unexpected mistakes, and overfitting because they alter the original data distribution. This paper presents a novel method that first converts the imbalanced binary-class data into balanced multiclass data and then builds a defect predictor on the multiclass data with a specific coding scheme. A thorough experiment with four different types of classification algorithms, three data coding schemes, and six conventional imbalance data-handling methods was conducted over the 14 NASA datasets. The experimental results show that the proposed method with a one-against-one coding scheme is averagely superior to the conventional methods.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392473]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1806</startPage>
			<endPage>1817</endPage>
			<fileSize>1451</fileSize>
			<authors><![CDATA[Zhongbin Sun;Qinbao Song;Xiaoyan Zhu;]]></authors>
		</item>
		<item>
			<title><![CDATA[Decision Forest for Root Cause Analysis of Intermittent Faults]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392471]]></link>
			<description><![CDATA[Intermittent failures can be problematic in electronic control units (ECUs) such as engine/transmission control modules. When an ECU exhibits an internal performance fault, the ECU may malfunction, while the fault condition is active, and later, it may once again give correct results when conditions change. Due to highly unpredictable nature of intermittent faults, it can be extremely difficult to diagnose them. Therefore, there is a need to enhance the fault diagnosis of intermittent faults in ECUs. In this paper, we propose an off-board, data-driven approach that can assist diagnostic engineers to investigate intermittent faults using fleet-wide field failure data. The field failure data may include a large number of intermittent faults and concomitant operating parameters (e.g., vehicle speed, engine speed, control module voltage, powertrain relay voltage, etc.) recorded at the time when the faults occurred. We describe a decision forest method to identify a reduced set of informative operating parameters, i.e., features that separate or characterize the operating conditions of the intermittent fault from baseline, i.e., classes in feature selection space. A web-based application has been developed to assist the diagnostic engineers. We demonstrate the capabilities of our method using three case studies for an automobile test fleet.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392471]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1818</startPage>
			<endPage>1827</endPage>
			<fileSize>698</fileSize>
			<authors><![CDATA[Singh, S.;Subramania, H.S.;Holland, S.W.;Davis, J.T.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Dynamic AdaBoost Algorithm With Adaptive Changes of Loss Function]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392455]]></link>
			<description><![CDATA[AdaBoost is a method to improve a given learning algorithm's classification accuracy by combining its hypotheses. Adaptivity, one of the significant advantages of AdaBoost, makes AdaBoost maximize the smallest margin so that AdaBoost has good generalization ability. However, when the samples with large negative margins are noisy or atypical, the maximized margin is actually a &#x201C;hard margin.&#x201D; The adaptive feature makes AdaBoost sensitive to the sampling fluctuations, and prone to overfitting. Therefore, the traditional schemes prevent AdaBoost from overfitting by heavily damping the influences of samples with large negative margins. However, the samples with large negative margins are not always noisy or atypical; thus, the traditional schemes of preventing overfitting may not be reasonable. In order to learn a classifier with high generalization performance and prevent overfitting, it is necessary to perform statistical analysis for the margins of training samples. Herein, Hoeffding inequality is adopted as a statistical tool to divide training samples into reliable samples and temporary unreliable samples. A new boosting algorithm, which is named DAdaBoost, is introduced to deal with reliable samples and temporary unreliable samples separately. Since DAdaBoost adjusts weighting scheme dynamically, the loss function of DAdaBoost is not fixed. In fact, it is a series of nonconvex functions that gradually approach the 0-1 function as the algorithm evolves. By defining a virtual classifier, the dynamic adjusted weighting scheme is well unified into the progress of DAdaBoost, and the upper bound of training error is deduced. The experiments on both synthetic and real world data show that DAdaBoost has many merits. Based on the experiments, we conclude that DAdaBoost can effectively prevent AdaBoost from overfitting.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392455]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1828</startPage>
			<endPage>1841</endPage>
			<fileSize>1059</fileSize>
			<authors><![CDATA[Yunlong Gao;Guoli Ji;Zijiang Yang;Jinyan Pan;]]></authors>
		</item>
		<item>
			<title><![CDATA[Cost Analysis of WDM and TDM Fiber-to-the-Home (FTTH) Networks: A System-of-Systems Approach]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392479]]></link>
			<description><![CDATA[A system-of-systems (SoS) approach for wavelength-division multiplexing (WDM) and time-division multiplexing (TDM) fiber-to-the-home (FTTH) telecommunication networks is presented. Cost evolution curves for individual systems as well for whole FTTH WDM and TDM networks are presented. The analysis can be exploited for a fast and accurate analysis of FTTH deployment costs in dense urban, urban, and suburban areas from the technoeconomic point of view, which is of paramount importance for telecom operators, equipment vendors, regulators, and policy makers. The impact of delaying the deployments or adopting different rollout strategies is also investigated and presented. The SoS emergent behavior is further revealed using exploratory modeling. The results reveal that in all cases, the WDM solution is more expensive than TDM. The total cost for suburban areas is almost six times higher than in dense urban areas and four times than urban areas.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392479]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1842</startPage>
			<endPage>1853</endPage>
			<fileSize>1889</fileSize>
			<authors><![CDATA[Rokkas, T.;Neokosmidis, I.;Katsianis, D.;Varoutas, D.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Initial Profile Generation in Recommender Systems Using Pairwise Comparison]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6212388]]></link>
			<description><![CDATA[Most recommender systems, such as collaborative filtering, cannot provide personalized recommendations until a user profile has been created. This is known as the new user cold-start problem. Several systems try to learn the new users' profiles as part of the sign up process by asking them to provide feedback regarding several items. We present a new, anytime preferences elicitation method that uses the idea of pairwise comparison between items. Our method uses a lazy decision tree, with pairwise comparisons at the decision nodes. Based on the user's response to a certain comparison, we select on-the-fly what pairwise comparison should next be asked. A comparative field study has been conducted to examine the suitability of the proposed method for eliciting the user's initial profile. The results indicate that the proposed pairwise approach provides more accurate recommendations than existing methods and requires less effort when signing up newcomers.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6212388]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1854</startPage>
			<endPage>1859</endPage>
			<fileSize>510</fileSize>
			<authors><![CDATA[Rokach, L.;Kisilevich, S.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Scope and title change of the IEEE Transactions on Systems, Man, and Cybernetics]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6330045]]></link>
			<description><![CDATA[In November 2011, the IEEE Technical Activities Board approved the scope and title change of the three SMC Transactions. The SMC Transactions will be more clearly focused by renaming them as follows: (1) IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans will become IEEE Transactions on Systems, Man, and Cybernetics: Systems and will only focus on systems science and engineering, including issue formulation, analysis and modeling, decision making. (2) IEEE Transactions on Systems, Man, and Cybernetics -Part B: Cybernetics will become IEEE Transactions on Cybernetics, clearly indicating the nature of the journal. There will be no change to the topical areas covered by this title. (3) IEEE Transactions on Systems, Man, and Cybernetics - Part C: Applications & Reviews will become IEEE Transactions on Human-Machine Systems. This new publication will cover human systems and human organizational interactions including cognitive ergonomics, system test and evaluation, and human information processing concerns in systems and organizations. The application and review papers for the Transactions are no longer separated into their own journal. Instead, those papers will be accepted and included in the appropriate title along with the theoretical papers. The change will be effective January 2013.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6330045]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1860</startPage>
			<endPage>1860</endPage>
			<fileSize>262</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[2013 IEEE International Conference on Systems, Man, and Cybernetics]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392442]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392442]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1861</startPage>
			<endPage>1861</endPage>
			<fileSize>205</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Open Access]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392443]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6392443]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1862</startPage>
			<endPage>1862</endPage>
			<fileSize>1156</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[2012 Index IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) Vol. 42]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6403611]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6403611]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>1863</startPage>
			<endPage>1884</endPage>
			<fileSize>427</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[IEEE Systems, Man, and Cybernetics Society Information]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6330042]]></link>
			<description><![CDATA[Provides a listing of current committee members and society officers.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6330042]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>C3</startPage>
			<endPage>C3</endPage>
			<fileSize>28</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[IEEE Transactions on Systems, Man, and Cybernetics&#x2014;Part C: Applications and Reviews information for authors]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6330044]]></link>
			<description><![CDATA[Provides instructions and guidelines to prospective authors who wish to submit manuscripts.]]></description>
			<pubDate><![CDATA[Nov.  2012]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6330044]]></guid>
			<volume>42</volume>
			<issue>6</issue>
			<startPage>C4</startPage>
			<endPage>C4</endPage>
			<fileSize>36</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
	</channel>
</rss>