ppxscal/embedding_network huggingface dataset:
Comparison of Information Technology Adoption Rates across Laggards, Innovators and Others
Authors: Rukmini Reddy Muduganti, Shravan Kumar Sogani, Henry Hexmoor
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

It is important to predict and analyze user acceptance of information technology in order to address success and failures of technological products. The Theory of Reasoned Action (TRA) has been used for two decades in empirical studies to predict user acceptance of information technology. Agent-based modeling (ABM) is well suited for studying user acceptance of information technology, which is an instance of contingent behavior. In this paper we extend our research on ABM of the TRA by comparing technology adoption rates across varied sections of a population. We discuss intention variations among laggards, innovators and the undecided sections of employees in an organization. Our implementation is cost effective and easy to use in contrast to the empirical method. The results we produced corroborate the results obtained from the last few decades of empirical research in this field.
A quantitative analysis of Java bytecode sequences
Authors: Ben Stephenson, Wade Holst
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

A variety of studies have been performed which analyse the bytecodes executed by a Java Virtual Machine (JVM). The simplest of these studies perform a static analysis of the bytecodes in the classes that make up the program [1]. Other studies have examined the dynamic behaviour of the program, only considering those individual bytecodes that are actually executed [2, 3]. Dynamic studies have also been extended to determine which bytecode pairs are commonly executed [4]. This work builds on these previous studies by extending the dynamic analysis from bigrams (bytecode pairs) to multicodes (variable length sequences) up to 20 bytecodes in length. The algorithms used to determine the multicodes are presented in addition to the most commonly occurring multicodes for a selection of benchmarks. Determining these multicodes is relevant to research into instruction set design. It is also directly applicable to interpreter optimization techniques such as super operators [5] and just-in-time compiler optimization techniques including bytecode idioms [6].
Ranking configuration parameters in multi-tiered e-commerce sites
Authors: Monchai Sopitkamol
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

E-commerce systems are composed of many components with several configurable parameters that, if properly configured, can optimize system performance. Before upgrading existing systems to overcome performance bottlenecks, several areas of a site's architecture and its parameters may be adjusted to improve performance. This paper provides a method to rank key configurable e-commerce system parameters that significantly impact overall system performance, and the performance of the most significant Web function types. We consider both on-line and off-line parameters at each of the e-commerce system layers: Web server, application server, and database server. In order to accomplish our task, we designed a practical, ad-hoc approach that involves conducting experiments on a testbed system setup as a small e-commerce site. The configurable parameters are ranked based on their degrees of performance improvement to the system and to the most critical Web functions. The performance metrics of interest include server's response time, system throughput, and probability of rejecting a customer's request. The experiments were conducted on an e-commerce site compliant to the TPC-W benchmark.
Book review: Semantic Foundations of Logic Volume 1: Propositional Logics by Richard L. Epstein With assistance and collaboration of Walter A. Carnielli Itala, M. L. D'Ottaviano, Stanislav Krejewski, Roger D. Maddux (Kluwer Academic Publishers, 1990)
Venue: ACM SIGART Bulletin (1991)

This is not your typical book on logic. The novel tone of this book is established by the author's desire for unity among the various logics which have been introduced to date. The basic questions addressed by this book are: "If logic is objective how come there are so many logics? Is there one right logic, or many right ones? Is there some underlying unity that connects them?" [Preface] In answering these questions it becomes apparent that a major pre-occupation of the author lies with understanding and explaining the relationship between the truths of the logics, i.e. their theorems, and everyday reality and reasoning. In a nutshell the author develops and shares with the reader a process of abstraction from the natural language of everyday reasoning to a more formalized language of logic. This abstraction process is driven by the type of reasoning to be done. This basic process is responsible for the expanding collection of logics under study today. The author invites us to join him in exploring the underlying unity he is proposing as a basis for this abstraction process.
Stack-based access control and secure information flow
Authors: Anindya Banerjee, David A. Naumann
Venue: Journal of Functional Programming (2005)

Access control mechanisms are often used with the intent of enforcing confidentiality and integrity policies, but few rigorous connections have been made between information flow and runtime access control. The Java virtual machine and the .NET runtime system provide a dynamic access control mechanism in which permissions are granted to program units and a runtime mechanism checks permissions of code in the calling chain. We investigate a design pattern by which this mechanism can be used to achieve confidentiality and integrity goals: a single interface serves callers of more than one security level and dynamic access control prevents release of high information to low callers. Programs fitting this pattern would be rejected by previous flow analyses. We give a static analysis that admits them, using permission-dependent security types. The analysis is given for a class-based object-oriented language with features including inheritance, dynamic binding, dynamically allocated mutable objects, type casts and recursive types. The analysis is shown to ensure a noninterference property formalizing confidentiality and integrity.
Image segmentation using colour
Authors: Maurice Danaher
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

