ppxscal/embedding_network huggingface dataset:
Dynamic Server Allocation for Power and Performance
Authors: Joris Slegers, Nigel Thomas, Isi Mitrani
Venue: Proceedings of the SPEC international workshop on Performance Evaluation: Metrics, Models and Benchmarks (2008)

We consider a system of servers that process incoming requests. These requests experience periods of high and low arrival rate. Servers can be powered down dynamically to conserve power. We examine this system with a view to balancing the need between processing incoming requests quickly and reducing power consumption. The system is modeled formally and heuristics are presented to decide when servers should be powered down or up. Preliminary results of the performance of these heuristics are also included.
An Energy and Distance Aware Data Dissemination Protocol Based on SPIN in Wireless Sensor Networks
Authors: Jaewan Seo, Moonseong Kim, Sang-Hun Cho, Hyunseung Choo
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

One of the major challenges in facing the design of disseminating protocol for Wireless Sensor Networks (WSNs) is to find an energy efficiency way. Recently, several researches have been studied for this issue, and SPMS, that outperforms the well-known protocol SPIN, specially is a representative protocol. Also one of many characters of SPMS is the using of the shortest path to minimize the energy consumption. However, since it repeatedly uses the same path as the shortest path, the maximizing of the network lifetime is impossible, though it reduces the energy consumption. In this paper, we propose a novel data dissemination protocol, called Energy and Distance Aware protocol based on SPIN (EDAS), that guarantees energy-efficient data transmission and maximizes network lifetime. EDAS solves the network lifetime problem by using the residual energy and the efficient distance between nodes to determine a path for data dissemination. The simulation results show that EDAS guarantees energy-efficient transmission and moreover increases the network lifetime by approximately 69% than that of SPMS.
A novel approach for bit-serial AB2 multiplication in finite fields GF(2m)
Authors: Jun-Cheol Jeon, Kee-Won Kim, Kee-Young Yoo
Venue: Computers Mathematics with Applications (2006)

This paper presents a new inner product AB^2 multiplication algorithm and effective hardware architecture for exponentiation in finite fields GF(2^m). Exponentiation is more efficiently implemented by applying AB^2 multiplication repeatedly rather than AB multiplication. Thus, efficient AB^2 multiplication algorithms and simple architectures are the key to implementing exponentiation. Accordingly, this paper proposes an efficient inner product multiplication algorithm based on an irreducible all one polynomial (AOP) and simple architecture, which has the same hardware equipment as Fenn's AB multiplier. The proposed bit-serial multiplication algorithm and architecture are highly regular and simpler than those of previous works.
Improving the Quality of the Pareto Frontier Approximation Obtained by Semi-elitist Evolutionary Multi-agent System Using Distributed and Decentralized Frontier Crowding Mechanism
Authors: Leszek Siwik, Marek Kisiel-Dorohinicki
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

The paper presents one of additional mechanisms called distributed frontier crowding which can be introduced to the Semi-Elitist Evolutionary Multi Agent System--selEMAS and which can significantly improve the quality of obtained Pareto frontier approximation. The preliminary experimental comparative studies are based on a typical multi-objective problem presenting the most important features of the proposed approach.
A Neural Network Approach for Learning Object Ranking
Authors: Leonardo Rigutini, Tiziano Papini, Marco Maggini, Monica Bianchini
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

In this paper, we present a connectionist approach to preference learning. In particular, a neural network is trained to realize a comparison function, expressing the preference between two objects. Such a "comparator" can be subsequently integrated into a general ranking algorithm to provide a total ordering on some collection of objects. We evaluate the accuracy of the proposed approach using the LETOR benchmark, with promising preliminary results.
SensorMap for Wide-Area Sensor Webs
Authors: Suman Nath, Jie Liu, Feng Zhao
Venue: Computer (2007)

The SensorMap portal and its accompanying tools will allow for more online live data.
Towards Design Tools for Protocol Development
Authors: Pýnar Yolum
Venue: Agent Communication II: International Workshops on Agent Communication, AC 2005 and AC 2006, Utrecht, Netherlands, July 25, 2005, and Hakodate, Japan, May 9, 2006, Selected and Revised Papers (2006)

