ppxscal/embedding_network huggingface dataset:
Subspace-Based Schemes for NBI and MAI Suppression in DS-CDMA Communications
Authors: Ann-Chen Chang
Venue: Wireless Personal Communications: An International Journal (2009)

This paper deals with narrowband interference (NBI) and multiple access interference (MAI) suppression based on subspace-based approaches for direct-sequence code-division multiple-access (DS-CDMA) systems. First, the signal subspace-based and the interference subspace-based techniques are developed to estimate the noisy DS-CDMA signal and the interference signal, respectively. In conjunction with a modified multiple constrained minimum variance multiuser detector, we develop two efficient schemes to deal with the NBI and MAI that do not need any prior knowledge about the characteristics of the interference and specific training sequence. Next, an adaptive implementation based on a signal subspace tracking algorithm and a recursive least mean square algorithm is also developed. Several computer simulation examples in terms of bit error rate are provided for illustrating the effectiveness of the proposed schemes.
Traffic and Performance Engineering for Heterogeneous Networks
Authors: Demetres D. Kouvatsos
Venue:  (2009)

The diversity of methodologies and applications in the literature for the traffic engineering, performance modelling and analysis of convergent multiservice heterogeneous networks attests to the breath and richness of recent research and developments towards the design and dimensioning of the next and future generation Internets. Heterogeneous Networks: Traffic Engineering, Performance Evaluation Studies and Tools describes recent advances in networks of diverse technology reflecting the state-of-the-art technology and research achievements in traffic engineering, performance evaluation studies and tools worldwide. Technical topics presented in the book include: Traffic Modelling and Characterisation Queueing and Interconnection Networks Performance Evaluation Studies TCP Performance Analysis Congestion Control Application Layer Multicast Numerical and Software Tools; This book contains recently extended research papers, which have their roots in the series of the HET-NETs International Working Conferences focusing on the Performance Modelling and Evaluation of Heterogeneous Networks under the auspices of the EU Networks of Excellence Euro-NGI and Euro-FGI. Heterogeneous Networks: Traffic Engineering, Performance Evaluation Studies and Tools is ideal for personnel in computer/communication industries as well as academic staff and master/research students in computer science, operational research, electrical engineering and telecommunication systems and the Internet. CACHE_VSTAMP
A test generation framework for quantum cellular automata circuits
Authors: Pallav Gupta, Niraj K. Jha, Loganathan Lingappan
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

In this paper, we present a test generation framework for quantum cellular automata (QCA) circuits. QCA is a nanotechnology that has attracted recent significant attention and shows promise as a viable future technology. This work is motivated by the fact that the stuck-at fault test set of a circuit is not guaranteed to detect all defects that can occur in its QCA implementation. We show how to generate additional test vectors to supplement the stuck-at fault test set to guarantee that all simulated defects in the QCA gates get detected. Since nanotechnologies will be dominated by interconnects, we also target bridging faults on QCA interconnects. The efficacy of our framework is established through its application to QCA implementations of MCNC and ISCAS'85 benchmarks that use majority gates as primitives.
Speech Recognition Interface Using Dual Channel Post-Filter Based on Transfer Function Estimation for Noise Reduction
Authors: Heungkyu Lee, June Kim
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

This paper proposes the accurate transfer function estimation method to improve the performance of dual channel post-filter for noise reduction in speech recognition interface. In case of applying Wiener filer based post filtering, cross-power spectrum representing cross-correlation of inputted noises having higher coherence is computed in estimating transfer function. At this time, least mean square algorithm to make noise characteristics equally is applied after we assume that respective channels have different noise characteristics. This enhances the performance of noise reduction rate because this enable to satisfy the general assumption that noise characteristics of respective channels have same one. Experimental evaluation is done using real car noisy speech databases, which showed better performance than other's works.
Multi-scale Total Variation with Automated Regularization Parameter Selection for Color Image Restoration
Authors: Yiqiu Dong, Michael Hintermüller
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

In this paper, a multi-scale vectorial total variation model for color image restoration is introduced. The model utilizes a spatially dependent regularization parameter in order to preserve the details during noise removal. The automated adjustment strategy of the regularization parameter is based on local variance estimators combined with a confidence interval technique. Numerical results on images are presented to demonstrate the efficiency of the method.
Cooperative Control of Dynamical Systems: Applications to Autonomous Vehicles, 1st edition
Authors: Zhihua Qu
Venue:  (2009)

