ppxscal/embedding_network huggingface dataset:
Environmental Acquisition in Network Management
Venue: Proceedings of the 16th USENIX conference on System administration (2002)

Maintaining configurations in heterogeneous networks poses complex problems. We observe that medium and large networks exhibit many contextual relationships, and argue that modeling these relationships explicitly simplifies configuration management. This paper presents a declarative data specification language, called Anomaly, that implements our ideas. Anomaly models containment relationships and uses a data aggregation technique called environmental acquisition to simplify system management. The interpreter for the language generates and deploys configurations from a source code description of the network and its hosts.
Mobile multimedia services development: value chain perspective
Authors: Jari Karvonen, Juhani Warsta
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

This paper describes and analyses the mobile value chain development, value generation and mobile application development processes. The study is based on eight small multimedia and software companies that use the latest technological possibilities provided by the mobile Internet. The development processes analyzed give a good understanding of how the mobile value chain is made up as seen from the perspective of the development of state-of-the-art mobile multimedia service and content applications (MMS) within the companies studied. The mobile multimedia applications in question were games, short films, music videos, still pictures, and advertisement videos. The processes were scrutinized in order to find out how the different groups of developers act together with their value net partners according to the preset project plan as they develop new applications and content in the mobile multimedia environment. The essential elements, actors as well as their roles in the MMS development processes were analyzed in order to depict the structure of a mobile value network.
Network-Based Problem Detection for Distributed Systems
Authors: Hisashi Kashima, Tadashi Tsumura, Tsuyoshi Ide, Takahide Nogayama, Ryo Hirade, Hiroaki Etoh, Takeshi Fukuda
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

We introduce a network-based problem detection framework for distributed systems, which includes a data-mining method for discovering dynamic dependencies among distributed services from transaction data collected from network, and a novel problem detection method based on the discovered dependencies. From observed containments of transaction execution time periods, we estimate the probabilities of accidental and non-accidental containments, and build a competitive model for discovering direct dependencies by using a model estimation method based on the online EM algorithm. Utilizing the discovered dependency information, we also propose a hierarchical problem detection framework, where microscopic dependency information is incorporated with a macroscopic anomaly metric that monitors the behavior of the system as a whole. This feature is made possible by employing a network-based design which provides overall information of the system without any impact on the performance.
Real-Time Facial Expression Recognition Based on Boosted Embedded Hidden Markov Model
Authors: Xiaoxu Zhou, Xiangsheng Huang, Bin Xu, Yangsheng Wang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

The most expressive way human display emotion is through facial expressions. Facial expression recognition is necessary for designing any practical human-machine interfaces. This paper proposes a novel framework to real-time facial expression recognition within the interactive computer environment. The two major contributions of this work are: First, we proposed a novel network structure and parameters learning algorithm for embedded HMM [1] based on AdaBoost [2]. Second, we apply this optimized embedded HMM to real-time facial expression recognition. In this paper, the embedded HMM uses two-dimensional Discrete Cosine Transform (2DDCT) coefficients as the observation vectors opposite to previous HMM approaches which use pixel intensities to form the observation vectors. Our proposed system reduces the complexity of the training and recognition system. It offers a more flexible framework and can be used in real-time human-machine interactive applications. Experimental results demonstrate that the proposed approach is an effective method to recognize facial expression.
Standardization approach for information retrieval in WAN
Authors: Krasimir Trichkov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

This paper aims to present an ANSI/NISO Z39.50 protocol for distributed searching in library applications. It specifies Z39.50 client and Z39.50 server behavior for search and retrieval across online library catalogues. The paper examines the potential of Z39.50 to enable new methods of data creation and exchange in library networks. The essence of SRW, the Search/Retrieve Webservice, XML oriented protocol for business communication is explained.
A problem by Jensen
Authors: William Knight
Venue: ACM SIGNUM Newsletter (1972)

Throughout, all matrices are real, S denotes a symmetric matrix, T a lower triangular matrix, and D a diagonal matrix. The following problem appeared in the May <u>Signum Newsletter</u> [1]. Given S, for what values of &mu; can T and D be found such that TDTt = (S - &mu;I)? A sufficient condition is that &mu; not be an eigenvalue of any proper leading diagonal submatrix of S. A necessary and sufficient condition is this. Let m(&nu;) be the multiplicity of &mu; as an eigenvalue of the leading &nu; by &nu; diagonal submatrix of S, zero if &mu; is not an eigenvalue of that submatrix. The condition is that the sequence, m(&nu;), (including the element for S as an improper submatrix of itself) be nondecreasing. This follows from the lemma below.
Enabling fast and effortless customisation in accelerometer based gesture interaction
Authors: Jani Mäntyjärvi, Juha Kela, Panu Korpipää, Sanna Kallio
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

