ppxscal/embedding_network huggingface dataset:
Fractional factorial design for parameter sweep experiments using Nimrod/E
Authors: T. C. Peachey, N. T. Diamond, D. A. Abramson, W. Sudholt, A. Michailova, S. Amirriazi
Venue: Scientific Programming (2008)

The techniques of formal experimental design and analysis are powerful tools for scientists and engineers. However, these techniques are currently underused for experiments conducted with computer models. This has motivated the incorporation of experimental design functionality into the Nimrod tool chain. Nimrod has been extensively used for exploration of the response of models to their input parameters; the addition of experimental design tools will combine the efficiency of carefully designed experiments with the power of distributed execution. This paper describes the incorporation of one type of design, the fractional factorial design, and associated analysis tools, into the Nimrod framework. The result provides a convenient environment that automates the design of an experiment, the execution of the jobs on a computational grid and the return of results, and which assists in the interpretation of those results. Several case studies are included which demonstrate various aspects of this approach.
A Realtime Observatory for Laboratory Simulation of Planetary Circulation
Authors: S. Ravela, J. Marshall, C. Hill, A. Wong, S. Stransky
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

We present a physical, laboratory-scale analog of large-scale atmos- pheric circulation and develop an observatory for it. By combining observations of a hydro-dynamically unstable flow with a 3D numerical fluid model, we obtain a real-time estimate of the state of the evolving fluid which is better than either model or observations alone. To the best of our knowledge this is the first such observatory for laboratory simulations of planetary flows that functions in real time. New algorithms in modeling, parameter and state estimation, and observation targeting can be rapidly validated, thus making weather and climate application accessible to computational scientists. Properties of the fluid that cannot be directly observed can be effectively studied by a constrained model, thus facilitating scientific inquiry.
On Universal Transfer Learning
Authors: M. M. Mahmud
Venue: Proceedings of the 18th international conference on Algorithmic Learning Theory (2007)

In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have been used successfully in practice and PAC analysis of these methods have been developed. But the key notion of relatedness between tasks has not yet been defined clearly, which makes it difficult to understand, let alone answer, questions that naturally arise in the context of transfer, such as, how much information to transfer, whether to transfer information, and how to transfer information across tasks. In this paper we look at transfer learning from the perspective of Algorithmic Information Theory, and formally solve these problems in the same sense Solomonoff Induction solves the problem of inductive inference. We define universal measures of relatedness between tasks, and use these measures to develop universally optimal Bayesian transfer learning methods.
GAMesh: Automatic Placement of Wireless Mesh Nodes Via Genetic Algorithms
Authors: Giuseppe Marco
Venue: Proceedings of the 2nd international conference on Network-Based Information Systems (2008)

Wireless mesh networks are a profitable application of ad-hoc networks for their low installation cost and high performance properties. Here, we are concerned with the problem of how the mesh nodes should be placed in a given service area to satisfy some network constraints. We investigate this problem by means of genetic algorithms, which are used in order to find optimal topologies of a mesh network. The resulting algorithm has been called as GAMesh, and it is a numerical framework where the design constraints of the network, such as the connectivity and the traffic constraints, can be easily written by means of a scalar fitness function. We cast the problem in an innovative graph drawing technique, which furnishes good solutions in a reasonable computational time. Differently from other solutions, GAMesh explores all the points in the discretized plane. We show GAMesh in the context of infrastructure based wireless mesh networks, typically used by wireless internet service providers, which must minimize cost and maximize the performance.
An Adaptively Constructing Multilayer Feedforward Neural Networks Using Hermite Polynomials
Authors: L. Ma, K. Khorasani
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

In this paper a new strategy is introduced for constructing a multi-hidden-layer feedforward neural network (FNN) where each hidden unit employs a polynomial function for its activation function that is different from other units. The proposed scheme incorporates a structure level adaptation as well as a function level adaptation methodologies in constructing the desired network. The activation functions considered consist of orthonormal Hermite polynomials. Using this strategy, a FNN can be constructed as having as many hidden layers and hidden units as dictated by the complexity of the problem being considered.
Initialization of Model-Based Vehicle Tracking in Video Sequences of Inner-City Intersections
Authors: A. Ottlik, H. -H. Nagel
Venue: International Journal of Computer Vision (2008)

