Журнал по вычислительной технике Института исследований операций (США),
Том. 17, вып. 4, 2005.
ISSN:
Publisher Information: INFORMS: Institute for Operations Research
7240 Parkway Drive Suite 310
Hanover Maryland 21076
United States of America
http://joc. pubs. informs. org/
СТАТЬИ
1.Моделирующий слой для библиотеки поддержки разработок по программированию ограничений.
A Modeling Layer for Constraint-Programming : Michel, Laurent; Van Hentenryck, Pascal. , p389-401, 13p;
Ключевые слова: C++ (Computer program language), COMBINATORIAL analysis, COMBINATORIAL optimization, ELECTRONIC data processing, LIBRARIE, PROGRAMMING languages (Electronic computers)
Author-Supplied Keywords: computer science, artificial intelligence
Abstract: Mathematical-modeling and constraint-programming languages have orthogonal strengths in stating combinatorial optimization problems. Modeling languages typically feature high-level set and algebraic notations, while constraint-programming languages provide a rich constraint language and the ability to specify search procedures. This paper shows that many of the functionalities typically found in modeling languages can be integrated elegantly in constraint-programming libraries without defining a specific language or preprocessor In particular, it presents the design of MODELER, a C++ modeling layer for constraint programming which demonstrates how to enhance the expressiveness of constraint-programming libraries and to bridge much of the gap between libraries and modeling languages. [ABSTRACT FROM AUTHOR]
Author Affiliations: 1Department of Computer Science and Engineering, University of Connecticut, Storrs, Connecticut , USA.
2Department of Computer Science, Brown University, Box 1910, Providence, Rhode Island 02912, USA.
2. Плоская декомпозиция ветвей I: мышеловка.
Planar Branch Decompositions I: The : Hicks, Illya V. , , p402-412, 11p
Ключевые слова: ALGORITHMS, DECOMPOSITION (Mathematics), GRAPH theory, NP-complete problems, ORTHOGONAL decompositions, COMPUTER systems
Author-Supplied Keywords: branchwidth, branch decomposition, carvingwidth, planar graph
Abstract: The notion of branch decompositions and its related connectivity invariant for graphs, branchwidth, were introduced by Robertson and Seymour in their series of papers that proved Wagner's conjecture. Branch decompositions can be used to solve NP-hard problems modeled on graphs, but finding optimal branch decompositions of graphs is also NP-hard. This is the first of two papers dealing with the relationship of branchwidth and planar graphs. A practical implementation of an algorithm of Seymour and Thomas for only computing the branchwidth (not optimal branch decomposition) of any planar hypergraph is proposed. This implementation is used in a practical implementation of an algorithm of Seymour and Thomas for computing the optimal branch decompositions for planar hypergraphs that is presented in the second paper. Since memory requirements can become an issue with this algorithm, two other variations of the algorithm to handle larger hypergraphs are also presented. [ABSTRACT FROM AUTHOR]
3. Плоская декомпозиция ветвей II: циклический метод.
Planar Branch Decompositions II: The Cycle : Hicks, Illya V. , p413-421, 9p;
Ключевые слова: ALGORITHMS, DECOMPOSITION (Mathematics), GRAPH theory, HYPERGRAPHS, NP-complete problems, COMPUTER systems
Abstract: This is the second of two papers dealing with the relationship of branchwidth and planar graphs. Branch-width and branch decompositions, introduced by Robertson and Seymour, have been shown to be beneficial for both proving theoretical results on graphs and solving NP-hard problems modeled on graphs. The first practical implementation of an algorithm of Seymour and Thomas for computing optimal branch decompositions of planar hypergraphs is presented. This algorithm encompasses another algorithm of Seymour and Thomas for computing the branchwidth of any planar hypergraph, whose implementation is discussed in the first paper. The implementation also includes the addition of a heuristic to decrease the run times of the algorithm. This method, called the cycle method, is an improvement on the algorithm by using a "divide-and-conquer" approach. [ABSTRACT FROM AUTHOR]
4. Оптимизации «на ходу» для программ расширенной взвешенной сети Чебышева в программировании многоцелевых сетей.
Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network : Sun, Minghe. p422-437, 16p;
Ключевые слова: ALGORITHMS, COMPUTATIONAL complexity, COMPUTER algorithms, ELECTRONIC data processing, COMPUTER programming, COMPUTER systems
Author-Supplied Keywords: multiple-objective programming, flow algorithms, multiple-criteria decision making, interactive procedures, initial solution, network-flow problems
Abstract: Three warm-start routines are developed to find initial basic feasible solutions for augmented weighted Tchebycheff network programs, subproblems derived from multiple-objective network-programming problems. In an interactive solution procedure, a series of augmented weighted Tchebycheff network programs need to be solved sequentially to find representative nondominated solutions. To speed up the solution process using the network structure of the problem, these warm-start routines start the solution process of one augmented weighted Tchebycheff network program from the optimal solution of the previous one. All three warm-start routines use the same strategy but different ways of reducing the number of basic flow variables, or equivalently increasing the number of basic nonflow variables to construct a basic solution. These warm-start routines can be used by any interactive procedures to facilitate the solution process of multiple-objective network-programming problems. A detailed example is presented. A computational experiment is conducted to compare the performance of these warm-start routines. A cold-start routine and NETSIDE, specialized software for solving network problems with side constraints, are also used as references in the experiment. These warm-start routines can save substantial computation time. [ABSTRACT FROM AUTHOR]
5. Совместно обобщаемые алгоритмы поиска глобального экстремума для множеств адресации при решении проблем дискретной оптимизации.
Simultaneous Generalized Hill-Climbing Algorithms for Addressing Sets of Discrete Optimization : Vaughan, Diane E.; Jacobson, Sheldon H.; Hall, Shane N.; McLay, Laura A. , p438-450, 13p;
Ключевые слова: COMBINATORIAL optimization, COMPUTER algorithms, COMPUTER science -- Mathematics, MATHEMATICAL optimization, OPERATIONS research, SIMULATED annealing (Mathematics)
Author-Supplied Keywords: suboptimal algorithms, probability, Markov processes, analysis of algorithms
Abstract: This paper introduces simultaneous generalized hill-climbing (SGHC) algorithms as a framework for simultaneously addressing a set of related discrete optimization problems using heuristics. Many well-known heuristics can be embedded within the SGHC algorithm framework, including simulated annealing, pure local search, and threshold accepting (among others). SGHC algorithms probabilistically move between a set of related discrete optimization problems during their execution according to a problem probability mass function. When an SGHC algorithm moves between discrete optimization problems, information gained while optimizing the current problem is used to set the initial solution in the subsequent problem. The information used is determined by the practitioner for the particular set of problems under study. However, effective strategies are often apparent based on the problem description. SGHC algorithms are motivated by a discrete manufacturing process design optimization problem (that is used throughout the paper to illustrate the concepts needed to implement a SGHC algorithm). This paper discusses effective strategies for three examples of sets of related discrete optimization problems (a set of traveling salesman problems, a set of permutation flow shop problems, and a set of MAX 3-satisfiability problems). Computational results using the SGHC algorithm for randomly generated problems for two of these examples are presented. For comparison purposes, the associated generalized hill-climbing (GHC) algorithms are applied to the individual discrete optimization problems in the sets. These computational results suggest that near-optimal solutions can be reached more effectively and efficiently using SGHC algorithms. [ABSTRACT FROM AUTHOR]
Author Affiliations: 1Los Alamos National Laboratory, Los Alamos, New Mexico 87544, USA.
2Simulation and Optimization Laboratory, Department of Mechanical & Industrial Engineering, University of Illinois, 1206 West Green Street (MC-244), Urbana, Illinois , USA.
6. Проблема нахождения медианы для значения критерия минимакса относительных потерь в сетях ЭВМ.
The Minmax Relative Regret Median Problem on : Averbakh, Igor, p451-461, 11p;
Ключевые слова: ALGORITHMS, COMPUTER algorithms, COMPUTER networks, ELECTRONIC data processing, ELECTRONIC systems, COMPUTER programming
Author-Supplied Keywords: networks facilities location, analysis of algorithms
Abstract: We consider a version of the 1-median problem on a network with uncertain weights of nodes. For each node, only an interval estimate of its weight is known. It is required to find the minmax relative regret location, i. e., to minimize the worst-case ratio of the loss in the objective-function value (opportunity loss) that may occur because a decision is made without knowing which state of nature (scenario) will take place, to the best possible value of the objective function under the realized scenario. We present a polynomial O(mn? log n) algorithm for this problem on a general network. We also present fast algorithms for networks with special structure (trees and paths). [ABSTRACT FROM AUTHOR]
Author Affiliations: 1Division of Management, University of Toronto, Scarborough, 1265 Military Trail, Scarborough, Ontario M1C 1A4, Canada.
7. Изотоническое разделение.
Isotonic : Chandrasekaran, R.; Ry, Young U.; Jacob, Varghese S.; Sungchul Hong. p462-474, 13p
Ключевые слова: COMPUTER algorithms, COMPUTER networks, DIAGNOSIS, ELECTRONIC systems, ISOTONE shift, LINEAR programming
Author-Supplied Keywords: isotonic separation, linear programming, network programming, outcome prediction, data classification
Abstract: Data classification and prediction problems are prevalent in many domains. The need to predict to which class a particular data point belongs has been seen in areas such as medical diagnosis, credit rating, Web filtering, prediction, and stock rating. This has led to strong interest in developing systems that can accurately classify data and predict outcome. The classification is typically based on the feature values of objects being classified. Often, a form of ordering relation, defined by feature values, on the objects to be classified is known. For instance, the objects belonging to one class have larger (or smaller) feature values than do those in the other class. Exploiting this characteristic of isotonicity, we propose a data-classification method called isotonic separation based on linear programming, especially network programming. The paper also addresses an extension of the isotonic-separation method for continuous outcome prediction. Applications of the isotonic separation for discrete outcome prediction and its extension for continuous outcome prediction are shown to illustrate its applicability. [ABSTRACT FROM AUTHOR]
Author Affiliations: 1School of Engineering and Computer Science, P. O. Box The University of Texas, Dallas, Richardson, Texas , USA.
2School of Management, P. O. Box SM 33, The University of Texas, Dallas, Richardson, Texas, USA.
3School of Management, P. O. Box SM 40, The University of Texas, Dallas, Richardson, Texas , USA.
4Department of Computer Science and Information Sciences, Towson University, 8000 York Road, Stephens Hall, Room 314, Towson, Maryland 21252, USA.
8. Эвристический подход к определению Винера в основанных на правилах комбинаторных аукционах.
A Heuristic for Winner Determination in Rule-Based Combinatorial : Jones, Joni L.; Koehler, Gary J. p475-489, 15p;
Ключевые слова: AUCTIONS, COMBINATORIAL analysis, COMPUTATIONAL complexity, COMPUTER algorithms, COMPUTER networks, NP-complete problems
Author-Supplied Keywords: combinatorics, bidding-auctions, branch-and-bound, heuristic
Abstract: Combinatorial auctions address the sale of materials where there exist complementarities between items. A major stumbling block to the widespread use of combinatorial auctions is the complexity of the winner - determination problem, which is known to be NP-complete. We consider a rich version of combinatorial auctions, rule-based combinatorial auctions, where bids consist of rules that describe acceptable bundles rather than provide complete enumerations of acceptable bundles. This makes the winner-determination problem potentially harder because the problem must find bundles meeting bid criterion as well as finding an optimal selection of winning bids. This paper describes in detail a heuristic that achieves a satisfying solution to the winner-determination problem for large problems where exact solutions may not be attainable. Our contribution is threefold. First, we give a general approach to providing good approximations to the winner-determination problem for rule-based auctions. Although the approach requires adaptation for specific instances, it is conceptually tractable and implementable. Second, the approach is illustrated and tested on an auction format for selling prime-time television advertising time formed from data and interviews with industry sources. Third, while some researchers have used commercial solvers that appeared to obviate the need for specialized solution approaches to the winner-determination problem, we give evidence that, at least for the problem studied here, specialized approaches are necessary. [ABSTRACT FROM AUTHOR]
Author Affiliations: 1Information Systems and Decision Sciences, College of Business Administration, University of South Florida, 4202 East Fowler Avenue, Tampa, Florida , USA.
2John B. Higdon Eminent Scholar, Warrington College of Business, University of Florida, Gainesville, Florida 32611, USA.
3Professor of Decision and Information Sciences, Warrington College of Business, University of Florida, Gainesville, Florida 32611, USA.
Международный журнал «Интеллектуальные автоматизированные системы, основанные на знаниях», IOS Press, Голландия.
Том 9, вып.4, декабрь 2005
International Journal of Knowledge Based Intelligent Engineering Systems
ISSN:
Publisher Information: IOS Press
Nieuwe Hemweg 6B
Amsterdam 1013 BG
Netherlands
http://www. iospress. nl/
СТАТЬИ
1. Специальный выпуск: Избранные доклады, сделанные на 8-й международной конференции «Исследовательская информация, основанная на знаниях, и инжиниринг систем»
Special Issue: Selected papers from the KES2004 : Howlett, Robert J.; Negoita, Mircea Gh. , p261-261, 1p;
Special Issue: Selected papers from the KES2004 conference.
Ключевые слова: ARTIFICIAL intelligence, CONGRESSES & conventions, EXPERT systems (Computer science), INFORMATION technology
Geographic Terms: NEW Zealand, WELLINGTON (N. Z.)
Abstract: The article highlights the Eighth International Conference on Knowledge Based Intelligent Information and Engineering Systems (KES) held September 2004 at the Intercontinental Hotel in Wellington, Zealand. The event was hosted by the Wellington Institute of Technology. KES 2004 aimed to provide a high-tech forum for the presentation of recent research into the theory and applications of intelligent systems and techniques.
Author Affiliations: 1Intelligent Systems and Signal Processing Research Group, University of Brighton, UK
2Centre for Computational Intelligence, Wellington Institute of Technology, New Zealand
2. Подход, основанный на извлечении данных, к оптимизации эффективности зажигания в циркуляционном жидкостном бойлере.
Optimizing combustion efficiency of a circulating fluidized boiler: A data mining : Kusiak, Andrew; Burns, Alex; Milster, Ferman. , p263-274, 12p
Ключевые слова: ALGORITHMS, ARTIFICIAL intelligence, BOILERS, EXPERT systems (Computer science), MACHINE learning, MACHINE theory
Author-Supplied Keywords: Power control, efficiency optimization, knowledge engineering, circulating fluidized boiler, machine learning
Abstract: A data mining approach was applied to analyze relationships among 54 parameters of a circulating fluidized-bed boiler. Knowledge was extracted from the data by machine learning algorithms. The extracted knowledge was used to determine ranges of process parameters (control signatures) that led to the increased efficiency of the combustion process. The research has shown that the efficiency can be predicted to the same degree of accuracy with and without the data describing the fuel composition or boiler demand levels. This discovery might have profound impact on the research directions in optimization of the energy production. Adjusting parameters of the control system has led to improved efficiency of the combustion process. The proposed data mining approach is applicable to different types of burners and fuel types. It is well suited to perform tradeoff analysis between various performable measures, e. g., efficiency and emissions. [ABSTRACT FROM AUTHOR]
Author Affiliations: 1Department of Mechanical and Industrial Engineering, University of Iowa, Iowa City, IA 52242 – 1527, USA
2University of Iowa Power Plant, University of Iowa, Iowa City, IA 52242, USA
3. Обучающаяся система для оценки ритмических особенностей звуков.
Machine learning system for estimating the rhythmic salience of : Kostek, Bozena; Wojcik, Jaroslaw. , p275-284, 10p;
Ключевые слова: ARTIFICIAL intelligence, MACHINE learning, MUSIC, RHYTHM, SELF-organizing systems, SOUNDS
Abstract: This article describes experimental work carried out in attempt to improve the effectiveness of musical rhythm retrieval systems. The authors define basic notions in the area of hierarchical rhythm retrieval and describe a procedure for inducing rhythmic hypotheses in a given melody. Utilizing an approach commonly used in the data mining domain, an association rule model has been applied to estimate the rhythmic salience of sounds based on the physical attributes of duration, frequency and amplitude. On the basis of the knowledge obtained by the machine learning system, the authors propose five functions to rank sounds according to their tendency to be located in accented positions in a melody. Adapted precision and recall measures were used to validate the proposed functions and conduct experimental verification. Conclusions derived from the results of the experiments have also been presented. [ABSTRACT FROM AUTHOR]
Author Affiliations: 1Gdansk University of Technology, Multimedia Systems Department Narutowicza 11/12, 80952 Gdansk, Poland
2Wroclaw University of Technology, Department of Information Systems, Wybrzeze Wyspianskiego 27, 50-370 Wroclaw, Poland
4. Точность в системах «мечения – антимечения»: характеристика жесткости температурных условий для выживаемости при превышении допустимых значений.
The fidelity of the tag-antitag system: Characterization of the stringent temperature for robustness in the excess : Rose, John A.. , p285-292, 8p;
Ключевые слова: BIOTECHNOLOGY, EXPERT systems (Computer science), SYSTEM design, DNA microarrays, BIOCHIPS
Abstract: The importance of DNA microarrays and Tag-Antitag (TAT) systems in biotechnology and DNA computing has prompted the development of various approaches for high-fidelity design, including analytical methods based on an ensemble average error probability per conformation, or computational incoherence (ℇ). Although system biasing for dilute input has been reported to allow the attainment of high fidelity, recently a sharp pseudo-phase transition from the low-error ℇ-behavior predicted for dilute inputs, to a high-error ℇ-behavior was predicted to accompany an asymmetric (i. e., single-tag) excess input. This error-response, likely to be the critical test of TAT system robustness for DNA-based computing applications that employ multiple merge operations and/or non-linear amplification, is here examined more closely, via derivation of an approximate closed-form expression, ℇ_{e(i)} for the single-tag, excess input. The temperature-dependence of this expression is characterized, and applied to derive an expression for a novel TAT system error-parameter, T^{†}_i which defines the temperature of minimal ℇ_{e(i)}. T^{†}_i is taken to provide a more precise definition of the stringent reaction temperature previously discussed conceptually in the literature. A similar analysis is also undertaken for a uniform excess multi-tag input, which indicates the absence of an accompanying pseudo-phase transition in ℇ. The validity of ℇ_{e(i)} is discussed via simulation, with comparison to the predictions of the general model. Applicability of T^{†}_i to both TAT system design and selection of a reaction temperature optimally robust to an asymmetric excess input is discussed.
Author Affiliations: 1Department of Computer Science, University of Tokyo, Bunkyo-ku, Hongo 7-3-1, Tokyo , Japan
5. Распределенное размещение ресурсов посредством серии локальных выборов: исследование случая размещения рабочей силы.
Distributed resource allocation via local choices: A case study of workforce : Ursu, Marian F.; Virginas, Botond; Owusu, Gilbert; Voudouris, Chris. , p293-301, 9p; (
Ключевые слова: EXPERT systems (Computer science), MANAGEMENT, OPERATIONS research, PERSONNEL management, RESOURCE allocation
Abstract: This paper describes a solution to workforce allocation, modelled as a distributed system. The novelty of the solution resides in the fact that it is a natural and versatile formulation that combines an agent-based model with rule-based expressions of allocation strategies and multi-criteria optimisation expressions of allocation objectives. The problem space is structured on disjoint domains. Each domain has two agents: one in charge of its engineers and one in charge of its jobs. In the implemented system, agents have complete decision power over the allocation of their resources/requirements. However, the general solution is readily extendable towards the inclusion of central agents with specialist roles. Workforce allocation is modelled here as an iterative communication process, based on a 4-step communication protocol, between workforce/engineers' agents, on one hand, and jobs agents, on the other. Choices (decisions) regarding the allocation are made locally, within each agent. A global allocation emerges from this interaction/communication. The paper describes the context of this solution (including the problem description), the general model and solution, and specific implementations. The latter illustrate the emergence of good global solutions from the distributed algorithm. [ABSTRACT FROM AUTHOR]
Author Affiliations: 1Department of Computing, Goldsmiths College, University of London, London, SE14 6NW, UK
2Intelligent Systems Lab, BT Exact, Adastral Park, Ipswich, IP5 3RE, UK
6. Управление контекстуальным знанием в пиринговых системах: применительно к мобильным играм с несколькими игроками и робототехнике.
Contextual knowledge management in peer to peer computing: Applications to mobile-multiplayer games and : Murthy, V. K.. , , p303-314, 12p;
Ключевые слова: CLIENT/SERVER computing, COMPUTER network architectures, ROBOTICS, KNOWLEDGE management, COMPUTER systems, PEER-to-peer architecture (Computer networks)
Abstract: In the pervasive computing environment consisting of peers (a generic name for clients, servers or agents), context - awareness plays an important role to offer personalized services for various applications, e. g., medical services, robotics, travel planning, security monitoring, and multi-player gaming. Accordingly, context management turns out to be an important issue in manipulating, acquiring information and reacting to the situation. In this paper, we describe a contract-based workflow paradigm to support long and short duration transactions in a context-aware pervasive computing environment. This paradigm provides for software contract that captures mutual obligations using program constructs such as "require [else]" for precondition and "ensure [then]" for post condition, assertions, invariants needed in the pervasive computing environment. Such program constructs are essential to deal with the uncertain nature of connectivity of pervasive devices and networks, and the trial-error (subjunctive) nature of the processes and the programs used in E-commerce, robotics and multi-player gaming. [ABSTRACT FROM AUTHOR]
Author Affiliations: 1School of Business Information Technology, RMIT University, Melbourne, Victoria 3000, Australia
7. Система поддержки принятия решений на грид.
Decision support system on the : Ong, M.; Ren, X.; Allan, G.; Kadirkamanathan, V.; Thompson, H. A.; Fleming, P. J., p315-326, 12p;
Ключевые слова: AIR-engines, AIRPLANES -- Motors, COMPUTER science, ENGINES, EXPERT systems (Computer science), DATA warehousing
Abstract: Aero-engines are extremely reliable machines and operational failures are rare. However, currently great effort is being put into reducing the number of in-flight engine shutdowns, aborted take-offs and flight delays through the use of advanced engine health monitoring technology. This represents a benefit to society through reduced delays, reduced anxiety and reduced cost of ownership of aircraft. This is reflected in a change of emphasis within aero-engine companies where, instead of selling engines to customers, there is a fundamental shift to adoption of power-by-the-hour contracts. In these contracts, airlines make fixed regular payments based on the hours flown and the engine manufacturer retains responsibility for maintaining the engine. To support this new approach, improvements in in-flight monitoring of engines are being introduced with the collection of much more detailed data on the operation of the engine. At the same time advances have been made in Internet technologies providing a worldwide network of computers that can be used to access and process that data. The explosion of available knowledge within those large datasets also presents its own problems and here it is necessary to work on advanced decision support systems to identify the useful information in the data and provide knowledge-based advice between individual aircraft, airline repair and overhaul bases, world-wide data warehouses and the engine manufacturer. This paper presents a practical framework in which to build such a system that is inherent in the emerging Grid computing paradigm that provides the necessary computing resources. A demonstrator system already developed and implemented in the UK E-Science Grid project, DAME, is introduced. [ABSTRACT FROM AUTHOR]
8. Автоматическая генерация базы нечетких правил для распознавания символов, вводимых от руки в режиме «он-лайн».
Automatic fuzzy rule base generation for on-line handwritten alphanumeric character : Ranawana, Romesh; Palade, Vasile; Bandara, G. E.M. D.C.. , , p327-339, 13p;
Ключевые слова: COMPUTER science, EXPERT systems (Computer science), FUZZY logic, FUZZY systems, PATTERN recognition systems
Abstract: The main challenge in handwritten character recognition involves the development of a method that can generate descriptions of the handwritten objects in a short period of time. Due to its low computational requirement, fuzzy logic is probably the most efficient method available for on-line character recognition. The most tedious task associated with using fuzzy logic for online character recognition involves the building of the rule-base that would describe the characters to be recognized. This problem is further complicated by the fact that different people write the same character in completely different ways. This paper describes a method that can be used to automatically generate a database containing the fuzzy membership values that describe the characters written by different individuals. [ABSTRACT FROM AUTHOR]
Author Affiliations: 1University of Oxford, Computing Laboratory Parks Road, Oxford OX1 3QD, UK
2Faculty of Engineering, University of Peradeniya, Peradeniya, Sri Lanka
9. Применение нечеткой логики при моделировании движения двуногого робота.
Use of fuzzy system in modeling of biped walking : Dongwon Kim; Nak-Hyun Kim; Sam-Jun Seo; Gwi-Tae Park. , p341-349, 9p;
Ключевые слова: AUTOMATION, FUZZY systems, ROBOTICS, ROBOTS, ROBOTS -- Control systems
Abstract: Practical biped walking robot is presented in this paper. The biped walking robot is a popular research area in robotics because of the high adaptability of a walking robot in an unstructured environment. However, lots of circumstances which have to be taken into account make the biped robot control a challenging task. For the stability of the biped walking robot, the zero moment point (ZMP) trajectory in the robot foot support area is a significant criterion. If the ZMP during walking can be measured, it is possible to realize stable walking and to stably control the biped robot by the use of the measured ZMP. So actual ZMP data are measured in real time situations from practical biped walking robot and the obtained ZMP data are modeled by fuzzy system to explain empirical laws of the the simulation results, the fuzzy system can be effectively used to model practical biped walking robot. [ABSTRACT FROM AUTHOR]
Author Affiliations: 1Department of Electrical Engineering, Korea University, 1, 5-Ka Anam-Dong, Seongbuk-Gu, Seoul 136-701, Korea
2Department of Electrical & Electronic Engineering, Anyang University, 708-113, Anyang 5dong, Manan-gu, Anyang-shi, Kyunggi-do, 430-714, Korea
10. Он-лайновая поддержка ориентации в условиях ситуационного управления движением.
On-line update of situation assessment: A generic : Gorodetsky, Vladimir; Karsaev, Oleg; Samoilov, Vladimir., p351-365, 15p;
Ключевые слова: ARTIFICIAL intelligence, COMPUTER algorithms, COMPUTER architecture, COMPUTER engineering, EXPERT systems (Computer science), COMPUTER systems
Abstract: Situation is an abstraction that characterizes a complex system consisting of semi-autonomous objects striving to achieve certain particular goals (sequences of goals) and operating in a coordinated mode controlled by a meta-goal of the system on the whole. Situation and objects are discriminated by their "states" taking values from finite sets of classes' labels. Situation assessment, which is the topmost task in many practically important applications, is a classification task aimed at assessing the situation current state and assigning a class label to the situation. The paper covers certain key issues of the situation assessment problem. It analyses formal frameworks proposed for specification of the situation models, and highlights a number of challenging problems associated with situation assessment, the most crucial of which is caused by the peculiarities of input data used for situation assessment, which are a superposition of asynchronous discrete streams of heterogeneous data received from multiple sources and having finite "life time". The paper is focused on the approaches and algorithms intended for on-line updating of the situation assessment, on the situation assessment systems generic architecture and on the demonstration of the proposed techniques and architecture using a computer assurance system solving anomaly detection task. [ABSTRACT FROM AUTHOR]
Author Affiliations: 1St. Petersburg Institute for Informatics and Automation, 39, 14-th Liniya, St. Petersburg, Russia
«Интегрированные производственные системы», IOS Press, Голландия.
Том 12, вып. 4., 2005.
Integrated Computer-Aided Engineering
ISSN:
Publisher Information: IOS Press
Nieuwe Hemweg 6B
Amsterdam 1013 BG
Netherlands
http://www. iospress. nl/
СТАТЬИ
1. Обнаружение итеративной симметрии: сопоставление возможностей сжатия и алгоритма прореживания (децимации) при обработке изображений.
Iterative symmetry detection: Shrinking vs. decimating : Di Gesu, Vito; Zavidovique, Bertrand. p319-332, 14p, 4 diagrams, 2 graphs;
Ключевые слова: ENGINEERING, MATHEMATICS, PYRAMID (Geometry), SYMMETRY, DIGITAL Object Identifiers
Author-Supplied Keywords: Symmetry transforms, mathematical morphology, multi-resolution, feature extraction
Abstract: This paper introduces a new mechanism that consists of applying a symmetry operator on an iteratively transformed version of the input image. The nature of the transformation characterizes the operator. Here, we consider the Object Symmetry Transform combined with the morphological operator erosion and the pyramid decimation respectively. The derived operators have been applied on both binary and gray levels images, comparing their ability to grasp the internal structure of a digital object. We present some experiments to evaluate their performances and check them for result quality versus computing complexity. [ABSTRACT FROM AUTHOR]
Author Affiliations: 1DMA, Palermo University, 90123 Palermo, Italy
2IEF, University of Paris XI, 91405 Orsay, France
2. Трехмерное измерение с использованием узора из разноцветных полос при сканировании за один проход.
3D profile measurement using color multi-line stripe pattern with one shot : Sinlapeecheewa, Chanin; Takamasu, Kiyoshi. p333-341, 9p, 2 charts, 6 diagrams
Ключевые слова: CALIBRATION, COMPUTER vision, DATABASES, PROJECTION, TRIANGULATION
Abstract: In this paper, we present a new technique of taking a 3D profile measurement using colored structured lighting projection. A pattern of colored stripes was projected onto an object when taking images with cameras from various angles, and then all possible available match information was provided from the acquired images and database of the projection pattern. A correct match was then obtained from the possible available match information by solving the matching problem. The 3D profile was then reconstructed by means of triangulation. The advantage of using color in the pattern is that it simplified the difficult problem of matching using a multiple-line stripe pattern. A systematic color selection procedure was developed. Colors used to generate a color-stripe pattern were selected on a trial for many colors. The problem of finding the correct color stripe correspondence between the light source and images was solved. However, solving the problem required accurate calibration of the system parameters. A technique for camera-projector calibration using calibration points that projected from a projector is presented in this paper. The mean error of the calibration was about 0.2 mm. [ABSTRACT FROM AUTHOR]
Author Affiliations: 1Department of Precision Engineering, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo, Japan
3. Архитектура реального времени для построения системы обнаружения на трассе транспортного средства.
Real-time architecture for a highway vehicle detection : Zhaoqing Wang; Nestinger, Stephen S.; Cheng, Harry H.; Palen, Joe. , p343-352, 10p, 8 diagrams
Ключевые слова: ARCHITECTURE, LASERS, SIGNAL detection, TRANSPORTATION, VEHICLES
Abstract: A three layer real-time architecture for a highway vehicle detection system is presented in the article. The Laser-Based Detection System (LBDS), focused on helping the Intelligent Transportation System (ITS), measures a key quantitative parameter of vehicles moving across a link of highway, namely, travel time. Travel time is based upon identifying and re-identifying vehicles at various points on the highway. This article provides a method to collect hard real-time signals from an active laser source in the LBDS and calculate real-time vehicle parameters using a standard computer. A method of seamlessness message exchange between a hard real-time kernel process, for real-time data acquisition, and a soft real-time application process, for computing and displaying, is given under the RTLinux environment. Experimental results from field tests show that the application of the real-time architecture to the LBDS provides vehicle parameter calculations deterministically. Experimental data are analyzed using the Video Sync program with both video images and graphical display. [ABSTRACT FROM AUTHOR]
Author Affiliations: 1Integration Engineering Laboratory, Department of Mechanical and Aeronautical Engineering, University of California, Davis, CA 95616, USA
2Office of New Technology and Research, California Department of Transportation, Box MS 83, Sacramento, CA 94273, USA
4. Имитация виртуального окружения для исследования кооперативных робототехнических систем.
A simulation-based virtual environment to study cooperative robotic : Hu, Xiaolin; Zeigler, Bernard P.. , p353-367, 15p, 9 diagrams;
Ключевые слова: ROBOTICS, SIMULATION methods, SYSTEM design, COMPUTER systems, SCALABILITY
Abstract: Simulation plays important roles in experimenting with, understanding, and evaluating the performance of cooperative robotic systems. Typically, simulation-based studies of robotic systems are conducted on the computer, without involving any real system components. This paper presents a new hybrid approach to simulation that allows real robots as well as robot models to work together in a simulation-based virtual environment. This capability of robot-in-the-loop simulation effectively bridges conventional simulation and real system execution, augmenting them to constitute an incremental study and measurement process. It is especially useful for large-scale cooperative robotic systems whose complexity and scalability severely limit experimentations in a physical environment using real robots. We present the architecture of this simulation-based virtual environment that, together with an incremental study process and associated experimental frames, can support systematic analysis of cooperative robotic systems. An example of robotic convoy is provided. Some measurement metrics are developed and simulation results are described. An experimental setup for robot-in-the-loop simulation is discussed. [ABSTRACT FROM AUTHOR]
Author Affiliations: 1Department of Computer Science, Georgia State University, 34 Peachtree Street, Suite 1450, Atlanta, GA 30303, USA
2Arizona Center for Integrative Modeling and Simulation, Electrical & Computer Engineering Department, University of Arizona, 1230 E. Speedway Blvd, Tucson, AZ , USA
5. Проектирование схемы синтеза устройств низкой мощности, работающих при различном напряжении, в условиях ограничений по времени и ресурсам.
Multiple voltage synthesis scheme for low power design under timing and resource : Wang, Ling; Jiang, Yingtao; Selvaraj, Henry. , p369-378, 10p, 2 charts, 1 diagram, 2 graphs
Ключевые слова: ALGORITHMS, ELECTRIC currents, ELECTRIC power, ELECTRIC power consumption, SCHEDULING
Abstract: In this paper, a tabu-search-based behavior level synthesis scheme is proposed to minimize chip power consumption with resources operating at multiple voltages under the timing and resource constraints. Unlike the conventional methods where only scheduling is considered, our synthesis scheme considers both scheduling and partitioning simultaneously to reduce power consumption due to the functional units as well as the interconnects among them. More importantly, our approach tends to efficiently address a few practical layout problems inherent to multiple voltage designs. In particular, we have configured our solutions as a three-tuple vector to account for both the schedule and the partition. Cycling of the same solutions is prevented by applying a tabu list with an update mechanism enhanced with an aspiration function. In this way, the algorithm can search a large solution space with modest computation effort and fast convergence rate. Experiments with a number of DSP benchmarks show that the proposed algorithms achieve an average power reduction by 49.6% [ABSTRACT FROM AUTHOR]
Author Affiliations: 1Department of Computer Science and Technology, Harbin Institute of Technology, Harbin China
2Department of Electrical and Computer Engineering, University of Nevada, Las Vegas, NV 89154, USA
6. Позиционирование макро-ячейки при проектировании аналоговых физических устройств с использованием гибридного генетического алгоритма и имитации отжига.
Macro-cell placement for analog physical designs using a hybrid genetic algorithm with simulated : Lihong Zhang; Raut, Rabin; Yingtao Jiang; Kleine, Ulrich; Kim, Yoohwan. , p379-396, 18p, 4 charts, 9 diagrams, 2 graphs;
Ключевые слова: COMPUTER engineering, GENETIC algorithms, INTEGRATED circuits, MATHEMATICAL optimization, SIMULATED annealing (Mathematics)
Author-Supplied Keywords: simulated annealing, placement, analog integrated circuits, physical design
Abstract: Practical analog layout synthesis techniques have been the subject of active research for the past two decades to address the growing gap between the increasing chip functionality and the design productivity. In this paper, we present a novel macro-cell placement approach following the optimization flow of a genetic algorithm controlled by the methodology of simulated annealing. A process of cell slide is adopted to drastically reduce the configuration space without degrading search opportunities. In addition, this cell-slide process is used to satisfy the symmetry constraints essential for analog layouts. Furthermore, the dedicated cost function captures subtle electrical and geometrical constraints, such as area, net length, aspect ratio, proximity, parasitic effects, etc. required for analog layout and subsequent intellectual property reuse. To study the algorithm parameters, fractional factorial experiments and a meta-GA approach are employed. The proposed algorithm has been tested using several analog pared to the simulated-annealing approach, the dominant one currently used for the analog placement problem, the proposed algorithm requires less computation time while generating higher quality layouts, comparable to expert manual placements. Furthermore, our hybrid algorithm and the method of parameter optimization can be readily adapted to different optimization problems across disciplines. [ABSTRACT FROM AUTHOR]
Author Affiliations: 1Department of Electrical and Computer Engineering, Concordia University, 1455 de Maisonneuve Blvd. West, Montreal, Canada
2Department of Electrical and Computer Engineering, University of Nevada, 4505 Maryland Parkway, Las Vegas, NV, USA
3Department of Electrical and Information Engineering, Otto-von-Guericke University of Magdeburg, PO Box 4120, D-39016 Magdeburg, Germany
4Department of Computer Science, University of Nevada, 4505 Maryland Parkway, Las Vegas, NV, USA
Журнал «Информационное общество», Великобритания.
Том 21, вып. 5, ноябрь 2005.
Information Society
ISSN:
Publisher Information: Routledge
4 Park Square
Milton Park
Abingdon
Oxfordshire OX14 4RN
United Kingdom
http://www. tandf. co. uk/journals/tf/.html
СТАТЬИ
1. Воздействие глобализации на использование электронной коммерции и эффективность функционирования коммерческих организаций: исследование в рамках одной страны.
Impacts of Globalization on E-Commerce Use and Firm Performance: A Cross-Country : Kraemer, Kenneth L.; Gibbs, Jennifer; Dedrick, Jason. p323-340, 18p, 7 charts, 1 diagram, 3 graphs
Ключевые слова: BUSINESS, BUSINESS enterprises, INFORMATION technology, ELECTRONIC commerce, GLOBALIZATION, ECONOMIC trends
Author-Supplied Keywords: B2B, B2C, cross-country
Abstract: This article develops and tests a model examining the relationship between firm globalization, scope of e-commerce use, and firm performance, using data from a large-scale cross-country survey of firms from three industries. We find that globalization leads to both greater scope of e-commerce use and improved performance, measured as efficiency, coordination, and market impacts. Scope of e-commerce use also leads to greater firm performance of all three types. Globalization has differential effects on B2B and B2C e-commerce, however, such that highly global firms are more likely to do B2B but less likely to do B2C. Our findings provide support for Porter's (1986) thesis that upstream business activities (namely, B2B) are more global while downstream business activities (B2C) are more local or multidomestic.
Author Affiliations: 1University of California, Irvine, Irvine, California, USA
2. Что за Интернет-политика? Оценка региональных инициатив в Испании.
Which Internet Policy? Assessing Regional Initiatives in : Jordana, Jacint; Fernandez, Xavier; Sancho, David; Welp, Yanina. , , p341-351, 11p, 6 charts
Ключевые слова: INFORMATION technology, INTERNET, POLITICAL planning, INTERNET users, INFORMATION & communication technologies
Geographic Terms: SPAIN
Author-Supplied Keywords: ICT policy, policy coordination, policy instruments, regional policy, strategic planning
Abstract: We examine the effect of public policy on the growth of Internet use. Using a decentralized country—Spain—as an example, we compare the 17 Spanish regions to test different Internet policy designs, taking into account the quality and number of specific programs promoted by regional governments, as well as the presence or absence of strategic planning in each region. We treat the percentage of Internet users as a dependent variable to compare its diffusion in different territories. Our findings show that educational levels and economic differences explain about half of the variations observed. Furthermore, the regional policies play a significant role in explaining regional variations. We investigate which public policy instruments are more significant for the development of the Internet, and find that focused policy intervention and complex policy initiatives are more significant than other policy instruments in explaining the increase in the percentage of Internet users.
Author Affiliations: 1Department of Political and Social Sciences, Universitat Pompeu Fabra, Ramon Trias Fargas, Barcelona, Spain
2Internet Interdisciplinary Institute, Universitat Oberta de Catalunya, Barcelona, Spain
3. Объяснение возможностей подключения к Интернет (анализ сотрудничества конкурирующих Интернет-провайдеров).
Explaining Internet : Mah, Daniel C. H.. , , p353-366, 14p, 1 diagram
Ключевые слова: BUSINESS enterprises, COMPETITION, INTERNET, TELECOMMUNICATION, INTERNET service providers
Geographic Terms: UNITED States
Author-Supplied Keywords: early telephone industry, instant messaging, interconnection regulation, Internet, network externalities, network effects, network interconnection, online services
Abstract: This article provides a framework by which rival firms' incentives for interconnection in unregulated telecommunications markets may be analyzed and argues that the widespread voluntary interconnection observed among Internet service providers (ISPs) is anomalous when compared with examples of other similar markets from U. S. industrial history. However, the fact that it is anomalous provides an opportunity to test common explanations and to explore new explanations for the remarkable connectivity observed among ISPs through a comparative analysis. The comparative analysis reveals that (1) network effects and competitive forces in telecommunications markets will not necessarily drive firms to interconnect their networks voluntarily as there are other options to them, and (2) government actions played an important role in shaping the interconnection behavior competing firms in telecommunications markets. The article then explores some of the implications of these findings for telecommunications policy, and interconnection regulation in particular.
Author Affiliations: 1J. S.D., Stanford University, California and Associate, Steptoe & Johnson LLP, Washington, D. C.
4. Идентификация, защита прав частной жизни пользователей и электронное правительство.
Authentication, Privacy, and the Federal : Holden, Stephen H.; Millett, Lynette I.. , , p367-377, 11p, 1 diagram;
Ключевые слова: ADMINISTRATIVE agencies, AUTHENTICATION, PUBLIC law, TECHNOLOGY, INTERNET in public administration, GOVERNMENT policy
Author-Supplied Keywords: authentication, e-government, federal law, privacy
Abstract: As federal agencies move toward more sophisticated e-govern - ment offerings, they must consider both policy and operational requirements for electronic authentication (e-authentication). One important consideration in designing and deploying e-authentica- tion solutions is the balance between access, security, authentication, and privacy. Public law and government-wide policy encourage e-government and e-authentication simultaneously with privacy protection, creating policy and operational tensions for e-government efforts. A review of the relevant laws and policies and analyses of the privacy implications of authentication technologies indicates that federal agencies have at least two analytic frameworks for balancing privacy concerns with e-authentication. A framework offered in the 2003 National Research Council report Who Goes There? and the privacy impact analysis requirements of the E-Government Act of 2002 provide e-government projects with the tools for navigating the path between privacy and openness, required by both e-government law and policy.
Author Affiliations: 1Department of Information Systems, University of Maryland—Baltimore County, Baltimore, Maryland, USA
2Computer Science and Telecommunications Board, The National Academies, Washington, DC, USA
5. Обеспечение самодостаточности общественной сети: будущее высотного здания, охваченного локальной сетью.
Making a Community Network Sustainable: The Future of the Wired High : Hopkins, Liza. , , p379-384, 6p, 1 chart;
Ключевые слова: PUBLIC housing, TELEMATICS, ELECTRONIC villages (Computer networks), DIGITAL divide, INFORMATION & communication technologies
Geographic Terms: MELBOURNE (Vic.)VICTORIA
Author-Supplied Keywords: digital divide, networked community, sustainability, underserved populations, wired community
Abstract: Much time and money has been committed by governments, private business, and the third sector over the last 5 years in establishing opportunities for underserved populations to gain access to new forms of information and communication technologies, in an effort to overcome the so-called “digital divide.” This article traces the efforts that have been made to establish a networked community at a single high-rise public housing estate in inner Melbourne, Australia, and considers some of the potential opportunities for and barriers to ensuring the continuity of the network, which is large, complex, costly, and potentially fragile, into the future.
Author Affiliations: 1Institute for Social Research, Swinburne University, Hawthorn, Victoria, Australia
6. Обзор книги “Asia.Com: азиатское вторжение в Интернет”
A Review of: “: Asia Encounters the Internet”. By: Baber, Zaheer. , , p385-386, 2p;
Ключевые слова: BOOKS -- Reviews, INFORMATION resources, NONFICTION
Reviews & Products: : Asia Encounters the Internet (Book)
People: HO, K. C, KLUVER, Randolp, YANG, Kenneth C. C.
Abstract: Reviews the book ": Asia Encounters the Internet," edited by K. C. Ho, Randolph Kluver and Kenneth C. C. Yang.
Author Affiliations: 1Department of Sociology, University of Toronto, Toronto, Canada
7. 6. Обзор книги “Государственная машина: революционная история компьютера”
A Review of: “The Government Machine: A Revolutionary History of the Computer”. By: Bellamy, Christine. p387-388, 2p;
Ключевые слова: BOOKS -- Reviews, NONFICTION, INFORMATION processing
Reviews & Products: GOVERNMENT Machine: A Revolutionary History of the Computer, The (Book)
People: AGAR, Jon
Abstract: Reviews the book "The Government Machine: A Revolutionary History of the Computer," by Jon Agar.
Author Affiliations: 1College of Business, Law, and Social Sciences, Nottingham Trent University, Nottingham, United Kingdom
8. 6. Обзор книги “Киберактивность: онлайн активность в теории и на практике”
A Review of: “Cyberactivism: Online Activism in Theory and Practice”. By: Hara, Noriko. , , p389-390, 2p;
Ключевые слова: BOOKS -- Reviews, NONFICTION
Reviews & Products: CYBERACTIVISM: Online Activism in Theory & Practice (Book)
People: MCCAUGHEY, Martha, AYERS, Michael D.
Abstract: Reviews the book "Cyberactivism: Online Activism in Theory and Practice," edited by Martha McCaughey and Michael D. Ayers.
Author Affiliations: 1School of Library and Information Science, Indiana University, Bloomington, Indiana, USA
9. 6. Обзор книги “Опыт внедрения информационных технологий в Индии: наведение мостов в условиях цифрового расслоения общества”
A Review of: “IT Experience in India: Bridging the Digital Divide”. By: Madon, Shirin. , , p391-392, 2p;
Ключевые слова: BOOKS -- Reviews, DIGITAL divide, NONFICTION
Reviews & Products: IT Experience in India: Bridging the Digital Divide (Book)
People: KENISTON, Kenneth
KUMAR, Deepak
Abstract: Reviews the book "IT Experience in India: Bridging the Digital Divide," edited by Kenneth Keniston and Deepak Kumar.
Author Affiliations: 1Information Systems Department, London School of Economics & Political Science, London, United Kingdom
10. Обзор книги « Киберпреследование: агрессия в Интернет или как защитить Вашу семью»
A Review of: “Cyberstalking: Harassment in the Internet Age and How to Protect Your Family”. By: Tavani, Herman T. p393-395, 3p;
Ключевые слова: *BOOKS -- Reviews, NONFICTION
Reviews & Products: CYBERSTALKING: Harassment in the Internet Age & How to Protect Your Family (Book), People: BOCIJ, Paul
Abstract: Reviews the book "Cyberstalking: Harassment in the Internet Age and How to Protect Your Family," by Paul Bocij.
Author Affiliations: 1Department of Philosophy, Rivier College, Nashua, New Hampshire, USA
11. Обзор книги « Использование электронных библиотек: учет социальной практики при проектировании и оценке эффективности»
A Review of: “Digital Library Use: Social Practice in Design and Evaluation”. By: Hong Xie. , p397-398, 2p;
Ключевые слова: BOOKS -- Reviews, INFORMATION resources, NONFICTION
Reviews & Products: DIGITAL Library Use: Social Practice in Design & Evaluation (Book)
People: BUTTENFIELD, Barbara P., BISHOP, Ann Peterson, VAN House, Nancy A.
Abstract: Reviews the book "Digital Library Use: Social Practice in Design and Evaluation," edited by Ann Peterson Bishop, Nancy A. Van House and Barbara P. Buttenfield.
Author Affiliations: 1School of Information Studies, University of Wisconsin, Milwaukee, Wisconsin, USA
