ppxscal/embedding_network huggingface dataset:
A rationale for heuristic program selection and evaluation
Authors: J. P. Ignizio, R. M. Wyskida, M. R. Wilhelm
Venue: ACM SIGDA Newsletter (1973)

In the past, great claims have been set forth as to the potential of the heuristic procedure or "heuristic programming," References 1 and 2. As early as 1958 Simon and Newell, Reference 2, wrote of "Heuristic Problem Solving: The Next Advance in Operations Research." However, and this is strictly the opinion of the authors (although it is shared by most others we have discussed the matter with), rather than seeing a relative increase in heuristic program solution techniques in the literature, the converse appears to be true. Most of the journals dealing with operations research, management science, industrial engineering, and related fields have evolved (or perhaps dissolved, depending on one's point of view) into journals of mathematics, or perhaps abstract mathematics. The fundamental idea of engineering as being directed toward real world applications often seems to have been lost. As a result, we (industrial engineers/operations researchers) are now caustically described as pseudo-mathematicians, and the field has been defined as the "science of providing elegant solutions to trivial problems." OR has even been credited with such things as our poor performance and defeats in the Indo-China war, Reference 5, cost overruns on defense contracts and so on. Such criticism comes from both outside and within our profession, References 3, 4, 5.
The virtual raft project: a mobile interface for interacting with communities of autonomous characters
Authors: Bill Tomlinson, Man Lok Yau, Jessica O'Connell, Ksatria Williams, So Yamaoka
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This paper presents a novel and intuitive paradigm for interacting with autonomous animated characters. This paradigm utilizes a mobile device to allow people to transport characters among different virtual environments. The central metaphor in this paradigm is that virtual space is like land and real space is like water for virtual characters. The tangible interface described here serves as a virtual raft with which people may carry characters across a sea of real space from one virtual island to another. By increasing participants' physical engagement with the autonomous characters, this interaction paradigm contributes to the believability of those characters.
Crossing Minimization for Symmetries
Authors: Christoph Buchheim, Seok-Hee Hong
Venue: Theory of Computing Systems (2005)

We consider the problem of drawing a graph with a given symmetry such that the number of edge crossings is minimal. We show that this problem is NP-hard, even if the order of orbits around the rotation center or along the reflection axis is fixed. We devise an O(m log m) algorithm for computing a crossing minimal drawing if inter-orbit edges may not cross orbits, showing in particular that intra-orbit edges do not contribute to the NP-hardness of the crossing minimization problem for symmetries.
Design Theoretic Approach to Replicated Declustering
Authors: Ali Saman Tosun
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices.Most of the research on declustering is targeted at spatial range queries and investigates scheme with low additive error.Recently, declustering using replication is proposed to reduce the additive overhead.Replication significantly reduces retrieval cost of arbitrary queries.In this paper, we propose a disk allocation and retrieval mechanism for arbitrary queries based on design theory.Using proposed c-copy replicated declustering scheme, (c - 1)k^2 + ck buckets can be retrieved using at most k disk accesses. Retrieval algorithm is very efficient and is asymptotically optimal with ¿(|Q|) complexity for a query Q. In addition to the deterministic worst-case bound and efficient retrieval, proposed algorithm handles nonuniform data, high dimensions, supports incremental declustering and has good fault-tolerance property.
Phoenix architecture
Authors: John Roder
Venue: ACM SIGDA Newsletter (1978)

Multiprogramming and multitasking programming concepts are familiar to most of us. In a multiprogrammed arrangement several "user programs" can share the use of a single computer in a time sharing mode. An executive program provides the time slices to the "user programs" by activating and deactivating them according to some schedule. When multitasking is added to this arrangement, a "user program" may have several incarnations and the executive provides time slices to the incarnations of the user programs. 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
An example concerning quasi-Newton estimation of a sparse hessian
Authors: Danny C. Sorensen
Venue: ACM SIGNUM Newsletter (1981)

An example is given which shows that certain quasi-Newton methods for sparse optimization problems can be unstable.
Kostka-Foulkes Polynomials Cyclage Graphs and Charge Statistic for the Root System Cn
Authors: Cédric Lecouvey
Venue: Journal of Algebraic Combinatorics: An International Journal (2005)

We establish a Morris type recurrence formula for the root system Cn. Next we introduce cyclage graphs for the corresponding Kashiwara-Nakashima's tableaux and use them to define a charge statistic. Finally we conjecture that this charge may be used to compute the Kostka-Foulkes polynomials for type Cn.
On the Benefits of Pooling in Production-Inventory Systems
Authors: Saif Benjaafar, William L. Cooper, Joon-Seok Kim
Venue: Management Science (2005)

We study inventory pooling in systems with symmetric costs where supply lead times are endogenously generated by a finite-capacity production system. We investigate the sensitivity of the cost advantage of inventory pooling to various system parameters, including loading, service levels, demand and production time variability, and structure of the production system. The analysis reveals differences in how various parameters affect the cost reduction from pooling and suggests that these differences stem from the manner in which the parameters influence the induced correlation between lead-time demands of the demand streams. We compare these results with those obtained for pure inventory systems, where lead times are exogenous. We also compare inventory pooling with several forms of capacity pooling.
A context-aware group management middleware to support resource sharing in MANET environments
Authors: Dario Bottazzi, Antonio Corradi, Rebecca Montanari
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Recent advances in Mobile Ad-hoc NETworks (MANET) technologies promote new opportunities for users to share resources from ubiquitous points of attachment, when changing physical locations and even when no statically deployed network infrastructure is available. However, the highly dynamic nature of Mobile Ad-Hoc environments causes users to experience continuous changes in the set of the locally accessible resources, thus increasing the complexity of resource sharing. Novel middleware solutions are required to support the various management issues involved in resource sharing in MANETs environments. In particular, it is crucial to handle and to propagate up to the application level the visibility of both the users that are willing to group together to share their resources and of the resources they decide to share. The paper proposes a group management middleware (AGAPE) that, as a key feature, exploits the visibility of context information, e.g., user location, user attributes and preferences, access device properties, to create and discover groups of interest for resource sharing, to monitor the availability of groups members, and to dynamically arrange/requalify group members bindings to shared resources as changes in context operating conditions occur. Application developers can exploit the AGAPE support to build on top of it various application-specific resource sharing strategies and mechanisms, such as Global Virtual Data Structures. Finally, the paper presents a MANET-enabled emergency rescue application scenario to show and to evaluate the functioning of AGAPE.
Apache Jakarta Commons: Reusable Java(TM) Components (Bruce Perens Open Source)
Authors: Will Iverson
Venue:  (2005)

Easy-to-follow coverage of twelve indispensable Jakarta Commons packages Code examples that show innovative uses of Commons components, including using HttpClient to access Web resources, FileUpload for handling HTTP file uploads, and BeanUtils for easy form generation Detailed instructions for combining the Commons project libraries with the popular Eclipse IDESave time and money with reusable open source Java™ componentsMaster the Jakarta Commons Library of Open Source JavaTM ComponentsUsing the Apache Jakarta Commons reusable Java™ components, you can leverage the work of the global open-source community to solve common programming problems reliably, quickly, and inexpensively. But, to use the Commons libraries effectively, you need far more guidance than the official documentation offers. In Apache Jakarta Commons: Reusable Java™ Components, Will Iverson covers what Java developers need to know to take full advantage of Jakarta Commons-starting right now.Iverson begins with a definitive overview of the Commons project: goals, installation, and getting started with Commons components. Next, he presents example-rich chapters on the twelve most useful Commons packages, covering topics ranging from HTTP FileUpload to database connectivity. Iverson provides detailed code samples for every component he describes. After you've mastered the core Jakarta Commons packages, you'll constantly rely on this book's handy seventy-five page quick-reference. Iverson's coverage includes Downloading Commons project libraries and installing them into Eclipse Programmatically accessing resources via HTTP, FTP, NNTP, and other Internet protocols Using the Jakarta Commons suite of configurable object pools Managing database connectivity in Swing applications-and anywhere containers aren't doing it for you Using BeanUtils to generate forms and gain runtime access to information provided by JavaBeans-style objects Traversing complex object graphs with JXPath Using Jakarta Commons' advanced collections tools to establish richer object relationships Extending java.lang with better methods for manipulating core classes Implementing conversion routines, configurable logging, command-line help, and more Exploring the newest packages, including emerging "sandbox" packagesWhether you're building code for front-end Web applications, client-side software, or back-end servers, learning Jakarta Commons will make you far more efficient. Apache Jakarta Commons is the fastest way to master and get results with Commons.
Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays
Authors: Hussein M. Alnuweiri, Viktor K. Prasanna
Venue: Distributed Computing (1991)

Linear arrays are characterized by a small communication bandwidth and a large communication diameter rendering them unsuited to the implementation of global computations. This paper presents efficient data movement and partitioning techniques to overcome several shortcomings of linear arrays. These techniques are used to derive optimal parallel algorithms for several geometric problems on n × n images using a fixed-size linear array with p processors, where 1 ≤ p ≤ n. O(n2/p) time solutions are presented for labeling connected image regions, computing the convex hull of each region, and computing nearest neighbors. Consequently, a linear array with n processors can solve several image problems in O(n) time which is the same time taken by a two dimensional mesh-connected computer with n2 processors. Limitations of linear arrays are analyzed by presenting a class of image problems which can be solved sequentially in O(n2) time, but require Ω(n2) time on a linear array, irrespective of the number of processors used and the partitioning of the input image among the processors. An alternate communication-efficient fixed-size organization with p processors is proposed to solve such problems in O(n2/p) time, for 1 ≤ p ≤ n.
An indexing scheme for typed feature structures
Authors: Takashi Ninomiya, Takaki Makino, Jun'ichi Tsujii
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

This paper describes an indexing substrate for typed feature structures (ISTFS), which is an efficient retrieval engine for typed feature structures. Given a set of typed feature structures, the ISTFS efficiently retrieves its subset whose elements are unifiable or in a subsumption relation with a query feature structure. The efficiency of the ISTFS is achieved by calculating a unifiability checking table prior to retrieval and finding the best index paths dynamically.
Video Data Mining: Semantic Indexing and Event Detection from the Association Perspective
Authors: Xingquan Zhu, Xindong Wu, Ahmed K. Elmagarmid, Zhe Feng Lide Wu
Venue: IEEE Transactions on Knowledge and Data Engineering (2005)

Advances in the media and entertainment industries, including streaming audio and digital TV, present new challenges for managing and accessing large audio-visual collections. Current content management systems support retrieval using low-level features, such as motion, color, and texture. However, low-level features often have little meaning for naive users, who much prefer to identify content using high-level semantics or concepts. This creates a gap between systems and their users that must be bridged for these systems to be used effectively. To this end, in this paper, we first present a knowledge-based video indexing and content management framework for domain specific videos (using basketball video as an example). We will provide a solution to explore video knowledge by mining associations from video data. The explicit definitions and evaluation measures (e.g., temporal support and confidence) for video associations are proposed by integrating the distinct feature of video data. Our approach uses video processing techniques to find visual and audio cues (e.g., court field, camera motion activities, and applause), introduces multilevel sequential association mining to explore associations among the audio and visual cues, classifies the associations by assigning each of them with a class label, and uses their appearances in the video to construct video indices. Our experimental results demonstrate the performance of the proposed approach.
Control of Temporal Constraints Based on Dioid Algebra for Timed Event Graphs
Authors: Said Amari, Jean Jacques Loiseau, Isabel Demongodin
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03 (2005)

We consider a class of controlled timed event graphs subject to strict temporal constraints. Such a graph is deterministic, in the sense that its behavior only depends on the initial marking and on the control that is applied. As it is wellknown, this behavior can be modelled by a system of difference equations that are linear in the Min-Plus algebra (R ¿ {+¿}, min, plus). The temporal constraint is represented by an inequation, that is also linear in the min-plus algebra. Then, a method for the synthesis of a control law ensuring the respect of the constraint is described. Two sufficient conditions are given, in terms of initial tokens and delays along the graph. We give explicit formulas characterizing a control law, which, if the conditions are satisfied, ensures the validity of the temporal constraints. This control law is also defined as a linear system over the Min-Plus algebra. It is a causal state feedback, involving delays. The method is illustrated on a production system.
Ultralow-power adiabatic circuit semi-custom design
Authors: Antonio Blotti, Roberto Saletti
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2004)

