ppxscal/embedding_network huggingface dataset:
Using Workflows to Coordinate Web Services in Pervasive Computing Environments
Authors: Anand Ranganathan, Scott McFaddin
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

Pervasive Computing Environments augmentphysical spaces with a large number of devices andservices that help users perform different kinds of tasks.Users in these environments interact with one or moreweb services using various devices to achieve theirgoals. One of the problems in these environments isdiscovering and coordinating different web services forachieving the user's goals. Users may not be aware ofwhich services and devices are available in anunfamiliar environment and how to interact with themin order to achieve their goals. In order to simplify auser's interaction with the environment, we present anovel approach of modeling and managing a user'sinteraction with the environment based on workflows.We have built a prototype, using the popular businessworkflow language(BPEL) that models variousprocesses in pervasive environments as workflows. Wefound that this approach improves the usability of theseenvironments. It also increases flexibility in changingthe model of interaction without having to touchindividual services and applications. This approach isparticularly useful in helping visitors in public spaceslike malls, museums, supermarkets and hospitals.
Decentralized Reactive Clustering for Collaborative Processing in Sensor Networks
Authors: Yingyue Xu, Hairong Qi
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

A sensor network forms a loosely-coupled distributedenvironment where collaborative processing among multiplesensor nodes is essentail in order to compensate forthe limitation of each sensor node in its processing capability,sensing capability, and energy usage, as well asto improve the degree of fault tolerance.Due to the sheeramount of nodes deployed, collaboration is usually carriedout among nodes within the same cluster.Differentclustering protocols can affact the performance of networkto a great extent.Most existing clustering protocolseither do not adequately address the energy-constraintproblem or derive clusters proactively which may not besuitable for event-driven collaborative processing in sensornetworks.This paper focuses on the design of clusteringprotocols for collaborative processing.We proposea decentralized reactive clustering (DRC) protocol wherethe clustering procedure is initial only when events aredetected.It uses power control technique to minimizeenergy usage in forming clusters.We compare the performanceof DRC with another popular clustering algorithm,LEACH.Simulation results show considerable improvementover LEACH in energy conservation and networklifetime using DRC.
Empirical Assessment of UML Static Object Diagrams
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

The essential UML logic diagrams are the classdiagrams: they represent the classes of objects that makeup a program. Object diagrams are used as the basis toshow scenarios of dynamic evolution of the software. Theuse of object diagrams to depict static structure is veryrare.The purpose of this study is to investigate whether theuse of static object diagrams can improve thecomprehension of software systems.We conducted a study with 17 graduate studentsduring a software engineering course. The students wereasked to answer questions about a software system. Thesystem was described either with a class diagram or withboth a class diagram and an object diagram. The studentasked multiple choice questions on four different systems.This study revealed that there is a statisticallysignificant difference in the comprehension achievementfor two of the systems. The effect of the presence of objectdiagrams can be classified of medium size.These results allow us to formulate new researchquestions that will guide our future work in this area.
Co-location and Tactile Feedback for 2D Widget Manipulation
Authors: Arjan J. F. Kok, Robert van Liere
Venue: Proceedings of the IEEE Virtual Reality 2004 (2004)

This study investigated the effect of co-location and tactile feedback on 2D widget manipulation tasks in virtual environments. Task completion time and positioning accuracyduring each task were measured for subjects under 4 situations (co-located vs no co-located and tactile feedback vs no tactile feedback). Performance results indicate thatco-location and tactile feedback both significantly improvethe performance of 2D widget manipulation in 3D virtualenvironments. Subjective results support these findings.
On Failure Dependent Protection in Optical Grooming Networks
Authors: Srinivasan Ramasubramanian
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Resiliency to link failures in optical networks is becomingincreasingly important due to the increasing data ratein the fiber. Path protection schemes attempt to guaranteea backup path for a connection upon a failure in the network,thereby reducing the recovery time for a connection.In this paper, we develop a failure dependent path protectionscheme that dynamically assigns a primary path andbackup paths, one for each failure that would affect the primarypath. A connection established on the primary pathwill be re-established on its backup path only if a failurein the network affects the connection. We evaluate theperformance of our developed protocol and compare withan alternative approach based on sub-graph routing thatachieves high network utilization and low blocking probabilityat the cost of re-establishing connections even if thefailure in the network does not affect the primary path of theconnection. We observe that up to a factor of eight reductionin the number of reconfiguration scenarios is achieved withless than 10% reduction in effective network utilization andless than 3% reduction in fairness metrics for tolerating anysingle link failure in NSFNET and ARPA-2 networks. Thefailure dependent protection approach developed in this paperis also applicable to any general failure scenarios thatare modeled as shared risk link group failures.
Interactive simulation of complex audiovisual scenes
Authors: Kees van den Doel, Dave Knott, Dinesh K. Pai
Venue: Presence: Teleoperators and Virtual Environments (2004)

