ppxscal/embedding_network huggingface dataset:
An optimized Java interpreter for connected devices and embedded systems
Authors: Andrew Beatty, Kevin Casey, David Gregg, Andrew Nisbet
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

The Java Virtual Machine (JVM) is usually implemented by an interpreter or just-in-time (JIT) compiler. JITs provide the best performance, but interpreters have a number of advantages that make them attractive, especially for embedded systems. These advantages include simplicity, portability and low memory requirements. In this paper we describe a new interpreter core for CVM, Sun Microsystem's JVM for connected devices and embedded systems. The interpreter core is portable and programmed in C. An interpreter generator is used to apply a number of optimisations automatically to the source code. Experimental results show that on benchmarks that spend almost all their time in the interpreter (rather than the run time system) it is 28% to 58% faster than the original CVM interpreter, and is only 5% to 9% slower than the highly-sophisticated, hand-tuned, assembly language interpreter in Sun's desktop JVM.
Design issues for vision-based computer interaction systems
Authors: Rick Kjeldsen, Jacob Hartman
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

Computer Vision and other direct sensing technologies have progressed to the point where we can detect many aspects of a user's activity reliably and in real time. Simply recognizing the activity is not enough, however. If perceptual interaction is going to become a part of the user interface, we must turn our attention to the tasks we wish to perform and methods to effectively perform them.This paper attempts to further our understanding of vision-based interaction by looking at the steps involved in building practical systems, giving examples from several existing systems. We classify the types of tasks well suited to this type of interaction as pointing, control or selection, and discuss interaction techniques for each class. We address the factors affecting the selection of the control action, and various types of control signals that can be extracted from visual input. We present our design for widgets to perform different types of tasks, and techniques, similar to those used with established user interface devices, to give the user the type of control they need to perform the task well. We look at ways to combine individual widgets into Visual Interfaces that allow the user to perform these tasks both concurrently and sequentially.
Algorithms and applications for answering ranked queries using ranked views
Authors: Vagelis Hristidis, Yannis Papakonstantinou
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2004)

Ranked queries return the top objects of a database according to a preference function. We present and evaluate (experimentally and theoretically) a core algorithm that answers ranked queries in an efficient pipelined manner using materialized ranked views. We use and extend the core algorithm in the described PREFER and MERGE systems. PREFER precomputes a set of materialized views that provide guaranteed query performance. We present an algorithm that selects a near optimal set of views under space constraints. We also describe multiple optimizations and implementation aspects of the downloadable version of PREFER. Then we discuss MERGE, which operates at a metabroker and answers ranked queries by retrieving a minimal number of objects from sources that offer ranked queries. A speculative version of the pipelining algorithm is described.
Local Government Information Technology Capacity: An Exploratory Theory
Authors: Hyun Joon Kim, Stuart Bretschneider
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

Local government has made use of information technology for a long time, but the level of information technology capacity varies tremendously across local governments. While web-based E-government applications development becomes more prevalent, applying newly developed IT continues to depend on the general ability of government to obtain, manage and utilize IT. This paper starts by providing a comprehensive definition of IT capacity, whichincorporates both human aspect and non-human aspect of IT capacity. Next, we propose a theoretical model to identify and knit together the crucial factors affecting the achievement of IT capacity in local governments. Managerial capability of IT manager affects the level of IT capacity of a local government through the interactions with support from administrative authorities and financial supports available for IT innovation. A series of cases from New Jersey municipalities illustrate the proposed theory and enrich it by revealing the relationships between the factors not identified in the theory.
High-performance remote access to climate simulation data: a challenge problem for data grid technologies
Authors: Ann Chervenak, Ewa Deelman, Carl Kesselman, Bill Allcock, Ian Foster, Veronika Nefedova, Jason Lee, Alex Sim, Arie Shoshani, Bob Drach, Dean Williams, Don Middleton
Venue: Parallel Computing (2003)

In numerous scientific disciplines, terabyte and petabyte-scale data collections are emerging as critical community resources. A new class of "data grid" infrastructure is required to support management, transport, distributed access to, and analysis of these datasets by potentially thousands of users. Researchers who face this challenge include the climate modeling community, which performs long-duration computations accompanied by frequent output of very large files that must be further analyzed. We describe the Earth System Grid-I prototype, which brings together advanced analysis, replica management, data transfer, request management, and other technologies to support high-performance, interactive analysis of replicated data. We present performance results that demonstrate our ability to manage the location and movement of large datasets from the user's desktop. We report on experiments conducted over SciNET at SC'2000, where we achieved peak performance of 1.55 Gb/s and sustained performance of 512.9 Mb/s for data transfers between Texas and California. Finally, we describe the development of the next-generation Earth System Grid-II (ESG-II) project. Important issues for ESG-II include security requirements for production environments, efficient data filtering and transport, metadata services for discovery of relevant climate datasets, and sophisticated request or workflow management for complex tasks.
ArtStream: bringing Web art into museum culture
Authors: Tom Hapgood, Lucy Petrovich, Peter Briggs, Mike Holcomb, Charles Guerin, Shelley Tolman, Michael Branch
Venue: ACM SIGGRAPH 2003 Web Graphics (2003)

