ppxscal/embedding_network huggingface dataset:
Multiple Layer Based Background Maintenance in Complex Environment
Authors: Tao Yang, Quan Pan, Stan Z. Li, Jing Li
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

A fast and efficient multiple layer background maintenance model is built to conserve the original and the current background separately. Fusing the properties of object motion in image pixels and the changes between the input video and the multiple background layers, this method could handle various sources of scene changes, including ghosts, abandon objects and illumination changes. An intelligent video surveillance system is developed to test the performance of the algorithm. Experiments are performed using long video sequences under different conditions indoor and outdoor. The results show that the proposed algorithm is effective and efficient in real-time and accurate background maintenance in complex environment.
A note on the maximization of matrix valued Hankel determinants with applications
Authors: Holger Dette, W. J. Studden
Venue: Journal of Computational and Applied Mathematics (2005)

In this note, we consider the problem of maximizing the determinant of moment matrices of matrix measures. The maximizing matrix measure can be characterized explicitly by having equal (matrix valued) weights at the zeros of classical (one-dimensional) orthogonal polynomials. The results generalize classical work of Schoenberg (Indag. Math. 62 (1959) 282) to the case of matrix measures. As a statistical application we consider several optimal design problems in linear models, which generalize the classical weighing design problems.
Sleepless night: amnesia
Authors: Derek Michael Besant
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

If cognition is « an investigation of the action of knowing -- or consciousness -- or a product of such action (recognition) » as defined in the Oxford Dictionary on Historical Principals; then cognition could be an artefact in and of itself, as an artificial premise conceived by the human brain, as a way of dealing with how we think... To this, I would ask the question whether or not Memory might indeed be more about Forgetting than Remembering?
A Temporal Order Resolution Algorithm in the Multi-server Time Stamp Service Framework
Authors: Pei-yih Ting
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

This paper describes solutions to resolve chronological orders of time stamps issued by multiple time stamp authorities (TSAs). The communication, computation, and storage overhead to provide such a service is considerably low. The correctness of the proposed algorithm is proved and the worst-case computation bound is also derived. The proposed resolution algorithm and the supporting "cross reference mark" server strategy can be applied in a multi-server timestamp service (TSS) framework with trusted or distrusted servers to obtain deterministic time stamp comparison results.
TxtBoard: from text-to-person to text-to-home
Authors: Kenton O'Hara, Richard Harper, Axel Unger, James Wilkes, Bill Sharpe, Marcel Jansen
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The design of existing mobile phone technology has emphasised the primacy of person-to-person communication for voice, SMS and image-based communication. It may be contrasted with place-to-place communication, the key property of fixed line telephony. However, other forms of communication may mix these two approaches: these include place-to-person or person-to place for example. These patterns may afford different values to users. This reports a field study of a prototype person-to-place SMS communications device, 'TxtBoard'. This is a small, fixed display appliance for home settings. It displays text messages sent to it from any standard mobile phone. The study highlights how the person-to-place character of the device, combined with the 'public' or situated characteristics of its placement within home settings in particular, create new opportunities for use of SMS.
Experience buffers: a socially appropriate, selective archiving tool for evidence-based care
Authors: Gillian R. Hayes, Khai N. Truong, Gregory D. Abowd, Trevor Pering
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Diagnosis, treatment, and monitoring of interventions for children with autism can profit most when caregivers have substantial amounts of data they can easily record and review as evidence of specific observed behaviors over time. Through our work with one prototype system and interviews with caregivers, we have recognized the importance of socially appropriate ways to add rich data to the information recorded by caregivers. Analysts must be able to view incidents as they occurred without unnecessarily burdening caregivers and other children with always-on recording of data about them. In this paper, we introduce experience buffers, a collection of capture services embedded in an environment that, though always on and available, require explicit user action to store an experience.. This creates a way to balance the social, technical, and practical concerns of capture applications.
Diversified SCM standard for the Japanese retail industry
Authors: Koichi Hayashi, Naoki Koguro, Reki Murakami
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