This paper presents research-in-progress using colour as a means of image segmentation for use in biometric security methods on mobile devices. The limited processing capability of mobile devices has restricted the computational complexity of security algorithms that can be used. The purpose of our system is to use a colour based method to reduce the amount of information that must be processed by biometric algorithms. This is accomplished by creating a mug shot of a target individual from an image with an unknown background and unknown target/camera positions. Specific security algorithms can then be applied to the generated mug shot. An overall reduction in data processing will allow more effective biometric security measures to be implemented.
Constructivism in an introduction to programming course
Authors: Gracielo Gonzalez
Venue: Journal of Computing Sciences in Colleges (2004)

Attempting to explain reference parameters to novice programmers is a sure way to discover how challenging these and other abstract concepts are for students with little programming background and low confidence on their abilities. Participating in the classroom or approaching professors seems all but impossible when there are other students that seem to have no problems with the material. This phenomenon has been identified as a major factor contributing to the high drop-out rate in Computer Science, particularly among women and minorities [3] This paper presents results of an ongoing project that seeks to develop material that appeals to a diversity of styles of learning for introduction to programming classes. The material consists of activities based on the educational theory of constructivism[1], which, through the use of manipulatives and metaphores, encourage a more active role for students in the classroom, enabling them to construct knowledge of programming on their own terms. During such activites, the instructor actively guides and encourages discovery of concepts, interacting directly with small groups of students, widening the communication channel between the students and the instructor and allowing for immediate assesment in a non-threatening, non-competitive classroom atmosphere.
A formal approach to designing delay-insensitive circuits
Authors: Jo C. Ebergen
Venue: Distributed Computing (1991)

A method for designing delay-insensitive circuits is presented based on a simple formalism. The communication behavior of a circuit with its environment is specified by a regular expression-like program. Based on formal manipulations this program is then transformed into a delay-insensitive network of basic elements realizing the specified circuit. The notion of delay-insensitivity is concisely formalized.
Digital cultural communication: designing co-creative new media environments
Authors: Jerry Watkins, Angelina Russo
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

The design and implementation of audience-focused immersive media-rich physical environments is a familiar landscape within the commercial sphere. From theatre and theme parks to autoshows and airports, commercial interdisciplinary design and production teams have extended and solidified the new media agenda. The success of this track record is demonstrated by the increasing presence of commercial design techniques and knowledge in the creation of immersive new media within the cultural sphere, as proven by London's Natural History Museum, or the Melbourne Museum.This paper introduces the notion of digital cultural communication, a continuum through which designers can consider the place of narrative and experience and their attributes within public and commercial institutions. Digital cultural communication allows users to become co-creators of knowledge by providing tools and methods which enable the co-construction of creative artefacts. This paper uses a case study from Australia's rich cultural institution sector to illustrate the conceptual design of new media co-creative environment using an HCI-derived methodology supported by participatory action research. It is hoped that this method will demonstrate to curators of cultural experiences the cost-effective possibilities for enabling audiences to create rich narrative from user-led content.
FactBrowser demonstration
Authors: Scott Miller, Sergey Bratus, Lance Ramshaw, Ralph Weischedel, Alex Zamanian
Venue: Proceedings of the first international conference on Human language technology research (2001)

The FactBrowser demonstration illustrates automatic database update from live feeds based on information extraction from text and the ability to browse the resulting database for unexpected connections. The technology used has four interesting features:1. The demonstration employs a light architecture based on the Web; using an XML-based client-server architecture, the graphical user interface requires only Internet Explorer 5.0 or higher. No application code resides on the client.2. A permanent database grows based on cross-document entity tracking and accumulating facts.3. The database is updated daily based on automatic processing of documents distributed by the Foreign Broadcasting Information Service (FBIS). Document capture and database update are fully automatic, requiring no human intervention.4. The following key components: name finding, parsing, and pronoun resolution are all based on the trained, language-independent statistical modeling techniques.The strategic focus throughout the design of FactBrowser has been on producing high precision output so as to maintain quality in the data base.
Reducing Error Rates with Low-Cost Haptic Feedback in Virtual Reality-Based Training Applications
Authors: Li Jiang, Rohit Girotra, Mark R. Cutkosky, Chris Ullrich
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

