ppxscal/embedding_network huggingface dataset:
Design of multiplier-less nonuniform filter bank transmultiplexer using genetic algorithm
Authors: V. J. Manoj, Elizabeth Elias
Venue: Signal Processing (2009)

In this paper, the design of multiplier-less nonuniform filter bank transmultiplexer (ML NUFB TMUX) is presented. Coefficient synthesis of the filters in canonic signed digit (CSD) format is modeled as optimization problem and genetic algorithm (GA) is used for the optimization. A new integer chromosome encoding scheme using a look-up table, which is capable of preserving the canonic property of filter coefficients under genetic operations, is introduced. As compared to corresponding binary chromosome encoding scheme, the new encoding scheme has smaller chromosome size, simple encoding and decoding procedure and low computational complexity. New mutation technique and modified crossover technique are introduced to improve the performance of GA. They also enable GA to use the full range of CSD numbers in the look-up table, which is not possible in the binary coded GA. The performance of the proposed algorithm is compared also with simulated annealing (SA) and recently introduced symbol coded GA. Simulation results show that ML NUFB TMUX designed using the proposed algorithm has better performance than that designed using binary coded GA, symbol coded GA and SA. The proposed algorithm is also faster than the binary coded GA, symbol coded GA and SA.
Extraction of the Intercellular Skeleton from 2D Images of Embryogenesis Using Eikonal Equation and Advective Subjective Surface Method
Authors: Paul Bourgine, Peter Frolkovič, Karol Mikula, Nadine Peyriéras, Mariana Remešíková
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

We suggest an efficient method for automatic detection of the intercellular skeleton in microscope images of early embryogenesis. The method is based on the solution of two advective PDEs. First, we solve numerically the time relaxed eikonal equation in order to obtain the signed distance function to a given set --- a set of points representing cell centers or a set of closed curves representing segmented inner borders of cells. The second step is a segmentation process driven by the advective version of subjective surface equation where the velocity field is given by the gradient of the computed distance function. The first equation is discretized by Rouy-Tourin scheme and we suggest a fixing strategy that significantly improves the speed of the computation. The second equation is solved using a classical upwind strategy. We present several test examples and we show a practical application - the intercellular skeleton extracted from a 2D image of a zebrafish embryo.
Hardware-Accelerated Sumi-e Painting for 3D Objects
Authors: Joo-Hyun Park, Sun-Jeong Kim, Chang-Geun Song, Shin-Jin Kang
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

Brushwork and ink dispersion make it difficult to render 3D common objects in the style of sumi-e painting. We use sphere mapping with brush texture and an image processing techniques to simulate brushstrokes and ink dispersion. The whole process is implemented in shaders running on Graphics Process Unit (GPU) that allows fast and high-quality rendering 3D polygonal models in the style of sumi-e painting. We show several results which demonstrate the practicality and benefits of our system.
Modelling and simulating work practices in agriculture
Authors: Roger Martin-Clouaire, Jean-Pierre Rellier
Venue: International Journal of Metadata, Semantics and Ontologies (2009)

Research has shown that the managerial capacities and work practices of farmers play a major role in explaining differences in economic and environmental performances. This paper presents a computer simulation framework that enables work organisation issues in agricultural production systems to be studied. This framework relies on a purposive frame-based ontology of such production systems. The paper focuses on a subpart of the ontology that concerns production activities, flexible plans and material resources. The paper also outlines the interpretation algorithms that operate on instances of these ontology concepts in any production system model constructed in compliance with the ontology.
Grouped graphical Granger modeling methods for temporal causal modeling
Authors: Aurelie C. Lozano, Naoki Abe, Yan Liu, Saharon Rosset
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

We develop and evaluate an approach to causal modeling based on time series data, collectively referred to as "grouped graphical Granger modeling methods." Graphical Granger modeling uses graphical modeling techniques on time series data and invokes the notion of "Granger causality" to make assertions on causality among a potentially large number of time series variables through inference on time-lagged effects. The present paper proposes a novel enhancement to the graphical Granger methodology by developing and applying families of regression methods that are sensitive to group information among variables, to leverage the group structure present in the lagged temporal variables according to the time series they belong to. Additionally, we propose a new family of algorithms we call group boosting, as an improved component of grouped graphical Granger modeling over the existing regression methods with grouped variable selection in the literature (e.g group Lasso). The introduction of group boosting methods is primarily motivated by the need to deal with non-linearity in the data. We perform empirical evaluation to confirm the advantage of the grouped graphical Granger methods over the standard (non-grouped) methods, as well as that specific to the methods based on group boosting. This advantage is also demonstrated for the real world application of gene regulatory network discovery from time-course microarray data.
A methodology for coupling fragments of XPath with structural indexes for XML documents
Authors: George H. L. Fletcher, Dirk Van Gucht, Yuqing Wu, Marc Gyssens, Sofía Brenes, Jan Paredaens
Venue: Information Systems (2009)

