ppxscal/embedding_network huggingface dataset:
Nonlinear Adaptive Control Design for Affine Systems
Authors: Xuejun Zong, Minghao Tan, Decheng Yuan
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

A nonlinear adaptive approach based on differential geometry and state space identification is presented for the control of affine systems. An affine system is transformed to an input/output linear process by internal state feedback. First the optimal controller that minimizes the given quadratic cost function is designed for the linearized system. Finally we design a nonlinear adaptive controller that identifies the process model online using state space identification. The system switches to the adaptive control strategy when the process dynamics change. The implementation of the proposed control strategy is simple and efficient with mature algebraic algorithms. The effectiveness and robustness of the proposed control design is demonstrated by a simulation example. Key words: nonlinear control, adaptive control, differential geometry, optimal control, state space identification
An Interior-Point Method for Large-Scale l1-Regularized Logistic Regression
Authors: Kwangmoo Koh, Seung-Jean Kim, Stephen Boyd
Venue: The Journal of Machine Learning Research (2007)

Logistic regression with l1 regularization has been proposed as a promising method for feature selection in classification problems. In this paper we describe an efficient interior-point method for solving large-scale l1-regularized logistic regression problems. Small problems with up to a thousand or so features and examples can be solved in seconds on a PC; medium sized problems, with tens of thousands of features and examples, can be solved in tens of seconds (assuming some sparsity in the data). A variation on the basic method, that uses a preconditioned conjugate gradient method to compute the search step, can solve very large problems, with a million features and examples (e.g., the 20 Newsgroups data set), in a few minutes, on a PC. Using warm-start techniques, a good approximation of the entire regularization path can be computed much more efficiently than by solving a family of problems independently.
A service-oriented WSRF-based architecture for metascheduling on computational Grids
Authors: G. Moltó, V. Hernández, J. M. Alonso
Venue: Future Generation Computer Systems (2008)

This paper describes a Grid service developed over the Globus Toolkit 4, which provides multi-user resource brokering on computational Grids. Both the architecture and implementation details are covered, emphasising the usage of the WSRF specifications and GSI-based security to create a generic, secure and interoperable metascheduler. In addition, we also describe the development of a graphical client-side application that provides an ubiquitous access to the metascheduler service. This work is currently being employed in production for the execution of a biomedical application that simulates the electrical activity of cardiac tissues.
An Efficient Pareto-Coevolution Archive
Authors: Liping Yang, Houkuan Huang, Xiaohong Yang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Archive-based methods have been proposed for guaranteeing progress in coevolution. An important question in the practical applications is how to minimize the size of archives while remaining reliability. In the paper we present an efficient Pareto-Coevolution archive based on the problem structure which is identified in coevolution process. In the design, the size of test-archive is minimized while standing for currently global progress. Compared with IPCA on a Numbers game problem, experimental results show that our algorithm is more efficient.
Learning Equivariant Functions with Matrix Valued Kernels
Authors: Marco Reisert, Hans Burkhardt
Venue: The Journal of Machine Learning Research (2007)

This paper presents a new class of matrix valued kernels that are ideally suited to learn vector valued equivariant functions. Matrix valued kernels are a natural generalization of the common notion of a kernel. We set the theoretical foundations of so called equivariant matrix valued kernels. We work out several properties of equivariant kernels, we give an interpretation of their behavior and show relations to scalar kernels. The notion of (ir)reducibility of group representations is transferred into the framework of matrix valued kernels. At the end to two exemplary applications are demonstrated. We design a non-linear rotation and translation equivariant filter for 2D-images and propose an invariant object detector based on the generalized Hough transform.
Parallel Balancing of Binary Search Trees
Authors: Shi-Kuo Chang
Venue: IEEE Transactions on Computers (1974)

A method for the balancing of binary search trees on a highly parallel computer is described. This method can be adapted for execution on a multiprocessor computer system.
Feature-based Self-synchronous Audio Watermarking Technology
Authors: Ren Shuhong, Jiang Bo
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

In order to get the robust performance for audio watermarking, a new idea called synchronous valley approach for hiding location is proposed for public audio transmission. As the audio masking principle, the computation is addressed in the low frequency coefficients in discrete wavelet transforming. Five features for seven rules are drawn from the coefficients in the self-synchronous approach. The secrets are firstly coded with BCH technology and then hidden behind the synchronous positions by the algorithm of quantization discrete wavelet transforming. Experimental results show that the synchronous valley approach is very effective when locating the secrets in the watermarking embedding and extracting process. Meanwhile, the watermarking technology is robust to the common attacks, such as MP3 coding, re-sampling, re-quantization, echo delay, Gaussian noise and cropping.
Fast communication: Stability analysis of natural gradient learning rules in overdetermined ICA
Authors: S. Squartini, A. Arcangeli, F. Piazza
Venue: Signal Processing (2008)

