ppxscal/embedding_network huggingface dataset:
Evolution of Wireless Communications and Networking
Authors: Jon W. Mark
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

Over the ages, research in wireless communications has been evolving through a quest for answers to the fundamental questions: why, what and how? Why do people, separated by physical distances, cannot hear each other talking? Alexander Graham Bell's invention of the telephone was driven by this curiosity; so was Guglielmo Marconi's telegraphic signalling across the Atlantic Ocean in 1901. Societal evolution has also been driven by curiosity, especially in the pursuit for quality of life (QoL). The quest for QoL invariably creates conflicts, since greediness is a human trait (or perhaps fraud). Conflicts lead to warring among humans, and the need to observe the battle front in Europe during World War II was the pedal-stone on which research in wireless technology escalated. Through the cold war and subsequent relatively peaceful periods, wireless communications research continues to flourish. QoL becomes synonymous with wealth and health creation. With the ability to provide information in large volume and high-speed to enrich wealth creation, telecommunications research becomes the front banner in societal evolution. Quality of service (QoS) provided by an effective and efficient information transport platform becomes synonymous with QoL. To achieve global communications, it is necessary to interwork different domains of telecommunications. Interworking of different domains, however, has profound ramifications on the formulation of the building blocks and the glues needed to construct an information transport platform, and interdependency issues amongst the different layers of the information transport platform. This talk will provide an exposition and a critical look at future evolution of wireless communications and networking, beginning with a brief historical perspective of wireless technology, a critical look at the obstacles posed by nature, and then an examination of the building blocks and the glues necessary for the construction of the information transfer vehicle capable of delivering large volume of information at high-speed, and with end-to-end QoS satisfaction.
All Aboard OpenDocument!
Authors: Dennis Fowler
Venue: netWorker (2005)

In the early 19th century, there were no standards governing the spacing of railroad tracks. The width of four feet, eight-and-one-half inches was first used on the Stockton-to-Darlington steam railway in 1837 by English engineer George Stephenson, probably because that was the width of horse-drawn tram tracks, which were derived from the width of English cart axles, which, allegedly, fit the ruts left by the wheels of Roman chariots drawn by two horses.
A threat-driven approach to modeling and verifying secure software
Authors: Dianxiang Xu, Kendall Nygard
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

This paper presents a formal approach to threat-driven modeling and verification of secure software using aspect-oriented Petri nets. Based on the behavior model of intended functions, we identify and build formal models of security threats, which are potential misuses and anomalies of the intended functions that violate security goals. Threat mitigations are further modeled in an aspect-oriented paradigm. Taking Petri nets as a formal basis for modeling behaviors, threats, and mitigations as a whole, we verify properties of and consistency between behaviors and threats, and absence of identified threats from the integrated model of functions and threat mitigations. This makes it possible to achieve a design that is provably resistant to the anticipated threats and thus reduce significant design-level vulnerabilities.
Warp processing and just-in-time field-programmable gate array compilation
Authors: Roman Lev Lysecky
Venue:  (2005)

Warp processors dynamically and transparently optimize an executing software binary by moving software kernels to on-chip configurable logic, improving performance by 6.4X and reducing energy consumption. Extensive research has shown that hardware/software partitioning, the process of dividing an application between software executing on a microprocessor and hardware co-processors, can result in overall software speedups as well as reducing system energy. However, such partitioning typically requires special desktop-based computer-aided design (CAD) tools and designer expertise. Instead, by developing a custom routing-oriented field programmable gate array (FPGA) and lean on-chip decompilation, partitioning, and just-in-time (JIT) FPGA compilation tools, warp processors provide the performance and energy benefits of HW/SW partitioning without any designer effort or expertise. Using warp processors, a designer can use any programming language and compiler to create a truly portable application binary. A warp processor will determine how to best execute the portable binary either as software executing on a processor, entirely in hardware using configurable logic, or partitioning the application between software and hardware.
Optimal Sampling and Processing of an Impulse Radio Signal Subjected to Narrow Band Interference
Authors: John Nielsen
Venue: Wireless Personal Communications: An International Journal (2006)

