<?xml version="1.0" ?>
<rss version="2.0">
	<channel>
		<title><![CDATA[ Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on - new TOC ]]></title>
		<link>http://ieeexplore.ieee.org</link>
		<description>TOC Alert for Publication# 3468 </description>
		<year>2010</year>
		<month>February </month>
		<day>09</day>
		<item>
			<title><![CDATA[Table of Contents]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5353824]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5353824]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>C1</startPage>
			<endPage>C1</endPage>
			<fileSize>45</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[IEEE Transactions on Systems, Man, and Cybernetics&mdash;Part A: Systems and Humans publication information]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5353821]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5353821]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>C2</startPage>
			<endPage>C2</endPage>
			<fileSize>38</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Sensing Assessment in Unknown Environments: A Survey]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5313896]]></link>
			<description><![CDATA[This paper surveys sensing assessment solutions from the literature with a particular focus on techniques which can be used in unknown environments, including the following: sensor fault detection and identification (FDI), sensor or source evaluation, and isolating poorly sensed regions. Each approach is evaluated in terms of its ability to perform sensing assessment tasks in unknown environments and its coverage of the range of potential sensing problems. These tasks include sensing problem detection and characterization, as well as performance evaluation (e.g., estimating accuracy or reliability), for a sensor or group of sensors. This survey shows that over 40 existing approaches are focused on either detection and identification of traditional sensor faults (e.g., drift or physical damage) in known environments or evaluation of the reliability of a source (e.g., sensor or agent). Only eight approaches surveyed have tackled environment-dependent problems (e.g., exteroceptive sensor FDI, miscalibration, or use of an inappropriate sensor) in a useful manner for unknown environments. Even less work (two studies) appears to have been done on isolating poorly sensed regions. The survey concludes with a list of opportunities for future research, including developing methods for detecting and characterizing environment-dependent problems and creating comprehensive sensing assessment systems.]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5313896]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>1</startPage>
			<endPage>12</endPage>
			<fileSize>560</fileSize>
			<authors><![CDATA[Gage, J.;Murphy, R.R.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Interactive Teaching for Vision-Based Mobile Robots: A Sensory-Motor Approach]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5345874]]></link>
			<description><![CDATA[For the last decade, we have been developing a vision-based architecture for mobile robot navigation. Using our bio-inspired model of navigation, robots can perform sensory-motor tasks in real time in unknown indoor as well as outdoor environments. We address here the problem of autonomous incremental learning of a sensory-motor task, demonstrated by an operator guiding a robot. The proposed system allows for semisupervision of task learning and is able to adapt the environmental partitioning to the complexity of the desired behavior. A real dialogue based on actions emerges from the interactive teaching. The interaction leads the robot to autonomously build a precise sensory-motor dynamics that approximates the behavior of the teacher. The usability of the system is highlighted by experiments on real robots, in both indoor and outdoor environments. Accuracy measures are also proposed in order to evaluate the learned behavior as compared to the expected behavioral attractor. These measures, used first in a real experiment and then in a simulated experiment, demonstrate how a real interaction between the teacher and the robot influences the learning process.]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5345874]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>13</startPage>
			<endPage>28</endPage>
			<fileSize>1782</fileSize>
			<authors><![CDATA[Giovannangeli, C.;Gaussier, P.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Improved Telemanipulator Navigation During Display-Control Misalignments Using Augmented Reality Cues]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5288587]]></link>
			<description><![CDATA[An augmented reality (AR) cueing method designed to improve teleoperator performance under conditions of display-control misalignment is investigated. The teleoperation task was designed to mimic the operation of space robot arms, which are manipulated using hand controllers (HCs) to orient and translate the body-fixed coordinates at the end effector (EE). Cameras provide visual feedback. However, the pose of the EE seen through the camera hinders operator performance due to misalignments between the displayed EE axes and the HC axes. In this paper, the coordinate system of the EE is graphically overlaid in three dimensions on the video views with uniquely colored axes using AR. The same color scheme is used to label the corresponding axes on the HCs. Operators use these color cues to map each axis on the HCs to the corresponding colored axis of the augmented coordinates at the EE to obtain EE movement in the desired direction. Between-groups and within-participant experiments comparing EE trajectory distance, deviation from path, navigation errors, and HC axis usage were used to determine the effectiveness of the augmented coordinates over conventional teleoperation without augmented coordinates. Significant reductions in EE trajectory distance, deviation from path, navigation errors, and single-axis HC usage were observed when participants manipulated the remote robot with augmented coordinates. The results demonstrate that the use of simple AR cues in remote robot arm teleoperation is beneficial to the operator.]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5288587]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>29</startPage>
			<endPage>39</endPage>
			<fileSize>847</fileSize>
			<authors><![CDATA[Chintamani, K.;Cao, A.;Ellis, R.D.;Pandya, A.K.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Interaction Analysis of the ALICE Chatterbot: A Two-Study Investigation of Dialog and Domain Questioning]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5272316]]></link>
			<description><![CDATA[This paper analyzes and compares the data gathered from two previously conducted artificial linguistic Internet chat entity (ALICE) chatterbot studies that were focused on response accuracy and user satisfaction measures for six chatterbots. These chatterbots were further loaded with varying degrees of conversational, telecommunications, and terrorism knowledge. From our prior experiments using 347 participants, we obtained 33 446 human/chatterbot interactions. It was found that asking the ALICE chatterbots ¿are¿ and ¿where¿ questions resulted in higher response satisfaction levels, as compared to other interrogative-style inputs because of their acceptability to vague, binary, or clichE¿d chatterbot responses. We also found a relationship between the length of a query and the users perceived satisfaction of the chatterbot response, where shorter queries led to more satisfying responses.]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5272316]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>40</startPage>
			<endPage>51</endPage>
			<fileSize>1497</fileSize>
			<authors><![CDATA[Schumaker, R.P.;Hsinchun Chen;]]></authors>
		</item>
		<item>
			<title><![CDATA[TRECON: A Trust-Based Economic Framework for Efficient Internet Routing]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5308454]]></link>
			<description><![CDATA[The fragility and the poor resilience of the Internet are manifested by the severe impact of network activities and the slow recovery after an earthquake damaged undersea cables and disrupted telephone and Internet access in East Asia in December 2006. Except the inefficiency of routing protocols, lack of efficient network monitoring mechanisms and lack of economic incentives to encourage service providers (SPs) to act cooperatively and promptly are other important reasons. In this paper, we build a trust-based economic framework called TRECON to address these open problems in Internet routing. The novelty of TRECON is combining an adaptive personalized trust model with an economic approach to provide independent trust-based routing among SPs. TRECON provides flexible policy support based on the trust-based economic mechanism so that autonomous organizations with varied interests and optimization criteria can be smoothly integrated together to achieve better adaptiveness and self-management. Through introducing the economic model, TRECON explores a new way to solve the economic problems and incentives issues in the collaboration among SPs. To show the flexibility of routing policies support, we propose four typical routing policies under the TRECON framework. We evaluate our approach by comparing these four trust-derived routing policies with the classical global shortest path routing approach. We find that the policy based on trustworthiness performs much better than all other policies under different network topologies in terms of delay, success delivery rate, and economic effects.]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5308454]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>52</startPage>
			<endPage>67</endPage>
			<fileSize>1331</fileSize>
			<authors><![CDATA[Zhengqiang Liang;Weisong Shi;]]></authors>
		</item>
		<item>
			<title><![CDATA[Optimal Content Distribution in Video-on-Demand Tree Networks]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5280198]]></link>
			<description><![CDATA[Video-on-demand (VOD) services are expected to grow significantly over time, providing diverse programs for home entertainment, distance instruction, news on demand, and other applications. These services require large bandwidth resources. We present a model for a tree network where each node may have demands for multiple different VOD program families, where each program family is an aggregation of similar programs. The decision variables include location of VOD servers and assignment of program families to servers. The model considers cost of servers, cost of assigning program families to servers, and cost of link bandwidths used to broadcast programs. The objective is to minimize the sum of all these costs. The model is formulated as an integer program. We develop a dynamic programming formulation with multiple state variables and an algorithm that solves this model. Starting from the end nodes of the tree network, the algorithm determines optimal solutions to subtrees, eventually reaching the root node with the central server, thus providing an optimal solution to the entire network.]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5280198]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>68</startPage>
			<endPage>75</endPage>
			<fileSize>421</fileSize>
			<authors><![CDATA[Luss, H.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Computing Completion Time and Optimal Scheduling of Design Activities in Concurrent Product Development Process]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5288586]]></link>
			<description><![CDATA[This paper proposes a time-computing model and a scheduling method for shortening the completion time of product development under the given rework cost budget. As overlapping and iteration exist between or among design activities in concurrent product development, predictability and efficiency of the process deserve attention. By using the corresponding design structure matrix, the characteristics of information flow are obtained and applied to analysis of the dynamic behavior of the product development process. A time-computing model is set up to estimate the rework cost and completion time of each of the activities, between which both iteration and overlapping are observed. Through sequential quadratic programming, an optimization algorithm is developed for minimizing the development completion time under the constraint of the given rework cost budget. Our application results acquired from our experiments have verified the feasibility and validity of the approach.]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5288586]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>76</startPage>
			<endPage>89</endPage>
			<fileSize>1072</fileSize>
			<authors><![CDATA[Hong-Sen Yan;Bin Wang;Duo Xu;Zheng Wang;]]></authors>
		</item>
		<item>
			<title><![CDATA[An Integrated Data-Driven Framework for Computing System Management]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5313888]]></link>
			<description><![CDATA[With advancement in science and technology, computing systems are becoming increasingly more complex with a growing number of heterogeneous software and hardware components. They are thus becoming more difficult to monitor, manage, and maintain. Traditional approaches to system management have been largely based on domain experts through a knowledge acquisition solution that translates domain knowledge into operating rules and policies. This process has been well known as cumbersome, labor intensive, and error prone. In addition, traditional approaches for system management are difficult to keep up with the rapidly changing environments. There is a pressing need for automatic and efficient approaches to monitor and manage complex computing systems. In this paper, we propose an integrated data-driven framework for computing system management by acquiring the needed knowledge automatically from a large amount of historical log data. Specifically, we apply text mining techniques to automatically categorize the log messages into a set of canonical categories, incorporate temporal information to improve categorization performance, develop temporal mining techniques to discover the relationships between different events, and take a novel approach called event summarization to provide a concise interpretation of the temporal patterns.]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5313888]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>90</startPage>
			<endPage>99</endPage>
			<fileSize>766</fileSize>
			<authors><![CDATA[Tao Li;Wei Peng;Perng, C.;Sheng Ma;Haixun Wang;]]></authors>
		</item>
		<item>
			<title><![CDATA[Incorporating Time-Varying Perturbations Into the Dynamic Inoperability Input&#x2013;Output Model]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5282613]]></link>
			<description><![CDATA[This paper introduces a methodology to extend the capabilities of the dynamic inoperability input-output model (DIIM) to account for perturbations to sectors of the economy that are time varying and probabilistic. The DIIM accounts for the interdependent nature of the economy in determining the impact of a disruption on the ability of each economic sector to satisfy the prevailing demand. While the original formulation of the DIIM only allows for a single perturbation vector, this paper extends the DIIM to allow a perturbation matrix to be utilized as inputs to the model. The underlying motivation for this paper is understanding the impact of a pandemic on a regional economy. As such, idiosyncrasies associated with a pandemic are also accounted for in the model formulation. These include translating workforce absenteeism into a measure of sector inoperability and accounting for the impact of long-term absenteeism on a sector's ability to deliver its as-planned production output.]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5282613]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>100</startPage>
			<endPage>106</endPage>
			<fileSize>423</fileSize>
			<authors><![CDATA[Orsi, M.J.;Santos, J.R.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Systematic Study of the Prediction Model for Operator-Induced Assembly Defects Based on Assembly Complexity Factors]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5313964]]></link>
			<description><![CDATA[It is a common view that the assembly process heavily affects a product's final quality and cost. The continuously shortening product life cycle requires a faster response speed as well as a lower defect rate in assembly production. In this situation, assembly quality control is becoming one of the most demanding problems in the modern manufacturing environment. The main causes of assembly defects can be classified into four categories, i.e., improper design, defective part, variance in assembly system, and operator error. The first three categories have been studied for many decades. However, elements of the operator error have not been fully explored. In this paper, using a copier assembly as an example, the problem of assembly defects caused by mistakes of operators is investigated systematically. A novel defect-rate prediction model is derived from the study of two complexity factors, namely, the design-based assembly complexity factor and the process-based assembly complexity factor, which are defined according to the structure and production characteristics of the copier. Several case studies consistently demonstrate that the new prediction model is accurate and stable for evaluating the copier assembly quality. Moreover, another case study offered in this paper demonstrates that the prediction model can provide effective assistance in the improvement of assembly quality.]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5313964]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>107</startPage>
			<endPage>120</endPage>
			<fileSize>1789</fileSize>
			<authors><![CDATA[Qiang Su;Lei Liu;Whitney, D.E.;]]></authors>
		</item>
		<item>
			<title><![CDATA[FARO: FAce Recognition Against Occlusions and Expression Variations]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5340645]]></link>
			<description><![CDATA[Face recognition is widely considered as one of the most promising biometric techniques, allowing high recognition rates without being too intrusive. Many approaches have been presented to solve this special pattern recognition problem, also addressing the challenging cases of face changes, mainly occurring in expression, illumination, or pose. On the other hand, less work can be found in literature that deals with partial occlusions (i.e., sunglasses and scarves). This paper presents face recognition against occlusions and expression variations (FARO) as a new method based on partitioned iterated function systems (PIFSs), which is quite robust with respect to expression changes and partial occlusions. In general, algorithms based on PIFSs compute a map of self-similarities inside the whole input image, searching for correspondences among small square regions. However, traditional algorithms of this kind suffer from local distortions such as occlusions. To overcome such limitation, information extracted by PIFS is made local by working independently on each face component (eyes, nose, and mouth). Distortions introduced by likely occlusions or expression changes are further reduced by means of an <i>ad hoc</i> distance measure. In order to experimentally confirm the robustness of the proposed method to both lighting and expression variations, as well as to occlusions, FARO has been tested using AR-faces database, one of the main benchmarks for the scientific community in this context. A further validation of FARO performances is provided by the experimental results produced on Face Recognition Grand Challenge database.]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5340645]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>121</startPage>
			<endPage>132</endPage>
			<fileSize>1336</fileSize>
			<authors><![CDATA[De Marsico, M.;Nappi, M.;Riccio, D.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Layered-Encoding Cascade Optimization Approach to Product-Mix Planning in High-Mix&#x2013;Low-Volume Manufacturing]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5256255]]></link>
			<description><![CDATA[High-mix-low-volume (HMLV) production is currently a worldwide manufacturing trend. It requires a high degree of customization in the manufacturing process to produce a wide range of products in low quantity in order to meet customers' demand for more variety and choices of products. Such a kind of business environment has increased the conversion time and decreased the production efficiency due to frequent production changeover. In this paper, a layered-encoding cascade optimization (LECO) approach is proposed to develop an HMLV product-mix optimizer that exhibits the benefits of low conversion time, high productivity, and high equipment efficiency. Specifically, the genetic algorithm (GA) and particle swarm optimization (PSO) techniques are employed as optimizers for different decision layers in different LECO models. Each GA and PSO optimizer is studied and compared. A number of hypothetical and real data sets from a manufacturing plant are used to evaluate the performance of the proposed GA and PSO optimizers. The results indicate that, with a proper selection of the GA and PSO optimizers, the LECO approach is able to generate high-quality product-mix plans to meet the production demands in HMLV manufacturing environments.]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5256255]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>133</startPage>
			<endPage>146</endPage>
			<fileSize>1143</fileSize>
			<authors><![CDATA[Siew-Chin Neoh;Morad, N.;Chee-Peng Lim;Abdul Aziz, Z.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Immersive Multiplayer Games With Tangible and Physical Interaction]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5306180]]></link>
			<description><![CDATA[In this paper, we present a new immersive multiplayer game system developed for two different environments, namely, virtual reality (VR) and augmented reality (AR). To evaluate our system, we developed three game applications-a first-person-shooter game (for VR and AR environments, respectively) and a sword game (for the AR environment). Our immersive system provides an intuitive way for users to interact with the VR or AR world by physically moving around the real world and aiming freely with tangible objects. This encourages physical interaction between players as they compete or collaborate with other players. Evaluation of our system consists of users' subjective opinions and their objective performances. Our design principles and evaluation results can be applied to similar immersive game applications based on AR/VR.]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5306180]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>147</startPage>
			<endPage>157</endPage>
			<fileSize>1107</fileSize>
			<authors><![CDATA[Tedjokusumo, J.;Zhou, S.Z.-Y.;Winkler, S.;]]></authors>
		</item>
		<item>
			<title><![CDATA[An Efficient Algorithm to Computing Max&#x2013;Min Inverse Fuzzy Relation for Abductive Reasoning]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5308278]]></link>
			<description><![CDATA[This paper provides an alternative formulation to computing the max-min inverse fuzzy relation by embedding the inherent constraints of the problem into a heuristic (objective) function. The optimization of the heuristic function guarantees maximal satisfaction of the constraints, and consequently, the condition for optimality yields solution to the inverse problem. An algorithm for computing the max-min inverse fuzzy relation is proposed. An analysis of the algorithm indicates its relatively better computational accuracy and higher speed in comparison to the existing technique for inverse computation. The principle of fuzzy abduction is extended with the proposed inverse formulation, and the better relative accuracy of the said abduction over existing works is established through illustrations with respect to a predefined error norm.]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5308278]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>158</startPage>
			<endPage>169</endPage>
			<fileSize>317</fileSize>
			<authors><![CDATA[Chakraborty, S.;Konar, A.;Jain, L.C.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Robust Adaptive Tracking Control for Nonlinear Systems Based on Bounds of Fuzzy Approximation Parameters]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5286245]]></link>
			<description><![CDATA[A robust adaptive fuzzy control approach is developed for a class of multi-input-multi-output (MIMO) nonlinear systems with modeling uncertainties and external disturbances by using both the approximation property of the fuzzy logic systems and the backstepping technique. The MIMO systems are composed of interconnected subsystems in the strict-feedback form. The main characteristics of the developed approach are that the online computation burden is alleviated and the robustness to dynamic uncertainties and external disturbances is improved. It is proven that all the signals of the resulting closed-loop system are uniformly bounded and that the tracking errors converge to a small neighborhood around zero. Two simulation experiments are presented to demonstrate the feasibility of the approach developed in this paper.]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5286245]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>170</startPage>
			<endPage>184</endPage>
			<fileSize>451</fileSize>
			<authors><![CDATA[Yan-Jun Liu;Wei Wang;Shao-Cheng Tong;Yi-Sha Liu;]]></authors>
		</item>
		<item>
			<title><![CDATA[RUSBoost: A Hybrid Approach to Alleviating Class Imbalance]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5299216]]></link>
			<description><![CDATA[Class imbalance is a problem that is common to many application domains. When examples of one class in a training data set vastly outnumber examples of the other class(es), traditional data mining algorithms tend to create suboptimal classification models. Several techniques have been used to alleviate the problem of class imbalance, including data sampling and boosting. In this paper, we present a new hybrid sampling/boosting algorithm, called RUSBoost, for learning from skewed training data. This algorithm provides a simpler and faster alternative to SMOTEBoost, which is another algorithm that combines boosting and data sampling. This paper evaluates the performances of RUSBoost and SMOTEBoost, as well as their individual components (random undersampling, synthetic minority oversampling technique, and AdaBoost). We conduct experiments using 15 data sets from various application domains, four base learners, and four evaluation metrics. RUSBoost and SMOTEBoost both outperform the other procedures, and RUSBoost performs comparably to (and often better than) SMOTEBoost while being a simpler and faster technique. Given these experimental results, we highly recommend RUSBoost as an attractive alternative for improving the classification performance of learners built using imbalanced data.]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5299216]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>185</startPage>
			<endPage>197</endPage>
			<fileSize>395</fileSize>
			<authors><![CDATA[Seiffert, C.;Khoshgoftaar, T.M.;Van Hulse, J.;Napolitano, A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Constrained Weapon&#x2013;Target Assignment: Enhanced Very Large Scale Neighborhood Search Algorithm]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5282552]]></link>
			<description><![CDATA[Optimization problems solved using very large scale neighborhood (VLSN) search algorithms include scheduling problems, the capacitated minimum spanning tree problem, the traveling salesman problem, and weapon-target assignment (WTA). This correspondence paper presents an enhanced VLSN search algorithm for obtaining feasible solutions and constructing improvement graphs. This enhanced VLSN search algorithm solves the constrained WTA (CWTA) problem, in which the number of interceptors available to each weapon and the number of interceptors allowed to fire at each target have upper bounds. The proposed enhanced VLSN search algorithm can solve a CWTA problem with 100 targets and 100 weapons (where the upper bound on the number of interceptors for each weapon is one and both the lower and upper bounds on the number of interceptors for each target are equal to one) within an average of 3 s. This study demonstrates that the proposed Enhanced VLSN is superior to existing approaches.]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5282552]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>198</startPage>
			<endPage>204</endPage>
			<fileSize>427</fileSize>
			<authors><![CDATA[Mei-Zi Lee;]]></authors>
		</item>
		<item>
			<title><![CDATA[Notes on &#x201C;Reducing Algorithm Complexity for Computing an Aggregate Uncertainty Measure&#x201D;]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5290011]]></link>
			<description><![CDATA[In a recent paper, Liu have proposed the so-called F -algorithm which conditionally reduces the computational complexity of the Meyerowitz-Richman-Walker algorithm for the computation of the aggregate-uncertainty measure in the Dempster-Shafer theory of evidence, along with an illustration of its application in a practical scenario of target identification. In this correspondence, we will point out several technical mistakes, which some of them lead to some inexact or incomplete statements in the paper of Liu The corrections of these mistakes will be made, and some further improvement and results will be derived.]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5290011]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>205</startPage>
			<endPage>209</endPage>
			<fileSize>118</fileSize>
			<authors><![CDATA[Van-Nam Huynh;Nakamori, Y.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Have you visited lately? www.ieee.org]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5353825]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5353825]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>210</startPage>
			<endPage>210</endPage>
			<fileSize>210</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Proven powerful]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5353826]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5353826]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>211</startPage>
			<endPage>211</endPage>
			<fileSize>189</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[Special issue on subspace and manifold learning for image and video indexing and searching]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5353823]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5353823]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>212</startPage>
			<endPage>212</endPage>
			<fileSize>182</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[IEEE Systems, Man, and Cybernetics Society Information]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5353822]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5353822]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>C3</startPage>
			<endPage>C3</endPage>
			<fileSize>29</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[IEEE Transactions on Systems, Man, and Cybernetics&mdash;Part A: Systems and Humans information for authors]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5353820]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[Jan.  2010]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=5353819&arnumber=5353820]]></guid>
			<volume>40</volume>
			<issue>1</issue>
			<startPage>C4</startPage>
			<endPage>C4</endPage>
			<fileSize>35</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
	</channel>
</rss>