ppxscal/embedding_network huggingface dataset:
Retracted and replaced: Software component composition: a subdomain-based testing foundation
Authors: Dick Hamlet
Venue: Software Testing, Verification Reliability (2007)

The following article from Software Testing, Verification and Reliability, Software component composition: a subdomain-based testing foundation by Dick Hamlet published online on 14 June 2007 in Wiley InterScience (), has been retracted by agreement between the author, the journal Editor-in-Chief Jeff Offutt and John Wiley & Sons, Ltd. The retraction has been agreed because the article was not ready for publication and an early version without revisions was published in error. Replacement article DOI: 10.1002&#x002F;stvr.376. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Simulation of a Class of Ring-Structured Networks
Authors: H. Jafari
Venue: IEEE Transactions on Computers (1980)

This paper presents a new modular loop/ring architecture combining advantages of several earlier centralized and decentralized ring-structured loop networks while remaining simple. This is accomplished by introducing two major innovations: first, use of a separate control loop for control messages flowing between nodes and a loop controller; second, dynamically implementing partitionable segments between adjacent nodes and treating them as separate links for data transmission.
Checking extended CTL properties using guarded quotient structures
Authors: A. Prasad Sistla, Xiaodong Wang, Min Zhou
Venue: Formal Methods in System Design (2007)

We extend CTL logic to a logic called COUNT CTL (CCTL) for specifying properties of concurrent programs with large number of processes. We present a model checking algorithm for symmetric or partially symmetric systems when their correctness specification is given in CCTL. The model-checking algorithm employs Guarded Quotient Structures introduced by Sistla and Godefroid (Lecture Notes in Comput. Sci., vol. 2102, 2001). The GQS structures can be succinct representations for the reachability graphs of partially symmetric or even asymmetric systems. Our algorithm exploits state symmetries for fast evaluation. The algorithm is top down in nature, and automatically incorporates formula decomposition and sub-formula tracking.
Inter-node Communication in Peer-to-Peer Storage Clusters
Authors: Andre Brinkmann, Sascha Effert
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

Storage clusters try to transfer the idea of cluster computing into the storage domain and to scale capacity and performance by simply adding new cluster components. This paper presents analytical considerations on the scalability of storage clusters and presents a storage cluster architecture based on peer-to-peer computing that is able to scale up to hundreds of servers and clients. The resulting storage cluster environment has been successfully implemented and tested on a Linux based HPC-cluster. The measurement results presented in this paper demonstrate the feasibility and scalability of this architecture.
Tensor-product approximation to operators and functions in high dimensions
Authors: Wolfgang Hackbusch, Boris N. Khoromskij
Venue: Journal of Complexity (2007)

In recent papers tensor-product structured Nystrom and Galerkin-type approximations of certain multi-dimensional integral operators have been introduced and analysed. In the present paper, we focus on the analysis of the collocation-type schemes with respect to the tensor-product basis in a high spatial dimension d. Approximations up to an accuracy O(N^-^@a^/^d) are proven to have the storage complexity O(dN^1^/^dlog^qN) with q independent of d, where N is the discrete problem size. In particular, we apply the theory to a collocation discretisation of the Newton potential with the kernel 1|x-y|, x,y@?R^d, d>=3. Numerical illustrations are given in the case of d=3.
Eye tracking and gaze vector calculation within immersive virtual environments
Authors: Adrian Haffegee, Vassil Alexandrov, Russell Barrow
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

Human vision is arguably our most powerful sense, with our eyes constantly darting around in an almost subconscious manner to create a complete picture of the visual scene around us. These movements can unveil information about the way the brain is processing the incoming visual data into its mental image of our surroundings. In this paper we discuss a method of obtaining and preprocessing the eye movements of a user immersed within a controllable synthetic environment. We investigate how their gaze patterns can be captured and used to identify viewed virtual objects, and how this can be used as a natural method of interacting with the scene.
Fast communication: An enhanced line search scheme for complex-valued tensor decompositions. Application in DS-CDMA
Authors: Dimitri Nion, Lieven De Lathauwer
Venue: Signal Processing (2008)

In this paper, we introduce an enhanced line search algorithm to accelerate the convergence of the alternating least squares (ALS) algorithm, which is often used to decompose a tensor in a sum of contributions. This scheme can be used for the computation in the complex case of the Parallel Factor model or the more general block component model. We then illustrate the performance of the algorithm in the context of blind separation-equalization of convolutive DS-CDMA mixtures.
FPGA/DSP-based Configurable Multi-Channel Counter
Authors: D. Audino, F. Baronti, A. Lazzeri, R. Roncella, R. Saletti
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

