ppxscal/embedding_network huggingface dataset:
Concurrent Error Detection in Multiply and Divide Arrays
Authors: J. H. Patel
Venue: IEEE Transactions on Computers (1983)

A method proposed for concurrent error detection in ALU's is used in the design of multiplier and divider arrays. This method, called recomputing with shifted operands (RESO), can detect all errors caused by failures confined to a cell of the cellular array. The assumption that the failures are confined to a small area of an integrated circuit and the precise nature of the failures is not known is very applicable to VLSI circuits. RESO uses time redundancy for error detection and requires only a small increase in the hardware of a multiply and divide array.
An Efficient Detection of Conflicting Updates in Valid XML
Authors: Changwoo Byun, Ilkook Yun, Seog Park
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

As soon as many users and applications work concurrently on valid XML documents, transaction management for valid XML becomes an important issue. A fundamental problem is the detection of conflicts between operations. The detection of conflicts between operations is very interesting in query optimization for a query compiler and concurrency for a transaction manager. In this paper, we studies the problem of detecting conflicts among XML update operations in the case that input documents are typed by an XML schema (DTD or XML Schema). We formalize READ-UPDATE and UPDATE-UPDATE conflicts in valid XML documents, and propose efficient algorithms to detect such conflicts when the update operations are specified using XPath expressions.
Staking Out the Graphics Display Pipeline
Authors: Ware Myers
Venue: IEEE Computer Graphics and Applications (1984)

Pipelined architecture dramatically off-loads the host computer. Here's a quick look at how eight companies are applyingthis technology to graphics display.
Knowledge sharing in online environments: A qualitative case study
Authors: Khe Foon Hew, Noriko Hara
Venue: Journal of the American Society for Information Science and Technology (2007)

This study expands the perspective of knowledge sharing by categorizing the different types of knowledge that individuals shared with one another and examining the patterns of motivators and barriers of knowledge sharing across three online environments pertaining to the following professional practices&mdash;advanced nursing practice, Web development, and literacy education. The patterns indicate the different possible combinations of motivators or barriers that may exist in individuals. Data were gathered through online observations and semistructured interviews with 54 participants. The cross-case analysis shows that the most common type of knowledge shared across all three environments was practical knowledge. Overall, seven motivators were found. Analysis also suggests that the most common combination of motivators for knowledge sharing was collectivism and reciprocity. A total of eight barriers were identified. The most common combination of barriers varied in each online environment. Discussions as to how the types of professional practices may contribute to the different results are provided, along with implications and future possible research directions. &copy; 2007 Wiley Periodicals, Inc.
Problems and Pitfalls in a CMMI level 3 to level 4 Migration Process
Authors: Adriano Takara, Aleteia Xavier Bettin, Carlos Miguel Tobar Toledo
Venue: Proceedings of the 6th International Conference on Quality of Information and Communications Technology (2007)

CMMI is an internationally-known standard, developed by the Software Engineering Institute, whose objective is to allow the maturity-level evaluation of organizations concerned to software development. The Eldorado Research Institute adopted and follows the staged representation approach of the CMMI model that focuses the process improvement in a systemic and structured way, aiming to reach a stage that allows the generation of a framework for the next stage. Being certified to the maturity Level 3 and looking for the Level 4 certification, this paper deals with some details of indicator definition for the Eldorado Research Institute, concerning the migration to the maturity Level 4 of the CMMI model, and also deals with identified problems and pitfalls during this migration effort.
Non-interactive Designated Confirmer Signature with Specific Verifier
Authors: Yong Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

For controlling the public verifiability of ordinary digital signatures, designated confirmer signature (DCS) schemes were introduced by Chaum in 1994. In such schemes, a signature can be verified only with the help of a semi-trusted third party, called the designated confirmer. In this paper, we propose a new DCS model - designated confirmer signature with specific verifier (DCSSV), in which both the signature verifier and confirmer were appointed by signer, and instantiate it with an efficient construction. The new scheme is transformed from ID-based chameleon signature and inherits its advantages in simplicity and efficiency. The scheme's security relies on the underlying secure chameleon signature and public key encryption scheme. In addition, the case of confirmer as an adversary was also considered in our security analysis.
Load balancing distributed inverted files
Authors: Mauricio Marin, Carlos Gomez
Venue: Proceedings of the 9th annual ACM international workshop on Web information and data management (2007)