The present work deals with the ICA problem in the overdetermined (or undercomplete) case, i.e. the sensors outnumber the sources. As appeared recently in the literature, the natural gradient (NG) approach is an efficient way to get fast convergence in ICA learning rules, also in our case of interest. However, up to the author's knowledge, the stability properties of such algorithms have been analyzed only in the complete ICA. In order to face this lack, a general framework for the stability analysis of the overdetermined NG based ICA learning rules is proposed here. In particular, it has been observed that the already existing algorithms do not have separating matrices as equilibrium points, as instead it occurs in case of an alternative standard gradient based ICA learning rule here proposed and in all related NG versions that can be derived from it. This and the property of being locally stable at the equilibrium for such new algorithms make them preferable w.r.t. the others for practical purposes.
R68-11 Intercommunication of Processors and Memory
Authors: H. C. Lauer
Venue: IEEE Transactions on Computers (1968)

Second generation computing systems rarely had an aggregate of peripheral devices with high enough data transfer rates to tax memory speed or to degrade central processor ( CP) performance. Whenever they did, there was no attempt to overlap transfer with computing, and the CP remained idle. But in many third generation systems, there are several processors-both I/O devices and arithmetic units-operating asynchronously and independently, each of which has a high transfer rate to main memory. Thus, the question of designing sufficient bandwidth into memories and buses is significant. Experience with some of the commercial multiprocessing systems (e. g., UNIVAC 1108 or IBM 360/67) shows, however, that sufficient bandwidth is not enough. The system must be organized so that the full bandwidth, or at least a large fraction of it, can be used effectively. It is this problem to which the author has ably addressed his paper.
A Resource Allocation Model with Cost-Performance Ratio in Data Grid
Authors: Xiangang Zhao, Liutong Xu, Bai Wang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Resource allocation for data transfer is a fundamental issue for achieving high performance in Data Grid environments. In this paper, we survey the existing researches on allocation problems in Grid environment and propose a resource allocation model based on the cost-performance ratio for commerce environments. This ratio takes both price and quality of data resource into consideration at the same time. According to the optimization objective we define two types of ratios: Price-aware ratio and Quality-aware ratio. They are suitable for the environments where allocations put more emphasis on quality or price of resource respectively. Based on the maximal cost-efficiency, we formulize the allocation optimization problem and present two theorems and a deduction about its solutions. The corresponding proofs are also given in the paper. Finally, we present two algorithms to allocate and re-allocate data resources. The analysis shows that the algorithms can satisfy our requirements.
Fuzzy and PD controller based intelligent control of spillway gates of dams
Authors: Aytekin Baǧiş
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2003)

In this paper a new and efficient control method based on the integration of classical proportional-derivative controller and a fuzzy logic controller proposed for real-time operation of spillway gates of a reservoir during any flood of any magnitude up to the probable maximum flood. In order to demonstrate the high performance of the proposed method, we simulate the control system using different probable overflow hydrographs. The results of the proposed control method are compared with the results of the conventional control methods. The results obtained from the simulations indicate that the proposed method exhibits high performance over the conventional reservoir flood operation with much more desirable results. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The Influence of Structured Programming on PL/I Program Profiles
Authors: J. L. Elshoff
Venue: IEEE Transactions on Software Engineering (1977)

Two sets of commercial PL/I programs are studied. One set represents programming practice before the introduction of structured programming techniques and the other set after their introduction. The use of these new methods is found to make a measurable difference on the quality of the programs. A few minor changes in the use of PL/I are noted. Substantial modifications to the control structure of the programs are measured. Also, some improvements in the qualitative aspects of the two sets are discussed. Although, they are much improved, further alterations can make the programs still better. The time and training required to introduce structured programming techniques will begin paying dividends within six months.
Out of sight but not out of mind?: Informal networks, communication and media use in global software teams
Authors: Klarissa T. Chang, Kate Ehrlich
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

