ppxscal/embedding_network huggingface dataset:
An urban terrain abstraction to support decisionmaking using recursive simulation
Authors: John B. Gilmer,  Jr.
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Recursive simulation is the technique of having simulated decisionmakers themselves use simulation to inform their decisionmaking. Issues of efficiency require that the recursive runs, especially if extended over multiple levels to represent adversarial planning, be at a relatively simple and abstract level of detail. However, the nature of urban terrain is that it is dominated by particulars that drive up the level of detail and make automated decision representations difficult. The proposed terrain abstraction is intended to address these issues, and support low resolution embedded simulation used for recursive decision support for entities in a higher fidelity simulation.
AI and Similarity
Authors: Edwina L. Rissland
Venue: IEEE Intelligent Systems (2006)

For AI to become truly robust, we must further our understanding of similarity-driven reasoning, analogy, learning, and explanation. Here are some suggested researchdirections.This article is part of a special issue on the Future of AI.
Line drawing in virtual reality using a game pad
Authors: Henry Gardner, Duan Lifeng, Qing Wang, Guyin Zhou
Venue: Proceedings of the 7th Australasian User interface conference - Volume 50 (2006)

We describe a software interface for drawing in three dimensions using a game pad. The software runs in a walk-in, virtual-reality theatre and has been designed for walk-up usability for a science museum. Usability aspects of the interface are discussed including the mapping of the thumb-joystick controllers and movements of the cursor in three dimensions.
Quorum sensing on mobile ad-hoc networks
Authors: Maxim Peysakhov, Christopher Dugan, Pragnesh Jay Modi, William Regli
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Mobile ad-hoc networks (MANETs) are an increasingly important networking paradigm that will be the backbone of important defense and first response networks. Group decision-making is key to these environments, but is made difficult when MANETs are introduced due to network disruptions, bandwidth limitations, and host mobility patterns. Results gathered using standard group decision-making algorithms can become inaccurate, time-insensitive, or computationally undecidable. This paper focuses on a group decision-making approach using agent-based quorum sensing (ABQS) on MANETs. A mobile agent collects information (e.g., votes) from each host on a network until it can make an informed decision about global preference. This agent exploits the inherent tradeoff between efficient vote collection and result accuracy in order to provide better results, when considering survivability, hosts visited, hops made, and time spent, with only a very slight drop in correctness---benefits that greatly outweigh costs. Experimental evidence from live MANETs demonstrates the effectiveness of this solution.
EVM estimation by analyzing transmitter imperfections mathematically and graphically
Authors: Ruifeng Liu, Yongming Li, Hongyi Chen, Zhihua Wang
Venue: Analog Integrated Circuits and Signal Processing (2006)

This letter analyzes the effects of transmitter imperfections, including carrier leakage, unwanted sideband, nonlinearity, local oscillator (LO) phase noise and frequency error, on error vector magnitude (EVM) performance. Predictor equations of transmitter EVM are given for radio designers to estimate the level of EVM or set appropriate design specifications to obtain desired EVM performance. These predictor equations are validated by measurement results of other reported works.
Recovering real-world images from single-scale boundaries with a novel filling-in architecture
Authors: Matthias S. Keil, Gabriel Cristóbal, Thorsten Hansen, Heiko Neumann
Venue: Neural Networks (2005)

Filling-in models were successful in predicting psychophysical data for brightness perception. Nevertheless, their suitability for real-world image processing has never been examined. A unified architecture for both predicting psychophysical data and real-world image processing would constitute a powerful theory for early visual information processing. As a first contribution of the present paper, we identified three principal problems with current filling-in architectures, which hamper the goal of having such a unified architecture. To overcome these problems we propose an advance to filling-in theory, called BEATS filling-in, which is based on a novel nonlinear diffusion operator. BEATS filling-in furthermore introduces novel boundary structures. We compare, by means of simulation studies with real-world images, the performance of BEATS filling-in with the recently proposed confidence-based filling-in. As a second contribution we propose a novel mechanism for encoding luminance information in contrast responses ('multiplex contrasts'), which is based on recent neurophysiological findings. Again, by simulations, we show that 'multiplex contrasts' at a single, high-resolution filter scale are sufficient for recovering absolute luminance levels. Hence, 'multiplex contrasts' represent a novel theory addressing how the brain encodes and decodes luminance information.
Orienting Attention to Locations in Perceptual Versus Mental Representations
Authors: A. C. Nobre, J. T. Coull, P. Maquet, C. D. Frith, R. Vandenberghe, M. M. Mesulam
Venue: Journal of Cognitive Neuroscience (2004)

