ppxscal/embedding_network huggingface dataset:
Adaptive parameter control of evolutionary algorithms to improve quality-time trade-off
Authors: Sandip Aine, Rajeev Kumar, P. P. Chakrabarti
Venue: Applied Soft Computing (2009)

Parameter control of evolutionary algorithms (EAs) poses special challenges as EA uses a population and requires many parameters to be controlled for an effective search. Quality improvement is dependent on several factors, such as, fitness estimation, population diversity and convergence rate. A widely practiced approach to identify a good set of parameters for a particular class of problem is through experimentation. Ideally, the parameter selection should depend on the resource availability, and thus, a rigid choice may not be suitable. In this work, we propose an automated framework for parameter selection, which can adapt according to the constraints specified. To condition the parameter choice through resource constraint/utilization, we consider two typical scenarios, one where maximum available run-time is pre-specified and the other in which a utility function modeling the quality-time trade-off is used instead of a rigid deadline. We present static and dynamic parameter selection strategies based on a probabilistic profiling method. Experiments performed with traveling salesman problem (TSP) and standard cell placement problem show that an informed adaptive parameter control mechanism can yield better results than a static selection.
Computing with Priced Information: When the Value Makes the Price
Authors: Ferdinando Cicalese, Martin Milanič
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

We study the function evaluation problem in the priced information framework introduced in [Charikar et al. 2002]. We characterize the best possible extremal competitive ratio for the class of game tree functions. Moreover, we extend the above result to the case when the cost of reading a variable depends on the value of the variable. In this new value dependent cost variant of the problem, we also exactly evaluate the extremal competitive ratio for the whole class of monotone Boolean functions.
Alert Detection in System Logs
Authors: Adam J. Oliner, Alex Aiken, Jon Stearley
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

We present Nodeinfo, an unsupervised algorithm for anomaly detection in system logs. We demonstrate Nodeinfo's effectiveness on data from four of the world's most powerful supercomputers: using logs representing over 746 million processor-hours, in which anomalous events called alerts were manually tagged for scoring, we aim to automatically identify the regions of the log containing those alerts. We formalize the alert detection task in these terms, describe how Nodeinfo uses the information entropy of message terms to identify alerts, and present an online version of this algorithm, which is now in production use. This is the first work to investigate alert detection on (several) publicly-available supercomputer system logs, thereby providing a reproducible performance baseline.
A Self-tuning People Identification System from Split Face Components
Authors: Maria Marsico, Michele Nappi, Daniel Riccio
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

Multimodal systems can solve a number of problems found in unimodal approaches. We experimented going further along this line, by dividing the face into distinct regions (components) and processing each of them within a single subsystem. Such subsystems are then embedded in a more complex multicomponent architecture. In this way, typical tools of multimodal systems, such as reliability margins or fusion schemes, can be usefully extended to the single face biometry. An additional innovation element in this work is the definition of a global system auto-verification and auto-tuning policy able to produce a significant accuracy enhancement. The paper explores three integration architectures with different subsystem interconnection degree, demonstrating that a tight component interaction increases system accuracy and allows identifying unstable subsystems.
Post-routing redundant via insertion with wire spreading capability
Authors: Cheok-Kei Lei, Po-Yi Chiang, Yu-Min Lee
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Redundant via insertion is a widely recommended technique to enhance the via yield and reliability. In this paper, the post-routing redundant via insertion problem is transformed to a mixed bipartite-conflict graph matching problem, and an efficient heuristic minimum weighted matching (HMWM) algorithm is presented to solve it. The developed method not only inserts redundant vias for alive vias but also protects the dead vias by utilizing the wire spreading capability-- that's to say, the method shifts wires into the empty space and adds redundant vias for dead vias to further enhance the via yield. Experimental results show that the average insertion rate of alive vias is 99.54% with a short run time, and the wire spreading technique can achieve average insertion rate to be 54.41% for dead vias.
A more effective linear kernelization for cluster editing
Authors: Jiong Guo
Venue: Theoretical Computer Science (2009)