In this paper the sampling, quantization and processing of an ultra-wideband (UWB) impulse radio (IR) receiver signal is considered when the propagation link is subjected to additive white Gaussian noise (AWGN) and narrow band interference (NBI) which may be non-Gaussian. The Neyman Pearson log likelihood ratio formulation results in receiver processing that consists of a Generalized Matched Filter (GMF) and linear sampling which exploits the correlation of the NBI noise to effectively suppress it. However, the processing requirements to implement the GMF are prohibitive in the context of an UWB IR. Hence an alternate highly efficient processing scheme based on crude 2 and 3 level quantization with maximum ratio combining (MRC) Rake processing is considered and analyzed. As demonstrated in this paper, the 3 level quantizer is an excellent compromise between receiver performance and computational efficiency and can in some cases exceed the performance of a comparable Rake receiver using linear sampling. This happens in some practical instances when the noise is non-gaussian as will be demonstrated.
Integrating gene expression signals with bounded collection grammars
Authors: Jonathan Schug
Venue:  (2005)

Tissue-specific expression is one of the most obvious and important patterns of gene expression in complex eukaryotes. Every cell in an organism has the same set of genes, yet only a subset of the genes are expressed in a given cell type. This regulation is accomplished in large part by transcription factors (TF's) that bind to short degenerate genomic sequences called binding sites near the genes they regulate. TF's work in combination to provide precise regulation of gene expression. Understanding the combinatorics of TF regulation is still an open problem in post-genomic biology. In this dissertation we develop and apply a bounded collection grammar (BCG) formalism, similar to permutation grammars, and a machine-learning algorithm to model, search for, and learn the combinations and arrangements of TF's that regulate tissue-specific expression. Our machine-learning algorithm allows for the optimization of free parameters in a grammar such as spacing and scores to identify the best possible performance of a rule. This system provides a unique combination of modeling power and learning ability. To identify tissue-specific genes from tissue surveys of gene expression, we apply Shannon entropy Hg to quantify overall specificity, then develop and apply a new metric entropy-based Qq| t to quantify specificity to a particular tissue, t. We take a stepwise approach to promoter analysis by first studying specific and ubiquitous promoters in general to determine global characteristics. We then study the genes specific to a particular tissue in this global context. Our analysis of mouse and human promoters ranked by Hg identifies the TATA box and CpG island as the major determinants of tissue-specificity. We find there are functional correlates of the TATA/CpG class of a gene's promoter. We identified TF's enriched in liver promoters and studied their arrangements to refine and extend earlier results by identifying one known rule and many new rules. Finally, we performed sequence analysis of ChIP-chip experiments to identify the companion factors of the ChIP-chip target factor that help define the active sites in the direct target genes demonstrating that our machine learning system can also contribute to the understanding of other regulatory events.
Second-order generalization in neural networks
Authors: Ann Marie Grbavec
Venue:  (2005)

One of the main strengths of neural networks is their ability to generalize beyond training data. However, recent research suggests that certain types of generalization, which humans appear to perform readily, are problematic for traditional neural networks. This thesis examines the foundations of such claims and considers possibilities for resolving several issues they raise. These forms of generalization have attracted attention in large part due to their implications about the role of symbol-processing in cognition. They have been shown to be beyond the scope of the types of neural networks that have been considered to offer an alternative to classically symbolic representations and rules: back-propagating multilayer perceptrons and simple recurrent networks. Interestingly, claims have been made that many classically symbolic machine learning techniques also fail to generalize in this way. The tasks in question can be described, broadly, as generalizing relations to novel items. Previous formulations of the research problem have offered various specific but somewhat inconsistent criteria for characterizing this type of generalization. In this thesis, an analysis of previous formulations reveals how they are limited by unacknowledged assumptions about the role of representation, task form, and learning in problem equivalence. A framework for specifying a generalization task is introduced to support a more lucid discussion of these issues. Applying the framework to sample tasks reveals an underlying distinction between ways in which a generalization may be reached. Based on the results of the analysis, a more unified view of the problem space is presented and related sub-problems are identified. Ways in which winner-take-all networks could play a role in the solution of two problem classes are outlined. Winner-take-all networks are considered to be more biologically plausible than the back-propagating networks which have been considered previously and unsuccessfully for the solution of such problems.
Cooperative target tracking using mobile robots
Authors: Gaurav S. Sukhatme
Venue:  (2005)

We study the problem of multiple target tracking using multiple mobile robots. Our approach is to divide the cooperative multi-target tracking problem into two sub-problems: target tracking using a single mobile robot and on-line motion strategy design for multi-robot coordination. For single robot-based tracking, we address two key challenges: how to separate the ego-motion of the robot from the motions of external objects, and how to compensate this ego-motion to detect and track moving objects robustly. An ego-motion compensation method using salient feature tracking and a probabilistic filter design to handle the noise and uncertainty of sensor inputs are presented. The proposed method has been tested in various outdoor environments using three different robot platforms, which have unique ego-motion characteristics. For multi-robot coordination, we propose an algorithm based on treating the densities of robots and targets as properties of the environment in which they are embedded. By suitably manipulating these densities a control law for each robot is proposed; we term our approach Region-based. We derive two specialized versions of the control law for the case when the topology of the environment is known in advance and the case when the environment is unstructured. These coordination approaches have been tested in simulation and in real robot systems. Experiments indicate that our treatment of the coordination problem based on environmental characteristics is effective and efficient.
Barrier permeation effects on the inversion layer subband structure and its applications to the electron mobility
Authors: G. S. Lujan, W. Magnus, B. Sorée, L-Å Ragnarsson, L. Trojman, S. Kubicek, S. De Gendt, M. Heyns, K. De Meyer
Venue: Microelectronic Engineering (2005)

The electron wave functions in the inversion layer are analyzed in the case where the dielectric barriers are not infinite. This forces the electron concentration closer to the interface silicon/oxide and reduces the subband energy. This treatment of the inversion layer is extended to the calculation of the electron mobility degradation due to remote Coulomb scattering on a high-k dielectric stacked transistor. The subband energy reduction leads to a decrease of the scattering charge needed to explain the experimental results. This model can also fit better the experimental data when compared with the case where no barrier permeation is considered.
Collision detection and proximity queries
Authors: Sunil Hadap, Dave Eberle, Pascal Volino, Ming C. Lin, Stephane Redon, Christer Ericson
Venue: ACM SIGGRAPH 2004 Course Notes (2004)

This course will primarily cover widely accepted and proved methodologies in collision detection. In addition more advanced or recent topics such as continuous collision detection, ADFs, and using graphics hardware will be introduced. When appropriate the methods discussed will be tied to familiar applications such as rigid body and cloth simulation, and will be compared. The course is a good overview for those developing applications in physically based modeling, VR, haptics, and robotics.
Text Extraction from Name Cards with Complex Design
Authors: Lin Lin, Chew Lim Tan
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper addresses the problem of text extraction from name card images with fanciful design containing complicated color background and reverse contrast regions. The proposed method is based on special edge detection followed by grouping of edges based on size, orientation and color attributes. The difficulties from color complexity caused by background color variation or reverse contrast are overcome by edge detection and color histogram. The grouping of edges filters out the background textures or graphical objects. The final detected text grouping is then binarized for OCR. Experimental results show improved text extraction in comparison with a conventional method.
A Novel Audio Watermarking Technique Based on Low Frequency Components
Authors: Hamad Alaryani, Abdou Youssef
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

In this paper, we present a novel audio watermarking technique that utilizes the Low Frequency Components (LFCs) of an audio signal to identify the location of the embedded watermarks. The embedding takes place by modifying the amplitude of selected samples determined by the LFCs of the audio signal. The amount of modification to the amplitude is determined by the amount of distortion detected by the human ear. This technique is blind where the decoder does not need the original audio file to extract the watermarks. In this technique, we use a novel data recovery scheme to recover any watermarks that were lost because of an intentional or unintentional attempt of watermark removal (attack). Experimental results show that this technique is highly robust against single and double attacks with watermark recovery rates greater than 90%.
Modular set-based analysis from contracts
Authors: Philippe Meunier, Robert Bruce Findler, Matthias Felleisen
Venue: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2006)

