ppxscal/embedding_network huggingface dataset:
Clustered Workflow Execution of Retargeted Data Analysis Scripts
Authors: Daniel L. Wang, Charles S. Zender, Stephen F. Jenks
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Supercomputing advances have enabled computational science data volumes to grow at ever increasing rates, commonly resulting in moredata produced than can be practically analyzed. Whole-dataset download costs have grown to impractical heights, even with multi-Gbps networks, forcing scientists to rely on server-side subsetting and limiting the scope of data they can analyze on a workstation. Our system supplements existing scientific data services with lightweight computational capability, providing a means of safely relocating analysis from the desktop to the server where clustered execution can be coordinated, exploiting data locality, reducing unnecessary data transfer, and providing end-users with results several times faster. We show how dataflow and other compiler-inspired analyses of shell scripts of scientists' most common analysis tools enables parallelization and optimizations in disk and network I/O bandwidth. We benchmark using an actual geoscience analysis script, illustrating the crucial performance gains of extracting workflows defined in scripts and optimizing their execution. Current results quantify significant improvements in performance, showing the promise of bringing transparent high-performance analysis to the scientist's desktop.
BEND: MAC-layer proactive mixing protocol for network coding in multi-hop wireless networks
Authors: Jian Zhang
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

We present BEND, a MAC layer solution to practical network coding in multi-hop wireless networks. It is the first exploration of the broadcasting nature of wireless channels to proactively capture more coding opportunities. In BEND, any node can code and forward a packet even when the node is not the intended MAC receiver of the packet, if the node believes that in doing so it can lead the packet to its ultimate destination. Essentially, BEND considers the union of all interface queue contents at the nodes within a neighborhood, i.e. a "neighborhood coding repository", whereas traditional mixing methods only process "individual coding repositories" at separate nodes.
Evolutionary design of modular robotic arms
Authors: O. Chocron
Venue: Robotica (2008)

This paper proposes a method for task based design of modular serial robotic arms using evolutionary algorithms (EA). We introduce a 3D kinematics and a global optimization for both topology and configuration from task specifications. The search features revolute as well as prismatic joints and any number of DOF to build up a solution without using any design knowledge. A study of the evolution dynamics gives some keys to set evolution parameters that enable artificial evolution. An adapted algorithm dealing with the topology/configuration search tradeoff is proposed, descibed, and discussed. Illustrations of the algorithms results are given and conclusions are drawn from their analysis. Perspectives of this work are given, extending its reach to control and complex system design.
A proposal for an integrated assessment and selection method for a research and development project
Authors: Yoshiki Nakamura
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

Technology management is now a key theme in Japan. This study will focus on the "assessment and selection of research and development project" aimed at for the development of new technology and products. For this reason, the assessment of various kinds of projects will be conducted on a number of assumptions. That is: (1) whether the project is in accordance with the business and technological strategies, (2) what contribution and possibilities it carries, and (3) whether the company has the talent and technological ability required by the project plan. Moreover, the more effective R&D plan should be chosen through resource restrictions based on the former assessment. The final aim is to help in the decision-making on investment distribution for R&D projects in project-assess-select-meetings. This paper tries to confirm the validity of the methods. In doing this, the paper highlights several concrete examples, complete with numeric figures. The data has been made available through the kind cooperation of one of the leading automobile companies in Japan.
Proceedings of the 5th symposium on Applied perception in graphics and visualization
Venue: Applied Perception in Graphics and Visualization (2008)

This book contains the proceedings of the Fifth Symposium on Applied Perception in Graphics and Visualization, which was held in Los Angeles, U.S.A. on August 9-10, 2008. APGV is an annual event, sponsored by ACM SIGGRAPH, which brings together researchers from the fields of perception, graphics and visualization. The general goals are to use insights from perception to advance the design of methods for visual, auditory and haptic representation, and to use computer graphics to enable perceptual research that would otherwise not be possible. We received 42 full paper submissions for this year's AGPV. Each submission was reviewed by at least three members of the Program Committee, and we decided to accept 23 of these as full papers, to be presented as Oral presentations at the conference (16 as long papers, and 7 as short papers). The Proceedings also include 16 one-page abstracts describing Poster presentations. The posters include summaries of paper submissions that were not accepted for Oral presentation, as well as separate poster submissions. The Oral Papers cover a wide range of topics. We have classified the papers into seven categories, corresponding to the sessions: &bull; Virtual Environments: (I) Depth Perception and (II) Motion &bull; Attention and Eye Tracking, &bull; Faces, Characters, and Crowds, &bull; Image Processing and Rendering, &bull; Animation, &bull; Lighting, Shading, and Textures, &bull; Visualization. This year, in addition to the reviewed contributions, we are honored to have a Keynote Speaker, Martin S. Banks (University of California, Berkeley), whose talk is entitled "Incorrect Focus Cues in Stereo Displays: Effects on Visual Performance and Viewer Fatigue." Marty Banks exemplifies a collaborative and interdisciplinary approach to perception with his leading research in areas of binocular vision and space perception, self-motion perception and navigation, and multisensory integration.
Multi-objective decision making model under fuzzy random environment and its application to inventory problems
Authors: Jiuping Xu, Yonggang Liu
Venue: Information Sciences: an International Journal (2008)

