ppxscal/embedding_network huggingface dataset:
Interactive Particle Swarm Optimization
Authors: Janos Madar, Janos Abonyi, Ferenc Szeifert
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

It is often desirable to simultaneously handle several objectives and constraints in practical optimization problems. In some cases, these objectives and constraints are noncommensurable and they are not explicitly/mathematically available. For this kind of problems, interactive optimization may be a good approach. Interactive optimization means that a human user evaluates the potential solutions in qualitative way. In recent years evolutionary computation (EC) was applied for interactive optimization, which approach has became known as interactive evolutionary computation (IEC). The aim of this paper is to propose a new interactive optimization method based on particle swarm optimization (PSO). PSO is a relatively new population based optimization approach, whose concept originates from the simulation of simplified social systems. The paper shows that interactive PSO cannot be based on the same concept as IEC because the information sharing mechanism of PSO significantly differs from EC. So this paper proposes an approach which considers the unique attributes of PSO. The proposed algorithm has been implemented in MATLAB (IPSO toolbox) and applied to a case-study of temperature profile design of a batch beer fermenter. The results show that IPSO is an efficient and comfortable interactive optimization algorithm. The developed IPSO toolbox (for Matlab) can be downloaded from the website of the authors: http://www.fmt.vein.hu/softcomp/ipso.
ACM multimedia interactive art program: an introduction to the presence/absence exhibition
Authors: Alejandro Jaimes, Andrew Senior, Wolfgang Muench
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

The second ACM Multimedia Art program followed the successful formula used in ACM MM 2005, consisting of a session of long papers, a selection of posters and an art exhibition of multimedia works displayed at a gallery for a period encompassing the conference duration. "Presence/Absence" was selected as the central theme for the exhibition. In this paper, we discuss our motivations in organizing an art program at ACM MM, the exhibition theme, the works selected, and their potential impact in the technical community.
Investigations in meta-GAs: panaceas or pipe dreams?
Authors: Jeff Clune, Sheni Goings, Bill Punch, Eric Goodman
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

A meta-GA (GA within a GA) is used to investigate evolving the parameter settings of genetic operators for genetic and evolutionary algorithms (GEA) in the hope of creating a self-adaptive GEA. We report three findings. First, the meta-GA can adapt its genetic operators to different problems and thereby perform well on average across diverse problems. Second, the meta-GA can change its parameters during the course of a run&mdash;seemingly a good idea&mdash;but this behavior may actually decrease performance. Finally, the genetic operator configurations the meta-GA evolves are far from optimal. We conclude that, while meta-GAs show promise for automating some parameter configurations, they are not likely to replace manually configured genetic and evolutionary algorithms without innovative alteration.
Virtual Product Design Case Study: The Nokia RFID Tag Reader
Authors: Pertti Repo, Mikko Kerttula, Marko Salmela, Heikki Huomo
Venue: IEEE Pervasive Computing (2005)

Virtual product design is a methodology that supports heterogeneous, hardware-software prototyping. Using virtual prototypes, VPD offers realistic product concepts throughout the product life cycle. In 2003, Nokia adopted this methodology to develop an RFID kit for the Nokia 3220 mobile phone. The Cybelius Maestro virtual prototyping tool supported VPD development of concepts and features.This department is part of a special issue on rapid prototyping.
A Comparison of Clustering Methods for Writer Identification and Verification
Authors: Marius Bulacu, Lambert Schomaker
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

An effective method for writer identification and veri- fication is based on assuming that each writer acts as a stochastic generator of ink-trace fragments, or graphemes. The probability distribution of these simple shapes in a given handwriting sample is characteristic for the writer and is computed using a common codebook of graphemes obtained by clustering. In previous studies we used contours to encode the graphemes, in the current paper we explore a complementary shape representation using normalized bitmaps. The most important aim of the current work is to compare three different clustering methods for generating the grapheme codebook: k-means, Kohonen SOM 1D and 2D. Large scale computational experiments show that the proposed method is robust to the underlying shape representation used (whether contours or normalized bitmaps), to the size of codebook used (stable performance for sizes from 102 to 2.5×103) and to the clustering method used to generate the codebook (essentially the same performance was obtained for all three clustering methods).
A Layered Software Architecture for Quantum Computing Design Tools
Authors: Krysta M. Svore, Alfred V. Aho, Andrew W. Cross, Isaac Chuang, Igor L. Markov
Venue: Computer (2006)

Compilers and computer-aided design tools are essential for fine-grained control of nanoscale quantum-mechanical systems. A proposed four-phase design flow assists with computations by transforming a quantum algorithm from a high-level language program into precisely scheduled physical actions.
Hybrid Metabolic Flux Analysis/Artificial Neural Network Modeling of Bioprocesses
Authors: Ana Teixeira, Paula M. Alves, Rui Oliveira, Carlos Alves, Manuel J. T. Carrondo
Venue: Proceedings of the Fifth International Conference on Hybrid Intelligent Systems (2005)

