ppxscal/embedding_network huggingface dataset:
Wizard of Oz Support throughout an Iterative Design Process
Authors: Steven Dow, Blair MacIntyre, Jaemin Lee, Christopher Oezbek, Jay David Bolter, Maribeth Gandy
Venue: IEEE Pervasive Computing (2005)

Although the Wizard of Oz method for simulating system components is commonly used for evaluation in human-computer interaction, researchers and designers have only started to unlock this technique's potential. This article reviews the WOz method, highlights its usefulness throughout the evolution of a user interface or system, and argues that explicitly supporting WOz prototyping in pervasive computing infrastructures will improve the method's usefulness. The authors describe a design space for WOz simulation in which the wizard takes on controller, moderator, and supervisor roles. They also describe the WOz simulation features of DART, a mixed-reality design and prototyping environment, including a lightweight method for automatically generating WOz interfaces and high-level support for visualizing evaluation results. Finally, the authors use a location-aware audio experience in Atlanta's historic Oakland Cemetery as a case study to illustrate how a wizard operator can play distinct roles throughout an iterative design process.This article is part of a special issue on rapid prototyping.
Intelligent Task Composition and Allocation through Agents
Authors: Alessandro Negri, Agostino Poggi, Michele Tomaiuolo
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

In this paper we present GAIN (Grid Agent INfrastructure), a multi-agent system that can be used for the development and deployment of flexible agentbased Grid systems. Through the use of the agents jointly with the workflow and Web service technologies, we are able to support the users in the development and execution of Grid applications. In particular, the GAIN system allows the definition of workflow applications by composing heterogeneous tasks and follows the different phases of the workflow execution, providing transparent allocation of the tasks on the different nodes of the Grid. A first prototype of the system has been completed using the JADE agent development software and also some lab trials have been executed involving a small network of different JADE platforms.
An elevator problem
Authors: Thomas J. Schriber
Venue: ACM SIGSIM Simulation Digest (1975)

The elevator problem was composed by the Problem Corner editor for use in an introductory simulation course offered regularly at The University of Michigan. What appears here is an exact copy of the problem statement as handed out to the students. Hence, interested SIMULETTER readers who teach simulation might be able to use this problem statement, without modification, in their teaching. The problem was designed for GPSS implementation [it is appropriate for students who have finished the first five chapters in <u>Simulation Using GPSS</u> (Wiley & Sons, 1974)], but of course can also be modeled in GASP, or SIMSCRIPT, or SIMULA, etc.
Provisioning Link Layer Proportional Service Differentiation in Wireless Networks with Smart Antennas
Authors: Ashish Deopura, Aura Ganz
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

In this paper, we present a collision free MAC protocol for wireless networks with smart antennas that provides proportional service differentiation to various classes of traffic based on their respective bandwidth demand. The proposed protocol works for diverse physical parameters such as number of interfaces at each node, number of communication frequencies, and antenna beamwidth. To the best of our knowledge, this is the first work that provides link layer differentiated services for wireless networks with smart antennas and explores the influence of the physical parameters and network topology on the performance of the MAC layer.
AMUN: an autonomic middleware for the Smart Doorplate Project
Authors: Wolfgang Trumler, Jan Petzold, Faruk Bagci, Theo Ungerer
Venue: Personal and Ubiquitous Computing (2005)

We envision future office buildings that partly or fully implement a flexible office organization where office rooms are dynamically assigned to currently present employees. Such organizational principles save required office space, therefore decrease costs, but require a sophisticated software system that is highly dynamic, scalable, context-aware, self-configuring, self-optimizing and self-healing. We propose an autonomic/organic middleware approach for such ubiquitous indoor environments with an extensive monitoring at different system levels and demonstrate the software by using our Smart Doorplate Project that is designed to support a flexible office organization.
Dynamic Scheduling of Nested Loops with Uniform Dependencies in Heterogeneous Networks ofWorkstations
Authors: Ioannis Riakiotakis, Panagiotis Tsanakas
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

Static algorithms have been proposed to parallelize loops with uniform dependencies for networks of workstations. However, the heterogeneous and dynamic nature of these networks demands a dynamic solution to the scheduling and load balancing problem. At the same time many dynamic scheduling algorithms have been proposed, but all of them are dealing with programs with parallel loops, i.e. loops without dependencies. In this work we extend the applicability of dynamic algorithms by presenting a dynamic scheduling algorithm that uses simple data structures in order to handle programs with data dependencies. Experimental results validate the proposed algorithm in both homogeneous and heterogeneous networks
DAOmap: a depth-optimal area optimization mapping algorithm for FPGA designs
Authors: D. Chen, J. Cong
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