In this paper, we concentrate on developing a fuzzy random multi-objective model about inventory problems. By giving some definitions and discussing some properties of fuzzy random variable, we design a method of solving solution sets of fuzzy random multi-objective programming problems. These are applied to numerical inventory problems in which all inventory costs, purchasing and selling prices in the objectives and constraints are assumed to be fuzzy random variables in nature, and then the impreciseness of fuzzy random variables in the above objectives and constraints are transformed into fuzzy variables which are similar trapezoidal fuzzy numbers. The exact parameters of fuzzy membership function and probability density function can be obtained through fuzzy random simulating the past dates. By comparing the results with those from the fuzzy multi-objective models, we believe that the proposed fuzzy random multi-objective model and hybrid intelligent algorithm provide significant solutions to construct other inventory models with fuzzy random variables in real life.
Using a Game Engine for VR Simulations in Evacuation Planning
Authors: Antônio Carlos A. Mól, Carlos Alexandre F. Jorge, Pedro M. Couto
Venue: IEEE Computer Graphics and Applications (2008)

A game engine is applied to virtual simulations of emergency evacuation from a modeled building of Brazil's Nuclear Engineering Institute (IEN). Researchers tested evacuation scenarios to compare the virtual simulations to real simulations using real people in the real building. The results compared favorably and provide a basis for further experiments to improve user interfaces and avatar autonomy.
Generating test images and halftoning filters with co-evolutionary GA
Authors: Timo Mantere
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

In this paper, we evaluate the potentials of using co-evolutionary optimization method to automatically generate both halftoning filters for the image processing software and test images for them. One genetic algorithm generates halftone filters and at the same time, another genetic algorithm tries to create the hardest test image for each filter. The best filter being the one for which the hardest test image, when dithered, differs least from the original. An image population defines the fitness of halftoning filters and respectively filter population defines the fitness of test image.
Partitions of difference sets and code synchronization
Authors: Vladimir D. Tonchev
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

Difference systems of sets can be used to transform an arbitrary linear code to a coset of a linear code with a given comma-free index by means of a minimal increase of its length. The paper discusses some constructions of difference systems of sets obtained from cyclic difference sets and finite geometry.
3D dynamic grouping for guided stylization
Authors: Hedlena Bezerra, Elmar Eisemann, Xavier Décoret, Joëlle Thollot
Venue: Proceedings of the 6th international symposium on Non-photorealistic animation and rendering (2008)

In art, grouping plays a major role to convey relationships of objects and the organization of scenes. It is separated from style, which only determines how groups are rendered to achieve a visual abstraction of the depicted scene. We present an approach to interactively derive grouping information in a dynamic 3D scene. Our solution is simple and general. The resulting grouping information can be used as an input to any "rendering style". We provide an efficient solution based on an extended mean-shift algorithm customized by user-defined criteria. The resulting system is temporally coherent and real-time. The computational cost is largely determined by the scene's structure rather than by its geometric complexity.
Evidence Contrary to the Statistical View of Boosting
Authors: David Mease, Abraham Wyner
Venue: The Journal of Machine Learning Research (2008)

The statistical perspective on boosting algorithms focuses on optimization, drawing parallels with maximum likelihood estimation for logistic regression. In this paper we present empirical evidence that raises questions about this view. Although the statistical perspective provides a theoretical framework within which it is possible to derive theorems and create new algorithms in general contexts, we show that there remain many unanswered important questions. Furthermore, we provide examples that reveal crucial flaws in the many practical suggestions and new methods that are derived from the statistical view. We perform carefully designed experiments using simple simulation models to illustrate some of these flaws and their practical consequences.
Brain-scale simulation of the neocortex on the IBM Blue Gene/L supercomputer
Authors: M. Djurfeldt, M. Lundqvist, C. Johansson, M. Rehn, Ö. Ekeberg, A. Lansner
Venue: IBM Journal of Research and Development (2008)

