A study on the relation between linguistics-oriented and domain-specific semantics

Abstract: In this paper we dealt with the comparison and linking between lexical resources with domain knowledge provided by ontologies. It is one of the issues for the combination of the Semantic Web Ontologies and Text Mining. We investigated the relations between the linguistics oriented and domain-specific semantics, by associating the GO biological process concepts to the FrameNet semantic frames. The result shows the gaps between the linguistics-oriented and domain-specific semantics on the classification of events and the grouping of target words. The result provides valuable information for the improvement of domain ontologies supporting for text mining systems. And also, it will result in benefits to language understanding technology.


Fundamentals of Semantic Web Technologies in Medical Environments: a case in breast cancer risk estimation

Abstract: Risk estimation of developing breast cancer poses as the first prevention method for early diagnosis. Furthermore, data integration from different departments involved in the process plays a key role. In order to guarantee patient safety, the whole process should be orchestrated and monitored automatically. Support for the solution will be a linked data cloud, composed by all the departments that take part in the process, combined with rule engines.


Ontology and Knowledge Management System on Epilepsy and Epileptic Seizures

Abstract: A Knowledge Management System developed for supporting creation, capture, storage and dissemination of information about Epilepsy and Epileptic Seizures is presented. We present an Ontology on Epilepsy and a Web-based prototype that together create the KMS.


Constraint-Guided Workflow Composition Based on the EDAM Ontology

Abstract: Methods for the automatic composition of services into executable workflows need detailed knowledge about the application domain,in particular about the available services and their behavior in terms of input/output data descriptions. In this paper we discuss how the EMBRACE data and methods ontology (EDAM) can be used as background knowledge for the composition of bioinformatics workflows. We show by means of a small example domain that the EDAM knowledge facilitates finding possible workflows, but that additional knowledge is required to guide the search towards actually adequate solutions. We illustrate how the ability to flexibly formulate domain-specific and problem-specific constraints supports the work ow development process.


A Generalized Streaming Model for Concurrent Computing

Abstract: Multicore parallel programming has some very difficult problems such as deadlocks during synchronizations and race conditions brought by concurrency. Added to the difficulty is the lack of a simple, well-accepted computing model for multicore architectures--because of that it is hard to develop powerful programming environments and debugging tools. To tackle the challenges, we promote a generalized stream computing model, inspired by previous researches on stream computing, that unifies parallelization strategies for programming language design, compiler design and operating system design. Our model provides a high-level abstraction in designing language constructs to convey concepts of concurrent operations, in organizing a program's runtime layout for parallel execution, and in scheduling concurrent instruction blocks through runtime and/or operating systems. In this paper, we give a high-level description of the proposed model: we define the foundation of the model, show its simplicity through algebraic/computational operation analysis, illustrate a programming framework enabled by the model, and demonstrate its potential through powerful design options for programming languages, compilers and operating systems.


Process Makna - A Semantic Wiki for Scientific Workflows

Abstract: Virtual e-Science infrastructures supporting Web-based scientific workflows are an example for knowledge-intensive collaborative and weakly-structured processes where the interaction with the human scientists during process execution plays a central role. In this paper we propose the lightweight dynamic user-friendly interaction with humans during execution of scientific workflows via the low-barrier approach of Semantic Wikis as an intuitive interface for non-technical scientists. Our Process Makna Semantic Wiki system is a novel combination of an business process management system adapted for scientific workflows with a Corporate Semantic Web Wiki user interface supporting knowledge intensive human interaction tasks during scientific workflow execution.


ChemCloud: Chemical e-Science Information Cloud

Abstract: Our Chemical e-Science Information Cloud (ChemCloud) - a Semantic Web based eScience infrastructure - integrates and automates a multitude of databases, tools and services in the domain of chemistry, pharmacy and bio-chemistry available at the Fachinformationszentrum Chemie (FIZ Chemie), at the Freie Universitaet Berlin (FUB), and on the public Web. Based on the approach of the W3C Linked Open Data initiative and the W3C Semantic Web technologies for ontologies and rules it semantically links and integrates knowledge from our W3C HCLS knowledge base hosted at the FUB, our multi-domain knowledge base DBpedia (Deutschland) implemented at FUB, which is extracted from Wikipedia (De) providing a public semantic resource for chemistry, and our well-established databases at FIZ Chemie such as ChemInform for organic reaction data, InfoTherm the leading source for thermophysical data, Chemisches Zentralblatt, the complete chemistry knowledge from 1830 to 1969, and ChemgaPedia the largest and most frequented e-Learning platform for Chemistry and related sciences in German language.


Use of semantic technologies for the development of a dynamic trajectories generator in a Semantic Chemistry eLearning platform

Abstract: ChemgaPedia is a multimedia, webbased eLearning service platform that currently contains about 18.000 pages organized in 1.700 chapters covering the complete bachelor studies in chemistry and related topics of chemistry, pharmacy, and life sciences. The eLearning encyclopedia contains some 25.000 media objects and the eLearning platform provides services such as virtual and remote labs for experiments. With up to 350.000 users per month the platform is the most frequently used scientific educational service in the German spoken Internet. In this demo we show the benefit of mapping the static eLearning contents of ChemgaPedia to a Linked Data representation for Semantic Chemistry which allows for generating dynamic eLearning paths tailored to the semantic profiles of the users.


Analysis Of Cancer Omics Data In A Semantic Web Framework

Abstract: Our work concerns the elucidation of the cancer (epi)genome, transcriptome and proteome to better understand the complex interplay between a cancer cell's molecular state and its response to anti-cancer therapy. To study the problem, we have previously focused on data warehousing technologies and statistical data integration. In this paper, we present recent work on extending our analytical capabilities using Semantic Web technology. A key new component presented here is a SPARQL endpoint to our existing data warehouse. This endpoint allows the merging of observed quantitative data with existing data from semantic knowledge sources such as Gene Ontology (GO). We show how such variegated quantitative and functional data can be integrated and accessed in a universal manner using Semantic Web tools. We also demonstrate how Description Logic (DL) reasoning can be used to infer previously unstated conclusions from existing knowledge bases. As proof of concept, we illustrate the ability of our setup to answer complex queries on resistance of cancer cells to Decitabine, a demethylating agent.


The CALBC RDF Triple Store: retrieval over large literature content

Abstract: Integration of the scientific literature into a biomedical research infrastructure requires the processing of the literature, identification of the contained named entities (NEs) and concepts, and to represent the content in a standardised way. The CALBC project partners (PPs) have produced a large-scale annotated biomedical corpus with four different semantic groups through the harmonisation of annotations from automatic text mining solutions (Silver Standard Corpus, SSC). The four semantic groups were chemical entities and drugs (CHED), genes and proteins (PRGE), diseases and disorders (DISO) and species (SPE). The content of the SSC has been fully integrated into RDF Triple Store (4,568,678 triples) and has been aligned with content from the GeneAtlas (182,840 triples), UniProtKb (12,552,239 triples for human) and the lexical resource LexEBI (BioLexicon). RDF Triple Store enables querying the scientific literature and bioinformatics resources at the same time for evidence of genetic causes, such as drug targets and disease involvement.


The Rule Responder eScience Infrastructure

Abstract: To a large degree information and services for chemical e-Science have become accessible - anytime, anywhere - but not necessarily useful. The Rule Responder eScience middleware is about providing information consumers with rule-based agents to transform existing information into relevant information of practical consequences, hence providing control to the end-users to express in a declarative rule-based way how to turn existing information into personally relevant information and how to react or make automated decisions on top of it.


Import of ENZYME data into the ConceptWiki and its representation as RDF

Abstract: Solutions to the classic problems of dealing with heterogeneous data and making entire collections interoperable while ensuring that any annotation, which includes the recognition-and-reward system of scientific publishing, need to fit into a seamless beginning to end to attract large numbers of end users. The latest trend in Web applications encourages highly interactive Web sites with rich user interfaces featuring content integrated from various sources around the Web. The obvious potential of RDF, SPARQL, and OWL to provide flexible data modeling, easier data integration, and networked data access may be the answer to the classic problems. Using Semantic Web technologies we have created a Web application, the ConceptWiki, as an end-to-end solution for creating browserbased readwrite triples using RDF, which focus on data integration and ease of use for the end user. Here we will demonstrate the integration of a biological data source, the ENZYME database, into the ConceptWiki and it's representation in RDF.


Using Semantic Wikis for Structured Argument in Medical Domain

Abstract: This research applies ideas from argumentation theory in the context of semantic wikis, aiming to provide support for structured-large scale argumentation between human agents. The implemented prototype is exemplified by modelling the MMR vaccine controversy.


Creating a new Ontology: a Modular Approach


First steps in the logic-based assessment of post-composed phenotypic descriptions

Abstract: In this paper we present a preliminary logic-based evaluation of the integration of post-composed phenotypic descriptions with domain ontologies. The evaluation has been performed using a description logic reasoner together with scalable techniques: ontology modularization and approximations of the logical difference between ontologies.


Provenance and evidence in UniProtKB

Abstract: The primary mission of UniProt is to support biological research by maintaining a stable, comprehensive, fully classified, richly and accurately annotated protein sequence knowledgebase, with extensive cross-references to external resources, that is freely available to the scientific community. To enable users of the knowledgebase to accurately assess the reliability of the information contained in this resource, the evidence for and provenance of the information must be recorded. This paper discusses the user requirements for this kind of metadata and the manner in which UniProtKB records it.


Analysis and visualisation of RDF resources in Ondex

