ppxscal/embedding_network huggingface dataset:
Diameter bounds of cubelike recursive networks
Authors: Zhoujun Li, Yun Sun, Deqiang Wang
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

The cubelike recursive networks is a special sub family of the binary interconnection networks. Typical cubelike recursive networks include the hypercube, the crossed cube, the M&#x00F6;bius cube, the generalized twisted cube, the twisted n-cube and the twisted-cube connected network. In a general sense, lots of their topological properties and network parameters are identical, but their diameters are quite different. This work makes the following contributions: Firstly, the definitions of sub-network and super-network are introduced to explain the recursive nature on structure of the cubelike recursive networks. Secondly, the supremum and infimum of the cubelike recursive networks&#x2019; diameters are n and &#x2308;(n+1)2&#x2309; respectively, which are proved according to these definitions. Finally, a routing algorithm of cubelike recursive networks is proposed, with an example presented to explain how the algorithm works.
Nonparametric Bayesian estimation of a bivariate density with interval censored data
Authors: Mingan Yang, Timothy Hanson, Ronald Christensen
Venue: Computational Statistics Data Analysis (2008)

Mixture of Polya trees nonparametric estimation of a bivariate density is presented for interval censored data. Real and simulated data are analyzed and compared with nonparametric maximum likelihood (NPMLE) and Bayesian G-spline estimates. An advantage of the mixture of Polya trees approach over the NPMLE is the relative ease with which continuous bivariate density and hazard plots are obtained.
Spatial Distribution Patterns, Power Law, and the Agent-based Directed Diffusion Sensor Networks
Authors: Zhanshan (Sam) Ma, Axel W. Krings
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

The directed diffusion sensor networking was proposed by Intanagonwiwat et al. (2003) as an alternative to the IP-based end-to-end and the hop-by-hop ad-hoc routing architectures. This paradigm was apparently inspired by Alan Turing's (1952) seminar paper on the morphogenesis and pattern formation theory. Among numerous follow-up studies to the directed diffusion architecture, Malik and Shakshuki (2007) recently extended the directed diffusion networking by introducing mobile agents (MA) with the goal of increasing the operation efficiency, and the extended paradigm is termed agent-based directed diffusion (AbDD). We suggest two potential improvements to the AbDD, introducing spatial distribution modeling and optimizing the number of mobile agents (MA) employed. We choose to seek inspiration from the spatial distribution patterns of insect populations, which is an emergent property of the individual behaviors at the population level. An insect population can be envisioned as a multi-modal "wireless" network in which individuals are capable of processing multi-modal signals (e.g., auditory, visual, and chemosensory) from environment and their peers. From evolutionary theory, we can expect that insect spatial distribution patterns should be optimized to facilitate the communications among population individuals since communications regulate or control the insect behaviors, which in turn, play crucial roles in the survival and prospering of insects.
Novel methods to pattern polymers for microfluidics
Authors: C. Martin, A. Llobera, T. Leïchlé, G. Villanueva, A. Voigt, V. Fakhfouri, J. Y. Kim, N. Berthet, J. Bausells, G. Gruetzner, L. Nicu, J. Brugger, F. Perez-Murano
Venue: Microelectronic Engineering (2008)

We present two novel methods for the preparation of arbitrary microscale patterns of polymers on surfaces with pre-defined topography. While photosensitive polymers are used commonly together with optical lithography, the methods presented can be used for non-photostructurable polymers and where spin-coating cannot be performed. As demonstrator of the viability of the proposed fabrication process, they have been applied for the definition of hydrophobic barriers on a microfluidics network, which is dedicated to selectively dispense liquid to a spotting device consisting of 12 silicon microcantilevers.
A new method for estimating suspended sediment concentrations and deposition rates from satellite imagery based on the physics of plumes
Authors: S. D. Peckham
Venue: Computers Geosciences (2008)

