ppxscal/embedding_network huggingface dataset:
Learning to form dynamic committees
Authors: Santiago Ontañón, Enric Plaza
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Learning agents may improve performance when they cooperate with other agents. Specifically, learning agents forming a committee may outperform individual agents. This "ensemble effect" is well known for multi-classifier systems in Machine Learning. However, multi-classifier systems assume all data is known to all classifiers while we focus on agents that learn from cases (examples) that are owned and stored individually. In this article we focus on the selection of the agents that join a committee for solving a problem. Our approach is to frame committee membership as a learning task for the convener agent. The committee convener agent learns to form a committee in a dynamic way: at each point in time the convener agent decides whether it is better to invite a new member to join the committee (and which agent to invite) or to close the membership. The convener agent performs learning in the space of voting situations, i.e. learns when the current committee voting situation is likely to solve correctly (or not) a problem. The learning process allows an agent to decide when to solve a problem individually, when to convene a committee is better, and which individual agents to be invited to join the committee. Our experiments show that learning to form dynamic committees results in smaller committees while maintaining (and sometimes improving) the problem solving accuracy.
Adaptive Disk Scheduling Algorithms for Video Servers
Authors: Wonjun Lee, Jaideep Srivastava, Won-Ho Lee
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

Soft-real time applications, such as continuous media (CM) systems, have an important property, namely, they allow for graceful adaptation of the application Quality-of-Service (QoS), and therefore are able to have acceptable performance with reduced resource utilization. This can be used by the admission control process to decide if an application can be admitted, even if the resource is congested.In this paper, we present a Soft-QoS framework for Continuous Media servers, which provides a dynamic and adaptive admission control and scheduling algorithm. Using our policy, we could increase the number of simultaneously running clients that could be supported and could ensure a good response ratio and better resource utilization under heavy traffic requirements. The observations and findings from the model are validated with simulation studies.
Smart Dust - Hardware Limits to Wireless Sensor Networks
Authors: Kristofer S. J. Pister
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

With the MEMS revolution in full swing, microsensorsare now following manufacturing curves that are atleast related to Moore's Law. Combined with the pushfor low power communication and computation comingfrom the handheld community, this enables an excitingnew field of low-cost, high-performance wirelesssensor networks. This talk will address some of thepractical and physical limits associated withminiaturization of wireless sensor networks.
Multiresolution signal decomposition schemes. Part 2: Morphological wavelets
Authors: Henk J.A.M. Heijmans, John Goutsias
Venue:  (1999)

In its original form, the wavelet transform is a linear tool. However, it has been increasingly recognized that nonlinear extensions are possible. A major impulse to the development of nonlinear wavelet transforms has been given by the introduction of the lifting scheme by Sweldens. The aim of this report, which is a sequel to a previous report devoted exclusively to the pyramid transform, is to present an axiomatic framework encompassing most existing linear and nonlinear wavelet decompositions. Furthermore, it introduces some, thus far unknown, wavelets based on mathematical morphology, such as the morphological Haar wavelet, both in one and two dimensions. A general and flexible approach for the construction of nonlinear (morphological) wavelets is provided by the lifting scheme. This paper discusses one example in considerable detail, the max-lifting scheme, which has the intriguing property that it preserves local maxima in a signal over a range of scales, depending on how local or global these maxima are.
Slant Correction of Handwritten Strings Based on Structural Properties of Korean Characters
Authors: Daekeun You, Gyeonghwan Kim
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

A slant correction method for handwritten Korean strings based on analysis of stroke distribution, which reflects structural properties of Korean characters, is presented in this paper. The method aims to deal with typical problems which have been frequently observed in slant correction of handwritten Korean strings with conventional approaches developed for English/European languages. Extracted strokes from a line of text image are classified intotwo clusters: vertical and diagonal. Gaussian modeling is applied to each of the clusters and the slant angle is estimated from the model which represents the vertical strokes. Experimental results support the effectiveness of the proposed method. For the performance comparison 1,600 handwritten address sting images were used, and success rate of 96.7%, which is much higher than other conventional approaches, has been achieved.
Balancing Performance, Energy, and Quality in Pervasive Computing
Authors: Jason Flinn, SoYoung Park, M. Satyanarayanan
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

