By Topic

# IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)

## Filter Results

Displaying Results 1 - 25 of 31

Publication Year: 2007, Page(s):C1 - 1
| PDF (43 KB)
• ### IEEE Transactions on Systems, Man, and Cybernetics—Part B: Cybernetics publication information

Publication Year: 2007, Page(s): C2
| PDF (37 KB)
• ### Special Issue on Memetic Algorithms

Publication Year: 2007, Page(s):2 - 5
Cited by:  Papers (14)
| PDF (88 KB)
• ### Coevolving Memetic Algorithms: A Review and Progress Report

Publication Year: 2007, Page(s):6 - 17
Cited by:  Papers (85)
| | PDF (235 KB) | HTML

Coevolving memetic algorithms are a family of metaheuristic search algorithms in which a rule-based representation of local search (LS) is coadapted alongside candidate solutions within a hybrid evolutionary system. Simple versions of these systems have been shown to outperform other nonadaptive memetic and evolutionary algorithms on a range of problems. This paper presents a rationale for such sy... View full abstract»

• ### An Effective PSO-Based Memetic Algorithm for Flow Shop Scheduling

Publication Year: 2007, Page(s):18 - 27
Cited by:  Papers (178)
| | PDF (376 KB) | HTML

This paper proposes an effective particle swarm optimization (PSO)-based memetic algorithm (MA) for the permutation flow shop scheduling problem (PFSSP) with the objective to minimize the maximum completion time, which is a typical non-deterministic polynomial-time (NP) hard combinatorial optimization problem. In the proposed PSO-based MA (PSOMA), both PSO-based searching operators and some specia... View full abstract»

• ### A Fast Adaptive Memetic Algorithm for Online and Offline Control Design of PMSM Drives

Publication Year: 2007, Page(s):28 - 41
Cited by:  Papers (129)
| | PDF (1716 KB) | HTML

A fast adaptive memetic algorithm (FAMA) is proposed which is used to design the optimal control system for a permanent-magnet synchronous motor. The FAMA is a memetic algorithm with a dynamic parameter setting and two local searchers adaptively launched, either one by one or simultaneously, according to the necessities of the evolution. The FAMA has been tested for both offline and online optimiz... View full abstract»

• ### A Multiobjective Memetic Algorithm Based on Particle Swarm Optimization

Publication Year: 2007, Page(s):42 - 50
Cited by:  Papers (133)
| | PDF (405 KB) | HTML

In this paper, a new memetic algorithm (MA) for multiobjective (MO) optimization is proposed, which combines the global search ability of particle swarm optimization with a synchronous local search heuristic for directed local fine-tuning. A new particle updating strategy is proposed based upon the concept of fuzzy global-best to deal with the problem of premature convergence and diversity mainten... View full abstract»

• ### Evolutionary Algorithms Refining a Heuristic: A Hybrid Method for Shared-Path Protections in WDM Networks Under SRLG Constraints

Publication Year: 2007, Page(s):51 - 61
Cited by:  Papers (22)
| | PDF (434 KB) | HTML

An evolutionary algorithm (EA) can be used to tune the control parameters of a construction heuristic to an optimization problem and generate a nearly optimal solution. This approach is in the spirit of indirect encoding EAs. Its performance relies on both the heuristic and the EA. This paper proposes a three-phase parameterized construction heuristic for the shared-path protection problem in wave... View full abstract»

• ### A Memetic Algorithm for VLSI Floorplanning

Publication Year: 2007, Page(s):62 - 69
Cited by:  Papers (82)
| | PDF (284 KB) | HTML

Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the computational point of view, VLSI floorplanning is an NP-hard problem. In this paper, a memetic algorithm (MA) for a nonslicing and hard-module VLSI floorplanning problem is presented. This MA is a hybrid geneti... View full abstract»

• ### Wrapper–Filter Feature Selection Algorithm Using a Memetic Framework

Publication Year: 2007, Page(s):70 - 76
Cited by:  Papers (158)  |  Patents (1)
| | PDF (532 KB) | HTML

This correspondence presents a novel hybrid wrapper and filter feature selection algorithm for a classification problem using a memetic framework. It incorporates a filter ranking method in the traditional genetic algorithm to improve classification performance and accelerate the search in identifying the core feature subsets. Particularly, the method adds or deletes a feature from a candidate fea... View full abstract»