A fully automatic initialization approach for 3D-model-based vehicle tracking has been developed, based on Edge-Element and Optical-Flow association. An entire automatic initialization and tracking system incorporating this approach achieves results comparable to those obtained by earlier experiments based on semi-interactive initialization, provided the assessment criteria are roughly equivalent. Experiences with a large testing sample--about 15 minutes of inner-city traffic videos--are discussed in detail.
Interactive Graphics Developments in Energy Exploration
Authors: Thomas Gardner, H. Nelson
Venue: IEEE Computer Graphics and Applications (1983)

Changing world conditions have brought about new economic rules for energy exploration¿rules that are helping bring interactive computer graphics into the search for fossil fuels.
Consumerism revisited: The emergent roles of new electronic intermediaries between citizens and the public sector
Authors: Ulrika Josefsson, Agneta Ranerup
Venue: Information Polity (2003)

An important transformation of the welfare state of today is the marketisation reforms many times strengthening the role of citizens' preferences in their choice of public services. Another important transformation is the new electronic intermediaries between citizens and the public sector that have emerged during the last few years. This paper focuses on intermediaries between citizens and the public sector when viewed in a quasi-market perspective. Our objects of study are Swedish patients' online communities and public portals for educational opportunities representing different forms of ownership. The aim of the paper is to problematize the capacities to act that citizens are provided with by means of the new intermediaries. We argue that the forms of citizens' influence induced by the marketisation reforms and the new electronic intermediaries provide capacities to act that have previously only to a limited extent been discussed in a systematic manner. In this paper the supplementary role of consumerist activities compared with e.g. representative and deliberative democracy is acknowledged. However, we conclude that the intermediaries are sophisticated instruments in a learning process that support the citizens' development into active consumers of public services.
Modelbase System in Remote Sensing Information Analysis and Service Grid Node
Authors: Yong Xue, Lei Zheng, Ying Luo, Jianping Guo, Wei Wan, Wei Wei, Ying Wang
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

In this article we describe a modelbase system used in Remote Sensing Information Analysis and Service Grid Node (RISN) at Institute of Remote Sensing Applications (IRSA), Chinese Academy of Sciences (CAS). The goal of the Node is to make good use of physically distributed resources in the field of remote sensing science such as data, models and algorithms, and computing resource left unused on Internet. With the modelbase system, we can organize and manage models better and make full use of models. With this system, we update both local and remote models easily, and we can also add remote modelbase into our modelbase management system. At the same time, we provide interfaces to access and run models from our node. Implementing it, we use Oracle to organize and manage models, use java language to connect with Oracle database and run models on Condor platform.
A task-based information retrieval interface to support bioinformatics analysis
Authors: Joan C. Bartlett, Tomasz Neugebauer
Venue: Proceedings of the second international symposium on Information interaction in context (2008)

In this research-in-progress paper, we present the design and pilot testing of an interface created to support the integration of bioinformatics analysis with biological laboratory research. The interface presents a task-based bioinformatics analysis protocol detailing the functional analysis of a gene sequence, a complex information task that is problematic for many biologists. The interface guides the user through a series of 14 analytical steps, providing details on why to follow the step, what data is input/output, what tool(s) to use and how to interpret the results. It provides the framework and support within which the user can accomplish the information task. Our pilot testing has demonstrated initial evidence of the effectiveness of the interface, but also highlighted areas for clarification and enhancement.
Detail-Preserving Regularization Based Removal of Impulse Noise from Highly Corrupted Images
Authors: Bogdan Kwolek
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

This paper proposes a new filtering scheme for eliminating random-valued impulse noise from gray images. In the first phase a noise detector is utilized to extract the noise candidates. Next, the algorithm applies a connected component analysis in order to gather the neighboring noisy pixels into separate sets of connected noise candidates. The corrupted pixels are restored using a detail preserving regularization method. The main idea of the proposed approach is to gather the noisy candidate pixels into separate sets of connected pixels and solve the minimization functional over these pixels. Experimental results illustrate the efficiency and effectiveness of the algorithm.
Looking into the Future
Authors: Sethuraman Panchanathan
Venue: IEEE MultiMedia (2007)

Editor-in-Chief Sethuraman Panchanathan discusses upcoming special issues and notes the addition of two board members.
The Relative Consistency of the Axiom of Choice -- Mechanized Using Isabelle/ZF
Authors: Lawrence C. Paulson
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