We describe Spectra, a remote execution system for battery-powered clients used in pervasive computing. Spectra enables applications to combine the mobility of small devices with the greater processing power of static compute servers. Spectra is self-tuning: it monitors both application resource usage and the availability of resources in the environment, and dynamically determines how and where to execute application components. In making this determination, Spectra balances the competing goals of performance, energy conservation, and application quality. We have validated Spectra's approach on the Compaq Itsy v2.2 andIBMThinkPad 560X using a speech recognizer, a document preparation system, and a natural language translator. Our results confirm that Spectra almost always selects the best execution plan, and that its few suboptimal choices are very close to optimal.
A Neural-Network Approach to Modeling and Analysis
Authors: Chen-Yuan Chen, Cheng-Wu Chen, Wei-Ling Chiang, Jing-Dong Hwang
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

It is known that backpropagation network is always used to modeling. This study is concerned with the stability problem of a neural network (NN) system which consists of a few subsystems represented by NN models. In this paper, the dynamics of each NN model is converted intolinear inclusion representation. Subsequently, based on the representations, the stability conditions in terms of Lyapunov's direct method is derived to guarantee the asymptotic stability of NN systems.
Sparse Networks Tolerating Random Faults
Authors: Toshinori Yamada, Shuichi Ueno
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

This paper proposes a general method to construct a fault-tolerant network G* for any network G with N processors such that G* has O(N) processors and contains a fault-free isomorphic copy of G with high probability even if processors fail independently with constant probability. Based on the construction, we also show that we can construct such fault-tolerant networks with O(N) processors and O(M log N) communication links for a circulant network, hypercube, de Bruijn network, shuffle-exchange network, and cube-connected-cycles with N processors and M communication links.
Determining WWW User Agents from Server Access Log
Authors: Taketo Kabe, Masatoshi Miyazaki
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

It is a common practice to analyze an access log of an WWW server to obtain data, such as user agent vendor percentage, supplying information more suitably, or to measure information exposure rate (mainly for advertisement effectiveness). HTTP does have a ¿User-Agent¿ header to let user agents supply their product names for these kinds of use, but in fact relying solely on this tends to be inaccurate. This paper presents some considerations needed for log analysis to determine the user agent in a more precise way, and application to an actual access log resulted in 2 percent difference compared to conventional method.
The significance of microprogramming
Authors: Robert F. Rosin
Venue: ACM SIGARCH Computer Architecture News (1977)

Interest in the topic of microprograrnming appears to have had a great growth in the middle and late 1960's, but since that time it has leveled off or declined somewhat. This paper examines the reasons behind this development and then offers a reconsideration of and a new proposal for the definition of microprogramming.This result is supported by the consideration of three phenomena. First is the evolution of microprogramming during the past twenty years. Second is the evolution in the use of interpretation as an implementation technique. Third is the set of "rules of thumb" resulting from the system designer having to resolve conflicting forces attempting to influence his activity.Five possible meanings of the term microprogramming are considered and rejected totally or in part prior to the one finally offered. The suggestion is made that this redefined concept be avoided as much as possible in the future, and two avenues for research alternatives are encouraged instead.
Data Mining using MLC++, A Machine Learning Library in C++
Authors: Ron Kohavi, Dan Sommerfield, James Dougherty
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

Data mining algorithms including machine learning, statistical analysis, and pattern recognition techniques can greatly improve our understanding of data warehouses that are now becoming more widespread. In this paper, we focus on classification algorithms and review the need for multiple classification algorithms. We describe a system called MLC++, which was designed to help choose the appropriate classification algorithm for a given dataset by making it easy to compare the utility of different algorithms on a specific dataset of interest. MLC++ not only provides a workbench for such comparisons, but also provides a library of C++ classes to aid in the development of new algorithms, especially hybrid algorithms and multi-strategy algorithms. Such algorithms are generally hard to code from scratch. We discuss design issues, interfaces to other programs, and visualization of the resulting classifiers.
Internet technology supporting distance education: a critical overview
Authors: Maria C Buzzi, Paola Venerosi
Venue:  (1998)

This paper examines a significant collection of software tools for delivering courseware: Learning Space, Virtual-U, WebCT, TopClass, Web Course in a Box, ToolBook II (Instructor and Assistant). The aim is to provide better understanding of organizational issues, enlightening pedagogical goals, methods, and various information technologies used to support courseware. During our investigation, the functional specifications of an integrated system environment are outlined. A final discussion provides the arguments supporting our options. This work may serve as critical contribution in designing a training environment based on up-to-date web support tools. EMAIL:: venerosi@iei.pi.cnr.it
Dunhuang Frescoes retrieval based on similarity calculation of color and texture features
Authors: Zhang Chang, Jiang Jiandong, Pan Yunhe
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

