ppxscal/embedding_network huggingface dataset:
Particle swarms and population diversity
Authors: M. Blackwell
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2005)

The optimisation of dynamic optima can be a difficult problem for evolutionary algorithms due to diversity loss. However, another population based search technique, particle swarm optimisation, is well suited to this problem. If some or all of the particles are &#x2018;charged&#x2019;, an extended swarm can be maintained, and dynamic optimisation is possible with a simple algorithm. Charged particle swarms are based on an electrostatic analogy&#x2014;inter-particle repulsions enable charged particles to swarm around a nucleus of neutral particles. This paper proposes a diversity measure and examines its time development for charged and neutral swarms. These results facilitate predictions for optima tracking given knowledge of the amount of dynamism. A number of experiments test these predictions and demonstrate the efficacy of charged particle swarms in a simple dynamic environment.
Evaluation of Queries on Tree-Structured Data Using Dimension Graphs
Authors: Theodore Dalamagas, Dimitri Theodoratos, Antonis Koufopoulos, Vincent Oria
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

The recent proliferation of XML-based standards and technologies for managing data on the Web demonstrates the need for effective and efficient management of tree-structured data. Querying tree-structured data is a challenging issue due to the diversity of the structural aspect in the same or in different trees. In this paper, we show how to evaluate queries on tree-structured data, called value trees. The formulation of these queries does not depend on the structure of a particular value tree. Our approach exploits semantic information provided by dimension graphs. Dimension graphs are semantically rich constructs that abstract the structural information of the value trees. We show how dimension graphs can be used to query efficiently value trees in the presence of structural differences and irregularities. Value trees and their dimension graphs are represented as XML documents. We present a method for transforming queries to XPath expressions to be evaluated on the XML documents. We also provide conditions for identifying strongly and weakly unsatisfiable queries. Finally, we conducted various experiments to compare our method for evaluating queries with one that does not exploit dimension graphs. Our results demonstrate the superiority of our approach.
Formative evaluation: a technique for attaining people-oriented systems
Authors: Thomas H. Martin
Venue: ACM SIGSOC Bulletin (1979)

Let me tell you what I mean by formative evaluation. For example, in the design of something like Sesame Street or FreeStyle, social science researchers have gotten away from the role they're usually cast in - that is, to come in afterwards and explain why things failed. Instead, they get in right near the beginning and try to make sure that things turn out to be successes. You've all heard of the success of Sesame Street, and you're probably beginning to hear of the success of FreeStyle. When you have a big project and there is a great disparity between the people who are doing it and the people they're supposed to be impacting or who are going to be their users, the possibilities of misunderstanding and potential failure are great. This is a very common problem with large systems that are being designed today. Even though people think they are talking the same language, they find out they aren't. We have a lot of systems that are designed now where the system designers or the system analysts come up with specifications, let out bids, someone gets the bid, and that supposedly is it. Although misunderstandings between the systems analysts and the contractors may exist, that doesn't guarantee that the system analysts have a very good understanding of the end users. The idea in formative evaluation is that as you're getting the design put together and putting the concepts in place, you go out and start gathering representative data from the end user population to see whether in fact it is possible to attain the goals. Everybody knows that design is an iterative process, and evaluation should be a component of it. We give it lip service but very rarely do we do it, and the cliches are, "Well, you know the users don't know what they're going to want, they're going to keep on changing." To some extent that is true, but that is very often used as an excuse to skip the data gathering completely. By focusing on the misunderstandings, by trying to clarify the goals, one can early on learn whether in fact a system can be developed that is useable and satisfactory to those users.
Dual-Mode Space-Temporal Simultaneous Processing Equalizer
Authors: Yoshihiro Ichikawa, Shigeki Obote, Kenichi Kagoshima
Venue: Wireless Personal Communications: An International Journal (2005)

A tapped delayed line adaptive array antenna (TDL-AAA) and a space-temporal simultaneous processing equalizer (ST-SPE) are proposed as simple space-temporal equalizers based on minimum mean square error (MMSE) criterion. The ST-SPE has a compact hardware with a small number of taps compared to that of the TDL-AAA. The ST-SPE can reduce the computational complexity of the space-temporal joint equalization and it works effectively under the minimum phase condition such as appeared at line-of-sight (LOS) propagation environments at a high antenna height base station. However the ST-SPE cannot work under a non-minimum phase condition caused under N-LOS (non-line-of-sight). On the other hand, the TDL-AAA whose reference signal is synchronized at the center tap (TDL-AAAC) can work even in the non-minimum phase condition. In this paper, we propose a dual-mode space-temporal simultaneous processing equalizer (Dual-mode ST-SPE) which has a simple configuration and also works in non-minimum phase condition. The Dual-mode ST-SPE can reduce the computational complexity compared to the TDL-AAAC.
Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval
Venue: International Multimedia Conference (2005)

