ppxscal/embedding_network huggingface dataset:
Encoding Semantic Awareness in Resource-Constrained Devices
Authors: Davy Preuveneers, Yolande Berbers
Venue: IEEE Intelligent Systems (2008)

With the Semantic Web relying on ontologies to establish online machine-interpretable information, the Internet is growing into a semantically aware computing paradigm that facilitates Web entities' discovery of the knowledge and resources they need. Ambient intelligence aims to enable smart interaction beyond the Internet by embedding intelligence into our environment to unobtrusively support users' daily activities. To accomplish these goals, ontologies and semantic awareness are crucial for better understanding a user's context. While interest in the Semantic Web has spurred the development of large-scale semantic grid architectures, expanding the Semantic Web to the other end of the computing spectrum is a complex undertaking. The techniques and tools that support the Semantic Web aren't designed to deal with the resource-constrained devices with which people frequently interact in an ambient-intelligence environment. A proposed coding scheme for ontologies embeds semantic awareness in devices with limited memory and processing capabilities, such as sensory nodes and smart phones. This scheme provides a compact representation of an ontology and is enhanced with an efficient and effective semantic-matching algorithm similar to subsumption testing in many ontology reasoners.
Enhancing beneficial jitter using phase-shifted clock distribution
Authors: Dong Jiao, Jie Gu, Pulkit Jain, Chris Kim
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

Clock jitter is generally considered undesirable but recent publications have shown that it can actually improve the timing margin. This paper investigates the "beneficial jitter" effect and presents an accurate analytical model which is verified with HSPICE. Based on our model, a phase-shifted clock distribution technique is proposed to enhance the beneficial jitter effect. By having an optimal phase shift between the supply noise and the clock period, the timing margin can be improved by 2.5X to 15% of the clock period. The benefit of the proposed technique is equivalent to that of having a 5X larger decoupling capacitor.
Practices around customization of standard systems
Authors: Yvonne Dittrich, Sebastien Vaucouleur
Venue: Proceedings of the 2008 international workshop on Cooperative and human aspects of software engineering (2008)

More and more software systems are developed by customizing a standard product that provide the major part of the functionality. The customization of Enterprise Resource Planning systems is such a product based software development practice. Little empirical research on the specificities of these software development practices is available. We present an empirical study on customization practices based on video recordings, interviews and a survey. The observed and reported practices challenge some of the principles of software engineering. Based on the analysis, we discuss the specificity of this kind of development, the role of communities of practice, and the resulting challenges for the field of software engineering.
Hardware Synthesis for Reconfigurable Heterogeneous Pipelined Accelerators
Authors: Lech Józwiak, Alexander Douglas
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper discusses a method of hardware synthesis for re-configurable heterogeneous pipelined accelerators and corresponding EDA-tool that we developed. To evaluate the method and tool, we performed experiments using several representative image and signal processing cases. The experiments showed that our tool is able to automatically construct an optimized hardware that favorably compares to the hardware constructed by skilled human designers, but the tool does it several orders of magnitude faster than a human designer.
Maximum likelihood DOA estimation of multiple wideband sources in the presence of nonuniform sensor noise
Authors: C. E. Chen, F. Lorenzelli, R. E. Hudson, K. Yao
Venue: EURASIP Journal on Advances in Signal Processing (2008)

We investigate the maximum likelihood (ML) direction-of-arrival (DOA) estimation of multiple wideband sources in the presence of unknown nonuniform sensor noise. New closed-form expression for the direction estimation Cramér-Rao-Bound (CRB) has been derived. The performance of the conventional wideband uniform ML estimator under nonuniform noise has been studied. In order to mitigate the performance degradation caused by the nonuniformity of the noise, a new deterministic wide-band nonuniform ML DOA estimator is derived and two associated processing algorithms are proposed. The first algorithm is based on an iterative procedure which stepwise concentrates the log-likelihood function with respect to the DOAs and the noise nuisance parameters, while the second is a noniterative algorithm that maximizes the derived approximately concentrated log-likelihood function. The performance of the proposed algorithms is tested through extensive computer simulations. Simulation results show the stepwise-concentrated ML algorithm (SC-ML) requires only a few iterations to converge and both the SC-ML and the approximately-concentrated ML algorithm (AC-ML) attain a solution close to the derived CRB at high signal-to-noise ratio.
A New Speech Coding for Improving the Quality of Cochlear Implant
Authors: Wei-bing Chen, Ling-hong Zhou, Zhong-ju Xiao, Guang-jie Chen, Lin-jing Wang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Cochlear implant is a sort of equipment which is used to restore normal hearing to the profoundly deaf by electrical stimulation of the auditory nerve. And it is an imitation of normal hearing function. However ,the speech signal coding methods used in the cochlear implant at present consider only about the conversion from speech signal to electrical signal, without the function of human cochlear’s temporal encoding pattern. So the effect of the cochlear implant is not very perfect. This paper combined the mechanism of hearing physiology, presented a new solution which generated stimulating pulsatile series by a “Amplitude-Time-Frequency” method. The coding method is converting the speech signal’s amplitude into stimulating pulsatile series’s amplitude time and frequency. We named it as “ATF coding method”. ATF coding method can solve the problem that stimulating pulsatile series’s dynamic configuration used in the auditory neural center. ATF can keep the temporal correlation and coherence of speech remained in stimulating pulsatile series.
A Reinforcement Learning approach to evaluating state representations in spoken dialogue systems
Authors: Joel R. Tetreault, Diane J. Litman
Venue: Speech Communication (2008)