Gödel [3] published a monograph in 1940 proving a highly significant theorem, namely that the axiom of choice (AC) and the generalized continuum hypothesis (GCH) are consistent with respect to the other axioms of set theory. This theorem addresses the first of Hilbert's famous list of unsolved problems in mathematics. I have mechanized this work [8] using Isabelle/ZF [5,6]. Obviously, the theorem's significance makes it a tempting challenge; the proof also has numerous interesting features. It is not a single formal assertion, as most theorems are. Gödel [3, p. 33] states it as follows, using Σ to denote the axioms for set theory:What we shall prove is that, if a contradiction from the axiom of choice and the generalized continuum hypothesis were derived in Σ, it could be transformed into a contradiction obtained from the axioms of Σ alone.Gödel presents no other statement of this theorem. Neither does he introduce a theory of syntax suitable for reasoning about transformations on proofs, surely because he considers it to be unnecessary
Automating cyber-defense management
Authors: Partha Pal, Franklin Webber, Michael Atighetchi, Paul Rubel, Paul Benjamin
Venue: Proceedings of the 2nd workshop on Recent advances on intrusiton-tolerant systems (2008)

Last year, we reported [1] our success in setting a new high-water mark for intrusion tolerance. That success can largely be attributed to our use of a "survivability architecture", which refers to the organization of a set of concrete defense mechanisms for preventing intrusion, and for detecting and responding to intrusions that cannot be prevented. The system defense-enabled with the DPASA survivability architecture [2] showed a high level of resistance to sustained attacks by sophisticated adversaries, but needed expert operators to perform the role of an "intelligent control loop"---interpreting the events reported by the survivable system as well as deciding in some cases which defense mechanisms to actuate. We took the position that the survivability architecture must be extended to include part, if not all, of the functionality of the intelligent control loop. This paper is a work in progress report of our current research attempting to introduce a cognitive control loop into survivability architectures.
Introduction to Acceleration for MPI Derived Datatypes Using an Enhancer of Memory and Network
Authors: Noboru Tanabe, Hironori Nakajo
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

We present a support function for MPI derived datatypes on an Enhancer of Memory and Network named DIMMnet-3 which is under development. Semi-hardwired derived datatype communication based on RDMA with hardwired gather and scatter is proposed. This mechanism and MPI using it are implemented on DIMMnet-2 which is a former prototype. The performance of gather or scatter transfer of 8byte elements with large interval by using vector commands of DIMMnet-2 is 6.8 compared with software on a host. Proprietary benchmark of MPI derived datatype communication for transferring a submatrix corresponding to a narrow HALO area is executed. Observed bandwidth on DIMMnet-2 is far higher than that for similar condition with VAPI based MPI implementation on Infiniband, even though poorer CPU and motherboard are used.
A capacitive flexible weighing sensor and weighing measurement
Authors: Li Qing, Cheng Lu, Zhang Hongjian, Li Xiong, Shi Ge
Venue: Proceedings of the 7th WSEAS International Conference on Instrumentation, Measurement, Circuits and Systems (2008)

With the development of the Highway Transportation and Business Trade, vehicle weigh-in-motion (WIM) technology has become a key technology and trend of measuring traffic loads. In this paper, a novel capacitive flexible weighing sensor which is light weight, smaller volume and easy to carry was applied in the vehicle WIM system. The dynamic behavior of the sensor is modeled using the Maxwell-Kelvin model because the materials of the sensor are rubbers which belong to viscoelasticity. A signal processing method based on the model is presented to overcome effects of rubber mechanical properties on the dynamic weight signal. The results showed that the measurement error is less than ±10%. All the theoretic analysis and numerical results demonstrated that appliance of this system to weigh in motion is feasible and convenient for traffic inspection.
Effects of Icon Concreteness and Complexity on Semantic Transparency: Younger vs. Older Users
Authors: Sabine Schröder, Martina Ziefle
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

The semantic transparency of icons in mobile devices was investigated using 48 icons for 12 mobile phone functions. Icons included original ones as well as icons specifically designed for experimental purposes. In order to determine the impact of age, each 10 younger and 10 older adults were examined. Having been acquainted with a reference function, participants had to decide for each of four icons shown on a display as fast as possible whether they represented the respective function. Speed and accuracy of responses were used as dependent variables. Though older adults generally responded slower than younger ones, the very same effects of icon concreteness and complexity showed up in both age groups. Real phone icons did not yield a better performance indicating a suboptimal design. Overall, use of icons in mobile devices in principle can be recommended for users within a wide range of age, if icon design obeys ergonomic rules.
Agreement Technologies
Authors: Nicholas R. Jennings
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

This paper will outline a number of recent advances in developing technologies that autonomous software agents can use in order to reach mutually acceptable agreements. In particular, we will look at the area of computational mechanism design and its application in a variety of real world contexts.
A Highly Efficient Parallel Algorithm for H.264 Encoder Based on Macro-Block Region Partition
Authors: Shuwei Sun, Dong Wang, Shuming Chen
Venue: Proceedings of the 3rd international conference on High Performance Computing and Communications (2007)

