ppxscal/embedding_network huggingface dataset:
Recovering Internet Service Sessions from Operating System Failures
Authors: Florin Sultan, Aniruddha Bohra, Stephen Smaldone, Yufei Pan, Pascal Gallard, Iulian Neamtiu, Liviu Iftode
Venue: IEEE Internet Computing (2005)

Current Internet service architectures lack support for salvaging stateful client sessions when the underlying operating system fails due to hangs, crashes, deadlocks, or panics. The Backdoors (BD) system is designed to detect such failures and recover service sessions in clusters of Internet servers by extracting lightweight state associated with client service sessions from server memory. The BD architecture combines hardware and software mechanisms to enable accurate monitoring and remote healing actions, even in the presence of failures that render a system unavailable.
Modeling Connectionist Neuro-Fuzzy network and Applications
Authors: Mercy Shalinie
Venue: Neural Computing and Applications (2005)

The main objective of this paper is to propose a Neuro-Fuzzy network, which can model a system from input&#x2013;output data by automatically dividing the input&#x2013;output space and extracting fuzzy if-then rules from numerical data. The structure of the network is simple with input, rule and output layers only. The connections between input and rule layer is used to derive the membership functions of the fuzzified part. Kohonen&#x2019;s self-organizing learning algorithm is applied to partition the pattern space. Using this algorithm, similar rules are mapped close by and extraction of if-then rules is made easy. It can also adapt to a number of rules automatically. The proposed network is verified for three benchmark applications. Experimental results show that the adaptive method discussed in this paper not only trains in a few hundred iterations but also provides better performance measures when compared to conventional methods.
Orthogonal cubic spline collocation method for the extended Fisher-Kolmogorov equation
Authors: P. Danumjaya, Amiya K. Pani
Venue: Journal of Computational and Applied Mathematics (2005)

A second-order splitting combined with orthogonal cubic spline collocation method is formulated and analysed for the extended Fisher-Kolmogorov equation. With the help of Lyapunov functional, a bound in maximum norm is derived for the semidiscrete solution. Optimal error estimates are established for the semidiscrete case. Finally, using the monomial basis functions we present the numerical results in which the integration in time is performed using RADAU 5 software library.
A New Look at Coding and Decoding Algorithm for SFC-OFDM System
Authors: Weihong Fu, Weidong Kou
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In this paper, firstly we briefly introduce several exiting MIMO-OFDM systems. We take a new look at a coding and decoding algorithm of the STBC-OFDM system by applying it to the space-frequency coding (SFC) OFDM system. The SFC-OFDM system can achieve not only space diversity gain but also frequency diversity. Simulation results show that in a multi-path fading environment, the performance of the SFC-OFDM system proposed in this paper is rapidly improved over signal OFDM systems. The complexity of the proposed algorithm is lower than that of the other existing SFC-OFDM systems.
On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
Authors: Wen-Yang Lin, Chuen-Liang Chen
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

The height of the elimination tree has long acted as the only criterion for deriving a suitable fill-preserving sparse matrix ordering for parallel factorization. Although the deficiency in adopting height as the criterion for all circumstances was well recognized, no research has succeeded in alleviating this constraint. In this paper, we extend the unit-cost fill-preserving ordering into a generalized class that can adopt various aspects in parallel factorization, such as computation, communication, and algorithmic diversity. We recognize and show that if any cost function satisfies two mandatory properties, called the independence and conservation properties, a greedy ordering scheme then generates an optimal ordering with minimum completion cost. We also present an efficient implementation of the proposed ordering algorithm. Incorporating various techniques, the complexity can be improved from O(n log n+e) to O(q log q+$\kappa$), where n denotes the number of nodes, e the number of edges, q the number of maximal cliques, and $\kappa$ the sum of all maximal clique sizes in the filled graph. Empirical results show that the proposed algorithm can significantly reduce the parallel factorization cost without sacrificing much in terms of time efficiency.
Current Research in Voting, Elections, and Technology
Authors: Micah Altman, Gary M. Klass
Venue: Social Science Computer Review (2005)

The articles in this special issue raise and refine questions about our understanding of the use of, state of the art in, and challenges associated with voting and election technology, broadly conceived. Although researchers have yet to achieve consensus on the broad impact of information technology on our understanding of the practice of politics, the broad outlines of a research agenda are emerging. In this overview, we discuss the current work and identify important research questions that remain to be addressed.
Online robotic experiments for tele-education at the university of pisa
Authors: A. Bicchi, A. Caiti, L. Pallottino, G. Tonietti
Venue: Journal of Robotic Systems (2005)