Sediment plumes are typically easy to identify in satellite imagery and there is a great interest in being able to measure suspended sediment concentrations (SSC) from space or airborne instruments. The standard approach to this problem to date has been to try to determine the spectral signatures of different suspended particle mixtures, either empirically or theoretically, and to thereby develop transfer functions that convert multi-band reflectances to SSC. Although this approach has met with some success, there is not yet a robust and accurate algorithm to quantify SSC in plumes in the nearshore environment under varying conditions. This paper describes a completely different and therefore complementary approach to this problem that is based in the hydrodynamics of turbulent 2D jets and the manner in which sediment concentration must decrease along the centerline of a plume. The only data requirement is a measurement or estimate of initial sediment concentrations by grainsize at the river mouth. The end result is a transfer function derived from the physics of plumes that allows pixels in remotely sensed images of plumes to be assigned absolute SSC values by particle size in units of kg/m^3. This paper therefore has the following key goals: (1) to review and extend known results for 2D turbulent jets and sediment plumes, (2) to derive bounds for how SSC must decrease along the centerline of a plume and (3) to show how these results can be used to assign SSC values in sediment plume images. Applications and efforts to validate this approach will be presented in a companion paper.
Hybrid Traffic Model for Multimedia Network Performance Evaluation
Authors: Priscila Solis Barreto, Paulo H. P. de Carvalho
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

This work proposes a hybrid traffic model for multimedia networks as a fundamental element in a network planning optimization procedure. The proposed model uses a combination of the fBm (fractional Brownian motion) and Markovian traffic characterization procedures combined with link parameters in order to produce more accurate values of QoS metrics. The hybrid traffic model was evaluated in a network scenario that aggregates different traffic types with different combinations of Hurst parameters and variance coefficients. The results show that the QoS metrics calculated with the hybrid traffic model appear to be more accurate than the ones obtained exclusively with the fBm or the Markovian models. With these results, the proposed model appears to be useful in network planning optimization methods.
On stabilizers of infinite words
Authors: Dalia Krieger
Venue: Theoretical Computer Science (2008)

The stabilizer of an infinite word w over a finite alphabet @S is the monoid of morphisms over @S that fix w. In this paper we study various problems related to stabilizers and their generators. We show that over a binary alphabet, there exist stabilizers with at least n generators for all n. Over a ternary alphabet, the monoid of morphisms generating a given infinite word by iteration can be infinitely generated, even when the word is generated by iterating an invertible primitive morphism. Stabilizers of strict epistandard words are cyclic when non-trivial, while stabilizers of ultimately strict epistandard words are always non-trivial. For this latter family of words, we give a characterization of stabilizer elements.
Robust lower bounds for communication and stream computation
Authors: Amit Chakrabarti, Graham Cormode, Andrew McGregor
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We study the communication complexity of evaluating functions when the input data is randomly allocated (according to some known distribution) amongst two or more players, possibly with information overlap. This naturally extends previously studied variable partition models such as the best-case and worst-case partition models [32,29]. We aim to understand whether the hardness of a communication problem holds for almost every allocation of the input, as opposed to holding for perhaps just a few atypical partitions. A key application is to the heavily studied data stream model. There is a strong connection between our communication lower bounds and lower bounds in the data stream model that are "robust" to the ordering of the data. That is, we prove lower bounds for when the order of the items in the stream is chosen not adversarially but rather uniformly (or near-uniformly) from the set of all permuations. This random-order data stream model has attracted recent interest, since lower bounds here give stronger evidence for the inherent hardness of streaming problems. Our results include the first random-partition communication lower bounds for problems including multi-party set disjointness and gap-Hamming-distance. Both are tight. We also extend and improve previous results [19,7] for a form of pointer jumping that is relevant to the problem of selection (in particular, median finding). Collectively, these results yield lower bounds for a variety of problems in the random-order data stream model, including estimating the number of distinct elements, approximating frequency moments, and quantile estimation.
FeatureMapper: mapping features to models
Authors: Florian Heidenreich, Jan Kopcsek, Christian Wende
Venue: Companion of the 30th international conference on Software engineering (2008)

Variability modelling with feature models is one key technique for specifying the problem space of Software Product Lines (SPLs). To allow for the automatic derivation of a concrete product based on a given variant configuration, a mapping between features in the problem space and their realisations in the solution space is required. It is crucial to support the developer in the complex task of defining such mappings. These mappings can also be used to provide visualisations of the variant space that allow to reason over variability in SPLs. In this paper we present FeatureMapper, a tool that allows for defining mappings of features to model elements specifying feature realisations. These feature realisations can be defined in arbitrary Ecore-based languages. Furthermore, the tool supports different visualisation techniques that can help developers understand the complex designs of SPLs.
Designing for inquisitive use
Authors: Peter Dalsgaard
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