In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k>=0. The question is whether we can transform G, by inserting and deleting at most k edges, into a cluster graph, that is, a union of disjoint cliques. We first confirm a conjecture by Michael Fellows [IWPEC 2006] that there is a polynomial-time kernelization for Cluster Editing that leads to a problem kernel with at most 6k vertices. More precisely, we present a cubic-time algorithm that, given a graph G and an integer k>=0, finds a graph G^' and an integer k^'@?k such that G can be transformed into a cluster graph by at most k edge modifications iff G^' can be transformed into a cluster graph by at most k^' edge modifications, and the problem kernel G^' has at most 6k vertices. So far, only a problem kernel of 24k vertices was known. Second, we show that this bound for the number of vertices of G^' can be further improved to 4k vertices. Finally, we consider the variant of Cluster Editing where the number of cliques that the cluster graph can contain is stipulated to be a constant d>0. We present a simple kernelization for this variant leaving a problem kernel of at most (d+2)k+d vertices.
Particle Swarm Optimization Applied to Restoration of Electrical Energy Distribution Systems
Authors: Germano Lambert-Torres, Helga Gonzaga Martins, Maurilio Pereira Coutinho, Camila Paes Salomon, Leonardo Schilling Filgueiras
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

This paper presents a technical application of the Particule Swarm Optimization - PSO technique to a reconfiguration problem of a electrical energy distribution system. The proposed methodology consists of the use of the maximization function of the number of loads supplied and the loss minimization by the expansion of the original PSO. The approach utilized the Distribution_System_01. A number of tests were carried out in the system to simulate several fault occurrences in the electrical energy transmission lines. The PSO algorithm encountered the optimal solution in a reasonable CPU time, compared to the dimension of the distribution system.
Defining an OWL Ontology That Could Be Used to Integrate Mental-Health Risk Information within a Decision Support System
Authors: Naomi Wrighton, Christopher D. Buckingham
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

In the field of mental health risk assessment, there is no standardisation between the data used in different systems. As a first step towards the possible interchange of data between assessment tools, an ontology has been constructed for a particular one, GRiST (Galatean Risk Screening Tool). We briefly introduce GRiST and its data structures, then describe the ontology and the benefits that have already been realised from the construction process. For example, the ontology has been used to check the consistency of the various trees used in the model. We then consider potential uses in integration of data from other sources.
Modeling and analysis of a 2-DOF bidirectional electro-thermal microactuator
Authors: Caglar Elbuken, Nezih Topaloglu, Patricia M. Nieva, Mustafa Yavuz, Jan P. Huissoon
Venue: Microsystem Technologies (2009)

In this paper, a four hot-arm U-shape electro-thermal actuator that can achieve bidirectional motion in two axes is introduced. By selectively applying voltage to different pairs of its four arms, the device can provide actuation in four directions starting from its rest position. It is shown that independent in-plane and out-of-plane motions can be obtained by tailoring the geometrical parameters of the system. The lumped model of the microactuator was developed using electro-thermal and thermo-mechanical analyses and validated using finite element simulations. The device has been fabricated using PolyMUMPs and experimental results are in good agreement with the theoretical predictions. Total in-plane deflections of 4.8&#x00a0;&#x03bc;m (2.4&#x00a0;&#x03bc;m in either direction) and upward out-of-plane deflections of 8.2&#x00a0;&#x03bc;m were achieved at 8&#x00a0;V of input voltage. The large achievable deflections and the higher degree-of-freedom of the proposed device compared to its counterparts, foresee its use in diverse MEMS applications.
Supporting government cost planning of industrial wastewater treatment
Authors: Edward H. Pechan, Ralph A. Luken, Jacob E. Mendelssohn
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The 1972 Federal Water Pollution Control Act Amendments established a series of national goals with the purpose of reducing and eliminating water borne pollution in the United States. One of these goals requires the implementation of best practicable control technology by all industrial dischargers by 1977.
A new fourth generation of hybrid computer systems
Authors: Robert M. Howe, Aldric Saucier
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

It has long been recognized that hybrid computer systems are more cost effective than digital computers in solving many types of dynamic problems. This indeed has been the reason for the sizable number of hybrid computer systems currently in operation. The one to two order of magnitude speed advantage which hybrid computers enjoy over digital computers in solving differential equations is due to the speed of the analog subsystem. This high speed results from the high bandwidth (up to 1 megahertz) of the analog components and the parallel configuration of the analog mechanization.
Implementing data management
Authors: Daniel S. Appleton
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Most businesses go through three distinct phases as they implement computer technology. In the first phase, they automate specific, reasonably well defined processes such as payables, receivables, invoicing and sales. In phase two, old applications are integrated and new applications are added either as integrated processes or as stand alone applications. In the third phase, a company database is established and users are given access to the information stored there.
On lattices whose minimal vectors form a 6-design
Authors: Gabriele Nebe, Boris Venkov
Venue: European Journal of Combinatorics (2009)

