<?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>2008</year>
		<month>July     </month>
		<day>15</day>
		<item>
			<title><![CDATA[Decentralized Inventory Control for Large-Scale Reverse Supply Chains: A Computationally Tractable Approach]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4444624]]></link>
			<description><![CDATA[<para> In this paper, we consider a new inventory control technique for large-scale supply chains including repairs. The part flow is bidirectional with broken parts propagated upstream for repair. It is well known that available optimization techniques for inventory control for bidirectional stochastic supply chains are computationally intractable and also necessitate several simplifying assumptions. In contrast, the proposed approach is an adaptive scheme that scales well to practically interesting large-scale multiitem supply chains. Furthermore, practical issues such as stochastic transport delays, manufacturing times, and repair times and probabilistic characterization of part repair success are handled in a unified framework. The control scheme is based on a hierarchical two-level architecture that comprises an adaptive set point generator and a lower-level order-up-to policy. An application to aircraft supply chains involving multiple original equipment manufacturers (OEMs), depots, bases, squadrons, and planes is also investigated. </para>]]></description>
			<pubDate><![CDATA[July  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4444624]]></guid>
			<volume>38</volume>
			<issue>4</issue>
			<startPage>551</startPage>
			<endPage>561</endPage>
			<fileSize>453</fileSize>
			<authors><![CDATA[Krishnamurthy, P.;Khorrami, F.;Schoenwald, D.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Double-Deck Elevator Group Supervisory Control System Using Genetic Network Programming]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4446993]]></link>
			<description><![CDATA[<para> Elevator group supervisory control systems (EGSCSs) are designed so that the movement of several elevators in a building is controlled efficiently. The efficient control of EGSCSs using conventional control methods is very difficult due to its complexity, so it is becoming popular to introduce artificial intelligence (AI) technologies into EGSCSs in recent years. As a new approach, a graph-based evolutionary method named genetic network programming (GNP) has been applied to the EGSCSs, and its effectiveness is clarified. The GNP can introduce various <emphasis emphasistype="italic">a priori</emphasis> knowledge of the EGSCSs in its node functions easily, and can execute an efficient rule-based group supervisory control that is optimized in an evolutionary way. Meanwhile, double-deck elevator systems (DDESs) where two cages are connected in a shaft have been developed for the rising demand of more efficient transport of passengers in high-rise buildings. The DDESs have specific features due to the connection of cages and the need for comfortable riding; so its group supervisory control becomes more complex and requires more efficient group control systems than the conventional single-deck elevator systems (SDESs). In this paper, a new group supervisory control system for DDESs using GNP is proposed, and its optimization and performance evaluation are done through simulations. First, optimization of the GNP for DDSEs is executed. Second, the performance of the proposed method is evaluated by comparison with conventional methods, and the obtained control rules in GNP are studied. Finally, the reduction of space requirements compared with SDESs is confirmed. </para>]]></description>
			<pubDate><![CDATA[July  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4446993]]></guid>
			<volume>38</volume>
			<issue>4</issue>
			<startPage>535</startPage>
			<endPage>550</endPage>
			<fileSize>1052</fileSize>
			<authors><![CDATA[Hirasawa, K.;Eguchi, T.;Zhou, J.;Yu, L.;Hu, J.;Markon, S.;]]></authors>
		</item>
		<item>
			<title><![CDATA[An Integrated Approach for Agricultural Ecosystem Management]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4457951]]></link>
			<description><![CDATA[<para> Sustainable development and growth of agriculture sector calls for improving its competitiveness through a better understanding of lands, weather and climate, and planting, especially prediction of events with increased accuracy, and systematic integration of observations and prediction into decision-making in agriculture management. In this short paper, a systematic approach based on integrated information systems (IISs) for agricultural ecosystem management is proposed. The approach involves establishing an IIS called agricultural ecosystem enterprise information system (AEEIS) that extracts data on terrain, land use, planting, and others, and integrates them for the purpose of agricultural and ecosystem management. The integration helps in generating managerial/policy alternatives in consultation not only with agricultural and ecological specialists, but also with agriculture and ecosystems management. AEEIS, a platform of enterprise information systems, includes operational database, extract transform and load, data warehouse, data mining, simulation modeling, and knowledge management for generating managerial strategies on land use, planting species/variety, and optimal coverage of plants. AEEIS is part of efforts on integrated agricultural information services that is one of the main applications of China's sustainable agricultural development plan. The short paper concludes that, for effective management of agriculture and ecosystems, a systematic approach is essential in which IISs play a crucial role. </para>]]></description>
			<pubDate><![CDATA[July  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4457951]]></guid>
			<volume>38</volume>
			<issue>4</issue>
			<startPage>590</startPage>
			<endPage>599</endPage>
			<fileSize>359</fileSize>
			<authors><![CDATA[Xu, L.;Liang, N.;Gao, Q.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Satisficing Approach to Aircraft Conflict Resolution]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4481225]]></link>
			<description><![CDATA[<para> Future generations of air traffic management systems may give appropriately equipped aircraft the freedom to change flight paths in real time. This would require a conflict avoidance and resolution scheme that is both decentralized and cooperative. We describe a multiagent solution to aircraft conflict resolution based on satisficing game theory. A key feature of the theory is that satisficing decision makers form their preferences by taking into consideration the preferences of others, unlike conventional game theory that models agents that maximize self-interest metrics. This makes possible situational altruism, a sophisticated form of unselfish behavior in which the preferences of another agent are accommodated provided that the other agent will actually take advantage of the sacrifice. This approach also makes possible the creation of groups in which every decision maker receives due consideration. We present simulation results from a variety of scenarios in which the aircraft are limited to constant-speed heading-change maneuvers to avoid conflicts. We show that the satisficing approach results in behavior that is attractive both in terms of safety and performance. The results underscore the applicability of satisficing game theory to multiagent problems in which self-interested participants are inclined to cooperation. </para>]]></description>
			<pubDate><![CDATA[July  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4481225]]></guid>
			<volume>38</volume>
			<issue>4</issue>
			<startPage>510</startPage>
			<endPage>521</endPage>
			<fileSize>283</fileSize>
			<authors><![CDATA[Archibald, J. K.;Hill, J. C.;Jepsen, N. A.;Stirling, W. C.;Frost, R. L.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Navigation Technologies for Autonomous Underwater Vehicles]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4524846]]></link>
			<description><![CDATA[<para> With recent advances in battery capacity and the development of hydrogen fuel cells, autonomous underwater vehicles (AUVs) are being used to undertake longer missions that were previously performed by manned or tethered vehicles. As a result, more advanced navigation systems are needed to maintain an accurate position over a larger operational area. The accuracy of the navigation system is critical to the quality of the data collected during survey missions and the recovery of the AUV. Many different methods for navigation in different underwater environments have been proposed in the literature. In this correspondence paper, the state of the art in navigation technologies for AUVs is investigated for theoretical and operational systems. Their suitability for use in different environments is compared and current limitations of these methods are identified. In addition, new approaches to address these current problems and areas for future research are suggested. Finally, it is concluded that only geophysically referenced methods will enable AUVs to navigate accurately over large areas and that advances in underwater feature recognition are required before these methods can be implemented in operational AUVs. </para>]]></description>
			<pubDate><![CDATA[July  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4524846]]></guid>
			<volume>38</volume>
			<issue>4</issue>
			<startPage>581</startPage>
			<endPage>589</endPage>
			<fileSize>135</fileSize>
			<authors><![CDATA[Stutters, L.;Liu, H.;Tiltman, C.;Brown, D.J.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Geometric Approach to the Theory of Evidence]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4537161]]></link>
			<description><![CDATA[<para> In this paper, we propose a geometric approach to the theory of evidence based on convex geometric interpretations of its two key notions of belief function (b.f.) and Dempster's sum. On one side, we analyze the geometry of b.f.'s as points of a polytope in the Cartesian space called belief space, and discuss the intimate relationship between basic probability assignment and convex combination. On the other side, we study the global geometry of Dempster's rule by describing its action on those convex combinations. By proving that Dempster's sum and convex closure commute, we are able to depict the geometric structure of conditional subspaces, i.e., sets of b.f.'s conditioned by a given function <formula formulatype="inline"><tex>$b$</tex></formula>. Natural applications of these geometric methods to classical problems such as probabilistic approximation and canonical decomposition are outlined. </para>]]></description>
			<pubDate><![CDATA[July  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4537161]]></guid>
			<volume>38</volume>
			<issue>4</issue>
			<startPage>522</startPage>
			<endPage>534</endPage>
			<fileSize>252</fileSize>
			<authors><![CDATA[Cuzzolin, F.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Engineering Open Complex Agent Systems: A Case Study]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4539277]]></link>
			<description><![CDATA[<para> Open complex agent systems (OCAS) are becoming increasingly important in constructing problem-solving systems for enterprise applications. are challenging because they present very high system complexities involving human users and interactions with a changing environment. The existing agent-oriented software engineering (AOSE) approaches have trouble in engineering OCAS because of a number of deficiencies, e.g., lacking the capability of handling system dynamics analysis. This paper introduces an effective AOSE approach, i.e., organization- and service-oriented system analysis and design (OSOAD). It is used to extract and model system members and design a real-life OCAS system called financial trading rule automated development and evaluation (F-Trade). Through the case studies of visual and formal modeling and design of major organizational members, relations, and subsystems in F-Trade, this paper demonstrates the effective mechanisms and capabilities of the OSOAD approach. System implementation and evaluation results further show that OSOAD provides comprehensive AOSE support for engineering real-world open complex agent organizations. </para>]]></description>
			<pubDate><![CDATA[July  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4539277]]></guid>
			<volume>38</volume>
			<issue>4</issue>
			<startPage>483</startPage>
			<endPage>496</endPage>
			<fileSize>1054</fileSize>
			<authors><![CDATA[Cao, L.;Zhang, C.;Zhou, M.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Grid Implementation of a Parallel Multiobjective Genetic Algorithm for Optimized Allocation of Chlorination Stations in Drinking Water Distribution Systems: Chojnice Case Study]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4539278]]></link>
			<description><![CDATA[<para> Solving multiobjective optimization problems requires suitable algorithms to find a satisfactory approximation of a globally optimal Pareto front. Furthermore, it is a computationally demanding task. In this paper, the grid implementation of a distributed multiobjective genetic algorithm is presented. The distributed version of the algorithm is based on the island algorithm with forgetting island elitism used instead of a genetic data exchange. The algorithm is applied to the allocation of booster stations in a drinking water distribution system. First, a multiobjective formulation of the allocation problem is further enhanced in order to handle multiple water demand scenarios and to integrate controller design into the allocation problem formulation. Next, the new grid-based algorithm is applied to a case study system. The results are compared with a nondistributed version of the algorithm. </para>]]></description>
			<pubDate><![CDATA[July  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4539278]]></guid>
			<volume>38</volume>
			<issue>4</issue>
			<startPage>497</startPage>
			<endPage>509</endPage>
			<fileSize>456</fileSize>
			<authors><![CDATA[Ewald, G.;Kurek, W.;Brdys, M. A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Wise-ShopFloor: An Integrated Approach for Web-Based Collaborative Manufacturing]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4539279]]></link>
			<description><![CDATA[<para> This paper presents an integrated approach for Web-based collaborative manufacturing, including distributed process planning, dynamic scheduling, real-time monitoring, and remote control. It is enabled by a Web-based integrated sensor-driven e-ShopFloor (Wise-ShopFloor) framework targeting distributed yet collaborative manufacturing environments. Utilizing the latest Java technologies (Java 3D and Java Servlet) for system implementation, this approach allows users to plan and control distant shop floor operations based on runtime information from the shop floor. The objective of this research is to develop methodology and algorithms for Web-based collaborative planning and control, supported by real-time monitoring for dynamic scheduling. Details on the principle of the Wise-ShopFloor framework, system architecture, and a proof-of-concept prototype are reported in this paper. An example of distributed process planning for remote machining is chosen as a case study to demonstrate the effectiveness of this approach toward Web-based collaborative manufacturing. </para>]]></description>
			<pubDate><![CDATA[July  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4539279]]></guid>
			<volume>38</volume>
			<issue>4</issue>
			<startPage>562</startPage>
			<endPage>573</endPage>
			<fileSize>1668</fileSize>
			<authors><![CDATA[Wang, L.;]]></authors>
		</item>
		<item>
			<title><![CDATA[On the Equivalence of a Table Lookup (TL) Technique and Fuzzy Neural Network (FNN) With Block Pulse Membership Functions (BPMFs) and Its Application to Water Injection Control of an&#x00A0;Automobile]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4539280]]></link>
			<description><![CDATA[<para> This paper presents an alternative method to design a fuzzy neural network (FNN) using a set of nonoverlapped block pulse membership functions (BMPFs), and this FNN with nonoverlapped BPMFs will be shown to be equivalent to the conventional table lookup (TL) technique. Therefore, the hidden links between TL and FNN techniques are revealed in this paper that provides a methodology to design a TL controller based on the FNN design concept. In order to do so, a new direct formula is first developed to generate the fuzzy rules from the premise part in FNN. This direct formula not only guarantees a one-to-one mapping that maps the fuzzy membership functions onto the fuzzy rules, but also alleviates the coding effort during hardware implementation. It is further elaborated that the FNN with nonoverlapped BPMFs has the advantage of faster online training that requires less computation time, but at the cost of more memory requirement to store the fuzzy rules. The application of this new approach has been applied successfully in the water injection control of a turbo-charged automobile with excellent results. </para>]]></description>
			<pubDate><![CDATA[July  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4539280]]></guid>
			<volume>38</volume>
			<issue>4</issue>
			<startPage>574</startPage>
			<endPage>580</endPage>
			<fileSize>350</fileSize>
			<authors><![CDATA[Wang , C.-H.;Wen, J.-S.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Optimization of Industrial, Vision-Based, Intuitively Generated Robot Point-Allocating Tasks Using Genetic Algorithms]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4539496]]></link>
			<description><![CDATA[<para> Current industrial robot-programming methods require, depending on the task to be developed, an elevated degree of technical ability and time from a human operator, in order to obtain a precise, nonoptimal result. This correspondence paper presents a methodology used to generate an optimal sequence of robot configurations that enable a precise point-allocating task applicable, for instance, to spot-welding, drilling, or electronic component placement maneuvers. The optimization process starts from a nonoptimal, initial sequence designated intuitively by a human operator using an easy-to-use interface. In this correspondence paper, intuitive programming is considered as the process of defining, in a computer graphics environment and with a limited user knowledge of robotics or the industrial task, the sequence of motions that enable the execution of a complex industrial robotic maneuver. Such an initial sequence is later followed by a robot, very precisely, using a vision-based, calibration-free, robot control method. Further robot path optimization is performed with a genetic algorithm approach. An industrial robot, which is part of the experimental setup, was used in order to validate the proposed procedure. </para>]]></description>
			<pubDate><![CDATA[July  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4539496]]></guid>
			<volume>38</volume>
			<issue>4</issue>
			<startPage>600</startPage>
			<endPage>608</endPage>
			<fileSize>1417</fileSize>
			<authors><![CDATA[Loredo-Flores, A.;GonzĂ?lez-GalvĂ?n, E. J.;Cervantes-SĂ?nchez, J. J.;MartĂ?nez-Soto, A.;]]></authors>
		</item>
		<item>
			<title><![CDATA[A Survey of Glove-Based Systems and Their Applications]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4539650]]></link>
			<description><![CDATA[<para> Hand movement data acquisition is used in many engineering applications ranging from the analysis of gestures to the biomedical sciences. Glove-based systems represent one of the most important efforts aimed at acquiring hand movement data. While they have been around for over three decades, they keep attracting the interest of researchers from increasingly diverse fields. This paper surveys such glove systems and their applications. It also analyzes the characteristics of the devices, provides a road map of the evolution of the technology, and discusses limitations of current technology and trends at the frontiers of research. A foremost goal of this paper is to provide readers who are new to the area with a basis for understanding glove systems technology and how it can be applied, while offering specialists an updated picture of the breadth of applications in several engineering and biomedical sciences areas. </para>]]></description>
			<pubDate><![CDATA[July  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4539650]]></guid>
			<volume>38</volume>
			<issue>4</issue>
			<startPage>461</startPage>
			<endPage>482</endPage>
			<fileSize>1938</fileSize>
			<authors><![CDATA[Dipietro, L.;Sabatini, A M.;Dario , P.;]]></authors>
		</item>
		<item>
			<title><![CDATA[Table of Contents]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4547920]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[July  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4547920]]></guid>
			<volume>38</volume>
			<issue>4</issue>
			<startPage>C1</startPage>
			<endPage>C1</endPage>
			<fileSize>38</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
		<item>
			<title><![CDATA[IEEE Transactions on Systems, Man, and Cybernetics&mdash;Part C: Applications and Reviews publication information]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4547921]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[July  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4547921]]></guid>
			<volume>38</volume>
			<issue>4</issue>
			<startPage>C2</startPage>
			<endPage>C2</endPage>
			<fileSize>38</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=4547919&arnumber=4547922]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[July  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4547922]]></guid>
			<volume>38</volume>
			<issue>4</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 C: Applications and Reviews information for authors]]></title>
			<link><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4547923]]></link>
			<description><![CDATA[ ]]></description>
			<pubDate><![CDATA[July  2008]]></pubDate>
			<guid><![CDATA[http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=4547919&arnumber=4547923]]></guid>
			<volume>38</volume>
			<issue>4</issue>
			<startPage>C4</startPage>
			<endPage>C4</endPage>
			<fileSize>36</fileSize>
			<authors><![CDATA[]]></authors>
		</item>
	</channel>
</rss>