ppxscal/embedding_network huggingface dataset:
Group-aware Stream Filtering
Authors: Ming Li, David Kotz
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

In this paper we are concerned with disseminating high-volume data streams to many simultaneous context-aware applications over a low-bandwidth wireless mesh network. For bandwidth efficiency, we propose a group-aware stream filtering approach, used in conjunction with multicasting, that exploits two overlooked, yet important, properties of these applications: 1) many applications can tolerate some degree of "slack" in their data quality requirements, and 2) there may exist multiple subsets of the source data satisfying the quality needs of an application. We can thus choose the "best alternative" subset for each application to maximize the data overlap within the group to best benefit from multicasting. An evaluation of our prototype implementation shows that group-aware data filtering can save bandwidth with low CPU overhead.
LES and DES of High Reynolds Number, Supersonic Base Flows with Control of the Near Wake
Authors: J. Sivasubramanian, H. F. Fasel
Venue: Proceedings of the HPCMP Users Group Conference (2006)

The drag associated with supersonic base flows is of critical importance for the design of aerodynamic bodies, such as missiles and projectiles. The base drag which accounts for a significant part of the total drag, that may be reduced by means of active and passive control of the near wake. There is evidence that large (turbulent) coherent structures evolve in these flows and strongly influence the mean flow. Therefore, in order to understand the dynamics of coherent structures in the wake and how flow control mechanisms modify these structures, numerical simulations were conducted. We performed Large-Eddy Simulations (LES) based on the Flow Simulation Methodology (FSM) for a Reynolds number of ReD = 100,000 and Mach number M = 2.46 using a high-order accurate research code, which was developed at the University of Arizona. Flow control mechanisms that alter the near wake by introducing axisymmetric and three-dimensional perturbations, thus emulating active and passive flow control were investigated. We also studied supersonic base flows at Reynolds number ReD = 3,300,000 and Mach number M = 2.46 using Detached-Eddy Simulations (DES). These investigations were performed using the commercial CFD-code Cobalt. In addition, for the same Reynolds number, we investigated Passive flow control using afterbody boat-tailing. Our results are compared to available experimental data.
Chatterer Ping-pong Table
Authors: Shigeki DOI, Yasuhiro KAWADA, Satoshi FUJII
Venue: Proceedings of the The First IEEE International Workshop on Digital Game and Intelligent Toy Enhanced Learning (2007)

An intelligent ping-pong table is proposed in this paper, which can detect the position where the ball has dropped. The sensing system is constructed with piezoelectric sensors, an A-D converter, and a personal computer. Piezoelectric sensors are arranged in the four corners of the acrylic boards of the ping-pong table for sensing the dropped position. The system controls the illumination and the sound effect for the position where the ball dropped. The illumination and the sound effect are expectable for exiting the game. The position detecting method can be applied for sensing the position on a plane.
How Students Perceive Risk: A Study of Senior Capstone Project Teams
Authors: Dennis P. Groth, Matthew P. Hottell
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

One view of software engineering project management is that it is the portion of a project that is involved with managing tasks, resources, assignments and deadlines. Certainly, many of the daily activities for a software project manager might be categorized in such a way; however, these activities merely serve as surrogates for the principal responsibility of the project manager: risk management. Risk management includes identification, analysis, and mitigation of risks that, should the risks materialize, have the potential for negatively impacting the completion of a project. In this paper we approach the problem of risk management for IT projects from the perspective of the developers, and pursue an understanding of how student developers perceive project risks using Tiwana and Keil's "One-Minute Risk Assessment Tool". We present the results of a study of perceived project risk for different IT projects completed by more than 50 senior undergraduate students during the 2005/2006 academic year.
The reduced scalar potential in regions with permeable materials: Reasons for loss of accuracy and cancellation: Research Articles
Authors: S. Balac, G. Caloz
Venue: International Journal of Numerical Modelling: Electronic Networks, Devices and Fields (2007)

Practical three-dimensional magnetic field problems usually involve regions containing current sources as well as regions with magnetic materials. For computational purposes, the use of the reduced scalar potential (RSP) as unknown has the advantage to transform a problem for a vector field throughout the space into a problem for a scalar function, thus reducing the number of degrees of freedom in the discretization. However, in regions with high magnetic permeability the use of the RSP alone usually results in severe loss in accuracy and it is recommended to use both the RSP and the total scalar potential. Using an asymptotic expansion, we investigate theoretically the underlying reasons for this lack of accuracy in permeable regions when using the RSP as a unique potential. Moreover, this investigation leads to an efficient numerical method to compute the magnetic field in regions with high magnetic permeability. Copyright &copy; 2007 John Wiley & Sons, Ltd.
NLPBench: A Tool for Studying the Architectural Characteristics of Natural Langauge and Speech Applications
Authors: Arijit Mukhopadhyay
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