This brief shows that a conventional semi-custom design-flow based on a positive feedback adiabatic logic (PFAL) cell library allows any VLSI designer to design and verify complex adiabatic systems (e.g., arithmetic units) in a short time and easy way, thus, enjoying the energy reduction benefits of adiabatic logic. A family of semi-custom PFAL carry lookahead adders and parallel multipliers were designed in a 0.6-µm CMOS technology and verified. Post-layout simulations show that semi-custom adiabatic arithmetic units can save energy a factor 17 at 10 MHz and about 7 at 100 MHz, as compared to a logically equivalent static CMOS implementation. The energy saving obtained is also better if compared to other custom adiabatic circuit realizations and maintains high values (3 ÷ 6) even when the losses in power-clock generation are considered.
Extensible input handling in the subArctic toolkit
Authors: Scott E. Hudson, Jennifer Mankoff, Ian Smith
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

The subArctic user interface toolkit has extensibility as one of its central goals. It seeks not only to supply a powerful library of reusable interactive objects, but also make it easy to create new, unusual, and highly customized interactions tailored to the needs of particular interfaces or task domains. A central part of this extensibility is the input model used by the toolkit. The subArctic input model provides standard reusable components that implement many typical input handling patterns for the programmer, allows inputs to be handled in very flexible ways, and allows the details of how inputs are handled to be modified to meet custom needs. This paper will consider the structure and operation of the subArctic input handling mechanism. It will demonstrate the flexibility of the system through a series of examples, illustrating techniques that it enables - many of which would be very difficult to implement in most toolkits.
SAFE-RD (Secure, Adaptive, Fault Tolerant, and Efficient Resource Discovery) in Pervasive Computing Environments
Authors: Moushumi Sharmin, Shameem Ahmed, Sheikh I. Ahamed
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