This paper present a comparison of scheduling algorithms applied to the context of load balancing the query traffic on distributed inverted files. We implemented a number of algorithms taken from the literature. We propose a novel method to formulate the cost of query processing so that these algorithms can be used to schedule queries onto processors. We avoid measuring load balance at the search engine side because this can lead to imprecise evaluation. Our method is based on the simulation of a bulk-synchronous parallel computer at the broker machine side. This simulation determines an optimal way of processing the queries and provides a stable baseline upon which both the broker and search engine can tune their operation in accordance with the observed query traffic. We conclude that the simplest load balancing heuristics are good enough to achieve efficient performance. Our method can be used in practice by broker machines to schedule queries efficiently onto the cluster processors of search engines.
Temporal Verification in Secure Group Communication System Design
Authors: B. Fontan, S. Mota, P. de Saqui-Sannes, T. Villemur
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

The paper discusses an experience in using a realtime UML/SysML profile and a formal verification toolkit to check a secure group communication system against temporal requirements. A generic framework is proposed and specialized for hierarchical groups.
A Software Birthmark Based on Dynamic Opcode n-gram
Authors: Bin Lu, Fenlin Liu, Xin Ge, Bin Liu, Xiangyang Luo
Venue: Proceedings of the International Conference on Semantic Computing (2007)

A kind of dynamic opcode n-gram software birthmark is proposed in this paper based on Myles' software birthmark (in which static opcode n-gram set is regarded as the software birthmark). The dynamic opcode n-gram set is regarded as the software birthmark which is extracted from the dynamic executable instruction sequence of the program. And the new birthmark can not only keep the advantages of feature n-gram set based on static opcode, but also possesses high robustness to code compression, encryption, packing. The algorithm which is to evaluate the similarity of the birthmarks of two programs is improved employing the theory of Probability and Statistic. As a result, the time complexity of the improved algorithm decreases to O(n) from O(n^2 ) , while the space complexity keeps unchanged. Finally, the validity of the scheme is proved by experiments.
A Novel Ant Colony Optimization Based Temperature-Aware Floorplanning Algorithm
Authors: Rong Luo, Peng Sun
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

In this paper, an ant colony optimization based temperature-aware floorplanning algorithm is proposed. The object of temperature-aware floorplanning is to de- crease the temperature gradient and the area occupancy simultaneously. First, the problem is presented based on Ant Colony Optimization (ACO). Then, with multi-objective optimization, two methods are adopted for decreasing the temperature difference and the area occupancy for the first time for MCNC benchmark Circuits. Simulation Results show that the \DeltaTmax can be at most optimized to 7.8C or 14.6C when the \DeltaTmax for initial floorplan is 27.4C, while the best area occupancy is 87.9% or 89.7%. Com- pared to Simulated Annealing (SA) algorithm, our results show great improvement in speed with little area latency.
Development and Configuration of Service-based Product Lines
Authors: Alexander Gruler, Alexander Harhurin, Judith Hartmann
Venue: Proceedings of the 11th International Software Product Line Conference (2007)

Increasing complexity due to the multitude of different functions and their interactions as well as a rising number of different product variants are just some of the challenges that must be faced during the development of multi-functional system families. Addressing this trend we present an approach combining model-based development with product line techniques aiming at a consistent description of a software product family as well as supporting the configuration of its variants. We integrate the concept of variability in our framework [7] which only supported the representation of single software systems on subsequent abstraction levels so far. For the configuration of a concrete product we extend this framework by a feature-based model which allows to configure and derive single systems from a system family model. Furthermore, we explain how the complexity due to the possibly huge amount of configuration decisions can be handled by means of a staged configuration process.
Assessing (Software) Reliability Growth Using a Random Coefficient Autoregressive Process and Its Ramifications
Authors: N. D. Singpurwalla
Venue: IEEE Transactions on Software Engineering (1985)

In this paper we motivate a random coefficient autoregressive process of order 1 for describing reliability growth or decay. We introduce several ramifications of this process, some of which reduce it to a Kalman Filter model. We illustrate the usefulness of our approach by applying these processes to some real life data on software failures. Finally, we make a pairwise comparison of the models in terms of the ratio of likelihoods of their predictive distributions, and identify the "best" model.
Middleware for Wireless Sensor Networks: A Comparative Analysis
Authors: Wassim Masri, Zoubir Mammeri
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Recent advances in wireless communications and micro-electronics have enabled the development of low cost, low-power, tiny nodes that can be deployed anywhere, establishing communications among them to monitor a battlefield or to sense intruders' motion. Those wireless sensor networks (WSN) are too complex for end users to manage, hence the need for an intermediate software system layer: middleware. Middleware have long existed before in many domains, and now they are being integrated in the WSN domain. Due to their particularities, middleware designed for WSN should obey certain design principles in order to function properly and efficiently. In this paper we present the majority of those design principles and we investigate the different approaches for middleware designed for WSN while giving our classification. Finally, a comparison of several middleware designed for WSN is drawn.
The gospel of knowledge management in and out of a professional community
Authors: Norman Makoto Su, Hiroko Wilensky, David Redmiles, Gloria Mark
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