The main aim of this study is to develop a bioprocess dynamic optimisation method that integrates bioreactor transport phenomena, with metabolic flux analysis (MFA). The central metabolic pathways of many biological systems with industrial interest are currently known. Bioreactor dynamic optimisation schemes could profit from the incorporation of this knowledge. A hybrid modelling methodology is presented that integrates the aforementioned concepts. The technique was successfully validated with data of a recombinant Baby Hamster Kidney (BHK-21) culture. The method allowed to identify the time evolution of intracellular metabolic fluxes and to relate this knowledge with bioreactor decision variables.
A Dual-Primal FETI method for incompressible Stokes equations
Authors: Jing Li
Venue: Numerische Mathematik (2005)

In this paper, a dual-primal FETI method is developed for incompressible Stokes equations approximated by mixed finite elements with discontinuous pressures. The domain of the problem is decomposed into nonoverlapping subdomains, and the continuity of the velocity across the subdomain interface is enforced by introducing Lagrange multipliers. By a Schur complement procedure, the solution of an indefinite Stokes problem is reduced to solving a symmetric positive definite problem for the dual variables, i.e., the Lagrange multipliers. This dual problem is solved by the conjugate gradient method with a Dirichlet preconditioner. In each iteration step, both subdomain problems and a coarse level problem are solved by a direct method. It is proved that the condition number of this preconditioned dual problem is independent of the number of subdomains and bounded from above by the square of the product of the inverse of the inf-sup constant of the discrete problem and the logarithm of the number of unknowns in the individual subdomains. Numerical experiments demonstrate the scalability of this new method.
Graph-Theoretic Scagnostics
Authors: Leland Wilkinson, Anushka Anand, Robert Grossman
Venue: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization (2005)

We introduce Tukey and Tukey scagnostics and develop graphtheoretic methods for implementing their procedure on large datasets.
Efficient Techniques for Noise Characterization of Sequential Cells and Macros
Authors: Venkat Rao Vallapenani, Ravi Shankar Chevuri, Bingxiong Xu, Lun Ye, Kanad Chakraborty
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

For the present and future generations of 90nm and more advanced CMOS technologies, technology scaling causes signal lines on the chip to come closer, which results in more coupling capacitances and hence more noise-prone signal lines. The scaling of power supplies decreases the signal- to-noise ratio and thus increases the effect of noise. These factors may cause the chip to fail. Hence, noise analysis becomes critical in the design flow. Noise analysis comprises noise calculation and noise filtering. Crosstalk analysis tools used nowadays typically rely on pessimistic noise filtering approaches and hence report many "false" violations which may not affect the circuit. Noise margin, which is a measure of tolerance to noise, is used in noise filtering. By using less pessimistic noise margin values in noise filtering, false violations, which otherwise cause unnecessary design revisions to be resolved can be eliminated. In this paper, modeling of noise margins with reduced pessimism for standard cells/macros is discussed. Techniques like moving window method and internal node method for standard cells to reduce the characterization time and the time required for channel connected component extraction for complex macros are presented here. Without such reductions, it may not be feasible to do noise characterization. This paper also gives a noise filtering flow and statistical data about net filtering with noise libraries built.
High-level synthesis: an essential ingredient for designing complex ASICs
Authors: Arvind, Rishiyur S. Nikhil, Daniel L. Rosenband, Nirav Dave
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

It is common wisdom that synthesizing hardware from higher-level descriptions than Verilog incurs a performance penalty. The case study here shows that this need not be the case. If the higher-level language has suitable semantics, it is possible to synthesize hardware that is competitive with hand-written Verilog RTL. Differences in the hardware quality are dominated by architecture differences and, therefore, it is more important to explore multiple hardware architectures. This exploration is not practical without quality synthesis from higher-level languages.
A hybrid evolutionary analogue module placement algorithm for integrated circuit layout designs: Research Articles
Authors: Lihong Zhang, Rabin Raut, Yingtao Jiang, Ulrich Kleine, Yoohwan Kim
Venue: International Journal of Circuit Theory and Applications (2005)