To facilitate thousands of hand held device users' lookup for services anywhere anytime, the importance of a resource discovery scheme in pervasive computing environments cannot be overlooked. The incorporation of Security, Adaptability, Fault Tolerance, and Efficiency features is the quest for long but there is no existing resource discovery scheme that can be claimed as "the solution". In this paper, we propose the design of such a discovery mechanism named SAFE-RD, which is an integral part of our on-going research project MARKS (Adaptive Middleware for Resource discovery, Knowledge usability and Selfhealing) with illustrative examples.
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
Authors: Stephane Redon, Ming C. Lin
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the problem as purely geometric in nature, though dynamics or quasi-statics of linkages should also be considered. Existing optimal algorithms that compute forward dynamics or quasi-statics of linkages have a linear runtime dependence on the number of joints in the linkage. When forces are applied to a linkage, these techniques need to compute the accelerations of all the joints and can become impractical for rapid prototyping of highly complex linkages with a large number of joints.We introduce a novel algorithm that enables adaptive refinement of the forward quasi-statics simulation of complex linkages. This algorithm can cull away joints whose contribution to the overall linkage motion is below a given user-defined threshold, thus limiting the computation of the joint accelerations and forces to those that contribute most to the overall motion. It also allows a natural trade-off between the precision of the resulting simulation and the time required to compute it. We have implemented our algorithm and tested its performance on complex benchmarks consisting of up to 50,000 joints. We demonstrate that in some cases our algorithm is able to achieve up to two orders of magnitude of performance improvement, while providing a high-precision, error-bounded approximation of the quasi-statics of the simulated linkage.
Understanding Concerns in Software: Insights Gained from Two Case Studies
Authors: Meghan Revelle, Tiffany Broadbent, David Coppit
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