Extensive clinical and imaging research has characterized the neural networks mediating the adaptive distribution of spatial attention. In everyday behavior, the distribution of attention is guided not only by extrapersonal targets but also by mental representations of their spatial layout. We used event-related functional magnetic resonance imaging to identify the neural system involved in directing attention to locations in arrays held as mental representations, and to compare it with the system for directing spatial attention to locations in the external world. We found that these two crucial aspects of spatial cognition are subserved by extensively overlapping networks. However, we also found that a region of right parietal cortex selectively participated in orienting attention to the extrapersonal space, whereas several frontal lobe regions selectively participated in orienting attention within on-line mental representations.
Exponential energy decay estimates for the solutions of n-dimensional Kirchhoff type wave equation
Authors: Ganesh C. Gorain
Venue: Applied Mathematics and Computation (2006)

Here we study uniform exponential stabilization of the vibrations of Kirchhoff type wave equation in a bounded domain in Rn with a smooth boundary, under mixed boundary conditions. To stabilize the system, we incorporate separately, the passive viscous damping and the internal material damping of Kelvin-Voigt type in the model. Explicit forms of exponential energy decay rates are obtained by a direct method, for the solution of such boundary value problems.
Proceedings of the 1st ACM international workshop on Underwater networks
Venue: International Conference on Mobile Computing and Networking (2006)

