ppxscal/embedding_network huggingface dataset:
Bounded-Diameter Minimum-Cost Graph Problems
Authors: Sanjiv Kapoor, Mohammad Sarwat
Venue: Theory of Computing Systems (2007)

We present approximation algorithms for two closely related bicriteria problems. Given a graph with two weight functions on the edges, length and cost, we consider the Bounded-Diameter Minimum-Cost Steiner Tree (BDMST) problem and the Bounded-Diameter Minimum-Cardinality Edge Addition (BDMC) problem. We present a parameterized approximation algorithm for the BDMST problem with a bicriteria approximation ratio of (O(p log s/log p),O(log s/log p)) where the first factor gives the relaxation on the diameter bound, the second factor is the cost-approximation factor, s is the number of required nodes and p, 1 &#x2264; p < s, is an input parameter. The parameter p allows a trade-off between the two approximation factors. This is the first improvement of the cost-approximation factor since the scheme proposed by Marathe et al. [9]. For example, p can be set to s&#x03b1; to obtain an (O(s&#x03b1;),O(1)) approximation for a constant &#x03b1;. The algorithm is very simple and is suitable for distributed implementations. We also present the first algorithm for Bounded-Hops Minimum-Cost Steiner Tree for complete graphs with triangle inequality. This model includes graphs defined by points in a Euclidean space of any dimension. The algorithm guarantees an approximation ratio of (O(logds),O(logds)) where d is the bound on the diameter. This is an improvement over the general-case approximation when d is comparable with s. For example, the ratio is (O(1),O(1)) for any d = s&#x03b1; where &#x03b1; is a constant between 0 and 1. For the case where the number of terminals is a constant and all edge lengths are unit, we have a polynomial-time algorithm. This can be extended to any length function providing a (1 + &#x03b5;) in the approximation with &#x03b5; showing up in the time complexity of the algorithm. For another special case, where the cost of any edge is either 1 or 0 and the length of each edge is positive, an algorithm with approximation ratio of (O(log(c log s)), O(log(c log s))) is presented, where c is the cost of the optimal solution. This approximation is a significant improvement over (O(log s),O(log s)) when the cost of the solution c is much smaller than the number of terminals s. This is useful when an existing multicast network is to be modified to accommodate new terminals with the addition of as few new edges as possible. We also propose an approximation algorithm for the Bounded-Diameter Minimum-Cardinality Edge Addition problem, which achieves an O(log n) approximation while relaxing the diameter bound by 2. While this ratio is the same as the one claimed in [3], this algorithm is simple and combinatorial rather than based on the Linear Program solution and can be readily modified for a distributed implementation.
Developing Search Strategies for Detecting Relevant Experiments for Systematic Reviews
Authors: Oscar Dieste, Anna Griman Padua
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

Information retrieval is an important problem in any evidence-based discipline. Although Evidence-based Software Engineering (EBSE) is not immune to this fact, this question has not been examined at length. The goal of this paper is to analyse the optimality of search strategies for use in systematic reviews. We tried out 29 search strategies using different terms and combinations of terms. We evaluated their sensitivity and precision with a view to finding an optimum strategy. From this study of search strategies we were able to analyse trends and weaknesses in terminology use in articles reporting experiments.
Introduction
Authors: Michael González Harbour, J. Javier Gutiérrez
Venue: ACM SIGAda Ada Letters (2007)

The chairman introduced the session pointing out its main goals, which were to: &bull; discuss different visions of architectural frameworks and coding patterns with Ada 2005 &bull; and formulate proposals and roadmaps to facilitate adoption or secondary standards. Afterwards, the three papers [1][2][3] included in this session were briefly introduced by their authors followed by the discussion on the issues proposed in them.
A Mixed-level Co-simulation Method for System-level Design Space Exploration
Authors: M. Thompson, A. D. Pimentel, S. Polstra, C. Erbas
Venue: Proceedings of the 2006 IEEE/ACM/IFIP Workshop on Embedded Systems for Real Time Multimedia (2006)

The Sesame modeling and simulation framework aims at efficient system-level design space exploration of embedded multimedia systems. A primary objective of Sesame is the exploration at multiple levels of abstraction. As such, it targets gradual refinement of its (initially abstract) architecture performance models while maintaining architecture-independent application specifications. In this paper, we present a mixed-level co-simulation method, called trace calibration, for incorporating external simulators into Sesame's abstract system-level performance models. We show that trace calibration only requires minor modification of the incorporated simulators and that performance overheads due to co-simulation are minimal. Also, we show that trace calibration transparently supports distributed co-simulation, allowing for effectively reducing the system-level simulation slowdown due to the incorporation of lower-level simulators
Computer Graphics: The Need for Graphics Design Part Two
Authors: W. Myers
Venue: Computer (1981)

