ppxscal/embedding_network huggingface dataset:
Multi-Scale Predictability of High-Impact Weather in the Battlespace Environment
Authors: James D. Doyle, Carolyn A. Reynolds, Justin McLay, Joao Teixeira, Craig Bishop
Venue: Proceedings of the HPCMP Users Group Conference (2006)

The accurate prediction of the coastal atmosphere-ocean environment is critical to the success of US Navy operations. Operations, such as strike warfare, special operations, carrier flight operations, mission planning and rehearsal, and sorties, may be adversely affected by the high-frequency spatial and temporal variations of environmental conditions that occur in the battlespace environment. The presence of horizontal and vertical wind shears, precipitation, clouds, ducting conditions, pronounced temperature and/or moisture gradients, and aerosols are among the conditions that may adversely impact Navy operations. Because of the chaotic nature of the atmosphere-ocean system, and its sensitive dependence on initial conditions, there will always be uncertainty associated with forecasts of these phenomena. Due to inevitable uncertainties in the initial state, forecasts are most appropriately viewed in a probabilistic sense; that is, forecasts should provide probabilities of the occurrence of specific events, as well as estimates of forecast skill (e.g., Leith, 1974). The only computationally feasible approach to this problem is to perform an ensemble of forecasts from equally plausible initial states. Due to the high dimension of the system, a large number of ensembles are necessary to accurately forecast the probability that a specific high-impact event will occur. These high-impact events can be extreme events, such as strong windstorms that generate aerosols and impact electro-optical (EO) conditions, or relatively weak forcing events such as stratus clouds that may impact flight operations and electro-magnetic (EM) ducting conditions.
FFT-based incremental refinement of suboptimal detection
Authors: J. M. Winograd
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

In the context of FFT-based maximum-likelihood (ML) detection of a complex sinusoid in noise, we consider the result of terminating the FFT at an intermediate stage of computation and applying the ML detection strategy to its unfinished results. We show that detection performance increases monotonically with the number of FFT stages completed, converging ultimately to that of the exact ML detector. The receiver operating characteristic associated with the completion of each FFT stage is derived. This enables the calculation of the minimum number of FFT stages that must be completed in order for desired detection and false alarm probabilities to be obtained.
If one watermark is good, are more better?
Authors: F. Mintzer
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

Invisible watermarks are not all alike. Different techniques are used to embed different types of watermarks into digital media objects to accomplish different goals. Some watermarks are intended to robustly carry ownership information; some are intended to carry content-verification information; and some are intended to convey side information, or captions. Some opportunities to employ multiple watermarks to convey multiple sets of information, intended to satisfy differing or similar goals, are examined. Problems presented by the insertion of multiple watermarks are discussed. Progress towards developing techniques that embed multiple watermarks into an image are also presented.
Automatic Generation of Instructions to Robustly Test Delay Defects in Processors
Authors: Sankar Gurumurthy, Ramtilak Vemu, Jacob A. Abraham, Daniel G. Saab
Venue: Proceedings of the 12th IEEE European Test Symposium (2007)

We present a technique for generating instruction sequences to test a processor functionally. We target delay defects with this technique using an ATPG engine to generate delay tests locally, a verification engine to map the tests globally, and a feedback mechanism that makes the entire procedure faster. We demonstrate nearly 96% coverage of delay faults with the instruction sequences generated. These instruction sequences can be loaded into the cache to test the processor functionally.
OptIPuter--A High Performance SOA LambdaGrid Enabling Scientific Applications
Authors: Larry Smarr
Venue: Proceedings of the 11th IEEE International Workshop on Future Trends of Distributed Computing Systems (2007)

During the last few years, a radical restructuring of optical networks supporting e-Science projects is beginning to occur around the world. U.S. universities are beginning to acquire access to private, high bandwidth light pipes (termed "lambdas") through the National LambdaRail and the Global Lambda Integrated Facility, providing direct access to global data repositories, scientific instruments, and computational resources from Linux clusters in individual user laboratories. These dedicated connections have a number of significant advantages over shared internet connections, including high bandwidth (10Gbps+), controlled performance (no jitter), lower cost per unit bandwidth, and security. These lambdas enable the Grid program to be completed, in that they add the network elements to the compute and storage elements which can be discovered, reserved, and integrated by the Grid middleware to form global LambdaGrids.
A P2P-Based Mechanism for Managing Location-Dependent Contents in Ubiquitous Environments
Authors: Tomoya Kawakami, Susumu Takeuchi, Yuuichi Teranishi, Kaname Harumoto, Shinji Shimojo
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