We introduce a new methodology for coupling language-induced partitions and index-induced partitions on XML documents that is aimed for the benefit of efficient evaluation of XPath queries. In particular, we identify XPath fragments which are ideally coupled with the newly introduced P(k)-partition which has its definition grounded in the well-known A(k) structural index and its associated partition. We then utilize these couplings to investigate fundamental questions about the use of structural indexes in XPath query evaluation.
An Algorithm for Business Process Compliance
Authors: Guido Governatori, Antonino Rotolo
Venue: Proceeding of the 2008 conference on Legal Knowledge and Information Systems: JURIX 2008: The Twenty-First Annual Conference (2008)

This paper provides a novel mechanism to check whether business processes are compliant with business rules regulating them. The key point is that compliance is a relationship between two sets of specifications: the specifications for executing a business process and the specifications regulating it.
Performance Modelling and Analysis of Heterogeneous Networks
Authors: Demetres D. Kouvatsos
Venue:  (2009)

Over the recent years, a considerable amount of effort has been devoted, both in industry and academia, towards the performance modelling, evaluation and prediction of convergent multi-service heterogeneous networks, such as wireless and optical networks, towards the design and dimensioning of the next and future generation Internets. This book follows Heterogeneous Networks: Traffic Engineering, Performance Evaluation Studies and Tools and presents recent advances in networks of diverse technology reflecting the state-of-the-art technology and research achievements in performance modelling, analysis and applications worldwide. Technical topics discussed in the book include: Multiservice Switching Networks; Wireless Ad Hoc Networks; Wireless Sensor Networks; Wireless Cellular Networks; Optical Networks; Heterogeneous Networks: Performance Modelling and Analysis contains recently extended research papers, which have their roots in the series of the HET-NETs International Working Conferences focusing on the Performance Modelling and Evaluation of Heterogeneous Networks under the auspices of the EU Networks of Excellence Euro-NGI and Euro-FGI. Heterogeneous Networks: Performance Modelling and Analysis is ideal for personnel in computer/communication industries as well as academic staff and master/research students in computer science, operational research, electrical engineering and telecommunication systems and the Internet. CACHE_VST
Design of a virtual environment aided by a model-based formal approach using DEVS
Authors: Azzedine Boukerche, Abdulaziz Al Hamidi, Ming Zhang
Venue: Concurrency and Computation: Practice Experience (2009)

Virtual environment (VE) is a modern computer technique that aims to provide an attracting and meaningful human&ndash;computer interacting platform, which can essentially help the human users to learn, to play or to be trained in a &lsquo;like-real&rsquo; situation. Recent advances in VE techniques have resulted in their being widely used in many areas, in particular, the E-learning-based training applications. Many researchers have developed the techniques for designing and implementing the 3D virtual environment; however, the existing approaches cannot fully catch up the increasing complexity of modern VE applications. In this paper, we designed and implemented a very attracting web-based 3D virtual environment application that aims to help the training practice of personnel working in the radiology department of a hospital. Furthermore, we presented a model-based formal approach using discrete event system specification (DEVS) to help us in validating the X3D components' behavior. As a step further, DEVS also helps to optimize our design through simulating the design alternatives. Copyright &copy; 2009 John Wiley & Sons, Ltd. This work is partially supported by Canada Research Chair Program, NSERC, Ontario Distinguished Researcher Award, EAR Award and ORF Research Funds.
Operation-based conflict detection and resolution
Authors: Maximilian Koegel, Jonas Helming, Stephan Seyboth
Venue: Proceedings of the 2009 ICSE Workshop on Comparison and Versioning of Software Models (2009)

