ppxscal/embedding_network huggingface dataset:
Parallelization of Direct Algorithms using Multisplitting Methods in Grid Environments
Authors: Jacques M. Bahi, Raphael Couturier
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14 (2005)

The goal of this paper is to introduce a new approach to the building of efficient distributed linear system solvers. The starting point of the results of this paper lies in the fact that the parallelization of direct algorithms requires frequent synchronizations in order to obtain the solution for a linear problem. In a grid computing environment, communication times are significant and the bandwidth is variable, therefore frequent synchronizations slow down performances. Thus it is desirable to reduce the number of synchronizations in a parallel direct algorithm. Inspired from multisplitting techniques, the method we present consists in solving several linear problems obtained by splitting the original one. Each linear system is solved independently on a cluster by using the direct method. This paper uses the theoretical results of [Asynchronous multisplitting methods for nonlinear fixed point problems] in order to build coarse grained algorithms designed for solving linear systems in the grid computing context.
Amount of information presented in a complex list: effects on user performance
Authors: Dawn Dutton, Selina Chu, James Hubbell, Marilyn Walker, Shrikanth Narayanan
Venue: Proceedings of the first international conference on Human language technology research (2001)

AT&T Communicator is a state-of-the-art speech-enabled telephony-based application that allows the end-user to, among other things, select and reserve airline itineraries. This experiment explores how the amount and structure of information presented in complex lists influences the user experience and the ability of subjects to successfully complete a selection task. Presenting all the relevant information needed for a decision at once was the factor that most positively influenced successful task completion and the user experience. Subjects preferred hearing all of the relevant information about each flight, without initiating additional dialog with the system. Additionally, successful task completion rates improved when all of the flights were presented at once, without any intervening questions from the system.
Comparison with a standard via fully sequential procedures
Authors: Seong-Hee Kim
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2005)

We develop fully sequential procedures for comparison with a standard. The goal is to find systems whose expected performance measures are larger or smaller than a single system referred to as a standard and, if there is any, to find the one with the largest or smallest performance. The general formulation of comparison with a standard gives the standard a special status and tries to protect it when its performance is better than or even equal to performance measures of all the other alternatives. Therefore, the problem cannot be formulated as the selection of the best and a specialized procedure is required. Our procedures allow for unequal variances across systems, the use of common random numbers, and known or unknown expected performance of the standard. Experimental results are provided to compare the efficiency of the procedure with other existing procedures.
A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
Authors: Wenxing Zhu
Venue: Journal of Computer and System Sciences (2005)

This paper presents a Branch and Bound method for a nonconvex integer quadratic programming problem with a separable objective function over a bounded box. For this problem, a special branch method is constructed, which has a property that if a box has been partitioned into 2n sub-boxes, then at least one sub-box can be deleted. We analyze the complexity of the algorithm, and prove that it is better than that of the complete enumeration method in the worst case if the solution space is large enough.
A strange dance: the creative collaborative origins & processes of "9 evenings: theatre & engineering"
Authors: Robin Oppenheimer
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

This paper examines the creative collaborative practices and processes of the historic 1966 "9 Evenings: Theatre & Engineering" event that spawned the Experiments in Art & Technology (E.A.T.) group in New York City. It presents the cultural origins and collaborative goals of this group of avant-garde artists and Bell Labs engineers who came together to produce the landmark event based on first-hand accounts, and examines the elements and intentions of their creative and collaborative processes. It concludes with speculation as to the significance of this historical event as a source for further exploration into the nature of creative collaboration, dialogue, and collective wisdom.
Predictor@Home: A "Protein Structure Prediction Supercomputer" Based on Public-Resource Computing
Authors: M. Taufer, C. An, A. Kerstens, C. L. Brooks III
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 7 - Volume 08 (2005)

Predicting the structure of a protein from its amino acid sequence is a complex process the understanding of which could be used to gain new insight into the nature of protein function or provide targets for structure-based design of drugs to treat new and existing diseases. While protein structures can be accurately modeled using computational methods based on all atom physics-based force fields including implicit solvation, these methods require extensive sampling of native-like protein conformations for successful prediction, and consequently they are often limited by inadequate computing power. To address this problem, we developed Predictor@Home, a "structure prediction supercomputer" powered by the Berkeley Open Infrastructure for Network Computing (BOINC) framework and based on the public-resource computing paradigm (i.e., volunteered computing resources interconnected to the Internet and owned by the public). In this paper, we describe the protocol we employed for protein structure prediction and the integration of these methods into a public-resource architecture. We show how Predictor@Home significantly improved our ability to predict protein structureby increasing our sampling capacity by 1-2.5 orders of magnitude.
Text filtering in MUC-3 and MUC-4
Authors: David D. Lewis, Richard M. Tong
Venue: Proceedings of the 4th conference on Message understanding (1992)