Interaction protocols enable agents to communicate with each other effectively. Whereas several approaches exist to specify interaction protocols, none of them has design tools that can help protocol designers catch semantical protocol errors at design time. As research in networking protocols has shown, flawed specifications of protocols can have disastrous consequences. Hence, it is crucial to systematically analyze protocols in time to ensure correct specification. This paper studies and formalizes important generic properties of commitment protocols that can ease their correct development significantly. Since these properties are formal, they can easily be incorporated in a software tool to (semi-) automate the design and specification of commitment protocols. Where appropriate we provide algorithms that can directly be used to check these properties in such a design tool. 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
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm
Authors: Alexandre Goldsztejn, Yahia Lebbah, Claude Michel, Michel Rueher
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce a new strategy to compute very accurate approximations of feasible points. This strategy takes advantage of the Newton method for under-constrained systems of equations and inequalities. More precisely, it exploits the optimal solution of a linear relaxation of the problem to compute efficiently a promising upper bound. First experiments on the Coconuts benchmarks demonstrate that this approach is very effective.
Reversible Watermarking Schemes Using Spatial Quad-Based Difference Expansion
Authors: Zhiguo Chang, Jian Xu, Weidong Kou
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

In this paper, we make use the fact that the differences between the pixel values in the local region of an image are small and propose two simple and effective reversible watermarking schemes based on the spatial quad-based difference expansion that applies the difference expansion to the image in rowwise and column-wise simultaneously. The schemes make good use of both row-wise and column-wise pixel pairs with small differences. Experimental results show our schemes are effective.
A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs
Authors: Caterina Simone, Anna Galluccio
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

We prove that the edges of every even graph G = G 1 + G 2 that is the join of two regular graphs G i = (V i ,E i ) can be coloured with Δ(G) colours, whenever Δ(G) = Δ(G 2) + |V(G 1)|. The proof of this result yields a combinatorial algorithm to optimally colour the edges of this type of graphs.
Möbius Trace Analysis with Traviando
Authors: Ruth Lamprecht, Peter Kemper
Venue: Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems (2008)

Model verification and validation is crucial to the credibility of a simulation study. The ability to investigate the detailed behavior of a complex stochastic model that is simulated in a powerful modeling environment like Mobius is important to identify root causes of errors in models or to gain confidence that a model performs as expected. In this paper, we briefly describe how the Traviando trace analyzer sheds light on what happens in a simulation run of a Mobius model.
Highlights of the History of the Lambda-Calculus
Authors: J. Barkley Rosser
Venue: IEEE Annals of the History of Computing (1984)

This paper gives an account of both the lambda-calculus and its close relative, the combinatory calculus, and explains why they are of such importance for computer software. The account includes the shortest and simplest proof of the Church-Rosser theorem, which appeared in a limited printing in August 1982. It includes a model of the combinatory calculus, also available in 1982 in a limited printing. In the last half-dozen years, some revolutionary new ideas for programming have appeared, involving the very fundamentals of the lambda-calculus and the combinatory calculus. A short introduction is given for a couple of these new ideas.
Path computation algorithms in NS2
Authors: Davide Adami, Stefano Giordano, Christian Callegari, Michele Pagano
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

Originally designed to improve the efficiency of packets forwarding, MPLS provides support for Traffic Engineering and network resilience. Constrained-based path computation is a key building block for Traffic Engineering in MPLS networks, since it allows to set-up LSPs along paths that satisfy QoS constraints. This paper deals with two distinct categories of path computation algorithms: on-line path computation algorithms adn on-line multi path algorithms. All these algorithms have been implemented in NS2 as an extension of OSPF-TE\ns and integrated with RSVP-TE\ns.
A Product Line for Business Process Management
Authors: Itana Maria de S. Gimenes, Marcelo Fantinato, Maria Beatriz F. de Toledo
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

Business processes are important assets to demonstrate an organization competitiveness degree. Business Process Management (BPM) includes activities that enable the modeling, execution and analysis of business processes. Recently, the association of BPM, the service oriented computing and the Internet technology have broadened the scope of BPM from intra-organizational interchange of services to inter-organizational cooperation. This requires better support to the BPM framework including means to facilitate electronic contract establishment. BPM is one of the potential domains to which Product Line (PL) concepts and techniques can be applied. This paper presents an approach to support e-contract negotiation based on feature modeling. The approach is one of the steps of a broader research scope which aims at designing a framework to enable reuse throughout BPM activities. An example of the application of the proposed approach within the context of a Telecomm company is shown and results are discussed.
A Framework of the Non-invasive Ultrasound Theragnostic System
Authors: Norihiro Koizumi, Deukhee Lee, Kohei Ota, Shin Yoshizawa, Kiyoshi Yoshinaka, Yoichiro Matsumoto, Mamoru Mitsuishi
Venue: Proceedings of the 4th international workshop on Medical Imaging and Augmented Reality (2008)