Biologically detailed large-scale models of the brain can now be simulated thanks to increasingly powerful massively parallel supercomputers. We present an overview, for the general technical reader, of a neuronal network model of layers II/III of the neocortex built with biophysical model neurons. These simulations, carried out on an IBM Blue Gene/L™ supercomputer, comprise up to 22 million neurons and 11 billion synapses, which makes them the largest simulations of this type ever performed. Such model sizes correspond to the cortex of a small mammal. The SPLIT library, used for these simulations, runs on single-processor as well as massively parallel machines. Performance measurements show good scaling behavior on the Blue Gene/L supercomputer up to 8,192 processors. Several key phenomena seen in the living brain appear as emergent phenomena in the simulations. We discuss the role of this kind of model in neuroscience and note that full-scale models may be necessary to preserve natural dynamics. We also discuss the need for software tools for the specification of models as well as for analysis and visualization of output data. Combining models that range from abstract connectionist type to biophysically detailed will help us unravel the basic principles underlying neocortical function.
VLAM-G: Interactive data driven workflow engine for Grid-enabled resources
Authors: Vladimir Korkhov, Dmitry Vasyunin, Adianto Wibisono, Adam S. Z. Belloum, Márcia A. Inda, Marco Roos, Timo M. Breit, L. O. Hertzberger
Venue: Scientific Programming (2007)

Grid brings the power of many computers to scientists. However, the development of Grid-enabled applications requires knowledge about Grid infrastructure and low-level API to Grid services. In turn, workflow management systems provide a high-level environment for rapid prototyping of experimental computing systems. Coupling Grid and workflow paradigms is important for the scientific community: it makes the power of the Grid easily available to the end user. The paradigm of data driven workflow execution is one of the ways to enable distributed workflow on the Grid. The work presented in this paper is carried out in the context of the Virtual Laboratory for e-Science project. We present the VLAM-G workflow management system and its core component: the Run-Time System (RTS). The RTS is a dataflow driven workflow engine which utilizes Grid resources, hiding the complexity of the Grid from a scientist. Special attention is paid to the concept of dataflow and direct data streaming between distributed workflow components. We present the architecture and components of the RTS, describe the features of VLAM-G workflow execution, and evaluate the system by performance measurements and a real life use case.
Structuring collections with Scatter/Gather extensions
Authors: Omar Alonso, Justin Talbot
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

A major component of sense-making is organizing--grouping, labeling, and summarizing--the data at hand in order to form a useful mental model, a necessary precursor to identifying missing information and to reasoning about the data. Previous work has shown the Scatter/Gather model to be useful in exploratory activities that occur when users encounter unknown document collections. However, the topic structure communicated by Scatter/Gather is closely tied to the behavior of the underlying clustering algorithm; this structure may not reflect the mental model most applicable to the information need. In this paper we describe the initial design of a mixed-initiative information structuring tool that leverages aspects of the well-studied Scatter/Gather model but permits the user to impose their own desired structure when necessary.
On the Linear Stability of Splitting Methods
Authors: Sergio Blanes, Fernando Casas, Ander Murua
Venue: Foundations of Computational Mathematics (2008)

A comprehensive linear stability analysis of splitting methods is carried out by means of a 2&#x00d7;2 matrix K(x) with polynomial entries (the stability matrix) and the stability polynomial p(x) (the trace of K(x) divided by two). An algorithm is provided for determining the coefficients of all possible time-reversible splitting schemes for a prescribed stability polynomial. It is shown that p(x) carries essentially all the information needed to construct processed splitting methods for numerically approximating the evolution of linear systems. By conveniently selecting the stability polynomial, new integrators with processing for linear equations are built which are orders of magnitude more efficient than other algorithms previously available.
A Hybrid RBAC-PBAC Access Control Model for Network Isolation System
Authors: Haiyan Wu, Chengxiang Tan, Haihang Wang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Network isolation system integrates various technologies to achieve its high-security performance and access control is an indispensable one among them. In order to control and manage accesses to all the services provided by network isolation system, we need to establish an efficient access control model and make a set of fine-grained rules for the model. In this paper, we analyze service access control requirements in network isolation system firstly. And, according to the special running environment, we propose a hybrid service access control model based on RBAC (Rolebased Access Control) and PBAC (Police-based Access Control). Then, we research rules making and realization method of the proposed model. In the end, we realize the hybrid model and its configuration.
Simultaneous optimization of battery-aware voltage regulator scheduling with dynamic voltage and frequency scaling
Authors: Youngjin Cho, Younghyun Kim, Yongsoo Joo, Kyungsoo Lee, Naehyuck Chang
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