In PLT Scheme, programs consist of modules with contracts. The latter describe the inputs and outputs of functions and objects via predicates. A run-time system enforces these predicates; if a predicate fails, the enforcer raises an exception that blames a specific module with an explanation of the fault.In this paper, we show how to use such module contracts to turn set-based analysis into a fully modular parameterized analysis. Using this analysis, a static debugger can indicate for any given contract check whether the corresponding predicate is always satisfied, partially satisfied, or (potentially) completely violated. The static debugger can also predict the source of potential errors, i.e., it is sound with respect to the blame assignment of the contract system.
The feature Combination Technique for Off-line Thai Character Recognition System
Authors: Ithipan Methasate, Sanparith Marukatat, Sutat Sae-tang, Thanarak Theeramunkung
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper propose an off-line Thai character recognition system for an unconstrain writing. This system combines both global feature, that represents character shape, and local feature, that represents the symbolic structure, to solve the similarity and variety problems of Thai characters. The pixel distribution is applied, as the global feature, toclassify the image into 20 groups of similar characters. The modified structure features extraction is used to extract character structure. Then, all features, global and local, are used to classify the character within each group. The proposed method yields the recognition rate at 87.32 percents.
Intrinsic Observer-Based Stabilization for Simple Mechanical Systems on Lie Groups
Authors: D. H. S. Maithripala, W. P. Dayawansa, J. M. Berg
Venue: SIAM Journal on Control and Optimization (2005)