This paper reports on the effectiveness of haptic feedback in a low-cost virtual-reality training environment for military and emergency personnel. Subjects participated in simulated exercises for clearing a damaged building, implemented using a modified commercial videogame engine and USB-compatible force and vibration feedback devices. With the addition of haptic feedback, subjects made fewer procedural errors and completed some tasks more rapidly. Initially, best results were obtained with vibration feedback. After modifications to the collision detection and display algorithm, force feedback produced equivalent results and was preferred by a majority of subjects.
An Empirical Comparison of OTIS-Mesh and OTIS-Hypercube Multicomputer Systems under Deterministic Routing
Authors: Hashem Hashemi Najaf-abadi, Hamid Sarbazi-azad
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 14 - Volume 15 (2005)

In optoelectronic OTIS architectures, electrical and optical interconnects are used for local and global communication, respectively. Interesting instances of the OTIS architecture are the OTIS-hypercube and OTIS-mesh. This paper conducts a performance evaluation and comparison of these networks under different structural conditions and traffic loads. All judgments made, are based on observations from extensive simulation results of the interconnection networks. We conclude that, when the OTIS-hypercube and equivalent 2-D OTIS-mesh are compared under the constraint of equal bisection bandwidth, the performance of the OTIS-hypercube is of superior performance. We however show that the conclusion drawn by Dally from the constraint based comparison of the hypercube and mesh networks can be extended to their OTIS counterparts when the constraint for comparison is equal intra-group bisection bandwidth.
TCP over multihop 802.11 networks: issues and performance enhancement
Authors: Kitae Nahm, Ahmed Helmy, C.-C. Jay Kuo
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

Analyzing TCP operation over 802.11 multihop ad hoc networks involves a cross-layer study. In this work, we investigate the effect of congestion and MAC contention on the interaction between TCP and on-demand ad hoc routing protocol in the 802.11 ad hoc networks. Our study reveals several problems stemming from lack of coordination and sharing in such networks. It is observed that TCP induces the over-reaction of routing protocol and hurts the quality of end-to-end connection. So, one of the critical sources of lowering TCP throughput lies in the TCP window mechanism itself. To fix this problem, we propose a fractional window increment (FeW) scheme for TCP to prevent the over-reaction of the on-demand routing protocol by limiting TCP's aggressiveness. The proposed scheme is applicable to a wide range of transport protocols using the basic TCP mechanism, and the protocol behavior is analytically tractable. Our simulation results demonstrate that the proposed scheme can dramatically improve TCP performance and network stability in a variety of 802.11 multihop networks. For example, in some chain-like topologies, the proposed scheme outperforms basic TCP by over 90%, and recent related variants of TCP (ADTCP, LRED) by over 70%.
Scaling trends in adiabatic logic
Authors: Juergen Fischer, Philip Teichmann, Doris Schmitt-Landsiedel
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

Adiabatic circuits which are able to dissipate less energy than the fundamental limit of static CMOS are promising candidates for low-power circuits in the frequency range in which signals are digitally processed. This paper shows the main sources of the energy dissipation in adiabatic circuits. It will be presented that with state-of-the-art transistors the distinction between quasi- and fully adiabatic circuits has become obsolete. With the shrinking of the transistor dimensions, new leakage mechanisms like gate leakage occur. As the adiabatic circuits work with an oscillating power supply, leakage currents flow only a part of the period. Without any further effort adiabatic circuits save about 30% of energy dissipation caused by leakage. As in static CMOS, adiabatic circuits benefit from voltage scaling. The Efficient Charge Recovery Logic scales linearly down to supply voltages near the threshold voltage. Simulations with a sinusoidal power supply showed no significant difference to a trapezoidal supply at most frequencies. For overall dissipation accounting also for generator efficiency and attenuation on the wiring, the sinusoidal supply voltage should be preferred
Taming aggressive replication in the Pangaea wide-area file system
Authors: Yasushi Saito, Christos Karamanolis, Magnus Karlsson, Mallik Mahalingam
Venue: Proceedings of the 5th symposium on Operating systems design and implementationDue to copyright restrictions we are not able to make the PDFs for this conference available for downloading (2002)

Pangaea is a wide-area file system that supports data sharing among a community of widely distributed users. It is built on a symmetrically decentralized infrastructure that consists of commodity computers provided by the end users. Computers act autonomously to serve data to their local users. When possible, they exchange data with nearby peers to improve the system's overall performance, availability, and network economy. This approach is realized by aggressively creating a replica of a file whenever and wherever it is accessed.This paper presents the design, implementation, and evaluation of the Pangaea file system. Pangaea offers efficient, randomized algorithms to manage highly dynamic and potentially large groups of file replicas. It applies optimistic consistency semantics to replica contents, but it also offers stronger guarantees when required by the users. The evaluation demonstrates that Pangaea outperforms existing distributed file systems in large heterogeneous environments, typical of the Internet and of large corporate intranets.
Minimizing Completion Time Variance with Compressible Processing Times
Authors: C. T. Ng, X. Cai, T. C. Cheng, S. S. Lam
Venue: Journal of Global Optimization (2005)