We demonstrate a method for efficiently rendering the audio generated by graphical scenes with a large number of sounding objects. This is achieved by using modal synthesis for rigid bodies and rendering only those modes that we judge to be audible to a user observing the scene. We show how excitations of modes can be estimated and inaudible modes eliminated based on the masking characteristics of the human ear. We describe a novel technique for generating contact events by performing closed-form particle simulation and collision detection with the aid of programmable graphics hardware The effectiveness of our system is shown in the context of suitably complex simulations.
Open Source Ecosystems
Authors: Dave Thomas, Andy Hunt
Venue: IEEE Software (2004)

The open source community can deliver high-quality, very popular software. This software is developed in a culturally and geographically diverse environment. The developers do it for little or no money, with little or no extrinsic management. And many developers do it even after working a full day at their regular programming job. Why do they do this? How? And is it possible to use some of these open source practices (and some of this enthusiasm) to improve the way we develop software in a corporate environment? This column discusses how to bring the best of open source development practices in-house.
Knowledge and Uncertainty
Authors: Alfs T. Berztiss
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

One of the concerns of knowledge management (KM) should be the management of uncertainty in the KM process and in the data with which this process operates. We examine the various types of uncertainty that can arise.These are grouped into types that relate to data quality and to the KM process.Some areas in need of further study are indicated.
A class of prototiles with doubly generated level semigroups
Authors: John P. Steinberger
Venue: Journal of Combinatorial Theory Series A (2004)

A d-fold uniform covering of Rn by elementary shapes is a level d multiple tiling of Rn. The set of level values for which a prototile (a model shape) admits a multiple tiling is called the level semigroup of the prototile. In this paper we discuss the existence of prototiles with nontrivial level semigroups: for instance, does there exist a prototile admitting both tilings of levels 2 and 3, yet not admitting any tilings of level 1? The answer is yes--in fact, we show that for any a, b ∈ N there is a prototile whose level semigroup is exactly the set of nonnegative integer linear combinations of a and b.
In Silico Construction of the Carbon Fixation Pathway in Synechococcus sp. WH8102
Authors: Phuongan Dam, Zhengchang Su, Victor Olman, Ying Xu
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Because the carbon fixation pathway plays an essential role in the primary production and natural carbon recycling process, and because the genome of the marine cyanobacterial Synechococcus sp. WH8102 (SYNWH8102) was recently sequenced, SYNWH8102 was chosen to further our understanding of the interaction and regulation of the carbon fixation pathway at the molecular level. In this abstract, we present the predicted carbon fixation pathway in SYNWH8102 as a result of our recently developed computational protocol for inference of regulatory and signaling pathways. The results of our pathway prediction include: (a) Major components of the carbon fixation pathway reported in the literature are present in SYNWH8102. (b) Approximately, 48 new candidates are added into the network from the results of the pathway expansion step. (c) Additionally, our in-house motif finding program, CUBIC, found several motifs that are present in the promoter regions of multiple genes involved in this pathway, suggesting that these genes are transcriptionally co-regulated.
Maximal Collections of Intersecting Arithmetic Progressions
Authors: Kevin Ford
Venue: Combinatorica (2003)

Let Nt(k) be the maximum number of k-term arithmetic progressions of real numbers, any two of which have t points in common. We determine N2(k) for prime k and all large k, and give upper and lower bounds for Nt(k) when t &#x2265; 3.
Characterizing a new class of threads in scientific applications for high end supercomputers
Authors: Arun Rodrigues, Richard Murphy, Peter Kogge, Keith Underwood
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

Chip level multithreading is growing in use throughout the microprocessor world as evidenced in the Intel Pentium 4 and the upcoming innovations in the POWER architecture. These processors typically use a few coarse grain threads that can be difficult for the programmer or compiler to exploit; however, Processing in Memory (PIM) is a technology that has been explored through a long series of supercomputer projects as a facilitator for a different multithreaded execution models. In the multithreading model explored by PIMs, the threads can have radically different characteristics. Specifically, PIMs seek to exploit a large number of very fine grained threads to hide memory access latency and increase parallelism. PIM supports these small threads, or "threadlets", by providing a fast hardware synchronization mechanism, support for harware managment of creation and destruction of threads, and a "shared register" approach which extends the shared memory thread model. This paper discusses some analysis of some very large scientific codes in terms of how they might be mapped onto such a multithreading model with a focus on extremely fine grain threads.
Properties of NP-Complete Sets
Authors: Christian Glaser, A. Pavan, Alan L. Selman, Samik Sengupta
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

