ppxscal/embedding_network huggingface dataset:
The portable batch scheduler and the maui scheduler on linux clusters
Authors: Brett Bode, David M. Halstead, Ricky Kendall, Zhou Lei, David Jackson
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

The motivation for a stable, efficient, backfill scheduler that runs in a consistent manner on multiple hardware platforms and operating systems is outlined and justified in this work. The combination of the Maui Scheduler and the Portable Batch System (PBS), are evaluated on several cluster solutions of various size, performance and communications profiles. The total job throughput is simulated in this work, with particular attention given to maximizing resource utilization and to the execution of large parallel jobs.
On Compression of Encrypted Video
Authors: Daniel Schonberg, Chuohao Yeo, Stark C. Draper, Kannan Ramchandran
Venue: Proceedings of the 2007 Data Compression Conference (2007)

We consider video sequences that have been encrypted uncompressed. Since encryption masks the source, traditional data compression algorithms are rendered ineffective. However, it has been shown that through the use of distributed source-coding techniques, the compression of encrypted data is in fact possible. This means that it is possible to reduce data size without requiring that the data be compressed prior to encryption. Indeed, under some reasonable conditions, neither security nor compression efficiency need be sacrificed when compression is performed on the encrypted data (Johnson et al., 2004). In this paper we develop an algorithm for the practical lossless compression of encrypted gray scale video. Our method is based on considering the temporal correlations in video. This move to temporal dependence builds on our previous work on memoryless sources, and one- and two-dimensional Markov sources. For comparison, a motion-compensated lossless video encoder can compress each unencrypted frame of the standard "Foreman test video sequence by about 57%. Our algorithm can compress compress the same frames, after encryption, by about 33%.
MundoCore: A light-weight infrastructure for pervasive computing
Authors: Erwin Aitenbichler, Jussi Kangasharju, Max Mühlhäuser
Venue: Pervasive and Mobile Computing (2007)

MundoCore is a communication middleware specifically designed for the requirements of pervasive computing. To address the high degree of heterogeneity of platforms and networking technologies, it is based on a microkernel design, supports dynamic reconfiguration, and provides a common set of APIs for different programming languages (Java, C++, Python) on a wide range of different devices. The architectural model addresses the need for proper language bindings, different communication abstractions, peer-to-peer overlays, different transport protocols, different invocation protocols, and automatic peer discovery.
Interference Measurements on Performance Degradation between Colocated IEEE 802.11g/n and IEEE 802.15.4 Networks
Authors: Marina Petrova, Lili Wu, Petri Mahonen, Janne Riihijarvi
Venue: Proceedings of the Sixth International Conference on Networking (2007)

We have made detailed measurements, on the impact of modern Wireless LAN technologies on the IEEE 802.15.4 in the 2.4 GHz ISM band. We have specifically focused on IEEE 802.11g and pre-standard IEEE 802.11n products as potential interferers. Our measurements show that high levels of network traffic interference from either of these technologies has disastrous impact on the performance of IEEE 802.15.4. Our results also indicate that these interference effects are especially difficult to avoid in the (pre-standard) 802.11n case due to the significantly increased channel bandwidth compared to previous Wireless LAN technologies. Widespread adoption of IEEE 802.11n especially in applications involving high data rates (such as backbones for wireless mesh networks) could thus have serious impact on the usability of IEEE 802.15.4 as well as other low-power 2.4 GHz ISM band technologies. This indicates that low-power building automation, consumer electronics and sensor networks may be vulnerable to the interference from the future IEEE 802.11n high-data rate WLAN deployments.
A Local Search Heuristic for Biobjective Intersecting Geometric Graphs
Authors: Rajeev Kumar, P. K. Singh, Bhargab B. Bhattacharya
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

In this work, we consider the problem of constructing spanning trees from two geometric graphs corresponding to two nets, each with multiple terminals, with a goal to minimize the total edge cost and the number of intersections among the edges of the two trees. Such an optimization problem is computationally hard for which no efficient algorithm or good heuristic is known to exist. Additionally, in a biobjective setting, the major challenge to solve a problem is to obtain many representative diverse solutions across the (near-) optimal Pareto-front. We present a local search based heuristic to find near-optimal Pareto-front in the feasible solution space. Each element of this solution set is a tuple of two spanning trees corresponding to the given geometric graphs. The heuristic is shown to give superior results over the existing stochastic technique.
Two periodic solutions of neutral difference systems depending on two parameters
Authors: Jun Wu, Yicheng Liu
Venue: Journal of Computational and Applied Mathematics (2007)