• ### On the Hybridization of Memetic Algorithms With Branch-and-Bound Techniques

Publication Year: 2007, Page(s):77 - 83
Cited by:  Papers (25)
| | PDF (204 KB) | HTML

Branch-and-bound (BnB) and memetic algorithms represent two very different approaches for tackling combinatorial optimization problems. However, these approaches are compatible. In this correspondence, a hybrid model that combines these two techniques is considered. To be precise, it is based on the interleaved execution of both approaches. Since the requirements of time and memory in BnB techniqu... View full abstract»

• ### A Memetic Algorithm for Multiple-Drug Cancer Chemotherapy Schedule Optimization

Publication Year: 2007, Page(s):84 - 91
Cited by:  Papers (35)
| | PDF (368 KB) | HTML

This correspondence introduces a multidrug cancer chemotherapy model to simulate the possible response of the tumor cells under drug administration. We formulate the model as an optimal control problem. The algorithm in this correspondence optimizes the multidrug cancer chemotherapy schedule. The objective is to minimize the tumor size under a set of constraints. We combine the adaptive elitist ge... View full abstract»

• ### Implementation of an Effective Hybrid GA for Large-Scale Traveling Salesman Problems

Publication Year: 2007, Page(s):92 - 99
Cited by:  Papers (74)
| | PDF (432 KB) | HTML

This correspondence describes a hybrid genetic algorithm (GA) to find high-quality solutions for the traveling salesman problem (TSP). The proposed method is based on a parallel implementation of a multipopulation steady-state GA involving local search heuristics. It uses a variant of the maximal preservative crossover and the double-bridge move mutation. An effective implementation of the Lin-Ker... View full abstract»

• ### Estimation of the Dynamic Spinal Forces Using a Recurrent Fuzzy Neural Network

Publication Year: 2007, Page(s):100 - 109
Cited by:  Papers (20)
| | PDF (498 KB) | HTML

Estimation of the dynamic spinal forces from kinematics data is very complicated because it involves the handling of the relationship between kinematic variables and electromyography (EMG) signals, as well as the relationship between EMG signals and the forces. A recurrent fuzzy neural network (RFNN) model is proposed to establish the kinematics-EMG-force relationship and model the dynamics of mus... View full abstract»

• ### Robust Fault-Tolerant Control for a Biped Robot Using a Recurrent Cerebellar Model Articulation Controller

Publication Year: 2007, Page(s):110 - 123
Cited by:  Papers (20)
| | PDF (592 KB) | HTML

A design technique of a recurrent cerebellar model articulation controller (RCMAC)-based fault-tolerant control (FTC) system is investigated to rectify the nonlinear faults of a biped robot. The proposed RCMAC-based FTC (RCFTC) scheme contains two components: 1) an online fault estimation module based on an RCMAC is used to provide approximation information for any nonnominal behavior due to the s... View full abstract»

• ### Kernel CMAC With Improved Capability

Publication Year: 2007, Page(s):124 - 138
Cited by:  Papers (21)
| | PDF (916 KB) | HTML

The cerebellar model articulation controller (CMAC) has some attractive features, namely fast learning capability and the possibility of efficient digital hardware implementation. Although CMAC was proposed many years ago, several open questions have been left even for today. The most important ones are about its modeling and generalization capabilities. The limits of its modeling capability were ... View full abstract»

• ### A Novel Evolutionary Approach for Optimizing Content-Based Image Indexing Algorithms

Publication Year: 2007, Page(s):139 - 153
Cited by:  Papers (37)
| | PDF (888 KB) | HTML

Optimization of content-based image indexing and retrieval (CBIR) algorithms is a complicated and time-consuming task since each time a parameter of the indexing algorithm is changed, all images in the database should be indexed again. In this paper, a novel evolutionary method called evolutionary group algorithm (EGA) is proposed for complicated time-consuming optimization problems such as findin... View full abstract»

• ### The Ideal Free Distribution: Theory and Engineering Application

Publication Year: 2007, Page(s):154 - 165
Cited by:  Papers (30)
| | PDF (297 KB) | HTML

We extend the theory of the "ideal free distribution" (IFD) from theoretical ecology by providing methods to analytically find the distribution for a relatively general class of "suitability" functions. We show that the resulting IFD is a Nash equilibrium and an evolutionarily stable strategy (ESS). Moreover, we show that for a certain cost function it is a global optimum point. We introduce the "... View full abstract»

