ppxscal/embedding_network huggingface dataset:
The boxer: round 3
Venue: ACM SIGGRAPH 2003 video review on Electronic theater program on Electronic theater program - Volume 144 (2003)

What can be expected of Vicky and Johnny, the funny pair of boxing dolls in this 'Round 3' of animation? IsJohnny truly destined to never win? Or will Vicky, the tomboy prevail with a knock-out? Copyright held by creator.
Improving Ariadne's Bundle by Following Multiple Threads in Abstraction Refinement
Authors: Chao Wang, Bing Li, HoonSang Jin, Gary D. Hachtel, Fabio Somenzi
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

We propose an abstraction refinement method for invariant checking,which is based on the simultaneous analysis of all abstractcounter examples of shortest length in the current abstraction. Thealgorithm is focused on an improved Ariadne's Bundle of SORs(Synchronous Onion Rings) of the abstract model; the transitionsthrough these SORs contain all shortest ACEs (Abstract CounterExamples) and no other ACEs. The SORs are exploited in twodistinct ways to provide global guidance to the abstraction refinementprocess: (1) Refinement variable selection is based on theentirety of transitions connecting the SORs, and (2) a SAT-basedconcretization test is formulated to test all ACEs in the SORs atonce. We call this test multi-thread concretization. The scalabilityof our refinement algorithm is ensured in the sense that all theanalysis and computation required in our refinement algorithm areconducted on the abstract model.The abstraction efficiency of a given abstraction refinement algorithmmeasures how much of the concrete model is required tomake the decision. We include experimental comparisons of ournew method with recently published techniques. The resultsshow that our scalable method, based on global guidance from theentire bundle of shortest ACEs, outperforms these other methods interms of both run time and abstraction efficiency.
Networks, Fields and Organizations: Micro-Dynamics, Scale and Cohesive Embeddings
Authors: Douglas R. White, Jason Owen-Smith, James Moody, Walter W. Powell
Venue: Computational Mathematical Organization Theory (2004)

Social action is situated in fields that are simultaneously composed of interpersonal ties and relations among organizations, which are both usefully characterized as social networks. We introduce a novel approach to distinguishing different network macro-structures in terms of cohesive subsets and their overlaps. We develop a vocabulary that relates different forms of network cohesion to field properties as opposed to organizational constraints on ties and structures. We illustrate differences in probabilistic attachment processes in network evolution that link on the one hand to organizational constraints versus field properties and to cohesive network topologies on the other. This allows us to identify a set of important new micro-macro linkages between local behavior in networks and global network properties. The analytic strategy thus puts in place a methodology for Predictive Social Cohesion theory to be developed and tested in the context of informal and formal organizations and organizational fields. We also show how organizations and fields combine at different scales of cohesive depth and cohesive breadth. Operational measures and results are illustrated for three organizational examples, and analysis of these cases suggests that different structures of cohesive subsets and overlaps may be predictive in organizational contexts and similarly for the larger fields in which they are embedded. Useful predictions may also be based on feedback from level of cohesion in the larger field back to organizations, conditioned on the level of multiconnectivity to the field.
Document clustering via adaptive subspace iteration
Authors: Tao Li, Sheng Ma, Mitsunori Ogihara
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Document clustering has long been an important problem in information retrieval. In this paper, we present a new clustering algorithm ASI1 , which uses explicitly modeling of the subspace structure associated with each cluster. ASI simultaneously performs data reduction and subspace identification via an iterative alternating optimization procedure. Motivated from the optimization procedure, we then provide a novel method to determine the number of clusters. We also discuss the connections of ASI with various existential clustering approaches. Finally, extensive experimental results on real data sets show the effectiveness of ASI algorithm.
DCP: A New Data Collection Protocol for Bluetooth-Based Sensor Networks
Authors: Matthias Handy, Frank Grassert, Dirk Timmermann
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

Two economic factors are essential for the success of wireless sensor networks as new key technology: low-cost hardware and strong prototype applications. Although not perfect, Bluetooth can be a driving technology in this domain. We present a new Data Collection Protocol (DCP) for wireless sensor networks. DCP is tailored to Bluetooth-based sensor nodes and therefore enables sensor network applications based on inexpensive hardware. DCP is scalable, robust, and not limited to piconet or scatternet structures.
Fault Tolerant Energy Aware Data Dissemination Protocol in Sensor Networks
Authors: Gunjan Khanna, Saurabh Bagchi, Yu-Sung Wu
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