This paper presents an integrated approach of simulated annealing (SA) and genetic algorithm (GA) for the analogue module placement in mixed-signal integrated circuit layout designs. The proposed algorithm follows the optimization flow of a normal GA controlled by the methodology of SA. The bit-matrix chromosomal representation is employed to describe the location and the orientation of modules. Compared with the conventional bit-string representation, the proposed chromosomal representation tends to significantly improve the search efficiency. In addition, a slide-based flat scheme is developed to transform an absolute co-ordinate placement of modules to a relative placement. In this way, the symmetry constraints imposed on analogue very large scale integration circuits can be easily fulfilled in the placement run. Use of a radiation-decoder can also drastically shrink the configuration space without degrading search opportunities. The proposed algorithm has been tested with several example circuits. The experiments show this promising algorithm makes the better performance than the simpler SA or GA approaches working alone, and the quality of the automatically generated layouts is comparable to those done manually. Copyright &copy; 2005 John Wiley & Sons, Ltd.
An Objectives-Driven Process for Selecting Methods to Support Requirements Engineering Activities
Authors: Lester O. Lobo, James D. Arthur
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

This paper presents a framework that guides the requirements engineer in the implementation and execution of an effective requirements generation process. We achieve this goal by providing a welldefined requirements engineering model and a criteria based process for optimizing method selection for attendant activities. Current models address only portions of the requirements process or include activities defined at higher levels of abstraction; this often obscures the implementation aspects of the requirements process. Our model, unlike other models, addresses the complete requirements generation process and consists of activities defined at more adequate levels of abstraction. Additionally, activity objectives are identified and explicitly stated - not implied as in the current models. Activity objectives are crucial as they drive the selection of methods for each activity. Thus, our model guides the requirements engineer through the requirements generation process by providing a clear transition path for requirements through adequately decomposed, well-defined activities. Our model also incorporates a unique approach to verification and validation that enhances quality and reduces the cost of generating requirements. To assist in the selection of methods, we have mapped commonly used methods to activities based on their objectives. In addition, we have identified method selection criteria and prescribed a reduced set of methods that optimize these criteria for each activity defined by our requirements generation process. Thus, the defined approach assists in the task of selecting methods by using selection criteria to reduce a large collection of potential methods to a smaller, manageable set. The model and the set of methods, taken together, provide the much needed
Feature selection in large dataset processing, especially in the video domain
Authors: John R. Kender
Venue:  (2005)

The rapid growth and wide applications of digital video data have led to a significant need for video classification. Unfortunately, the gap between high-level concepts and low-level features and the high time cost of video analysis are two important obstacles of efficient video data management. Feature selection, which can improve the prediction performance of the predictors, provide faster and more cost-effective predictors, and provide better understanding of the data, is introduced to address these two problems. But applying existing automatic feature selection algorithms to video data is impractical because of the unrealistic amount of computer time. So far, most feature selection technologies in video applications are based on researchers' intuition although human interaction can't satisfy the dramatic increase of video data and the multiple requirements of different users. The first automatic feature selection algorithm we proposed is the Basic Sort-Merge Tree (BSMT), which is well-adapted to the characteristics of video data. The linear time cost of BSMT allows us the practical implementation of video frame categorization. To address the problem of sparse and noisy training data in video retrieval, we proposed the Complement Sort-Merge Tree (CSMT). CSMT detects complementary relationships shown in the outer wrapper model's results, in order to reduce the influence of more coarsely quantized prediction error. We provide empirical validation of this method by instructional video retrieval. Fast-converging Sort-Merge Tree (FSMT) speeds up BSMT further by setting up only a selected portion of the feature selection tree with two evaluation metrics, in order to satisfy the higher time cost requirement of on-line video retrieval. We demonstrate it with sports video shot classification. Multi-Level Feature selection (MLFS), based on the hierarchical structure of BSMT, permits a coarse-fine scene segmentation. The basic idea is to apportion different classification costs based on the classification difficulty of the different data. We demonstrate its improvement of the efficiency of video segment boundary detection compared with BSMT with instructional video scene segmentation. Based on the feature selection algorithms mentioned, we proposed a fast video retrieval system using different feature selection algorithms and lazy evaluation. To show universality of our feature selection algorithms, we also provide some theoretical analysis. We simulate different feature selection algorithms on common synthetic datasets. The performance is compared from accuracy, efficiency and robustness. Finally, we propose the further work from two aspects: how to improve the feature selection algorithms and how to apply feature selection algorithms to different applications better.
Direct chosen ciphertext security from identity-based techniques
Authors: Xavier Boyen, Qixiang Mei, Brent Waters
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