Accelerometer based gesture control is proposed as a complementary interaction modality for handheld devices. Predetermined gesture commands or freely trainable by the user can be used for controlling functions also in other devices. To support versatility of gesture commands in various types of personal device applications gestures should be customisable, easy and quick to train. In this paper we experiment with a procedure for training/recognizing customised accelerometer based gestures with minimum amount of user effort in training. Discrete Hidden Markov Models (HMM) are applied. Recognition results are presented for an external device, a DVD player gesture commands. A procedure based on adding noise-distorted signal duplicates to training set is applied and it is shown to increase the recognition accuracy while decreasing user effort in training. For a set of eight gestures, each trained with two original gestures and with two Gaussian noise-distorted duplicates, the average recognition accuracy was 97%, and with two original gestures and with four noise-distorted duplicates, the average recognition accuracy was 98%, cross-validated from a total data set of 240 gestures. Use of procedure facilitates quick and effortless customisation in accelerometer based interaction.
Recognizing Hand-Raising Gestures using HMM
Authors: Monowar Hossain, Michael Jenkin
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

Automatic attention-seeking gesture recognition is an enabling element of synchronous distance learning. Recognizing attention seeking gestures is complicated by the temporal nature of the signal that must be recognized and by the similarty between attention seeking gestures and non-attention seeking gestures. Here we describe two approaches to the recognition problem that utilize HMMs to learn the class of attention seeking gestures. An explicit approach that encodes the temporal nature of the gestures within the HMM, and an implicit approach that augments the input token sequence with temporal markers. Experimental results demonstrate that the explicit approach is more accurate.
Toward resilient security in wireless sensor networks
Authors: Hao Yang, Fan Ye, Yuan Yuan, Songwu Lu, William Arbaugh
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

Node compromise poses severe security threats in wireless sensor networks. Unfortunately, existing security designs can address only a small, fixed threshold number of compromised nodes; the security protection completely breaks down when the threshold is exceeded. In this paper, we seek to overcome the threshold limitation and achieve resiliency against an increasing number of compromised nodes. To this end, we propose a novel location-based approach in which the secret keys are bound to geographic locations, and each node stores a few keys based on its own location. The location-binding property constrains the scope for which individual keys can be (mis)used, thus limiting the damages caused by a collection of compromised nodes. We illustrate this approach through the problem of report fabrication attacks, in which the compromised nodes forge non-existent events. We evaluate our design through extensive analysis, implementation and simulations, and demonstrate its graceful performance degradation in the presence of an increasing number of compromised nodes.
Packing cuts in undirected graphs
Venue: Networks (2004)

We address the problem of finding the largest collection of edge-disjoint cuts in an undirected graph, dubbed CUT PACKING, focusing on its complexity, about which very little is known. We show a very close relationship with INDEPENDENT SET, namely, for the same graph G, the size of the largest cut packing of G is at least the independence number of G, and at most twice that number. This implies that any approximation guarantee for INDEPENDENT SET immediately extends to CUT PACKING within a factor of 2. In particular, this yields a 2-approximation algorithm for CUT PACKING in perfect graphs. We then present polynomial-time algorithms for several classes of perfect &lpar;and related&rpar; graphs, including triangulated graphs and their complements, bipartite graphs and their complements, and Seymour graphs. Finally, we discuss various linear programming relaxations for the problem, finding combinatorial dual problems of CUT PACKING and characterizing the cases in which duality is strong. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;1&rpar;, 1&ndash;11 2004
Augmenting graphs for independent sets
Authors: Vladimir E. Alekseev, Vadim V. Lozin
Venue: Discrete Applied Mathematics (2004)

We consider a general approach to solve the maximum independent set problem based on finding augmenting graphs. For some special classes of graphs, the approach provides polynomial solutions. In this paper we survey classical and recent results on the topic, and describe a new one that generalizes two previously known algorithms. We also discuss some open questions related to the notion of augmenting graphs.
AN EVALUATION OF ALTERNATIVE DESIGNS FOR VARIABLE SELECTION LISTS
Authors: Alan J. Happ, Sharon L. Stanners
Venue: ACM SIGCHI Bulletin (1991)