The study of architectures for Natural Language and Speech applications has been necessitated by the large scale proliferation of such applications into desktop and embedded computers. This paper proposes NLPBench a benchmark for analyzing statistical Natural Language applications. This study validates the need for such a benchmark by demonstrating the lack of such applications in the currently existing benchmarks. A comparison between architectural characteristics of the applications in NLPBench is done with currently existing benchmarks to further prove the need for such a benchmark.
CollaborationBus: An Editor for the Easy Configuration of Ubiquitous Computing Environments
Authors: Tom Gross, Nicolai Marquardt
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

Early sensor-based infrastructures were often developed by experts with a thorough knowledge of base technology for sensing information, for processing the captured data, and for adapting the system's behaviour accordingly. In this paper we introduce the CollaborationBus application: a graphical editor that provides abstractions from base technology and thereby allows experts as well as non-experts to configure Ubiquitous Computing environments. By composing pipelines users can easily specify the information flows from selected sensors, via optional filters for processing the sensor data, to actuators changing the system behaviour according to their wishes. Users can compose pipelines for both home and work environments. An integrated sharing mechanism allows them to share their own compositions and to reuse and build upon others' compositions. Real-time visualisations help them understand the information flows through their pipelines. In this paper we present the concept and implementation of the CollaborationBus application.
Efficient algorithms for regular expression constrained sequence alignment
Authors: Yun-Sheng Chung, Chin Lung Lu, Chuan Yi Tang
Venue: Information Processing Letters (2007)

Imposing constraints is an effective means to incorporate biological knowledge into alignment procedures. As in the PROSITE database, functional sites of proteins can be effectively described as regular expressions. In an alignment of protein sequences it is natural to expect that functional motifs should be aligned together. Due to this motivation, Arslan introduced the regular expression constrained sequence alignment problem and proposed an algorithm which, if implemented naively, can take time and space up to O(|@S|^2|V|^4n^2) and O(|@S|^2|V|^4n), respectively, where @S is the alphabet, n is the sequence length, and V is the set of states in an automaton equivalent to the input regular expression. In this paper we propose a more efficient algorithm solving this problem which takes O(|V|^3n^2) time and O(|V|^2n) space in the worst case. If |V|=O(logn) we propose another algorithm with time complexity O(|V|^2log|V|n^2). The time complexity of our algorithms is independent of @S, which is desirable in protein applications where the formulation of this problem originates; a factor of |@S|^2=400 in the time complexity of the previously proposed algorithm would significantly affect the efficiency in practice.
Key distribution for secure multimedia multicasts via data embedding
Authors: W. Trappe
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

The problem of controlling access to multimedia multicasts requires the distribution and maintenance of keying information. The conventional approach to distributing keys is to use a channel independent of the multimedia content. We propose a second approach that involves the use of a data-dependent channel, and can be achieved for multimedia by using data embedding techniques. Using data embedding to convey rekeying messages can provide an additional layer of security when compared with the traditional approach. We then introduce multicast key distribution, and employ a recent tree-based key distribution scheme to exhibit the factors involved in transmitting keys using data embedding.
Triple positive solutions of three-point boundary value problems for p-Laplacian dynamic equations on time scales
Authors: Shihuang Hong
Venue: Journal of Computational and Applied Mathematics (2007)

In this paper, we present sufficient conditions for the existence of at least three positive solutions of three-point boundary value problems for p-Laplacian dynamic equations on a time scale. To show our main results, we apply a new fixed point theorem due to Avery and Peterson [Three positive fixed points of nonlinear operators on ordered Banach spaces, Comput. Math. Appl. 42 (2001) 313-322].
Transparent network security policy enforcement
Authors: Angelos D. Keromytis, Jason L. Wright
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