In this paper we present a high-performance configurable multi-channel counter, suitable for many scientific applications. The counter array features 64 input channels, is able to acquire incoming events with a pulse rate up to 45 MHz, and provides an integration window (time resolution) down to 24 ìs with a 32 b counting depth. Moreover, the time resolution reaches the value of 8 ìs with a 8 b counting depth and 1 ìs if only 8 channels are used. The collected data are both real-time processed and transmitted over a high-speed IEEE 1394 serial link. The same link is used to remotely set up and control the entire acquisition process, thus giving the system a high degree of flexibility. A small-sized and low-cost implementation is obtained with a Commercial-Off-The-Shelf FPGA/DSP-based single board. A theoretical model that immediately gives the system performance is presented. Finally, we describe the system functional test, the results of which are in good accordance with those derived from the model.
A New Approach of Integrating PSO & Improved GA for Clustering with Parallel and Transitional Technique
Authors: Suresh Chandra Satapathy, Venkatesh Katari, Rohit Parimi, Satish Malireddi, V. N. K. Srujan K., B. B. Misra, Jvr Murthy
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

This paper studies the applicability of hybridization of Improved GA (IGA) and PSO techniques to data clustering problem. A new way of integrating IGA and PSO is explored in the paper. In one approach, a parallel IGA and PSO developed and in other, a transitional approach of alternate IGA and PSO technique followed. Simulations for number of data sets show that the proposed integrated approach provides better clustering performance.
Key Developments in Computer Technology: A Survey
Authors: W. Myers
Venue: Computer (1976)

Genesis of survey. During the past six months, a cross section of computer professionals, including most of the chairmen of the Computer Society's technical committees and several other society members, was interviewed with the objective of summarizing their assessment of the major developments in computer technology. (The names of those consulted are listed on p. 75.) Attention was concentrated on the principal recent developments in the computer field and on the major problems that stand in the way of future progress. 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
Document Image Segmentation Using a 2D Conditional Random Field Model
Authors: S. Nicolas, J. Dardenne, T. Paquet, L. Heutte
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

This work relates to the implementation of a 2D conditional random field model in the context of document image analysis. Our model makes it possible to take variability into account and to integrate contextual knowledge, while taking benefit from machine learning techniques. Experiments on handwritten drafts of Flaubert show that these models provide interesting solutions.
Decomposing Composition: Service-Oriented Software Engineers
Authors: M. Brian Blake
Venue: IEEE Software (2007)

When developing service-centric software systems, which combine existing services to create new cross-organizational applications, software engineers must take on a more integrative role than in traditional software development. Specialized roles in this environment might be better defined as service-oriented software engineering and service-oriented software-integration engineering. As the SCSS approaches are adopted universally, these two roles will be important in specifying SOA environments both at design time and dynamically at runtime. This article is part of a special issue on service-centric software systems.
Bayesian inference for nonlinear multivariate diffusion models observed with error
Authors: A. Golightly, D. J. Wilkinson
Venue: Computational Statistics Data Analysis (2008)