The authors have developed an Non-Invasive Ultrasound Theragnostic System to decrease the strain of patients and medical doctors. The system we propose tracks and follows movement in an affected area ---kidney stones here--- while High-Intensity Focused Ultrasound (HIFU) is irradiated onto the area. In this paper, a framework of the non-invasive ultrasound theragnostic system is proposed and illustrated. Specifically, the concept of the system is proposed at first. Secondly, decomposing and reconstructing (structuring) of the functional requirements are discussed. Third, the constructed system, which is based on those structured functional requirements, is illustrated. Fourth, the result of the servoing experiments of the model stone is reported to confirm the effectiveness of the proposed construction methodology and constructed system.
Informing Regulatory Dynamics in Open MASs
Authors: Carolina Felicíssimo, Ricardo Choren, Jean-Pierre Briot, Carlos Lucena
Venue: Coordination, Organizations, Institutions, and Norms in Agent Systems II: AAMAS 2006 and ECAI 2006 International Workshops, COIN 2006 Hakodate, Japan, May 9, 2006 Riva del Garda, Italy, August 28, 2006. Revised Selected Papers (2007)

We believe that, in the near future, all multi-agent systems (MASs) will be open, permitting agents to migrate among MASs to obtain resources or services not found locally. In this scenario, open MASs should be enhanced with norms for restricting agents' actions and, thus, avoiding unexpected behavior. In this work, we present a case study where an open MAS is enhanced with contextual norms. Agents from this MAS are continuously supported with precise norm information, according to their contexts (implicit situational information) and, then, can make better decisions. Although the presented case study is simple, it clearly shows different levels of norm abstractions and how agents can be influenced by norms while acting in a regulated open MASs.
Walking Appearance Manifolds without Falling Off
Authors: Nils Einecke, Julian Eggert, Sven Hellbach, Edgar Körner
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

Having a good description of an object's appearance is crucial for good object tracking. However, modeling the whole appearance of an object is difficult because of the high dimensional and nonlinear character of the appearance. To tackle the first problem we apply nonlinear dimensionality reduction approaches on multiple views of an object in order to extract the appearance manifold of the object and to embed it into a lower dimensional space. The change of the appearance of the object over time then corresponds to a walk on the manifold, with view prediction reducing to a prediction of the next step on the manifold. An inherent problem here is to constrain the prediction to the embedded manifold. In this paper, we show an approach towards solving this problem by applying a special mapping which guarantees that low dimensional points are mapped only to high dimensional points lying on the appearance manifold.
Toward a Cooperative Architecture for Delivering Government Services, Part 1
Authors: Ciro D'Urso
Venue: IT Professional (2003)

An Italian-government action plan includes standards for public administrations to implement cooperative patterns in exchanging services and data. 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 Usability of Music Theory Software: The Analysis of Twelve-Tone Music as a Case Study
Authors: Tuukka Ilomäki
Venue: Computer Music Modeling and Retrieval. Sense of Sounds: 4th International Symposium, CMMR 2007, Copenhagen, Denmark, August 27-31, 2007. Revised Papers (2008)

Computer applications are an everyday tool for music analysts, composers, and music theory students. While these applications are a welcome tool to be used in the classrooms and research labs, their effectiveness could be improved by focusing on their usability.The usability of a user interface can be evaluated and even measured with respect to the goals of its users. In order to demonstrate the evaluation of a user interface, I present an experiment in which the efficiency of user interfaces is assessed in the context of three scenarios or "use cases."Based on the experiment, I discuss some basic principles of usability theory, such as affordances, minimization of navigation, error handling, immediate feedback, and data visibility. The evaluation of these principles suggests some new types of music theory applications.
An effective framework for evaluating policy and infrastructure issues for e-commerce
Authors: C. Standing, S. Benson
Venue: Information Polity (2000)