In this paper, we establish existence, multiplicity and nonexistence of periodic solutions for a class of first-order neutral difference systems. Our approach is based on a fixed point theorem in cones as well as some analysis techniques.
Deterministic crowding, recombination and self-similarity
Authors: Bo Yuan
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper proposes a new crossover operation named asymmetric two-point crossover (ATC). We show how deterministic crowding can be successful in the HIFF problem and the M7 function with this new crossover. We also point out that self-similarity in the solution plays an important role in the success of ATC.
A channel order independent method for blind equalization of MIMO systems
Authors: J. Xavier
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

We study blind equalization of noisy MIMO-FIR systems driven by white sources. We present a new second order statistics (SOS) based approach which does not require the knowledge of the channel order. This technique blindly transforms a convolutive mixture of users into an instantaneous one. Thus, in the special case of a single user (SIMO systems), an estimate of the input signal is readily obtained. Computer simulations results illustrate the promising performance of the proposed technique. We compare our method with the multistep prediction (MSP) approach (in the context of SIMO systems), and evaluate the algorithm capability in globally nulling the intersymbol interference (ISI) for MIMO systems.
Tree Structure for Contractible Regions in R3
Authors: James Damon
Venue: International Journal of Computer Vision (2007)

For contractible regions ¿in ¿3 with generic smooth boundary, we determine the global structure of the Blum medial axis M. We give an algorithm for decomposing M into "irreducible components" which are attached to each other along "fin curves". The attaching cannot be described by a tree structure as in the 2D case. However, a simplified but topologically equivalent medial structure ¿ M with the same irreducible components can be described by a two level tree structure. The top level describes the simplified form of the attaching, and the second level tree structure for each irreducible component specifies how to construct the component by attaching smooth medial sheets to the network of Y-branch curves. The conditions for these structures are complete in the sense that any region whose Blum medial axis satisfies the conditions is contractible.
Using Simulation to Validate Style-Specific Architectural Refactoring Patterns
Authors: Zoe Stephenson, John McDermid, Jason Choy
Venue: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop (2006)

When developing a new domain-specific architectural style, there can be uncertainty about the feasibility of using that style. In particular, the HADES architectural style contains refactoring patterns intended to remove undesirable scheduling features such as deadlock and livelock, but these patterns have not yet been validated. We report on the development of a simulator environment to help validate these refactoring patterns and generally demonstrate HADES architectures to non-specialists. The simulator implements the synchronisation and coordination specified by the architecture to help visualise the behaviour of the otherwise static architectural descriptions. We found simulation to be a useful tool in both visualising complex interaction semantics and in validating refactoring patterns.
A new approach to very low-rate speech coding using temporal decomposition
Authors: S. Ghaemmaghami, M. Deriche
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

Temporal decomposition (TD) is a method to reduce the correlation between speech spectral parameter sets using orthogonalization. The resulting parameters (so-called weightings or target vectors) correspond, mostly, to least-dependent phonetic states, which produce the desired sounds. Other phonetic states can be interpreted as transition states which force the event functions to overlap. On the basis of this assumption, we propose to approximate the event functions by sample functions to focus on the phonetically important states, and to use the resulting parameters for constructing a very low-rate speech coder. The objective and subjective evaluation of synthesized speech, mostly from the intelligibility view point, confirm the assumptions made on the events.
On underdetermined source separation
Authors: A. Taleb
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

This paper discusses some theoretical results on underdetermined source separation, i.e. when the mixing matrix is degenerate, especially when there is more sources than observations. In this case, we show that the sources can be restored up to an arbitrary additive random vector. In the particular case of discrete sources, very relevant for digital communications, we show that this vector is certain.
Efficient Registration of 3D SPHARM Surfaces
Authors: Li Shen, Heng Huang, Fillia Makedon, Andrew J. Saykin
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

We present SHREC, an efficient algorithm for registration of 3D SPHARM (spherical harmonic) surfaces. SHREC follows the iterative closest point (ICP) registration strategy, and alternately improves the surface correspondence and adjusts the object pose. It establishes the surface correspondence by aligning the underlying SPHARM parameterization. It employs a rotational property of the harmonic expansion to accelerate its step for parameterization rotation. It uses a hierarchical icosahedron approach to sample the rotation space and searches for the best parameterization that matches the template. Our experimental results show that SHREC can not only create more accurate registration than previous methods but also do it efficiently. SHREC is a simple, efficient and general registration method, and has a great potential to be used in many shape modeling and analysis applications.
A Distributed Query Protocol in Wireless Sensor Networks
Authors: Jang-Ping Sheu, Shin-Chih Tu, Chia-Hao Yu
Venue: Wireless Personal Communications: An International Journal (2007)