This paper presents a novel Peer-to-Peer (P2P) mechanism that can handle effective location-dependent content discovery to enable context-aware ubiquitous computing. Our mechanism is an extension of "LL-Net', a P2P overlay network that handles peer discoveries according to the geographical location of the peer. To manage location-dependent content discoveries in the LL-Net, a index of location-dependent content is stored in the peer that is located nearest to the content. A query for location-dependent contents located in the certain area is forwarded to the peers that are inside the caluculated area using LL-Net. After the indexes are obtained as the result of the query, location-dependent contents are retrieved according to the indexes. We have evaluated the effectiveness of the proposed mechanism by simulations and confirmed that our mechanism can handle queries with small number of messages. We also found that messages required to achieve 95% recall rate are almost half number of messages that are required to achieve 100% recall rate in our mechanism.
The Teager energy based feature parameters for robust speech recognition in car noise
Authors: F. Jabloun
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

In this paper, a new set of speech feature parameters based on multirate signal processing and the Teager energy operator is developed. The speech signal is first divided into nonuniform subbands in mel-scale using a multirate filter-bank, then the Teager energies of the subsignals are estimated. Finally, the feature vector is constructed by log-compression and inverse DCT computation. The new feature parameters have a robust speech recognition performance in car engine noise which is low pass in nature.
Multi-scale spline-based contour data compression and reconstruction through curvature scale space
Authors: K. Sezaki
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

The curvature scale space (CSS) technique has been used in conjunction with Hermite curves for compression and robust reconstruction of 2-D contours at multiple scales. CSS is a powerful contour shape descriptor which is expected to be an MPEG-7 standard. A parametric representation of the input contour is convolved with Gaussian functions in order to obtain multi-scale descriptions of the contour. Curvature can be computed directly at each point of the smoothed contours. As a result, a set of curvature zero-crossing points can be extracted from each smoothed contour. Hermite curves were used since each Hermite curve is defined by two endpoints and the tangent vectors at those points. No points external to the input contour are required for Hermite curves. Hermite endpoints are defined as consecutive curvature zero-crossing points extracted at multiple scales using the CSS method. Hermite tangent vectors can also be determined using the CSS technique. The only data stored are the endpoints and the tangent vectors needed by the Hermite curves in order to arrive at an approximate reconstruction of the original contour.
Multi-Level Communication Structure for Heirarchical Gain Aggregation
Authors: D. H. Gill, T. J. Smith, T. E. Gerasch, C. L. McCreary
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

Algorithms for the partitioning and scheduling of parallel programs have been the topic of intense research for numerous years. It is well understood that the organization und size of the parallel tasks are critical to the efficiency of a parallel program and to the effective use of parallel resources various algorithm have been proposed for partitioning and scheduling that are optimal under severely constrained assumptions. Under realistic assumptions, the general partitioning and scheduling problems are intractable.
Infinitary rewriting: meta-theory and convergence
Authors: Stefan Kahrs
Venue: Acta Informatica (2007)

When infinitary rewriting was introduced by Kaplan et&#x00a0;al. (Principles of Programming Languages, ACM, New York, pp. 250&#x2013;259, 1989) at the beginning of the 1990s, its term universe was explained as the metric completion of a metric on finite terms. The motivation for this connection to topology was that it allowed to import other well-studied notions from metric spaces, in particular the notion of convergence as a replacement for normalisation. This paper generalises the approach by parameterising it with a term metric, and applying the process of metric completion not only to terms but also to operations on and relations between terms. The resulting meta-theory is studied, leading to a revised notion of infinitary rewrite system. For these systems a method is devised to prove their convergence.
Unified Architecture for Large-Scale Attested Metering
Authors: Michael LeMay, George Gross, Carl A. Gunter, Sanjam Garg
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

We introduce a secure architecture called an attested meter for advanced metering that supports large-scale deployments, flexible configurations, and enhanced protection for consumer privacy and metering integrity. Our study starts with a threat analysis for advanced metering networks and formulates protection requirements for those threats. The attested meter satisfies these through a unified set of system interfaces based on virtual machines and attestation for the software agents of various parties that use the meter. We argue that this combination provides a well-adapted architecture for advanced metering and we take a step towards demonstrating its feasibility with a prototype implementation based on the Trusted Platform Module (TPM) and Xen Virtual Machine Monitor (VMM). This is the first effort to use virtual machines and attestation in an advanced meter.
Data consistency in a p2p knowledge management platform
Authors: Carlo Mastroianni, Giuseppe Pirrò, Domenico Talia
Venue: Proceedings of the second workshop on Use of P2P, GRID and agents for the development of content networks (2007)