It is our great pleasure to welcome you to the 7th ACM SIGMM International Workshop on Multimedia Information Retrieval -- MIR'05. This year's workshop continues its tradition of being the premier forum for presentation of research results and experience reports on leading edge issues of multimedia information retrieval, including models, systems, applications, and theory. The mission of the workshop is to share novel multimedia information retrieval solutions that fulfill the needs of heterogeneous applications and environments and identify new directions for future research and development. MIR gives researchers and practitioners a unique opportunity to share their perspectives with others interested in the various aspects of multimedia information retrieval.The call for papers attracted 47 submissions to regular sessions from Asia, Europe, South America, Australia, Canada, and the United States. The program committee accepted 21 (10 oral and 11 poster) papers. There are two invited special sessions on "Machine Learning for Visual Information Retrieval", and "Multimedia Information Retrieval: Challenges and Real-world Applications". The workshop program covers a variety of topics, including image/video indexing, annotation, and retrieval, web-based searching and mining, learning techniques, and real world applications. In addition, the program includes a panel on "Multimedia Information Retrieval: What is it and Why isn't Anyone Using It?" and keynote speeches by Ramesh Sarukkai from Yahoo! Inc. on "Video Search: Opportunities & Challenges" and Wei-Ying Ma from Microsoft Research Asia on "From Relevance to Intelligence: Toward Next Generation Web Search". We hope that these proceedings will serve as a valuable reference for MIR researchers and developers.
Multimodal oriented discriminant analysis
Authors: Fernando De la Torre, Takeo Kanade
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

Linear discriminant analysis (LDA) has been an active topic of research during the last century. However, the existing algorithms have several limitations when applied to visual data. LDA is only optimal for Gaussian distributed classes with equal covariance matrices, and only classes-1 features can be extracted. On the other hand, LDA does not scale well to high dimensional data (overfitting), and it cannot handle optimally multimodal distributions. In this paper, we introduce Multimodal Oriented Discriminant Analysis (MODA), a LDA extension which can overcome these drawbacks. A new formulation and several novelties are proposed:&bull; An optimal dimensionality reduction for multimodal Gaussian classes with different covariances is derived. The new criteria allows for extracting more than classes-1 features.&bull; A covariance approximation is introduced to improve generalization and avoid over-fitting when dealing with high dimensional data.&bull; A linear time iterative majorization method is suggested in order to find a local optimum.Several synthetic and real experiments on face recognition show that MODA outperform existing linear techniques.
Requirements BEFORE the Requirements: Understanding the Upstream Impact
Authors: Christof Ebert
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Being succesful in product development means to deliver the right products or solutions at the right time for the right markets. While requirements engineering (RE) plays a key role in selecting and managing requirements for a given project, the "up stream" before the project start often remains vague. Typically this upstream process is decoupled from the project-related RE proccesses, which creates lots ofproject deficiencies, such as changes in requirements and ultimately delayed release. We take the position that only by integrating upstream (e.g., roadmap) and downstream (i.e., project) proccesses, projectswill be successful. This field study is supported by data from 246 industry projects over a period of two years. We found that four described the techniques must be used simultaneously in order to see tabgible performance improvement. Each technique is explained by concrete and practical experiences.
A Low Power and High Performance Analog Front End for Passive RFID Transponder
Authors: Jianyun Hu, Hao Min
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

This paper presents a novel low power and high performance analog front end circuit for passive RFID transponder. With a novel architecture including three rectifier circuits, among which a new high efficient rectifier circuit is proposed, and other circuits optimized for low power, this analog front end is characterized by high power conversion efficiency (PCE) and low power consumption. The circuit includes all the analog front end modules for a transponder to perform a complete function. Besides, the analog front end circuit is compatible with standard CMOS process.
A Visualization Methodology for Characterization of Network Scans
Authors: Chris Muelder, Kwan-Liu Ma, Tony Bartoletti
Venue: Proceedings of the IEEE Workshops on Visualization for Computer Security (2005)

