ppxscal/embedding_network huggingface dataset:
Empirical validation of pair programming
Authors: Corrado Aaron Visaggio
Venue: Proceedings of the 27th international conference on Software engineering (2005)

This paper discusses an empirical assessment of pair programming.
An Approach for Secure Software Installation
Venue: Proceedings of the 16th USENIX conference on System administration (2002)

We present an approach that addresses the problem of securing software configurations from the security-relevant actions of poorly built/faulty installation packages. Our approach is based on a policy-based control of the package manager's actions and is customizable for site-specific policies. We discuss an implementation of this approach in the context of the Linux operating system for the Red Hat Package manager (RPM).
Optimum wire sizing of RLC interconnect with repeaters
Authors: Magdy A. El-Moursy, Eby G. Friedman
Venue: Integration, the VLSI Journal (2004)

Repeaters are often used to drive high impedance interconnects. These lines have become highly inductive and can affect signal behavior. The line inductance should therefore be considered in determining the optimum number and size of the repeaters driving a line. The optimum repeater system uses uniform repeater insertion in order to achieve the minimum propagation delay. A tradeoff exists, however, between the transient power dissipation and the minimum propagation delay in sizing long interconnects driven by the optimum repeater system. Optimizing the line width to achieve the minimum power delay product, however, can satisfy current high speed, low-power design objectives. A reduction in power of 65% and delay of 97% is achieved for an example repeater system.The Power-Delay-Area-Product (PDAP) criterion is introduced as an efficient technique to size the interconnect within a repeater system. A reduction in buffer area of 67% and interconnect area of 46% is achieved based on the PDAP.
Design Considerations for Stand-Alone Haptic Interfaces Communicating via UDP Protocol
Authors: Ryan M. Traylor, Danny Wilhelm, Bernard D. Adelstein, Hong Z. Tan
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

This work was motivated by the need for high speed communication between a stand-alone haptic interface and a computer running haptic rendering algorithms. This paper describes our recent work on the use of User Datagram Protocol (UDP) over ethernet as a communication channel between a remote computer and a custom emmbedded controller built for a 3 DOF force-feedback haptic interface (the 3-DOF ministick). The results and observations from three experiments designed to test the use of detailed timing diagrams representing theoretical models are contrasted with experimental data in order to isolate potential problems and verify predicted models. Details of the hardware that enabled a haptic update rate of 3800 Hz are presented. Important information learned through the testing process is presented to the reader in order to help reduce development time for other systems in which Ethernet is desired as a communication channel.
Letter to the editor: a note on SOR(ω) splitting of an M-matrix
Authors: Jae Heon Yun
Venue: Journal of Computational and Applied Mathematics (2005)

Recently, Wang and Huang (J. Comput. Appl. Math. 135 (2001) 325, Corollary 4.7) assumed that SOR(ω)) splitting with ω ≥ 1 is a weak regular splitting of an M-matrix. In this note, we point out that SOR(ω) splitting with ω > 1 can never be a weak regular splitting of an M-matrix. This shows that Chang's counterexample (J. Comput. Appl. Math. 167 (2004) 251, Example 1) is not an appropriate one since the SOR(ω) splitting with ω > 1 given there is not a weak regular splitting.
Configuration Steering for a Reconfigurable Superscalar Processor
Authors: Brian F. Veale, John K. Antonio, Monte P. Tull
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

An architecture for a reconfigurable superscalar processor is described in which some of its execution units are implemented in reconfigurable hardware. The overall configuration of the processor is defined according to how its reconfigurable execution units are configured. An efficient micro-architectural solution to configuration management is presented that effectively steers the current processor configuration toward a configuration that is well matched with the execution unit requirements of instructions being scheduled for execution. The approach first selects the best matched among four steering configurations based on the number and type of execution units required by the instructions. One of the steering configurations is dynamically defined as the current configuration; the other three are statically predefined. Once a steering configuration is selected, portions of it begin loading on corresponding reconfigurable execution units that are not busy. The active configuration of the processor is generally the overlap of two or more steering configurations.
On the Generalization Ability of GRLVQ Networks
Authors: Barbara Hammer, Marc Strickert, Thomas Villmann
Venue: Neural Processing Letters (2005)

