ppxscal/embedding_network huggingface dataset:
Training RBF Networks Using a DE Algorithm with Adaptive Control
Authors: Junhong Liu, Jorma Mattila, Jouni Lampinen
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

This paper concerns the application of differential evolution to training radial basis function networks. The algorithm consists of initial tuning, local tuning, and global tuning. The last two tunings both use a cycle-increased searching scheme, and global tuning employs fuzzy adaptive control. The mean square error from desired to actual outputs is applied as the objective function. Four standard test functions is used for demonstration. A comparison of net performances with two approaches reported in the literature shows the resulting network performs better in terms of a lower mean square error with a smaller network.
Privacy in video media spaces
Authors: Michael John Boyle
Venue:  (2005)

This thesis informs the design and development of video media spaces that enrich distributed collaboration and preserve privacy. Video media spaces are fully interconnected multi-person audio/video networks that are usually on all of the time. They have the potential to benefit distributed teamwork by providing rich informal awareness and casual interactions to distance-separated colleagues. However, the problem is that media spaces may be invasive to privacy. Although there are techniques proposed to preserve privacy in video media spaces, e.g., video blurring, their effectiveness and usability are not known. Furthermore, there is insufficient theoretical knowledge about what privacy is and how it should be supported to guide the design of privacy-preserving video media spaces. In this thesis I describe four major contributions that fundamentally change our understanding of the nature of privacy, its role in people's daily lives, and how it may be realised in computer supported cooperative work (CSCW) systems. First, I developed the COLLABRARY toolkit to rapidly prototype video media spaces and privacy safeguards so that I could understand the human factors of their design, implementation, and use. Second, I evaluated the blur and pixelize distortion filtration techniques. These studies suggest that although they are widely suspected to be useful for mitigating privacy issues in video media spaces, these techniques fail to adequately balance awareness and privacy in high-risk scenarios. Third, I developed a comprehensive descriptive theory of privacy in video media spaces based on the social, psychological and CSCW literature about privacy. It decomposes privacy into three normative controls for regulating interpersonal boundaries in an embodied dialectic: solitude, confidentiality and autonomy. This theory yields a powerful vocabulary of terms that disambiguate the many interrelated and subtle meanings of &ldquo;privacy.&rdquo; Lastly, I developed a systematic method for applying the vocabulary of the descriptive theory of privacy to analyse and describe video media space design and use. This method reveals omissions in the way a media space prototype handles privacy and hidden assumptions regarding technology design, use, users, and their contexts. I illustrate this method in several case studies that generate further analytical knowledge about privacy in video media spaces.
Transformations to Parallel Codes for Communication-Computation Overlap
Authors: Anthony Danalis, Ki-Yong Kim, Lori Pollock, Martin Swany
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

This paper presents program transformations directed toward improving communication-computation overlap in parallel programs that use MPI's collective operations. Our transformations target a wide variety of applications focusing on scientific codes with computation loops that exhibit limited dependence among iterations. We include guidance for developers for transforming an application code in order to exploit the communicationcomputation overlap available in the underlying cluster, as well as a discussion of the performance improvements achieved by our transformations. We present results from a detailed study of the effect of the problem and message size, level of communication-computation overlap, and amount of communication aggregation on runtime performance in a cluster environment based on an RDMA-enabled network. The targets of our study are two scientific codes written by domain scientists, but the applicability of our work extends far beyond the scope of these two applications.
From PIM to GIM: personal information management in group contexts
Authors: Thomas Erickson
Venue: Communications of the ACM (2006)

Sharing personal information with networked groups and institutions raises questions about privacy and control best addressed through a new field of inquiry: group information management.
Building A Document Class Hierarchy for Obtaining More Proper Bibliographies from Web
Authors: Daling Wang, Ge Yu, Minghan Hu, Yubin Bao, Meng Zhang
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

In order for researchers in scientific and technological fields to find more proper information resources on Web, an auxiliary search structure is proposed, which is a class hierarchy of documents built based on the keywords of the documents. To cover the contents of the document properly, the keywords are extracted by means of mining maximal sequential frequent phrases. In this paper, the concept of maximal sequential frequent phrase is defined, and the corresponding mining algorithm is designed and implemented. The experiments show that keywords extraction using maximal sequential frequent phrase has better F-Measure than that of using traditional TFIDF weight. Moreover, compared with previous works, our extended class hierarchy tree represents a relationship hierarchy either between keywords themselves or between keywords and documents, by which the queries on different professional levels can be supported.
An environment for comprehending the behavior of software systems
Authors: Spiros Mancoridis
Venue:  (2005)