Whether providing automated passenger transport systems, exploring the hostile depths of the ocean or assisting soldiers in battle, autonomous vehicle systems are becoming an important fact of modern life. Distributed sensing and communication networks allow neighboring vehicles to share information autonomously, to interact with an operator, and to coordinate their motion to exhibit certain cooperative behaviors. The less structured the operating environment and the more changes the vehicle network experiences, the more difficult to grapple with problems of control become. Cooperative Control of Dynamical Systems begins with a concise overview of cooperative behaviors and the modeling of constrained non-linear dynamical systems like ground, aerial, and underwater vehicles. A review of useful concepts from system theory is included. New results on cooperative control of linear and non-linear systems and on control of individual non-holonomic systems are presented. Control design in autonomous-vehicle applications moves evenly from open-loop steering control and feedback stabilization of an individual vehicle to cooperative control of multiple vehicles. This progression culminates in a decentralized control hierarchy requiring only local feedback information. A number of novel methods are presented: parameterisation for collision avoidance and real-time optimisation in path planning; near optimal tracking and regulation control of non-holonomic chained systems; the matrix-theoretical approach to cooperative stability analysis of linear networked systems; the comparative argument of Lyapunov function components for analysing non-linear cooperative systems; and cooperative control designs. These methods are used to generate solutions of guaranteed performance for the fundamental problems of: optimised collision-free path planning; near-optimal stabilization of non-holonomic systems; and cooperative control of heterogenous dynamical systems, including non-holonomic systems. Examples, simulations and comparative studies bring immediacy to the fundamental issues while illustrating the theoretical foundations and the technical approaches and verifying the performance of the final control designs. Researchers studying non-linear systems, control of networked systems, or mobile robot systems will find the wealth of new methods and solutions laid out in this book to be of great interest to their work. Engineers designing and building autonomous vehicles will also benefit from these ideas, and students will find this a valuable reference.
An Efficient Solution to Systems of Multivariate Polynomial Using Expression Trees
Authors: Gershon Elber, Tom Grandine
Venue: IEEE Transactions on Visualization and Computer Graphics (2009)

In recent years, several quite successful attempts have been made to solve systems of polynomial constraints, using geometric design tools, exploiting the availability of subdivision-based solvers [7], [11], [12], [15]. This broad range of methods includes both binary domain subdivision as well as the projected polyhedron method of Sherbrooke and Patrikalakis [15]. A prime obstacle in using subdivision solvers is their scalability. When the given constraint is represented as a tensor product of all its independent variables, it grows exponentially in size as a function of the number of variables. In this work, we show that for many applications, especially geometric ones, the exponential complexity of the constraints can be reduced to a polynomial by representing the underlying structure of the problem in the form of expression trees that represent the constraints. We demonstrate the applicability and scalability of this representation and compare its performance to that of tensor product constraint representation through several examples.
3D Face Recognition Using Joint Differential Invariants
Authors: Marinella Cadoni, Manuele Bicego, Enrico Grosso
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

Stemming from a sound mathematical framework dating back to the beginning of the 20th century, this paper introduces a novel approach for 3D face recognition. The proposed technique is based on joint differential invariants, projecting a 3D shape in a 9-dimensional space where the effect of rotation and translation is removed. As a consequence, the matching between two different 3D samples can be directly performed in the invariant space. Thus the matching score can be effectively used to detect surfaces or parts of surfaces characterised by similar when not identical 3D structure. The paper details an efficient procedure for the generation of the invariant signature in the 9-dimensional space, carefully discussing a number of significant implications related to the application of the mathematical framework to the discrete, non-rigid case of interest. Experimental evaluation of the proposed approach is performed over the widely known 3D_RMA database, comparing results to the well established Iterative Closest Point (ICP)-based matching approach.
Monitoring social expectations in Second Life
Authors: Stephen Cranefield, Guannan Li
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Online virtual worlds such as Second Life provide a rich medium for unstructured human interaction in a shared simulated 3D environment. However, many human interactions take place in a structured social context where participants are subject to expectations governing their behaviour, and current virtual worlds do not provide any support for this type of interaction. There is therefore an opportunity to adapt the tools developed in the multi-agent systems community for structured social interactions between software agents (inspired by human society) and adapt these for use with the computer-mediated human communication provided by virtual worlds. This paper describes the integration of one such tool with Second Life. A model checker for monitoring social expectations defined in temporal logic has been integrated with Second Life, allowing users to be notified when their expectations of others have been fulfilled or violated.
On the difference of expected lengths of minimum spanning trees
Authors: Wenbo v. Li, Xinyi Zhang
Venue: Combinatorics, Probability and Computing (2009)