In wireless sensor networks, query execution over a specific geographical region is an essential function for collecting sensed data. However, sensor nodes deployed in sensor networks have limited battery power. Hence, the minimum number of connected sensor nodes that covers the queried region in a sensor network must be determined. This paper proposes an efficient distributed protocol to find a subset of connected sensor nodes to cover the queried region. Each node determines whether to be a sensing node to sense the queried region according to its priority. The proposed protocol can efficiently construct a subset of connected sensing nodes and respond the query request to the sink node. In addition, the proposed protocol is extended to solve the k-coverage request. Simulation results show that our protocol is more efficient and has a lower communication overhead than the existing protocol.
MATHsAiD: A Mathematical Theorem Discovery Tool
Authors: Roy L. McCasland Alan Bundy
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

In the field of automated reasoning, one of the most challenging (even if, perhaps, somewhat overlooked) problems thus far has been to develop a means of discerning, from amongst all the truths that can be discovered and proved, those which are either useful or interesting enough to be worth recording. As for human reasoning, mathematicians are well known for their predilection towards designating certain discoveries as theorems, lemmas, corollaries, etc., whilst relegating all others as relatively unimportant. However, precisely how mathematicians determine which results to keep, and which to discard, is perhaps not so well known. Nevertheless, this practice is an essential part of the mathematical process, as it allows mathematicians to manage what would otherwise be an overwhelming amount of knowledge. MATHsAiD is a system intended for use by research mathematicians, and is designed to produce high quality theorems, as recognised by mathematicians, within a given theory. The only input required is a set of axioms and definitions for each theory. In this paper we briefly describe some of the more important methods used by MATHsAiD, most of which are based primarily on the human mathematical process.
The Tcl extension architecture
Authors: Brent Welch, Michael Thomas
Venue: Proceedings of the 7th conference on USENIX Tcl/Tk - Volume 7 (2000)

This paper describes goals and current state of the Tcl Extension Architecture (TEA). The goal of TEA is to create a standard for Tcl extensions that makes it easier to build, install, and share Tcl extensions. In its current form, TEA specifies a standard compilation environment for Tcl and its extensions. The standard uses autoconf, configure and make on UNIX and Windows. A longer term goal is to create an infrastructure that supports network distribution and installation of Tcl extensions. A standard build environment is a necessary first step to support automated compilation and distribution of extensions. This paper describes the current state of TEA, but we expect to continue to refine the standard and add to it as we gain experience with it.
Gibbs sampling approach for generation of truncated multivariate Gaussian random variables
Authors: J. H. Kotecha
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

In many Monte Carlo simulations, it is important to generate samples from given densities. Researchers in statistical signal processing and related disciplines have shown increased interest for a generator of random vectors with truncated multivariate normal probability density functions (PDFs). A straightforward method for their generation is to draw samples from the multivariate normal density and reject the ones that are outside the acceptance region. This method, which is known as rejection sampling, can be very inefficient, especially for high dimensions and/or relatively small supports of the random vectors. We propose an approach for generation of vectors with truncated Gaussian densities based on Gibbs sampling, which is simple to use and does not reject any of the generated vectors.
An Evidentiary Study of the Uses of Automated Behavioral Monitoring
Authors: Anthony P. Glascock, David M. Kutzik
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

A series of evidence-based studies in Europe and the US have been undertaken to systematically collect information on how a particular behavioral monitoring system is used to provide care to elderly and frail individuals. Findings indicate that the system is effective in providing actionable information to care providers, while being easily incorporated into existing care models.
A maintenance oriented Framework for software components characterization
Authors: Pasquale Ardimento, Giovanni Bruno, Danilo Caivano, Giuseppe Visaggio
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