We derive a generalization bound for prototype-based classifiers with adaptive metric. The bound depends on the margin of the classifier and is independent of the dimensionality of the data. It holds for classifiers based on the Euclidean metric extended by adaptive relevance terms. In particular, the result holds for relevance learning vector quantization (RLVQ) [4] and generalized relevance learning vector quantization (GRLVQ) [19].
On Architecture for SLA-Aware Workflows in Grid Environments
Authors: Dang Minh Quan, Odej Kao
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Service Level Agreements (SLAs) are currently one of the major research topics in Grid Computing resulting in a language definition for specification of SLAs and corresponding system architectures. However, previous work solely addresses problems for monolithic Grid jobs. The description of a workflow (job flow) considers characteristics of correlated sub-jobs, thus the problem grows more complex in terms of management, SLA specification, fault reaction etc. Therefore, this paper presents a system architecture to ensure SLAs for Grid-based workflows and a corresponding language for the SLA specification.
Privacy and Ownership Preserving of Outsourced Medical Data
Authors: Elisa Bertino, Beng Chin Ooi, Yanjiang Yang, Robert H. Deng
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

The demand for the secondary use of medical data is increasing steadily to allow for the provision of better quality health care. Two important issues pertaining to this sharing of data have to be addressed: one is the privacy protection for individuals referred to in the data; the other is copyright protection over the data. In this paper, we present a unified framework that seamlessly combines techniques of binning and digital watermarking to attain the dual goals of privacy and copyright protection. Our binning method is built upon an earlier approach of generalization and suppression by allowing a broader concept of generalization. To ensure data usefulness, we propose constraining Binning by usage metrics that define maximal allowable information loss, and the metrics can be enforced off-line. Our watermarking algorithm watermarks the binned data in a hierarchical manner by leveraging on the very nature of the data. The method is resilient to the generalization attack that is specific to the binned data, as well as other attacks intended to destroy the inserted mark. We prove that watermarking could not adversely interfere with binning, and implemented the framework. Experiments were conducted, and the results show the robustness of the proposed framework.
Simulating autonomous agents in augmented reality
Authors: Erol Gelenbe, Khaled Hussain, Varol Kaptan
Venue: Journal of Systems and Software (2005)

In many critical applications such as airport operations (for capacity planning), military simulations (for tactical training and planning), and medical simulations (for the planning of medical treatment and surgical operations), it is very useful to conduct simulations within physically accurate and visually realistic settings that are represented by real video imaging sequences. Furthermore, it is important that the simulated entities conduct autonomous actions which are realistic and which follow plans of action or intelligent behavior in reaction to current situations. We describe the research we have conducted to incorporate synthetic objects in a visually realistic manner in video sequences representing a real scene. We also discuss how the synthetic objects can be designed to conduct intelligent behavior within an augmented reality setting. The paper discusses both the computer vision aspects that we have addressed and solved, and the issues related to the insertion of intelligent autonomous objects within an augmented reality simulation.
A hypothesis of consciousness or intelligent neuronet information systems
Authors: A. V. Shevchenko
Venue: Cybernetics and Systems Analysis (2005)

This paper deals with the problematics of artificial intelligence and is devoted to problems of investigation of natural systems and synthesis of artificial intelligence systems. The specificity of functioning of biological intelligence systems is illustrated by simple examples. These examples allow one to disclose a probable mechanism that provides the formation of consciousness inherent in living beings and whose explicit manifestation is thinking. The natural-science aspect of the content of fundamental concepts such as semantics and knowledge is also considered as applied to the functioning of these systems. Based on paradigms of several scientific schools and that of system approach, general concepts and approaches to the solution of the problem of artificial intelligence are presented.
Comment on "Integer Arithmetic" by Hodge
Authors: Dexter A. Schnebly
Venue: ACM SIGSMALL/PC Notes (1989)

I was very interested in H. K. Hodge's article on "INTEGER ARITHMETIC" in the last PC NOTES. It got me to thinking about the N! values, etc. As I thought about it I came up with the following. (This material is most likely in a textbook somewhere but Heaven forbid that a software type should look something up.) 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
Analysis of Player Actions in Selected Hockey Game Situations
Authors: Fahong Li, Robert J. Woodham
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