One of the changes from the Third (MUC-3) to the Fourth (MUC-4) Message Understanding Conference was the emergence of text filtering as an explicit topic of discussion. In this paper we examine text filtering in MUC systems with three goals in mind. First, we clarify the difference between two uses of the term "text filtering" in the context of data extraction systems, and put these phenomena in the context of prior research on information retrieval (IR).
Notes on fridge surfaces
Authors: Laurel Swan, Alex S. Taylor
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Drawing on ongoing ethnographic investigations into home life, this paper presents detailed findings from a preliminary examination of refrigerator surfaces. The use and organization of items on fridge surfaces are shown to be closely tied to the material properties of both fridges and their surroundings. Emphasis is placed on the importance of fridge magnets as they are seen to contribute to a fluidity and reconfigurability that make fridge surfaces unique. Building on this, it is argued that the negotiation of family relations is afforded by the presented properties of the fridge and of magnets. To conclude, we introduce some general points to consider in designing interactive surfaces for the home.
Average adjacencies for tetrahedral skeleton-regular partitions
Authors: A. Plaza, M. C. Rivara
Venue: Journal of Computational and Applied Mathematics (2005)

For any conforming mesh, the application of a skeleton-regular partition over each element in the mesh, produces a conforming mesh such that all the topological elements of the same dimension are subdivided into the same number of child-elements. Every skeleton-regular partition has associated special constitutive (recurrence) equations. In this paper the average adjacencies associated with the skeleton-regular partitions in 3D are studied. In three-dimensions different values for the asymptotic number of average adjacencies are obtained depending on the considered partition, in contrast with the two-dimensional case [J. Comput. Appl. Math. 140 (2002) 673]. In addition, a priori formulae for the average asymptotic adjacency relations for any skeleton-regular partition in 3D are provided.
EasyVPN: IPsec Remote Access Made Easy
Authors: Mark C. Benvenuto, Angelos D. Keromytis
Venue: Proceedings of the 17th USENIX conference on System administration (2003)

Telecommuting and access over a Wireless LAN require strong security at the network level. Although IPsec is well-suited for this task, it is difficult to configure and operate a large number of clients. To address this problem, we leverage the almost universal deployment and use of web browsers capable of SSL/TLS connections to web servers and the familiarity of users with such an interface. We use this mechanism to create configurations and certificates that will be downloaded to the user's machine and be used by a program to perform all configuration on the user's system.Our system builds on common security protocols and standards such as IKE, X.509, and SSL/TLS to provide users with a secure-access environment that "just works." One of the main goals of the system is ease of use both for the users and the system administrators that maintain the infrastructure. We describe our implementation that uses Linux FreeS/WAN and Windows to show the practicality of the approach.
One name&mdash;many objects&mdash;one result: a possible solution for naming system
Authors: L. Preechaveerakul, P. Bhattarakosol
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

Names are usually used to referring the objects. In the computer world, name services are fundamental services to all computer networks. Several name services have been developed to map physical resources to logical names. Most of current name services are hierarchical structure. Therefore, each name in a tree must be unique. In the real world, sometimes we want to share a name especially, in the organization with more than one office locations. This paper proposes a new naming system which supports the sharable name.
Generating novel tactics through evolutionary computation
Authors: V. William Porto, David B. Fogel, Lawrence J. Fogel
Venue: ACM SIGART Bulletin (1998)

Simulated evolution on a computer can provide a means for generating appropriate tactics in real-time combat scenarios. Individual unit or higher level organizations, such as tanks and platoons, can use evolutionary computation to adapt to the current and projected situations. In this article, we briefly review current knowledge in evolutionary algorithms and offer an example of applying these techniques to generate adaptive behavior in a platoon-level engagement of tanks in which the mission of one platoon is changed on-the-fly.
Sussex University: description of the Sussex system used for MUC-5
Authors: Robert Gaizauskas, Lynne Cahill, Roger Evans
Venue: Proceedings of the 5th conference on Message understanding (1993)