In This work we study the technology mapping problem for FPGA architectures to minimize chip area, or the total number of lookup tables (LUTs) of the mapped design, under the chip performance constraint. This is a well-studied topic and a very difficult task (NP-hard). The contributions of This work are as follows: (i) we consider the potential node duplications during the cut enumeration/generation procedure so the mapping costs encoded in the cuts drive the area-optimization objective more effectively; (ii) after the timing constraint is determined, we will relax the non-critical paths by searching the solution space considering both local and global optimality information to minimize mapping area; (iii) an iterative cut selection procedure is carried out that further explores and perturbs the solution space to improve solution quality. We guarantee optimal mapping depth under the unit delay model. Experimental results show that our mapping algorithm, named DAOmap, produces significant quality and runtime improvements. Compared to the state-of-the-art depth-optimal, area minimization mapping algorithm CutMap (Cong and Hwan, 1995), DAOmap is 16.02% better on area and runs 24.2X faster on average when both algorithms are mapping to FPGAs using LUTs of five inputs. LUTs of other inputs are also used for comparisons.
Solving the pooling problem using generalized reduced gradient and successive linear programming algorithms
Authors: L. S. Lasdon, A. D. Waren, S. Sarkar, F. Palacios
Venue: Issue 27 (July 1979) (1979)

In earlier issues of this bulletin, Haverly and Hart discussed solving some simple pooling problems using LP recursion [1]-[3]. We thought it would be interesting to attempt to solve these problems using some nonlinear programming (NLP) codes. This note briefly discusses the codes and algorithms used, presents the results, and discusses some properties of the models.
Ladder queue: An O(1) priority queue structure for large-scale discrete event simulation
Authors: Wai Teng Tang, Rick Siow Mong Goh, Ian Li-Jin Thng
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2005)

This article describes a new priority queue implementation for managing the pending event set in discrete event simulation. Extensive empirical results demonstrate that it consistently outperforms other current popular candidates. This new implementation, called Ladder Queue, is also theoretically justified to have O(1) amortized access time complexity, as long as the mean jump parameter of the priority increment distribution is finite and greater than zero, regardless of its variance. Many practical priority increment distributions satisfy this condition including unbounded variance distributions like the Pareto distribution. This renders the LadderQ the ideal discrete event queue structure for stable O(1) performance even under practical queue distributions with infinite variance. Numerical simulations ranging from 100 to 10 million events affirm the O(1) property of LadderQ and that it is a superior structure for large-scale discrete event simulation.
Semi-Supervised Clustering with Metric Learning Using Relative Comparisons
Authors: Nimit Kumar, Krishna Kummamuru, Deepa Paranjpe
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Semi-supervised clustering algorithms partition a given data set using limited supervision from the user. In this paper, we propose a clustering algorithmthat uses supervision in terms of relative comparisons, viz., is closer to than to . The success of a clustering algorithm also depends on the kind of dissimilarity measure. The proposed clustering algorithm learns the underlying dissimilarity measure while finding compact clusters in the given data set. Through our experimental studies on high-dimensional textual data sets, we demonstrate that the proposed algorithm achieves higher accuracy than the algorithms using pairwise constraints for supervision.
Data mining using rule extraction from Kohonen self-organising maps
Authors: James Malone, Kenneth McGarry, Stefan Wermter, Chris Bowerman
Venue: Neural Computing and Applications (2006)

The Kohonen self-organising feature map (SOM) has several important properties that can be used within the data mining/knowledge discovery and exploratory data analysis process. A key characteristic of the SOM is its topology preserving ability to map a multi-dimensional input into a two-dimensional form. This feature is used for classification and clustering of data. However, a great deal of effort is still required to interpret the cluster boundaries. In this paper we present a technique which can be used to extract propositional IF..THEN type rules from the SOM network&#x2019;s internal parameters. Such extracted rules can provide a human understandable description of the discovered clusters.
Acute Triangulations of Polygons
Authors: Ileana Streinu
Venue: Discrete Computational Geometry (2005)

This paper proposes a combinatorial approach to planning non-colliding trajectories for a polygonal bar-and-joint framework with n vertices. It is based on a new class of simple motions induced by expansive one-degree-of-freedom mechanisms, which guarantee noncollisions by moving all points away from each other. Their combinatorial structure is captured by pointed pseudo-triangulations, a class of embedded planar graphs for which we give several equivalent characterizations and exhibit rich rigidity theoretic properties. The main application is an efficient algorithm for the Carpenter&#x2019;s Rule Problem: convexify a simple bar-and-joint planar polygonal linkage using only non-self-intersecting planar motions. A step of the algorithm consists in moving a pseudo-triangulation-based mechanism along its unique trajectory in configuration space until two adjacent edges align. At the alignment event, a local alteration restores the pseudo-triangulation. The motion continues for O(n3) steps until all the points are in convex position.
Hyperbolic fixed points are typical in the space of mixing operators for the infinite population genetic algorithm
Authors: Christina Hayes, Tomáš Gedeon
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

