A geometric constraint over k-dimensional objects and shapes subject to business rules

This report presents a global constraint that enforces rules written in a language based on arithmetic and first-order logic to hold among a set of objects. In a first step, the rules are rewritten to Quantifier-Free Presburger Arithmetic (QFPA) formulas. Secondly, such formulas are compiled to generators of k-dimensional forbidden sets. Such generators are a generalization of the indexicals of cc(FD). Finally, the forbidden sets generated by such indexicals are aggregated by a sweep-based algorithm and used for filtering. The business rules allow to express a great variety of packing and placement constraints, while admitting efficient and effective filtering of the domain variables of the k-dimensional object, without the need to use spatial data structures. The constraint was used to directly encode the packing knowledge of a major car manufacturer and tested on a set of real packing problems under these rules, as well as on a packing-unpacking problem

Non-Compositional Term Dependence for Information Retrieval

Modelling term dependence in IR aims to identify co-occurring terms that are too heavily dependent on each other to be treated as a bag of words, and to adapt the indexing and ranking accordingly. Dependent terms are predominantly identified using lexical frequency statistics, assuming that (a) if terms co-occur often enough in some corpus, they are semantically dependent; (b) the more often they co-occur, the more semantically dependent they are. This assumption is not always correct: the frequency of co-occurring terms can be separate from the strength of their semantic dependence. E.g. "red tape" might be overall less frequent than "tape measure" in some corpus, but this does not mean that "red"+"tape" are less dependent than "tape"+"measure". This is especially the case for non-compositional phrases, i.e. phrases whose meaning cannot be composed from the individual meanings of their terms (such as the phrase "red tape" meaning bureaucracy). Motivated by this lack of distinction between the frequency and strength of term dependence in IR, we present a principled approach for handling term dependence in queries, using both lexical frequency and semantic evidence. We focus on non-compositional phrases, extending a recent unsupervised model for their detection [21] to IR. Our approach, integrated into ranking using Markov Random Fields [31], yields effectiveness gains over competitive TREC baselines, showing that there is still room for improvement in the very well-studied area of term dependence in IR

BETTER QUALITY OF SERVICE MANAGEMENT WITH FUZZY LOGIC IN MOBILE ADHOC NETWORK

Quality of service (QoS)is a great concept in mobile Adhoc network (MANETs). It is of a great importance that we are veryconscious of how packet is routed to maximize efficiency and minimize delay. In this paper, an efficient algorithm fortransmitting packet for better quality of service in adhoc mobile network was proposed. Fuzzy Self Organizing Map (FSOM)provide very efficient algorithmic tools for transmitting packet in an efficient manner by taking the most efficient route andalso the bandwidth, latency and range are considered to determine how good is the data delivered. The results shown thatfuzzy logic can guarantee QoS of every packets inthe network.Key words: Keywords – QoS, Adhoc network, Packet and Fuzzy logic

Strategic term rewriting and its application to a VDM-SL to SQL conversion

We constructed a tool, called VooDooM, which converts datatypes in Vdm-sl into Sql relational data models. The conversion involves transformation of algebraic types to maps and products, and pointer introduction. The conversion is specified as a theory of refinement by calculation. The implementation technology is strategic term rewriting in Haskell, as supported by the Strafunski bundle. Due to these choices of theory and technology, the road from theory to practise is straightforward.Fundação para a Ciência e a Tecnologia (FCT) - POSI/ICHS/44304/2002Agência de Inovação (ADI) - ∑!223

Time-Varying Graphs and Dynamic Networks