An exact formula for the expected length of the minimum spanning tree of a connected graph, with independent and identical edge distribution, is given, which generalizes Steele's formula in the uniform case. For a complete graph, the difference of expected lengths between exponential distribution, with rate one, and uniform distribution on the interval (0, 1) is shown to be positive and of rate ζ(3)/n. For wheel graphs, precise values of expected lengths are given via calculations of the associated Tutte polynomials.
Comprehend and analyze knowledge networks to improve software evolution
Authors: Christian Del Rosso
Venue: Journal of Software Maintenance and Evolution: Research and Practice (2009)

When a set of people are connected by a set of meaningful social relationships we talk of a social network. A social network represents a social structure and the underlying structural patterns can be used to analyze and comprehend how people relate to each other and their emergent behavior as a group. Developing software is fundamentally a human activity. Developers cooperate and exchange knowledge and information, creating in fact, a particular type of social network that we call knowledge network. In this paper we investigate knowledge networks in software development teams by applying social network analysis and we use the Apache web server as a case study. By analyzing the structural communication and coordination patterns in Apache we have been able to identify the Apache knowledge network, highlight potential communication bottlenecks, and find brokers and important coordination points in the software development team. Furthermore, our work enables a software architect to analyze and maintain the organization and the software architecture aligned during software evolution. An important lesson that we have is that the analysis of knowledge networks constitutes an additional tool to be added to the traditional software architecture assessment methods. Copyright &copy; 2009 John Wiley & Sons, Ltd. In this paper we investigate knowledge networks in software development teams by applying social network analysis and the Apache web server is used as case study. By analyzing the structural communication and coordination patterns in Apache we have been able to identify the Apache knowledge network, highlight potential communication bottlenecks and find brokers and important coordination points in the software development team. Furthermore, our work enables a software architect to analyze and maintain the organization and the software architecture aligned during software evolution. Copyright &copy; 2009 John Wiley & Sons, Ltd.
On various neutrosophic topologies
Authors: Francisco Gallego Lupiáñez
Venue: Proceedings of the 10th WSEAS international conference on Fuzzy systems (2009)

Recently, F. Smarandache generalized the Atanassov's intuitionistic fuzzy sets and other kinds of sets to neutrosophic sets. Also, this author defined various notions of neutrosophic topologies on the non-standard interval. One can expect some relation between the intuitionistic fuzzy topology on an IFS and neutrosophic topologies on the non-standard interval. We show in this paper that this is false.
Incrementally distributed B+ trees: approaches and challenges
Authors: Pallavi Tadepalli, H. Conrad Cunningham
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

B+ trees have proven efficient and effective in the role of indexes for data stored in databases. With the explosion in the number of datasets being stored in a distributed manner, a scalable and efficient index is needed to locate data. In this paper, the issues in designing a distributed B+ tree are examined with a specific emphasis on incrementally distributing the tree across a network.
A formal framework for engineering intelligent agents-based systems
Authors: Shahram Rahimi
Venue:  (2008)

Agent Oriented Software Engineering poses several challenges to the traditional theory and practice of software engineering with the emergence of a variety of theories and tools proposed to deal with this challenge. Agent frameworks with formal foundations have an important role to play in this scenario by allowing analysis based on a mathematical model. It is our contention that the available frameworks and languages do not fulfill all aspects of agent-based system analysis and development. We perform a survey of available formal theories and tools for multi-agent systems and derive a strong motivation for a new formal framework to support agent-oriented software engineering (AOSE). Several aspects of agent behavior in this framework have been inspired by the popular Belief-Desire-Intention model of cognitive agents. The new framework introduced concisely in the second half tackles the issues raised in the first half, including those regarding mobility, proactive behavior, organization, and inter-agent communication.
Scaling the bandwidth wall: challenges in and avenues for CMP scaling
Authors: Brian M. Rogers, Anil Krishna, Gordon B. Bell, Ken Vu, Xiaowei Jiang, Yan Solihin
Venue: Proceedings of the 36th annual international symposium on Computer architecture (2009)