In this paper we present a data disseminationprotocol for efficiently distributing data through asensor network in the face of node and link failures. Ourwork is motivated by the SPIN protocol which usesmetadata negotiation to minimize data transmissions.We propose a protocol called Shortest Path MindedSPIN (SPMS) in which every node has a zone defined byits maximum transmission radius. A data source nodeadvertises the availability of data to all the nodes in itszone. Any interested node requests the data and gets sentthe data using multi-hop communication via the shortestpath. The failure of any node in the path is detected andrecovered using backup routes. We build simulationmodels to compare SPMS against SPIN. The simulationresults show that SPMS reduces the delay over 10 timesand consumes 30% less energy in the static failure freescenario. Even with the addition of mobility, SPMSoutperforms SPIN by energy gains between 5% and21%. An analytical model is also constructed tocompare the two protocols under a simplified topology.
Long Term Trends for Embedded System Design
Authors: Ahmed A. Jerraya
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

An embedded system is an application specific electronic sub-system used in a larger system such as an appliance, an instrument or a vehicle. An embedded system is generally made of software (called embedded software) and a hardware platform. The evolution of technologies is enabling to the integration of complex platforms in a single chip (called System-on-Chip, SoC) including one or several CPU sub-systems to execute software and sophisticated interconnect in addition to specific hardware sub-systems. Mastering the design of these embedded systems is a challenge for both system and semiconductor houses that used to apply only software strategy or only hardware strategy. This paper analyzes this evolution and defines long term roadmaps for embedded system design.
Human factors and folk models
Authors: Sidney Dekker, Erik Hollnagel
Venue: Cognition, Technology and Work (2004)

This paper presents a discussion of the susceptibility of human factors to the use of folk models. The case of automation-induced complacency is used as a guiding example to illustrate how folk models (1) substitute one label for another rather than decomposing a large construct into more measurable specifics; (2) are immune to falsification and so resist the most important scientific quality check; and (3) easily get overgeneralised to situations they were never meant to speak about. We then discuss the link between models and measurements, where the model constrains what can be measured by describing what is essential performance, and where the model&#x2019;s parameters become the basis for specifying the measurements. We propose that one way forward for human factors is to de-emphasize the focus on inferred and uncertain states of the mind, and shift to characteristics of human performance instead.
ACM SIGACT News distributed computing column 3
Authors: Sergio Rajsbaum
Venue: ACM SIGACT News (2001)

The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases, distributed shared memory, multiprocessor architectures, operating systems, verification, internet, and the web.After some announcements, this issue includes a contribution by Idit Keidar and myself.
Turbo Coding with Equalization in WCDMA Downlink
Authors: Dejan Drajic, Kari Hooli, Markku Juntti
Venue: Wireless Personal Communications: An International Journal (2004)

In this paper, the performance of turbo coding in WCDMA downlink is considered in conjunction with receivers using two adaptive channel equalizers. Bit error and frame error rates are compared to the performance of the conventional Rake receiver. Special consideration is given to the cases with two receive antennas, the efficiency of the channel interleaver, the number of iterations in decoding, the performance with various numbers of users, the influence of mobile receiver velocity as well as to the effect of power control. The simulation results show that turbo coding, combined with power control and channel equalizers is a very efficient way to implement reliable data transmissions in WCDMA downlink. The results in the paper also verify that the adaptive channel equalizers is a very promising technique to improve the receiver performance and increase the user capacity.
Characterization of the Impact of Faulty Drivers on the Robustness of the Linux Kernel
Authors: Arnaud Albinet, Jean Arlat, Jean-Charles Fabre
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Drivers are becoming the larger part of operating systemskernels. Previous studies have shown that device drivers seemto be one of the most important sources of operating systemsmisbehavior. Their failure can have significant impact on thekernel and cause significant damages to the system as awhole. To objectively characterize the impact of faultydrivers, we have carried out a series of fault injectionexperiments. To conduct these experiments we have targetedthe DPI (Driver Programming Interface) that implements theway device drivers interact with the kernel. Faults areinjected on the parameters of these kernel core functions. Thisallows for the derivation of useful results about the failuremodes induced and thus characterization of the robustness ofa target kernel with respect to faulty drivers. The informationgathered also enables to improve these interaction facilities.
Stroke-Input Methods for Immersive Styling Environments
Venue: Proceedings of the Shape Modeling International 2004 (2004)

This paper introduces an immersive stylingenvironment, which aims at closing the gap between 2D drawingand 3D modeling in the design process. The main goal of thestyling system is to provide the user an easy to use interfacehiding the inherent mathematic nature of CAD. Creating rough3D sketches should literally be as intuitive as 2D sketching withpen and paper. To achieve this, the tools developed in our systembenefit from the stylistsý skills, acquired through training overtime. This paper focuses on the stroke-input methods of ourstyling system. We present different techniques for creating andmodifying 3D curves: stroke splitting, oversketching and taping.In addition we report on the viability of using input constraintsin immersive environments to overcome inherent weaknesses.
Chainsmoker
Venue: ACM SIGGRAPH 2003 video review on Electronic theater program on Electronic theater program - Volume 144 (2003)