Diffusion processes governed by stochastic differential equations (SDEs) are a well-established tool for modelling continuous time data from a wide range of areas. Consequently, techniques have been developed to estimate diffusion parameters from partial and discrete observations. Likelihood-based inference can be problematic as closed form transition densities are rarely available. One widely used solution involves the introduction of latent data points between every pair of observations to allow a Euler-Maruyama approximation of the true transition densities to become accurate. In recent literature, Markov chain Monte Carlo (MCMC) methods have been used to sample the posterior distribution of latent data and model parameters; however, naive schemes suffer from a mixing problem that worsens with the degree of augmentation. A global MCMC scheme that can be applied to a large class of diffusions and whose performance is not adversely affected by the number of latent values is therefore explored. The methodology is illustrated by estimating parameters governing an auto-regulatory gene network, using partial and discrete data that are subject to measurement error.
Optimal Location and Parameter Settings of Multiple TCSCs for Increasing Power System Loadability Based on GA and PSO Techniques
Authors: G. I. Rashed, H. I. Shaheen, S. J. Cheng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Flexible Alternating Current Transmission Systems, called FACTS, got in the recent years a well-known term for higher controllability in power systems by means of power electronic devices. FACTS-devices can effectively control the load flow distribution, improve the usage of existing system installations by increasing transmission capability, compensate reactive power, improve power quality, and improve stabilities of the power network. However, the location of these devices in the system plays a significant role to achieve such benefits. This paper presents the application of Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) techniques for finding out the optimal number, the optimal locations, and the optimal parameter settings of multiple Thyristor Controlled Series Compensator (TCSC) devices to achieve a maximum system loadability in the system with minimum installation cost of these device. The thermal limits of the lines and the voltage limits for the buses are taken as constraints during the optimization. Simulations are performed on IEEE 6-bus and IEEE 14-bus power systems. The obtained results are encouraging, and show that TCSC is one of the most effective series compensation devices that can significantly increase the system loadability. Also the results indicate that both GA and PSO techniques can easily and successfully find out the optimal variables, but PSO is faster than GA from the time perspective.
An approach to Ontology Mapping based on the Lucene search engine library
Authors: Giuseppe Pirro, Domenico Talia
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Recently ontology mapping has been identified as a key issue in semantic-based technologies. A mapping algorithm aims at finding correspondences, and matching, between URIrefs (classes, relationships, instances) of a source ontology and a target ontology by combining several matching components (matchers) each of which relies on one or more ontology features (linguistic, structural, etc.). In this paper we propose an approach to ontology mapping based on the Lucene search engine library. We exploit Lucene features to build an index from a source ontology in which Lucene documents, gathering different kinds of information (name, value, comment, label, etc.) about URIrefs, are stored. Therefore mappings are derived by using values of the URIrefs of the target ontology as search arguments against the index created from the source ontology. Experimental results show the suitability of this approach in terms of Precision, Recall, F-Measure and execution time, as compared to other four approaches.
Workload charaterization and Selection in Computer Performance Measurement
Authors: D. Ferrari
Venue: Computer (1972)

The performance of computer systems cannot be seriously and meaningfully measured unless the work- load the system is dealing with during the measurement sessions is carefully selected. Even in the case the real workload is driving the system while measurements are being performed, such questions as determining the dura- tion of a session and the intervals of system activity to be monitored arise.
Automatic Trace-Based Parallelization of Java Programs
Authors: Borys J. Bradel, Tarek S. Abdelrahman
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

We propose and evaluate a novel approach for automatic parallelization. The approach uses traces as units of parallel work. We discuss the benefits and challenges of the use of traces and propose an execution model for automatic parallelization based on traces. We implement a system that demonstrates the benefits and addresses the challenges of using traces for data-parallel applications in an offline feedback directed system. Finally, we evaluate our system by using it to automatically parallelize three sequential programs that exhibit data-level parallelism from the Java Grande benchmark suite. The resulting performance compares favorably to the performance achieved by hand parallelized versions of these programs. Thus, we demonstrate the viability of trace-based parallelization.
Extending the Service Domain of Interactive Components
Authors: Walter Dosch
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

An interactive component consumes a stream of input messages and produces a stream of output messages. The input/output behaviour describes the service offered by the component without disclosing the implementation. In general, an interactive component provides the contracted service only for a subset of input histories, called its service domain. We investigate the input/output behaviour of interactive components for erroneous input streams outside the service domain. We specify a fault sensitive behaviour, a fault tolerant behaviour, a robust behaviour, and a fault correcting behaviour by enlarging the regular behaviour in a systematic way. We implement the different behaviours by state transition machines where we enlarge the regular state space by additional information. Altogether we provide schematic transformations both on the specification and on the implementation level how to extend the regular behaviour of an interactive component to input streams outside the service domain. The resulting formal method separates the aspects of service provision and error handling in an orthogonal way.
Utilizing reverse short-channel effect for optimal subthreshold circuit design
Authors: Tae-Hyoung Kim, John Keane, Hanyong Eom, Chris H. Kim
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

The impact of the reverse short-channel effect (RSCE) on device current is stronger in the subthreshold region due to reduced drain-induced barrier lowering (DIBL) and the exponential dependency of current on threshold voltage. This paper describes a device-size optimization method for subthreshold circuits utilizing RSCE to achieve high drive current, low device capacitance, less sensitivity to random dopant fluctuations, better subthreshold swing, and improved energy dissipation. Simulation results using ISCAS benchmark circuits show that the critical path delay, power consumption, and energy consumption can be improved by up to 10.4%, 34.4%, and 41.2%, respectively.
Localized feature selection for clustering
Authors: Yuanhong Li, Ming Dong, Jing Hua
Venue: Pattern Recognition Letters (2008)