As transistor density continues to grow at an exponential rate in accordance to Moore's law, the goal for many Chip Multi-Processor (CMP) systems is to scale the number of on-chip cores proportionally. Unfortunately, off-chip memory bandwidth capacity is projected to grow slowly compared to the desired growth in the number of cores. This creates a situation in which each core will have a decreasing amount of off-chip bandwidth that it can use to load its data from off-chip memory. The situation in which off-chip bandwidth is becoming a performance and throughput bottleneck is referred to as the bandwidth wall problem. In this study, we seek to answer two questions: (1) to what extent does the bandwidth wall problem restrict future multicore scaling, and (2) to what extent are various bandwidth conservation techniques able to mitigate this problem. To address them, we develop a simple but powerful analytical model to predict the number of on-chip cores that a CMP can support given a limited growth in memory traffic capacity. We find that the bandwidth wall can severely limit core scaling. When starting with a balanced 8-core CMP, in four technology generations the number of cores can only scale to 24, as opposed to 128 cores under proportional scaling, without increasing the memory traffic requirement. We find that various individual bandwidth conservation techniques we evaluate have a wide ranging impact on core scaling, and when combined together, these techniques have the potential to enable super-proportional core scaling for up to 4 technology generations.
Using error-correcting output codes with model-refinement to boost centroid text classifier
Authors: Songbo Tan
Venue: Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions (2007)

In this work, we investigate the use of error-correcting output codes (ECOC) for boosting centroid text classifier. The implementation framework is to decompose one multi-class problem into multiple binary problems and then learn the individual binary classification problems by centroid classifier. However, this kind of decomposition incurs considerable bias for centroid classifier, which results in noticeable degradation of performance for centroid classifier. In order to address this issue, we use Model-Refinement to adjust this so-called bias. The basic idea is to take advantage of misclassified examples in the training data to iteratively refine and adjust the centroids of text data. The experimental results reveal that Model-Refinement can dramatically decrease the bias introduced by ECOC, and the combined classifier is comparable to or even better than SVM classifier in performance.
Learning Process Behavior with EDY: an Experimental Analysis
Authors: Ugo Galassi
Venue: Proceeding of the 2008 conference on STAIRS 2008: Proceedings of the Fourth Starting AI Researchers' Symposium (2008)

This paper presents an extensive evaluation, on artificial datasets, of EDY, an unsupervised algorithm for automatically synthesizing a Structured Hidden Markov Model (S-HMM) from a database of sequences. The goal of EDY is capturing the stochastic process by which the observed data was generated. The SHMM is a sub-class of Hidden Markov Model that exhibits a quasi-linear computational complexity and is well suited to real-time problems of process/user profiling. The datasets used for the evaluation are available on the web http://www.edygroup.di.unipmn.it. They are a proposal benchmark for the deep-testing and comparing of tools developed for analysis of temporal (spatial) sequences in which the objective is to reconstruct the generative model from which the sequences originated.
A refinement-based compositional reasoning framework for pipelined machine verification
Authors: Panagiotis Manolios, Sudarshan K. Srinivasan
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

We present a refinement-based compositional framework for showing that pipelined machines satisfy the same safety and liveness properties as their non-pipelined specifications. Our framework consists of a set of convenient, easily applicable, and complete compositional proof rules. We show how to apply our compositional framework in the context of microprocessor verification to verify both abstract, term-level models and executable, bit-level models. Our framework enables us to verify machine models that are significantly more complex than the kinds of models that can be verified using current state-of-the-art automated decision procedures. For example, using our framework, we can verify a 32-bit, 10-stage, executable pipelined machine model. In addition, our compositional framework offers drastic improvements in the context of design debugging over monolithic approaches, in part because bugs are isolated to particular steps in the compositional proof and because the counter examples generated are much smaller.
Children's use of government information systems: design and usability
Authors: Teresa M. Harrison, James P. Zappen, David Watson
Venue: Proceedings of the 10th Annual International Conference on Digital Government Research: Social Networks: Making Connections between Citizens, Data and Government (2009)

While generally not recognized by e-government researchers, children and teens are an audience for web sites featuring information about the activities, services, or missions of numerous federal government organizations, and perhaps should be viewed as an audience for community information presented by municipal and county governments. This paper describes our efforts to design a user interface for middle-school aged users of a government-sponsored community information system. We review the literature related to children's use of the Internet and children's use of online information systems. Following a review our past design efforts, we present our most recent design followed by data from usability and satisfaction tests with young users from various grade levels. The paper ends by presenting some observations and comments that might be helpful in future work by government designers of children's web pages and information systems.