Peer-to-Peer (P2P) architectures for content and knowledge management enable autonomous peers to interoperate in a decentralized and distributed fashion for fulfilling individual and/or common goals. These architectures foster the creation of communities of Individual Knowledge Workers (IKWs) in which effective knowledge and information sharing takes place. In such communities, IKWs have similar capabilities in providing other IKWs with data and/or services and are autonomous in managing their own knowledge objects. Since such objects are typically shared among a set of IKWs, problems regarding concurrent access to content, content consistency and synchronization arise. This paper proposes a decentralized approach to the aforementioned issues and reports on its application and performance evaluation in the K-link+ system. K-link+ is a P2P collaborative platform, developed at the GridLab of the University of Calabria, for distributed knowledge management based on the Virtual Office model.
Infinite State AMC-Model Checking for Cryptographic Protocols
Authors: Detlef Kahler, Ralf Kusters, Tomasz Truderung
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

Only very little is known about the automatic analysis of cryptographic protocols for game-theoretic security properties. In this paper, we therefore study decidability and complexity of the model checking problem for AMC-formulas over infinite state concurrent game structures induced by cryptographic protocols and the Dolev-Yao intruder. We show that the problem is NEXPTIME-complete when making reasonable assumptions about protocols and for an expressive fragment of AMC, which contains, for example, all properties formulated by Kremer and Raskin in fair ATL for contract-signing and non-repudiation protocols. We also prove that our assumptions on protocols are necessary to obtain decidability, unless other restrictions are imposed on protocols.
Discrete cosine transform in digital subscriber line applications
Authors: J. A. Danda, A. Dziech
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

Multicarrier or multitone modulations (MTM) are efficient techniques for transmission of digital data over a copper wire. Most significant property of MTM is low sensitivity to the narrowband noise. All MTM are accomplished digitally. Due to high complexity, MTM transceivers were implemented at last decade, when suitable processors were manufactured. At present MTM have wide applications in digital subscriber lines (DSL). ANSI T1.413, asymmetric DSL (ADSL) standard and ITU G.992, defines discrete multitone modulation (DMT), known as well as orthogonal frequency division multiplexing (OFDM). We introduce a simple MTM modulation, which we call discrete cosine multitone (DCMT). DCMT possesses two important properties: it is more efficient than DMT, and provides lower complexity of a transceiver.
Measurement-based in-building cellular coverage analysis for GSM1900
Authors: Alejandro Aragon-Zavala, Claudia Arredondo-Luna, Karla Monares-Sanchez
Venue: Proceedings of the 17th International Conference on Electronics, Communications and Computers (2007)

A detailed cellular existing coverage analysis was performed for the Informatics and Electronics Centre Building (CIE) at ITESM Campus Querétaro, using novel propagation modelling tools such as Measurement-based prediction (MbP) to predict signal strength levels across the five-storey building. An extensive set of radio measurements was performed in the 1900 MHz band to construct received signal strength prediction maps, which were used as inputs for MbP. This analysis gives insight into the propagation mechanisms involved, as well as reveals specific coverage holes as a result of deficient macrocell penetration. This paper also highlights the future steps suggested to address the above mentioned issues from a design perspective.
Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

The following topics were discussed:Evolutionary computation and biology; multiobjective evolutionary algorithms; evolutionary computation theory; molecular and quantum computing; combinatorial and numerical optimization; graphics and image processing; genome informatics; evolutionary intelligent agents; artificial immune systems; evolutionary multicriteria optimization; real-world applications and search operators and selection.
The effect of course sequence on the retention of freshmen engineering students: when should the intro engineering course be offered?
Authors: M. R. Anderson-Rowland
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

ECE 100, Introduction to Engineering Design, is required of all students in the College of Engineering and Applied Sciences (CEAS) students at Arizona State University (ASU), USA. Due to space and staffing constraints, approximately half of the students entering in the fall take the course during their first semester and the other half does so during their second semester in the Spring. Most of the students who take ECE 100 in the Spring do not take any engineering course in their first semester. Studies done when the introductory course was in a different format suggested that if engineering students took the introductory engineering course during their first semester, their rate of retention was higher than for those who took the course in the Spring. In a recent study, it was shown that the retention rate of the fall 95 first-time, full-time freshmen (FFF) in ECE 100 their first semester had a higher retention rate one year later than the average FFF in the CEAS. ECE 100 students were surveyed in the Fall 95 and Spring 96 semesters. Surprisingly, for all groups-men, women and minority students-retention was higher after two years for those students who took ECE 100 in the Spring. This difference was significant for the male students. Among FFF students, while men did better taking ECE 100 in the Spring, women and minority students showed a trend of higher retention by taking ECE 100 in the Fall. This trend would suggest that special programs for FFF women and minority students, not in ECE 100 in the Fall, might help increase retention.
Report on the INEX 2006 heterogeneous collection track
Authors: Ingo Frommholz, Ray Larson
Venue: ACM SIGIR Forum (2007)