Modern software systems are often large, distributed, written in more than one programming language, and developed using pre-built components (e.g., dynamically-linked libraries). The characteristics of such systems pose unique challenges to software comprehension, where the current practice typically involves the manual inspection and possibly static analysis of the system's source code. Our research addresses the characteristics of these systems by developing a software comprehension framework that facilitates dynamic analysis, feature-driven analysis, and tool integration. The framework is instantiated as a software comprehension environment that supports the dynamic analysis of distributed systems, multi-language systems, and systems that use binary components. The environment supports an extensive collection of dynamic views, which are derived from the runtime data collected during the execution of the software system undergoing scrutiny. The environment is implemented as a set of integrated tools consisting of three subsystems: data gathering, data repository, and analysis/visualization. The key issues addressed by our environment include: (a) the development of a data repository for storing static and dynamic data from distributed and multi-language applications, (b) the construction of a distributed profiler that collects runtime data from components that are distributed across a network, (c) the development of a software modeling query language that facilitates data retrieval, modeling, and analysis to create software views, (d) the development of an extensive set of software views to assist engineers in the comprehension of software systems, and (e) the decoupling of the environment's subsystems to enhance the extensibility and ease the integration of new tools. The software views produced by our environment include feature-interaction, feature-implementation, and feature-similarity views, as well as remote-interaction, thread-interaction, structural, and class-usage views. To demonstrate the effectiveness of our environment, a case study involving three significant software systems was conducted (i.e., the Mozilla web browser, the Jext text editor, and the TechReport technical report archiving system).
Case Study: Distance-Based Image Retrieval in the MoBIoS DBMS
Authors: Rui Mao, Wenguo Liu, Daniel P. Miranker, Qasim Iqbal
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Similarity search leveraging distance-based index structures is increasingly being used for complex data types. It has been shown that for high dimensional uniform vectors with similarity norms, any clustering and partitioning index method is outperformed by sequential scan. However, intrinsic clustering of real data usually leads to low intrinsic dimensionality. MoBIoS (the Molecular Biological Information System) is a next generation database management system comprising distance-based indices. Owing to its generality, we have built, evaluated and optimized a prototype of a distance-based image retrieval system. We show that under a metric distance function, image data is intrinsically low dimensional. We investigate the performance of three distance-based index structures ( M-tree, RBT-index, and MVP-index), and, to optimize the construction of MVP-indexes, develop new heuristics that seek centers as pivots and partition the data according to its intrinsic clustering. Last, we show the SQL extension to embody distance-based image retrieval in MoBIoS.
Multiobjective Optimization Using Adaptive Pareto Archived Evolution Strategy
Authors: Mihai Oltean, Crina Grosan, Ajith Abraham, Mario Koppen
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

This paper proposes a novel adaptive representation for evolutionary multiobjective optimization for solving a stock modeling problem. The standard Pareto Achieved Evolution Strategy (PAES) uses real or binary representation for encoding solutions. Adaptive Pareto Archived Evolution Strategy (APAES) uses dynamic alphabets for encoding solutions. APAES is applied for modeling two popular stock indices involving 4 objective functions. Further, two bench mark test functions for multiobjective optimization are also used to illustrate the performance of the algorithm. Empirical results demonstrate APAES performs well when compared to the standard PAES.
Real-time visualization of large textured terrains
Authors: Anders Brodersen
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

In this paper, we present a framework for real-time rendering of large scale terrains with texture maps larger than what the graphics hardware can display in a single texture. The presented system is compact and efficient, yet very simple and easy to implement.
AirTransNote: Augmented Classrooms with Digital Pen Devices and RFID Tags
Authors: Motoki Miura, Susumu Kunifuji, Buntarou Shizuki, Jiro Tanaka
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

AirTransNote augments activities in classrooms by sharing student notes written on regular paper using wireless communications. AirTransNote uses digital pens to free students from the need to use PCs for note taking. To improve the effectiveness of the system, we used a portable remote controller with an RFID tag reader. Teachers can select notes for students by using the controller as "magic wand." The selection interface is intuitive for both teachers and students. Also, the system can save time for setting up devices before lectures. The system promotes an augmented classroom, enabling interactive lectures in regular classrooms using natural styles.
Vim for C programmers
Authors: Girish Venkatachalam
Venue: Linux Journal (2005)

Learn to use Vim like the power tool that it is.
Photon Splatting for participating media
Authors: Antoine Boudet, Paul Pitot, David Pratmarty, Mathias Paulin
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