Although dialogue systems have been an area of research for decades, finding accurate ways of evaluating different systems is still a very active subfield since many leading methods, such as task completion rate or user satisfaction, capture different aspects of the end-to-end human-computer dialogue interaction. In this work, we step back the focus from the complete evaluation of a dialogue system to presenting metrics for evaluating one internal component of a dialogue system: its dialogue manager. Specifically, we investigate how to create and evaluate the best state space representations for a Reinforcement Learning model to learn an optimal dialogue control strategy. We present three metrics for evaluating the impact of different state models and demonstrate their use on the domain of a spoken dialogue tutoring system by comparing the relative utility of adding three features to a model of user, or student, state. The motivation for this work is that if one knows which features are best to use, one can construct a better dialogue manager, and thus better performing dialogue systems.
Integrating GIS and data warehousing in a Web environment: A case study of the US 1880 Census
Authors: R. G. Healey, J. Delve
Venue: International Journal of Geographical Information Science (2007)

While the business intelligence sector, involving data warehouses and online analytical processing (OLAP) technologies, is experiencing strong growth in the IT marketplace, relatively little attention has been devoted to the problem of utilizing such tools in conjunction with GIS. This study contributes to the development of this research area by examining the issues involved in the design and implementation of an integrated data warehouse and GIS system that delivers analytical OLAP and mapping results in real-time across the Web. The case study chosen utilizes individual records from the US 1880 population census, which have recently been made available by the North Atlantic Population Project. Although historical datasets of this kind present a number of challenges for data warehousing, the results indicate that the integrated approach adopted offers a much more flexible and powerful analytical methodology for this kind of large social science dataset than has hitherto been available.
Trimming influential observations for improved single-index model estimated sufficient summary plots
Authors: Luke A. Prendergast
Venue: Computational Statistics Data Analysis (2008)

The detection and subsequent treatment of influential observations have been well covered with respect to ordinary least squares (OLS) under an assumed multiple linear regression (MLR) model using measures such as Cook's Distance. However, OLS can be shown to be a useful method under a much wider variety of models. The purpose of this paper is twofold. Firstly we introduce a new diagnostic, similar to Cook's Distance, that is useful for detecting influential observations under an assumed single-index model. Secondly we show, via simulation, how trimming observations according to such diagnostics can greatly benefit the analysis even when no gross outliers are evident.
Evolving quantum circuits at the gate level with a hybrid quantum-inspired evolutionary algorithm
Authors: Shengchao Ding, Zhi Jin, Qing Yang
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2008)

This paper proposes an approach to evolve quantum circuits at the gate level, based on a hybrid quantum-inspired evolutionary algorithm. This approach encodes quantum gates as integers and combines the cost and correctness of quantum circuits into the fitness function. A fast algorithm of matrix multiplication with Kronecker product has been proposed to speed up the calculation of matrix multiplication in individuals evaluation. This algorithm is shown to be better than the known best algorithm for matrix multiplication when a certain condition holds. The approach of evolving quantum circuits is validated by some experiments and the effects of some parameters are investigated. And finally, some features of the approach are also discussed.
Geometric Observers for Dynamically Evolving Curves
Authors: Marc Niethammer, Patricio A. Vela, Allen Tannenbaum
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

This paper proposes a deterministic observer framework for visual tracking based on non-parametric implicit (level-set) curve descriptions. The observer is continuous-discrete, with continuous-time system dynamics and discrete-time measurements. Its state-space consists of an estimated curve position augmented by additional states (e.g., velocities) associated with every point on the estimated curve. Multiple simulation models are proposed for state prediction. Measurements are performed through standard static segmentation algorithms and optical-flow computations. Special emphasis is given to the geometric formulation of the overall dynamical system. The discrete-time measurements lead to the problem of geometric curve interpolation and the discrete-time filtering of quantities propagated along with the estimated curve. Interpolation and filtering are intimately linked to the correspondence problem between curves. Correspondences are established by a Laplace-equation approach. The proposed scheme is implemented completely implicitly (by Eulerian numerical solutions of transport equations) and thus naturally allows for topological changes and subpixel accuracy on the computational grid.
A Design Model for Random Process Variability
Authors: Victoria Wang, Kanak Agarwal, Sani Nassif, Kevin Nowka, Dejan Markovic
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