We study an infinite population model for the genetic algorithm, where the iteration of the algorithm corresponds to an iteration of a map G. The map G is a composition of a selection operator and a mixing operator, where the latter models effects of both mutation and crossover. We examine the hyperbolicity of fixed points of this model. We show that for a typical mixing operator all the fixed points are hyperbolic.
Drazin Inverse and Periodic Collection of Matrices
Authors: Begoña Cantó, Carmen Coll, Elena Sánchez
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

This paper is concerned with weakly $N$-cyclic matrices and their Drazin inverses. In this study an $N$-periodic collection of monodromy matrices is used. It is shown that the Drazin inverses of these matrices at consecutive times are related. An explicit expression for the Drazin inverse of a weakly $N$-cyclic matrix is given. Finally, the Drazin inverse of a weakly $N$-cyclic matrix is used to obtain the explicit expression for the solution of an $N$-periodic descriptor system of difference equations in terms of $N$-periodic collections of matrices which are the coefficients of the $N$-periodic system.
An Exploration of the Technology Space for Multi-Core Memory/Logic Chips for Highly Scalable Parallel Systems
Authors: Peter M. Kogge
Venue: Proceedings of the Innovative Architecture on Future Generation High-Performance Processors and Systems (2005)

Chip-level multi-processing, where more than one CPU "core" share the same die with significant parts of the memory hierarchy, is appearing with increasing frequency as standard design practice. This paper takes a broader look at how such mixed logic/memory dies may evolve in the future by walking through the latest CMOS roadmap projections, and casting them in terms of the key chip-level system level building blocks. Given the increasing importance of memory density in such systems, especially as we move to single chip-type designs, we pay particular attention to the potential use of not SRAM but leading edge DRAM for many memory structures. The roles of other factors, such as interconnect and power, is also considered.
Citation analysis of database publications
Authors: Erhard Rahm, Andreas Thor
Venue: ACM SIGMOD Record (2005)

We analyze citation frequencies for two main database conferences (SIGMOD, VLDB) and three database journals (TODS, VLDB Journal, Sigmod Record) over 10 years. The citation data is obtained by integrating and cleaning data from DBLP and Google Scholar. Our analysis considers different comparative metrics per publication venue, in particular the total and average number of citations as well as the impact factor which has so far only been considered for journals. We also determine the most cited papers, authors, author institutions and their countries.
Variability inspired implementation selection problem
Authors: A. Davoodi, V. Khandelwal, A. Srivastava
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

Given a directed acyclic graph and different possible implementations for each node, the implementation selection problem (ISP) selects the appropriate implementation for each node such that a given global design objective is optimized, ISP is a generic formulation that is explicitly or implicitly solved in several design automation problems like leakage optimization using dual V/sub th/, gate sizing, etc. An implementation of a node results in an associated delay and perhaps cost for the node. In the presence of different sources of uncertainty and fabrication variability, fixed estimates of delays and costs of a node are extremely erroneous. We investigate a probabilistic approach to solve ISP by considering probability density functions for delays and costs of a node. We propose a dynamic-programming based approach in a probabilistic sense and introduce effective pruning criteria when dealing with probability distributions for identifying co-optimal solution at each stage. A case study of leakage optimization using dual V/sub th/ is presented where we show the effectiveness of a probabilistic approach considering V/sub th/ variability over a traditional deterministic one.
A Proposal For Relative Time Petri Nets
Authors: Joseph Kuehn, Charles Lakos, Robert Esser
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

Petri nets are a graph-based modelling formalism which has been widely used for the formal specification and analysis of concurrent systems. A common analysis technique is that of state space exploration (or reachability analysis). Here, every possible reachable state of the system is generated and desirable properties are evaluated for each state. This approach has the great advantage of conceptual simplicity, but the great disadvantage of being susceptible to state space explosion, where the number of states is simply too large for exhaustive exploration. Many reduction techniques have been suggested to ameliorate the problem of state space explosion. In the case of timed systems, the state space is infinite, unless analysis is restricted to a bounded time period. In this paper, we present a Petri net formalism based on the notion of relative time (as opposed to the traditional approach of dealing with absolute time). The goal is to derive a finite state space for timed systems which have repeating patterns of behaviour, even though time continues to advance indefinitely.
Postal Address Detection fromWeb Documents
Authors: Lin Can, Zhang Qian, Meng Xiaofeng, Liu Wenyin
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