In this paper we describe work being done at our department to make the robotics laboratory accessible to students and colleagues to execute and watch real-time experiments at any time and from anywhere. We describe a few different installations and highlight the underlying philosophy, which is aimed at enlarging the lab in all the dimensions of space, time, and available resources, through the use of Internet technologies. In particular, four experimental setups with hardware and software architecture description are presented: the dc motor, the magnetic levitator, the nonholomonic motion planner (NHMP), and the graphic environment tool. &copy; 2005 Wiley Periodicals, Inc.
RT-MuPAC: a new multi-power architecture for voice cellular networks
Authors: K. J. Kumar, B. S. Manoj, C. Siva Ram Murthy
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2005)

We have considered the problem of providing greater throughput in cellular networks. We propose a novel cellular architecture, RT-MuPAC, that supports greater throughput compared to conventional cellular architectures. RTMuPAC (Real-time Multi-power Architecture for Cellular Networks) is based on two fundamental features not present in today's cellular networks: usage of multiple hops and power control (power control is used only in a limited way to reduce interference and save battery energy for the mobile nodes in today's cellular networks). These features, we believe, will become increasingly important in next generation cellular systems as heterogeneous networks will operate in synergy. We also provide an analytical treatment of RT-MuPAC to support its superior performance. We show using detailed simulations that RT-MuPAC is indeed a significant improvement over conventional networks. We also discuss possible enhancements to the basic architecture in order to counter specific issues. RT-MuPAC can evolve from the existing infrastructure and offer advantages to both the service provider and the users. RT-MuPAC also serves as a proof of concept for the use of multi-hop architectures in cellular networks.
Open Calendar Sharing and Scheduling with CalDAV
Authors: Lisa Dusseault, Jim Whitehead
Venue: IEEE Internet Computing (2005)

Building on a decade of work on calendar standards, the CalDAV protocol promises to unlock the potential of widespread calendar interoperability. It permits calendar sharing over the Web and reduces the coordination cost of scheduling meetings across and within organizational boundaries. The protocol extends the Web Distributed Authoring and Versioning (WebDAV) protocol ¿ itself, a simple extension of HTTP ¿ to provide services for calendar maintenance, queries, event scheduling, and security.
Introduction to the special issue
Authors: Ralf Klamma, Markus Rohde, Gerry Stahl
Venue: ACM SIGGROUP Bulletin (2003)

This very special (and final) issue of the ACM SIGGROUP Bulletin presents products of a workshop on Community-Based Learning: Explorations into Theoretical Groundings, Empirical Findings and Computer Support that was held at the International Conference of the Learning Sciences (ICLS 2004).
Nearly optimal multi attribute auctions
Authors: Amir Ronen, Daniel Lehmann
Venue: Proceedings of the 6th ACM conference on Electronic commerce (2005)

In almost every procurement situation, non-price attributes of the items to be purchased play a crucial role. Procurement protocols which take these attributes into account are called multi-attribute auctions.We study the following problem called optimal multi-attribute auction design: A buyer wants to procure an item which can be supplied in many possible configurations. The buyer has a value v(x) for each possible configuration x. Every seller i has a privately known cost ci(x) of supplying each possible configuration. Given a probability distribution on the cost functions, our goal is to design an auction which maximizes the expected utility of the buyer.This paper offers a generic method for the construction of nearly optimal multi-attribute auctions. The computational time of our mechanisms equals the time required for computing (or approximating) the optimal mechanism on a small number of agents. Our method can be successfully applied to many variants of multi-attribute auction design.
Staffing and management of e-commerce programs and projects
Authors: Fred Niederman
Venue: Proceedings of the 2005 ACM SIGMIS CPR conference on Computer personnel research (2005)

Electronic commerce (e-commerce) personnel are instrumental in developing and maintaining electronic commerce programs and projects within firms. In spite of the dot-com bust, the number of firms developing and using e-commerce for interactions with customers and suppliers is growing. Personnel competence as individuals and as a group can be a decisive force in determining the level of success of e-commerce projects. This paper used in-depth interviews toward creating a better understanding of broad concepts and values in this area. More specifically, it examines the management and staffing of e-commerce projects in terms of how work is organized, which organizational unit governs e-commerce programs and management, how staff are assigned to projects and what skills are critical, and how outcomes are measured. Significant variance was identified in each of these areas.
Application of Direct and Large-Eddy Simulation Methods to Late Wakes of Submerged Bodies
Authors: Thomas S. Lund, David C. Fritts, Joseph A. Werne
Venue: Proceedings of the 2004 Users Group Conference (2004)