A new approach to analyze process variation through measured current variation is introduced. The methodology concludes with a simple and convenient posynomial model for random process variability to bridge the gap between existingstatistical methods and circuit design. The model contains only design variables: transistor sizes W and L, and operating points Vgs and Vds. Modeling random process variability in this way allows for adaptability to optimization problems, time efficient methods for gathering statistical information in comparison to Monte Carlo, and analternative equation for hand analysis.
Decision problems for propositional linear logic
Authors: P. Lincoln, J. Michell
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

It is shown that, unlike most other propositional (quantifier-free) logics, full propositional linear logic is undecidable. Further, it is provided that without the model storage operator, which indicates unboundedness of resources, the decision problem becomes PSPACE-complete. Also established are membership in NP for the multiplicative fragment, NP-completeness for the multiplicative fragment extended with unrestricted weakening, and undecidability for certain fragments of noncommutative propositional linear logic.
Girth, minimum degree, and circumference
Authors: M. N. Ellingham, D. K. Menser
Venue: Journal of Graph Theory (2000)

We present a new lower bound on the circumference (length of a longest cycle) of a graph with given girth (length of a shortest cycle) g and minimum degree &delta;, namely $${\rm cir} (G)\ge \delta (\delta -1)^{\lfloor {g-3 \over 4} \rfloor } \left (p\;+{4\over \delta-2}\right )- g \quad-{8\over \delta-2},$$ where p &epsilon;{;1, 2, 3, 4}; and p a g +2(mod 4). This improves a previous bound of similar character given by Voss and naturally extends other bounds by Voss and Peyrat, and by Zhang. More generally, we find a lower bound on the circumference of graphs of given girth g in which every path of fixed order n has at least d neighbors. As an application, we obtain a lower bound on the circumference of (chromatic index) class 2 graphs in terms of girth g and maximum degree &rdquo;. &copy; 2000 John Wiley Sons, Inc. J Graph Theory 34: 221233, 2000
Automatic identification of erosion gullies with ASTER imagery in the Brazilian Cerrados
Authors: A. Vrieling, S. C. Rodrigues, H. Bartholomeus, G. Sterk
Venue: International Journal of Remote Sensing (2007)

Gully erosion is a serious problem at many locations worldwide, but little is known about its importance at large spatial scales. The remote sensing contribution for the spatial assessment of gullies has thus far been confined to visual image interpretation. The current study was conducted to determine whether automatic classification of optical ASTER imagery could accurately discern permanent erosion gullies in the Brazilian Cerrados. A maximum likelihood classifier (MLC) was trained with two classes, gullies and non-gullies, and applied to images of March (wet season) and August (dry season). Moreover, a bi-temporal classification was performed by labelling a pixel as gully when both for the March and August image it was classified as such. Validation was done with a gully map obtained from a panchromatic QuickBird image and field data. For mono-temporal classification, the March image performed much better than the August image, because spectral differences are more pronounced during the wet season. Based on spatial analysis of output maps, the bi-temporal classification performed best in identifying gullies, as user's accuracy was above 90%, while two of 17 actual gullies were not detected and two small locations were erroneously identified as gully. The combination of ASTER bands 1, 2, 3, and 4 gave highest accuracies. It is concluded that accurate automatic identification of permanent gullies is possible with optical satellite data. Because the Cerrados occupy a vast area, it is expected that the approach presented could be applied to larger areas with similar characteristics.
Faster approximate lossy generalized flow via interior point algorithms
Authors: Samuel I. Daitch, Daniel A. Spielman
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We present asymptotically faster approximation algorithms for the generalized flow problems in which multipliers on edges are at most 1. For this lossy version of the maximum generalized flow problem, we obtain an additive ε approximation of the maximum flow in time O{m3/2 log (U/ε)2}, where m is the number of edges in the graph, all capacities are integers in the range {1, ... , U}, and all loss multipliers are ratios of integers in this range. For minimum cost lossy generalized flow with costs in the range {1,... ,U}, we obtain a flow that has value within an additive ε of the maximum value and cost at most the optimal cost. In many parameter ranges, these algorithms improve over the previously fastest algorithms for the generalized maximum flow problem by a factor of m1/2 and for the minimum cost generalized flow problem by a factor of approximately m1/2/ ε2. The algorithms work by accelerating traditional interior point algorithms by quickly solving the system of linear equations that arises in each step. The contributions of this paper are twofold. First, we analyze the performance of interior point algorithms with approximate linear system solvers. This analysis alone provides an algorithm for the standard minimum cost flow problem that runs in time Om3/2 log U}--an improvement of roughly O{n / m1/2} over previous algorithms. Second, we examine the linear equations that arise when using an interior point algorithm to solve generalized flow problems. We observe that these belong to the family of symmetric M-matrices, and we then develop Om-time algorithms for solving linear systems in these matrices. These algorithms reduce the problem of solving a linear system in a symmetric M-matrix to that of solving O{log n} linear systems in symmetric diagonally-dominant matrices, which we can do in time Om using the algorithm of Spielman and Teng. All of our algorithms operate on numbers of bit length at most O{log n U / ε}.
Modeling Considerations in BPO Multiplexing Environment
Authors: A. Q. Ansari, Tapasya Patki
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Outsourcing, during its establishment phase, focused on the socio-economic and the managerial concerns of the companies, countries and people involved. As a step towards the next generation outsourcing, we need to ascertain a technology framework to outsource in a secure and optimized manner with reduced reliance on litigations approach. This paper discusses issues involved in simulation and modeling studies for Business Processing Outsourcing (BPO). Multiplexing of BPO infrastructure using Customer Interface Array (CIA), is a distributed environment across various service centers, to minimize delays, maximize efficiency and improve customer satisfaction. The paper discusses a Fuzzy Logic based methodology for customer load balancing across the various service centers. This algorithm is for deployment at the level of the Inter-Dialoguing Processor (IDP), which is used as a resource for facilitating communication between the CIA and the various service centers. IDP is useful to establish context-awareness in BPO environment.
A novel generalization of Bézier curve and surface
Authors: Xi-An Han, YiChen Ma, XiLi Huang
Venue: Journal of Computational and Applied Mathematics (2008)