• ### Learning Automata-Based Solutions to the Nonlinear Fractional Knapsack Problem With Applications to Optimal Resource Allocation

Publication Year: 2007, Page(s):166 - 175
Cited by:  Papers (33)
| | PDF (253 KB) | HTML

This paper considers the nonlinear fractional knapsack problem and demonstrates how its solution can be effectively applied to two resource allocation problems dealing with the World Wide Web. The novel solution involves a "team" of deterministic learning automata (LA). The first real-life problem relates to resource allocation in web monitoring so as to "optimize" information discovery when the p... View full abstract»

• ### Group Decision-Making Model With Incomplete Fuzzy Preference Relations Based on Additive Consistency

Publication Year: 2007, Page(s):176 - 189
Cited by:  Papers (229)
| | PDF (352 KB) | HTML

In decision-making problems there may be cases in which experts do not have an in-depth knowledge of the problem to be solved. In such cases, experts may not put their opinion forward about certain aspects of the problem, and as a result they may present incomplete preferences, i.e., some preference values may not be given or may be missing. In this paper, we present a new model for group decision... View full abstract»

• ### An Active Vision System for Multitarget Surveillance in Dynamic Environments

Publication Year: 2007, Page(s):190 - 198
Cited by:  Papers (25)
| | PDF (437 KB) | HTML

This paper presents a novel agent-based method for the dynamic coordinated selection and positioning of active-vision cameras for the simultaneous surveillance of multiple objects-of-interest as they travel through a cluttered environment with a-priori unknown trajectories. The proposed system dynamically adjusts not only the orientation but also the position of the cameras in order to maximize th... View full abstract»

• ### A Real-Time Gaze Position Estimation Method Based on a 3-D Eye Model

Publication Year: 2007, Page(s):199 - 212
Cited by:  Papers (12)
| | PDF (618 KB) | HTML

This paper proposes a new gaze-detection method based on a 3-D eye position and the gaze vector of the human eyeball. Seven new developments compared to previous works are presented. First, a method of using three camera systems, i.e., one wide-view camera and two narrow-view cameras, is proposed. The narrow-view cameras use autozooming, focusing, panning, and tilting procedures (based on the dete... View full abstract»

• ### High-Performance Object Tracking and Fixation With an Online Neural Estimator

Publication Year: 2007, Page(s):213 - 223
Cited by:  Papers (1)
| | PDF (385 KB) | HTML

Vision-based target tracking and fixation to keep objects that move in three dimensions in view is important for many tasks in several fields including intelligent transportation systems and robotics. Much of the visual control literature has focused on the kinematics of visual control and ignored a number of significant dynamic control issues that limit performance. In line with this, this paper ... View full abstract»

• ### Self-Organized Coordinated Motion in Groups of Physically Connected Robots

Publication Year: 2007, Page(s):224 - 239
Cited by:  Papers (40)
| | PDF (1301 KB) | HTML

An important goal of collective robotics is the design of control systems that allow groups of robots to accomplish common tasks by coordinating without a centralized control. In this paper, we study how a group of physically assembled robots can display coherent behavior on the basis of a simple neural controller that has access only to local sensory information. This controller is synthesized th... View full abstract»

• ### Adaptive Critic Designs for Discrete-Time Zero-Sum Games With Application to $H_{infty}$ Control

Publication Year: 2007, Page(s):240 - 247
Cited by:  Papers (74)
| | PDF (873 KB) | HTML

In this correspondence, adaptive critic approximate dynamic programming designs are derived to solve the discrete-time zero-sum game in which the state and action spaces are continuous. This results in a forward-in-time reinforcement learning algorithm that converges to the Nash equilibrium of the corresponding zero-sum game. The results in this correspondence can be thought of as a way to solve t... View full abstract»

## Aims & Scope

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics focuses on cybernetics, including communication and control across humans, machines and organizations at the structural or neural level

This Transaction ceased production in 2012. The current retitled publication is IEEE Transactions on Cybernetics.

Full Aims & Scope

## Meet Our Editors

Editor-in-Chief
Dr. Eugene Santos, Jr.
Thayer School of Engineering
Dartmouth College