Models are in wide-spread use in the software development lifecycle and model-driven development even promotes them from an abstraction of the system to the description the system is generated from. Therefore it is increasingly important to collaborate on models. These models can range from requirements models over UML models to project management models such as schedules. Tool support for collaboration on models is therefore crucial. Traditionally Software Configuration Management (SCM) systems such as RCS [9] or Subversion [10] have supported this task for textual artifacts such as source code on the granularity of files and textual lines. They do not work well for graph-like models with many links since the granularity needed to support them is on the level of model elements and their attributes. For the design of a novel SCM system addressing these requirements it is essential to define how conflicts on models are detected and how they can be resolved. In this paper we present an approach to conflict detection and resolution on models. We employ operation-based change tracking and therefore detect conflicts based on operations. For conflict resolution we propose an integration of SCM with techniques from Rational Management to effectively resolve conflicts.
An information plane for internet applications
Authors: Thomas E. Anderson, Arvind Krishnamurthy
Venue:  (2008)

Over the last few years, several new applications have emerged on the Internet that are distributed at a scale previously unseen. Examples include peer-to-peer filesharing, content distribution networks, and voice-over-IP. This new class of distributed applications can make intelligent choices among the several paths available to them to optimize their performance. However, as a result of the best-effort packet forwarding interface exported by the Internet, applications need to explicitly measure the network to discover information about any path. Not only does measurement at the time of communication impose a significant overhead on most applications, but it is also redundant to have every application reimplement an Internet measurement component. In this dissertation, I design, build, and evaluate an information plane for the Internet, called iPlane, that enables distributed applications to discover information about Internet paths without explicit measurement. iPlane efficiently performs measurements from end-hosts under its control to predict path properties on the Internet between arbitrary end-hosts. I pursue a structural approach in issuing and synthesizing measurements&mdash;instead of using only end-to-end measurements and thus treating the Internet as a blackbox, I discover the Internet's routing topology and then compose measurements of links and path segments. This structural approach enables iPlane to predict multiple path properties, such as latency and loss rate. My evaluation of iPlane shows that iPlane's predictions of paths and path properties are accurate, significantly better than previous approaches for some of the sub-problems that iPlane tackles. Also, I used information from iPlane to drive path selection in three representative distributed applications&mdash;content distribution, peer-to-peer filesharing, and voice-over-IP. In each case, the use of iPlane helped significantly improve application performance.
Content Analyses in the WWW Era
Authors: Jian Zhang
Venue:  (2007)

The World Wide Web has become one of the hottest topics in social science. Scholars and professionals from various fields have put tremendous efforts into studying the World Wide Web. However, the dynamic environment of the World Wide Web challenges traditional research methods, which have proven valuable in studying traditional media. One of the methods is content analysis. How did the dynamic features of Web sites affect the studies using content analysis? What is the status quo of content analysis after 2000? What are the challenges, either the "old" ones identified by former research or the "new" ones emerging in the WWW era? What are the potentially valid solutions to those challenges? This book examines those issues by conducting a thematic meta-analysis on how researchers apply the content analysis method to the World Wide Web between 2000 and 2004. Each step was examined in studies using content analysis to analyze the WWW during this period. Problems and solutions were identified. Suggestions of improving these solutions are proposed. The book is addressed to scholars and professional in Mass Communications, Journalism. It is also directed towards scholars in Information Science and Technology. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Dynamic data migration for structured AMR solvers
Authors: Markus Nordén, Henrik Löf, Jarmo Rantakokko, Sverker Holmgren
Venue: International Journal of Parallel Programming (2007)

On cc-NUMA multi-processors, the non-uniformity of main memory latencies motivates the need for co-location of threads and data. We call this special form of data locality, geographical locality. In this article, we study the performance of a parallel PDE solver with adaptive mesh refinement (AMR). The solver is parallelized using OpenMP and the adaptive mesh refinement makes dynamic load balancing necessary. Due to the dynamically changing memory access pattern caused by the runtime adaption, it is a challenging task to achieve a high degree of geographical locality. The main conclusions of the study are: (1) that geographical locality is very important for the performance of the solver, (2) that the performance can be improved significantly using dynamic page migration of misplaced data, (3) that a migrate-on-next-touch directive works well whereas the first-touch strategy is less advantageous for programs exhibiting a dynamically changing memory access patterns, and (4) that the overhead for such migration is low compared to the total execution time.
Bandwidth-Limited Optimal Deployment of Eventually-Serializable Data Services
Authors: Laurent Michel, Pascal Hentenryck, Elaine Sonderegger, Alexander Shvartsman, Martijn Moraal
Venue: Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2009)

