ppxscal/embedding_network huggingface dataset:
Transmission costs, selfish nodes, and protocol design
Authors: Peter Marbach
Venue: Wireless Networks (2008)

We study the influence of transmission costs on the behavior of selfish nodes in wireless local area networks. Intuitively, it seems that transmission costs should have a stabilizing effect as (rational) nodes will defer packet transmissions when congestion develops and the cost for (successfully) transmitting a packet becomes high. In this paper we investigate whether this intuition is true. We use the slotted Aloha to model the communication channel where we capture the interaction among nodes as a non-cooperative game. For this game, we study the existence and properties of a (symmetric) Nash equilibrium. We show that the existence of a transmission cost is not always sufficient to guarantee stability. In particular, a stable equilibrium strategy will not exist if the transmission cost is too small. We then propose and analyze a price-based mechanism to guarantee stability and to optimize system performance in terms of throughput and delay.
Some new bounds for the maximum number of vertex colorings of a (v, e)-graph
Authors: Owen D. Byer
Venue: Journal of Graph Theory (1998)

Let f(v, e, &lambda;) denote the maximum number of proper vertex colorings of a graph with v vertices and e edges in &lambda; colors. In this paper we present some new upper bounds for f(v, e, &lambda;). In particular, a new notion of pseudo-proper colorings of a graph is given, which allows us to significantly improve the upper bounds for f(v, e, 3) given by Lazebnik and Liu in the case where e > v2-4. &copy; 1998 John Wiley Sons, Inc. J. Graph Theory 28: 115128, 1998
Powering down
Authors: Matthew Garrett
Venue: Communications of the ACM (2008)

Smart power management is all about doing more with the resources we have.
Numerical predictions of short-pulsed laser transport in absorbing and scattering media. II-A frequency-based approach
Authors: D. R. Rousse
Venue: International Journal of Computational Fluid Dynamics (2007)

The one-dimensional transient radiative transfer problem considered in the companion paper (Rousse 2007) is computationally solved here by the use of a finite volume method formulated in the space-frequency domain instead of the space-time domain. It has been shown in Rousse (2007) that numerical approaches based in the space-time domain induce transmitted flux emerging earlier than the minimal time required by the radiation to leave the medium. Therefore, to eliminate the time dependence, a frequency-based numerical method is formulated, implemented and validated in this paper. Results for transmittances are accurate and realistic, that is showing no physically unrealistic behaviours at early time periods. However, the frequency-dependent approach is computationally relatively expensive: it requires approximately five times more computational time than its temporal counterpart.
A recent survey on computational techniques for solving singularly perturbed boundary value problems
Authors: Manoj Kumar, Pitam Singh, Hradyesh Kumar Mishra
Venue: International Journal of Computer Mathematics (2007)

This survey paper contains a surprisingly large amount of material and indeed can serve as an introduction to some of ideas and methods of singular perturbation theory. In continuation of a survey performed earlier, this paper limits its coverage to some standard numerical methods developed by numerous researchers between 2000 and 2005. A summary of the results of some recent methods is presented and this leads to conclusions and recommendations regarding methods to use on singular perturbation problems. Because of space constraints, we considered one-dimensional singularly perturbed boundary value problems only.
Biologically Inspired Object Categorization in Cluttered Scenes
Authors: Theparit Peerasathein, Myung Woo, Roger S. Gaborski
Venue: Proceedings of the 36th Applied Imagery Pattern Recognition Workshop (2007)

Humans have the ability to recognize objects in a cluttered scene in 100s of milliseconds. Computer algorithms operate at a much lower performance level compared to humans. Furthermore, it has proven to be particularly difficult to develop algorithms to recognize all objects in a category, such as, all cat faces vs dog faces, because of the large in-class variability. The distinguishing features can vary significantly among different objects in the same class. A similar case can be made for other categories, such as, cars, human faces, etc. In this paper we approach this problem using a model of the human visual system. The human visual system can be divided into two major pathways, commonly called the ‘what’ and where’ pathways. The ‘what’ pathway recognizes an object in a scene, but not its specific location. In this paper we present a biologically inspired hierarchical ‘what’ neural network that can successfully classify objects into categories.
Integration of Broadband Wireless Technologies and PMR Systems for Professional Communications
Authors: Annalisa Durantini, Marco Petracca, Francesco Vatalaro, Alberto Civardi, Fulvio Ananasso
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