Works that involve Internet technology have been problematic for museums to show, to the point of exclusion. ArtStream, a Web-based, curated exhibition space for Internet art, seeks to promote the work of Internet artists while bringing it into the "legitimized" world of traditional museum culture. ArtStream is the product of a collaboration between the University of Arizona Museum of art and the Treistman Center for New Media, in the University of Arizona College of Fine arts. The project was funded by a New Learning Environments grant from the university.
Digital concrete: a multi-scale approach for the concrete behavior
Authors: F. Grondin, G. Mounajed, A. Ben Hamida, H. Dumontet
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

This article presents a digital method of homogenization in thermoelasticity based on the choice of a representative volume of the building material. Heterogeneities are generated in a random process. This numerical model developed by Mounajed is implemented in the general finite element code 'SYMPHONIE' of the CSTB. This stochastic method is applied to the calculation of the homogenized behavior of a High Strength Concrete. Furthermore, this method allows, through the process of location, to estimate the local field and to predict possible damages of the building material.
Broadcast program generation for unordered queries with data replication
Authors: Jiun-Long Huang, Ming-Syan Chen
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

We study in this paper the problem of broadcasting dependent data for unordered queries. However, most prior studies on dependent data broadcasting are limited to the premise of no data replication. Different from other prior studies, we investigate the effect of data replication in this paper. Specifically, we first derive several theoretical properties for the average access time by analyzing the model of dependent data broadcasting. On the basis of the theoretical results, we develop a genetic algorithm to generate broadcast programs with replication. In order to compare the performance of the proposed algorithm and the prior studies, several experiments are conducted. Our experimental results show that with the analytical results derived, the theoretical results derived are able to guide the search of the genetic algorithm very effectively, and lead to solution broadcast programs of higher quality than those of the prior studies.
Dynamically Tuning Processor Resources with Adaptive Processing
Authors: David H. Albonesi, Rajeev Balasubramonian, Steven G. Dropsho, Sandhya Dwarkadas, Eby G. Friedman, Michael C. Huang, Volkan Kursun, Grigorios Magklis, Michael L. Scott, Greg Semeraro, Pradip Bose, Alper Buyuktosunoglu, Peter W. Cook, Stanley E. Schuster
Venue: Computer (2003)

The adaptive processing approach improves microprocessor energy efficiency by dynamically tuning major resources during execution to better match varying application needs. This tuning usually involves reducing a resource's size when its full capabilities are not needed, then restoring the disabled portions when they are needed again.Adaptive processors require few additional transistors. Further, because adaptation occurs only in response to infrequent trigger events, the decision logic can be placed into a low-leakage state until such events occur.
A Strategy for Selecting Synchronization Sequences to Test Concurrent Object-Oriented Software
Authors: Huo Yan Chen, Yu Xia Sun, T. H. Tse
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Testing is the most commonly used approach to theassurance of software quality and reliability. The testingof object-oriented software is much more complex thanthat of conventional programs. Although we proposedpreviously a method called TACCLE for testing object-oriented software at the class and cluster levels, it did notcover concurrent or non-deterministic situations.This paper puts forward a strategy for selectingsynchronization sequences to test concurrent object-oriented software, including non-deterministic cases. It isbased on OBJSA net/CLOWN specifications. Experimentshave been carried out in a case study to verify the efficacyof the strategy.
Iterative compaction: an improved approach to graph and circuit bisection
Authors: J. Haralambides, F. Makedon
Venue: Proceedings of the conference on European design automation (1991)

Given a graph G= (V, E), graph bisection is the problem of finding a partition of the vertex set V into two equal-sized subsets V1 and V2 so that the number of edges between them is minimized. This problem has important applications in circuit partitioning, testing, VLSI design and other network-related problems that apply the divide-and-conquer strategy. We introduce a new heuristic approach, called Iterative Compaction (IC), which employees a node degree based matching and iterative graph compaction. This gives a significant improvement over the performance of known bisection algorithms in both time and quality of the results.
A Social Process Model for Cyber mind in the mobile Internet
Authors: Toshihiko Yamakami
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