Many methods have been developed for monitoring network traffic, both using visualization and statistics. Most of these methods focus on the detection of suspicious or malicious activities. But what they often fail to do refine and exercise measures that contribute to the characterization of such activities and their sources, once they are detected. In particular, many tools exist that detect network scans or visualize them at a high level, but not very many tools exist that are capable of categorizing and analyzing network scans. This paper presents a means of facilitating the process of characterization by using visualization and statistics techniques to analyze the patterns found in the timing of network scans through a method of continuous improvement in measures that serve to separate the components of interest in the characterization so the user can control separately for the effects of attack tool employed, performance characteristics of the attack platform, and the effects of network routing in the arrival patterns of hostile probes. The end result is a system that allows large numbers of network scans to be rapidly compared and subsequently identified.
Locality of reference and the use of sojourn time variance for measuring queue unfairness: extended abstract
Authors: David Raz, Benjamin Avi-Itzhak, Hanoch Levy
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

The variance of customer sojourn time (or waiting time) is used, either explicitly or implicitly, as an indication of fairness for as long as queueing theory exists. In this work we demonstrate that this quantity has a disadvantage as a fairness measure, since it is not local to the busy period in which it is measured. It therefore may account for customer discrepancies which are not relevant to fairness of scheduling. We show that RAQFM, a recently proposed job fairness measure, does possess such a locality property. We further show that within a large class of fairness measures RAQFM is unique in possessing this property.
Accelerating Functional Simulation for Processor Based Designs, invited
Authors: Russell Klein, Tomasz Piekarz
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

Design verification is taking an increasing proportion of the design cycle of System-on-Chip (SoC) designs. Designers spend up to 70 of their time developing and running tests to verify the functionality of their systems [1]. Running regression suites against the design can take up to several years of CPU time to complete. In this paper we will show how existing software code bases can be used to reduce the time to develop and execute verification tests. These techniques can be applied to both unit and system level verification. As shown in various hardware/software co-verification tools [2] [3], the overall load on a simulation can be reduced by eliminating code and data references from the set of bus cycles generated by the processor model. These same techniques can be applied by hardware designers and verification engineers to use firmware, hardware diagnostics, and other software as a basis for creating functional verification tests. This software is often available from prior versions of the design or other groups on the design team. Simulation run-times can be reduced by partitioning the processor¿s memory space between the logic simulation and the processor model.
Incremental validation of xml documents and mappings
Authors: Denilson De Moura Barbosa
Venue:  (2005)

XML is a simple and flexible format for encoding and exchanging data which has been used in a wide range of applications. Providing efficient management of XML data is an important and challenging problem that has attracted a great deal of attention. This thesis addresses the incremental validation problem, which consists in incrementally checking whether XML documents conform to their schemes in the presence of updates, and is a classical problem in data management. Two instances of the problem are considered. First, we assume a &ldquo;native&rdquo; storage approach in which the documents are stored and accessed using special-purpose programs. We propose, implement and evaluate incremental validation algorithms which, for those schemas most commonly used in practice, run in time logarithmic in the size of the document. This improves significantly on brute-force methods and previous approaches; furthermore, our experimental results show our methods exhibit excellent performance and scalability. Next, we consider mapping schemes for storing and accessing XML documents as relational databases. We study natural notions of information preservation for mappings, and relate them to classical notions in the literature; we also show that these properties are undecidable for a large class of mapping schemes that contains all those in the literature. Then, we propose sound methods for designing information-preserving mapping schemes, discuss their implementation on standard relational database management systems, and show through experiments that they perform well in practice for both queries and updates.
Status of the CAS/HKUST Joint Project BLOSSOMS
Authors: Lionel M. Ni, Li Cui, Qiong Luo, Hoilun Ngan, Ze Zhao
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

In March 2004, recognizing the importance of sensor networks, the Chinese Academy of Sciences and the Hong Kong University of Science and Technology launched a joint effort to investigate both fundamental and practical research issues in sensor networks. The goal of this research is to build lightweight optimized sensor systems on a massive scale, namely the BLOSSOMS project. The objective of this research project is to identify research issues at all levels from practical applications down to the design of sensor nodes. This paper reports the status of the project as of April 2005. First, other than making MOTE-compatible sensor nodes, this project has studied the hardware and software co-design and the associated "sensor node on a chip" technology with the aim to make sensor nodes small in size, light in weight, cheap in cost, and low in power consumption. Second, additional toolkits for simulation/emulation and evaluation of sensor networks have been developed to support research at different levels. Third, a number of applications have been investigated and implemented since the launch of this project, and this paper will address two of them. One is an embedded remote health care system based on wireless sensor network technologies to introduce a scalable wireless personal medical network around human¿s body. The other is a moving object counting system based on an ultrasonic sensor network, which can be used but not limited to crowd estimation and traffic monitoring and coordination.
Intervehicle Communication Protocol for Emergency Situations
Authors: Mimoza Durresi, Leonard Barolli, Arjan Durresi, Frank Hsu
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