Abstract: Ondex is a data integration and visualization platform developed to support Systems Biology Research. At its core is a data model based on two main principles: first, all information can be represented as a graph and, second, all elements of the graph can be annotated with ontologies. This data model is conformant to the Semantic Web framework, in particular to RDF, and therefore Ondex is ideally positioned as a platform that can exploit the semantic web.


A Concept Annotation System for Clinical Records

Abstract: Unstructured information comprises a valuable source of data in clinical records. For text mining in clinical records, concept extraction is the first step in finding assertions and relationships. This study presents a system developed for the annotation of medical concepts, including medical problems, tests, and treatments, mentioned in clinical records. The system combines six publicly available named entity recognition system into one framework, and uses a simple voting scheme that allows to tune precision and recall of the system to specific needs. The system provides both a web service interface and a UIMA interface which can be easily used by other systems. The system was tested in the fourth i2b2 challenge and achieved an F-score of 82.1% for the concept exact match task, a score which is among the top-ranking systems. To our knowledge, this is the first publicly available clinical record concept annotation system.


semanticSBML 2.0 - A Collection of Online Services for SBML Models

Abstract: semanticSBML 2.0 is an online collection of services for the work with biochemical network models in SBML format.


An In-depth Analysis of Spam and Spammers

Abstract: Electronic mail services have become an important source of communication for millions of people all over the world. Due to this tremendous growth, there has been a significant increase in spam traffic. Spam messes up user's inbox, consumes network resources and spread worms and viruses. In this paper we study the characteristics of spam and the technology used by spammers. In order to counter anti spam technology, spammers change their mode of operation, therefore continues evaluation of the characteristics of spam and spammers technology has become mandatory. These evaluations help us to enhance the existing anti spam technology and thereby help us to combat spam effectively. In order to characterize spam, we collected four hundred thousand spam mails from a corporate mail server for a period of 14 months from January 2006 to February 2007. For analysis we classified spam based on attachment and contents. We observed that spammers use software tools to send spam with attachment. The main features of this software are hiding sender's identity, randomly selecting text messages, identifying open relay machines, mass mailing capability and defining spamming duration. Spammers do not use spam software to send spam without attachment. From our study we observed that, four years old heavy users email accounts attract more spam than four years old light users mail accounts. Relatively new email accounts which are 14 months old do not receive spam. But in some special cases like DDoS attacks, we found that new email accounts receive spam and 14 months old heavy users email accounts have attracted more spam than 14 months old light users. We believe that this analysis could be useful to develop more efficient anti spam techniques.


SPARQL Assist Language-Neutral Query Composer

Abstract: SPARQL query composition is difficult for the lay-person or even the experienced bioinformatician in cases where the data model is unfamiliar. Established best-practices and internationalization concerns dictate that semantic web ontologies should use terms with opaque identifiers, further complicating the task. We present SPARQL Assist: a web application that addresses these issues by providing context-sensitive type-ahead completion to existing web forms. Ontological terms are suggested using their labels and descriptions, leveraging existing XML support for internationalization and language-neutrality.


A semantic approach for the requirement-driven discovery of web services in the Life Sciences

Abstract: Research in the Life Sciences depends on the integration of large, distributed and heterogeneous data sources and web services. The discovery of which of these resources are the most appropriate to solve a given task is a complex research question, since there is a large amount of plausible candidates and there is little, mostly unstructured, metadata to be able to decide among them.We contribute a semi-automatic approach,based on semantic techniques, to assist researchers in the discovery of the most appropriate web services to full a set of given requirements.


Localizing Audiences' Gaze using a Multi-touch Electronic Whiteboard with sPieMenu

Abstract: Direct-touch presentation devices such as touch-sensitive electronic whiteboards have two serious problems. First, the presenter's hand movements tend to distract the audience's attention from content. Second, the presenter' s manipulation tends to obscure content. In this paper we describe a new electronic whiteboard system that supports multi-touch gestures and employs a special pie menu interface named "sPieMenu." This pie menu is displayed under the presenter's palm and is thus invisible to the audience. A series of experiments shows that the proposed system allows both novice and expert users to efficiently manipulate the electronic whiteboard, and that the proposed system decreases distraction to the audience compared to traditional approaches.


Designing Incentive Schemes Based on Intervention: The Case of Imperfect Monitoring

Abstract: We propose an incentive scheme based on intervention to sustain cooperation among self-interested users. In the proposed scheme, an intervention device collects imperfect signals about the actions of the users for a test period, and then chooses the level of intervention that degrades the performance of the network for the remaining time period. We analyze the problems of designing an optimal intervention rule given a test period and choosing an optimal length of the test period. The intervention device can provide the incentive for cooperation by exerting intervention following signals that involve a high likelihood of deviation. Increasing the length of the test period has two counteracting effects on the performance: It improves the quality of signals, but at the same time it weakens the incentive for cooperation due to increased delay.


Designing Incentive Schemes Based on Intervention: The Case of Perfect Monitoring

Abstract: This paper studies a class of incentive schemes based on intervention, where there exists an intervention device that is able to monitor the actions of users and to take an action that affects the payoffs of users. We consider the case of perfect monitoring, where the intervention device can immediately observe the actions of users without errors. We also assume that there exist actions of the intervention device that are most and least preferred by all the users and the intervention device, regardless of the actions of users. We derive analytical results about the outcomes achievable with intervention, and illustrate our results with an example based on the Cournot model.


A Distributed Cluster Scheme For Bandwidth Management In Multi-hop MANETs

Abstract: Electronic collaboration among devices in a geographically localized environment is made possible with the implementation of IEEE 802.11 based wireless ad hoc networks. Dynamic nature of mobile ad hoc networks(MANETs) may lead to unpredictable intervention of attacks or fault occurrence, which consequently may partition the network, degrade its performance, violate the QoS requirements and most importantly, affect bandwidth allocation to mobile nodes in the network. In this paper, we propose a new distributed cluster scheme for MANETs, especially in harsh environments, based on the concept of survivability to support QoS requirements and to protect bandwidth efficiently. With the incorporation of clustering algorithms in survivability technology, we employ a simple network configuration and expect to reduce occurrences of faults in MANETs. At the same time, we address the scalability problem, which represents a great challenge to network configuration. We do expect a simplification of accessing bandwidth allocation with required QoS support for different applications.


Scientific Collaborations: principles of WikiBridge Design

Abstract: Semantic wikis, wikis enhanced with Semantic Web technologies, are appropriate systems for community-authored knowledge models. They are particularly suitable for scientific collaboration. This paper details the design principles ofWikiBridge, a semantic wiki.


Populous: A tool for populating ontology templates

Abstract: We present Populous, a tool for gathering content with which to populate an ontology. Domain experts need to add content, that is often repetitive in its form, but without having to tackle the underlying ontological representation. Populous presents users with a table based form in which columns are constrained to take values from particular ontologies; the user can select a concept from an ontology via its meaningful label to give a value for a given entity attribute. Populated tables are mapped to patterns that can then be used to automatically generate the ontology's content. Populous's contribution is in the knowledge gathering stage of ontology development. It separates knowledge gathering from the conceptualisation and also separates the user from the standard ontology authoring environments. As a result, Populous can allow knowledge to be gathered in a straight-forward manner that can then be used to do mass production of ontology content.


Treemaps with Bounded Aspect Ratio

Abstract: Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree $\tree$ where the weight of each node is the sum of the weights of its children. A treemap for $\tree$ is a hierarchical partition of a rectangle into simply connected regions, usually rectangles. Each region represents a node of $\tree$ and its area is proportional to the weight of the corresponding node. An important quality criterion for treemaps is the aspect ratio of its regions. One cannot bound the aspect ratio if the regions are restricted to be rectangles. In contrast, \emph{polygonal partitions}, that use convex polygons, have bounded aspect ratio. We are the first to obtain convex partitions with optimal aspect ratio $O(\depth(\tree))$. However, $\depth(\tree)$ still depends on the input tree. Hence we introduce a new type of treemaps, namely \emph{orthoconvex treemaps}, where regions representing leaves are rectangles, L-, and S-shapes, and regions representing internal nodes are orthoconvex polygons. We prove that any input tree, irrespective of the weights of the nodes and the depth of the tree, admits an orthoconvex treemap of constant aspect ratio. We also obtain several specialized results for single-level treemaps, that is, treemaps where the input tree has depth~1.


Equality Saturation: A New Approach to Optimization

Abstract: Optimizations in a traditional compiler are applied sequentially, with each optimization destructively modifying the program to produce a transformed program that is then passed to the next optimization. We present a new approach for structuring the optimization phase of a compiler. In our approach, optimizations take the form of equality analyses that add equality information to a common intermediate representation. The optimizer works by repeatedly applying these analyses to infer equivalences between program fragments, thus saturating the intermediate representation with equalities. Once saturated, the intermediate representation encodes multiple optimized versions of the input program. At this point, a profitability heuristic picks the final optimized program from the various programs represented in the saturated representation. Our proposed way of structuring optimizers has a variety of benefits over previous approaches: our approach obviates the need to worry about optimization ordering, enables the use of a global optimization heuristic that selects among fully optimized programs, and can be used to perform translation validation, even on compilers other than our own. We present our approach, formalize it, and describe our choice of intermediate representation. We also present experimental results showing that our approach is practical in terms of time and space overhead, is effective at discovering intricate optimization opportunities, and is effective at performing translation validation for a realistic optimizer.


Single-Producer/Single-Consumer Queues on Shared Cache Multi-Core Systems