In an effort to reduce costs and improve staffing options, companies are going offshore to staff software projects. Although advances in communication technologies make it easier to share information, a growing number of studies have highlighted the disadvantages and hidden costs of distributed teams. This paper reports the results of a study that used social network analysis to study the informal communication patterns in three successful global software teams. The results indicated that technical leaders acted as brokers to coordinate work across tasks and sites in self-organizing sub-groups. Personal networks, awareness of tasks and accessibility influenced communication which in turn affected the social climate of the team. We discuss the implications of these results for technologies that support awareness and for management practices, especially in globally distributed work contexts.
Distributed Identity Management Model for Digital Ecosystems
Authors: Hristo Koshutanski, Mihaela Ion, Luigi Telesca
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

Digital Ecosystems is the new paradigm for dynamic IT business integration. A Digital Ecosystem consists of institutions that compete, collaborate, and form stable or unstable federations. Such a dynamic environment becomes a bottleneck for identity management solutions. Existing solutions are either too restricting and not flexible enough to support the dynamic nature of ecosystems or they are too complex and difficult to adopt by Small and Medium-size Enterprises (SMEs). This paper presents an identity management model for automated processing of identity information between distributed ecosystem partners. The model emphasizes on its practical, clear and easy to deploy framework. The model is based on the new OASIS SAML standard to provide interoperability and convergence between existing identity technologies. The paper presents the basic and extended identity models for single services and service compositions. The aim of this research is to allow SMEs to use and enhance their current identity technology with a practical and easy to implement identity management solution that scales up to the dynamic and distributed nature of digital ecosystems.
Semantic Locations in Online Communities
Authors: Martin Gruhn, Stefan Foll, Jens Pontow, David Linner, Ilja Radusch
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Humans usually think of a location not as pair of coordinates but rather in a semantic way as place. In this paper, we are presenting a concept to integrate places in a framework for the development of user-centered community platforms. We follow a grassroots approach for collecting places and introduce an ontology- based place model along with concepts for mapping geographic coordinates to places. Furthermore, a place cloud is established as an intuitive user interface for localization, place visualization, and the retrieval of multimedia contents based on places. The prototypical implementation of our concepts proofs that places are well suited for personalization and the semantic annotation of multimedia contents in a social environment.
Generalizing from relevance feedback using named entity wildcards
Authors: Abhimanyu Lad, Yiming Yang
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Traditional adaptive filtering systems learn the user's interests in a rather simple way - words from relevant documents are favored in the query model, while words from irrelevant documents are down-weighted. This biases the query model towards specific words seen in the past, causing the system to favor documents containing relevant but redundant information over documents that use previously unseen words to denote new facts about the same news event. This paper proposes news ways of generalizing from relevance feedback by augmenting the traditional bag-of-words query model with named entity wildcards that are anchored in context. The use of wildcards allows generalization beyond specific words, while contextual restrictions limit the wildcard-matching to entities related to the user's query. We test our new approach in a nugget-level adaptive filtering system and evaluate it in terms of both relevance and novelty of the presented information. Our results indicate that higher recall is obtained when lexical terms are generalized using wildcards. However, such wildcards must be anchored to their context to maintain good precision. How the context of a wildcard is represented and matched against a given document also plays a crucial role in the performance of the retrieval system.
Complete design of fuzzy systems using a real-coded genetic algorithm with imbedded constraints
Authors: Jun Li, Michael G. Parsons
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2001)

This paper investigates the applicability and feasibility of real-coded GAs for the complete development of fuzzy systems with imbedded constraints; i.e., automatic design of both fuzzy membership functions and rules subject to certain constraints. In this paper, a real-coded GA called RGA is developed, in which chromosomes are represented as real vectors. The constraints associated with the fuzzy systems are explicitly considered and satisfied during the training process of the fuzzy systems by the RGA. The satisfaction of the constraints is done primarily by using tailor-made genetic operators, which are designed based on the coding structure and the required characteristics of the fuzzy systems. We apply the RGA to the design of three fuzzy systems, called fuzzy decision models (FDMs), to model and forecast economic activities in the crude oil tanker sector of maritime transportation. The effects of the RGA's control parameters on the performance of the RGA, including the crossover and mutation rates, multiple mutation, and selection pressure, are investigated in this paper. Our results indicate that the RGA is robust in developing appropriate FDMs with strong modeling and forecasting capability.
An intelligent mechanism for lot output time prediction and achievability evaluation in a wafer fab
Authors: Toly Chen
Venue: Computers and Industrial Engineering (2008)