Late wakes of submerged bodies are simulated in support of the ONR Mechanics and Energy Conversion Turbulence Program. Direct numerical simulations (DNS) is used to examine the dynamics, energetics, and structure of wakes evolving to late times. Particular emphasis is placed on quantifying the structural differences between wakes of towed and self-propelled bodies and on quantifying the influences of environmental shear and stratification. The DNS results clearly show that wakes of towed bodies lead to larger-scale coherent structures at late times. Stratification tends to confine the wake in the vertical direction and provides a mechanism for the radiation of internal waves. Shear is found to interrupt the upscale cascade of vorticity. In addition to DNS, large-eddy simulation (LES) is considered as a means of accessing higher Reynolds numbers and of enabling broader parameter studies. As a first step in this direction, the LES approach is validated by repeating prior DNS on much coarser meshes. A parameter-free dynamic subgrid-scale model is used for this purpose and good results for low-order statistics are obtained on a mesh that is a factor of 4 coarser in each direction as compared with the DNS. When the effect of the increased time step is taken into account, this represents a factor of 4¿ = 256 reduction in computational expense. Thus LES can greatly reduce the computer time needed for wake studies and can allow significant increases in Reynolds number.
Sampling algorithms in a stream operator
Authors: Theodore Johnson, S. Muthukrishnan, Irina Rozenbaum
Venue: Proceedings of the 2005 ACM SIGMOD international conference on Management of data (2005)

Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximate streaming algorithms for this application. Many of these algorithms produce samples of the input stream, providing better properties than conventional random sampling. In this paper, we abstract the stream sampling process and design a new stream sample operator. We show how it can be used to implement a wide variety of algorithms that perform sampling and sampling-based aggregations. Also, we show how to implement the operator in Gigascope - a high speed stream database specialized for IP network monitoring applications. As an example study, we apply the operator within such an enhanced Gigascope to perform subset-sum sampling which is of great interest for IP network management. We evaluate this implemention on a live, high speed internet traffic data stream and find that (a) the operator is a flexible, versatile addition to Gigascope suitable for tuning and algorithm engineering, and (b) the operator imposes only a small evaluation overhead. This is the first operational implementation we know of, for a wide variety of stream sampling algorithms at line speed within a data stream management system.
A multilingual usage consultation tool based on internet searching: more than a search engine, less than QA
Authors: Kumiko Tanaka-Ishii, Hiroshi Nakagawa
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

We present a usage consultation tool, based on Internet searching, for language learners. When a user enters a string of words for which he wants to find usages, the system sends this string as a query to a search engine and obtains search results about the string. The usages are extracted by performing statistical analysis on snippets and then fed back to the user.Unlike existing tools, this usage consultation tool is multi-lingual, so that usages can be obtained even in a language for which there are no well-established analytical methods. Our evaluation has revealed that usages can be obtained more effectively than by only using a search engine directly. Also, we have found that the resulting usage does not depend on the search engine for a prominent usage when the amount of data downloaded from the search engine is increased.
SLIP AESTHEASIS: A Portable 2D Slip/Skin Stretch Display for the Fingertip
Authors: N. G. Tsagarakis, T. Horne, D. G. Caldwell
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Two dimensional lateral skin motions during manipulation are vital in ensuring grasping stability. This paper outlines the research, design, construction and testing of a completely portable slip/stretch feedback system for the fingertip. The device uses a V configuration of miniature motors to provide sensations of relative lateral motion (direction and velocity) onto the userýs fingertips. This device has a mass of 22g at the fingertip, 105g at the forearm, Bluetooth communication to the simulation computer and a capacity of over 2hrs continuous use. Testing involved user trails to determine quantitatively and qualitatively the realism and accuracy of the integrated system. These results show good levels of user ability to discriminate both directional and speed movements.
Decidable call-by-need computations in term rewriting
Authors: Irène Durand, Aart Middeldorp
Venue: Information and Computation (2005)

The theorem of Huet and Lévy stating that for orthogonal rewrite systems (i) every reducible term contains a needed redex and (ii) repeated contraction of needed redexes results in a normal form if the term under consideration has a normal form, forms the basis of all results on optimal normalizing strategies for orthogonal rewrite systems. However, needed redexes are not computable in general. In the paper we show how the use of approximations and elementary tree automata techniques allows one to obtain decidable conditions in a simple and elegant way. Surprisingly, by avoiding complicated concepts like index and sequentiality we are able to cover much larger classes of rewrite systems. We also study modularity aspects of the classes in our hierarchy. It turns out that none of the classes is preserved under signature extension. By imposing various conditions we recover the preservation under signature extension. By imposing some more conditions we are able to strengthen the signature extension results to modularity for disjoint and constructor-sharing combinations.
M-Modeler: a framework implementation for modeling m-commerce applications
Authors: Ana Hilda Morales-Aranda, Oscar Mayora-Ibarra, Santiago Negrete-Yankelevich
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

