ppxscal/embedding_network huggingface dataset:
Test Case Prioritization Based on Varying Testing Requirement Priorities and Test Case Costs
Authors: Xiaofang Zhang, Changhai Nie, Baowen Xu, Bo Qu
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

Test case prioritization is an effective and practical technique in regression testing. It schedules test cases in order of precedence that increases their ability to meet some performance goals, such as code coverage, rate of fault detection. In previous work, the test case prioritization techniques and metrics usually assumed that testing requirement priorities and test case costs are uniform. In this paper, basing on varying testing requirement priorities and test case costs, we present a new, general test case prioritization technique and an associated metric. The case study illustrates that the rate of "units-of-testing-requirement-priority-satisfied- per-unit-test-case-cost" can be increased, and then the testing quality and customer satisfaction can be improved. Keywords: Software Testing, Regression Testing, Test Case Prioritization, Priority, Cost
An optimal control model for a system of degenerate parabolic integro-differential equations
Authors: V. V. Akimenko, A. G. Nakonechnyi, O. Yu. Trofimchuk
Venue: Cybernetics and Systems Analysis (2007)

An initial-boundary-value problem for a system of degenerate parabolic integro-differential equations is considered. The sufficient conditions for the existence and uniqueness of its generalized solution and for the existence of at least one optimal control for a given performance functional are obtained. A stable numerical solution to the initial-boundary-value problem is derived for a locally one-dimensional case and conditions are formulated for constructing a stable numerical algorithm of the optimal control problem on a class of piecewise-smooth control functions.
Systolic Algorithms for String Manipulations
Authors: A. Apostolico
Venue: IEEE Transactions on Computers (1984)

One-and two-dimensional pattern matching oriented systolic array processors are presented that support, respectively, the detection of all repetitions in a string x and the statistics of all substrings of x with and without overlap. The time is linear in the length of x in both applications, whereas the number of processors is linear and quadratic, respectively.
Technical method of Zoetmorerope
Authors: Yasuhiro Sakamoto, Yu Sudo, Masa Inakage
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

This paper discusses the mechanism to produce an animation in Zoetmorerope that produces an animation in non-optical way. Zoetmorerope is a computer-controlled animation device, which produces the same phenomenon as a motion picture by manipulating just the angular velocity of rotary motion. What makes Zoetmorerope unique animation device comparing to other optical motion picture media is exactly this non-optical mechanism to produce an animation. Zoetrope produces an animation by manipulating just the velocity of moving objects. This makes it possible to experience a solid model animation in real world without any aid such as television screens and special glasses. The animation perceived through Zoetmorerope is quite different from existing optical motion pictures and the experience reveals new aspect of SEEING in new media.
Analysis of Proposals for the Floating-Point Standard
Authors: W. J. Cody
Venue: Computer (1981)

The committee considered three major proposals. Although the one adopted is nontraditional and seems radically different from the others, it shares many details with them.
Stochastic optimization of a biologically plausible spino-neuromuscular system model
Authors: Stanley Gotshall, Kathy Browder, Jessica Sampson, Terence Soule, Richard Wells
Venue: Genetic Programming and Evolvable Machines (2007)

Simulations and modeling techniques are becoming increasingly important in understanding the behavior of biological systems. Detailed models help researchers answer questions in diverse areas such as the behavior of bacteria and viruses and aiding in the diagnosis and treatment of injuries and diseases. However, to yield meaningful biological behavior, biological simulations often include hundreds of parameters that correspond to biological components and characteristics. This paper demonstrates the effectiveness of genetic algorithms (GA) and particle swarm optimizer (PSO) based techniques in training biologically plausible behavior in a neuromuscular simulation of a biceps/triceps pair. The results are compared to human subjects during flexion/extension movements to show that these algorithms are effective in training biologically plausible behaviors on both neural and gross anatomical levels. Specific behaviors of interest that emerge include tonic tensions in both muscles during resting periods, biceps/triceps coactivation patterns, and recruitment-like behaviors. These are all fundamental characteristics of biological motor control and emerge without direct selection for these behaviors. This is the first time that all of these characteristic behaviors emerge in a model of this detail without direct selective pressure.
Software Authorization Systems
Authors: P. A. Suhler
Venue: IEEE Software (1986)

For every piece of business software sold, at least one illegal copy exists. This article describes and classifies software-protection methods.
Security of shared data in large systems: state of the art and research directions
Authors: Arnon Rosenthal, Marianne Winslett
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