This paper presents a dynamic observer for a class of simple mechanical systems on Lie groups. This observer provides velocity estimates based on configuration measurements. The observer is \textit{intrinsic}, so its performance does not depend on the choice of coordinates, and it is \textit{coordinate free}, in the sense that the equations may be written explicitly without specifying coordinates for the configuration space. Our main result is obtained by specializing a previous result of Aghannan and Rouchon concerning velocity estimation of simple mechanical systems on Riemannian manifolds to such systems on Lie groups. This specialization is nonobvious and extremely powerful. Further we extend the original result to include velocity-dependent external forces. This estimator, combined with a coordinate-free formulation of passivity-based state-feedback control, allows the construction of a coordinate-free, intrinsic dynamic output feedback compensator. This is, to our knowledge, the first time such a result has been reported. Explicit expressions are computed for the Lie groups $SO(3)$ and $SE(3)$, allowing easy specialization to practical problems of rigid body motion. The theory is illustrated via application to the axisymmetric top and to a six-degrees-of-freedom microelectromechanical system.
GaMa: An Evolutionary Algorithmic Approach for the Design of Mesh-Based Radio Access Networks
Authors: Samik Ghosh, Preetam Ghosh, Kalyan Basu, Sajal K. Das
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Wireless mesh based access networks are destined to play a pivotal role in next generation broadband systems. With the proliferation of mesh networks, a key issue for network designers is the design of an optimal mesh topology which minimizes cost while maintaining carrier-class features. In this paper, we formulate the design of an optimal mesh, taking network deployment cost, topological properties and carrier-grade reliability into account. Next, we present a Genetic Algorithm based algorithm (GaMa) for mesh topology design. We show that GaMa is capable of determining a generic mesh topology with carrier-class network features. The performance of the algorithm is compared with existing mesh topologies and gives improved results without the constraints of maintaining a regular topology.
Translation Estimation from Omnidirectional Images
Authors: Jae-Hak Kim, Richard Hartley
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

We present a translation estimation method from omnidirectional images with missing data. Given omnidirectional images, it is possible to estimate the rotations of each camera using a fundamental matrix. We can thus get the translations of each camera using a plane-based projective reconstruction method. However, the plane-based translation estimation method does not give a robust result when there are measurement errors in the data. The method proposed in this paper solves this problem and shows more reliable results than the previous method.
A comparison of some discrete event simulation languages
Authors: A. M. C. Leeming
Venue: ACM SIGSIM Simulation Digest (1981)

Discrete event simulation is now a widely used tool to aid the decision maker faced with the need to investigate the effect of changes on dynamic real-time systems. It is used in those situations which are not susceptible to analytic solutions and where the only alternative to trying out the changes on the live system is to build a model and try the changes on the model. This paper is concerned with the evaluation of three languages which have been developed to enable the model builder to represent a discrete event system on a computer and hence simulate a system. These languages are GPSS, ECSL and SIMULA 67. See refs. 1,2,3.
HiQ: A Hierarchical Q-Learning Algorithm to Solve the Reader Collision Problem
Authors: Junius Ho, Daniel W. Engels, Sanjay E. Sarma
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

HiQ is a hierarchical, online learning algorithm that finds dynamic solutions to the Reader Collision Problem in RFID systems. When the transmissions from one reader interfere with the operation of another reader, a reader collision occurs. The objective of the Reader Collision Problem is to minimize the reader collisions experienced by RFID readers while using the minimum number of frequencies and using the minimum total time for all readers to communicate successfully. HiQ attempts to minimize reader collisions by learning the collision patterns of the readers and by effectively assigning frequencies over time to ensure neighboring readers do not experience collisions from one another. HiQ is arranged hierarchically with distributed, local control. The algorithm is based on a type of reinforcement learning called Q-learning, which is used to determine frequency and time assignments. Through repeated interaction with the system, Q-learning attempts to discover an optimum frequency assignment over time. We show that HiQ finds optimal or near optimal solutions to the Reader Collision Problem.
Design and Implementation of Healthcare Information Consolidation Platform
Authors: Hanping Jiang, Fulin Zhang
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

Currently Shenzhen's healthcare institutes and organizations are using disparate IT applications, which are proprietary and home grown at various operation platforms since different years. It is urgent for HB to build up a regional healthcare data center platform so as to exchange & share the information.