We introduce a new formulation of the standard completion time variance (CTV) problem with n jobs and one machine, in which the job sequence and the processing times of the jobs are all decision variables. The processing time of job i (i=1,¿ ,n) can be compressed by an amount within [li, ui], which however will incur a compression cost. The compression cost is a general convex non-decreasing function of the amount of the job processing time compressed. The objective is to minimize a weighted combination of the completion time variance and the total compression cost. We show that, under an agreeable condition on the bounds of the processing time compressions, a pseudo-polynomial algorithm can be derived to find an optimal solution for the problem. Based on the pseudo-polynomial time algorithm, two heuristic algorithms H1 and H2 are proposed for the general problem. The relative errors of both heuristic algorithms are guaranteed to be no more than ¿, where ¿ is a measure of deviation from the agreeable condition. While H1 can find an optimal solution for the agreeable problem, H2 is dominant for solving the general problem. We also derive a tight lower bound for the optimal solution of the general problem. The performance of H2 is evaluated by complete enumeration for small n, and by comparison with this tight lower bound for large n. Computational results (with n up to 80) are reported, which show that the heuristic algorithm H2 in general can efficiently yield near optimal solutions, when n is large.
Distributed Branch-and-Bound Scheme for Solving the Winner Determination Problem in Combinatorial Auctions
Authors: Satoshi Fujita, Shigeaki Tagashira, Chen Qiao, Masaya Mito
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

In this paper, we propose a new class of parallelbranch-and-bound (B&B) schemes. The main idea of the scheme is to focus on the functional parallelism instead of conventional data parallelism, and to support such a heterogeneous and irregular parallelism by using a collection of autonomous agents distributed over the network. After examining several design issues toward the implementation of a prototype of the distributed B&B system, we illustrate the result of our preliminary experiments conducted to estimate the performance of the proposed scheme. The result shows that it could cause a significant performance improvement if each agent autonomously changes its function type according to the change of the underlying environment.
Guest Editors' Introduction: Data Dissemination on the Web
Authors: Elisa Bertino, Krithi Ramamritham
Venue: IEEE Internet Computing (2004)

In addition to the traditional approach, in which users explicitly request information when needed, service providers have developed more proactive techniques in which information sources automatically initiate the dissemination. Such new methods ý often combining pull- and push-based dissemination with caching and proxy infrastructures ý have generated considerable research and commercial activity, but many issues remain. The articles in this issue show a small cross section of some of the more promising technological responses to a few of the remaining problems.
eMarketplaces for enterprise and cross enterprise integration
Authors: Hamada Ghenniwa, Michael N. Huhns, Weiming Shen
Venue: Data Knowledge Engineering (2005)

Businesses today must collaborate more frequently with partners to build virtual organizations and supply-chains that reduce times-to-market and costs. This paper argues that an electronic marketplace (eMarketplace) is a promising model for eBusiness applications. The architecture for this integrated environment is business-centric and knowledge-oriented. In this architecture, the eMarketplace exists as a collection of economically motivated software agents of cooperative distributed systems. It enables and supports common integration and economic services between market participants. This paper focuses on developing an agent-oriented dynamic trading mechanism (Vickrey auction) and supply-chain integration for the eMarketplace. A prototype is developed for a Vickrey eMarketplace using a coordinated, intelligent rational Agent model and a FIPA-compliant platform.
Improved multilevel routing with redundant via placement for yield and reliability
Authors: Hailong Yao, Yici Cai, Xianlong Hong, Qiang Zhou
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

This paper presents an improved multilevel Full-chip routing system which integrates global routing and detailed routing algorithms to achieve great enhancement in yield and reliability considering the redundant via placement. The system features a pre-coarsening stage which is equipped with a fast congestion-driven L-pattern global routing followed by the rvia-driven detailed routing. The L-pattern global routing benefits a lot to the reduction of vias and thus relieves the burden of redundant via addition. Then the rvia-driven maze routing algorithm considers the addition of redundant vias during routing. Finally the redundant via placement heuristic also contributes to improve the completion rate. We have tested the system on a set of commonly used benchmark circuits and compared the results with a previous multilevel routing framework. The experimental results are promising.