The goals of this tutorial are to enlighten the VLDB research community about the state of the art in data security, especially for enterprise or larger systems, and to engage the community's interest in improving the state of the art. The tutorial includes numerous suggested topics for research and development projects in data security.
Bubble Memories--Where Do We Stand?
Authors: J. M. Salzer
Venue: Computer (1976)

The furious pace of semiconductor memory activities in our industry leaves us little time to notice other memory techniques. Magnetic bubble domain memories are courteously mentioned in any broad survey of memories, alongside with holographic, ferroelectric, electron beam, amorphous, optical, cryogenic and what have you only to quickly return to our two favorite topics: the funeral of cores and the unstoppable march of MOS.
Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
Authors: Leocadio G. Casado, Eligius M. Hendrix, Inmaculada García
Venue: Journal of Global Optimization (2007)

The blending problem is studied as a problem of finding cheap robust feasible solutions on the unit simplex fulfilling linear and quadratic inequalities. Properties of a regular grid over the unit simplex are discussed. Several tests based on spherical regions are described and evaluated to check the feasibility of subsets and robustness of products. These tests have been implemented into a Branch-and-Bound algorithm that reduces the set of points evaluated on the regular grid. The whole is illustrated numerically.
Writer Identification in Handwritten Documents
Authors: I. Siddiqi, N. Vincent
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

This work presents an effective method for writer identification in handwritten documents. We have developed a local approach, based on the extraction of characteristics that are specific to a writer. To exploit the existence of redundant patterns within a handwriting, the writing is divided into a large number of small sub-images, and the sub-images that are morphologically similar are grouped together in the same classes. The patterns, which occur frequently for a writer are thus extracted. The author of the unknown document is then identified by a Bayesian classifier. The system trained and tested on 50 documents of the same number of authors, reported an identification rate of 94%.
Direct routing: Algorithms and complexity
Authors: Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul Spirakis
Venue: Algorithmica (2006)

Direct routing is the special case ofbufferless routing whereN packets, once injected into the network, must be delivered to their destinations without collisions. We give a general treatment of three facets of direct routing: 1. Algorithms. We present a polynomial-timegreedy direct algorithm which is worst-case optimal. We improve the bound of the greedy algorithm for special cases, by applying variants of this algorithm to commonly used network topologies. In particular, we obtainnear-optimal routing time for thetree, mesh, butterfly, andhypercube. 2. Complexity. By a reduction from Vertex Coloring, we show that optimal Direct Routing is inapproximable, unless P=NP. 3. Lower Bounds for Buffering. We show that certain direct routing problems cannot be solved efficiently; in order to solve these problems,any routing algorithm needs buffers. We give non-trivial lower bounds on such buffering requirements for general routing algorithms.
Secure Anonymous Broadcasting in Vehicular Networks
Authors: Christine Laurendeau, Michel Barbeau
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Vehicular networks face a typical quandary in their requirement for communications that are at once secure and private. While the messages broadcast between vehicles and between vehicles and the supporting infrastructure must be authentic and non repudiable, they must also ensure the vehicle driver's anonymity. The Dedicated Short Range Communications (DSRC) framework's Wireless Access in Vehicular Environments (WAVE) application development architecture mandates the use of Public Key Infrastructure (PKI) mechanisms for securing messages, consequently compromising the driver's expectation of privacy. In this paper, we propose a WAVE-based protocol for the secure and anonymous propagation of vehicle safety broadcast messages. A hybrid key infrastructure approach is put forth which combines the use of a shared network authorization key for devices that require anonymity and PKI for devices that do not.
Special Feature Microcomputer Applications in Japan
Authors: R. Mori
Venue: Computer (1979)

JEIDA, the Japan Electronic Industries Development Association, recently surveyed the state of the applications art in Japan. The most striking features of the study were its scope and the richness of the answers obtained.
Gender Recognition using Adaboosted Feature
Authors: Huchuan Lu, Hui Lin
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

In this paper, a novel approach for gender recognition combining the ellipse face images, Gabor filters, Adaboost learning and SVM classifier is proposed. Face representation based on Harr-like feature, Gabor feature or ICA is an effective method to extract facial appearance information. So we compare these three kinds of features selected by adaboost method using FERET database. In the first experiment, several different preprocessing methods (face detector, warp face images and ellipse face images) have been compared, meanwhile comparing different feature extraction methods (Gabor wavelets, Haar-like wavelets, PCA, ICA).The experimental results show that our proposed approach (combination of ellipse face images, Gabor wavelets and Ada+SVM classifier) achieves better performance. The second experiment is tested on PCA and ICA feature extraction method with different explanation. It is shown that ICA is much steadier than PCA method when the explanation changed.
Compact small signal modeling and PSO-based input matching of a packaged CMOS LNA in subthreshold region
Authors: Ashudeb Dutta, Kaushik Dasgupta, T. K. Bhattacharyya
Venue: Microelectronics Journal (2007)