This paper mainly deals with efficient retrieval of Dunhuang Frescoes from large image databases based on similarity calculation of color and texture features. In this paper, we firstly give out a survey of research on Dunhuang Frescoes by artists from all over the world. Therefore, these research achievements can provide us a new clue to organize and manage Dunhuang Frescoes databases, and guide us to find an efficient way to retrieve Dunhuang Frescoes from large-volume image databases. We present a similarity calculation method from multi-source analogy. Then we describe several techniques for extracting the color and texture features of Dunhuang Frescoes. Finally, we calculate the comprehensive similarity between Frescoes using color and texture features. By means of the similarity computation, we can carry on an efficient and fast image database retrieval. A Dunhuang Frescoes retrieval and analysis system demonstrates that retrieval using the combination of color and texture features can assure high precision and robustion.
Wireless Technician's Handbook, 2 edition
Authors: Andrew Miceli
Venue:  (2003)

:Applying knowledge of wireless cellular communications to real-world situations wireless technicians encounter everyday, this book conveys extensive information every technician needs in one comprehensive volume. From dBm versus Watts, the differences between analog, TDMA and CDMA, and testing of handsets and base stations, Wireless Technician's Handbook covers all first-tier wireless formats in clear, concise language to make you more competent and productive. You will not only gain enhanced, basic understanding of electronic principles, but also a sound foundation of wireless communications principles, including analog and digital concepts. This book: >Focuses on testing concepts and procedures, and types of testing equipment, including spectrum analyzers and power meters and their applications >Reviews AMPS, CDMA, IS-136, and GSM >Includes charts technicians refer to daily and screen shots from common test instruments >Surveys common problems with cellular and PCS networks and handsets Perfect for field-based wireless technicians, this handbook is also an excellent reference for wireless engineers seeking an understanding of practical field applications, and newcomers to wireless communications. It's also a handy guide for non-technical business personnel seeking a better understanding of the technology and industry.
Issues in Multimedia Database Management
Authors: M. Tamer Özsu
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Multimedia information systems pose significantly different data management requirements than traditional database applications. Some of the multimedia data management issues have been well studied by the database community, but there are other problems that have been largely ignored. In this paper, the generality of multimedia database management is considered and a brief and personal overview of the issues is given.
Rational Spaces and Set Constraints
Authors: Dexter Kozen
Venue:  (1995)

Set constraints are inclusions between expressions denoting sets of ground terms. They have been used extensively in program analysis and type inference. In this paper we investigate the topological structure of the spaces of solutions to systems of set constraints. We identify a family of topological spaces called {\em rational spaces}, which formalize the notion of a topological space with a regular or self-similar structure, such as the Cantor discontinuum or the space of runs of a finite automaton. We develop the basic theory of rational spaces and derive generalizations and proofs from topological principles of some results in the literature on set constraints. 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
Energy efficient co-adaptive instruction fetch and issue
Authors: Alper Buyuktosunoglu, Tejas Karkhanis, David H. Albonesi, Pradip Bose
Venue: ACM SIGARCH Computer Architecture News (2003)

Front-end instruction delivery accounts for a significant fraction of the energy consumed in a dynamic superscalar processor. The issue queue in these processors serves two crucial roles: it bridges the front and back ends of the processor and serves as the window of instructions for the out-of-order engine. A mismatch between the front end producer rate and back end consumer rate, and between the supplied instruction window from the front end, and the required instruction window to exploit the level of application parallelism, results in additional front-end energy, and increases the issue queue utilization. While the former increases overall processor energy consumption, the latter aggravates the issue queue hot spot problem.We propose a complementary combination of fetch gating and issue queue adaptation to address both of these issues. We introduce an issue-centric fetch gating scheme based on issue queue utilization and application parallelism characteristics. Our scheme attempts to provide an instruction window size that matches the current parallelism characteristics of the application while maintaining enough queue entries to avoid back-end starvation. Compared to a conventional fetch gating scheme based on flow-rate matching, we demonstrate 20% better overall energy-delay with a 44% additional reduction in issue queue energy. We identify Icache energy savings as the largest contributor to the overall savings and quantify the sources of savings in this structure. We then couple this issue-driven fetch gating approach with an issue queue adaptation scheme based on queue utilization. While the fetch gating scheme provides a window of issue queue instructions appropriate to the level of program parallelism, the issue queue adaptation approach shuts down the remaining underutilized issue queue entries. Used in tandem, these complementary techniques yield a 20% greater issue queue energy savings than the addition of the savings from each technique applied in isolation. The result of this combined approach is a 6% overall energy-delay savings coupled with a 54% reduction in issue queue energy.
HAWAII: A Domain-Based Approach for Supporting Mobility in Wide-Area Wireless Networks
Authors: R. Ramjee, T. La Porta, S. Thuel, K. Varadhan, S. Y. Wang
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