Recent work in the area of network security, such as IPsec, provides mechanisms for securing the traffic between any two interconnected hosts. However, it is not always possible, economical, or even practical from an administration and operational point of view to upgrade the software and configuration of all the nodes in a network to support such security protocols. One apparent solution to this problem is the use of security gateways that apply the relevant security protocols on behalf of the protected nodes, under the assumption that the "last hop" between the security gateway and the end node is safe without cryptography. Such a gateway can be set to enforce specific security policies for different types of traffic. While this solution is appealing in static scenarios (such as building so-called "intranets"), the use of Layer-3 (network) routers as security gateways presents some transparency and configuration problems with regards to peer authentication in the automated key management protocol. This paper describes the architecture and implementation of a Layer-2 (link layer) bridge with extensions for offering Layer-3 security services. We extend the OpenBSD ethernet bridge to perform simple IP packet filtering and IPsec processing for incoming and outgoing packets on behalf of a protected node, completely transparently to both the protected and the remote communication endpoint. The same mechanism may be used to construct "virtual local area networks," by establishing IPsec tunnels between OpenBSD bridges connected geographically separated LANs. As our system operates in the link layer, there is no need for software or configuration changes in the protected nodes.
Conditions of optimality of the divisional, the functional, and the matrix hierarchy of control
Authors: S. P. Mishin
Venue: Automation and Remote Control (2007)

The model is considered of the multilevel hierarchical structure that controls a few "production lines" (sequential business-processes) with functional links by the kinds of performed operations. In the framework of the model many effects are investigated, which take place in practice, in particular, the dependence of optimality of the divisional, the functional, and the matrix hierarchy on the instability of the environment, the degree of standardization, the intensity of functional links, the horizontal and the vertical integration, etc.
A UML Based System Level Failure Rate Assessment Technique for SoC Designs
Authors: Mohammad Hosseinabady, M. H. Neishaburi, Pejman Lotfi-Kamran, Zainalabedin Navabi
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

This paper proposes an analytical method to assess soft-error rate (SER) in the early stages of a System-on-Chip (SoC) platform-based design methodology. The proposed method uses an executable UML model of the SoC for its input. Soft-errors on the design are modeled by disturbances on the value of attributes in the classes of the UML model and disturbances on opcodes of software cores. SER and execution time of each core in the SoC and a Failure Modes and Effects Analysis (FMEA) that determines the severity of each failure mode in the SoC are used to compute the System- Failure Rate (SFR) of the SoC.
Analysing evolvable cell design for optimisation of routing options
Authors: Daniel M. Ellin, Stuart J. Flockton
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

Evolution of analogue circuitry on a cell based system can benefit from the use of a generic cell design. A comparative analysis of the re-routing ability of two different cell topologies is used to highlight the difficulty of assessing a generic cell design's fitness for purpose. An analytical method is then proposed for the production of suitable comparable data.
The Cost of Punctuality
Authors: Patricia Bouyer, Nicolas Markey, Joel Ouaknine, James Worrell
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

In an influential paper titled "The Benefits of Relaxing Punctuality" [2], Alur, Feder, and Henzinger introduced Metric Interval Temporal Logic (MITL) as a fragment of the real-time logic Metric Temporal Logic (MTL) in which exact or punctual timing constraints are banned. Their main result showed that model checking and satisfiability for MITL are both EXPSPACE-Complete. Until recently, it was widely believed that admitting even the simplest punctual specifications in any linear-time temporal logic would automatically lead to undecidability. Although this was recently disproved, until now no punctual fragment of MTL was known to have even primitive recursive complexity (with certain decidable fragments having provably non-primitive recursive complexity). In this paper we identify a "co-flat' subset of MTL that is capable of expressing a large class of punctual specifications and for which model checking (although not satisfiability) has no complexity cost over MITL. Our logic is moreover qualitatively different from MITL in that it can express properties that are not timed-regular. Correspondingly, our decision procedures do not involve translating formulas into finite-state automata, but rather into certain kinds of reversal-bounded Turing machines. Using this translation we show that the model checking problem for our logic is EXPSPACE-Complete
A scalable genetic algorithm for the rectilinear Steiner problem
Authors: B. A. Julstrom
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

The rectilinear Steiner problem seeks the shortest tree made up of horizontal and vertical line segments that connects a set of points in the plane. The extra points where the segments meet are called Steiner points. Evolutionary algorithms for this problem have encoded rectilinear Steiner trees by extending codings of spanning trees to specify Steiner point choices for the spanning tree edges. These algorithms have been slow and have performed poorly on larger problem instances. The genetic algorithm presented here searches only the space of Steiner point assignments to the edges of a minimum rectilinear spanning tree. In tests on 45 instances of the rectilinear Steiner problem, it returns good, though never optimal, trees. The algorithm scales well; it evaluates chromosomes in time that is linear in the number of points, and its performance does not deteriorate as that number increases.
Visualization and exploration of time-varying medical image data sets
Authors: Zhe Fang, Torsten Möller, Ghassan Hamarneh, Anna Celler
Venue: Proceedings of Graphics Interface 2007 (2007)