The best use of color and design requires an experienced graphics designer. But even engineers and businessmen can improve the appearance of their information displays. 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
The Design of Error Checkers for Self-Checking Residue Number Arithmetic
Authors: W. K. Jenkins
Venue: IEEE Transactions on Computers (1983)

During the last few years residue number (RNS) arithmetic has gained increasing importance for providing high speed fault tolerant performance in dedicated digital signal processors. One factor that has limited the use of redundant RNS theory in practice is the hardware complexity of the error checker. This paper presents a mathematical analysis of the error correction algorithm which suggests a new design with considerably reduced hardware complexity. A hardward architecture for a high speed pipelined error checker is proposed.
A Fast Transaction-Oriented Logging Scheme for Undo Ro overy
Authors: A. Reuter
Venue: IEEE Transactions on Software Engineering (1980)

A special UNDO log algorithm combining the advantages of update in place strategies with the shadow page concept is introduced. It is to support applications demanding high rates of possibly long update transactions as well as fast UNDO recovery. By doubling the disk space for the database, UNDO loggng can be performed with a minimum of additional I/O operations. Thus, we gain a performance comparable to systems without any UNDO loggg. Since in this algorithm one logical slot consists of two physical blocks, the name TWIST (twin slot) algorithm is proposed.
Overhead Matters: A Model for Virtual Resource Management
Authors: Borja Sotomayor, Kate Keahey, Ian Foster
Venue: Proceedings of the 2nd International Workshop on Virtualization Technology in Distributed Computing (2006)

Virtual machines provide a promising vehicle for controlled sharing of physical resources, allowing us to instantiate a precisely defined virtual resource, configured with desired software configuration and hardware properties, on a set of physical resources. We describe a model of virtual machine provisioning in a Grid environment that allows us to define such virtual resources and efficiently instantiate them on a physical Grid infrastructure. We argue that to properly account for, and manage, the overhead resulting from instantiating and managing virtual resources, overhead must be scheduled at the same level as virtual resources, instead of being deducted from a user's resource allocation. We present preliminary results that demonstrate the benefits of such an approach.
The Place of Computers in Medicine
Authors: R. M. Gardner
Venue: Computer (1975)

To the computer specialist the thoughts of applying his technology to the determination and preservation of his own and society's health by computer is very attractive. To the physician the computer appears as a complex unknown. Depending on his computer-related, experience, it may be a threat or a tool.
The data-centric revolution in networking
Authors: Scott Shenker
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Historically, there has been little overlap between the database and networking research communities; they operate on very different levels and focus on very different issues. While this strict separation of concerns has lasted for many years, in this talk I will argue that the gap has recently narrowed to the point where the two fields now have much to say to each other. Networking research has traditionally focused on enabling communication between network hosts. This research program has produced a myriad of specific algorithms and protocols to solve such problems as error recovery, congestion control, routing, multicast and quality-of-service. It has also led to a set of general architectural principles, such as fate sharing and the end-to-end principle, that provide widely applicable guidelines for allocating functionality among network entities.
Computational Model for Rotation-Invariant Perception
Authors: Wenlu Yang, Liqing Zhang, Libo Ma
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Visual perception of rotation is one of important functions of processing information in the visual pathway. To simulate the mechanism, we propose a model for perception of rotation. First, we briefly introduce the rotation-invariant basis functions learned from natural scenes using Independent Component Analysis (ICA). We used these basis functions to construct the perceptual model. By using the correlation coefficients of two neural responses as the measure of rotation-invariance, our model can perform the task of perception of rotating angles. Computer simulation results show that the present model is able to perceive rotation-invariance and successfully perceive the relative angles of rotating patches.
A New Certified Email Protocol
Authors: Hao Wang, Yuyi Ou, Jie Ling, Xiang Xu, Heqing Guo
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

As a continuative effort of our WICS'05 paper, a new certified Email protocol is proposed. Email is a standard communication method nowadays but certified email is poorly developed and has very limited application. A certified email protocol assures non-repudiability which means that if the email is successfully sent, the sender cannot deny s/he has actually sent the mail and the recipient cannot deny s/he has actually received it. Our protocol uses an efficient RSA-based convertible signature with noninteractive partial signature proof method and additively split signing secret key.
Fuzzy Renewal Process with T-Independent Interarrival Times
Authors: Shuming Wang, Xiao-Dong Dai, Yan-kui Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