A new formulation for the representation and designing of curves and surfaces is presented. It is a novel generalization of Bezier curves and surfaces. Firstly, a class of polynomial basis functions with n adjustable shape parameters is present. It is a natural extension to classical Bernstein basis functions. The corresponding Bezier curves and surfaces, the so-called Quasi-Bezier (i.e., Q-Bezier, for short) curves and surfaces, are also constructed and their properties studied. It has been shown that the main advantage compared to the ordinary Bezier curves and surfaces is that after inputting a set of control points and values of newly introduced n shape parameters, the desired curve or surface can be flexibly chosen from a set of curves or surfaces which differ either locally or globally by suitably modifying the values of the shape parameters, when the control polygon is maintained. The Q-Bezier curve and surface inherit the most properties of Bezier curve and surface and can be more approximated to the control polygon. It is visible that the properties of end-points on Q-Bezier curve and surface can be locally controlled by these shape parameters. Some examples are given by figures.
Algorithms for Fault-Tolerant Topology in Heterogeneous Wireless Sensor Networks
Authors: Mihaela Cardei, Shuhui Yang, Jie Wu
Venue: IEEE Transactions on Parallel and Distributed Systems (2008)

This paper addresses fault-tolerant topology control in a heterogeneous wireless sensor network consisting of several resource-rich supernodes, used for data relaying, and a large number of energy-constrained wireless sensor nodes. We introduce the k-degree Anycast Topology Control (k-ATC) problem with the objective of selecting each sensor's transmission range such that each sensor is k-vertex supernode connected and the total power consumed by sensors is minimized. Such topologies are needed for applications that support sensor data reporting even in the event of failures of up to k − 1 sensor nodes. We propose three solutions for the k-ATC problem: a k-approximation algorithm, a greedy centralized algorithm that minimizes the maximum transmission range between all sensors, and a distributed and localized algorithm that incrementally adjusts sensors' transmission range such that the k-vertex supernode connectivity requirement is met. Extended simulation results are presented to verify our approaches.
Execution Trace Visualization in a 3D Space
Authors: Philippe Dugerdil, Sazzadul Alam
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In program execution visualization, we wish to show where the action is unfolding when some high level use-case is played on the system. However, an important problem is to deal with the volume of data to display. One solution is to represent the architecture of the software in some familiar form. Then we proposed to represent it as a modern city, with buildings and districts, in a 3D space. In this paper we present the way the program execution is represented in such a space and we show how the understanding of this execution is facilitated. Since the display of the full execution trace is impossible because of its sheer size, we developed a trace segmentation technique. Then an information filter, called class omnipresence, is applied to further reduce the information to display. Finally, the resulting sequence of segments can be “played” on the screen, like in a movie.