In this paper, we present the concept of a diversified SCM (supply chain management) standard and distributed hub architecture which were used in B2B experiments for the Japanese retail industry. The conventional concept of B2B standards develops a single ideal set of business transactions to be supported. In contrast, our concept allows a wide range of diverse business transaction patterns necessary for industry supply chains. An industry develops a standard SCM model that partitions the whole supply chain into several transaction segments, each of which provides alternative business transaction patterns. For B2B collaboration, companies must agree on a collaboration configuration, which chooses the transaction alternatives from each segment. To support the development of a B2B system that executes an agreed collaboration, we introduce an SOA (service oriented architecture) based pattern called a distributed hub architecture. As a hub of B2B collaboration, it includes a complete set of services that can process every possible business transaction included in a standard SCM model. However, it does not function as a centralized service that coordinates participants. Instead, it is deployed on every participant and executes the assigned part of the supply chain collaboratively with other distributed hubs. Based on this concept, we analyzed actual business transactions in the Japanese retail industry and developed a standard SCM model, which represents more than a thousand possible transaction patterns. Based on the model, we developed an experimental system for the Japanese retail industry. The demonstration experiment involved major players in the industry including one of the largest general merchandise stores, one of the largest wholesalers, and major manufacturers in Japan.
Recognizing Patterns in High-Dimensional Data: Automated Histogram Filtering for Protein Structure Elucidation
Authors: Janine Imada, Paul Chapman, Stuart M. Rothstein
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

Advanced automated clustering algorithms are essential to meet the challenge of understanding high-dimensional data that arise in protein structure elucidation. In this paper, we first describe a powerful new approach to cluster analysis, automated histogram filtering (AHF). We follow this by a review of applications of AHF-clustering of Monte Carlo and molecular dynamics simulation data for off-lattice and all-atom model protein systems. Next, we present the results of a time-complexity analysis performed on a computer cluster suggesting how the computational effort scales with the size of the protein and the number of processors. And finally, we conclude with a summary of our findings.
Generating pen-plotter drawings from selective point-sets of digital photographs
Authors: Hans E. Dehlinger
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

A significant property of pen-plotter drawings is their reliance on a physically / mechanically drawn line. It is the pen, which is drawing the line. Interesting aesthetic consequences follow from this for drawings executed on pen-plotters. The paper addresses a particular generative approach to produce such drawings. It is assumed that the starting points of lines play an important role in the generative algorithm and a strategy has been programmed to collect selective point-sets from digital photographs, which are then used as starting points for an algorithmically generated drawing. The generative sequence is discussed.
Transposing F to C&sharp;: expressivity of parametric polymorphism in an object-oriented language: Research Articles
Authors: Andrew Kennedy, Don Syme
Venue: Concurrency and Computation: Practice Experience (2004)

We present a type-preserving translation of System F (the polymorphic lambda calculus) into a forthcoming revision of the C&sharp; programming language supporting parameterized classes and polymorphic methods. The forthcoming revision of Java in JDK 1.5 also makes a suitable target. We formalize the translation using a subset of C&sharp; similar to Featherweight Java. We prove that the translation is fully type-preserving and that it preserves behaviour via the novel use of environment-style semantics for System F.We observe that whilst parameterized classes alone are sufficient to encode the parameterized datatypes and let-polymorphism of languages such as ML and Haskell, it is the presence of dynamic dispatch for polymorphic methods that supports the encoding of the &lsquo;first-class polymorphism&rsquo; found in System F and recent extensions to ML and Haskell. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Dynamic Multiplexing and High-Performance Modeling in Distributed Simulation
Authors: Jong S. Lee, Bernard P. Zeigler
Venue: Simulation (2005)

This article reviews existing message traffic reduction schemes and proposes a dynamic multiplexing approach as an efficient message traffic reduction scheme. This approach is based on a dynamic encoding of the joint output of sender components into a single message and is applicable to a model involving distributed components moving and interacting in multidimensional space by combining with predictive interest-based quantization. This article applies this approach to a projectile/missile application with realistic multidimensional dynamics. The authors investigate the dependence of simulation accuracy and required network bandwidth on the number of active components and basic time granule. Analysis and empirical data clearly indicate the advantages of dynamic multiplexing in saving communication and computation resources in a large-scale distributed system.
Notes on notes on postmodern programming
Authors: James Noble, Robert Biddle
Venue: ACM SIGPLAN Notices (2004)

These notes have the status of letters written to ourselves: we wrote them down because, without doing so, we found ourselves making up new arguments over and over again. So began the abstract of our earlier paper Notes on Postmodern Programming. We now revisit the issue of postmodern programming, and attempt to address some of the questions raised by our exposition. To illustrate the nature of postmodernism we do not do this directly, but instead present a series of snapshots, parodies, and imagined conversations that we hope will help. What do you think of the abstract so far? Self-reference and a irreverent approach are part of this topic, so it's important to chill out and let things flow. We claim that computer science and software design grew up amid the unquestioned landscape of modernism, and that too often we cling to the otherwise ungrounded values, even as modernism itself is ever more compromised.
Frobenius-Padé approximants for d-orthogonal series: theory and computational aspects
Authors: José M. A. Matos, Zélia da Rocha
Venue: Applied Numerical Mathematics (2005)