Since the beginning of image synthesis, much research have been done on global illumination simulation. However, simulation in participating media is still an open problem as far as computing time is concerned. Recently some methods, like Photon Mapping, proposed an optimization of the resolution of global illumination in participating media. Nevertheless, the computing costs of these methods remain very expensive.In this paper, we present a method which takes advantage of density estimation to efficiently reconstruct volume irradiance from the photon map. Our idea is to separate the computation of emission, absorption and out-scattering from the computation of in-scattering. Then we use a dual approach of density estimation to optimize this last part as it is the most computational expensive. Our method extends Photon Splatting, which optimizes the computation time of Photon Mapping for surface rendering, to participating media, and then considerably reduce participating media rendering times. Even though our method is faster than Photon Mapping for equal quality, we also propose a GPU based optimization of our algorithm.
Unifying the error-correcting and output-code AdaBoost within the margin framework
Authors: Yijun Sun, Sinisa Todorovic, Jian Li, Dapeng Wu
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

In this paper, we present a new interpretation of AdaBoost.ECC and AdaBoost.OC. We show that AdaBoost.ECC performs stage-wise functional gradient descent on a cost function, defined in the domain of margin values, and that AdaBoost.OC is a shrinkage version of AdaBoost.ECC. These findings strictly explain some properties of the two algorithms. The gradient-minimization formulation of AdaBoost.ECC allows us to derive a new algorithm, referred to as AdaBoost.SECC, by explicitly exploiting shrinkage as regularization in AdaBoost.ECC. Experiments on diverse databases confirm our theoretical findings. Empirical results show that AdaBoost.SECC performs significantly better than AdaBoost.ECC and AdaBoost.OC.
Contextual Risk Analysis for Interview Design
Authors: Tira Cohene, Steve Easterbrook
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Interviews with stakeholders can be a useful method for identifying user needs and establishing requirements. However, interviews are also problematic. They are time consuming and may result in insufficient, irrelevant or invalid data. Our goal is to re-examine the methodology of interview design, to determine how various contextual factors affect the success of interviews in requirements engineering. We present a case study of a Web conferencing system used by a support group for spousal caregivers of people with dementia. Two sets of interviews were conducted to identify requirements for a new version of the system. Both sets of interviews had the same information elicitation goals, but each used different interview tactics. A comparison of the participants¿ responses to each format offers insights into the relationship between the interview context and the relative success of each interview technique for eliciting the desired information. As a result of what we learned, we propose a framework to help analysts design interviews and chose tactics based on the context of the elicitation process. We call this the contextual risk analysis framework.
The implementation of the BSP parallel computing model on the InteGrade Grid middleware
Authors: Andrei Goldchleger, Alfredo Goldman, Ulisses Hayashida, Fabio Kon
Venue: Proceedings of the 3rd international workshop on Middleware for grid computing (2005)

InteGrade is an object-oriented grid middleware infrastructure whose goal is to leverage existing computational resources in organizations. Rather than relying on dedicated hardware such as reserved clusters, InteGrade focuses on using desktops in users' offices, machines in computer laboratories, shared workstations, as well as dedicated clusters. In this paper, we describe the support for the execution of highly coupled parallel applications on top of InteGrade. The paper describes the implementation of the middleware to support BSP parallel applications (with global synchronization points), and presents experimental results.
Online Evolution for a Self-Adapting Robotic Navigation System Using Evolvable Hardware
Authors: Didier Keymeulen, Masaya Iwata, Yasuo Kuniyoshi, Tetsuya Higuchi
Venue: Artificial Life (1998)

Great interest has been shown in the application of the principles of artificial life to physically embedded systems such as mobile robots, computer networks, home devices able continuously and autonomously to adapt their behavior to changes of the environments. At the same time researchers have been working on the development of evolvable hardware, and new integrated circuits that are able to adapt their hardware autonomously and in real time in a changing environment. This article describes the navigation task for a real mobile robot and its implementation on evolvable hardware. The robot must track a colored ball, while avoiding obstacles in an environment that is unknown and dynamic. Although a model-free evolution method is not feasible for real-world applications due to the sheer number of possible interactions with the environment, we show that a model-based evolution can reduce these interactions by two orders of magnitude, even when some of the robot's sensors are blinded, thus allowing us to apply evolutionary processes online to obtain a self-adaptive tracking system in the real world, when the implementation is accelerated by the utilization of evolvable hardware.
Scientific data management in the coming decade
Authors: Jim Gray, David T. Liu, Maria Nieto-Santisteban, Alex Szalay, David J. DeWitt, Gerd Heber
Venue: ACM SIGMOD Record (2005)