This paper presents the concept of inquisitive use and discusses design considerations for creating experience-oriented interactive systems that inspire inquisitive use. Inquisitive use is based on the pragmatism of John Dewey and defined by the interrelated aspects of experience, inquiry, and conflict. The significance of this perspective for design is explored and discussed through two case-studies of experience-oriented installations. The paper contributes to the expanding discourse on experience design on a theoretical level by exploring one particular facet of interaction, inquisitive use, and on a practical level by discussing implications for design prompted by insights into inquisitive use. These implications are presented as a set of design sensitivities, which provide contextual insights and considerations for ongoing and future design processes.
Solving efficiently the 0-1 multi-objective knapsack problem
Authors: Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten
Venue: Computers and Operations Research (2009)

In this paper, we present an approach, based on dynamic programming, for solving the 0-1 multi-objective knapsack problem. The main idea of the approach relies on the use of several complementary dominance relations to discard partial solutions that cannot lead to new non-dominated criterion vectors. This way, we obtain an efficient method that outperforms the existing methods both in terms of CPU time and size of solved instances. Extensive numerical experiments on various types of instances are reported. A comparison with other exact methods is also performed. In addition, for the first time to our knowledge, we present experiments in the three-objective case.
Cooperation and coordination concerns in a distributed software development project
Authors: Lucas D. Panjer, Daniela Damian, Margaret-Anne Storey
Venue: Proceedings of the 2008 international workshop on Cooperative and human aspects of software engineering (2008)

Enabling effective coordination of work in large distributed software projects requires cooperation between participants across multiple teams, sites, and skill sets. To determine how practicing software engineers, in a distributed software development setting, maintain awareness of dependencies and coordinate to resolve dependencies in their work, we conducted a field study that used interviews and informal observation of a distributed software team. In this paper we present key interesting themes that emerged from the qualitative analysis: proximity, modification request authoring patterns, and uncooperative behaviours. We discuss these findings and outline future quantitative research plans to triangulate the methods used by software developers with recorded activities in engineering repositories to increase the generalizability of the research findings.
Large Scale Deployment a Mobile Agent Approach to Network Management
Authors: Guillaume Autran, Xining Li
Venue: Proceedings of the Seventh International Conference on Networking (2008)

In this paper, we describe a possible approach for using mobile agents to manage a group of networked devices.Our system goes one step further from the traditional one-to-one device management setting by providing a one-to-many architecture able to perform simple administrative tasks on behalf of the user. We show how the use of mobile agents eases the task of maintaining, monitoring and managing a very large number of devices and consequently, reduces the work load of the people in charge of these devices.
Algorithm Level Fault Tolerance: A Technique to Cope with Long Duration Transient Faults in Matrix Multiplication Algorithms
Authors: Carlos Arthur Lang Lisboa, Costas Argyrides, Dhiraj Kumar Pradhan, Luigi Carro
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

For technologies beyond the 45 nm node, radiation induced transients will last longer than one clock cycle. In this scenario, temporal redundancy techniques will no longer be able to cope with radiation induced soft errors, while spatial redundancy techniques still impose high power and area overheads. The solution to this impasse is the use of algorithm level techniques, able to detect and correct errors with low cost. In this paper, a new approach to deal with this problem is proposed, and applied to matrix multiplication algorithm. The proposed technique is compared to previously published fault tolerance techniques, and the costs of detection and recomputation for both approaches are compared and discussed.
Enhancing Mobile E-Witness with Access Point Selection Policies
Authors: Vittorio Ghini, Stefano Cacciaguerra, Giorgia Lodi, Fabio Panzieri
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper describes the Mobile E-Witness (MEW) surveillance system which we have extended to incorporate in it an advanced access point selection mechanism. The mechanism selects dynamically the best access point among those reachable in the metropolitan areas where MEW operates. The selection policy is based on both the strength of the access point’s signal and the traffic on the wireless communication channels. The selected access points are associated with the wireless network adapters available on board of MEW Mobile Sensor devices, thus allowing these devices to reliably and continuously transmit multimedia data streams to a remote storage center for future replay. We have carried out an experimental evaluation of the extended MEW prototype in order to assess its effectiveness in coping with such limitations as scarce wireless communication resources. The results of this evaluation are discussed in this paper and show the adequacy of our approach.
Proceedings of the 22nd annual international conference on Supercomputing
Venue: International Conference on Supercomputing (2008)