This work is about Frobenius-Padé approximants for series of orthogonal polynomials of dimension d (d ∈ N). Concerning the series, we give the projection property of partial sums, show how to compute their coefficients, and how to get the coefficients of the product of a series by a polynomial. Concerning the approximants, we essentially deal with their recursive computation. Also, we give several examples and numerical results.
Two-prime RSA immune cryptosystem and its FPGA implementation
Authors: Y. Yang, Z. Abid, W. Wang
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

In this paper, an efficient immunity method is proposed for two-prime RSA cryptosystem against hardware fault attack. The proposed system has more immunity than the previous system and is targeted for FPGA implementation. For the 32-bit signing case, the proposed method is 15% faster than the previous design while requiring only 70% of the hardware resource.
Rüüg: long-distance communication
Authors: Adriana Thompson, Aurelia Friedland, Jenny Cargiuolo
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

To provide a long-distance communication device that would appeal to college students and recent graduates, the Rüüg team researched long-distance and face-to-face communication in more than 70 potential users. This research (consisting of surveys, observation, and directed storytelling) revealed the importance of body language and gestures and their communication of interest level, which encouraged comfort within the personal interactions. Rüüg is a plush rug embedded with pressure sensors which send input from walking, sitting, and short written messages to a sister Rüüg. Input from the sister "Rüügmate" is displayed with the color change of heat-sensitive dye in the plush activated by a grid of heating-element "pixels" underneath the rug. This warm, colorful display communicates presence, level of physical activity, and gesture to provide a sense of "being there" and a better understanding of availability, mood, and level of engagement. By integrating both input and display into an inviting everyday object, Rüüg provides a comfortable shared experience in which the transparent human-computer interaction is secondary to the interaction between two friends.
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
Authors: Zeev Dvir, Amir Shpilka
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of the codeword. Polynomial Identity Testing (PIT) is one of the fundamental problems of algebraic complexity: we are given a circuit computing a multivariate polynomial and we have to determine whether the polynomial is identically zero. We improve known results on locally decodable codes and on polynomial identity testing and show a relation between the two notions. In particular we obtain the following results:We show that if E: Fn → Fm is a linear LDC with 2 queries then m = exp(Ω(n)). Previously this was only known for fields of size << 2n [18].We show that from every depth 3 arithmetic circuit (ΣΠΣ circuit), C, with a bounded (constant) top fan-in that computes the zero polynomial, one can construct a locally decodeable code. More formally: Assume that C is minimal (no subset of the multiplication gates sums to zero) and simple (no linear function appears in all the multiplication gates). Denote by d the degree of the polynomial computed by C and by r the rank of the linear functions appearing in C. Then we can construct a linear LDC with 2 queries, that encodes messages of length r/polylog(d) by codewords of length O(d).We prove a structural theorem for ΣΠΣ circuits, with a bounded top fan-in, that compute the zero polynomial. In particular we show that if such a circuit is simple and minimal and of polynomial size then its rank, r, is only polylogarithmic in the number of variables (a priory it could have been linear).We give new PIT algorithms for ΣΠΣ circuits with a bounded top fan-in:A deterministic algorithm that runs in quasi polynomial time.A randomized algorithm that runs in polynomial time and uses only polylogarithmic number of random bits..Moreover, when the circuit is multilinear our deterministic algorithm runs in polynomial time. Previously, deterministic subexponential time algorithms for PIT in bounded depth circuits were known only for depth 2 circuits (in the black box model)[22, 9, 28]. In particular, for the special case of depth 3 circuits with 3 multiplication gates our result resolves an open question asked by Klivans and Spielman [28].
Special Thanks to IC's Reviewers
Venue: IEEE Internet Computing (2003)

IEEE Internet Computing delivers high-quality peer-reviewed articles only through the efforts of our volunteers.Volunteer reviewers are a key to our selecting the best articles for publication; their reviews are vital for aiding authors to improve their compositions.While individual reviews are performed confidentially,we would like to take this opportunity to publicly thank our 2003 reviewers for their gracious efforts. 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
Factoring into coprimes in essentially linear time
Authors: Daniel J. Bernstein
Venue: Journal of Algorithms (2005)