We present a proof of concept system to represent and reason about hockey play. The system takes as input player motion trajectory data tracked from game video and supported by knowledge of hockey strategy, game situation and specific player profiles. The raw motion trajectory data consists of space-time point sequences of player position registered to rink coordinates. The raw data is augmented with knowledge of forward/backward skating, possession of the puck and specific player attributes (e.g., shoots left, shoots right). We use a Finite State Machine (FSM) model to represent our total knowledge of given situations and develop evaluation functions for primitive hockey behaviours (e.g., pass, shot). Based on the augmented trajectory data, the FSMs and the evaluation functions, we describe what happened in each identified situation, assess the outcome, estimate when and where key play choices were made, and attempt to predict whether better alternatives were available to achieve understood goals. A textual natural language description and a simple 2D graphic animation of the analysis are produced as the output. The design is flexible to allow the substitution of different analysis modules and extensible to allow the inclusion of additional hockey situations.
Learning Viewpoint Invariant Perceptual Representations from Cluttered Images
Authors: Michael W. Spratling
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2005)

In order to perform object recognition, it is necessary to form perceptual representations that are sufficiently specific to distinguish between objects, but that are also sufficiently flexible to generalize across changes in location, rotation, and scale. A standard method for learning perceptual representations that are invariant to viewpoint is to form temporal associations across image sequences showing object transformations. However, this method requires that individual stimuli be presented in isolation and is therefore unlikely to succeed in real-world applications where multiple objects can co-occur in the visual input. This paper proposes a simple modification to the learning method that can overcome this limitation and results in more robust learning of invariant representations.
A new technonationalism?: China and the development of technical standards
Authors: Richard P. Suttmeier
Venue: Communications of the ACM (2005)

Chinese technology executives, government officials, and members of its research community are debating how far to push the country's strategy for promoting technology standards at home and abroad.
Processor cycle usage profiling on the sparc
Authors: Erik Goulding
Venue: Journal of Computing Sciences in Colleges (2005)

In any optimizing compiler, it is imperative to have a quantifiable way of measuring code performance. Measuring runtime or instruction counts provides only partial information, and is often inconsistent due to stochastic noise. A third way of measuring performance, which combines the previous two, is counting the number of processor cycles that a program takes to execute. Currently, this functionality is not built into VPO (<u>V</u>ery <u>P</u>ortable <u>Q</u>ptimizer, a retargetable compiler backend I have used for this research), and its addition is important to the concurrent research being done by researchers in compiler optimization. I have been working toward a means for counting both static cycle usage within basic blocks, and dynamic cycle usage across programs.
A simple design CAD (SDCAD) program
Authors: Eric B. Chapin
Venue: Journal of Computing Sciences in Colleges (2004)

SDCAD is a JAVA based, platform independent program with a user-friendly Windows interface and a simplified file format for storing drawing files. SDCAD features the ability to create and modify drawing components (lines, circles, dimensions, etc...); print, save, and load drawings; export drawings to raster file formats; import and export to and from the AutoDesk DXF drawing format. The program also includes the most commonly used advanced capabilities of typical CAD programs such as 'snap', 'trim', 'zoom' in, and 'zoom' out. 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
Complex random matrices and Rician channel capacity
Authors: T. Ratnarajah, R. Vaillancourt, M. Alvo
Venue: Problems of Information Transmission (2005)

Eigenvalue densities of complex noncentral Wishart matrices are investigated to study an open problem in information theory. Specifically, the largest, smallest, and joint eigenvalue densities of complex noncentral Wishart matrices are derived. These densities are expressed in terms of complex zonal polynomials and invariant polynomials. A connection between the complex Wishart matrix theory and information theory is given. This facilitates evaluation of the most important information-theoretic measure, the so-called ergodic channel capacity. In particular, the capacity of multiple-input multiple-output (MIMO) Rician distributed channels is investigated. We consider both spatially correlated and uncorrelated MIMO Rician channels and derive exact and easily computable tight upper bound formulas for ergodic capacities. Numerical results are also given, which show how the channel correlation degrades the capacity of the communication system.
Comparison of Local Search Implementation Schemes in Hybrid Evolutionary Multiobjective Optimization Algorithms
Authors: Hisao Ishibuchi, Kaname Narukawa
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

We compare two implementation schemes of local search in hybrid evolutionary multiobjective optimization algorithms. One is based on the weighted sum of multiple objectives, and the other is based on Pareto dominance. These two implementation schemes are compared with each other through computational experiments on a knapsack problem and a flowshop scheduling problem. We also examine a simple modification of the weighted sum-based scheme.
A cryptography course for non-mathematicians
Authors: Rich Schlesinger
Venue: Proceedings of the 1st annual conference on Information security curriculum development (2004)