Abstract: Using efficient point-to-point communication channels is critical for implementing fine grained parallel program on modern shared cache multi-core architectures. This report discusses in detail several implementations of wait-free Single-Producer/Single-Consumer queue (SPSC), and presents a novel and efficient algorithm for the implementation of an unbounded wait-free SPSC queue (uSPSC). The correctness proof of the new algorithm, and several performance measurements based on simple synthetic benchmark and microbenchmark, are also discussed.


Capacitated Vehicle Routing with Non-Uniform Speeds

Abstract: The capacitated vehicle routing problem (CVRP) involves distributing (identical) items from a depot to a set of demand locations, using a single capacitated vehicle. We study a generalization of this problem to the setting of multiple vehicles having non-uniform speeds (that we call Heterogenous CVRP), and present a constant-factor approximation algorithm. The technical heart of our result lies in achieving a constant approximation to the following TSP variant (called Heterogenous TSP). Given a metric denoting distances between vertices, a depot r containing k vehicles with possibly different speeds, the goal is to find a tour for each vehicle (starting and ending at r), so that every vertex is covered in some tour and the maximum completion time is minimized. This problem is precisely Heterogenous CVRP when vehicles are uncapacitated. The presence of non-uniform speeds introduces difficulties for employing standard tour-splitting techniques. In order to get a better understanding of this technique in our context, we appeal to ideas from the 2-approximation for scheduling in parallel machine of Lenstra et al.. This motivates the introduction of a new approximate MST construction called Level-Prim, which is related to Light Approximate Shortest-path Trees. The last component of our algorithm involves partitioning the Level-Prim tree and matching the resulting parts to vehicles. This decomposition is more subtle than usual since now we need to enforce correlation between the size of the parts and their distances to the depot.


Evaluating Modelling Approaches for Medical Image Annotations

Abstract: Information system designers face many challenges w.r.t. selecting appropriate semantic technologies and deciding on a modelling approach for their system. However, there is no clear methodology yet to evaluate "semantically enriched" information systems. In this paper we present a case study on different modelling approaches for annotating medical images and introduce a conceptual framework that can be used to analyse the fitness of information systems and help designers to spot the strengths and weaknesses of various modelling approaches as well as managing trade-offs between modelling effort and their potential benefits.


Sublinear Time, Measurement-Optimal, Sparse Recovery For All

Abstract: An approximate sparse recovery system in ell_1 norm formally consists of parameters N, k, epsilon an m-by-N measurement matrix, Phi, and a decoding algorithm, D. Given a vector, x, where x_k denotes the optimal k-term approximation to x, the system approximates x by hat_x = D(Phi.x), which must satisfy ||hat_x - x||_1 <= (1+epsilon)||x - x_k||_1. Among the goals in designing such systems are minimizing m and the runtime of D. We consider the "forall" model, in which a single matrix Phi is used for all signals x. All previous algorithms that use the optimal number m=O(k log(N/k)) of measurements require superlinear time Omega(N log(N/k)). In this paper, we give the first algorithm for this problem that uses the optimum number of measurements (up to a constant factor) and runs in sublinear time o(N) when k=o(N), assuming access to a data structure requiring space and preprocessing O(N).


Ontology Usage at ZFIN

Abstract: The Zebrafish Model Organism Database (ZFIN) provides a Web resource of zebrafish genomic, genetic, developmental, and phenotypic data. Four different ontologies are currently used to annotate data to the most specific term available facilitating a better comparison between inter-species data. In addition, ontologies are used to help users find and cluster data more quickly without the need of knowing the exact technical name for a term.


Querying Biomedical Ontologies in Natural Language using Answer Set

Abstract: In this work, we develop an intelligent user interface that allows users to enter biomedical queries in a natural language, and that presents the answers (possibly with explanations if requested) in a natural language. We develop a rule layer over biomedical ontologies and databases, and use automated reasoners to answer queries considering relevant parts of the rule layer.


Congestion Games with Variable Demands

Abstract: We initiate the study of congestion games with variable demands where the (variable) demand has to be assigned to exactly one subset of resources. The players' incentives to use higher demands are stimulated by non-decreasing and concave utility functions. The payoff for a player is defined as the difference between the utility of the demand and the associated cost on the used resources. Although this class of non-cooperative games captures many elements of real-world applications, it has not been studied in this generality, to our knowledge, in the past. We study the fundamental problem of the existence of pure Nash equilibria (PNE for short) in congestion games with variable demands. We call a set of cost functions C consistent if every congestion game with variable demands and cost functions in C possesses a PNE. We say that C is FIP consistent if every such game possesses the alpha-Finite Improvement Property for every alpha>0. Our main results are structural characterizations of consistency and FIP consistency for twice continuously differentiable cost functions. Specifically, we show 1. C is consistent if and only if C contains either only affine functions or only homogeneously exponential functions (c(x) = a exp(p x)). 2. C is FIP consistent if and only if C contains only affine functions. Our results provide a complete characterization of consistency of cost functions revealing structural differences to congestion games with fixed demands (weighted congestion games), where in the latter even inhomogeneously exponential functions are FIP consistent. Finally, we study consistency and FIP consistency of cost functions in a slightly different class of games, where every player experiences the same cost on a resource (uniform cost model). We give a characterization of consistency and FIP consistency showing that only homogeneously exponential functions are consistent.


Stiffness Analysis of Parallel Manipulators with Preloaded Passive Joints

Abstract: The paper presents a methodology for the enhanced stiffness analysis of parallel manipulators with internal preloading in passive joints. It also takes into account influence of the external loading and allows computing both the non-linear "load-deflection" relation and the stiffness matrices for any given location of the end-platform or actuating drives. Using this methodology, it is proposed the kinetostatic control algorithm that allows to improve accuracy of the classical kinematic control and to compensate position errors caused by elastic deformations in links/joints due to the external/internal loading. The results are illustrated by an example that deals with a parallel manipulator of the Orthoglide family where the internal preloading allows to eliminate the undesired buckling phenomena and to improve the stiffness in the neighborhood of its kinematic singularities.


Performance evaluation of parallel manipulators for milling application

Abstract: This paper focuses on the performance evaluation of the parallel manipulators for milling of composite materials. For this application the most significant performance measurements, which denote the ability of the manipulator for the machining are defined. In this case, optimal synthesis task is solved as a multicriterion optimization problem with respect to the geometric, kinematic, kinetostatic, elastostostatic, dynamic properties. It is shown that stiffness is an important performance factor. Previous models operate with links approximation and calculate stiffness matrix in the neighborhood of initial point. This is a reason why a new way for stiffness matrix calculation is proposed. This method is illustrated in a concrete industrial problem.


Comparative Analysis of Existing Methods and Algorithms for Automatic Assignment of Reviewers to Papers

Abstract: The article focuses on the importance of the automatic assignment of reviewers to papers for increasing the assignment accuracy therefore the quality of the scientific event itself. It discusses the main aspects that influence the assignment accuracy, performs a detailed analysis of the methods of describing papers and reviewers' competences used by the existing conference management systems and suggests some improvements in the way the similarity factors are calculated.


Robust Simulations and Significant Separations

Abstract: We define and study a new notion of "robust simulations" between complexity classes which is intermediate between the traditional notions of infinitely-often and almost-everywhere, as well as a corresponding notion of "significant separations". A language L has a robust simulation in a complexity class C if there is a language in C which agrees with L on arbitrarily large polynomial stretches of input lengths. There is a significant separation of L from C if there is no robust simulation of L in C. The new notion of simulation is a cleaner and more natural notion of simulation than the infinitely-often notion. We show that various implications in complexity theory such as the collapse of PH if NP = P and the Karp-Lipton theorem have analogues for robust simulations. We then use these results to prove that most known separations in complexity theory, such as hierarchy theorems, fixed polynomial circuit lower bounds, time-space tradeoffs, and the theorems of Allender and Williams, can be strengthened to significant separations, though in each case, an almost everywhere separation is unknown. Proving our results requires several new ideas, including a completely different proof of the hierarchy theorem for non-deterministic polynomial time than the ones previously known.


MUDOS-NG: Multi-document Summaries Using N-gram Graphs (Tech Report)

Abstract: This report describes the MUDOS-NG summarization system, which applies a set of language-independent and generic methods for generating extractive summaries. The proposed methods are mostly combinations of simple operators on a generic character n-gram graph representation of texts. This work defines the set of used operators upon n-gram graphs and proposes using these operators within the multi-document summarization process in such subtasks as document analysis, salient sentence selection, query expansion and redundancy control. Furthermore, a novel chunking methodology is used, together with a novel way to assign concepts to sentences for query expansion. The experimental results of the summarization system, performed upon widely used corpora from the Document Understanding and the Text Analysis Conferences, are promising and provide evidence for the potential of the generic methods introduced. This work aims to designate core methods exploiting the n-gram graph representation, providing the basis for more advanced summarization systems.


An Energy-efficient Clock Synchronization Protocol for Wireless Sensor Networks

Abstract: The behavior of Wireless Sensor Networks (WSN) is nowadays widely analyzed. One of the most important issues is related to their energy consumption, as this has a major impact on the network lifetime. Another important application requirement is to ensure data sensing synchronization, which leads to additional energy consumption as a high number of messages is sent and received at each node. Our proposal consists in implementing a combined synchronization protocol based on the IEEE 1588 standard that was designed for wired networks and the PBS (Pairwise Broadcast Synchronization) protocol that was designed for sensor networks, as none of them is able to provide the needed synchronization accuracy for our application on its own. The main goals of our new synchronization protocol are: to ensure the accuracy of local clocks up to a tenth of a microsecond and to provide an important energy saving. Our results obtained using NS-2 (Network Simulator) show that the performance of our solution (IEEE 1588-PBS) matches our application requirements with regard to the synchronization, with a significant improvement in energy saving.