Mobile IP is the current standard for supporting macro-mobility of mobile hosts. However, in the case of micro-mobility support, there are several competing proposals. In this paper, we present the design, implementation, and performance evaluation of HAWAII: a domain-based approach for supporting mobility. HAWAII uses specialized path setup schemes which install host-based forwarding entries in specific routers to support intra-domain micro-mobility. These path setup schemes deliver excellent performance by reducing mobility related disruption to user applications. Also, mobile hosts retain their network address while moving within the domain, simplifying QoS support. Furthermore, reliability is achieved through maintaining soft-state forwarding entries for the mobile hosts and leveraging fault detection mechanisms built in existing intra-domain routing protocols. HAWAII defaults to using Mobile IP for macro-mobility, thus providing a comprehensive solution for mobility support in wide-area wireless networks.
The Complexity of Planar Compliant Motion Planning Under Uncertainty
Authors: Bruce R Donald
Venue:  (1987)

We consider the computational complexity of planning compliant motions in the plane, given geometric bounds on the uncertainty in sensing and control. We can give efficient algorithms for generating and verifying compliant motion strategies that are guaranteed to succeed as long as the sensing and control uncertainties lie within the specified bounds. We also consider the case where a compliant motion plan is required to succeed over some parametric family of geometries. While these problems are known to be intractable in 3D, we identify tractable subclasses in the plane.
A neuro-fuzzy framework for predicting ash properties in combustion processes
Authors: G. Castellano, C. Castiello, A. M. Fanelli, M. Giovannini
Venue: Neural, Parallel Scientific Computations (2003)

This paper describes a neuro-fuzzy modeling framework for predicting the properties of ashes originated from combustion processes for electric generation. The prediction problem is tackled by means of a neuro-fuzzy system in which a neural network and a fuzzy system are combined in a fused architecture, so that the structure and the parameters of the fuzzy rule base are determined via a two-phase learning of the neural network. The modeling framework is composed of two modeling strategies that enable development of both MIMO and MISO neuro-fuzzy models. Experimental results demonstrate that models derived by the proposed framework delivered satisfactory results in spite of the significant complexity of the considered problem.
Performance Optimizations for Group Key Management Schemes
Authors: Sencun Zhu, Sanjeev Setia, Sushil Jajodia
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Recently, many group key management approachesbased on the use of logical key trees have been proposed toaddress the issue of scalable group rekeying that is neededto support secure communications for large and dynamicgroups. In this paper, we present two optimizations for logicalkey tree organizations that utilize information aboutthe characteristics of group members to further reduce theoverhead of group rekeying. First, we propose a partitionedkey tree organization that exploits the temporal patterns ofgroup member joins and departures to reduce the overheadof rekeying. Using an analytic model, we show that our optimizationcan achieve up to 31.4% reduction in key serverbandwidth overhead over the unoptimized scheme. Second,we propose an approach under which the key tree is organizedbased on the loss probabilities of group members.Our analysis shows this optimization can reduce the rekeyingoverhead by up to 12.1%.
Stereo Matching with Non-Linear Diffusion
Authors: Daniel Scharstein, Richard Szeliski
Venue:  (1996)

One of the central problems in stereo matching (and other image registration tasks) is the selection of optimal window sizes for comparing image regions. This paper addresses this problem with some novel algorithms based on iteratively diffusing support at different disparity hypotheses, and locally controlling the amount of diffusion based on the current quality of the disparity estimate. It also develops a novel Bayesian estimation technique which significantly outperforms techniques based on area-based matching (SSD) and regular diffusion. We provide experimental results on both synthetic and real stereo image pairs.
Area Requirement of Visibility Representations of Trees
Authors: G. Kant, G. Liotta, R. Tamassia, I. G. Tollis
Venue:  (1996)

Trees are among the most common structures in computing and many algorithms for drawing trees have been developed in the last years. Such algorithms usually adopt different drawing conventions and attempt to solve several optimization problems. The aim of this paper is to study two different types of drawing conventions for trees, namely 1-strong visibility representation and 2-strong visibility representation. For both of them we investigate the problem of minimizing the area of the representation. The contribution of the paper is twofold: (i) we prove tight lower and upper bounds on the area of such representations; and (ii) we provide linear-time algorithms that construct representations with optimal area.