As the number of the Internet-enabled mobile handsetsincreases, it is apparent that the mobile Internet deeplypenetrates into the every day life and impacts social interactions.The new ways of communications expose newsocial interaction patterns.Some of them are uncommonin the real world interactions.The author describes someof the case studies on new social interaction patterns andpresents the implications for mobile Internet-augmented societies.Especially, these interaction patterns are distinguishedin the viewpoints of quality of interaction modalitiesand loose identification.The author assumes a newsocial relation building process in the three aspects; communicationmodality, identity and distance.A mobile cybermind is defined and several aspects of it are contrasted withthose in the real world interactions.A staged AIMS modelis proposed to provide a basic measure to analyze the cybermind in the emerged technologies to augment the socialinteractions.The model focuses on the two aspects of theinteractions: the successful communication experience anddevelopment of social bindings during interactions.
An initial investigation of test driven development in industry
Authors: Boby George, Laurie Williams
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Test Driven Development (TDD) is a software development practice in which unit test cases are incrementally written prior to code implementation. In our research, we ran a set of structured experiments with 24 professional pair programmers. One group developed code using TDD while the other a waterfall-like approach. Both groups developed a small Java program. We found that the TDD developers produced higher quality code, which passed 18% more functional black box test cases. However, TDD developer pairs took 16% more time for development. A moderate correlation between time spent and the resulting quality was established upon analysis. It is conjectured that the resulting high quality of code written using the TDD practice may be due to the granularity of TDD, which may encourage more frequent and tighter verification and validation. Lastly, the programmers which followed a waterfall-like process often did not write the required automated test cases after completing their code, which might be indicative of the tendency among practitioners toward inadequate testing. This observation supports that TDD has the potential of increasing the level of testing in the industry as testing as an integral part of code development.
Adjoint-Based Iterative Method for Robust Control Problems in Fluid Mechanics
Authors: T. Tachim Medjo, L. R. Tcheugoue Tebou
Venue: SIAM Journal on Numerical Analysis (2004)

In this article we study the convergence of an adjoint-based iterative method recently proposed in [T. R. Bewley, R. Temam, and M. Ziane, Phys. D, 138 (2000), pp. 360--392] for the numerical solution of a class of nonlinear robust control problems in fluid mechanics. Under weaker assumptions than those of [T. Tachim Medjo, Numer. Funct. Anal. Optim., 23 (2002), pp. 849--873}], we prove the convergence of the algorithm, and we obtain an estimate of the convergence rate. Numerical solutions of a robust control problem related to data assimilation in oceanography are presented to illustrate the method.
Regularizing Flows for Constrained Matrix-Valued Images
Authors: C. Chefd'hotel, D. Tschumperlé, R. Deriche, O. Faugeras
Venue: Journal of Mathematical Imaging and Vision (2004)

Nonlinear diffusion equations are now widely used to restore and enhance images. They allow to eliminate noise and artifacts while preserving large global features, such as object contours. In this context, we propose a differential-geometric framework to define PDEs acting on some manifold constrained datasets. We consider the case of images taking value into matrix manifolds defined by orthogonal and spectral constraints. We directly incorporate the geometry and natural metric of the underlying configuration space (viewed as a Lie group or a homogeneous space) in the design of the corresponding flows. Our numerical implementation relies on structure-preserving integrators that respect intrinsically the constraints geometry. The efficiency and versatility of this approach are illustrated through the anisotropic smoothing of diffusion tensor volumes in medical imaging.
Complexity and approximation results for scheduling multiprocessor tasks on a ring
Authors: Giuseppe Confessore, Paolo Dell'Olmo, Stefano Giordani
Venue: Discrete Applied Mathematics (2003)

We study a multiprocessor task scheduling problem, in which each task requires a set of µ processors with consecutiveness constraints to be executed. This occurs, for example, when multiple processors are interconnected by communication means, and the minimization of communication time may require the processors to be physically adjacent and each multiprocessor task to use only one subset of adjacent processors. In particular, we consider the case in which we have m processors arranged in a ring, and we want to find a schedule with minimum makespan. We investigate problem complexity, showing that the problem is NP-hard in almost all the possible cases, and provide an approximation algorithm that finds a feasible schedule whose makespan is not greater than two times the optimal value.
Supply Chain Coordination Under Channel Rebates with Sales Effort Effects
Authors: Terry A. Taylor
Venue: Management Science (2002)