In this work, we propose and compare several methods for the visualization and exploration of time-varying volumetric medical images based on the temporal characteristics of the data. The principle idea is to consider a time-varying data set as a 3D array where each voxel contains a time-activity curve (TAC). We define and appraise three different TAC similarity measures. Based on these measures we introduce three methods to analyze and visualize time-varying data. The first method relates the whole data set to one template TAC and creates a 1D histogram. The second method extends the 1D histogram into a 2D histogram by taking the Euclidean distance between voxels into account. The third method does not rely on a template TAC but rather creates a 2D scatter-plot of all TAC data points via multi-dimensional scaling. These methods allow the user to specify transfer functions on the 1D and 2D histograms and on the scatter plot, respectively. We validate these methods on synthetic dynamic SPECT and PET data sets and a dynamic planar Gamma camera image of a patient. These techniques are designed to offer researchers and health care professionals a new tool to study the time-varying medical imaging data sets.
e-SAFE: An Extensible, Secure and Fault Tolerant Storage System
Authors: Sandip Agarwala, Arnab Paul, Umakishore Ramachandran, Karsten Schwan
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

This paper describes e-SAFE , a scalable utility-driven distributed storage system that offers very high availability at an archival scale and reduces management overhead such as periodic repairs. e-SAFE is designed to provide a storage utility for environments such as large-scale data centers in enterprise networks where the servers experience temporary unavailability (possibly high load, temporary downtimes due to repair or software/hardware upgrades). e-SAFE is based on a simple principle: efficiently sprinkle data all over a distributed storage and robustly reconstruct even when many of them are unavailable. e-SAFE also provides strong guarantee on data-integrity. The use of Fountain codes for replicating file data blocks, an efficient algorithm for fast parallel encoding and decoding over multiple file segments, a utility module for service differentiation and auto-adjustments of design parameters, and a background replication mechanism hiding the cost of replication and dissemination from the user, provide a fast, durable and autonomous storage solution.
A Fuzzy Constraint-Directed Autonomous Learning to Support Agent Negotiation
Authors: Ting-Jung Yu, K. Robert Lai, Menq-Wen Lin, Bo-Rue Kao
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

This work presents a general framework of agent negotiation with autonomous learning via fuzzy constraint-directed approach. The fuzzy constraint-directed approach involves the fuzzy probability constraint where each fuzzy constraint has a certain probability, and the fuzzy instance reasoning where each instance is represented as a primitive fuzzy constraint network. The proposed approach via fuzzy probability constraint can not only cluster the opponent's information in negotiation process as proximate regularities to increase the efficiency on the convergence of behavior patterns, but also eliminate the bulk of false hypotheses or beliefs to improves the effectiveness on beliefs learning. By using fuzzy instance method, our approach can reuse the prior opponent knowledge to speed up problem-solving, and reason the proximate regularities to acquire desirable results on predicting opponent behavior. Besides, the proposed interaction method enables the agent to make a concession dynamically based on expected objectives. Moreover, experimental results suggest that the proposed framework allowed an agent to achieve a higher reward, fairer deal, or less cost of negotiation.
UGC 2006 Abstracts Author List
Venue: Proceedings of the HPCMP Users Group Conference (2006)

Abstracts Author List
An Efficient Parallel Algorithm for Vector Quantizer Design
Authors: Jianhua Lin
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

Vector quantization is a technique used extensively and successfully to compress digitized data such as speech and images. The design of a vector quantizer is very computationally intensive. Parallel algorithms based on various architectures have been proposed for related applications in clustering. These algorithms are in general not practical for the vector quantization problem because of the magnitude of the parameters involved. We present a parallel SIMD algorithm which can run efficiently on parallel machines of variable sizes. The speedup and efficiency of the algorithms are high across a wide range of input parameters. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A memetic algorithm instantiated with selection sort consistently finds global optima for the error-correcting graph isomorphism
Authors: R. Torres-Velazquez, V. Estivill-Castro
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

We study several tested cases of the error-correcting graph isomorphism problem. The set Sn of n! permutations on n items is the search space for this optimization problem. We apply MA-sorting. This is a memetic algorithm with domain-independent mutation operators based on classical sorting. Each sorting algorithm works on results to a comparison predicate and defines a path in SI.,. In MA-sorting the mutation operator is a local-search that evaluates permutations suggested by the sorting algorithm. When such evaluation results in an improvement, the mutation is accepted and the comparison operator of the sorting algorithm evaluates to true. In contrast with previous proposals, our MA-sorting instantiated with selection sort finds optimal solutions for this case study.