The past few years have seen intensive research efforts carried out in some apparently unrelated areas of dynamic systems -- delay-tolerant networks, opportunistic-mobility networks, social networks -- obtaining closely related insights. Indeed, the concepts discovered in these investigations can be viewed as parts of the same conceptual universe; and the formal models proposed so far to express some specific concepts are components of a larger formal description of this universe. The main contribution of this paper is to integrate the vast collection of concepts, formalisms, and results found in the literature into a unified framework, which we call TVG (for time-varying graphs). Using this framework, it is possible to express directly in the same formalism not only the concepts common to all those different areas, but also those specific to each. Based on this definitional work, employing both existing results and original observations, we present a hierarchical classification of TVGs; each class corresponds to a significant property examined in the distributed computing literature. We then examine how TVGs can be used to study the evolution of network properties, and propose different techniques, depending on whether the indicators for these properties are a-temporal (as in the majority of existing studies) or temporal. Finally, we briefly discuss the introduction of randomness in TVGs.Comment: A short version appeared in ADHOC-NOW'11. This version is to be published in Internation Journal of Parallel, Emergent and Distributed System

Analysis and operational challenges of dynamic ride sharing demand responsive transportation models

There is a wide body of evidence that suggests sustainable mobility is not only a technological question, but that automotive technology will be a part of the solution in becoming a necessary albeit insufficient condition. Sufficiency is emerging as a paradigm shift from car ownership to vehicle usage, which is a consequence of socio-economic changes. Information and Communication Technologies (ICT) now make it possible for a user to access a mobility service to go anywhere at any time. Among the many emerging mobility services, Multiple Passenger Ridesharing and its variants look the most promising. However, challenges arise in implementing these systems while accounting specifically for time dependencies and time windows that reflect users’ needs, specifically in terms of real-time fleet dispatching and dynamic route calculation. On the other hand, we must consider the feasibility and impact analysis of the many factors influencing the behavior of the system – as, for example, service demand, the size of the service fleet, the capacity of the shared vehicles and whether the time window requirements are soft or tight. This paper analyzes - a Decision Support System that computes solutions with ad hoc heuristics applied to variants of Pick Up and Delivery Problems with Time Windows, as well as to Feasibility and Profitability criteria rooted in Dynamic Insertion Heuristics. To evaluate the applications, a Simulation Framework is proposed. It is based on a microscopic simulation model that emulates real-time traffic conditions and a real traffic information system. It also interacts with the Decision Support System by feeding it with the required data for making decisions in the simulation that emulate the behavior of the shared fleet. The proposed simulation framework has been implemented in a model of Barcelona’s Central Business District. The obtained results prove the potential feasibility of the mobility concept.Postprint (published version

The Brazilian Tunable Filter Imager for the SOAR telescope

This paper presents a new Tunable Filter Instrument for the SOAR telescope. The Brazilian Tunable Filter Imager (BTFI) is a versatile, new technology, tunable optical imager to be used in seeing-limited mode and at higher spatial fidelity using the SAM Ground-Layer Adaptive Optics facility at the SOAR telescope. The instrument opens important new science capabilities for the SOAR community, from studies of the centers of nearby galaxies and the insterstellar medium to statistical cosmological investigations. The BTFI takes advantage of three new technologies. The imaging Bragg Tunable Filter concept utilizes Volume Phase Holographic Gratings in a double-pass configuration, as a tunable filter, while a new Fabry-Perot (FP) concept involves technologies which allow a single FP etalon to act over a large range of interference orders and spectral resolutions. Both technologies will be in the same instrument. Spectral resolutions spanning the range between 25 and 30,000 can be achieved through the use of iBTF at low resolution and scanning FPs beyond R ~2,000. The third new technologies in BTFI is the use of EMCCDs for rapid and cyclically wavelength scanning thus mitigating the damaging effect of atmospheric variability through data acquisition. An additional important feature of the instrument is that it has two optical channels which allow for the simultaneous recording of the narrow-band, filtered image with the remaining (complementary) broad-band light. This avoids the uncertainties inherent in tunable filter imaging using a single detector. The system was designed to supply tunable filter imaging with a field-of-view of 3 arcmin on a side, sampled at 0.12" for direct Nasmyth seeing-limited area spectroscopy and for SAM's visitor instrument port for GLAO-fed area spectroscopy. The instrument has seen first light, as a SOAR visitor instrument. It is now in comissioning phase.Comment: accepted in PAS