It is our pleasure to welcome you to the 22nd ACM International Conference on Supercomputing (ICS'08). ICS took place, for the first time, in Athens, Greece in the summer of 1987. Its purpose was to bring together the people who designed and built supercomputers, developed the software, algorithms and applications that made use of them and, over the years, helped advance several fields of science and engineering. This year, ICS returns to Greece and will be held on the island of Kos, one of the main Greek islands with rich history and many monuments, such as the Asclepieion, one of the biggest healing temples in Ancient Greece, sacred to the god of medicine Asclepius. Kos is also known around the world as one of the most splendid vacation destinations of Europe. The Technical Program includes 37 papers on topics in architecture, compilers, operating systems, and large-scale parallel computing applications. The papers reflect recent significant advances in some of the most exciting areas of high-performance computing and identify promising directions for future progress. This dual perspective is also seen in the topics of the workshops and the three keynote addresses. The workshops and Mark Harris' keynote concern the effective exploitation of current high-performance computing systems, David Keyes' keynote discusses the algorithmic approaches required to achieve a sustained petaflop/s on practical applications in the near future and Tilak Agerwala's keynote identifies the challenges to be overcome on the way to exascale computing.
Topology Formation in IEEE 802.15.4: Cluster-Tree Characterization
Authors: Francesca Cuomo, Sara Della Luna, Petia Todorova, Tapio Suihko
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

The IEEE 802.15.4 standard defines a set of procedures to set-up a Low-Rate Wireless Personal Area Network where nodes self-organize into a logical communication structure through which data can be routed, hop by hop, from sources to destinations. The network formation of the IEEE 802.15.4 does not impose constraints on the topology. The ZigBee Alliance uses the IEEE 802.15.4 layers to build a complete protocol stack for the implementation of wireless sensor networks. ZigBee specifies the network layer for star, tree and peer-to-peer topologies. Starting from these, more complex cluster-tree topologies can be formed. To control the network topology ZigBee fixes the maximum number of routers and end-devices that each router may have as children and also fixes the maximum depth of the tree. To better understand the importance of these constraints we simulate and analyze the IEEE 802.15.4 formation procedure in different network settings (single-sink and multi-sink scenarios). The goal is to provide guidelines for the practical implementation of ZigBee network formation with the aforementioned constraints.
OpenFPGA CoreLib core library interoperability effort
Authors: M. Wirthlin, D. Poznanovic, P. Sundararajan, A. Coppola, D. Pellerin, W. Najjar, R. Bruce, M. Babst, O. Pritchard, P. Palazzari, G. Kuzmanov
Venue: Parallel Computing (2008)

This paper begins by summarizing the goals of the OpenFPGA CoreLib Working Group to facilitate the interoperability of FPGA circuit cores within a variety of FPGA design tools, including high-level programming tools targeting FPGA architectures. This effort is contrasted with other IP reuse efforts. The paper reviews the current approach used by several high-level language compilers to integrate IP within their tool. The CoreLib approach for standardizing this IP integration is proposed followed by an example that demonstrates its utility. Finally, the current state of the effort and future plans are presented.
NutriGeneOntology: A Biomedical Ontology for Nutrigenomics Research
Authors: Antonio Fabregat, María Arregui, Elisabet Barrera, Olga Portolés, Dolores Corella, Oscar Coltell
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Currently, in Nutritional Genomics it is crucial to have computing models and solutions and technological platforms in order to support acquisition, storage, management and presentation of all the information generated. Our aim is to build a biomedical ontology in order to formalise and integrate genomic, environmental and phenotypic data applied to Nutritional Genomics research focused on cardiovascular diseases and related phenotypes. Four different food composition tables have been employed to estimate the amount of nutrients provided by the diet. Web engineering technologies have been applied for constructing the Web platform containing the ontology, which integrates three distinct ontologies offering the corresponding models and services: food composition table alignment, gene-environment interaction, and cardiovascular risk estimation
Policy-based Group Organizational Structure Management using an Ontological Approach
Authors: Mario Anzures-García, Luz A. Sánchez-Gálvez
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

The policies provide the flexibility and autonomy necessary to regulate an environment, determining their behaviour according to a set of rules. They allow dynamically specifying behaviour of a system, which can be easily modified without the need for substantial changes of the structure or implementation environment. The policy-based systems management requires an appropriate policy specification. An ontology-based policy specification simplifies the description and facilitates the analysis and reuse across various systems of complex environments. In this paper, we present a policy-based approach to manage the group organizational structure (which establishes how the groupwork will be organized) into collaborative applications. This policy defines an organizational structure that allows coordinate the interaction of the users with shared resources and with other users, and controls the users access to the collaborative application.