In clustering, global feature selection algorithms attempt to select a common feature subset that is relevant to all clusters. Consequently, they are not able to identify individual clusters that exist in different feature subspaces. In this paper, we propose a localized feature selection algorithm for clustering. The proposed algorithm computes adjusted and normalized scatter separability for individual clusters. A sequential backward search is then applied to find the optimal (maybe local) feature subsets for each cluster. Our experimental results show the need for feature selection in clustering and the benefits of selecting features locally.
Modula-2/MUPE-2: Language and Environment Interactions
Authors: N. H. Madhavji
Venue: IEEE Software (1986)

Programming environments must be considered during language design because the interactions between the two can affect software design
Fuzzy Fixed Charge Solid Transportation Problem and Its Algorithm
Authors: Linzhong Liu, Liang Lin
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

The solid transportation problem is a generalization of the traditional transportation problem in which three kinds of constraint are taken into account instead of two. In gen- eral, the three kinds of constraint are understood as source, destination, and transport mode. The fixed charge trans- portation problem is an extension of the traditional trans- portation problem in which two kinds of costs, say direct cost and fixed charge, are taken into consideration. In this paper, the fixed charge solid transportation problem with fuzzy data is modeled as a chance-constrained program- ming by using the credibility measure. Finally, a genetic algorithm and an illustrated example is given.
Searching geographic resources through metadata-based queries for expert user communities
Authors: Luca Paolino, Monica Sebillo, Genoveffa Tortora, Giuliana Vitiello
Venue: Proceedings of the 4th ACM workshop on Geographical information retrieval (2007)

Many systems have been implemented to allow users to benefit from available data on the Internet. In this paper we present a retrieval method which takes into account specific properties of geographic data and discriminates among them on the basis of a core set of metadata elements. Along this line, four different typologies of queries have been proposed, which combine two levels of data searching with two kinds of matching. The query language and the data management are accomplished by following an XML approach based on XML.
Frame shared memory: line-rate networking on commodity hardware
Authors: John Giacomoni, John K. Bennett, Antonio Carzaniga, Douglas C. Sicker, Manish Vachharajani, Alexander L. Wolf
Venue: Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems (2007)

Network processors provide an economical programmable platform to handle the high throughput and frame rates of modern and next-generation communication systems. However, these platforms have exchanged general-purpose capabilities for performance. This paper presents an alternative; a software network processor (Soft-NP) framework using commodity general-purpose platforms capable of high-rate and throughput sequential frame processing compatible with high-level languages and general-purpose operating systems. A cache-optimized concurrent lock free queue provides the necessary low-overhead core-to-core communication for sustained sequential frame processing beyond the realized 1.41 million frames per second (Gigabit Ethernet) while permitting perframe processing time expansion with pipeline parallelism.
Octree-Related Data Structures and Algorithms
Authors: K. Yamaguchi, T. Kunii, K. Fujimura, H. Toriya
Venue: IEEE Computer Graphics and Applications (1984)

The octree is not always a desirable data structure. Here, together with their formal definitions and related algorithms, are two data structures more suitable for graphics operations.
Using Predicate/Transition-Nets to Model and Analyze Distributed Database Systems
Authors: K. Voss
Venue: IEEE Transactions on Software Engineering (1980)

In this paper, a net model for decentralized control of user accesses to a distributed database is proposed. It is developed in detail for the restricted case of updating distributed copies of a single database. Predicate/transition-nets, a first-order extension of Petri nets, are shown to provide suitable means for concise representation of complex decentralized systems and for their rigorous formal analysis. It will be demonstrated in the present paper how these net models can be constructed and interpreted in a quite natural manner and how they can be analyzed by linear algebraic methods. By this, it will be shown that the modeled distributed database system is deadlock-free and guarantees a consistent database as well as a fair and effective service to the users.
A New Technique of the Single TEOAES Mix Signal Separation Based on Independent Sub-band Functions
Authors: Xiefeng Cheng, Yan Chang, Wanlong Li, Qun Cai, Gongdong Wu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

The paper presents a new technique to eliminate the stimulus artifact when given only single mix signal by a sensor observed. One signal source can be generated by a set of weighted linear superposition of the time domain sub-band functions with independent component characteristic. By combining the independent sub-band function components into the single mixture signal, making the single mixture signal is transformed into a multi-dimensional vector from one-dimensional. Thus ICA can be applied to separate the extended single-channel mixture signal. It is researched too that principles of makeup of the independent sub-band function. The separation results of TEOAEs (Transient Evoked Otoacoustic Emissions) mix signal demonstrated the effectiveness and adaptability of the proposed method.