This paper describes the system used for the University of Sussex team's participation in the MUC-5 message understanding trials. What is described below is the result of 12 person-months of intensive effort over six months to adapt a pre-existing system, designed with very different objectives and application in mind, to the MUC-5 English Joint Ventures task. This task, starting from cold, is colossal: the overhead of understanding the task, the training data, the scoring, the background resources, of developing a suitable harness for the system, not to mention sorting out contractual arrangements, leaves little time for even basic porting - actual development tailored to the task was a very remote prospect. So, despite the quirks and failings exposed by the discussion below of the 'walkthrough' example, we are pleased with our system's performance, and believe the effort to have been a worthwhile part of our ongoing research.
On the conditions necessary for removing abstraction penalties in O OL AL A: Research Articles
Authors: Mikel Luján, T. L. Freeman, John R. Gurd
Venue: Concurrency and Computation: Practice Experience (2005)

OOLALA is an object-oriented linear algebra library designed to reduce the effort of software development and maintenance. In contrast with traditional (Fortran-based) libraries, it provides two high abstraction levels that significantly reduce the number of implementations necessary for particular linear algebra operations. Initial performance evaluations of a Java implementation of OOLALA show that the two high abstraction levels are not competitive with the low abstraction level of traditional libraries. These initial performance results motivate the present contribution&mdash;the characterization of a set of storage formats (data structures) and matrix properties (special features) for which implementations at the two high abstraction levels can be transformed into implementations at the low (more efficient) abstraction level. Copyright &copy; 2005 John Wiley & Sons, Ltd.
An empirical study of typing rates on mini-QWERTY keyboards
Authors: Edward Clarkson, James Clawson, Kent Lyons, Thad Starner
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

We present a longitudinal study of mini-QWERTY keyboard use, examining the learning rates of novice mini-QWERTY users. The study consists of 20 twenty-minute typing sessions using two different-sized keyboard models. Subjects average over 31 words per minute (WPM) for the first session and increase to an average of 60 WPM by the twentieth. Individual subjects also exceed the upper bound of 60.74 WPM suggested by MacKenzie and Soukoreff's model of two-thumb text entry [5]. We discuss our results in the context of this model.
High-capacity resource sharing schemes for broadband wireless networks: Research Articles
Authors: Alessandro Andreadis, Giuliano Benelli, Giovanni Giambene, Veronica Pasqualetti
Venue: Wireless Communications Mobile Computing (2004)

The unique capabilities of new cellular systems are expected to provide users with integrated multimedia services. Since the air interface still represents the system bottleneck, this paper proposes novel scheduling techniques to integrate efficiently the support of real-time traffic (i.e. voice and video) and data bursty traffic under quality of service (QoS) guarantees. Prioritization among traffic classes is adopted and a polling service discipline is employed within a class, where the permission rights of each traffic source are determined on the basis of token bucket regulators. Two polling-based approaches are compared to serve the sources of a class: (i) when a source is enabled to transmit, a burst of packets is sent at once; (ii) within the time interval destined to a traffic class, a cyclic service of the sources is allowed on a packet basis. With realistic assumptions on both radio channel conditions and protocol signaling overhead, this paper compares these two different approaches and the dynamic slot assignment++ (DSA++) scheme appeared in the literature. The obtained results highlight that our second scheme (case ii) allows increasing the number of supported video traffic sources of many units with respect to DSA++. Finally, an analytical approach has been proposed for our second polling scheme. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Bender: a virtual ribbon for deforming 3D shapes in biomedical and styling applications
Authors: Ignacio Llamas, Alexander Powell, Jarek Rossignac, Chris D. Shaw
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

In contrast to machined mechanical parts, the 3D shapes encountered in biomedical or styling applications contain many tubular parts, protrusions, engravings, embossings, folds, and smooth bends. It is difficult to design and edit such features using the parameterized operations or even free-form deformations available in CAD or animation systems. The Bender tool proposed here complements previous solutions by allowing a designer holding a 6 DoF 3D tracker in each hand to control the position and orientation of the ends of a stretchable virtual ribbon, which is used to grab the shape in its vicinity and to deform it in realtime, as the designer continues to move, bend, and twist the ribbon. To ensure realtime performance and intuitive control of the ribbon, we model its centerline as a circular biarc and perform adaptive refinement of the triangle-mesh approximation of the surface. To produce a natural and predictable warp, we use the initial and final shapes of the ribbon to define a one-parameter family of screw-motions. The deformation of a surface point is computed by finding its locally closest projection, or projections, on the biarc and by applying the corresponding screws, weighted by a function that decays with the distance to the projection. The combination of these solutions leads to an easy-to-use and effective tool for the direct manipulation of organic or stylized shapes.
An efficient algorithm for predictive continuous nearest neighbor query processing and result maintenance
Authors: Ken C. K. Lee, Hong Va Leong, Jing Zhou, Antonio Si
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Predictive continuous nearest neighbor queries are concerned with finding the nearest neighbor objects for some future time period according to the current object and query locations and their motion information. Existing continuous query processing algorithms are not efficient enough, requiring multiple dataset lookups to evaluate the query results throughout the duration of a continuous query. More importantly, the complete result for the whole query time interval is only available at the moment when all object motion updates have been examined, based on which adjustment of the query result is made. In this paper, we propose an algorithm which requires only one dataset lookup to deliver a complete predictive result. We then apply a differential update technique to maintain the query results incrementally in the presence of object location and motion updates.
The Effect of Handoff Dwell Time on the Mobile Network Performance
Authors: Yan Zhang, Boon-Hee Soong
Venue: Wireless Personal Communications: An International Journal (2004)