Let L be a lattice of dimension n@?24 such that the minimal vectors of L form a 6-design and generate L. Then L is similar to either the root lattice E"8, the Barnes-Wall lattice BW"1"6, the Leech lattice @L"2"4, or n=23. For n=23 we conjecture that the only possibilities for L are the shorter Leech lattice O"2"3 or its even sublattice @L"2"3.
Model Design for Transmission Congestion Management Based on Fuzzy Programming
Authors: Yu Zhao, Bo Zhao, Chunjie Qi
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Based on data collected previously on the electricity market of the East China, we use stepwise regression method to find the approximate expression of the active power flow of each power sets on East China’s certain electrical network. Then classified discussion is carried out according to the difference of the capacity in and out of merit in order to obtain a simple and reasonable rule for calculating the block cost. Based on this, the objective programming model for output distribution of each unit is achieved. Exclude conditions step by step, and adjust the output allocation plan. Introduce flexible factors defining membership function to change fuzzy programming into non-fuzzy programming, and use genetic algorithm to get solution. The model considers both safety and cost so that different network operators can get their preferred allocation plan.
Parametric characterization of aggregation functions
Authors: Anna Kolesárová, Radko Mesiar
Venue: Fuzzy Sets and Systems (2009)

The aim of this contribution is to find a common framework for parametric characterization of aggregation functions exploiting the notions of unipolar and bipolar parametric characterization, and also unify the ideas of global and local parametric characterization. We revise the known approaches to classification of aggregation functions in special classes in this framework, and also propose some new parameters in classes of averaging, conjunctive and disjunctive aggregation functions.
Keynote: Challenges on the Road to Exascale Computing
Authors: Tilak Agerwala
Venue: Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers (2008)

Supercomputing systems have made great strides in recent years as the extensive computing needs of cutting-edge engineering work and scientific discovery have driven the development of more powerful systems. In 2008, we saw the arrival of the first petaflop machine, which quickly topped the Top500 list, while also occupying the number one position on the Green500 list. Historic trends indicate that in ten years, we should be at the exascale level. We believe that applications in many industries will be materially transformed by exascale systems and will drive systems not just to 1000X in raw performance but to equally dramatic improvements in data intensive computing and real time stream processing.Meeting the exascale challenge will require significant innovation in technology, architecture and programmability. Power is a fundamental problem at all levels; traditional memory cost and performance are not keeping pace with compute potential; the storage hierarchy will have to be re-architected; networks will be a much bigger part of the system cost; reliability at exascale levels will require a holistic approach to architecture design, and programmability and ease-of-use will be an essential component to extract the promised performance at the exascale level.In this talk, I will discuss the major challenges of exascale computing, touching on the areas of technology, architecture, reliability, programmability and usability.Biography of Tilak AgerwalaTilak Agerwala is vice president, Systems at IBM Research. He is responsible for developing the next-generation technologies for IBM's systems, from microprocessors to commercial systems and supercomputers, as well as novel supercomputing algorithms and applications. Dr. Agerwala joined IBM at the T.J. Watson Research Center and has held executive positions at IBM in research, advanced development, marketing and business development. His research interests are in the area of high performance computer architectures and systems. Dr. Agerwala received the W. Wallace McDowell Award from the IEEE in 1998 for outstanding contributions to the development of high performance computers. He is a founding member of the IBM Academy of Technology. He is a Fellow of the Institute of Electrical and Electronics Engineers. He received his B.Tech. in electrical engineering from the Indian Institute of Technology, Kanpur, India and his Ph.D. in electrical engineering from the Johns Hopkins University, Baltimore, Maryland.
Draining Algorithm for the Maximum Flow Problem
Authors: Jiyang Dong, Wei Li, Congbo Cai, Zhong Chen
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

A new augmenting path based algorithm called draining algorithm is proposed for the maximum flow problem in this letter. Unlike other augmenting path based algorithms which augment gradually the flow from zero-flow to the maximum flow, the proposed algorithm drains the redundant capacities out of the network to achieve the maximum flow. Experimental results shown the high efficiency of the proposed algorithm in near saturated network, thought it has a same computational complex with the traditional augmenting path approach for regular flow networks.
Finding Alternative Clusterings Using Constraints
Authors: Ian Davidson, Zijie Qi
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