Knowledge management (KM) remains an anomaly in most corporations today. Critics call KM a fad of the 1990s, whereas supporters claim KM is actively evolving. Our work examines the disciplinary rhetoric of KM: how is it that practitioners of KM seek to legitimize their field in the corporate world? We focus on practitioners in the aerospace industry and their forum. We argue that this forum serves as a hub for constructing KM's legitimacy. Our two year ethnography traces the rhetorical strategies utilized by informants in and out of a professional community to legitimize KM as discipline in the aerospace industry.
The AMD Opteron Northbridge Architecture
Authors: Pat Conway, Bill Hughes
Venue: IEEE Micro (2007)

To increase performance while operating within a fixed power budget, the AMD Opteron processor integrates multiple x86-64 cores with a router and memory controller. AMD's experience with building a wide variety of system topologies using Opteron's HyperTransport-based processor interface has provided useful lessons that expose the challenges to be addressed when designing future system interconnect, memory hierarchy, and I/O to scale with both the number of cores and sockets in future x86-64 CMP architectures.
FPGA Accelerating Algorithms of Active Shape Model in People Tracking Applications
Authors: Jinbo Xu, Yong Dou, Junfeng Li, Xingming Zhou, Qiang Dou
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Algorithms of Active Shape Model, as one of the most popular methods for recognizing non-rigid objects, require huge computation power for real time people tracking. After analyzing the parallel characteristics of the algorithm, we propose a deep pipelined structure for accelerating the Active ShapeModel algorithm. The computing engine is organized into a deep pipeline network composing of multiple floating-point arithmetic units, including adders, multipliers, dividers and SQRT etc. In the optimization of the memory efficiency for loading random data in large images during the step of local search, we propose an on-chip buffer scheme to eliminate random accesses to off-chip memory. Experimental results show that our FPGA implementation achieves over 15 times of speedup compared with the software implementation in Pentium 4 computer.
Emulating output queueing with parallel packet switches
Authors: Chia-Lung Liu, Chin-Chi Wu, Woei Lin
Venue: Computer Communications (2007)

This work employs an approximate Markov chain to analyze that a parallel packet switch (PPS) can emulate a first-come first-served (FCFS) output-queued (OQ) packet switch only operating slower than the external line rate. The PPS comprises multiple packet switches operating independently and in parallel. The PPS class is characterized by deployment of parallel center-stage switches with memory buffers running slower than the external line rate. Each lower speed packet switch operates at a fraction of the external line rate R. For example, each packet switch can operate at internal line rate R/K, where K is the number of center-stage switches. This work presents a proposed novel Markov chain model successfully exhibits these performance characteristics for throughput, cell delay and cell drop rate. This novel Markov chain model extends from our previous paper [Chia-Lung Liu, Woei Lin, Performance analysis of the sliding-window parallel packet switch, in: IEEE 40th International Conference on Communications 2005, ICC 2005, May 16-20, 2005; Chia-Lung Liu, Woei Lin, Evaluation and analysis of the sliding-window parallel packet switch, in: IEEE 19th International Conference on Advanced Information Networking and Applications, AINA, vol. 2, 2005, pp. 355-358]. Simulation comparison demonstrates that the chains are accurate for practical network loads. With the proposed model, major finding are that: (1) it is theoretically possible for the throughput and cell drop rates of a PPS to emulate those of a FCFS-OQ packet switch when each lower speed packet switch operates at a rate of approximately R/K; and, (2) this work also demonstrates that it is theoretically possible for the cell delay of a PPS to emulate that of FCFS-OQ packet switch when each lower speed packet switch operates at a rate of approximately (3R/cell delay of FCFS-OQ switch). Additionally, this work develops and investigates a novel PIAO PPS which distributes cells or variable-length packets to center-stage switches and uses multiplexers with push-in arbitrary-out (PIAO) queues.
On the elastic moduli of two-dimensional assemblies of disks: Relevance and modeling of fluctuations in particle displacements and rotations
Authors: I. Agnolin, N. P. Kruyt
Venue: Computers Mathematics with Applications (2008)