An approach to postal address detection from webpages is proposed. The webpages are first segmented into text blocks based on their visual similarity. The text content in each block undergoes the recognition process, which employs a syntactic approach. The grammars of almost all possible patterns of postal addresses are built for this purpose. The results of our preliminary experiments on 44 webpages with 56 true addresses show that our approach can detect the postal addresses with a high precision (89.3%) and a low false alarms rate (3.8%).
Nearly optimal three dimensional layout of hypercube networks
Authors: Tiziana Calamoneri, Annalisa Massini
Venue: Networks (2006)

In this article we consider the three-dimensional layout of hypercube networks. Namely, we study the problem of laying hypercube networks out on the three-dimensional grid with the properties that all nodes are represented as rectangular slices and lie on two opposite sides of the bounding box of the layout volume. We present both a lower bound and a layout method, providing an upper bound on the layout volume and the maximum wire-length of the hypercube network. &copy; 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 47(1), 1&ndash;8 2006A preliminary version of this article appeared on the Proc. of the 11th International Symposium on Graph Drawing (GD 2003).
Balancing utility and anonymity in public biomedical databases
Authors: Russ B. Altman
Venue:  (2005)

Interest in understanding how genomic variations influence heritable disease and drug response is intense. Providing unrestricted electronic access to biological and clinical data promotes scientific research. However it risks disclosing the identity and health information of research subjects. These data may contain fingerprint-like unique signatures that can identify people even without links to commonly known identifiers. Thus medical data, especially those containing human genetic information, should only be made public if we can protect the privacy of these research subjects adequately. To address this challenge, I have investigated automatic methods to analyze the disclosure risk of public single nucleotide polymorphism (SNP) databases. Such an analysis depends critically on detailed understanding of patterns of linkage disequilibrium (LD) among SNPs throughout the human genome. Knowledge of this structure allows accurate estimate of the disclosure risk of a SNP database and sufficiently flag records with potentially unacceptable high disclosure risk. Specifically, I have investigated mechanisms for restricting SNPs released publicly and for quantifying their disclosure risk. First, I implemented a metric to quantify the information content in binning, a novel method to reduce the specificity of phenotypes and genotypes like SNPs. The results show that the utility of the binned data becomes minimal at relatively small bin sizes. Therefore, the binning method may be unuseful to protect genome-wide SNP data. I further illustrated that existing data obfuscation methods either are insufficient to prevent disclosure, or ruin information content in the context of the whole-genome SNP analysis. The evaluation on the probability of identifying individuals based on independent SNPs showed that research-use SNP data are highly identifiable, and a small subset of independent SNPs in the genome (30&ndash;80) would lead to a successful individual identification. Finally, to quantify the disclosure risk of SNP databases, I developed principal component analysis and odds ratio test based methods to identifying tagging SNPs from the genome, and applied these methods to experimental datasets with different patterns of LD. The evaluation results shows that the tagging SNPs identified are the ones potentially useful for genotype-phenotype association studies, yet they are also the ones with strong ability to distinguish individuals.
Semantic manifold learning for image retrieval
Authors: Yen-Yu Lin, Tyng-Luh Liu, Hwann-Tzong Chen
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Learning the user's semantics for CBIR involves two different sources of information: the similarity relations entailed by the content-based features, and the relevance relations specified in the feedback. Given that, we propose an augmented relation embedding (ARE) to map the image space into a semantic manifold that faithfully grasps the user's preferences. Besides ARE, we also look into the issues of selecting a good feature set for improving the retrieval performance. With these two aspects of efforts we have established a system that yields far better results than those previously reported. Overall, our approach can be characterized by three key properties: 1) The framework uses one relational graph to describe the similarity relations, and the other two to encode the relevant/irrelevant relations indicated in the feedback. 2) With the relational graphs so defined, learning a semantic manifold can be transformed into solving a constrained optimization problem, and is reduced to the ARE algorithm accounting for both the representation and the classification points of views. 3) An image representation based on augmented features is introduced to couple with the ARE learning. The use of these features is significant in capturing the semantics concerning different scales of image regions. We conclude with experimental results and comparisons to demonstrate the effectiveness of our method.
A novel 3-tier XML schematic approach for web page translation
Authors: Goutam Kumar Saha
Venue: Ubiquity (2005)

The proposed 3-Tier XML schematic approach is to demonstrate how to embed syntactic, semantic and computational linguistic metadata information in the structure of an XML document and how the various markups help in Internationalization and Localization processes toward faster and more meaningful machine translation of Web contents from one human language to another human language. In this approach, an XML content author needs to embed a source human language specific metadata information in an XML document. Various markups used in this novel 3-Tier XML Schematic approach are very useful for the machine translation of a web content. This is a significant step forward toward better internationalization and localization of web pages as well.