Providing consistent and fault-tolerant distributed object services is among the fundamental problems in distributed computing. To achieve fault-tolerance and to increase throughput, objects are replicated at different networked nodes. However, replication induces significant communication costs to maintain replica consistency. Eventually-Serializable Data Service (ESDS) has been proposed to reduce these costs and enable fast operations on data, while still providing guarantees that the replicated data will eventually be consistent. This paper revisits ESDS instances where bandwidth constraints are imposed on segments of the network interconnect. This class of problems was shown to be extremely challenging for both Mixed Integer Programming (MIP) and for Constraint Programming (CP), some instances requiring hours of computation time. The paper presents an improved constraint programming model, a constraint-based local search model that can obtain high-quality solutions quickly and a local search/constraint programming hybrid. The experimental results indicate that the resulting models significantly improve the state of the art.
Modeling fuzzy multi-period production planning and sourcing problem with credibility service levels
Authors: Yan-Fei Lan, Yan-Kui Liu, Gao-Ji Sun
Venue: Journal of Computational and Applied Mathematics (2009)

A great deal of research has been done on production planning and sourcing problems, most of which concern deterministic or stochastic demand and cost situations and single period systems. In this paper, we consider a new class of multi-period production planning and sourcing problem with credibility service levels, in which a manufacturer has a number of plants and subcontractors and has to meet the product demand according to the credibility service levels set by its customers. In the proposed problem, demands and costs are uncertain and assumed to be fuzzy variables with known possibility distributions. The objective of the problem is to minimize the total expected cost, including the expected value of the sum of the inventory holding and production cost in the planning horizon. Because the proposed problem is too complex to apply conventional optimization algorithms, we suggest an approximation approach (AA) to evaluate the objective function. After that, two algorithms are designed to solve the proposed production planning problem. The first is a PSO algorithm combining the AA, and the second is a hybrid PSO algorithm integrating the AA, neural network (NN) and PSO. Finally, one numerical example is provided to compare the effectiveness of the proposed two algorithms.
How is tactile timing information integrated-, somatotopically or spatiotopically?
Authors: Shinobu Kuroki, Junji Watanabe, Naoki Kawakami, Susumu Tachi
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

We are perceiving environment tactually in various situations. Does the perception of tactile timing change depending on the stimulated body parts or how we touch? In this research, we focused on how temporal information is combined under the influence of two distances-somatotopic and spatiotopic. Which distance is important for temporal processing? We provide two experiments to investigate this question. By using two stimuli with short intervals, we can judge simultaneity. With a long interval, two stimuli can be separated, and the time interval can be evaluated. As a result, we found that somatotopic coordinates clearly influence these processes. Conversely, they are not based on spatiotopic coordinates. Furthermore it was suggested that the judgment mechanism for about 1 second of timing information exists in the early stage of temporal processing, where even the coordinate frame remapping of somatotopic to spatiotopic has not yet been completed. Depends on how we touch stimuli the perceived temporal interval would be slightly changed.
Demand Heterogeneity in IT Infrastructure Services: Modeling and Evaluation of a Dynamic Approach to Defining Service Levels
Authors: Sagnika Sen, T. S. Raghu, Ajay Vinze
Venue: Information Systems Research (2009)

A key feature of service-oriented models of information technology is the promise of prespecified quality levels enforceable via service level agreements (SLAs). This poses difficult management problems when considerable variability exists in user preferences and service demand within any organization. Because variance in expectations impact service levels, effective pricing and resource allocation mechanisms are needed to deliver services at the promised quality level. In this paper, we propose a mechanism for SLA formulation that is responsive to demand fluctuations and user preference variance, with the objective of maximizing organizational welfare of the participants. This formulation features a dynamic priority based price-penalty scheme targeted to individual users. An analytical model is presented and evaluated for effectiveness of a proposed dynamic priority-based pricing scheme vis-à-vis a baseline fixed-price single-quality level SLA. Simulations using data from an existing SLA is used to provide evidence that the proposed dynamic pricing scheme is likely to be more effective than a fixed-price approach from a system welfare perspective.
Formal Properties of Modularisation
Authors: Boris Konev, Carsten Lutz, Dirk Walther, Frank Wolter
Venue: Modular Ontologies: Concepts, Theories and Techniques for Knowledge Modularization (2009)

Modularity of ontologies is currently an active research field, and many different notions of a module have been proposed. In this paper, we review the fundamental principles of modularity and identify formal properties that a robust notion of modularity should satisfy. We explore these properties in detail in the contexts of description logic and classical predicate logic and put them into the perspective of well-known concepts from logic and modular software specification such as interpolation, forgetting and uniform interpolation. We also discuss reasoning problems related to modularity.