This paper discusses a renewal process in credibility the- ory, in which interarrival times are characterized as posi- tive T -independent fuzzy variables. A fuzzy elementary re- newal theorem shows that the expected average rate of fuzzy renewals converges to the reciprocal of the long-run ex- pected value of the average time each renewal cost. The re- sult obtained in this paper coincide with classical stochastic elementary renewal theorem.
A Hybrid Immune Genetic Algorithm Approach to Optimize the Integrated Forward/Reverse Logistics Network for 3PLs
Authors: Liu Jinlan, Jian Ni
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

In today's fiercely competing market environment, a growing number of companies have begun to realize the importance of implementing an integrated logistics management. Thus, hire party logistics service providers (3PLs) must improve their logistics networks to support such integrated supply chain management incorporating forward and reverse logistics flows. This paper presents a mixed integer nonlinear programming model to optimize the integrated logistics network for 3PLs. It is a NP hard problem. Therefore, we propose a hybrid Immune Genetic Algorithm (IGA) based heuristic containing a simplex algorithm as a sub-search process. The numerical results obtained from the proposed method are compared with the outcomes gained by a common hybrid Genetic Algorithm(GA).The result of the comparison indicates that the performance of the proposed IGA is much better than the common GA.
The N-Version Approach to Fault-Tolerant Software
Authors: A. Avizienis
Venue: IEEE Transactions on Software Engineering (1985)

Evolution of the N-version software approach to the tolerance of design faults is reviewed. Principal requirements for the implementation of N-version software are summarized and the DEDIX distributed supervisor and testbed for the execution of N-version software is described. Goals of current research are presented and some potential benefits of the N-version approach are identified.
Trends In Scandinavian CAD Development
Authors: J. Oian
Venue: IEEE Computer Graphics and Applications (1982)

Evolving from a successful ship-design system, a new project demonstrates recent developments in Scandinavian CAD software. 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
Introducing secure provenance: problems and challenges
Authors: Ragib Hasan, Radu Sion, Marianne Winslett
Venue: Proceedings of the 2007 ACM workshop on Storage security and survivability (2007)

Data provenance summarizes the history of the ownership of the item, as well as the actions performed on it. While widely used in archives, art, and archeology, provenance is also very important in forensics, scientific computing, and legal proceedings involving data. Significant research has been conducted in this area, yet the security and privacy issues of provenance have not been explored. In this position paper, we define the secure provenance problem and argue that it is of vital importance in numerous applications. We then discuss a select few of the issues related to ensuring the privacy and integrity of provenance information.
Handwriting Recognition: Tablet PC Text Input
Authors: James A. Pittman
Venue: Computer (2007)

To support a wide range of writing styles and poorly formed cursive script, the Tablet PC input panel uses a time-delay neural network working with a lexicon. High-end versions of Microsoft's Vista now include Tablet PC software, with an improved recognizer that supports both personalization and error reporting.
Enriching language learning through a multimedia corpus
Authors: Katherine Ackerley, Francesca Coccetta
Venue: ReCALL (2007)

Until recently, use has been made almost exclusively of text-based concordancers in the analysis of spoken corpora. This article discusses research being carried out on Padua University's Multimedia English Corpus (Padova MEC) using the multimodal concordancer MCA (Multimodal Corpus Authoring System, Baldry, 2005). This highly innovative concordancer enables the retrieval of parts of video and audio from a tagged corpus and access to examples of language in context, thereby providing non-verbal information about the environment, the participants and their moods, details that can be gleaned from a combination of word, sound, image and movement. This is of use to language learners of all levels because if “communication is to be successful, a relevant context has to be constructed by the discourse participants” (Braun, 2005: 52). In other words, transcripts alone are not sufficient if learners are to have anything like participant knowledge and comprehend spoken language. In the article it will be demonstrated how language functions expressed in the multimedia corpus of spoken English are retrieved using MCA. Online learning materials based on the multimodal concordances take into consideration not only language, but also the way in which it co-patterns with other semiotic resources, thereby raising the issue of the importance of learner awareness of the multimodal nature of communication.
Toe Shape Recognition Algorithm Based on Fuzzy Neural Networks
Authors: Rong Wang, Fanliang Bu, Hua Jin, Lihua Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