A channel rebate is a payment from a manufacturer to a retailer based on retailer sales to end consumers. Two common forms of channel rebates are linear rebates, in which the rebate is paid for each unit sold, and target rebates, in which the rebate is paid for each unit sold beyond a specified target level. When demand is not influenced by sales effort, a properly designed target rebate achieves channel coordination and a win-win outcome. Coordination cannot be achieved by a linear rebate in a way that is implementable. When demand is influenced by retailer sales effort, a properly designed target rebate and returns contract achieves coordination and a win-win outcome. Other contracts, such as linear rebate and returns or target rebate alone, cannot achieve coordination in a way that is implementable. Contrary to the view expressed in the literature that accepting returns weakens incentives for retailer sales effort, we find that the provision of returns strengthens incentives for effort.
From the editors
Authors: Dorothy Leidner, Wynne W. Chin
Venue: ACM SIGMIS Database (2004)

Happy New Year! Welcome to the first issue of 2004. We are pleased to begin the year with the addition of two new editorial board members. David Gefen, who has published numerous articles in Data Base, the most recent of which appeared in 34:3, will begin a three year term beginning this January. David's comprehensive, rigorous, and articulate approach to research will undoubtedly benefit many papers as they work their way through the review process under his guidance. Also joining our board is Roger Chiang. Roger will be filling a very large void that was left when Veda Storey rotated off the board. Roger will take responsibility for the initial screening and subsequent review processes of the more technical oriented papers that over the past two years have not entered into the review process because we were simply ill-equipped to accommodate the reviews of such paper based upon the expertise of our editorial board. We are pleased to now have eliminated this gap and once again, be able to ensure a quality review process for manuscripts that focus on technical IS issues.This first issue of 2004 marks a first of a kind for us as editors. Among the papers published in this issue is one of the first papers we received as new editors. This is in fact the first paper to appear in print that was submitted subsequent to our becoming co-editors. The paper went through two rounds of review over the course of a year. Co-authored by Powell, Piccoli, and Ives, it reviews virtual team research and offers guidance for future research in this field. The authors have read, interpreted, and aptly organized a great deal of research and provided insights into how to further the research and theory in this area. Because the very topic of "virtual teams" is quite broad, there are sundry theoretical lenses through which one could examine a virtual team. One could conceivably build a theory about managing virtual teams, about communication in virtual teams, about trust in virtual teams and so forth. Hence, rather than using the review to build a particular theory of virtual teams in general, the authors have provided an astute synthesis of the various theories that one can apply to the area of virtual teams, without favoring one such theory over another. This should help aspiring as well as experienced virtual team researchers in crafting their research programs.The remaining two articles in this issue are part of a special section on Contemporary Virtual Environments, co-edited by Manju Ahuga, France Bélanger, and Mary Beth Watson-Manheim. The two papers in the special section are introduced in the insightful introduction written by Ahuja, Bélanger, and Watson-Manheim. We sincerely thank these fine researchers for their efforts in serving as editors of this special section.
Replication and retrieval strategies of multidimensional data on parallel disks
Authors: Chung-Min Chen, Christine T. Cheng
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Aside from enhancing data availability during disk failures, replication of data is also used to speed up I/O performance of read-intensive applications. There are two issues that need to be addressed: (a) data placement (Which disks should store the copies of each data block?) and (b) scheduling (Given a query Q, and a placement scheme P of the data, from which disk should each block in Q be retrieved so that retrieval time is minimized?) In this paper, we consider range queries and assume that the dataset is a multidimensional grid and r copies of each unit block of the grid must be stored among M disks. To accurately measure performance of a scheduling algorithm, we consider a metric that takes into account the scheduling overhead as well as the time it takes to retrieve the data blocks from the disks. We describe several combinations of data placement schemes and scheduling algorithms and analyze their performance for range queries with respect to the above metric. We then present simulation results for the most interesting case r=2, showing that the strategies do perform better than the previously known method, especially for large queries.
Manipulating OOo documents with Ruby
Authors: James Britt
Venue: Linux Journal (2004)

XML and Ruby let your scripts and your office suite handle thesame files.
A new cache management algorithm for multimedia storage systems
Authors: Javier Fernández, Jesus Carretero, Felix Garcia, Jose M. Perez, A. Calderon
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Every storage platform intended to fit the requirements of the multimedia systems must incorporate a disk scheduling mechanism and a cache architecture that can handle their special needs. On the other hand, the general trend is to make integrated storage platforms that meet the requirements of deterministic applications, multimedia systems, and traditional best-effort applications altogether. In this paper we propose a new multimedia cache algorithm that imposes several optimizations to the state of the art. This algorithm has been designed to become part of an integrated storage system, including a proposal for an admission control algorithm that ensures the response time of the system for the accepted requests. This paper also presents an evaluation of the algorithm and compares it with other algorithms described in the bibliography.