Energy-aware task scheduling significantly reduces the total energy required by a system to perform a particular job, by dynamically changing the clock frequency and supply voltage at which the CPU operates. But this causes significant fluctuation of the current drawn from the power source, so that no single voltage regulator can achieve satisfactory efficiency over the entire range of operating currents. We introduce a new method of high-level power management called dynamic voltage regulator scheduling (DRS), which overcomes the fundamental limitation of using a single voltage regulator. In a system equipped with DRS, heterogeneous voltage regulators are connected to a CPU through a multiplexer-type MOSFET switch. As the operating frequency and the supply voltage of the CPU vary, the most efficient voltage regulator is used to supply the power. We first describe a greedy method of achieving DRS, and then we progress to an integer linear programming (ILP) formulation, which simultaneously optimizes DRS together with dynamic voltage and frequency scaling (DVFS). We evaluate the performance of both greedy DRS and optimal DRS. Compared to conventional DVFS, greedy DRS saves an additional 5.4% to 14.6% of the total system energy; and optimal DRS saves an additional 11.5% to 15.5%.
Principles of Model Checking (Representation and Mind Series)
Authors: Christel Baier, Joost-Pieter Katoen
Venue:  (2008)

Our growing dependence on increasingly complex computer and software systems necessitates the development of formalisms, techniques, and tools for assessing functional properties of these systems. One such technique that has emerged in the last twenty years is model checking, which systematically (and automatically) checks whether a model of a given system satisfies a desired property such as deadlock freedom, invariants, or request-response properties. This automated technique for verification and debugging has developed into a mature and widely used approach with many applications. Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field. The book begins with the basic principles for modeling concurrent and communicating systems, introduces different classes of properties (including safety and liveness), presents the notion of fairness, and provides automata-based algorithms for these properties. It introduces the temporal logics LTL and CTL, compares them, and covers algorithms for verifying these logics, discussing real-time systems as well as systems subject to random phenomena. Separate chapters treat such efficiency-improving techniques as abstraction and symbolic manipulation. The book includes an extensive set of examples (most of which run through several chapters) and a complete set of basic results accompanied by detailed proofs. Each chapter concludes with a summary, bibliographic notes, and an extensive list of exercises of both practical and theoretical nature.
AMTrac: adaptive meta-caching for transcoding
Authors: Dongyu Liu, Songqing Chen, Bo Shen
Venue: Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video (2006)

The increase of aggregate Internet bandwidth and the rapid development of 3G wireless networks demand efficient delivery of multimedia objects to all types of wireless devices. To handle requests from wireless devices at runtime, the transcode-enabled caching proxy has been proposed and a lot of research has been conducted to study online transcoding. Since transcoding is a CPU-intensive task, the transcoded versions can be saved to reduce the CPU load for future requests. However, extensively caching all transcoded results can quickly exhaust cache space. Constrained by available CPU and storage, existing transcode-enabled caching schemes always selectively cache certain transcoded versions, expecting that many future requests can be served from the cache while leaving CPU cycles for online transcoding for other requests. But such schemes treat the transcoder as a black box, leaving little room for flexible control of joint resource management between CPU and storage. In this paper, we first introduce the idea of meta-caching by looking into a transcoding procedure. Instead of caching certain selected transcoded versions in full, meta-caching identifies intermediate transcoding steps from which certain intermediate results (called metadata) can be cached so that a fully transcoded version can be easily produced from the metadata with a small amount of CPU cycles. Achieving big saving in caching space with possibly small sacrifice on CPU load, the proposed meta-caching scheme provides a unique method to balance the utilization of CPU and storage resources at the proxy. We further construct a model to analyze the meta-caching scheme. Based on modeling results, we propose AMTrac, Adaptive Meta-caching for Transcoding, which adaptively applies meta-caching based on the client request pattern and available resources. Experimental results show that our proposed AMTrac can significantly improve the system throughput over existing approaches.
On the diameter of finite groups
Authors: L. Babai
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

The diameter of a group G with respect to a set S of generators is the maximum over g in G of the length of the shortest word in S union S/sup -1/ representing g. This concept arises in the contexts of efficient communication networks and Rubik's-cube-type puzzles. 'Best' generators are pertinent to networks, whereas 'worst' and 'average' generators seem more adequate models for puzzles. A substantial body of recent work on these subjects by the authors is surveyed. Regarding the 'best' case, it is shown that, although the structure of the group is essentially irrelevant if mod S mod is allowed to exceed (log mod G mod )/sup 1+c/(c>0), it plays a strong role when mod S mod =O(1).