We study several properties of sets that are complete forNP. We prove that if L is an NP-complete set and S ¿ L isa p-selective sparse set, then L - S is \le _m^p-hard for NP. Wedemonstrate existence of a sparse set S \inDTIME(2^{2^n } )such that for every L \in NP - P, L - S is not \le _m^p-hard forNP. Moreover, we prove for every L \in NP - P, that thereexists a sparse S \in EXP such that L - S is not \le _p^m-hardfor NP. Hence, removing sparse information in P from acomplete set leaves the set complete, while removing sparseinformation in EXP from a complete set may destroy itscompleteness. Previously, these properties were known onlyfor exponential time complexity classes.We use hypotheses about pseudorandom generators andsecure one-way permutations to derive consequences forlongstanding open questions about whether NP-completesets are immune. For example, assuming that pseudorandomgenerators and secure one-way permutations exist, itfollows easily that NP-complete sets are not p-immune. Assumingonly that secure one-way permutations exist, weprove that no NP-complete set is DTIME (2^{2^\varepsilon} )-immune.Also, using these hypotheses we show that no NP-completeset is quasipolynomial-close to P.We introduce a strong but reasonable hypothesis and inferfrom it that disjoint Turing-complete sets for NP arenot closed under union. Our hypothesis asserts existenceof a UP-machine M that accepts 0* such that for some0
Supporting federated information sharing communities
Authors: Bicheng Liu, David J. Harper, Stuart Watt
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

In this paper we describe the concept of Federated Information Sharing Communities (FISC), and associated architecture, which provide a way for organisations, distributed workgroups and individuals to build up a federated community based on their common interests over the World Wide Web. To support communities, we develop capabilities that go beyond the generic retrieval of documents to include the ability to retrieve people, their interests and inter-relationships. We focus on providing social awareness "in the large" to help users understand the members within a community and the relationships between them. Within the FISC framework, we provide viewpoint retrieval to enable a user to construct visual contextual views of the community from the perspective of any community member. To evaluate these ideas we develop test beds to compare individual component technologies such as user and group profile construction and similarity matching, and we develop prototypes to explore the broader architecture and usage issues.
Predicting Gene Ontology Annotations from Sequence Data Using Kernel-Based Machine Learning Algorithms
Authors: J. J. Ward, J. S. Sodhi, B. F. Buxton, D. T. Jones
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

In this early part of the post-genomic era, the inference of the functions associated with gene products is a necessary first step in understanding the development and maintenance of living cells. We describe the development of a machine learning method for predicting biological process as defined by the Gene Ontology (GO). The algorithm uses features that can be generated from amino acid sequence alone, and does not require further experimental studies such as microarrays, 2-hybrid screens or systematic ýpulldowný assays. The budding yeast Saccharomyces cerevisiae is used because of its comprehensive set of functional annotations, but the approach is sufficiently general for application to other eukaryote genomes. The input data include phylogenetic profiles, which represent the distribution of orthologous proteins in the genomes of other organisms, position-specific scoring matrices, and secondary structure and dynamic disorder predictions. These are encoded using diffusion kernels, which are used to represent pair-wise relationships such as sequence or secondary structure element similarity between nodes (proteins) in a graph. These kernels are benchmarked on the process prediction problem using a maximal margin (SVM) learning algorithm.
Information dynamics of cellular automata I: an algebraic study
Authors: Hidenosuke Nishio, Takashi Saito
Venue: Fundamenta Informaticae (2003)

Information dynamics of cellular automata(CA) is studied using polynomials over finite fields. The information about the uncertainty of cell states is expressed by an indeterminate X called information variable and its dynamics is investigated by extending CA to CA[X] whose cell states are polynomials in X. For the global configuration of extended CA[X], new notions of completeness and degeneracy are defined and their dynamical properties are investigated. A theorem is proved that completeness equals non-degeneracy. With respect to the reversibility, we prove that a CA is reversible, if and only if its extension CA[X] preserves the set of complete configurations. Information dynamics of finite CAs and linear CAs are treated in the separate sections. Decision problems are also referred.
Using home networks to create atmospheres in the home: technology push or (latent) user need?
Authors: L. L. M. L. Kuiper-Hoyng, J. W. F. Beusmans
Venue: Proceedings of the conference on Dutch directions in HCI (2004)