The paper contributes to the evolution of Public Safety and Disaster Relief (PSDR) communications by specifying a solution for interoperability and integration among Professional Mobile Radio systems (TETRA and Simulcast), public systems (GSM/GPRS/UMTS), and broadband wireless technologies, such as WiMAX. A policy for PSDR services scheduling and fundamental guidelines for mapping the quality of service over heterogeneous networks are presented. Hence, the paper outlines the key issues to be debated by a regulatory authority. Operation of the devised PSDR mobile integration solution is tested to ensure complete connectivity among users adopting different communication standards, as well as to enable distributed services provisioning guaranteeing always best connection to bandwidth demanding applications provided by an IP- based core network. Finally, the employment of the envisaged integration platform is detailed in Mobile Ad-Hoc and Wireless Sensor Networks.
A DEA window analysis on the product family mix selection for a semiconductor fabricator
Authors: Shu-Hsing Chung, Amy Hsin-I Lee, He-Yau Kang, Chih-Wei Lai
Venue: Expert Systems with Applications: An International Journal (2008)

In a competitive market, semiconductor fabricator must face an environment with multi-product types, multi-priority orders and demand changes in time. Since semiconductor fabrication has a very complicated production process, the above-stated characteristics make the production planning even more difficult. This paper applies data envelopment analysis (DEA) to find a set of product family mix that is efficient for the company to produce. To ensure long-term effectiveness in productivity and in profit gaining, window analysis is adopted to seek the most recommended set of product family mixes for manufacturing by measuring the performance changes over time. With this method, the performance of a mix in one period is compared not only with the performance of other mixes but also with its own performance in other periods. The proposed mechanism can provide guidance to the fabricator regarding strategies for aggregate planning so as to improve manufacturing efficiency.
Speed-Up of Encoder Optimization Step in Multiple Description Scalar Quantizer Design
Authors: Sorina Dumitrescu
Venue: Proceedings of the Data Compression Conference (2008)

The design of optimal multiple description scalar quantizers was pioneered by Vaishampayan with a generalization of Lloyd's algorithm, which alternatively optimizes the decoder, respectively the encoder, while the other component is fixed. We propose an algorithm which speeds up the encoder optimization step from O(N^2) to O(N\log N) time complexity, where N is the number of cells in the central partition.
The Average-Case Analysis of Some On-Line Algorithms for Bin Packing
Authors: P. W. Shor
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

In this paper we give tighter bounds than were previously known for the performance of the bin packing algorithms Bets Fit and First Fit when the inputs are uniformly distributed on [0,1]. We also give a general lower bound for the performance of any on-line bin packing algorithm. These results are proven by analyzing problems concerning matching random points in a unit square. We give a new lower bound for upward right matching and grid matching.
A federation of web services for Danish health care
Authors: Esben Dalsgaard, Kåre Kjelstrøm, Jan Riis
Venue: Proceedings of the 7th symposium on Identity and trust on the Internet (2008)

Having relevant, up-to-date information about a patient's health care history is often crucial for providing the appropriate treatment. In Denmark, IT systems have been built to support different work flows in the health sector, but the systems are rarely connected and have become islands of data. To remedy this situation, a service-oriented architecture based on web services for online exchange of health care data between the vast array of heterogeneous IT systems in the sector is being built. The architecture forms a federation of web services and enables secure and reliable authentication of end-users and systems in the Danish health sector. The architecture is based on national and international standards and specifications. Yet it defines its own profile for secure interchange of data due to a lack of available international profiles that could handle the special needs of the health sector at the time of project inception. The architecture has evolved through a pilot project from mid 2005 to the end of 2007, and is being tested in a small scale 1st quarter 2008. This paper aims to convey experiences from the project, so rich in benefits that the architecture has been accepted and standardized as the foundation for the future of system integration in the health sector in Denmark.
Texture Analysis of Ultrasonic Liver Image Based on Wavelet Transform and Probabilistic Neural Network
Authors: Yali Huang, Lanxun Wang, Caixia Li
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In this paper, a new liver texture classification method based on discrete wavelet transform (DWT) is proposed to differenciate ultrasonic normal liver image from fatty liver. The low frequency coefficients of transformed image denote the approximation of the image, and the high frequency coefficients denote the details of the image. So the character deduced from DWT coefficients can embody texture feature of images. The mean and standard deviation of transformed sub-image are extracted.Neural networks are employed to classify pattern based on learning from examples. The Probabilistic Neural Network (PNN) develops from radial-basis-function neural network (RBFNN) and approaches the Bayes theorem maximum posterior probability, thus it is employed as a classifier in our method. Then the above statistical features are applied for texture classification by PNN. Experimental results show that statistical features extracted from DWT coefficients achieve good effects.
Ring-based optimal-level distributed wavelet transform with arbitrary filter length for wireless sensor networks
Authors: Siwang Zhou, Yaping Lin, Yonghe Liu
Venue: EURASIP Journal on Advances in Signal Processing (2008)