Traditionally, courses in cryptography have been heavily mathematical in nature. Yet, there is a large population of Information Systems practitioners who are not mathematicians, but who need to implement cryptography as a part of an overall system that they are developing. These people need a thorough understanding of the characteristics of good cryptographic communication protocols. Without this level of understanding, numerous cryptosystems have been deployed that use proper encryption algorithms (e.g. DES, RC4), yet had significant flaws. This paper describes an attempt to structure a cryptography course for IS practitioners.
Configuring the Circuit Switched Tree for Multiple Width Communications
Authors: Krishnendu Roy, Ramachandran Vaidyanathan, Jerry L. Trahan
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09 (2005)

Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such architectures. A CST consists of processing elements (PEs) and switches. PEs communicate among themselves using the links of the tree. A key component for successful communication is scheduling individual communications and the configuration of the CST switches. This paper presents a scheduling and configuration algorithm for communications on a CST where conflicts force multiple rounds of routing to perform all communications. The paper also explains how to apply the algorithm to two important classes of communications, well-nested and monotonic, for which the algorithm is optimal and efficient. The algorithm is distributed and requires only local knowledge, yet it captures the global picture to ensure proper communication.
Adapting an example-based translation system to Chinese
Authors: Ying Zhang, Ralf D. Brown, Robert E. Frederking
Venue: Proceedings of the first international conference on Human language technology research (2001)

We describe an Example-Based Machine Translation (EBMT) system and the adaptations and enhancements made to create a Chinese-English translation system from the Hong Kong legal code and various other bilingual resources available from the Linguistic Data Consortium (LDC).
Some recent contributions to network optimization
Venue: Networks (2004)

This report highlights some recent contributions to network optimization based on papers presented at the first International Network Optimization Conference &lpar;INOC'2003&rpar; held in Evry-Paris, France. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;1&rpar;, 27&ndash;30 2004
Evaluation of website trustworthiness from customer perspective, a framework
Authors: Victor A. Tsygankov
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

The current paper was written to explain the theoretical basis of the trust evaluative framework, which would be used to review the commercial websites trustworthiness from the customer perspective. The framework contains 20 evaluation positions, scrutinizing a website for design features, corporate image integrity, business processes transparency, customer support, security features and legal support. The actual testing of proposed method is taking place at the moment. First case studies have shown that the framework is a useful tool for the development of enterprise's commercial on-line activities.
JOPI: a Java object-passing interface: Research Articles
Authors: Jameela Al-Jaroodi, Nader Mohamed, Hong Jiang, David Swanson
Venue: Concurrency and Computation: Practice Experience (2005)

Recently there has been an increasing interest in developing parallel programming capabilities in Java to harness the vast resources available in clusters, grids and heterogeneous networked systems. In this paper, we introduce a Java object-passing interface (JOPI) library. JOPI provides Java programmers with the necessary functionality to write object-passing parallel programs in distributed heterogeneous systems. JOPI provides a Message Passing Interface (MPI)-like interface that can be used to exchange objects among processes. In addition to the well-known benefits of the object-oriented development model, using objects to exchange information in JOPI is advantageous because it facilitates passing complex structures and enables the programmer to isolate the problem space from the parallelization problem. The run-time environment for JOPI is portable, efficient and provides the necessary functionality to deploy and execute parallel Java programs. Experiments were conducted on a cluster system and a collection of heterogeneous platforms to measure JOPI's performance and compare it with MPI. The results show good performance gains using JOPI. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Algorithm animation using shape analysis: visualising abstract executions
Authors: Dierk Johannes, Raimund Seidel, Reinhard Wilhelm
Venue: Proceedings of the 2005 ACM symposium on Software visualization (2005)

This paper describes progress in a non-traditional approach to algorithm animation. We visualise the abstract execution of an algorithm instead of animating the algorithm for executions on concrete input data. Algorithms under consideration are imperative pointer-based algorithms. For our purpose, we need to compute invariants which describe the state of the heap. The most powerful method to accomplish this task automatically is shape analysis. However, the output of a shape analysis can get confusingly large and complex, and it may contain redundancy as well. We need to identify those configurations which are important according to our visualisation aim, such as teaching the algorithm. We present suitable methods for structuring the shape analysis output and for finding expressive configurations. Our approach is exemplified for binary tree algorithms.