Alternative designs for the selection of items from a list were evaluated using a Thurstone scaling technique. When making choices among alternative designs, the software designer often wants to know the magnitude of the differences among the designs. This poster demonstrated the use of this technique to help software designers make more informed decisions.
Content availability, pollution and poisoning in file sharing peer-to-peer networks
Authors: Nicolas Christin, Andreas S. Weigend, John Chuang
Venue: Proceedings of the 6th ACM conference on Electronic commerce (2005)

Copyright holders have been investigating technological solutions to prevent distribution of copyrighted materials in peer-to-peer file sharing networks. A particularly popular technique consists in "poisoning" a specific item (movie, song, or software title) by injecting a massive number of decoys into the peer-to-peer network, to reduce the availability of the targeted item. In addition to poisoning, pollution, that is, the accidental injection of unusable copies of files in the network, also decreases content availability. In this paper, we attempt to provide a first step toward understanding the differences between pollution and poisoning, and their respective impact on content availability in peer-to-peer file sharing networks. To that effect, we conduct a measurement study of content availability in the four most popular peer-to-peer file sharing networks, in the absence of poisoning, and then simulate different poisoning strategies on the measured data to evaluate their potential impact. We exhibit a strong correlation between content availability and topological properties of the underlying peer-to-peer network, and show that the injection of a small number of decoys can seriously impact the users' perception of content availability.
Computational and Information-Theoretic Soundness and Completeness of Formal Encryption
Authors: Pedro Adao, Gergei Bana, Andre Scedrov
Venue: Proceedings of the 18th IEEE workshop on Computer Security Foundations (2005)

We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information of the encrypted plaintext is revealed. We consider not only computational, but also purely probabilistic, information-theoretic interpretations. We present a general, systematic treatment of the expansions of the logic for symmetric encryption. We establish general soundness and completeness theorems for the interpretations. We also present applications to specific settings not covered in earlier works: a purely probabilistic one based on One-Time Pad, and computational settings of the so-called type-2 (which-key revealing) andtype-3 (which-key and length revealing) encryption schemes based on computational complexity.
Organic Computing " On the Feasibility of Controlled Emergence
Authors: C. Muller-Schloer
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

This paper gives an introduction to the new research area of Organic Computing and shows chances, opportunities and problems currently tackled by researchers. First the visions that lead to this new research area are discussed briefly. It is shown that the notion of emergence, a central phenomenon in Organic Compting, is a typical bottom-up effect with the interesting property of generating order from randomness. The classical design, however, is a top-down process. This apparent contradiction can be overcome by introducing so-called Observer/Controller architectures leading to the possibility to controlled emergence. The paper concludes with a description of current research problems in Organic Computing.
Correspondence: Response to "Are Complete K-Trees Something More than Decision Trees?"
Authors: Edward N. Schwartz, Gerard Kiernan, Arnold Koltun
Venue: ACM SIGART Bulletin (1991)

This is a response to the Correspondence from Gabriel Valiente regarding the article "Using Complete K-Trees to Generate Code in Pascal for an Expert System" that appeared in Volume 1 Number 2 of the SIGART Bulletin. Contrary to his assertion that the idea of a complete K-Tree is the central result presented, as the title indicates, the central result is the use of K-Trees to generate high level code for expert systems. Generation of such code is becoming increasingly important as expert systems, or what many people refer to as expert systems, are being integrated into larger applications. We would, nevertheless, like to clarify some of the points made in the Correspondence.
Problem identification using program checking
Authors: Christian S. Collberg, Todd A. Proebsting
Venue: Discrete Applied Mathematics (2004)