The Atmosphere Controller is an implementation of home networking technology that could make life at home a totally new experience. An atmosphere is created by combining light (intensity and colour), music and wallpaper projection. To find out if is this type of experience fits into everyday life of people, we studied the current experience of creating atmospheres by conducting interviews and probes studies in people's homes [5]. The same people were later invited to test the application in a Lab environment. Although the lab tests showed that the Atmosphere controller offers a positive sensorial experience further research should be conducted in a more realistic setting.
Discovering spatial patterns accurately with effective noise removal
Authors: Yu Qian, Kang Zhang
Venue: Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery (2004)

Cluster analysis is a common approach to pattern discovery in spatial databases. While many clustering techniques have been developed, it is still challenging to discover implicit patterns accurately when the data set contains two kinds of noise or outliers: 1) domain-specific noise; 2) noise similar to true data on size, shape, or density. This paper presents a two-step strategy to solve the problem effectively: firstly, groups of data points are separated into different layers according to their sizes and densities; then a layered visualization is provided to the user to separate noise and true data intuitively. Such a strategy not only produces user-desired results but also separates noise and true data accurately. After noise removal, a hierarchical clustering is performed on remaining data to discover natural clusters. The experimental studies on both benchmark data sets and real images show very encouraging results.
Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Venue: International Conference on Management of Data (2004)

The 2004 ACM SIGMOD International Conference on Management of Data, held in Paris in the week of June 13-18, is the first SIGMOD ever held outside of North America, and it has chosen a place that is rich in tradition but also rich in new departures, one of the focal points of the age of enlightenment and the place of the French revolution in 1789. We hope that this is a symbol of SIGMOD embracing new challenges in the broader area of business and scientific information management and the wider spectrum of network-enabled data-rich applications.The SIGMOD conference is sponsored by the Association for Computing Machinery (ACM) and its Special Interest Group on Management of Data (SIGMOD). Two days of the conference overlap with the Symposium on Principles of Database System (PODS), and several workshops and other events are co-located with SIGMOD.
A New Idea of E-Learning: Establishing Video Library in University Network League
Authors: Lin Cai, Yafei Yang, Yixian Yang
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

This paper proposes a new idea of e-learning that is different from the distant education: Establishing video library in University Network League. In this project, enormous database needs to be established to storage classified prelection video of excellent instructors. Universities will be invited to join the Network League, and the unbalanced distribution of education resources will be greatly alleviated, which benefit both the students and faculty. Through analyzing its feasibility, possible problems and framework, this paper provides a practical project that can be developed widely in developing countries.
On the Power of Quantum Proofs
Authors: Ran Raz, Amir Shpilka
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

We study the power of quantum proofs, or more precisely,the power of Quantum Merlin-Arthur (QMA)protocols, in two well studied models of quantum computation:the black box model and the communication complexitymodel.Our main results are obtained for the communicationcomplexity model. For this model, we identify a completepromise problem for QMA protocols, the Linear SubspacesDistance problem. The problem is of geometricalnature: Each player gets a linear subspace of R^m and considersthe sphere of unit vectors in that subspace. Theirgoal is to output 1 if the distance between the two spheresis very small (say, smaller than 0.1 \cdot \sqrt 2 ) and 0 if the distanceis very large (say, larger than 0.9 \cdot \sqrt 2 ). We show that:1. The QMA communication complexity of the problem is O(logm).2. The (classical) MA communication complexity of the problem is \Omega (m^¿) (for some ¿ > 0).3. The (standard) quantum communication complexity of the problem is \Omega (\sqrt m).In particular, this gives an exponential separation betweenQMA communication complexity and MA communicationcomplexity.For the black box model we give several observations.First, we observe that the block sensitivity-method, as wellas the polynomialmethod for proving lower bounds for thenumber of queries, can both be extended to QMA protocols.We use thesemethods to obtain lower bounds for theQMA black box complexity of functions. In particular,weobtain a tight lower bound of \Omega(N) for the QMA black boxcomplexity of a random function, and a tight lower boundof \Omega (\sqrt N) for the QMA black box query complexity ofNOR (X_1, ...,X_N). In particular, this shows that any attemptto give short quantum proofs for the class of languagesCo - NP will have to go beyond black box arguments.We also observe that for any boolean functionG(X_1, ...,X_N), if for both G and -G there are QMAblack box protocols that make at most T queries tothe black box, then there is a classical deterministicblack box protocol for G that makes O(T^6) queries tothe black box. In particular, this shows that in the blackbox model QMA ¿ Co - QMA = P.On the positive side, we observe that any (total or partial)boolean function G(X_1, ...,X_N) has a QMA blackbox protocol with proofs of length N that makes only0(\sqrt N) queries to the black box.Finally, we observe a very simple proof for the exponentialseparation (for promise problems) betweenQMAblack box complexity and (classical) MA black box complexity(first obtained by Watrous).