We determine the elastic moduli of two-dimensional assemblies of disks by computer simulations. The disks interact through elastic contact forces, which oppose the relative displacement at the contact points by means of a normal and a tangential stiffness, both taken constant. Our simulations confirm that the uniform strain assumption results in inaccurate predictions of the elastic moduli, since large fluctuations in particle displacements and rotations occur. We phrase their contribution in terms of the relative displacement they induce at the contact points. We show that the fluctuations that determine the equivalent continuum behavior depend on the average geometry of the assembly. We further separate the contributions from the center displacement and the particle rotation. The fluctuations result in a relaxation of the system, but along the tangential direction the relaxation is generally entirely due to rotations. We consider two theoretical formulations for predicting the elastic moduli that include the fluctuations, namely the ''pair-fluctuation'' and the ''particle-fluctuation'' method. They are both based on the equilibrium of a small subassembly, which is considered representative of the average structure. We investigate the corresponding predictions of the elastic moduli over a range of coordination numbers and of ratios between tangential and normal stiffness. We find a significant improvement with respect to the uniform strain theory. Furthermore, the dependence of the fluctuations on coordination number and ratio of tangential to normal stiffness is qualitatively captured.
A threshold varying bisection method for cost sensitive learning in neural networks
Authors: Parag C. Pendharkar
Venue: Expert Systems with Applications: An International Journal (2008)

We propose a bisection method for varying classification threshold value for cost sensitive neural network learning. Using simulated data and different misclassification cost asymmetries, we test the proposed threshold varying bisection method and compare it with the traditional fixed-threshold method based neural network and a probabilistic neural network. The results of our experiments illustrate that the proposed threshold varying bisection method performs better than the traditional fixed-threshold method based neural network. However, when compared to probabilistic neural network, the proposed method works well only when the misclassification cost asymmetries are low.
Introduction
Authors: Lane A. Hemaspaandra
Venue: ACM SIGACT News (2007)

Warmest thanks to Salil Vadhan for this issue's wonderful guest column on pseudorandomness. (His column begins in a few pages.) Future columns include Arnaud Durand, Clemens Lautemann, and Malika More on A Simple Proof of Polylog Counting Ability of First-Order Logic, Jonathan Buss and Tarique Islam on Complexity of Fixed-Parameter Problems, and Jin-Yi Cai on holographic algorithms.
Extraction of important interactions in medical interviewsusing nonverbal information
Authors: Yuichi Sawamoto, Yuichi Koyama, Yasushi Hirano, Shoji Kajita, Kenji Mase, Kimiko Katsuyama, Kazunobu Yamauchi
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

We propose a method of extracting important interaction patterns in medical interviews. Because the interview is a major step where doctor-patient communication takes place, improving the skill and the quality of the medical interview will lead to a better medical care. A pattern mining method for multimodal interaction logs, such as gestures and speech, is applied to medical interviews in order to extract certain doctor-patient interactions. As a result, we demonstrated that several interesting patterns are extracted and we examined their interpretations. The extracted patterns are considered to be ones that doctors should acquire in training and practice for the medical interview.
Generation of Blisses
Authors: R. F. Brender
Venue: IEEE Transactions on Software Engineering (1980)

This presentation describes the simultaneous development of Bliss compilers for three machine architectures. A highly unusual combination of characteristics makes this development of general interest to the software development community: the development involved extensive sharing of code among the several compilers; involved bootstrapping and transportable programming using a machine-oriented systems implementation language; involved prototyping and subsequent evolutionary development; and involved developing software on, as well as for, three machine architectures. The unusual problems that arose are discussed and the methodologies for dealing with them are described. This experience should be of interest to others contemplating projects with similar characteristics. It should also be relevant to research in the area of software development environments as an example of the diverse needs to be met.
GAB: Graph Augmented Bayes Classifier
Authors: Congxin Jiao, Jiangwen Sun, Chongjun Wang, Manwu Xu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

This paper proposes a new classification approach; we call the Graph Augmented Bayes classifier (GAB). We show that naive Bayes classifier is a special case of GAB under the conditional independence assumption. GAB relaxes the conditional independence assumptions and takes into account of the influences on an attribute from all other attributes, and extends naive Bayes with the capability in expressiveness of non-linearly separable concepts. We conduct experiments by using datasets from the University of California at the Irvine repository. The experimental results show that the classifier extends naive Bayes with significant improvement in accuracy.
Tom Swift and his electric bilingual grandmother
Authors: Tom Manwell, Walter Daugherity, Sam Desch, Lawrence Stolurow
Venue: ACM SIGCUE Outlook (1973)

We describe a prototype Computer Aided Instruction system for teaching Russian, which has been operational at Harvard University (Sept. 1970 to Sept. 1971), and at the State University of New York at Stony Brook (Sept. 1971 until present, depending on funds). The course allows the student to work his way through, choosing his own learning path, and the system provides "audit trails"; it gathers and analyzes data for basic study in the acquisition of a second language by individual students. Although the course stresses the Russian morphological system, the construction of the computer program is applicable to other languages and language teaching specialities.