We describe a new encryption technique that is secure in the standard model against chosen ciphertext attacks. We base our method on two very efficient Identity-Based Encryption (IBE) schemes without random oracles due to Boneh and Boyen, and Waters.Unlike previous CCA2-secure cryptosystems that use IBE as a black box, our approach is very simple and compact. It makes direct use of the underlying IBE structure, and requires no cryptographic primitive other than the IBE scheme itself. This conveys several advantages. We achieve shorter ciphertext size than the best known instantiations of the other methods, and our technique is as efficient as the Boneh and Katz method (and more so than that of Canetti, Halevi, and Katz). Further, our method operates nicely on hierarchical IBE, and since it allows the validity of ciphertexts to be checked publicly, it can be used to construct systems with non-interactive threshold decryption.In this paper we describe two main constructions: a full encryption system based on the Waters adaptive-ID secure IBE, and a KEM based on the Boneh-Boyen selective-ID secure IBE. Both systems are shown CCA2-secure in the standard model, the latter with a tight reduction. We discuss several uses and extensions of our approach, and draw comparisons with other schemes that are provably secure in the standard model.
A Low Power ROM-Less Direct Digital Frequency Synthesizer with Preset Value Pipelined Accumulator
Authors: Jun Chen, Rong Luo, Huazhong Yang, Hui Wang
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

In this paper, a low-power ROM-less direct digital frequency synthesizer (DDFS) is presented. A preset value pipelined accumulator (PVPA) is proposed achieving update rates in excess of 500MHz by careful choice of the 12-7-7-6 4-stage pipelined architecture. Power dissipation is reduced by moving redundant registers and no phase latency is introduced when switching frequency. The phase to sine amplitude converter is entirely made up of combinational logic without ROM, and modified Sunderland approximation and power-gating technique are used to reduce its area and power, respectively. Moreover, a 2MSB truncated phase is introduced to one-quadrant phase to sine amplitude converter to improve the spurious free dynamic rang (SFDR) by 10dB. The design was implemented using a 0.18 m µ CMOS technology. It occupies a core area of 0.04mm2 and dissipates 17.2mW at 1.8 V supply voltage and 500 MHz clock.
City traffic simulation package and its utilization
Authors: Atilla Elci, Ali Zambakoǧlu
Venue: ACM SIGSIM Simulation Digest (1982)

Population explosion in larger cities and increase in vehicle density cause traffic problems in these areas. Intersections are the places where traffic is mostly blocked and most of the accidents occur. Signalization lights at the intersections aim to arrange the traffic flow and to avoid accidents. If not located properly or have bad timing, not only they fail to avoid accidents but also they cause disobeying, time loss and wearyness.Traffic assignment and management deal with those problems to minimize personal and social cost. The results of some mathematical models are applied. It is not easy to predict the cost of any decisions reached about traffic assignment and management, yet, using simulation, those decisions can be tested on a model representing the traffic network and the results thus can be seen before implementation.This study introduces a special purpose simulation program package developed for urban traffic network. The input of the package is data on roads, intersections, signalization lights, stops, traffic load and objective function parameters. Required changes to test differing management decisions can be made easily through keywords supplied and simulation may be repeated. A powerful user language designed and developed for use in data input, operation, and output is also an integral part of the package. Waiting times of vehicles, time and distance of trip, average speed, queue lengths and other statistical results are the output of the package. Such results can also be utilised automatically in evaluating a cost function declared by user in order to test various traffic management decisions.
Some comments on comments
Authors: Jon Sachs
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1976)

My objective here is to set out some (hopefully enlightening) opinions on the writing of comments in computer programs. Programmers probably spend more time writing and reading comments than any other kind of documentation. Thus it is strange that little attention has been given to the problem of making comments as useful as possible.
COOP - A cooperative caching service in MANETs
Authors: Yu Du, Sandeep K. S. Gupta
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Data access applications in Mobile Ad Hoc Networks (MANETs) suffer from intermittent network connections and restricted power supplies. While most of the researches focus on Media Access Control (MAC) and routing layer solutions, we explore the possibility of application cooperation. In this paper, we propose COOP, a novel cooperative caching service for data access applications in MANETs. The objective is to improve data availability and access efficiency by collaborating local resources of mobile devices. COOP addresses two basic problems of cooperative caching: cache resolution and cache management, i.e. how to find the requested data efficiently and how to manage local cache to improve the capacity of cooperated caches. The simulation results show that the service significantly reduces response delay and improves data availability for data access applications in MANETs.
Tracking the Optimal Configuration of a Bluetooth Scatternet
Authors: Csaba Kiss Kallo, Roberto Battiti, Carla-Fabiana Chiasserini, Marco Ajmone Marsan
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

In this work we present an approach for maintaining the topology of a Bluetooth scatternet at an optimal configuration despite the dynamic behavior of the nodes in time. Our goal is to keep the ratio of the average scatternet throughput and node power consumption as high as possible while nodes unpredictably change their communication peers and migrate across the network. The approach consists in keeping the total number of hops between communicating nodes relatively low by periodically reconfiguring the scatternet topology based on the actual traffic pattern of the network.