At the present time, the use of mobile technology in business, is becoming an opportunity to generate competitive advantages within organization environments. Mobile technology helps a company to optimize its internal processes and services by means of added flexibility in order to access information anytime, anywhere. In this work we introduce M-Modeler, a software tool for modeling m-commerce businesses. Our approach starts from structural patterns in order to produce integral m-business solutions within organizations. M-Modeler implements a framework, based on m-business patterns that helps to reduce the ambiguity in business rules. This is specially useful in the design and construction phases of m-commerce systems development process. The framework allows the user to generate m-business solutions regardless of the specific mobile application. M-Modeler generates XML-based metadata of business workflows that may evolve with the constant necessities of change caused by the emergence of new market strategies demanded by the globalization.
WAND: a meta-data maintenance system over the internet
Authors: Anubhav Bhatia, Saikat Mukherjee, Saugat Mitra, Srinath Srinivasa
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

WAND is a meta-data management system that provides a file-system tree for users of an internet based P2P network. The tree is robust and retains its structure even when nodes (peers) enter and leave the network. The robustness is based on a concept of virtual folders that are automatically created to retain paths to lower level folders whenever a node hosting a higher-level folder moves away. Other contributions of the WAND system include its novel approach towards managing root directory information and handling network partitions.
High-order RKDG Methods for Computational Electromagnetics
Authors: Min-Hung Chen, Bernardo Cockburn, Fernando Reitich
Venue: Journal of Scientific Computing (2005)

In this paper we introduce a new RKDG method for problems of wave propagation that achieves full high-order convergence in time and space. The novelty of the method resides in the way in which it marches in time. It uses an mth-order m-stage, low storage SSP-RK scheme which is an extension to a class of non-autonomous linear systems of a recently designed method for autonomous linear systems. This extension allows for a high-order accurate treatment of the inhomogeneous, time-dependent terms that enter the semi-discrete problem on account of the physical boundary conditions. Thus, if polynomials of degree k are used in the space discretization, the RKDG method is of overall order m = k + 1, for any k > 0. Moreover, we also show that the attainment of high-order space--time accuracy allows for an efficient implementation of post-processing techniques that can double the convergence order. We explore this issue in a one-dimensional setting and show that the superconvergence of fluxes previously observed in full space--time DG formulations is also attained in our new RKDG scheme. This allows for the construction of higher-order solutions via local interpolating polynomials. Indeed, if polynomials of degree k are used in the space discretization together with a time-marching method of order 2k + 1, a post-processed approximation of order 2k + 1 is obtained. Numerical results in one and two space dimensions are presented that confirm the predicted convergence properties.
Separating the Power of Monotone Span Programs over Different Fields
Authors: Amos Beimel, Enav Weinreb
Venue: SIAM Journal on Computing (2005)

Monotone span programs represent a linear-algebraic model of computation. They are equivalent to linear secret sharing schemes and have various applications in cryptography and complexity. A fundamental question regarding them is how the choice of the field in which the algebraic operations are performed affects the power of the span program. In this paper we prove that the power of monotone span programs over finite fields of different characteristics is incomparable; we show a superpolynomial separation between any two fields with different characteristics, solving an open problem of Pudlák and Sgall [Algebraic models of computation and interpolation for algebraic proof systems, in Proof Complexity and Feasible Arithmetic, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 39, P. W. Beame and S. Buss, eds., AMS, Providence, RI, 1998, pp. 279--296]. Using this result we prove a superpolynomial lower bound for monotone span programs for a function in uniform-${\cal N}C^2$ (and therefore in ${\cal P}$), solving an open problem of Babai, Gál, and Wigderson [Combinatorica, 19 (1999), pp. 301--319]. (All previous superpolynomial lower bounds for monotone span programs were for functions not known to be in ${\cal P}$.) Finally, we show that quasi-linear secret sharing schemes, a generalization of linear secret sharing schemes introduced in Beimel and Ishai [On the power of nonlinear secret-sharing, in Proceedings of the 16th Annual IEEE Conference on Computational Complexity, 2001, pp. 188--202], are stronger than linear secret sharing schemes. In particular, this proves, without any assumptions, that nonlinear secret sharing schemes are more efficient than linear secret sharing schemes.
A lightweight mobile platform for Business Services Networks
Authors: Zhicong Leo Liang, Raymond K. Wong
Venue: Proceedings of the IEEE EEE05 international workshop on Business services networks (2005)

Business Services Networks (BSNs) facilitate a large variety of business service models and business service automation. While mobile computing is becoming increasingly important, issues of extending BSNs for mobile applications have not been addressed. This paper investigates and experiments with a few issues that will mostly occur for supporting mobile applications through BSNs. In particular, this paper will examine service location discovery, service invocation, and information conversion for mobile environments.
Selected AI-related dissertations
Authors: Susanne M. Humphrey, Bob Krovetz
Venue: Issue 92 (April 1985) (1985)

The following are citations selected by title and abstract as being related to Al, resulting from a computer search on the BRS retrieval system of the Dissertation Abstracts International (DAI) database produced by University Microfilms International.