On the basis of the characters of footprint shape, a toe shape description method based on geometric characteristic values of toe image is proposed. Corner detection is carried out on toe region, and the characteristic points which can describe the toe shape are confirmed by the edge of toe image. Through finding characteristic points whose distances to the center are stable and which can distinguish different toe shapes and the correlation among them, the toe shape characteristic vector is built. On the basis of toe shape characteristic vector, a toe shape recognition method based on fuzzy neural networks is proposed. Firstly, according to the statistical distribution disciplinarians of different shape toe images, membership functions are constructed respectively from the angle, length and region parameters, and these values are used as single judgment factors. The comprehensive judgment vector can be obtained through the operation among these single judgment factors. At last, the distance vector between comprehensive judgment vector and four model vectors are computed to feed into neural networks in order to judge. Because the method based on fuzzy neural network can reflect subjectively and correctly the different shapes of toe image, so the total automatic recognition rate amounts to 92.80%.
Scheduling Parallel Processable Tasks for a Uniprocessor
Authors: C. V. Ramamoorthy
Venue: IEEE Transactions on Computers (1976)

Recent advances in multiprogramming have been concentrated on multiprocessor systems. But overlap in operations is also permissible in uniprocessor systems in which the processor instruction execution and input-output operations are handled by separate units. By maximizing the processor and input-output overlap, a program can be executed faster while the system utilization is highly improved.
Impulse-Based Control of Joints and Muscles
Authors: Rachel Weinstein, Eran Guendelman, Ronald Fedkiw
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

We propose a novel approach to proportional derivative (PD) control exploiting the fact that these equations can be solved analytically for a single degree of freedom. The analytic solution indicates what the PD controller would accomplish in isolation without interference from neighboring joints, gravity and external forces, outboard limbs, etc. Our approach to time integration includes an inverse dynamics formulation that automatically incorporates global feedback so that the per joint predictions are achieved. This effectively decouples stiffness from control so that we obtain the desired target regardless of the stiffness of the joint, which merely determines when we get there. We start with simple examples to illustrate our method, and then move on to more complex examples including PD control of line segment muscle actuators.
A Statistical Approach to Scheduling Software Development
Authors: W. Mayers
Venue: Computer (1978)

Given certain facts about a project that are known early, this macro-estimating technique generates an expected life-cycle curve of manpower against time. 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
On wave propagation in porous media with strain gradient effects
Authors: P. Giovine, L. Margheriti, M. P. Speciale
Venue: Computers Mathematics with Applications (2008)

A porous material with large irregular holes is here studied as a hyperelastic continuum with latent microstructure, and the mechanical balance equations are derived from the general ones for a medium with ellipsoidal microstructure. This is done by imposing the kinematical constraint of microstretch bounded to the macrodeformation: in this case, the microstructure disappears, apparently, and the response of the material involves higher gradients of the displacement without incurring known constitutive inconsistencies. An application to the propagation of asymptotic waves compatible with such a model is also considered. Physical situations corresponding to an axisymmetric motion either in spherical or cylindrical symmetry are considered, and it is shown that the time evolution of the wave amplitude factor is governed by the spherical and cylindrical Korteweg-deVries equations, respectively.
Detecting FET Stuck-Open Faults in CMOS Latches And Flip-Flops
Authors: Madhukar Reddy, Sudhakar Reddy
Venue: IEEE Design Test (1986)

The authors present evidence that conventional tests cannot detect FET stuck-open faults in several CMOS latches and flip-flops.Examples are given to show that stuck-open faults can change static latches and flip-flops into dynamic devices?a danger tocircuits whose operation requires static memory, since undetected FET stuck-open faults can cause malfunctions. Designs aregiven for several memory devices in which all single FET stuck-open faults are detectable. These memory devices include commonlatches, master-slave flip-flops, and scan-path flip-flops that can be used in applications requiring static memory elementswhose operation can be reliably ascertained through conventional fault testing methods.
Methodological Review: Towards knowledge-based gene expression data mining
Authors: Riccardo Bellazzi, Bla Zupan
Venue: Journal of Biomedical Informatics (2007)

The field of gene expression data analysis has grown in the past few years from being purely data-centric to integrative, aiming at complementing microarray analysis with data and knowledge from diverse available sources. In this review, we report on the plethora of gene expression data mining techniques and focus on their evolution toward knowledge-based data analysis approaches. In particular, we discuss recent developments in gene expression-based analysis methods used in association and classification studies, phenotyping and reverse engineering of gene networks.