Discrete Price Updates Yield Fast Convergence in Ongoing Markets with Finite Warehouses

Abstract: This paper shows that in suitable markets, even with out-of-equilibrium trade allowed, a simple price update rule leads to rapid convergence toward the equilibrium. In particular, this paper considers a Fisher market repeated over an unbounded number of time steps, with the addition of finite sized warehouses to enable non-equilibrium trade. The main result is that suitable tatonnement style price updates lead to convergence in a significant subset of markets satisfying the Weak Gross Substitutes property. Throughout this process the warehouse are always able to store or meet demand imbalances (the needed capacity depends on the initial imbalances). Finally, our price update rule is robust in a variety of regards: 1. The updates for each good depend only on information about that good (its current price, its excess demand since its last update) and occur asynchronously from updates to other prices. 2. The process is resilient to error in the excess demand data. 3. Likewise, the process is resilient to discreteness, i.e. a limit to divisibility, both of goods and money.


Sparse motion segmentation using multiple six-point consistencies

Abstract: We present a method for segmenting an arbitrary number of moving objects in image sequences using the geometry of 6 points in 2D to infer motion consistency. The method has been evaluated on the Hopkins 155 database and surpasses current state-of-the-art methods such as SSC, both in terms of overall performance on two and three motions but also in terms of maximum errors. The method works by finding initial clusters in the spatial domain, and then classifying each remaining point as belonging to the cluster that minimizes a motion consistency score. In contrast to most other motion segmentation methods that are based on an affine camera model, the proposed method is fully projective.


NP-completeness Proof: RBCDN Reduction Problem

Abstract: Computational complexity of the design problem for a network with a target value of Region-Based Component Decomposition Number (RBCDN) has been proven to be NP-complete.


Bisimulations for fuzzy transition systems

Abstract: There has been a long history of using fuzzy language equivalence to compare the behavior of fuzzy systems, but the comparison at this level is too coarse. Recently, a finer behavioral measure, bisimulation, has been introduced to fuzzy finite automata. However, the results obtained are applicable only to finite-state systems. In this paper, we consider bisimulation for general fuzzy systems which may be infinite-state or infinite-event, by modeling them as fuzzy transition systems. To help understand and check bisimulation, we characterize it in three ways by enumerating whole transitions, comparing individual transitions, and using a monotonic function. In addition, we address composition operations, subsystems, quotients, and homomorphisms of fuzzy transition systems and discuss their properties connected with bisimulation. The results presented here are useful for comparing the behavior of general fuzzy systems. In particular, this makes it possible to relate an infinite fuzzy system to a finite one, which is easier to analyze, with the same behavior.


Secured histories: computing group statistics on encrypted data while preserving individual privacy

Abstract: As sensors become ever more prevalent, more and more information will be collected about each of us. A longterm research question is how best to support beneficial uses while preserving individual privacy. Presence systems are an emerging class of applications that support collaboration. These systems leverage pervasive sensors to estimate end-user location, activities, and available communication channels. Because such presence data are sensitive, to achieve wide-spread adoption, sharing models must reflect the privacy and sharing preferences of the users. To reflect users' collaborative relationships and sharing desires, we introduce CollaPSE security, in which an individual has full access to her own data, a third party processes the data without learning anything about the data values, and users higher up in the hierarchy learn only statistical information about the employees under them. We describe simple schemes that efficiently realize CollaPSE security for time series data. We implemented these protocols using readily available cryptographic functions, and integrated the protocols with FXPAL's myUnity presence system.


Nondeterministic fuzzy automata

Abstract: Fuzzy automata have long been accepted as a generalization of nondeterministic finite automata. A closer examination, however, shows that the fundamental property---nondeterminism---in nondeterministic finite automata has not been well embodied in the generalization. In this paper, we introduce nondeterministic fuzzy automata with or without $\el$-moves and fuzzy languages recognized by them. Furthermore, we prove that (deterministic) fuzzy automata, nondeterministic fuzzy automata, and nondeterministic fuzzy automata with $\el$-moves are all equivalent in the sense that they recognize the same class of fuzzy languages.


A Robust and Efficient Trust Management Scheme for Peer-to-Peer Networks

Abstract: Studies on the large scale peer-to-peer (P2P) network like Gnutella have shown the presence of large number of free riders. Moreover, the open and decentralized nature of P2P network is exploited by malicious users who distribute unauthentic or harmful contents. Despite the existence of a number of trust management schemes in the literature for combating against free riding and distribution of malicious files, these mechanisms are not scalable due to their high computational, communication and storage overhead. These schemes also do not consider effect of trust management on quality-of-service (QoS) of the search. This paper presents a trust management scheme for P2P networks that minimizes distribution of spurious files by a novel technique called topology adaptation. It also reduces search time since most of the queries are resolved within the community of trustworthy peers. Simulation results indicate that the trust management overhead due to the pr oposed mechanism decreases considerably as the network topology stabilizes. The mechanism is also found to be robust even in presence of a large percentage of malicious peers.


Privacy Preservation Technologies in Internet of Things

Abstract: Since the beginning of the Internet thirty years ago, we have witnessed a number of changes in the application of communication technologies. Today, the Internet can be described to a large extent as a ubiquitous infrastructure that is always accessible. After the era of connecting places and connecting people, the Internet of the future will also connect things. The idea behind the resulting Internet of Things is to seamlessly gather and use information about objects of the real world during their entire lifecycle. In this paper, we consider different approaches to technological protection of user data privacy in the world of Internet of Things. In particular,we consider what kind of security problems are being faced and what level of protection can be provided by applying approaches based on secure multi-party computations.


Integrating digital human modeling into virtual environment for ergonomic oriented design

Abstract: Virtual human simulation integrated into virtual reality applications is mainly used for virtual representation of the user in virtual environment or for interactions between the user and the virtual avatar for cognitive tasks. In this paper, in order to prevent musculoskeletal disorders, the integration of virtual human simulation and VR application is presented to facilitate physical ergonomic evaluation, especially for physical fatigue evaluation of a given population. Immersive working environments are created to avoid expensive physical mock-up in conventional evaluation methods. Peripheral motion capture systems are used to capture natural movements and then to simulate the physical operations in virtual human simulation. Physical aspects of human's movement are then analyzed to determine the effort level of each key joint using inverse kinematics. The physical fatigue level of each joint is further analyzed by integrating a fatigue and recovery model on the basis of physical task parameters. All the process has been realized based on VRHIT platform and a case study is presented to demonstrate the function of the physical fatigue for a given population and its usefulness for worker selection.


Stiffness modelling of parallelogram-based parallel manipulators

Abstract: The paper presents a methodology to enhance the stiffness analysis of parallel manipulators with parallelogram-based linkage. It directly takes into account the influence of the external loading and allows computing both the non-linear ``load-deflection" relation and relevant rank-deficient stiffness matrix. An equivalent bar-type pseudo-rigid model is also proposed to describe the parallelogram stiffness by means of five mutually coupled virtual springs. The contributions of this paper are highlighted with a parallelogram-type linkage used in a manipulator from the Orthoglide family.


Transforming a random graph drawing into a Lombardi drawing

Abstract: The visualization of any graph plays important role in various aspects, such as graph drawing software. Complex systems (like large databases or networks) that have a graph structure should be properly visualized in order to avoid obfuscation. One way to provide an aesthetic improvement to a graph visualization is to apply a force-directed drawing algorithm to it. This method, that emerged in the 60's views graphs as spring systems that exert forces (repulsive or attractive) to the nodes. A Lombardi drawing of a graph is a drawing where the edges are drawn as circular arcs (straight edges are considered circular arcs of infinite radius) with perfect angular resolution. This means, that consecutive edges around a vertex are equally spaced around it. In other words, each angle between the tangents of two consecutive edges is equal to $2\pi/d$ where d is the degree of that specific vertex. The requirement of using circular edges in graphs when we want to provide perfect angular resolution is necessary, since even cycle graphs cannot be drawn with straight edges when perfect angular resolution is needed. In this survey, we provide an algorithm that takes as input a random drawing of a graph and provides its Lombardi drawing, giving a proper visualization of the graph.


A collective of stateless automata in a $n$-dimensional environment as a distributed dynamic automaton-like object: a model and its corollaries

Abstract: In this work a collective of interacting stateless automata in a discrete geometric $n$-dimenstional environment is considered as an integral automaton-like computational dynamic object. For such distributed on the environment object different approaches to definition of the measure of state transition are possible. We propose an approach for defining what a state is. The approach is based on the concept of relativity in Poincar\'e's interpretation.


Plug-in privacy for Smart Metering billing

Abstract: Traditional electricity meters are replaced by Smart Meters in customers' households. Smart Meters collects fine-grained utility consumption profiles from customers, which in turn enables the introduction of dynamic, time-of-use tariffs. However, the fine-grained usage data that is compiled in this process also allows to infer the inhabitant's personal schedules and habits. We propose a privacy-preserving protocol that enables billing with time-of-use tariffs without disclosing the actual consumption profile to the supplier. Our approach relies on a zero-knowledge proof based on Pedersen Commitments performed by a plug-in privacy component that is put into the communication link between Smart Meter and supplier's back-end system. We require no changes to the Smart Meter hardware and only small changes to the software of Smart Meter and back-end system. In this paper we describe the functional and privacy requirements, the specification and security proof of our solution and give a performance evaluation of a prototypical implementation.