We describe AλgoVista, a web-based search engine that assists computer scientists find algorithms and implementations that solve specific problems. AλgoVista also allows algorithm designers to advertise their results in a forum accessible to programmers and theoreticians alike. AλgoVista is not keyword based. Rather, users provide input ↠ output samples that describe the behavior of their needed algorithm. This query-by-example requires no knowledge of specialized terminology --the user only needs an ability to formalize her problem. AλgoVista's search mechanism is based on a novel application of program checking, a technique developed as an alternative to program verification and testing. AλgoVista operates at http://www.algovista.com.
Robust L" Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming
Authors: Qifa Ke, Takeo Kanade
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing data, which often happen in real measurements, SVD is no longer applicable. For robustness Iteratively Re-weighted Least Squares (IRLS) is often used for factorization by assigning a weight to each element in the measurements. Because it uses L¿ norm, good initialization in IRLS is critical for success, but is non-trivial. In this paper, we formulate matrix factorization as a L¿ norm minimization problem that is solved efficiently by alternative convex programming. Our formulation 1) is robust without requiring initial weighting, 2) handles missing data straightforwardly, and 3) provides a framework in which constraints and prior knowledge (if available) can be conveniently incorporated. In the experiments we apply our approach to factorization-based structure from motion. It is shown that our approach achieves better results than other approaches (including IRLS) on both synthetic and real data.
Proceedings of the tenth international conference on 3D Web technology
Venue: 3D technologies for the World Wide Web (2005)

The Web has come a long way since the first VRML conference, VRML '95, was held in San Diego in December 1995. The conference was known as VRML 'xx until 2001 when it was renamed the Web3D Symposium.This year the Web3D community attains a significant landmark, the 10th conference in the series. From San Diego in 1995, the conference moved to Monterey for 97 and 98, then to Europe (Paderborn in Germany) for 99, back to Monterey in 2000, Paderborn in 2001, Tempe Arizona in 2002, Saint Malo, France, in 2003, Monterey in 2004 and now, for the first time, Wales (UK) for 2005. Proceedings of all 10 conferences have been published by ACM Press and are incorporated into the ACM Digital Library.The Web3D Consortium and the Web3D community of researchers and practitioners works long and hard to foster the development and promote the use of International Standards for 3D graphics on the World Wide Web. This year has seen, among other things, the approval and publication of the X3D Specification as an ISO/IEC International Standard (ISO/ IEC 19775:2004), the emergence of the Medical Working Group, and new initiatives concerning Learning, Education and Training.This volume contains the papers accepted for the Web3D 2005 Symposium on 3D Web Technologies. The conference covers a broad spectrum of interests from languages and tools to human-computer interaction issues and applications.This year, 30 paper submissions were received. Very strict selection rules were applied and only 18 papers have been accepted (i.e. a 40% rejection rate). The accepted papers represent a broad cross-section of work from a wide range of countries. It is interesting to note that topics covered by papers in the VRML '95 conference are still important topics today, for example specifying behaviour and multi-user support.The volume presents the state of the art in this challenging area of computer graphics and we hope that both academics and practitioners will find it a useful source of inspiration as well as a valuable reference resource.
Enhancing Cluster Application Performance via Smarter Scheduling and Stronger SOAP
Authors: Daniel Andresen
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 10 - Volume 11 (2005)

Current systems for managing workload on clusters of workstations, particularly those available for Linux-based (Beowulf) clusters, are typically based on traditional process-based, coarse-grained parallel and distributed programming. The DESPOT project is building a sophisticated resource-monitoring and scheduling system for computational, storage and network resources. In this paper we present our enhanced scheduling algorithm within DESPOT, our architecture for low-overhead, fine-grained resource-monitoring tools for per-process network and other resource usage. This algorithm takes into account network, CPU, and memory demands to go beyond simple load balancing for better performance. We also present our architecture for enhancing inter-process communication using the SOAP protocol through the application of multi-level caching. We present experimental results on a small Beowulf cluster showing scheduling performance gains of up to 40%, using the multi-facetted DESPOT algorithm over the MOSIX load-balancing implementation, and SOAP performance gains of up to 600%.
Parallelizing the Keldysh Formalism for Strongly Correlated Electrons
Authors: J. K. Freericks, V. Turkowski, V. Zlatic
Venue: Proceedings of the 2004 Users Group Conference (2004)

Nonequilibrium quantum mechanics can be solved with the Keldysh formalism, which evolves the quantum mechanical states forward in time in the presence of a time-dependent field, and then evolves them backward in time, undoing the effect of the time-dependent field. The Feynman path integral over the Keldysh contour is employed to calculate the strongly correlated Green's function. We examine the accuracy of this procedure for the simplest problem that requires a nonequilibrium formulation: the electron spectral function of thespinless Falicov-Kimball model.