The aim of data mining is to find novel and actionable insights. However, most algorithms typically just find a single explanation of the data even though alternatives could exist. In this work, we explore a general purpose approach to find an alternative clustering of the data with the aid of must-link and cannot-link constraints. This problem has received little attention in the literature and since our approach can be incorporated into the many clustering algorithms that use a distance function, compares favorably with existing work.
Improving capacity and QoS of VoIP in IEEE 802.11e wireless LANs
Authors: Lin Zhang, Ke Yu, Yingtian Du, Xinghua Wen
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Wireless local area networks (WLANs) have been rapidly developed in recent years for various applications. VoWLAN, which transmits VoIP data over WLANs, shows its amazing attraction and constitutes one of the most flourishing applications nowadays in WLANs. How to improve the capacity while providing QoS of VoWLAN is a big concern for network planners. In this paper, we propose and validate an improved Markov analysis model to study the performance of VoWLAN. Based on the developed analytical model, we bring forward a solution that boosts the capacity high enough to support larger number of calls than existing schemes, with fair call quality. The solution comes in two parts: Frame Enqueue Rear-end Aggregation and Device Differentiation Configuration. We demonstrate the performance of the proposed approach through extensive simulation based on NS-2 and Linux-based VoWLAN environment. The experimental results are very promising; the VoIP capacity was improved by 163.7%.
Virtual Prototype Modeling and Fast Dynamic Simulation of the Complete Integrated Sea Trial System for Deep-Ocean Mining
Authors: Yu Dai, Shaojun Liu, Li Li, Yan Li, Gang Wang, Xiren Cao
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

The virtual prototype model for fast simulation analysis of the complete integrated sea trial system for deep ocean mining is built up based on single-body model of the seafloor tracked miner and discrete element model of the pipeline system. Dynamic simulation analysis is performed and investigated taking into account the interactions between each subsystem and corresponding complex ocean environment. Both for the tracked miner and the pipeline system, two different modeling and simulation methods are considered and compared with regard to computational efficiency and solution accuracy. Focusing mainly on the integrity and rapidity of the dynamic simulation of the total mining system, the seafloor miner is preferred to be modeled as a single-body with 6 degrees of freedom, which allows real-time simulation, while the interaction model between the miner and seafloor soft cohesive soil is built based on the theory of terramechanics and with consideration of seafloor soil special mechanical characteristics. The pipeline subsystem including the lifting pipe, pumps, the buffer and the flexible hose is chosen to be built as 3-D discrete element model which is divided into rigid elements linked by flexible connectors, and external forces such as the hydrodynamic forces due to the maritime sea current, the buoyancy forces acting at discrete locations on the flexible hose are considered. The simulation analysis results are obtained and discussed, which in a way can reflect the actual working conditions and provide useful guidance and reference for the practical deep ocean mining system design and operation.
The Power of Small Coalitions in Cost Sharing
Authors: Florian Schoppmann
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

In a cost-sharing problem, finitely many players have an unknown preference for some public excludable good (service), and the task is to determine which players to serve and how to distribute the incurred cost. Therefore, incentive-compatible mechanisms are sought that elicit truthful bids, charge prices that recover the cost, and are economically efficient in that they reasonably balance cost and valuations. A commonplace notion of incentive-compatibility in cost sharing is group-strategyproofness (GSP), meaning that not even coordinated deceit is profitable. However, GSP makes strong implications on players' coordination abilities and is known to impose severe limitations on other goals in cost sharing. There is hence good reason to seek for a weaker axiom: In this work, we study the following question: Does relaxing GSP to resilience only against coalitions of bounded size yield a richer set of possible mechanisms? Surprisingly, the answer is essentially "no": We prove that already a mechanism resilient to coalitions of size only two ("2-GSP") is GSP, once we require that cost shares must only depend on the service allocation (and not directly on the bids). Moreover, we show that even without additional requirements, 2-GSP implies weak group-strategyproofness (WGSP). Consequently, our results give some justification that GSP may, after all, still be desirable in various scenarios. As another benefit, we believe that our characterizations will facilitate devising and understanding new GSP cost-sharing mechanisms. Finally, we relate our findings to other concepts of non-manipulability such as (outcome) non-bossiness [19] and weak utility non-bossiness [13].
High-resolution DOA estimation based on independent noise component for correlated signal sources
Authors: Shiaw-Wu Chen, Chih-Wei Jen, Ann-Chen Chang
Venue: Neural Computing and Applications (2009)

In this article, a modified complex-valued FastICA algorithm is utilized to extract the specific feature of the Gaussian noise component from mixtures so that the estimated component is as independent as possible to the other non-Gaussian signal components. Once the noise basis vector is obtained, we can estimate direction of arrival by searching the array manifold for direction vectors, which are as orthogonal as possible to the estimated noise basis vector especially for highly correlated signals with closely spaced direction. Superior resolution capabilities achieved with the proposed method in comparison with the conventional multiple signal classification (MUSIC) method, the spatial smoothing MUSIC method, and the signal subspace scaled MUSIC method are shown by simulation results.