XML collections that consist of subcollections from different sources pose a challenge with respect to syntactic, semantic and genre heterogeneity, because they are based on different DTDs or schemas, cover various topics and consist of diverse document types. This led to the establishment of the Heterogeneous Track at INEX 2006. The goal of the track was to set up a testbed consisting of several different and diverse collections and defining retrieval tasks and appropriate topics. These are the foundations for the Heterogeneous Track at INEX 2007, where the focus is on run submissions, relevance assessments and proper evaluation of the proposed methods dealing with a heterogeneous collection.
Robust dialogue-state dependent language modeling using leaving-one-out
Authors: F. Wessel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

The use of dialogue-state dependent language models in automatic inquiry systems can improve speech recognition and understanding if a reasonable prediction of the dialogue state is feasible. In this paper, the dialogue state is defined as the set of parameters which are contained in the system prompt. For each dialogue state a separate language model is constructed. In order to obtain robust language models despite the small amount of training data we propose to interpolate all of the dialogue-state dependent language models linearly for each dialogue state and to train the large number of resulting interpolation weights with the EM-algorithm in combination with leaving-one-out. We present experimental results on a small Dutch corpus which has been recorded in the Netherlands with a train timetable information system and show that the perplexity and the word error rate can be reduced significantly.
Connectivity models of interdependency in mixed-type critical infrastructure networks
Authors: Nils Kalstad Svendsen, Stephen D. Wolthusen
Venue: Information Security Tech. Report (2007)

Determining interdependencies and cascading failure modes in critical infrastructures is a complex problem that is exacerbated further by the diverging characteristics of the interconnected infrastructure types. Services in some types of infrastructure such as telecommunications or the electric grid are provided and consumed instantly. Others, notably oil and gas but also other infrastructures built on physical resources, however, exhibit buffering characteristics. In this paper we describe a model for the abstract representation of both types of infrastructure networks and their interdependencies. The model is then validated and demonstrated using characteristic topologies and interconnections.
Design and Description of a Classification System Framework for Easier Reuse
Authors: Sergio Lopes, Adriano Tavares, Joao Monteiro, Carlos Silva
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Frameworks are an important technology to reduce software development costs and shorten the time-to-market. However, framework complexity presents reuse problems that limit its success as an application development alternative. It has been widely recognized that is necessary to effectively communicate frameworks and provide appropriate tool support, but we argue that difficulties are also related to the considered framework model. We find that the level of support that tools can provide is decisively dependent on the kind of available framework documentation, which in turn is intimately tied to the considered framework model. In this paper, we present our framework model and respective supporting notation. We describe their appliance to the design and description of an application framework. This case study illustrates how the proposed model and documentation approach alleviate difficulties of framework reuse, namely its comprehension and instantiation.
Output value-based initialization for radial basis function neural networks
Authors: Alberto Guillén, Ignacio Rojas, Jesús González, Héctor Pomares, L. J. Herrera, O. Valenzuela, F. Rojas
Venue: Neural Processing Letters (2007)

The use of Radial Basis Function Neural Networks (RBFNNs) to solve functional approximation problems has been addressed many times in the literature. When designing an RBFNN to approximate a function, the first step consists of the initialization of the centers of the RBFs. This initialization task is very important because the rest of the steps are based on the positions of the centers. Many clustering techniques have been applied for this purpose achieving good results although they were constrained to the clustering problem. The next step of the design of an RBFNN, which is also very important, is the initialization of the radii for each RBF. There are few heuristics that are used for this problem and none of them use the information provided by the output of the function, but only the centers or the input vectors positions are considered. In this paper, a new algorithm to initialize the centers and the radii of an RBFNN is proposed. This algorithm uses the perspective of activation grades for each neuron, placing the centers according to the output of the target function. The radii are initialized using the center's positions and their activation grades so the calculation of the radii also uses the information provided by the output of the target function. As the experiments show, the performance of the new algorithm outperforms other algorithms previously used for this problem.