Much of the complexity of software arises from the interactions between disparate concerns. Even in well-designed software, some concerns can not always be encapsulated in a module. Research on separation of concerns seeks to address this problem, but we lack an understanding of how programmers conceptualize the notion of a concern and then identify that concern in code. In this work, we have conducted two exploratory case studies to better understand these issues. The case studies involved programmers identifying concerns and associated code in existing, unfamiliar software: GNU's sort.c and the game Minesweeper. Based on our experiences with these two case studies, we have identified several types of concerns and have detailed a number of factors that impact programmer identification of concerns. Based on these insights, we have created two sets of guidelines: one to help programmers identify relevant concerns and another to help programmers identify code relating to concerns.
A Measure of Robustness Against Multiple Kinds of Perturbations
Authors: Behdis Eslamnour, Shoukat Ali
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02 (2005)

Parallel and distributed heterogeneous computing systems may operate in an environment that undergoes unpredictable changes causing certain system performance features to degrade. Such systems need robustness to guarantee limited degradation despite fluctuations in the behavior of its component parts or environment. Our previous work in this area presented a method for generating a measure of robustness for a given system. However, the focus of that approach was on a scenario where all perturbations were of the same kind, e.g., all perturbations were in message sizes or computation times, but not both message sizes and computation times. This paper gives an extended discussion of the case where perturbations could be of different kinds, and presents some new insights.