An old woman living in a home badly wants to smoke but is not allowed to. She struggles in a situation where she suddenly is treated as a child and therefore acts as one. A celebration to the greatness of being small and very human, but also of one's determination in never giving up. Copyright held by creator. 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
Some sufficient conditions for global exponential stability of delayed Hopfield neural networks
Authors: Hongtao Lu, Fu-Lai Chung, Zhenya He
Venue: Neural Networks (2004)

In this paper, we have derived some sufficient conditions for existence and uniqueness of equilibrium and global exponential stability in delayed Hopfield neural networks by using a different approach from the usually used one where the existence, uniqueness of equilibrium and stability are proved in two separate steps, rather we first prove global exponential convergence to 0 of the difference between any two solutions of the original neural networks, the existence and uniqueness of equilibrium is the direct results of this procedure. We obtain the conditions by suitable construction of Lyapunov functionals and estimation of derivates of the Lyapunov functionals by the well-known Young's inequality and Holder's inequality. The proposed conditions are related to p-norms of vector or matrix, p ∈ [1, ∞], and thus unify and generalize some results in the literature.
A Model of Business Process Support System for E-Government
Authors: Tatyana Podgayetskaya, Wolffried Stucky
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This paper proposes an architecture and a model of Business Process Support (BPS) Systems for e-government organizational boundaries. Today, processes are mostly adapted to existing technologies; in contrast, the proposed architecture intends to support typical e-government processes. The proposed system consists of three main IT components: a workflow system for administration and control of information flows; Web Services enabling data transfer between computers; and a Web Server controlling all applications for communication with all users in each organization. The proposed model of the Workflow Enactment Server consists of two nodes: the Rule Base Collection, and the Workflow Engine. The workflow engine consists of two components A and B for process execution and control.
Rapid prototyping of information management systems
Authors: Bruce I. Blum, Raymond C. Houghton
Venue: ACM SIGSOFT Software Engineering Notes (1982)

Rapid prototyping is especially effective when implementing interactive information management systems. With the right tools, the development process for these systems involves the generation of successive prototypes where each successor is closer to the user requirement. The final prototype becomes either the production system or a production subsystem which is integrated into the total system. The tools used to generate successive prototypes are called application generators and program generators. There are several software engineering issues addressed by these tools.
Cassandra: Flexible Trust Management, Applied to Electronic Health Records
Authors: Moritz Y. Becker, Peter Sewell
Venue: Proceedings of the 17th IEEE workshop on Computer Security Foundations (2004)

We study the specification of access control policy inlarge-scale distributed systems. We present Cassandra, alanguage and system for expressing policy, and the resultsof a substantial case study, a security policy for a nationalElectronic Health Record system, based on the requirementsfor the ongoing UK National Health Service procurementexercise.Cassandra policies are expressed in a language based onDatalog with constraints. The expressiveness of the language(and its computational complexity) can be tuned bychoosing an appropriate constraint domain. Cassandra isrole-based; it supports credential-based access control (e.g.between administrative domains); and rules can refer to remotepolicies (for automatic credential retrieval and trustnegotiation). Moreover, the policy language is small, andit has a formal semantics for query evaluation and for theaccess control engine.For the case study we choose a constraint domain C¿ thatis sufficiently expressive to encode many policy idioms. Thecase study turns out to require many subtle variants of these;it is important to express this variety smoothly, rather thanadd them as ad hoc features. By ensuring only a constraintcompact fragment of C¿ is used, we guarantee a finite andcomputable fixed-point model. We use a top-down evaluationalgorithm, for efficiency and to guarantee termination.The case study (with some 310 rules and 58 roles) demonstratesthat this language is expressive enough for a real-worldapplication; preliminary results suggest that the performanceshould be acceptable.
A Video-Spam Detection Approach for Unprotected Multimedia Flows based on Active Networks
Authors: Andreas Hess, Jirka Klaue
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