This paper proposes a highly efficient MBRP parallel algorithm for H.264 encoder, which is based on the analysis of data dependencies in H.264 encoder. In the algorithm, the video frames are partitioned into several MB regions, each of which consists of several adjoining columns of macro-blocks (MB), which could be encoded by one processor of a multi-processor system. While starting up the encoding process, the wave-front technique is adopted, and the processors begin encoding process orderly. In the MBRP parallel algorithm, the quantity of data that needs to be exchanged between processors is small, and the loads in different processors are balanced. The algorithm could efficiently encode the video sequence without any influence on the compression ratio. Simulation results show that the proposed MBRP parallel algorithm can achieve higher speedups compared to previous approaches, and the encoding quality is the same as JM 10.2.
Caml-Shcaml: an ocaml library for unix shell programming
Authors: Alec Heller, Jesse A. Tov
Venue: Proceedings of the 2008 ACM SIGPLAN workshop on ML (2008)

Objective Caml is a flexible, expressive programming language, but for manipulating Unix processes, nothing beats the terseness and clarity of Bourne Shell: ls *.docx | wc -l To achieve the same effect in C requires several more lines of code and, very likely, a glance at the manual page for readdir(). Despite OCaml's excellent Unix module, which provides access to a wide variety of system calls, a task as simple as counting the .docx files in the current directory is hardly easier in OCaml than in C. The code looks largely the same. Caml-Shcaml addresses this problem by bringing high-level abstractions for Unix systems and shell programming to OCaml. In particular, we take advantage of OCaml's type system to offer statically-checked data pipelines. External Unix processes and internal OCaml stream transducers communicate seamlessly within these pipelines. Shcaml brings other essential systems concepts into the world of typed functional programming as well, including high-level interfaces to Unix facilities for I/O redirection, signal handling, program execution, and subprocess reaping.
ANTLRWorks: an ANTLR grammar development environment
Authors: Jean Bovet, Terence Parr
Venue: Software&mdash;Practice Experience (2008)

Programmers tend to avoid using language tools, resorting to ad hoc methods, because tools can be hard to use, their parsing strategies can be difficult to understand and debug, and their generated parsers can be opaque black-boxes. In particular, there are two very common difficulties encountered by grammar developers: understanding why a grammar fragment results in a parser non-determinism and determining why a generated parser incorrectly interprets an input sentence. This paper describes ANTLRWorks, a complete development environment for ANTLR grammars that attempts to resolve these difficulties and, in general, make grammar development more accessible to the average programmer. The main components are a grammar editor with refactoring and navigation features, a grammar interpreter, and a domain-specific grammar debugger. ANTLRWorks' primary contributions are a parser non-determinism visualizer based on syntax diagrams and a time-traveling debugger that pays special attention to parser decision-making by visualizing lookahead usage and speculative parsing during backtracking. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Application of adaptive probing for fault diagnosis in computer networks
Authors: Adarshpal S. Sethi
Venue:  (2007)

Fault localization is the process of diagnosing the cause of failure from observed failure indications. With the increasing size and complexity of computer networks and with the increasing demands for quality of service guarantees in network services, fault localization has become an important network management task. Existing fault localization techniques are inadequate to address various challenges introduced by modern communication systems, such as the ability to perform reasoning in the presence of uncertainty about the underlying network information, diagnosis of multiple failures, low management traffic overhead, small deployment cost, quick diagnosis, and high accuracy. This dissertation addresses these challenges by developing fault localization techniques using adaptive probing. Adaptive probing is a promising approach for performing efficient and effective fault localization. Adaptive probing sends test transactions over the network to diagnose the health of various network components. As probing involves overhead of sending management traffic in the network, adaptive probing reduces this overhead significantly by adapting the probe set to the observed network conditions, sending fewer probes in healthy areas and more probes in suspected areas of failure. To meet the challenges presented by modern communication systems, we provide adaptive probing solutions assuming the availability of deterministic as well as non-deterministic dependency information. We attempt to find multiple failures. Adaptive probing attempts to minimize the overhead of probe traffic by analyzing the network state from the previous probe results, and identifying the new probes to send that can give maximum information. Unlike the traditional technique of deploying passive monitors over a large part of a network, probing solutions reduce instrumentation overhead by requiring instrumentation of fewer nodes as probe stations. Also, we show through simulation results that adaptive probing provides a high detection ratio and a low false positive ratio.