We propose an optimal-level distributed transform for wavelet-based spatiotemporal data compression in wireless sensor networks. Although distributed wavelet processing can efficiently decrease the amount of sensory data, it introduces additional communication overhead as the sensory data needs to be exchanged in order to calculate the wavelet coefficients. This tradeoff is explored in this paper with the optimal transforming level of wavelet transform. By employing a ring topology, our scheme is capable of supporting a broad scope of wavelets rather than specific ones, and the "border effect" generally encountered by wavelet-based schemes is also eliminated naturally. Furthermore, the scheme can simultaneously explore the spatial and temporal correlations among the sensory data. For data compression in wireless sensor networks, in addition to minimizing energy and consumption, it is also important to consider the delay and the quality of reconstructed sensory data, which is measured by the ratio of signal to noise (PSNR). We capture this with energy × delay/PSN R metric and using it to evaluate the performance of the proposed scheme. Theoretically and experimentally, we conclude that the proposed algorithm can effectively explore the spatial and temporal correlation in the sensory data and provide significant reduction in energy and delay cost while still preserving high PSNR compared to other schemes.
Testing permutation polynomials
Authors: J. von zur Gathen
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

The simple test for determining whether an arbitrary polynomial is a permutation polynomial, by producing its list of values, is considered, and it is found that off-the-shelf techniques from computer algebra improve the running time slightly, without requiring any new insights into the problem. A probabilistic variant of the Hermite test that reduces its running time is given. A criterion for permutation polynomials is then examined, and a probabilistic test whose number of operations is essentially linear in the input size is then given. Exceptional polynomials, which are closely related to permutation polynomials, are also considered, and a random polynomial-time test for these is described.
Early formal verification of conditional coverage points to identify intrinsically hard-to-verify logic
Authors: C. Richard Ho, Michael Theobald, Martin M. Deneroff, Ron O. Dror, Joseph Gagliardo, David E. Shaw
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Design verification of complex digital circuits typically starts only after the register-transfer level (RTL) description is complete. This frequently makes verification more difficult than necessary because logic that is intrinsically hard to verify, such as memories, counters and deep first-in, first-out (FIFO) structures, becomes immutable in the design. This paper proposes a new approach that exploits formal verification of conditional coverage points with the goal of early identification of hard-to-verify logic. We use the difficulty of formal verification problems as an early estimator of the verification complexity of a design. While traditional verification methods consider conditional coverage only in the design verification phase, we describe an approach that uses conditional coverage at a much earlier stage---the design phase, during which changes to the RTL code are still possible. The method is illustrated using real examples from the verification of an ASIC designed for a specialized supercomputer.
Compression of Hyperspectral Images with LVQ-SPECK
Authors: Alessandro J. S. Dutra, William A. Pearlman, Eduardo A. B. da Silva
Venue: Proceedings of the Data Compression Conference (2008)

We discuss the use of lattice vector quantizers in conjunction with a quadtree-based sorting algorithm for the compression of multidimensional data sets, as encountered,for example, when dealing with hyperspectral imagery. An extension of the SPECK algorithm is presented that deals with vector samples and is used to encode a group of successive spectral bands extracted from the hyperspectral image original block. We evaluate the importance of codebook choice by showing that a choice of dictionary that better matches the characteristics of the source during the sorting pass has as big an influence in performance as the use of a transform in the spectral direction. Finally, we provide comparison against state-of-the-art encoders, both 2D and 3D ones, showing the proposed encoding method is very competitive, especially at small bit rates.
A stochastic estimation problem at aeromagnetometer deviation compensation
Authors: E. V. Karshakov, M. V. Kharichkin
Venue: Automation and Remote Control (2008)

A formulation of the problem of magnitometer deviation compensation occurring at aeromagnetic survey is considered in the form of a standard stochastic estimation problem. A specific feature of this approach is the introduction of the model of a geomagnetic field anomaly. The parameters of the stochastic model are selected basing on spectral and variance analysis of the aeromagnetic survey data. Normalization of the problem parameters is made; this makes it possible to estimate the accuracy of compensation and conduct a necessary decomposition. The posed stochastic estimation problem is solved by the method of Kalman filtering.
Towards a solution for synchronizing disparate models of ultra-large-scale systems
Authors: James H. Hill, Jules White, Sean Eade, Douglas Schmidt, Trip Denton
Venue: Proceedings of the 2nd international workshop on Ultra-large-scale software-intensive systems (2008)

Traditional model-driven engineering (MDE) techniques rely on a paradigm where systems are developed using tightly coupled, monolithic modeling tools. Such monolithic modeling tools address many concerns, but operate largely in isolation of one another. As system size and complexity grow to become ultra-large-scale (ULS) systems, it is becoming clear that no single monolithic modeling tool can capture all the concerns of an ULS system. It is therefore essential that isolated modeling tools collaborate with each other when realizing ULS systems. This position paper presents our approach to facilitate collaboration between disparate MDE tools and their models. Our approach is based on model attributes, which are key/shared assumptions/concerns about an ULS system, extracted from a source model and used to synchronize disparate models. Our approach is suitable for ULS systems because the independent relation created between the isolated models and the model attributes enables independent trade-off analysis between models, decentralized development of models, and integration with inconsistent and rapidly changing models that are ideal for a particular domain or feature of a ULS system.
Equalized net diffusion (END) in Image denoising
Authors: Seongjai Kim
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