An intelligent mechanism is constructed in this study for lot output time prediction and achievability evaluation in a wafer fabrication plant (wafer fab), which are critical tasks to the wafer fab. The intelligent mechanism is composed of two parts, and has three intelligent features: example classification, artificial neural networking, and fuzzy reasoning. In the first part of the intelligent mechanism, a hybrid self-organization map (SOM) and back propagation network (BPN) is constructed to predict the output time of a wafer lot. According to experimental results, the prediction accuracy of the hybrid SOM-BPN was significantly better than those of many existing approaches. In the second part of the fuzzy system, a set of fuzzy inference rules (FIRs) are established to evaluate the achievability of an output time forecast, which is defined as the possibility that the fabrication on the wafer lot can be finished in time before the output time forecast. Achievability is as important as accuracy and efficiency, but has been ignored in traditional studies. With the proposed mechanism, both output time prediction and achievability evaluation can be concurrently accomplished.
ROSE: A transactional services coordination engine
Authors: Victor Hernandez-Baruch, Alberto Portilla, Jose-Luis Zechinelli-Martini
Venue: Proceedings of the Eighth Mexican International Conference on Current Trends in Computer Science (2007)

This paper introduces an adaptable transactional services coordination engine called ROSE. Different to existing services coordination engines, ROSE is able to combine different transactional contracts for executing a given coordination. Contracts capture application requirements as transactional properties derived from business rules. Inspired on separation of concerns approaches, our engine uses the notion of contract for expressing transactional properties separately from coordination specifications. In this way contracts can be defined and modified without modifying the coordination. The current version of ROSE is implemented on top of the open source coordination engine Bonita (www.objectweb.org) and it implements atomicity contracts useful for e-commerce applications.
On representation and aggregation of social evaluations in computational trust and reputation models
Authors: Jordi Sabater-Mir, Mario Paolucci
Venue: International Journal of Approximate Reasoning (2007)

Interest for computational trust and reputation models is on the rise. One of the most important aspects of these models is how they deal with information received from other individuals. More generally, the critical choice is how to represent and how to aggregate social evaluations. In this article, we make an analysis of the current approaches of representation and aggregation of social evaluations under the guidelines of a set of basic requirements. Then we present two different proposals of dealing with uncertainty in the context of the Repage system [J. Sabater, M. Paolucci, R. Conte, Repage: Reputation and image among limited autonomous partners, Journal of Artificial Societies and Social Simulation 9 (2). URL http://jasss.soc.surrey.ac.uk/9/2/3.html], a computational module for management of reputational information based on a cognitive model of imAGE, REPutation and their interplay already developed by the authors. We finally discuss these two proposals in the context of several examples.
QoS Routing In Ad Hoc Networks by Integreting Activity in the OLSR Protocol
Authors: Hassene Bouhouch, Sihem Guemara El Fatmi
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Ad hoc networks (AHNs) include mobile nodes with limited communication resources on which the path selection is usually made according to a best effort strategy. Today, AHNs are facing a new challenge: a QoS routing based on bandwidth and delay requirements. The importance of this challenge makes this issue focused by several researchers. Consequently, we are interested in this paper by a routing QoS oriented in AHNs. One of the major contributions of this paper concerns the proposition of a novel layered QoS architecture and a contention resolution mechanism allowing a QoS routing definition. Our proposition is based on traffic classification and requires metrics definition allowing the expression of the QoS requirements in order to provide differentiated routing according to traffic classes.
Groups and semigroups defined by some classes of Mealy automata
Authors: Alexander S. Antonenko, Eugene L. Berkovich
Venue: Acta Cybernetica (2007)

Two classes of finite Mealy automata (automata without branches, slow-moving automata) are considered in this article. We study algebraic properties of transformations defined by automata of these classes. We consider groups and semigroups defined by automata without branches.
Testing Mixed-Signal Devices
Authors: Randall Kramer
Venue: IEEE Design Test (1987)

Testing ISDN devices, which mix analog voice information and digital data, puts special demands on the test system. The ISDNhas multiple interfaces with devices that perform a variety of functions. What was usually performed by many individual ICsis now performed by a single ISDN device. Particularly challenging are network interface and device feature tests becausethe test system must generate and detect the specialized frame structures in the network communication links-structures thatchange not only between transmit and receive but also between interfaces. Techniques to conduct these tests are describedin detail. The benefits of these techniques can be increased with the use of the proper hardware and interactive, graphics-basedsoftware tools.