The paper reports a small-signal model of a cascaded, packaged, CMOS low noise amplifier (LNA) operating in subthreshold region. The proposed compact model has been verified through CADENCE simulations in standard 0.18@mm process. This model also accounts for the dominating role of some of the device parasitic capacitances in determining the input impedance of the amplifier. The closed form expression of the input impedance obtained-from this model is then used for synthesizing the input matching network of the common-source LNA using standard Q-based technique. It has been noted that the conventional Q-based matching approach does not provide symmetric matching characteristics (S"1"1) about the center frequency (900MHz). To overcome this problem, a swarm intelligence-based evolutionary technique has been adopted for synthesis of the matching network. Symmetric nature is obtained both in terms of S"1"1 as well as the real/imaginary parts of the input impedance.
Who Needs Evidence, Anyway?
Authors: Forrest Shull
Venue: IEEE Software (2007)

Building and acquiring software requires making many decisions and choosing between numerous solutions, yet the infrastructure to help people make decisions based on good evidence isn't well developed. The software engineering community needs better communication between researchers and practitioners to help make useful bodies of evidence available that can impact practice.
Maximum overlap and minimum convex hull of two convex polyhedra under translations
Authors: Hee-Kap Ahn, Peter Brass, Chan-Su Shin
Venue: Computational Geometry: Theory and Applications (2008)

Given two convex polyhedra P and Q in three-dimensional space, we consider two related problems of shape matching: (1) finding a translation t"1@?R^3 of Q that maximizes the volume of their overlap P@?(Q+t"1), and (2) finding a translation t"2@?R^3 that minimizes the volume of the convex hull of P@?(Q+t"2). For the maximum overlap problem, we observe that the dth root of the objective function is concave and present an algorithm that computes the optimal translation in expected time O(n^3log^4n). This method generalizes to higher dimensions d>3 with expected running time O(n^d^+^1^-^3^d(logn)^d^+^1). For the minimum convex hull problem, we show that the objective function is convex. The same method used for the maximum overlap problem can be applied to this problem and the optimal translation can be computed in the same time bound.
Building Software Cost Estimation Models using Homogenous Data
Authors: Rahul Premraj, Thomas Zimmermann
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

Several studies have been conducted to determine if company-specific cost models deliver better prediction accuracy than cross-company cost models. However, mixed results have left the question still open for further investigation. We suspect this to be a consequence of heterogenous data used to build cross-company cost models. In this paper, we build cross-company cost models using homogenous data by grouping projects by their business sector. Our results suggest that it is worth to train models using only homogenous data rather than all projects available.
2D Affine-Invariant Contour Matching Using B-Spline Model
Authors: Yue Wang, Eam Khwang Teoh
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

This paper presents a new affine-invariant matching algorithm based on B-Spline modeling, which solves the problem of the non-uniqueness of B-Spline in curve matching. This method first smoothes the B-Spline curve by increasing the degree of the curve. It is followed by a reduction of the curve degree using the Least Square Error (LSE) approach to construct the Curvature Scale Space (CSS) image. CSS matching is then carried out. Our method combines the advantages of B-Spline that are continuous curve representation and the robustness of CSS matching with respect to noise and affine transformation. It avoids the need for other matching algorithms that have to use the re-sampled points on the curve. Thus, the curve matching error is reduced. The proposed algorithm has been tested by matching similar shapes from a prototype database. The experimental results showed the robustness and accuracy of the proposed method in B-Spline curve matching.
Saboteur-Based Fault Injection for Quantum Circuits Fault Tolerance Assessment
Authors: Oana Boncalo, Mihai Udrescu, Lucian Prodan, Mircea Vladupiu, Alexandru Amaricai
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

The importance of reliability and fault tolerance is paramount in quantum computation. This paper proposes a Fault Tolerance Algorithms and Methodologies (FTAM) assessment technique for quantum circuits, by adopting the saboteur-based Simulated Fault Injection methodology from classical computation. By drawing the inspiration from classical computation, the HDLs were employed for performing fault injection, due to their capacity of behavioral and structural circuit description, including hierarchical features. The cornerstone of this approach is the adaptation of the available quantum computation error models (with the quantum computing features and constraints) to the classical, HDL framework of the simulated fault injection techniques. The experimental simulated fault injection campaign results are consistent with the analytical assessments - from a qualitative point of view - but at the same time they provide a much realistic description.
Artificial Patterns
Authors: A. Klinger
Venue: IEEE Transactions on Software Engineering (1977)