In this paper, we have studied the impact of the handoff dwell time (HDT) on the channel holding time (CHT) modeling and examined how it affects the mobile network performance evaluation. Realistic mobility model is constructed that includes the effect of HDT and we derive the important relationship between the critical parameters such as cell residence time (CRT), call holding time, CHT and HDT. Queueing priority scheme utilizing the HDT is applied to evaluate the HDT effect on performance indices in terms of the new call and handoff call blocking probabilities. It is observed that the relative error between the realistic new call blocking probability and conventional one can reach 70% and the conventional handoff blocking probability can even double the realistic one under the same specific practical condition. Next, we compare the new call and handoff call blocking probabilities when exponential handoff dwell time distribution is replaced by truncated Gaussian distribution with both the same mean and standard deviation in the discrete event simulation. A considerable gap between the handoff call blocking probabilities is shown, which indicates that the performance indices are sensitive to the handoff dwell time distribution.
Dynamic Delay-Fault Injection for Reconfigurable Hardware
Authors: Bernhard Fechner
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 16 - Volume 17 (2005)

Modern internet and telephone switches consist of numerous VLSI-circuits operating at high frequencies to handle high bandwidths. It is beyond question that such systems must contain mechanisms making them reliable through fault-detection or fault-tolerance. For monetary reasons, one or multiple Field Programmable Gate Arrays (FPGAs) are used in modern Application Specific Integrated Circuit (ASIC) development systems before production. Hardware manufacturers have a strong focus on quick fault-injection to verify and validate the correct function of such a (faulttolerant) system. However, current FPGA-based fault injection schemes do not consider delay faults. In this paper we present an extension to traditional FPGA fault injection schemes without any additional hardware for fixed and small hardware overhead for dynamic phase shifting. By using digital clock managers (DCMs), we are able to inject delay faults very fast through phase-shift variation of the clock without reconfiguring the FPGA.
Multidocument summarization via information extraction
Authors: Michael White, Tanya Korelsky, Claire Cardie, Vincent Ng, David Pierce, Kiri Wagstaff
Venue: Proceedings of the first international conference on Human language technology research (2001)

We present and evaluate the initial version of RIPTIDES, a system that combines information extraction, extraction-based summarization, and natural language generation to support user-directed multidocument summarization.
East Meets West to Cure Healthcare Ills Using Information Technology
Authors: Dixie B. Baker
Venue: Proceedings of the IDEAS Workshop on Medical Information Systems: The Digital Hospital (2004)

Although a half-world apart, the United States and the People's Republic of China share many of the same challenges in the delivery of health care to their citizens. Both healthcare systems suffer from inefficiencies, ever-increasing costs, and inequities in access to care. Public health surveillance and response are challenges for both countries, individually and in dealing with global outbreaks. The governments of both countries are taking actions to address their nations' healthcare problems, and they see information technology as a remedy for their healthcare ills - in particular, advanced networking, Electronic Health Record systems, and mobile computing devices. However, a number of challenges must be met before pervasive, quality health care enabled through technology can be realized. Meeting these challenges presents a good opportunity for China and the U.S. to work together toward effective IT solutions. 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
SuperPipe: next generation of high speed trunks
Authors: Deepak Mathur
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

With the traffic demand increasing there will be a need for terabit routers to do the switching. In addition point-to-point links of several hundred gigabytes connecting them. Due to technological limitations these links are limited to 40Gbps currently. To bypass the limitations of technology, several parallel 10G links connecting a router pair are bundled together and treated as a single link or a high-speed trunk. Several schemes exist but have limitations. This paper introduces a novel new way of implementing high-speed link called SuperPipe and describes how it is superior to existing implementations. 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