Conditional coloring of some parameterized graphs

Abstract: For integers k>0 and r>0, a conditional (k,r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex v of degree d(v) in G is adjacent to vertices with at least min{r,d(v)} different colors. The smallest integer k for which a graph G has a conditional (k,r)-coloring is called the rth order conditional chromatic number, denoted by $\chi_r(G)$. For different values of r we obtain $\chi_r(G)$ of certain parameterized graphs viz., Windmill graph, line graph of Windmill graph, middle graph of Friendship graph, middle graph of a cycle, line graph of Friendship graph, middle graph of complete k-partite graph and middle graph of a bipartite graph.


A year in the life of a large scale experimental distributed system: the Grid'5000 platform in 2008

Abstract: This report presents the usage results of Grid'5000 over year 2008. Usage of the main operationnal Grid'5000 sites (Bordeaux, Lille, Lyon, Nancy, Orsay, Rennes, Sophia-Antipolis, Toulouse) is presented and analyzed.


New Row-grouped CSR format for storing the sparse matrices on GPU with implementation in CUDA

Abstract: In this article we present a new format for storing sparse matrices. The format is designed to perform well mainly on the GPU devices. We present its implementation in CUDA. The performance has been tested on 1,600 different types of matrices and we compare our format with the Hybrid format. We give detailed comparison of both formats and show their strong and weak parts.


Performance Evaluation of Parallel Message Passing and Thread Programming Model on Multicore Architectures

Abstract: The current trend of multicore architectures on shared memory systems underscores the need of parallelism. While there are some programming model to express parallelism, thread programming model has become a standard to support these system such as OpenMP, and POSIX threads. MPI (Message Passing Interface) which remains the dominant model used in high-performance computing today faces this challenge. Previous version of MPI which is MPI-1 has no shared memory concept, and Current MPI version 2 which is MPI-2 has a limited support for shared memory systems. In this research, MPI-2 version of MPI will be compared with OpenMP to see how well does MPI perform on multicore / SMP (Symmetric Multiprocessor) machines. Comparison between OpenMP for thread programming model and MPI for message passing programming model will be conducted on multicore shared memory machine architectures to see who has a better performance in terms of speed and throughput. Application used to assess the scalability of the evaluated parallel programming solutions is matrix multiplication with customizable matrix dimension. Many research done on a large scale parallel computing which using high scale benchmark such as NSA Parallel Benchmark (NPB) for their testing standarization [1]. This research will be conducted on a small scale parallel computing that emphasize more on the performance evaluation between MPI and OpenMPI parallel programming model using self created benchmark.


Covering Cubes and the Closest Vector Problem

Abstract: We provide the currently fastest randomized (1+epsilon)-approximation algorithm for the closest vector problem in the infinity norm. The running time of our method depends on the dimension n and the approximation guarantee epsilon by 2^O(n) (log 1/epsilon)^O(n)$ which improves upon the (2+1/epsilon)^O(n) running time of the previously best algorithm by Bl\"omer and Naewe. Our algorithm is based on a solution of the following geometric covering problem that is of interest of its own: Given epsilon in (0,1), how many ellipsoids are necessary to cover the cube [-1+epsilon, 1-epsilon]^n such that all ellipsoids are contained in the standard unit cube [-1,1]^n? We provide an almost optimal bound for the case where the ellipsoids are restricted to be axis-parallel. We then apply our covering scheme to a variation of this covering problem where one wants to cover [-1+epsilon,1-epsilon]^n with parallelepipeds that, if scaled by two, are still contained in the unit cube. Thereby, we obtain a method to boost any 2-approximation algorithm for closest-vector in the infinity norm to a (1+epsilon)-approximation algorithm that has the desired running time.


Syntax and Semantics of Babel-17

Abstract: We present Babel-17, the first programming language for purely functional structured programming (PFSP). Earlier work illustrated PFSP in the framework of a toy research language. Babel-17 takes this earlier work to a new level by showing how PFSP can be combined with pattern matching, object oriented programming, and features like concurrency, lazy evaluation, memoization and support for lenses.


A Simple Correctness Proof for Magic Transformation

Abstract: The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The correctness property concerns the declarative semantics. The proof, however, refers to the operational semantics (LD-resolution) of the source programs. Its conciseness is due to applying a suitable proof method.


Precedence Automata and Languages

Abstract: Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the well-known visibly pushdown languages, and enjoy the same nice closure properties. We introduce here Floyd automata, an equivalent operational formalism for defining FLs. This also permits to extend the class to deal with infinite strings to perform for instance model checking.


On the Shapley-like Payoff Mechanisms in Peer-Assisted Services with Multiple Content Providers

Abstract: This paper studies an incentive structure for cooperation and its stability in peer-assisted services when there exist multiple content providers, using a coalition game theoretic approach. We first consider a generalized coalition structure consisting of multiple providers with many assisting peers, where peers assist providers to reduce the operational cost in content distribution. To distribute the profit from cost reduction to players (i.e., providers and peers), we then establish a generalized formula for individual payoffs when a "Shapley-like" payoff mechanism is adopted. We show that the grand coalition is unstable, even when the operational cost functions are concave, which is in sharp contrast to the recently studied case of a single provider where the grand coalition is stable. We also show that irrespective of stability of the grand coalition, there always exist coalition structures which are not convergent to the grand coalition. Our results give us an important insight that a provider does not tend to cooperate with other providers in peer-assisted services, and be separated from them. To further study the case of the separated providers, three examples are presented; (i) underpaid peers, (ii) service monopoly, and (iii) oscillatory coalition structure. Our study opens many new questions such as realistic and efficient incentive structures and the tradeoffs between fairness and individual providers' competition in peer-assisted services.


Multivariate Polynomial Integration and Derivative Are Polynomial Time Inapproximable unless P=NP

Abstract: We investigate the complexity of integration and derivative for multivariate polynomials in the standard computation model. The integration is in the unit cube $[0,1]^d$ for a multivariate polynomial, which has format $f(x_1,\cdots, x_d)=p_1(x_1,\cdots, x_d)p_2(x_1,\cdots, x_d)\cdots p_k(x_1,\cdots, x_d)$, where each $p_i(x_1,\cdots, x_d)=\sum_{j=1}^d q_j(x_j)$ with all single variable polynomials $q_j(x_j)$ of degree at most two and constant coefficients. We show that there is no any factor polynomial time approximation for the integration $\int_{[0,1]^d}f(x_1,\cdots,x_d)d_{x_1}\cdots d_{x_d}$ unless $P=NP$. For the complexity of multivariate derivative, we consider the functions with the format $f(x_1,\cdots, x_d)=p_1(x_1,\cdots, x_d)p_2(x_1,\cdots, x_d)\cdots p_k(x_1,\cdots, x_d),$ where each $p_i(x_1,\cdots, x_d)$ is of degree at most $2$ and $0,1$ coefficients. We also show that unless $P=NP$, there is no any factor polynomial time approximation to its derivative ${\partial f^{(d)}(x_1,\cdots, x_d)\over \partial x_1\cdots \partial x_d}$ at the origin point $(x_1,\cdots, x_d)=(0,\cdots,0)$. Our results show that the derivative may not be easier than the integration in high dimension. We also give some tractable cases of high dimension integration and derivative.


NE is not NP Turing Reducible to Nonexpoentially Dense NP Sets

Abstract: A long standing open problem in the computational complexity theory is to separate NE from BPP, which is a subclass of $NP_T(NP\cap P/poly)$. In this paper, we show that $NE\not\subseteq NP_(NP \cap$ Nonexponentially-Dense-Class), where Nonexponentially-Dense-Class is the class of languages A without exponential density (for each constant c>0,$|A^{\le n}|\le 2^{n^c}$ for infinitely many integers n). Our result implies $NE\not\subseteq NP_T({pad(NP, g(n))})$ for every time constructible super-polynomial function g(n) such as $g(n)=n^{\ceiling{\log\ceiling{\log n}}}$, where Pad(NP, g(n)) is class of all languages $L_B=\{s10^{g(|s|)-|s|-1}:s\in B\}$ for $B\in NP$. We also show $NE\not\subseteq NP_T(P_{tt}(NP)\cap Tally)$.


Passively Mobile Communicating Machines that Use Restricted Space

Abstract: We propose a new theoretical model for passively mobile Wireless Sensor Networks, called PM, standing for Passively mobile Machines. The main modification w.r.t. the Population Protocol model is that agents now, instead of being automata, are Turing Machines. We provide general definitions for unbounded memories, but we are mainly interested in computations upper-bounded by plausible space limitations. However, we prove that our results hold for more general cases. We focus on complete communication graphs and define the complexity classes PMSPACE(f(n)) parametrically, consisting of all predicates that are stably computable by some PM protocol that uses O(f(n)) memory on each agent. We provide a protocol that generates unique ids from scratch only by using O(log n) memory, and use it to provide an exact characterization for the classes PMSPACE(f(n)) when f(n)={\Omega}(log n): they are precisely the classes of all symmetric predicates in NSPACE(nf(n)). In this way, we provide a space hierarchy for the PM model when the memory bounds are {\Omega}(log n). Finally, we explore the computability of the PM model when the protocols use o(loglog n) space per machine and prove that SEMILINEAR=PMSPACE(f(n)) when f(n)=o(loglog n), where SEMILINEAR denotes the class of the semilinear predicates. In fact, we prove that this bound acts as a threshold, so that SEMILINEAR is a proper subset of PMSPACE(f(n)) when f(n)=O(loglog n).


Long Tail Behavior of Queue Lengths in Broadband Networks: Tsallis Entropy Framework

Abstract: A maximum entropy framework based on Tsallis entropy is proposed to depict long tail behavior of queue lengths in broadband networks. Queue length expression as measured in terms of number of packets involves Hurwitz-zeta function. When the entropy parameter q in Tsallis entropy is less than unity, the distribution of packets yields power law behavior. In the limit q tending to unity, Tsallis entropy expression reduces to one due to Shannon and well-known results of M/M/1 queuing system are recovered. Relationship between Tsallis entropy parameter q and Hurst parameter H (measure of self-similarity) is postulated. A numerical procedure based on Newton-Raphson method is outlined to compute Lagrange's parameter b. Various relationships between traffic intensity r and Lagrange's parameter b are examined using data generated from mean number of packets from storage model due to Norros. It is found that best fit corresponds to r being a linear combination of decaying exponential and power exponent in b for different values of entropy parameter q. Explicit expression for the probability that queue size exceeds a certain value is derived and it is established that it asymptotically follows power law for q less than one. The system utilization shows an interesting behavior when the parameter r is varied. It attains lower values than that of M/M/1 system for smaller values of r whereas situation reverses for higher values of r.


UCMExporter: Supporting Scenario Transformations from Use Case Maps

Abstract: The Use Case Maps (UCM) scenario notation is applicable to many requirements engineering activities. However, other scenario notations, such as Message Sequence Charts (MSC) and UML Sequence Diagrams (SD), have shown to be better suited for detailed design. In order to use the notation that is best appropriate for each phase in an efficient manner, a mechanism has to be devised to automatically transfer the knowledge acquired during the requirements analysis phase (using UCM) to the design phase (using MSC or SD). This paper introduces UCMEXPORTER, a new tool that implements such a mechanism and reduces the gap between high-level requirements and detailed design. UCMEXPORTER automatically transforms individual UCM scenarios to UML Sequence Diagrams, MSC scenarios, and even TTCN-3 test skeletons. We highlight the current capabilities of the tool as well as architectural solutions addressing the main challenges faced during such transformation, including the handling of concurrent scenario paths, the generation of customized messages, and tool interoperability.


Affine Invariant, Model-Based Object Recognition Using Robust Metrics and Bayesian Statistics

Abstract: We revisit the problem of model-based object recognition for intensity images and attempt to address some of the shortcomings of existing Bayesian methods, such as unsuitable priors and the treatment of residuals with a non-robust error norm. We do so by using a refor- mulation of the Huber metric and carefully chosen prior distributions. Our proposed method is invariant to 2-dimensional affine transforma- tions and, because it is relatively easy to train and use, it is suited for general object matching problems.


On the Implementation of GNU Prolog

Abstract: GNU Prolog is a general-purpose implementation of the Prolog language, which distinguishes itself from most other systems by being, above all else, a native-code compiler which produces standalone executables which don't rely on any byte-code emulator or meta-interpreter. Other aspects which stand out include the explicit organization of the Prolog system as a multipass compiler, where intermediate representations are materialized, in Unix compiler tradition. GNU Prolog also includes an extensible and high-performance finite domain constraint solver, integrated with the Prolog language but implemented using independent lower-level mechanisms. This article discusses the main issues involved in designing and implementing GNU Prolog: requirements, system organization, performance and portability issues as well as its position with respect to other Prolog system implementations and the ISO standardization initiative.


openPC : a toolkit for public cluster with full ownership

Abstract: The openPC is a set of open source tools that realizes a parallel machine and distributed computing environment divisible into several independent blocks of nodes, and each of them is remotely but fully in any means accessible for users with a full ownership policy. The openPC components address fundamental issues relating to security, resource access, resource allocation, compatibilities with heterogeneous middlewares, user-friendly and integrated web-based interfaces, hardware control and monitoring systems. These components have been deployed successfully to the LIPI Public Cluster which is open for public use. In this paper, the unique characteristics of openPC due to its rare requirements are introduced, its components and a brief performance analysis are discussed.


Nonadaptive Mastermind Algorithms for String and Vector Databases, with Case Studies

Abstract: In this paper, we study sparsity-exploiting Mastermind algorithms for attacking the privacy of an entire database of character strings or vectors, such as DNA strings, movie ratings, or social network friendship data. Based on reductions to nonadaptive group testing, our methods are able to take advantage of minimal amounts of privacy leakage, such as contained in a single bit that indicates if two people in a medical database have any common genetic mutations, or if two people have any common friends in an online social network. We analyze our Mastermind attack algorithms using theoretical characterizations that provide sublinear bounds on the number of queries needed to clone the database, as well as experimental tests on genomic information, collaborative filtering data, and online social networks. By taking advantage of the generally sparse nature of these real-world databases and modulating a parameter that controls query sparsity, we demonstrate that relatively few nonadaptive queries are needed to recover a large majority of each database.


Analyzing Zone Routing Protocol in MANET Applying Authentic Parameter

Abstract: Routing is the main part of wireless adhoc network conventionally there are two approaches first one is Proactive and another one is Reactive. Both these approaches have some substantial disadvantage and to overcome hybrid routing protocols designed. ZRP (Zone Routing Protocol) is one of the hybrid routing protocols, it takes advantage of proactive approach by providing reliability within the scalable zone, and for beyond the scalable zone it looks for the reactive approach. It (ZRP) uses the proactive and the reactive routing according to the need of the application at that particular instance of time depending upon the prevailing scenario. This work revolves around the performance of ZRP against realistic parameters by varying various attributes such as Zone Radius of ZRP in different node density. Results vary as we change the node density on Qualnet 4.0 network simulator.


Context Aware End-to-End Connectivity Management

Abstract: In a dynamic heterogeneous environment, such as pervasive and ubiquitous computing, context-aware adaptation is a key concept to meet the varying requirements of different users. Connectivity is an important context source that can be utilized for optimal management of diverse networking resources. Application QoS (Quality of service) is another important issue that should be taken into consideration for design of a context-aware system. This paper presents connectivity from the view point of context awareness, identifies various relevant raw connectivity contexts, and discusses how high-level context information can be abstracted from the raw context information. Further, rich context information is utilized in various policy representation with respect to user profile and preference, application characteristics, device capability, and network QoS conditions. Finally, a context-aware end-to-end evaluation algorithm is presented for adaptive connectivity management in a multi-access wireless network. Unlike the currently existing algorithms, the proposed algorithm takes into account user QoS parameters, and therefore, it is more practical.


An Efficient Security Mechanism for High-Integrity Wireless Sensor Networks

Abstract: Wireless sensor networks (WSNs) have recently attracted a lot of interest in the research community due their wide range of applications. Unfortunately, these networks are vulnerable to numerous security threats that can adversely affect their proper functioning. This problem is more critical if the network is deployed for some mission-critical applications such as in a tactical battlefield. Random failure of nodes and intentional compromise of nodes by an insider attack in a WSN pose particularly difficult challenges to security engineers as these attacks cannot be defended by traditional cryptography-based mechanisms. In this paper, a security solution is proposed for detecting compromised and faulty nodes in a WSN. The mechanism also isolates a compromised node from the network so that it cannot participate in any network activity. The proposed mechanism is based on misbehavior classification, behaviour monitoring and trust management. It involves minimum computation and communication overhead and is ideally suited for a resource-constrained, high-integrity WSN.


A Survey on Cross-Layer Design Frameworks for Multimedia Applications over Wireless Networks

Abstract: In the last few years, the Internet throughput, usage and reliability have increased almost exponentially. The introduction of broadband wireless mobile ad hoc networks (MANETs) and cellular networks together with increased computational power have opened the door for a new breed of applications to be created, namely real-time multimedia applications. Delivering real-time multimedia traffic over a complex network like the Internet is a particularly challenging task since these applications have strict quality -of-service (QoS) requirements on bandwidth, delay, and delay jitter. Traditional IP-based best effort service will not be able to meet these stringent requirements. The time-varying nature of wireless channels and resource constrained wireless devices make the problem even more difficult. To improve perceived media quality by end users over wireless Internet, QoS supports can be addressed in different layers, including application layer, transport layer and link layer. Cross layer design is a well-known approach to achieve this adaptation. In cross-layer design, the challenges from the physical wireless medium and the QoS-demands from the applications are taken into account so that the rate, power, and coding at the physical layer can adapted to meet the requirements of the applications given the current channel and network conditions. A number of propositions for cross-layer designs exist in the literature. In this paper, an extensive review has been made on these cross-layer architectures that combine the application-layer, transport layer and the link layer controls. Particularly the issues like channel estimation techniques, adaptive controls at the application and link layers for energy efficiency, priority based scheduling, transmission rate control at the transport layer, and adaptive automatic repeat request (ARQ) are discussed in detail.


A Distributed Trust and Reputation Framework for Mobile Ad Hoc Networks

Abstract: In a multi-hop mobile ad hoc network (MANET), mobile nodes cooperate to form a network without using any infrastructure such as access points or base stations. The mobility of the nodes and the fundamentally limited capacity of the wireless medium, together with wireless transmission effects such as attenuation, multi-path propagation, and interference combine to create sig-nificant challenges for security in MANETs. Traditional cryptographic mecha-nisms such as authentication and encryption are not capable of handling some kinds of attacks such as packet dropping by malicious nodes in MANETs. This paper presents a mechanism for detecting malicious packet dropping attacks in MANETs. The mechanism is depends on a trust module on each node, which is based on the reputation value computed for that node by its neighbors. The reputation value of a node is computed based on its packet forwarding behavior in the network. The reputation information is gathered, stored and exchanged between the nodes, and computed under different scenario. The proposed pro-tocol has been simulated in a network simulator. The simulation results show the efficiency of its performance.


A Trust-Based Detection Algorithm of Selfish Packet Dropping Nodes in a Peer-to-Peer Wireless Mesh Network

Abstract: Wireless mesh networks (WMNs) are evolving as a key technology for next-generation wireless networks showing raid progress and numerous applications. These networks have the potential to provide robust and high-throughput data delivery to wireless users. In a WMN, high speed routers equipped with advanced antennas, communicate with each other in a multi-hop fashion over wireless channels and form a broadband backhaul. However, the throughput of a WMN may be severely degraded due to presence of some selfish routers that avoid forwarding packets for other nodes even as they send their own traffic through the network. This paper presents an algorithm for detection of selfish nodes in a WMN that uses statistical theory of inference for reliable clustering of the nodes based on local observations. Simulation results show that the algorithm has a high detection rate and a low false positive rate.


Convergence and Next Generation Networks

Abstract: The communications sector is undergoing significant changes, with the emergence of a number of platforms available to provide a different range of services. Some of these platforms are complementary to each other, while others are competitive, or can provide a valid substitute for some of the services provided. Up till now, the most important communications platform in most of the developing countries has been the public switched telecommunication network (PSTN) which provides access to all households and buildings. This universality in providing access has also meant that the network has generally been designated as one for universal service.This chapter focuses on the area where the most significant changes are taking place in the communication sector. The objective of this chapter is neither to give an overview of all communication platforms, nor is it aimed to assess the relative extent to which different platforms complement or compete with each other. The central theme of this chapter is to examine the developments in what is commonly refereed to as next generation access networks and next generation core networks and their role in convergence.


Solving the Rural Postman problem using the Adleman-Lipton model

Abstract: In this survey we investigate the application of the Adleman-Lipton model on Rural Postman problem, which given an undirected graph $G=(V,E)$ with positive integer lengths on each of its edges and a subset $E^{'}\subseteq E$, asks whether there exists a hamiltonian circuit that includes each edge of $E^{'}$ and has total cost (sum of edge lengths) less or equal to a given integer B (we are allowed to use any edges of the set $E-E^{'}$, but we must use all edges of the set $E'$). The Rural Postman problem (RPP) is a very interesting NP-complete problem used, especially, in network optimization. RPP is actually a special case of the Route Inspection problem, where we need to traverse all edges of an undirected graph at a minimum total cost. As all NP-complete problems, it currently admits no efficient solution and if actually $P\neq NP$ as it is widely accepted to be, it cannot admit a polynomial time algorithm to solve it. The application of the Adleman-Lipton model on this problem, provides an efficient way to solve RPP, as it is the fact for many other hard problems on which the Adleman-Lipton model has been applied. In this survey, we provide a polynomial algorithm based on the Lipton-Adleman model, which solves the RPP in $\mathcal{O}(n^{2})$ time, where n refers to the input of the problem.


A Secure Aggregation Protocol for Wireless Sensor Networks

Abstract: The purpose of a wireless sensor network (WSN) is to provide the users with access to the information of interest from data gathered by spatially distributed sensors. Generally the users require only certain aggregate functions of this distributed data. Computation of this aggregate data under the end-to-end information flow paradigm by communicating all the relevant data to a central collector node is a highly inefficient solution for this purpose. An alternative proposition is to perform in-network computation. This, however, raises questions such as: what is the optimal way to compute an aggregate function from a set of statistically correlated values stored in different nodes; what is the security of such aggregation as the results sent by a compromised or faulty node in the network can adversely affect the accuracy of the computed result. In this paper, we have presented an energy-efficient aggregation algorithm for WSNs that is secure and robust against malicious insider attack by any compromised or faulty node in the network. In contrast to the traditional snapshot aggregation approach in WSNs, a node in the proposed algorithm instead of unicasting its sensed information to its parent node, broadcasts its estimate to all its neighbors. This makes the system more fault-tolerant and increase the information availability in the network. The simulations conducted on the proposed algorithm have produced results that demonstrate its effectiveness.


A Survey on Reputation and Trust-Based Systems for Wireless Communication Networks

Abstract: Traditional approach of providing network security has been to borrow tools and mechanisms from cryptography. However, the conventional view of security based on cryptography alone is not sufficient for the defending against unique and novel types of misbehavior exhibited by nodes encountered in wireless communication networks. Reputation-based frameworks where nodes maintain reputation of other nodes and use it to evaluate their trustworthiness are deployed to provide scalable, diverse and a generalized approach for countering different types of misbehavior resulting form malicious and selfish nodes in these networks. In this paper, we present a comprehensive discussion on reputation and trust-based systems for wireless communication networks. Different classes of reputation system are described along with their unique characteristics and working principles. A number of currently used reputation systems are critically reviewed and compared with respect to their effectiveness and efficiency of performance. Some open problems in the area of reputation and trust-based system within the domain of wireless communication networks are also discussed.


The Exact String Matching Problem: a Comprehensive Experimental Evaluation

Abstract: This paper addresses the online exact string matching problem which consists in finding all occurrences of a given pattern p in a text t. It is an extensively studied problem in computer science, mainly due to its direct applications to such diverse areas as text, image and signal processing, speech analysis and recognition, data compression, information retrieval, computational biology and chemistry. Since 1970 more than 80 string matching algorithms have been proposed, and more than 50% of them in the last ten years. In this note we present a comprehensive list of all string matching algorithms and present experimental results in order to compare them from a practical point of view. From our experimental evaluation it turns out that the performance of the algorithms are quite different for different alphabet sizes and pattern length.


Scope Logic with Local Reasoning and Pre/Post-State Properties

Abstract: This paper presents an extension to Hoare logic for pointer program verification. Logic formulas with user-defined recursive functions are used to specify properties on the program states before/after program executions. Three basic functions are introduced to represents memory access, record-field access and array-element access. Some axioms are introduced to specify these basic functions in our logic. The concept Memory Scope Function (MSF) is introduced in our logic. Given a recursive function $f$, the MSF of $f$ computes the set of memory units accessed during the evaluation of $f$. A set of rules are given to derive the definition of this MSF syntactically from the definition of $f$. As MSFs are also recursive functions, they also have their MSFs. An axiom is given to specify that an MSF contains its MSF. Based on this axiom, local reasoning is supported with predicate variables. Pre-state terms are used to specify the relations between pre-states and post-states. People can use pre-state terms in post-conditions to represents the values on the pre-state. The axiom of assignment statements in Hoare's logic is modified to deal with pointers. The basic idea is that during the program execution, a recursive function is evaluated to the same value as long as no memory unit in its memory scope is modified. Another proof rule is added for memory allocation statements. We use a simple example to show that our logic can deal with pointer programs in this paper. In the appendix, the Shorre-Waite algorithm is proved using our logic. We also use the selection-sort program to show that our logic can be used to prove program with indirectly-specified components.


Approximating Vertex Cover in Dense Hypergraphs

Abstract: We consider the minimum vertex cover problem in hypergraphs in which every hyperedge has size k (also known as minimum hitting set problem, or minimum set cover with element frequency k). Simple algorithms exist that provide k-approximations, and this is believed to be the best possible approximation achievable in polynomial time. We show how to exploit density and regularity properties of the input hypergraph to break this barrier. In particular, we provide a randomized polynomial-time algorithm with approximation factor k/(1 +(k-1)d/(k Delta)), where d and Delta are the average and maximum degree, respectively, and Delta must be Omega(n^{k-1}/log n). The proposed algorithm generalizes the recursive sampling technique of Imamura and Iwama (SODA'05) for vertex cover in dense graphs. As a corollary, we obtain an approximation factor k/(2-1/k) for subdense regular hypergraphs, which is shown to be the best possible under the unique games conjecture.


A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning

Abstract: We present a tutorial on Bayesian optimization, a method of finding the maximum of expensive cost functions. Bayesian optimization employs the Bayesian technique of setting a prior over the objective function and combining it with evidence to get a posterior function. This permits a utility-based selection of the next observation to make on the objective function, which must take into account both exploration (sampling from areas of high uncertainty) and exploitation (sampling areas likely to offer improvement over the current best observation). We also present two detailed extensions of Bayesian optimization, with experiments---active user modelling with preferences, and hierarchical reinforcement learning---and a discussion of the pros and cons of Bayesian optimization based on our experiences.


Real-time Visual Tracking Using Sparse Representation

Abstract: The $\ell_1$ tracker obtains robustness by seeking a sparse representation of the tracking object via $\ell_1$ norm minimization \cite{Xue_ICCV_09_Track}. However, the high computational complexity involved in the $ \ell_1 $ tracker restricts its further applications in real time processing scenario. Hence we propose a Real Time Compressed Sensing Tracking (RTCST) by exploiting the signal recovery power of Compressed Sensing (CS). Dimensionality reduction and a customized Orthogonal Matching Pursuit (OMP) algorithm are adopted to accelerate the CS tracking. As a result, our algorithm achieves a real-time speed that is up to $6,000$ times faster than that of the $\ell_1$ tracker. Meanwhile, RTCST still produces competitive (sometimes even superior) tracking accuracy comparing to the existing $\ell_1$ tracker. Furthermore, for a stationary camera, a further refined tracker is designed by integrating a CS-based background model (CSBM). This CSBM-equipped tracker coined as RTCST-B, outperforms most state-of-the-arts with respect to both accuracy and robustness. Finally, our experimental results on various video sequences, which are verified by a new metric---Tracking Success Probability (TSP), show the excellence of the proposed algorithms.


Inverse-Category-Frequency based supervised term weighting scheme for text categorization

Abstract: Term weighting schemes often dominate the performance of many classifiers, such as kNN, centroid-based classifier and SVMs. The widely used term weighting scheme in text categorization, i.e., tf.idf, is originated from information retrieval (IR) field. The intuition behind idf for text categorization seems less reasonable than IR. In this paper, we introduce inverse category frequency (icf) into term weighting scheme and propose two novel approaches, i.e., tf.icf and icf-based supervised term weighting schemes. The tf.icf adopts icf to substitute idf factor and favors terms occurring in fewer categories, rather than fewer documents. And the icf-based approach combines icf and relevance frequency (rf) to weight terms in a supervised way. Our cross-classifier and cross-corpus experiments have shown that our proposed approaches are superior or comparable to six supervised term weighting schemes and three traditional schemes in terms of macro-F1 and micro-F1.


Personalized Data Set for Analysis

Abstract: Data Management portfolio within an organization has seen an upsurge in initiatives for compliance, security, repurposing and storage within and outside the organization. When such initiatives are being put to practice care must be taken while granting access to data repositories for analysis and mining activities. Also, initiatives such as Master Data Management, cloud computing and self service business intelligence have raised concerns in the arena of regulatory compliance and data privacy, especially when a large data set of an organization are being outsourced for testing, consolidation and data management. Here, an approach is presented where a new service layer is introduced, by data governance group, in the architecture for data management and can be used for preserving privacy of sensitive information.


Distributed XML Design

Abstract: A distributed XML document is an XML document that spans several machines. We assume that a distribution design of the document tree is given, consisting of an XML kernel-document T[f1,...,fn] where some leaves are "docking points" for external resources providing XML subtrees (f1,...,fn, standing, e.g., for Web services or peers at remote locations). The top-down design problem consists in, given a type (a schema document that may vary from a DTD to a tree automaton) for the distributed document, "propagating" locally this type into a collection of types, that we call typing, while preserving desirable properties. We also consider the bottom-up design which consists in, given a type for each external resource, exhibiting a global type that is enforced by the local types, again with natural desirable properties. In the article, we lay out the fundamentals of a theory of distributed XML design, analyze problems concerning typing issues in this setting, and study their complexity.


Cusp points in the parameter space of RPR-2PRR parallel manipulator

Abstract: This paper investigates the existence conditions of cusp points in the design parameter space of the R\underline{P}R-2P\underline{R}R parallel manipulators. Cusp points make possible non-singular assembly-mode changing motion, which can possibly increase the size of the aspect, i.e. the maximum singularity free workspace. The method used is based on the notion of discriminant varieties and Cylindrical Algebraic Decomposition, and resorts to Gr\"obner bases for the solutions of systems of equations.


Joint space and workspace analysis of a two-DOF closed-chain manipulator

Abstract: The aim of this paper is to compute of the generalized aspects, i.e. the maximal singularity-free domains in the Cartesian product of the joint space and workspace, for a planar parallel mechanism in using quadtree model and interval analysis based method. The parallel mechanisms can admit several solutions to the inverses and the direct kinematic models. These singular configurations divide the joint space and the workspace in several not connected domains. To compute this domains, the quadtree model can be made by using a discretization of the space. Unfortunately, with this method, some singular configurations cannot be detected as a single point in the joint space. The interval analysis based method allow us to assure that no singularities are not found and to reduce the computing times. This approach is tested on a simple planar parallel mechanism with two degrees of freedom.


On the determination of cusp points of 3-R\underline{P}R parallel manipulators

Abstract: This paper investigates the cuspidal configurations of 3-RPR parallel manipulators that may appear on their singular surfaces in the joint space. Cusp points play an important role in the kinematic behavior of parallel manipulators since they make possible a non-singular change of assembly mode. In previous works, the cusp points were calculated in sections of the joint space by solving a 24th-degree polynomial without any proof that this polynomial was the only one that gives all solutions. The purpose of this study is to propose a rigorous methodology to determine the cusp points of 3-R\underline{P}R manipulators and to certify that all cusp points are found. This methodology uses the notion of discriminant varieties and resorts to Gr\"obner bases for the solutions of systems of equations.


The 2-Center Problem in Three Dimensions

Abstract: Let P be a set of n points in R^3. The 2-center problem for P is to find two congruent balls of minimum radius whose union covers P. We present two randomized algorithms for computing a 2-center of P. The first algorithm runs in O(n^3 log^5 n) expected time, and the second algorithm runs in O((n^2 log^5 n) /(1-r*/r_0)^3) expected time, where r* is the radius of the 2-center balls of P and r_0 is the radius of the smallest enclosing ball of P. The second algorithm is faster than the first one as long as r* is not too close to r_0, which is equivalent to the condition that the centers of the two covering balls be not too close to each other.


Prognostic Watch of the Electric Power System

Abstract: A prognostic watch of the electric power system (EPS)is framed up, which detects the threat to EPS for a day ahead according to the characteristic times for a day ahead and according to the droop for a day ahead. Therefore, a prognostic analysis of the EPS development for a day ahead is carried out. Also the power grid, the electricity marker state, the grid state and the level of threat for a power grid are found for a day ahead. The accuracy of the built up prognostic watch is evaluated.


Phase Transitions of Plan Modification in Conformant Planning

Abstract: We explore phase transitions of plan modification, which mainly focus on the conformant planning problems. By analyzing features of plan modification in conformant planning problems, quantitative results are obtained. If the number of operators is less than, almost all conformant planning problems can't be solved with plan modification. If the number of operators is more than, almost all conformant planning problems can be solved with plan modification. The results of the experiments also show that there exists an experimental threshold of density (ratio of number of operators to number of propositions), which separates the region where almost all conformant planning problems can't be solved with plan modification from the region where almost all conformant planning problems can be solved with plan modification.


Managing Delegation in Access Control Models

Abstract: In the field of access control, delegation is an important aspect that is considered as a part of the administration mechanism. Thus, a complete access control must provide a flexible administration model to manage delegation. Unfortunately, to our best knowledge, there is no complete model for describing all delegation requirements for role-based access control. Therefore, proposed models are often extended to consider new delegation characteristics, which is a complex task to manage and necessitate the redefinition of these models. In this paper we describe a new delegation approach for extended role-based access control models. We show that our approach is flexible and is sufficient to manage all delegation requirements.


Bacteria inspired patterns grown with hyperbolic cellular automata

Abstract: In this paper we give three examples of expending patterns defined by hyperbolic cellular automata whose growth seems to be very similar to the growth of colonies of bacteria.


Comparison of Planar Parallel Manipulator Architectures based on a Multi-objective Design Optimization Approach

Abstract: This paper deals with the comparison of planar parallel manipulator architectures based on a multi-objective design optimization approach. The manipulator architectures are compared with regard to their mass in motion and their regular workspace size, i.e., the objective functions. The optimization problem is subject to constraints on the manipulator dexterity and stiffness. For a given external wrench, the displacements of the moving platform have to be smaller than given values throughout the obtained maximum regular dexterous workspace. The contributions of the paper are highlighted with the study of 3-RPR, 3-RPR and 3-RPR planar parallel manipulator architectures, which are compared by means of their Pareto frontiers obtained with a genetic algorithm.


Experimental Comparison of Representation Methods and Distance Measures for Time Series Data

Abstract: The previous decade has brought a remarkable increase of the interest in applications that deal with querying and mining of time series data. Many of the research efforts in this context have focused on introducing new representation methods for dimensionality reduction or novel similarity measures for the underlying data. In the vast majority of cases, each individual work introducing a particular method has made specific claims and, aside from the occasional theoretical justifications, provided quantitative experimental observations. However, for the most part, the comparative aspects of these experiments were too narrowly focused on demonstrating the benefits of the proposed methods over some of the previously introduced ones. In order to provide a comprehensive validation, we conducted an extensive experimental study re-implementing eight different time series representations and nine similarity measures and their variants, and testing their effectiveness on thirty-eight time series data sets from a wide variety of application domains. In this paper, we give an overview of these different techniques and present our comparative experimental findings regarding their effectiveness. In addition to providing a unified validation of some of the existing achievements, our experiments also indicate that, in some cases, certain claims in the literature may be unduly optimistic.


Should Corpora be Big, Rich, or Dense?

Abstract: In this paper, we ask what properties makes a large corpus more or less useful. We suggest that size, by itself, should not be the ultimate goal of building a corpus. Large-scale corpora are considered desirable because they offer statistical stability and rich variation. But this rich variation means more factors to control and evaluate, which can limit the advantages of size. We discuss the use of multi-channel data to complement large-scale speech corpora. Even though multi-channel data may limit the scale of a corpus (due to the complex and labor-intensive nature of data collection) they can offer information that allows us to tease apart various factors related to speech production.


Improved distance queries in planar graphs

Abstract: There are several known data structures that answer distance queries between two arbitrary vertices in a planar graph. The tradeoff is among preprocessing time, storage space and query time. In this paper we present three data structures that answer such queries, each with its own advantage over previous data structures. The first one improves the query time of data structures of linear space. The second improves the preprocessing time of data structures with a space bound of O(n^(4/3)) or higher while matching the best known query time. The third data structure improves the query time for a similar range of space bounds, at the expense of a longer preprocessing time. The techniques that we use include modifying the parameters of planar graph decompositions, combining the different advantages of existing data structures, and using the Monge property for finding minimum elements of matrices.