The growth in electronic commerce has led a number of countries to develop national level plans and statements on electronic commerce or the information economy. The evaluation of these plans is difficult. An evaluation framework taken from the economics field is used to assess the value and the emphases of these plans. The factors considered are efficiency, justice, growth and stability. A revised model for evaluating electronic commerce/information economy policies is presented and discussed. This takes into account the significance of economic globalisation, cultural and linguistic concerns and security issues. Three national plans are evaluated to determine relevant factors for inclusion in such a framework. The policies are then compared and the implications for businesses, university educators and researchers are discussed. Companies should expect the trend of globalisation to continue and therefore they should attempt to re-position themselves to take advantage of new markets and new ways of doing business via the Web. Universities must position themselves for the improvements in telecommunications infrastructures by developing on-line multi-media courses and making sure all students are equipped with skills for the information economy. Researchers must start to develop links with industry since the funding for future research will inevitably come from the private sector if the guiding principles of these plans are taken seriously.
Reviewing and Evaluating Automatic Term Recognition Techniques
Authors: Ioannis Korkontzelos, Ioannis P. Klapaftis, Suresh Manandhar
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

Automatic Term Recognition (ATR) is defined as the task of identifying domain specific terms from technical corpora. Termhood-based approaches measure the degree that a candidate term refers to a domain specific concept. Unithood-based approaches measure the attachment strength of a candidate term constituents. These methods have been evaluated using different, often incompatible evaluation schemes and datasets. This paper provides an overview and a thorough evaluation of state-of-the-art ATR methods, under a common evaluation framework, i.e. corpora and evaluation method. Our contributions are two-fold: (1) We compare a number of different ATR methods, showing that termhood-based methods achieve in general superior performance. (2) We show that the number of independent occurrences of a candidate term is the most effective source for estimating term nestedness, improving ATR performance.
How to Play the Majority Game with Liars
Authors: Steve Butler, Jia Mao, Ron Graham
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

The Majority game is a two player game with a questioner Q and an answerer A. The answerer holds n elements, each of which can be labeled as 0 or 1. The questioner can ask questions comparing whether two elements have the same or different label. The goal for the questioner is to ask as few questions as possible to be able to identify a single element which has a majority label, or in the case of a tie claim there is none. We denote the minimum number of questions Q needs to make, regardless of A's answers, as q *. In this paper we consider a variation of the Majority game where A is allowed to lie up to t times, i.e., Q needs to find an error-tolerant strategy. In this paper we will give upper and lower bounds for q * for an adaptive game (where questions are processed one at a time), and will find q * for an oblivious game (where questions are asked in one batch).
How to Improve Medical Image Diagnosis through Association Rules: The IDEA Method
Authors: Marcela Xavier Ribeiro, Agma Juci Machado Traina, Caetano Traina Jr, Natalia Abdala Rosa, Paulo Mazzoncini de Azevedo Marques
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

In this paper we present a new method, called IDEA, which employs association rules to assist in medical image diagnosis. IDEA mines association rules, relating visual features with the knowledge gotten from specialists, and employs the associations to suggest possible diagnoses for a given medical image. IDEA incorporates two new algorithms called Omega and ACE. Omega performs simultaneously feature selection and data discretization very efficiently with linear cost on the number of feature values. ACE is a new associative classifier, which has the particular ability of suggesting multiple keywords to compose the diagnosis for a given medical image. The IDEA method has an important characteristic that makes it different from other CAD methods: it suggests multiple diagnosis hypotheses for an image and ranks them based on a measure of quality. The IDEA method was implemented in a prototype (IDEA system) for radiologists evaluate it. The radiologists showed enormous interest in employing the system to aid them in their daily work. The IDEA system was applied to real datasets and the results presented high accuracy (up to 96.7%). The results testify that association rules are well-suited to support the diagnosing task.
Clustering Based on LVQ and a Split and Merge Procedure
Authors: Fujiki Morii
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

Although learning vector quantization (LVQ) based on learning concept is a typical clustering method, we cannot necessarily obtain satisfactory classification results for linearly separable data. In this paper, a new clustering method based on LVQ and a split and merge procedure is proposed to realize reliable classification. Introducing a criterion of whether or not there is only one cluster in each class after clustering by LVQ, split subclasses in a class are merged into appropriate neighboring classes except one subclass. And the validity of the classification result is checked. Under several classification experiments, the performance of the proposed method is provided. 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