Scientific instruments and computer simulations are creating vast data stores that require new scientific methods to analyze and organize the data. Data volumes are approximately doubling each year. Since these new instruments have extraordinary precision, the data quality is also rapidly improving. Analyzing this data to find the subtle effects missed by previous studies requires algorithms that can simultaneously deal with huge datasets and that can find very subtle effects --- finding both needles in the haystack and finding very small haystacks that were undetected in previous measurements.
Scalable media streaming to interactive users
Authors: Marcus Rocha, Marcelo Maia, Ítalo Cunha, Jussara Almeida, Sérgio Campos
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Recently, a number of scalable stream sharing protocols have been proposed with the promise of great reductions in the server and network bandwidth required for delivering popular media content. Although the scalability of these protocols has been evaluated mostly for sequential user accesses, a high degree of interactivity has been observed in the accesses to several real media servers. Moreover, some studies have indicated that user interactivity can severely penalize the scalability of stream sharing protocols.This paper investigates alternative mechanisms for scalable streaming to interactive users. We first identify a set of workload aspects that are determinant to the scalability of classes of streaming protocols. Using real workloads and a new interactive media workload generator, we build a rich set of realistic synthetic workloads. We evaluate Bandwidth Skimming and Patching, two state-of-the-art streaming protocols, covering, with our workloads, a larger region of the design space than previous work. Finally, we propose and evaluate five optimizations to Bandwidth Skimming, the most scalable of the two protocols. Our best optimization reduces the average server bandwidth required for interactive workloads in up to 54%, for unlimited client buffers, and 29%, if buffers are constrained to 25% of media size.
Simplicial Complexes of Graphs and Hypergraphs with a Bounded Covering Number
Authors: Jakob Jonsson
Venue: SIAM Journal on Discrete Mathematics (2005)

For $1 \le p \le n-1$, define $\Cov{n}{p}$ as the family of graphs on the vertex set $\{1,\ldots, n\}$ with a covering number of at most $p$ (equivalently, with an independence number of at least $n-p$). Since the underlying vertex set is fixed, we may identify each graph in $\Cov{n}{p}$ with its edge set. In particular, we may view $\Cov{n}{p}$ as a simplicial complex. For $i\ge -1$, we show that the rank of the $i$th homology group of $\Cov{n}{p}$ is a linear combination, with coefficients being polynomials in $n$, of the ranks of the $i$th homology groups of $\Cov{p+2}{p}, \ldots, \Cov{2p+1}{p}$. Our proof takes place in a more general setting where we consider complexes of hypergraphs. In addition, we show that the $(2p-1)$-skeleton of $\Cov{n}{p}$ is shellable, which implies that $\Cov{n}{p}$ is $(2p-2)$-connected. For $p \le 3$, we give a complete description of the homology groups of $\Cov{n}{p}$.
Distributed and decentralized collaborative manipulation in a multiple-robot system
Authors: John T. Wen
Venue:  (2005)

Using multiple robots to perform cooperative tasks such as material transport or parts assembly is becoming increasingly common as the costs of robotic hardware, processing power and software continue to decrease. In such scenarios, the multiple-robot approach provides the redundancy, reliability, speed, payload force regulation and cost-effectiveness that a single robot cannot provide. There are many areas such as underwater and space exploration, service robotics, etc. that would benefit from multi-robot manipulation. Multiple-robots are most frequently used when the task requirement is incompatible with a single robot. For example, a heavy load that is beyond the capability of a single manipulator may be handled by multiple smaller robots. Motivated by these observations, this thesis addresses the multiple-robot collaborative manipulation problem, focusing on the motion and force control laws for decentralized and distributed systems. Inspired by the behavior of ants, and based on the move/squeeze decomposition, a hybrid motion/force control is proposed for a planar manipulation of an object by point mass robots. The motion/squeeze decomposition makes it possible to consider the motion and force control as two, one-way coupled, problems. In this way, first the motion control is designed without taking into account the force control. Then, the force control is addressed considering the motion control as a perturbation. In a new stability result, using a modified energy-based Lyapunov function, the decentralized motion control is shown to be globally asymptotical&mdash;locally exponential&mdash;stable. The convergence of the motion control is characterized for two cases: if the position set points are kinematically feasible, the position errors of all robots converge to zero. If the position set points are kinematically infeasible, the position errors of the robots converge to the squeeze subspace. This result is used to generate a squeeze force set point for the decentralized and distributed force controllers. Based on the motion control exponential stability result, for a load initially at rest, the decentralized force control is found to be asymptotically convergent. For the distributed force control, a robustness bound for the maximum communication delay is obtained. Simulation and experimental results have been included to illustrate the results.