It is our great pleasure to welcome you to the First International Workshop on Underwater Networks (WUWNet'06). The goal of the workshop is to bring together researchers and practicing engineers from the areas of underwater communications and networking who are interested in applying their expertise to the development of future underwater networks.The call for papers attracted 30 submissions from the United States, Australia, India, South Korea, China, Singapore and Italy. The program committee accepted 10 full-length papers and 6 posters, included as short papers. We are also delighted to include 3 invited speakers. The papers cover a variety of topics in underwater communications, networking, and applications. Specifically, they address acoustic modem technology, applications of autonomous underwater vehicles, methods for localization, network topology discovery, media access control, routing protocols, and deployment considerations. In addition, the program includes a panel entitled: Underwater Networks: Methods, Systems, and Applications. We hope these proceedings will serve as a valuable reference for users, engineers, and researchers interested in underwater networks.
True stories, storied truth: stitching narrative and logico-scientific discourse together in an age of "Spin"
Authors: Joseph L. Polman
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

This paper includes a framework for combining narrative and logico-scientific thinking in the consumption and production of stories about the real world, such as journalistic and historical accounts. The framework involves graphical representation, at an intermediate level of abstraction, in "storygrams" showing sequences of actions involving agents, using cultural tools, to serve goals, within contexts of interpreted scenes. The framework also involves four elements of "narrative metacognition", including monitoring of perspectives, precedents, symbolism and narrative frames. Utilizing this framework may help learners better develop their facility at moving back and forth between assessments of "narrative truth" and "logico-scientific truth".
GA Optimization of OBF TS Fuzzy Models with Linear and Non Linear Local Models
Authors: Anderson V. Medeiros, Wagner C. Amaral, Ricardo J. G. B. Campello
Venue: Proceedings of the Ninth Brazilian Symposium on Neural Networks (2006)

OBF (Orthonormal Basis Function) Fuzzy models have shown to be a promising approach to the areas of nonlinear system identification and control since they exhibit several advantages over those dynamic model topologies usually adopted in the literature. Although encouraging application results have been obtained, no automatic procedure had yet been developed to optimize the design parameters of these models. This paper elaborates on the use of a genetic algorithm (GA) especially designed for this task, in which a fitness function based on the Akaike information criterion plays a key role by considering both model accuracy and parsimony aspects. The use of linear (actually affine) and nonlinear local models is also investigated. The proposed methodology is evaluated in the modeling of a real nonlinear magnetic levitation system.
Visible Surface Reconstruction from Normals with Discontinuity Consideration
Authors: Tai-Pang Wu, Chi-Keung Tang
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Given a dense set of imperfect normals obtained by photometric stereo or shape from shading, this paper presents an optimization algorithm which alternately optimizes until convergence the surface integrabilities and discontinuities inherent in the normal field, in order to derive a segmented surface description of the visible scene without noticeable distortion. In our Expectation-Maximization (EM) framework, we enforce discontinuity-preserving integrability so that fine details are preserved within each output segment while the occlusion boundaries are localized as sharp surface discontinuities. Using the resulting weighted discontinuity map, the estimation of a discontinuity-preserving height field can be formulated into a convex optimization problem. We compare our method and present convincing results on synthetic and real data.
Dynamic Reconfiguration Policies for Reconfigurable Coded-WDM PONs
Authors: Chuan-Ching Sue
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

This paper studies the issues arising when reconfiguring coded-WDM networks to provide protection against eavesdropping and it proposes a tradeoffs involved in carrying out this reconfiguration process. It commences by showing that the degree of confidentiality (DOC) and the traffic loss are two important, but conflicting, objectives in the design of reconfiguration policies. The reconfiguration problem is formulated as a Markovian decision process (MDP). The results obtained from MDP theory are applied to establish optimal reconfiguration policies for coded- WDM networks with various system parameters.
A multi-level assessment strategy: (dis)continuity in making learning visible differently
Authors: Steven J. Zuiker, Daniel T. Hickey
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

The range of assessment follows from theoretical assumptions that represent skills and concepts differently, and increasingly wrestle with representations of practices. A pragmatic strategy for coordinating and leveraging these differences may provide degrees of continuity across each, and scaffold both individual performance and collective participation in domain practices. This poster profiles a case study of (dis)continuity across one such pragmatic organization of assessment. Findings suggest methodological limits for illuminating discontinuity and a more tractable approach.
Image Transmission in LDPC Coded Mobile Satellite Communication Systems
Authors: Yuling Zhang, Dongfeng Yuan
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

This paper investigates the performance of image transmission with unequal error protection (UEP) through typical satellite communication channel, and the UEP is achieved by mapping different bits of the image bytes to different positions of a progressive edge growth (PEG) constructed irregular Low-Density Parity-Check (LDPC) codes. The satellite communication channel consists of two main fading: one is the nonlinearity caused by on-board high power amplifier (HPA), and another is the time-varying fading caused by the propagation channel, a neural network (NN) based predistortion technique is adopted to deal with the nonlinearity.
Recursive modules for programming
Authors: Keiko Nakata, Jacques Garrigue
Venue: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming (2006)

TheML module system is useful for building large-scale programs. The programmer can factor programs into nested and parameterized modules, and can control abstraction with signatures. Yet ML prohibits recursion between modules. As a result of this constraint, the programmer may have to consolidate conceptually separate components into a single module, intruding on modular programming. Introducing recursive modules is a natural way out of this predicament. Existing proposals, however, vary in expressiveness and verbosity. In this paper, we propose a type system for recursive modules, which can infer their signatures. Opaque signatures can also be given explicitly, to provide type abstraction either inside or outside the recursion. The type system is decidable, and is sound for a call-by-value semantics. We also present a solution to the expression problem, in support of our design choices.
A Multiple-Instance Neural Networks based Image Content Retrieval System
Authors: Shun-Chin Chuang, Yeong-Yuh Xu, Hsin Chia Fu, Hsiang-Cheh Huang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

In this paper, we proposed a Multiple-Instance Neural Network (MINN) for content-based image retrieval (CBIR). In order to represent the rich content of an image without precisely image segmentation, the image retrieval problem is considered as a multiple-instance learning problem. A set of exemplar images are selected by a user, each of which is labelled as conceptual related (positive) or conceptual unrelated (negative) image. Then, the proposed MINN is trained by using the proposed learning algorithm to learn the user's preferred image concept from the positive and negative examples. Experimental results show that: (1) without image segmentation and using only the color histogram as the image feature, the MINN without relevance feedback performs slightly inferior to some leading image retrieval methods, and (2) the MINN with the relevance feedback can significantly improve the retrieving performance from 40.3% to 59.3%, which outperforms to the results of some leading image retrieval methods.
Assessing risk in a job schedule: integrating a scheduling heuristic and a simulation model to a spreadsheet
Authors: Kusuma Rojanapibul, Juta Pichitlamken
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Deterministic scheduling algorithms are often applied to problems in stochastic settings perhaps because they are already hard to solve even without considering stochastic characteristics. We are interested in assessing the measure of risk in performance measures (e.g., makespan) when these algorithms are used in probabilistic environment. We design an easy-to-use Microsoft Excel&reg; program that integrates a Visual Basic Application (VBA) subroutine which performs scheduling procedures, with an Arena&reg; simulation model that imitates the stochastic production environment. Our program suggests a job schedule, its associated performance measures and the corresponding prediction intervals. At the moment, we only consider the m-machine permutation flowshop problem with the makespan (or completion time) objective.
Fast blind equalization via antenna arrays
Authors: L. Tong, G. Xu, T. Kailaith
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

A scheme of fast blind equalization of multipath channels using antenna arrays is proposed. An array of antennas is used along with a fractionally spaced equalization structure to combine with temporal and spatial diversities. Necessary and sufficient conditions of channel (blind) identifiability are presented. The proposed approach offers fast equalization by exploiting cyclostationary properties of the observation.
Separation of digital communication signals through joint space-time decorrelation
Authors: J. Sala-Alvarez, G. Vazquez-Grau
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

In this paper we derive the optimum linear algorithm for the separation by an array of a given number of cyclostationary signals of the type encountered in digital communications. Spatially and temporally uncorrelated noise is considered at the input to each sensor. It is proved that the optimum signal separator can be expressed as a matrix transfer function in the z-domain. It is intended that this algorithm be used as a benchmark to test the performance of adaptive schemes. Therefore, bounds on the noise estimation covariance are obtained assuming perfect knowledge of the number of sources as well as of their timing and DOA.
Oligonucleotide fingerprint identification for microarray-based pathogen diagnostic assays
Authors: Waibhav Tembe, Nela Zavaljevski, Elizabeth Bode, Catherine Chase, Jeanne Geyer, Leonard Wasieloski, Gary Benson, Jaques Reifman
Venue: Bioinformatics (2007)

Motivation: Advances in DNA microarray technology and computational methods have unlocked new opportunities to identify 'DNA fingerprints', i.e. oligonucleotide sequences that uniquely identify a specific genome. We present an integrated approach for the computational identification of DNA fingerprints for design of microarray-based pathogen diagnostic assays. We provide a quantifiable definition of a DNA fingerprint stated both from a computational as well as an experimental point of view, and the analytical proof that all in silico fingerprints satisfying the stated definition are found using our approach. Results: The presented computational approach is implemented in an integrated high-performance computing (HPC) software tool for oligonucleotide fingerprint identification termed TOFI. We employed TOFI to identify in silico DNA fingerprints for several bacteria and plasmid sequences, which were then experimentally evaluated as potential probes for microarray-based diagnostic assays. Results and analysis of approximately 150 in silico DNA fingerprints for Yersinia pestis and 250 fingerprints for Francisella tularensis are presented. Availability: The implemented algorithm is available upon request. Contact:jaques.reifman@us.army.mil.
An empirical analysis of heterogeneity in IEEE 802.11 MAC protocol implementations and its implications
Authors: K. N. Gopinath, Pravin Bhagwat, K. Gopinath
Venue: Proceedings of the 1st international workshop on Wireless network testbeds, experimental evaluation characterization (2006)

Wireless LAN (WLAN) market consists of IEEE 802.11 MAC standard conformant devices (e.g., access points (APs), client adapters) from multiple vendors. Certain third party certifications such as those specified by the Wi-Fi alliance have been widely used by vendors to ensure basic conformance to the 802.11 standard, thus leading to the expectation that the available devices exhibit identical MAC level behavior. In this paper, however, we present what we believe to be the first ever set of experimental results that highlight the fact that WLAN devices from different vendors in the market can have heterogeneous MAC level behavior. Specifically, we demonstrate with examples and data that in certain cases, devices may not be conformant with the 802.11 standard while in other cases, they may differ in significant details that are not a part of mandatory specifications of the standard. We argue that heterogeneous MAC implementations can adversely impact WLAN operations leading to unfair bandwidth allocation, potential break-down of related MAC functionality and difficulties in provisioning the capacity of a WLAN. However, on the positive side, MAC level heterogeneity can be useful in applications such as vendor/model level device fingerprinting.
Modeling mental states in the analysis of multiagent systems requirements
Authors: Alexei Lapouchnian, Yves Lespérance
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

This paper presents an agent-oriented requirements engineering approach that combines informal i* models with formal specifications in the CASL language through the use of Intentional Annotated Strategic Rationale diagrams. In the resulting framework, agent goals and knowledge are represented as their mental states, which allows for the formal analysis of, among other things, agent interactions and incomplete knowledge. CASL models can also serve as high-level specifications for multiagent systems.
From Algebraic Semantics to Denotational Semantics for Verilog
Authors: Huibiao Zhu, Jifeng He, Jonathan P. Bowen
Venue: Proceedings of the 11th IEEE International Conference on Engineering of Complex Computer Systems (2006)

This paper considers how the algebraic semantics for Verilog relates with its denotational semantics. Our approach is to derive the denotational semantics from the algebraic semantics. We first present the algebraic laws for Verilog. Every program can be expressed as a guarded choice that can model the execution of a program. In order to investigate the parallel expansion laws, a sequence is introduced, which indicates the instantaneous action is due to which exact parallel component. A normal form is defined for each program by using the locality sequence. We provide a strategy for deriving the denotational semantics based on the algebraic normal form. Using the strategy, the denotational semantics for every program can be calculated. Program equivalence can also be explored by using the derived denotational semantics.