This paper presents a real-time protection mechanism for MPEG-4 flows against video spam. Applications like Internet telephony, video on demand or life video streaming become more and more important. Because of the increased appearance of e-mail spam during the last years, it is expected that these services will get into the focus of the spam industry. Since it is necessary to cope with the individual QoS-requirementsof media flows and the characteristics of varying transmission media, it might be advisable not to encrypt media flows such that intermediate and edge nodes could optimize the transmission of these flows, e.g., by protocol boosters. Moreover, currently used video-conferencing systems and real-time multimedia applications mostly lack integrated security features. We have been able to demonstrate the blending of media streams with unwanted content and have implemented an active networking service that analyzes MPEG-4 media flows. Additionally, it is capable of detecting and blocking the above mentioned attack.
Approximating Subdivision for Quadrilateral Nets with 4-Valence Topology
Authors: Limei Zhang, Zhongxuan Luo, Weizhong Liu
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

In the paper,a new approximating subdivision scheme is presented for quadrilateral nets with 4-valence topology which generates the limit surface of C^1 in the limit at the regular face and quasi-tangent plane continuous at the irregular rigion.The main advantage of the scheme comparing with other algorithms is limit surfaces generated by the scheme can hold the shape of initial control polyhedra better than others .So the criterion satisfies important requirements for practical applications in computer graphics and engineering.
Efficient projection orders for CAD
Authors: Andreas Dolzmann, Andreas Seidl, Thomas Sturm
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

We introduce an efficient algorithm for determining a suitable projection order for performing cylindrical algebraic decomposition. Our algorithm is motivated by a statistical analysis of comprehensive test set computations. This analysis introduces several measures on both the projection sets and the entire computation, which turn out to be highly correlated. The statistical data also shows that the orders generated by our algorithm are significantly close to optimal.
Mazur-Orlicz theorem and asymptotic formula for the error in supreme norm
Authors: M. Beśka, K. Dziedziul
Venue: Journal of Computational and Applied Mathematics (2004)

We prove Mazur-Orlicz theorem in supreme norm, cf. Mazur and Orlicz, Sur quelques propriétés des fonctions periodiques, Studia Math. 9 (1940) 1-16 using ergodic theory. We use it in the calculation of asymptotic formula for the error in cardinal interpolation and in shift invariant operators.
Multi-Item, Multi-Facility Supply Chain Planning: Models, Complexities, and Algorithms
Authors: S. David Wu, Hakan Golbasi
Venue: Computational Optimization and Applications (2004)

We propose a planning model for products manufactured across multiple manufacturing facilities sharing similar production capabilities. The need for cross-facility capacity management is most evident in high-tech industries that have capital-intensive equipment and a short technology life cycle. We propose a multicommodity flow network model where each commodity represents a product and the network structure represents manufacturing facilities in the supply chain capable of producing the products. We analyze in depth the product-level (single-commodity, multi-facility) subproblem when the capacity constraints are relaxed. We prove that even the general-cost version of this uncapacitated subproblem is NP-complete. We show that there exists an optimization algorithm that is polynomial in the number of facilities, but exponential in the number of periods. We further show that under special cost structures the shortest-path algorithm could achieve optimality. We analyze cases when the optimal solution does not correspond to a source-to-sink path, thus the shortest path algorithm would fail. To solve the overall (multicommodity) planning problem we develop a Lagrangean decomposition scheme, which separates the planning decisions into a resource subproblem, and a number of product-level subproblems. The Lagrangean multipliers are updated iteratively using a subgradient search algorithm. Through extensive computational testing, we show that the shortest path algorithm serves as an effective heuristic for the product-level subproblem (a mixed integer program), yielding high quality solutions with only a fraction (roughly 2%) of the computer time.
Roles of variables as seen by CS educators
Authors: Mordechai Ben-Ari, Jorma Sajaniemi
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

Roles can be assigned to occurrences of variables in programs according to a small number of patterns of use that are both language- and algorithm-independent. Preliminary studies on explicitly teaching roles of variables to novice students have shown that roles are an excellent pedagogical tool for clarifying the structure and meaning of programs. This paper describes the results of an investigation designed to test the understandability and acceptability of the role concept and of the individual roles as seen by computer science educators. The investigation consisted of a short tutorial on roles, a brief training session on assigning roles to variables, a test evaluating the subjects' ability to assign roles, and a set of open questions concerning their opinions of roles. Roles were identified with 85 accuracy, and in typical uses of variables with 93 accuracy.
On the superlinear local convergence of a filter-SQP method
Authors: Stefan Ulbrich
Venue: Mathematical Programming: Series A and B (2004)

Transition to superlinear local convergence is shown for a modified version of the trust-region filter-SQP method for nonlinear programming introduced by Fletcher, Leyffer, and Toint [8]. Hereby, the original trust-region SQP-steps can be used without an additional second order correction. The main modification consists in using the Lagrangian function value instead of the objective function value in the filter together with an appropriate infeasibility measure. Moreover, it is shown that the modified trust-region filter-SQP method has the same global convergence properties as the original algorithm in [8].