This paper deals with obtaining a data base for test and evaluation of large software systems, when at most, only a few typical pattern instances are available. Data structure variation is proposed and demonstrated for some simple images. Relationships to fundamental concepts in computer science methodology are discussed.
Signed Modified Reflected Binary Code
Authors: D. P. Agrawal
Venue: IEEE Transactions on Computers (1976)

A signed modified reflected binary (SMRB) code with unique representability of both positive and negative numbers has been proposed in this correspondence. The bit pattern in this code can be defined in a systematic way leading to a simple synchronous up/down counter. Some arithmetic operations for this code have also been considered.
Robust Document Warping with Interpolated Vector Fields
Authors: D. Schneider, M. Block, R. Rojas
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

This paper describes a new versatile algorithm for cor- recting nonlinear distortions, such as curvature of book pages, in camera based document processing. We introduce the idea of using local orientation features to interpolate a vector field from which a warping mesh is derived. Ulti- mately, the image is corrected by approximating the non- linear distortion with multiple linear projections. Since the algorithm does not derive the mesh directly from text base- lines it is robust over arbitrarily complex text layouts. We describe a baseline detector for extracting the required lo- cal orientation features. We also sketch a method for cor- recting nonlinear distortions of a document's vertical axis with our algorithm.
Interview with Joseph Olin
Venue: Computers in Entertainment (CIE) (2008)

Joseph Olin is the President of the Academy of Interactive Arts and Sciences (AIAS). He oversees the annual DICE Conference and Interactive Achievement Awards. Prior to AIAS, he spearheaded the introduction of gaming's most famous heroine, Lara Croft. He also launched Mattel's Generation Girl Teen Dolls product and the first Barbie brand advertising campaign. In the video interview, you will hear his answers to the following questions: 1. How do true game enthusiasts influence causal gamers? 2. Do you see a big difference between games designed for girls versus games designed for boys? 3. What is your view on games for the whole family? 4. You are the president of the Academy of Interactive Arts and Sciences, what are some of your goals and activities?
Translation of a DDL Digital System Specification to Boolean Equations
Authors: J. R. Duley, D. L. Dietmeyer
Venue: IEEE Transactions on Computers (1969)

A digital system design language, DDL, has been described and shown to provide a concise yet precise means of specifying the organization and operation of digital systems, regardless of timing mode or hardware types, at various levels of detail [2]. This paper defines a series of tasks that transform any DDL document to Boolean and next-state equations from which a system may be implemented. Each task of the transformation produces another DDL description of a system which uses fewer features of the language.
A Novel Parallel Genetic Algorithm for the Graph Coloring Problem in VLSI Channel Routing
Authors: Jiaqi Yu, Songnian Yu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

With the increasing popularization of very large scale integrated (VLSI) chips, the improvement of their performance and the reduction of their cost have become two of the most important problems. In this paper, a novel Parallel Genetic Algorithm (PGA) is successfully applied to the graph coloring problem (GCP) in VLSI channel routing problem (CRP). Five topological structures of parallel models are discussed and compared in detail. Finally, one theorem has been proposed to evaluate the parallel performance based on a large amount of experiments. By using the theorem, we could easily modify the parameters to get the better results. The purpose of the research is to promote the performance of VLSI channel routing and the parallel computing. Also, some ideas for quantity analysis of parallel computing are put forward.
Turing's analysis of computation and artificial neural networks
Authors: Wilson R. de Oliveira, Marcílio C. P. de Souto, Teresa B. Ludermir
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2002)

A novel way to simulate Turing Machines (TMs) by Artificial Neural Networks (ANNs) is proposed. We claim that the proposed simulation is in agreement with the correct interpretation of Turing's analysis of computation; compatible with the current approaches to analyze cognition as an interactive agent-environment process; and physically realizable since it does not use connection weights with unbounded precision. A full description of an implementation of a universal TM into a recurrent sigmoid ANN focusing on the TM finite state control is given, leaving the tape, an infinite resource, as an external non-intrinsic feature. Also, motivated by the results on the limit of what can actually be computed by ANNs when noise is taken into account, we introduce the notion of Definite Turing Machine and investigate some of its properties.
Digital Image Processing: an Overview
Authors: E. C. Lyons
Venue: Computer (1977)

The evolution of digital image processing can be viewed as a microcosm of the general data processing field. Originally established as a batch-type operation with only a handful of practitioners and a few applications, it has exhibited a steadily increasing growth rate, prompted by many of the same factors which have been responsible for the vast expansion in general data processing. 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