Intervehicle communications could be very valuable in emergency situations such as after natural or man made disasters or accidents. The main goals in designing protocols for similar situations is to guarantee lower delay, needed throughput and probably most importantly to enable prioritization of emergency information. Reaching such goals is not easy in presence of emergency situations when the intervehicle traffic increases exponentially. We present a reliable hierarchical routing protocol that uses load balancing to keep low message delay even in presence of high level of traffic. Our protocol is based on geographical routing. The protocol is designed for highway travelers but can be used in any mobile ad-hoc network. The highway is divided in virtual cells, which moves as the vehicles moves. The cell members might choose one or more Cell Leaders that will behave for a certain time interval as Base Stations. Every node has its geographical position given by Global Positioning System (GPS). Cell Leaders form a virtual backbone used to forward messages among nodes on different cells. The traffic is distributed among Cell Leaders in order to optimize the communication delay. We study the effect of load balancing in minimizing delay. Our simulation results show that our proposed protocol improves the network utilization compared to existing inter-vehicles protocols.
Improved topology assumptions for threshold cryptography in mobile ad hoc networks
Authors: Giovanni Di Crescenzo, Renwei Ge, Gonzalo R. Arce
Venue: Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks (2005)

Mobile Ad Hoc Networks (MANET), due to their lack of physical infrastructures or centralized authorities, pose a number of security challenges to a protocol designer. In particular, several typical application scenarios demand the design of protocols that cannot base their security on the existence of trusted parties or setup information, but rather need to leverage uniquely on assumptions limiting the corrupting power of the adversaries. This naturally defines security design and analysis paradigms similar to those of the Threshold Cryptography area, where it is typically assumed that an adversary can corrupt up to a limited amount of entities or resources. Therefore a secure realization of primitives from Threshold Cryptography in MANET promises to be applicable to several MANET protocols.Recently, in [10], we started the analysis of Threshold Cryptography solutions over MANET, by focusing on the problem of extending to these networks known efficient threshold signature schemes for wired networks. In particular, we noted a major design difficulty due to the lack of full network connectivity that significantly constrained the network topology assumptions under which a MANET threshold signature scheme can be proved secure. In this paper we continue our investigation and present a new MANET threshold signature scheme that is secure under significantly improved topology assumptions. Surprisingly, we break through an apparent barrier due to well-known results from the Distributed Computing area.
A multiprocessor memory interface simulator
Authors: D. S. Taylor, T. Williams, J. E. Weatherbee
Venue: ACM SIGSIM Simulation Digest (1974)

A simulater is described which models the interference produced at the interface between a common central memory (CM) and a number of microprogrammed central processing units (CPU's) operating under the control of a microprogram read-only memory (MROM).Results of the interference study may be used to determine the optimum combination of the CM/ CPU bus width and the CPU Microprogram MROM cycle time.
Function Outlining and Partial Inlining
Authors: Peng Zhao, Jose Nelson Amaral
Venue: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing (2005)

Frequently invoked large functions are common in non-numeric applications. These large functions present challenges to modern compilers not only because they require more time and resources at compilation time, but also because they may prevent optimizations such as function inlining. However, usually it is the case that large portions of the code in a hot function fhost are executed much less frequently than fhost itself. Partial inlining is a natural solution to the problems caused by including cold code segments that are seldom executed into hot functions that are frequently invoked. When applying partial inlining, a compiler outlines cold statements from a hot function fhost . After outlining, fhost becomes smaller and thus can be easily inlined. This paper presents a framework for function outlining and partial inlining that includes several innovations: (1) an abstract-syntax-tree-based analysis and transformation to form cold regions for outlining; (2) a set of flexible heuristics to control the aggressiveness of function outlining; (3) several possible function outlining strategies; (4) alias agent, a new technique that overcomes negative side-effects of function outlining. With the proper strategy, partial inlining improves performance by up to 5.75%. A performance study also suggests that partial inlining is not effective on enabling more aggressive inlining. The performance improvement from partial inlining actually comes from better code placement and better code generation.