Let S be a finite set of positive integers. A "coprime base for S" means a set P of positive integers such that (1) each element of P is coprime to every other element of P and (2) each element of S is a product of powers of elements of P. There is a natural coprime base for S. This paper introduces an algorithm that computes the natural coprime base for S in essentially linear time. The best previous result was a quadratic-time algorithm of Bach, Driscoll, and Shallit. This paper also shows how to factor S into elements of P in essentially linear time. The algorithms use solely multiplication, exact division, gcd, and equality testing, so they apply to any free commutative monoid with fast algorithms for those four operations; for example, given a finite set S of monic polynomials over a finite field, the algorithms factor S into coprimes in essentially linear time. These algorithms can be used as a substitute for prime factorization in many applications.
Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions
Authors: Robert Kozma, Marko Puljic, Paul Balister, Bela Bollob&#x00e1;s, Walter J. Freeman
Venue: Biological Cybernetics (2005)

We model the dynamical behavior of the neuropil, the densely interconnected neural tissue in the cortex, using neuropercolation approach. Neuropercolation generalizes phase transitions modeled by percolation theory of random graphs, motivated by properties of neurons and neural populations. The generalization includes (1) a noisy component in the percolation rule, (2) a novel depression function in addition to the usual arousal function, (3) non-local interactions among nodes arranged on a multi-dimensional lattice. This paper investigates the role of non-local (axonal) connections in generating and modulating phase transitions of collective activity in the neuropil. We derived a relationship between critical values of the noise level and non-locality parameter to control the onset of phase transitions. Finally, we propose a potential interpretation of ontogenetic development of the neuropil maintaining a dynamical state at the edge of criticality.
Principle Components and Importance Ranking of Distributed Anomalies
Authors: Kyrre Begnum, Mark Burgess
Venue: Machine Learning (2005)

Correlations between locally averaged host observations, at different times and places, hint at information about the associations between the hosts in a network. These smoothed, pseudo-continuous time-series imply relationships with entities in the wider environment. For anomaly detection, mining this information might provide a valuable source of observational experience for determining comparative anomalies or rejecting false anomalies. The difficulties with distributed analysis lie in collating the distributed data and in comparing observables on different hosts, in different frames of reference. In the present work, we examine two methods (Principle Component Analysis and Eigenvector Centrality) that shed light on the usefulness of comparing data destined for different locations in a network.
Evaluating technology for coordinating communication
Authors: Laura A. Dabbish
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The goal of this work is two-fold: (1) propose a model of communication initiation and response, and (2) evaluate the utility of a set of technology interventions based on that model for coordinating communication. The contribution to the field of HCI will be useful recommendations for the design of electronic communication systems.
Design and analysis of dynamic leader election protocols in broadcast networks
Authors: Jacob Brunekreef, Joost-Pieter Katoen, Ron Koymans, Sjouke Mauw
Venue: Distributed Computing (1996)

The well-known problem of leader election in distributed systems is considered in a dynamic context where processes may participate and crash spontaneously. Processes communicate by means of buffered broadcasting as opposed to usual point-to-point communication. In this paper we design a leader election protocol in such a dynamic context. As the problem at hand is considerably complex we develop the protocol in three steps. In the initial design processes are considered to be perfect and a leader is assumed to be present initially. In the second protocol, the assumption of an initial leader is dropped. This leads to a symmetric protocol which uses an (abstract) timeout mechanism to detect the absence of a leader. Finally, in the last step of the design processes may crash without giving any notification of other processes. The worst case message complexity of all protocols is addressed. A formal approach to the specification and verification of the leader election protocols is adopted. The requirements are specified in a property-oriented way and the protocols are denoted by means of extended finite state machines. It is proven using linear-time temporal logic that the fault-tolerant protocol satisfies its requirements.
Automated Analysis of Memory Access Behavior
Authors: Michael Gerndt, Tianchao Li
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 4 - Volume 05 (2005)

We developed an automated environment to support the analysis of memory access behaviors of applications on high performance clusters. Code optimization targeting efficient use of processor caches is crucial for achieving good performance on such systems. Our environment is able to selectively instrument OpenMP Fortran95 programs upon requests of programmer. The monitor can be configured to collect hardware counter information on specified code regions. Limitations due to the number of available physical hardware counters are automatically taken into account. The whole environment is controlled through a friendly user interface based on Eclipse and is highly portable.