Following to the increased size and complexity of software products, a single application is commonly made up of components produced by different developers using different practices. Components can be of different kinds: COTS (Commercial Off-the-Shelf), Open Source (OS), developed in-home, etc. Use of components places new questions and this paper determines a component's maintainability through a framework for software components characterization. It supports a software engineer in selecting components to integrate in a software system. The framework includes three sets of characterization parameters: the first for all types of components; the second and third set for white box and OS components. The framework has been evaluated through an empirical study on two industrial projects. Results are interesting: several of the characteristics included in the framework are correlated and are unable to characterize the system maintainability. These findings seem disappointing although interesting and stimulate further research within component based development.
Enhancing engineering education through distributed virtual reality
Authors: T. Sulbaran
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Visual interaction can greatly change the way engineering is performed both in learning new materials and in terms of explaining activities between practicing professionals. The paper presents a study to develop and assess distributed virtual reality (DVR) for engineering education. Strategic key criteria are presented followed with the development and assessment of a DVR tool that allows the evaluation of learner issues such as: reading/following instructions, navigation, interaction, responsiveness, knowledge transfer, engagement and acceptance. The results suggest that DVR has the potential for enhancing engineering education. More extensive DVR development and assessment and international distributed deployment will further our understanding of more precise interactions.
NGN Standards Activities in ETSI
Authors: Tatiana Kovacikova, Pavol Segec
Venue: Proceedings of the Sixth International Conference on Networking (2007)

NGN (Next Generation Network) will bring many benefits to network operators. Operators that deploy it can potentially offer a much wider range of applications and services, to subscribers irrespective of their location, at reduced cost and complexity. NGN will allow operators to increase their revenues through the additional services that can be offered, while their capital expenditure and operation expenses will decrease with their migration from legacy TDM networks to converged network architectures. With the increasing penetration of Wireless Local Area Networks (WLANs) and emerging Wireless Metropolitan Area Networks (WiMax) as access network technologies, the IMS scope is now extended within the ongoing Release 7 standardization for any IP access network, including fixed access networks, i.e. DSL (Digital Subscriber Line). Particular the later aspect has also driven NGN standardization bodies, such as ETSI (European Telecommunications Standards Institute) and ITU-T (International Telecommunications Union -- Telecommunications Sector) to consider the IMS as an important service control platform for their NGN standards. The following sections provide the standards activities of the TC TISPAN in the area of NGN including the brief description of the TISPAN and its structure, NGN architecture principles and functions as well as the steps in the standardization path towards the full NGN.
Hardware architecture for real-time distance transform
Authors: J. H. Takala
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

A distance transform (DT) converts a binary image consisting of foreground (feature) and background (non-feature) pixels into a gray level image where each pixel contains the distance from the corresponding pixel to the nearest foreground pixel. The computation of the exact Euclidean DT is computationally complex task and, therefore, approximations are typically utilized. An area-efficient architecture for computing a DT approximation is presented. The architecture utilizes order-based encoded distance representation allowing simple bitwise operations to be used for determining the distance to the nearest foreground pixel in the constrained neighborhood. Tabulated distance values are used thus cumulative errors are avoided. Due to the simple operations real-time operation can be expected.
A fuzzy evolutionary approach with Taguchi parameter setting for the set covering problem
Authors: Jingpeng Li, R. S. K. Kwan
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

The set covering problem has a very wide area of applications, and scheduling is one of its most important applications. At CEC2001, a fuzzy simulated evolution algorithm was reported for a set covering problem in bus and rail driver scheduling. This paper reports on the generalisation of the approach to the class of set covering, which is basically to cover the rows of a zero-one matrix with a subset of columns at minimal cost. The simulated evolution method iteratively transforms a single solution treating its selected columns as a population. At each iteration a portion of the population is probabilistic ally, biased towards selecting the 'weaker' columns, discarded; and the broken solution is then reconstructed by means of a greedy heuristic. The columns are evaluated under several criteria formulated based on fuzzy set theory. The set of weights associated with the evaluation criteria were previously either fixed in advance or calibrated by means of a simplified genetic algorithm. In this paper, we consider some discrete levels of values instead of a continuous range from 0 to 1 for each weight. We have also included two other parameters driving the evolutionary process as additional factors having some discrete levels of values. Taguchi's orthogonal experimental design is applied. This has the effect of comprehensively evaluating the combinations of factors, although only a small fraction of the possible combinations is explicitly experimented. Better results have been obtained, and comparisons with those previously reported are discussed.
On the implementation of the advanced encryption standard on a public-key crypto-coprocessor
Authors: Antonio Valverde Garcia, Jean-Pierre Seifert
Venue: Proceedings of the 5th conference on Smart Card Research and Advanced Application Conference - Volume 5 (2002)

This paper describes how to implement the new Advanced Encryption Standard (AES) using a modular arithmetic crypto-coprocessor, typically used to speed up public-key crypto-systems. This idea provides a fast and secure AES implementation when a dedicated hardware AES module is not available. The advantages of using the modular arithmetic coprocessor when compared to a pure software implementation are: • much higher execution performance, • less memory usage, and • optimized protection against side-channel attacks.