This article is concerned with the method of diffusion modulation, which can be applied for various conventional partial differential equation (PDE)-based restoration models in order to effectively restore not only fine structures but also slow transitions. We in particular introduce the equalized net diffusion (END) which tries to equalize the anisotropic diffusion over a wide range of image content. Although the new reformulated models incorporating END are highly nonlinear, they can be simulated efficiently by adopting linearized stable numerical procedures. The END-incorporated models have outperformed over the basic (conventional) PDE-based models in both quality and efficiency.
On Optimizing Leaf Initiated Point to Multi Point Trees in MPLS
Authors: Mohamad Chaitou, Jean-Louis Le Roux
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

Resource ReSerVation Protocol-Traffic Engineering (RSVP-TE), and Label Distribution Protocol (LDP) may be used to set up Point to Multi Point (P2MP) trees in MPLS. RSVPTE performs better in optimizing network resources, while LDP is simpler but has no guarantee on resource optimization. This paper presents a comparative study between RSVP-TE and LDP in regards of resource optimization and the resulting impact on the amount of memory consumed. It shows that the amount of memory needed in the case of RSVP-TE grows linearly as the size of the tree increases. In contrast, an approximate constant behavior is observed in the case of LDP, yielding an important scalability property. The paper then proposes two extensions to LDP aiming to achieve better resource optimization. In both extensions, a new leaf is provided a partial tree knowledge, by involving either all the nodes of the tree or only its leaves. The leaf joins the tree by connecting to the closest node among the known ones. Valuable comparisons with RSVP-TE are performed, and they represent an important background to decide when and how to use each protocol.
Optimal Algorithms for the Interval Location Problem with Range Constraints on Length and Average
Authors: Yong-Hsiang Hsieh, Chih-Chiang Yu, Biing-Feng Wang
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2008)

Let A be a sequence of n real numbers, L1 and L2 be two integers such thatL1 &#x2264; L2 , and R1 and R2 be two real numbers such that R1 &#x2264; R2. An interval of A is feasible if its length is between L1 and L2 and its average is between R1 and R2. In this paper, we study the following problems: finding all feasible intervals of A, counting all feasible intervals of A, finding a maximum cardinality set of non-overlapping feasible intervals of A, locating a longest feasible interval of A, and locating a shortest feasible interval of A. The problems are motivated from the problem of locating CpG islands in biomolecular sequences. In this paper, we firstly show that all the problems have an &#x03a9;(n log n)-time lower bound in the comparison model. Then, we use geometric approaches to design optimal algorithms for the problems. All the presented algorithms run in an on-line manner and use O(n) space.
Modeling and Cost Simulation of Stand-Alone Solar and Biomass Energy
Authors: Nader Barsoum, Wong Yew Yiin, Tan Kwong Ling, W. C. Goh
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This paper concerns on modeling of stand alone biomass and solar energy system in Sarawak. Sarawak state needs to develop a number of small power generations in remote areas using stand alone system. Stand alone power systems are of special interest combined with renewable energy design in areas not connected to the capital electric grid. The ultimate goal of this project is to obtain a reliable autonomous system with the optimization of the components size and the improvement of capital cost. Simulated model for photovoltaic system is designed using MATLAB Simulink together with PSIM and model for biomass is designed using HoneyWell software to investigate the design and the performance of stand-alone renewable energy systems. Furthermore, the Hybrid Optimization Model for Electric Renewable (HOMER) software is important to develop the cost optimization analysis. The costs for both renewable systems are optimized, compared and analyzed. For a particular scenario, inputs to HOMER include load data, renewable resource data, system component specifications and costs, and a variety of information of optimization, such as number of components in order to obtain the best possible system for rural areas.
Optimal digital filtering of continuous signals in time lag systems
Authors: K. Yu. Polyakov
Venue: Automation and Remote Control (2008)

The problem of the optimal estimation of continuous processes by discrete measurements in the presence of time lag (delay) is considered. On the basis of the theory of parametric transfer functions, an optimal, periodically nonstationary filter is developed, which affords a minimum of the estimation error variance at any instant of time. The comparison is performed of the obtained solution with the optimal stationary filter, which ensures a minimum of the mean (by continuous time) error variance. It is shown that in the problem of estimation of the Markov process of the first order, a simpler stationary filter with the fixer of order zero is insignificantly inferior to the optimal filter.