Mobile Objects

Some of the most difficult questions to answer when designing a distributed application are related to mobility: what information to transfer between sites and when and how to transfer it. Networktransparent distribution, the property that a program's behavior is independent of how it is partitioned among sites, does not directly address these questions. Therefore we propose to extend all language entities with a network behavior that enables efficient distributed programming by giving the programmer a simple and predictable control over network communication patterns. In particular, we show how to give objects an arbitrary mobility behavior that is independent of the object's definition. In this way, the syntax and semantics of objects are the same regardless of whether they are used as stationary servers, mobile agents, or simply as caches. These ideas have been implemented in Distributed Oz, a concurrent object-oriented language that is state aware and has dataflow synchronization. We prove that the implementation of objects in Distributed Oz is network transparent. To satisfy the predictability condition, the implementation avoids forwarding chains through intermediate sites. The implementation is an extension to the publicly available DFKI Oz 2.0 system.

In contrast to regular queries that are evaluated only once, a continuous query remains active over a period of time and has to be continuously evaluated to provide up to date answers. We propose a method for continuous range query processing for different types of queries, characterized by mobility of objects and/or queries which all follow paths in an underlying spatial network. The method assumes an available 2D indexing scheme for indexing spatial network data. An appropriately extended R * -tree, that primarily is used as an indexing scheme for network segments, provides matching of queries and objects according to their locations on the network or their network routes. The method introduces an additional pre-refinement step which generates main-memory data structures to support efficient, incremental reevaluation of continuous range queries in periodically performed refinement steps.

The main purpose of task scheduling is to assign tasks onto available processors with the aim of producing minimum schedule length and without violating the precedence constraints. In heterogeneous multiprocessing systems, task assignments and scheduling have a great impact on the system operation. In a heuristic based task scheduling algorithm, different process will result different task execution time (makespan) on a heterogeneous computing system. Thus, a good scheduling algorithm should be capable to efficiently assign precedence to each subtask depending on the resources required to reduce makespan. In this report, we propose a genetic algorithm (PGA) to resolve a task assignment and scheduling for homogeneous and heterogeneous multi-processing problem. The basic idea of this process is to exploit the advantages of heuristic-based algorithms to decrease space search and the time needed to get the best solution. The achieved results show that the suggested approach significantl...

Neste trabalho e proposto um modelo conceitual para Data Warehouse de Trajetorias que permite analisar o comportamento dos objetos moveis sobre e entre regioes sobre diferentes niveis de granularidade. O modelo permite a segmentacao de trajetorias em componentes, tais como paradas e movimentos, os quais podem transportar informacoes semânticas que dao significado a trajetoria. Para amenizar o problema da grande quantidade de dados, as trajetorias sao armazenadas de forma compactada atraves da sumarizacao de suas paradas e movimentos.

The paper discusses the measures for the privatization of agricultural land provided by the World Bank since 1998 till now and the methods of gaining climatic knowledge on the local level (United Kingdom’s Newton Fund Institutional Links Programme’ Climate Change, Water Resources, and Food Security in Kazakhstan’, 2015-2016). The research seeks the answer to the following questions: How the climatic knowledge is coordinated on the different levels (international, governmental, local), and what actors are involved? How different kinds of knowledge can enrich each other, and in which cases are they conflicting? The study is based on a review of the measures for agricultural privatization and post-privatization programs of the World Bank in Kazakhstan and their realization. The materials include open World Bank archives on reports and documents, publications in the media, and scientific publications for the last 20 years. Since the fall of the agricultural sector in Kazakhstan in 1998, the measures for its revival involved the privatization of agricultural land and post-privatization programs for almost 15 years (Broka, Akchukakov 2011). However, after 2007, the programs’ primary focus shifted to the economic regulation of the weather and climate risks and the losses they can produce for the local farmers. Developing the concept of the scale of knowledge (Strathern 1999), the paper looks at the case of World Bank policies for privatizing agricultural land and indexing climatic risks as the ongoing process of down-scaling international and neutral knowledge for local industry and social regulation. The up-scaling of local expertise to the governmental level is also possible. The paper will demonstrate mechanisms of knowledge losses and simplifications for both cases. The paper is the first part of the ongoing research on water knowledge in Kazakhstan and a result of my visiting scholarship at Nazarbayev University.

Dans le problème de l'estimation de mouvement dans une séquence d'images, deux performances critiques sont à améliorer, le temps de calcul et la précision des résultats. La méthode itérative multi-échelles de Lucas et Kanade est l'une des meilleures méthodes dans ce domaine. Dans cet article on a introduit le réseau de neurones de Zhang pour accélérer le processus d'estimation suite à la nature parallèle de ces derniers. Du coté précision, on a proposé d'utiliser la transformée en curvelettes pour le pré-filtrage des images. Les simulations numériques sur des séquences d'images artificielles et réelles montrent la bonne performance de la méthode proposée.

Este trabalho propõe um modelo conceitual para Data Warehouse de Trajetórias que permite analisar o comportamento dos objetos móveis sobre e entre regiões no espaço e no tempo, de acordo com diferentes níveis de granularidade, através do uso de agregações. O modelo permite a segmentação de trajetórias em componentes, tais como paradas e movimentos. Estes componentes podem transportar informações semânticas que dão significado a partes da trajetória. Para amenizar o problema da grande quantidade de dados, as trajetórias são armazenadas de forma compactada, sumarizando-se suas paradas e movimentos. Experimentos foram realizados para avaliar o nível de compactação obtido para esses dados.

In this paper we introduce and analyze a probabilistic distributed algorithm for minimum spanning tree construction. Our algorithm is based firstly on the handshake algorithm that produces firstly k sub-spanning trees, where k is the size of the maximal matching produced. Secondly, the merged step of our algorithm is executed in a distributed manner and following some roles to reduce the total number of those sub-spanning from k to 1. We proof that the residual graph is acyclic and all vertices belong to it. A detailed analysis of the number of exchanged messages is carried on to validate the effectiveness of our algorithm.

The similarity between trajectory patterns in clustering has played an important role in discovering movement behaviour of different groups of mobile objects. Several approaches have been proposed to measure the similarity between sequences in trajectory data. Most of these measures are based on Euclidean space or on spatial network and some of them have been concerned with temporal aspect or ordering types. However, they are not appropriate to characteristics of spatiotemporal mobility patterns in wireless networks. In this paper, we propose a new similarity measure for mobility patterns in cellular space of wireless network. The framework for constructing our measure is composed of two phases as follows. First, we present formal definitions to capture mathematically two spatial and temporal similarity measures for mobility patterns. And then, we define the total similarity measure by means of a weighted combination of these similarities. The truth of the partial and total similarity measures are proved in mathematics. Furthermore, instead of the time interval or ordering, our work makes use of the timestamp at which two mobility patterns share the same cell. A case study is also described to give a comparison of the combination measure with other ones.

Consider a set of mobile clients represented by n points in the plane moving at constant speed along n different straight lines. We study the problem of covering all mobile clients using a set of k disks centered at k fixed centers. Each disk exists only at one instant and while it does, covers any client within its coverage radius. The task is to select an activation time and a radius for each disk such that every mobile client is covered by at least one disk. In particular, we study the optimization problem of minimizing the maximum coverage radius. First we prove that, although the static version of the problem is polynomial, the kinetic version is NP-hard. Moreover, we show that the problem is not approximable by a constant factor (unless P=NP). We then present a generic framework to solve it for fixed values of k, which in turn allows us to solve more general optimization problems. Our algorithms are efficient for constant values of k.

The similarity between trajectory patterns in clustering has played an important role in discovering movement behaviour of different groups of mobile objects. Several approaches have been proposed to measure the similarity between sequences in trajectory data. Most of these measures are based on Euclidean space or on spatial network and some of them have been concerned with temporal aspect or ordering types. However, they are not appropriate to characteristics of spatiotemporal mobility patterns in wireless networks. In this paper, we propose a new similarity measure for mobility patterns in cellular space of wireless network. The framework for constructing our measure is composed of two phases as follows. First, we present formal definitions to capture mathematically two spatial and temporal similarity measures for mobility patterns. And then, we define the total similarity measure by means of a weighted combination of these similarities. The truth of the partial and total similarity measures are proved in mathematics. Furthermore, instead of the time interval or ordering, our work makes use of the timestamp at which two mobility patterns share the same cell. A case study is also described to give a comparison of the combination measure with other ones.

Consider a set of mobile clients represented by n points in the plane moving at constant speed along n different straight lines. We study the problem of covering all mobile clients using a set of k disks centered at k fixed centers. Each disk exists only at one instant and while it does, covers any client within its coverage radius. The task is to select an activation time and a radius for each disk such that every mobile client is covered by at least one disk. In particular, we study the optimization problem of minimizing the maximum coverage radius. First we prove that, although the static version of the problem is polynomial, the kinetic version is NP-hard. Moreover, we show that the problem is not approximable by a constant factor (unless P=NP). We then present a generic framework to solve it for fixed values of k, which in turn allows us to solve more general optimization problems. Our algorithms are efficient for constant values of k.

Les objets mobiles se déplacent dans une portion d'espace. Leurs positions sont mesurées par différents moyens : des capteurs externes à l'objet ou portés par celui-ci. Nous exposons les méthodes de construction et d'analyses de trajectoires d'objets mobiles. Nous nous appuyons pour cela sur deux cas d'étude : les déplacements de navires en mer et ceux d'herbivores. ABSTRACT. Mobile objects are moving in a portion of space. Their positions are measured in different ways: devices located on fixed locations or held by the object. We expose methods to construct and analyze trajectories of mobile objects. For that, we are using two study cases: ship and herbivore movements.

The main purpose of task scheduling is to assign tasks onto available processors with the aim of producing minimum schedule length and without violating the precedence constraints. In heterogeneous multiprocessing systems, task assignments and scheduling have a great impact on the system operation. In a heuristic based task scheduling algorithm, different process will result different task execution time (makespan) on a heterogeneous computing system. Thus, a good scheduling algorithm should be capable to efficiently assign precedence to each subtask depending on the resources required to reduce makespan. In this report, we propose a genetic algorithm (PGA) to resolve a task assignment and scheduling for homogeneous and heterogeneous multi-processing problem. The basic idea of this process is to exploit the advantages of heuristic-based algorithms to decrease space search and the time needed to get the best solution. The achieved results show that the suggested approach significantl...

Parallel coordinates are well-known visualization tool for high and multi-dimensional datasets. However, data cluttering and over plotting data are major issues for parallel coordinates and becoming worst in the era of Big Data. Thus, edge-bundling technique has overcome the aforementioned problems by bundling similar edges in parallel coordinates. This paper provides in-depth reviews on six approaches of edgebundling techniques which are cost-based approach, geometry-based approach, image-based approach, force-directed edge-bundling approach, divided edge-bundling approach and lastly, hierarchical edgebundling approach. On top of that, these particular approaches are able to reduce the visual clutter without changing the positions of the nodes and only the shapes of edges have some changes. Based on the findings, each approach supports certain features of parallel coordinates such as shape, scale, weight, position, direction and length. This paper suggests a relationship diagram fo...

Surveillance of mobile office assets is made by attaching wireless sensor nodes to assets and to their authorized users. The wireless sensor nodes are monitored via radio base access points connected to a distributed application framework for analysis and coordination of security events. By logic rules applied to the event information, temporarily stored and accessible in a distributed tuple space, security decisions, alarms and other actions are implemented.

This research aims to know the model of customer satisfaction pedestrian movement in pedestrian area path in Manado city. The Data used in this study was taken by pedestrian traffic survey with simple random sampling method, whereas the analysis techniques used is the amounts of Performance Analysis (IPA) and Structural Equation Modeling (SEM). The results with IPA approach shows that the high priority supported by Guarantee Indicator (I_KP1), Performance (I_KP3), Power Hold (I_KP7), Comfort (I_KP9), Aesthetics (I_ATTF2), priority which maintained supported by Reliability Indicator (I_KP6), Availability (I_KP10), Reliability (I_KL1), Assurance Guarantee (I_KL3), Manifests itself (I_KL5), Performance (I_AP1), Performance (I_ATTF1), Reliability (I_ATTF4), Comfort (I_ATTF7), low priority on the Power Emergency Indicators (I_KP2), Aesthetics (I_KP4), focus (I_KP5), Frequency (I_KP8), Oversight (I_KL2), Attention (I_KL4), Focus (I_AP3), focus (I_ATTF3), Frequency (I_ATTF6), Availability ...

Some of the most difficult questions to answer when designing a distributed application are related to mobility: what information to transfer between sites and when and how to transfer it. Network-transparent distribution, the property that a program's behavior is independent of how it is partitioned among sites, does not directly address these questions. Therefore we propose to extend all language entities with a network behavior that enables efficient distributed programming by giving the programmer a simple and predictable control over network communication patterns. In particular, we show how to give objects an arbitrary mobility behavior that is independent of the objects definition. In this way, the syntax and semantics of objects are the same regardless of whether they are used as stationary servers, mobile agents, or simply as caches. These ideas have been implemented in Distributed Oz, a concurrent object-oriented language that is state aware and has dataflow synchroniz...

Often in academia, women and minorities are held to a higher standard in how they present themselves (caring, empathetic) and how they manage the emotions of colleagues and students. The emotional labour that is expected of them is well documented. In this paper, I develop a new concept to address the emotional labour of diversity workers: Responsive Diversity Work. I summarize Carla Fehr’s view of the epistemic diversity worker, develop a theory of emotional labour, and explain how the responsive diversity worker, in virtue of the unfair emotional labour expected of her, is at great risk of mental health issues

Cet article traite du suivi de pose direct basé modèle 3D. Nous considérons la transformation d'images omnidirectionnelles en Mélange de Gaussiennes Photométriques (MGP) comme primitives directes. Les contributions sont d'adapter l'optimisation de pose aux caméras omnidirectionnelles et de repenser les règles d'initialisation et d'optimisation du paramètre d'extension du MGP. Plusieurs évaluations montrent que cette approche augmente la taille du domaine de convergence. L'application à des images acquises avec un robot mobile placé dans un environnement urbain, représenté par un grand nuage de points 3D coloré, montre une robustesse significative aux grands mouvements inter-images par rapport aux approches directes qui utilisent uniquement l'intensité des pixels.

Marcos Napolitano é uma das principais referências nacionais sobre a música popular, tanto no campo da historiografia da cultura brasileira, quanto no que tange a produções editoriais voltadas para a formação continuada de professores. Doutor e Livre-docente (USP), é professor do Departamento de História e do Programa de Pós-Graduação em História Social da Universidade de São Paulo (USP). Atua também como assessor ad hoc da Fundação de Amparo à Pesquisa do Estado de São Paulo (Fapesp) e do CNPq, bem como na Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (Capes). Líder do Grupo de Pesquisa “História e Audiovisual” (USP). Nesta entrevista, o professor Napolitano reflete sobre os rumos dos estudos sobre a música popular brasileira na historiografia brasileira e nas práticas de ensino desenvolvidas na educação básica. Relaciona as tradições historiográficas com as escolares, e aponta algumas possibilidades para as abordagens acadêmica e didática sobre o tema que ampliem o c...

Este estudio tuvo como objetivo investigar la aplicabilidad de los métodos de enseñanza colectiva en las bandas de marcha de Goiânia, buscando analizar la relevancia del material utilizado para la enseñanza de música, así como identificar diferentes prácticas pedagógicas en el ámbito de la enseñanza colectiva de instrumentos musicales. El procedimiento metodológico abarca las siguientes acciones: al principio tuvo lugar la revisión de la literatura, buscando la actualización de las investigaciones sobre el tema. En un segundo momento, tuvo lugar el levantamiento (encuesta) y análisis de posturas pedagógicas, tales como métodos de enseñanza colectiva para bandas y planificaciones didácticas involucrando uso de ejercicios propuestos por los profesores de música. Como conclusión, se notó que en el interior de las bandas de marcha hay una práctica arraigada que se está rompiendo: la enseñanza basada solamente en la tradición.

The queue length is an important parameter used by several companies of traffic management for quantitative analysis of traffic scene. In this paper, we propose a system to measure the queue length. The proposed system contains two principal operations for measuring the queue length the first operation is the motion detection, and the second one is the vehicle detection. The traffic scene is divided into a number of blocks, which have variable sizes based on the camera parameters and the distance between the camera and the position of the block. To minimize the execution time to accord the real-time application, we continuously apply the detection motion operation on the first block of the scene and the queue tail. The vehicle detection algorithm is based on the edge detection and the vehicle features extraction to improve the detection of vehicle and minimize the error of detection of the other things’ edges (damaged of road, the mark of the road, the shadow of trees or building). ...

Graph theory is used to represent a communication network by expressing its linkage structure, the vertices represent objects and the pairs called edges or represent the interconnections between objects. The exact geometric positions of vertices or the lengths of the edges are not important. The purpose of this paper is to find a recursive relation counting the number of spanning tree in Butterfly map that illustrate a connection problem suggested by Erdös and Rényi in 1962: Let there be given a country with n cities, n large, so that a direct air connection between two cities would require two busy airports. Considering the capacity limits of the airport, what is the number of flights that would get a passenger from any one city to another so that he needs change planes not more than once? Many results of this problem were given in the past [1], [4].

La spécificité de l’écriture critique, par rapport à celle de la promotion ou de l’analyse, est qu’elle émane de quelqu’un qui s’autorise à « évaluer » et dont une des fonctions est de faite cette évaluation. La morale « scientifique » de l’analyste lui interdit d’évaluer son objet sur le mode critique, conjoncturel. Seul son choix de tel ou tel film laisse supposer — le plus souvent implicitement — une évaluation globale préalable à la décision d’en faite son objet d’étude. L’évaluation — sans laquelle il ne saurait y avoir véritablement d’écriture critique — peut se faite au nom d’un consensus préexistant (autour d’un système de valeurs supposées partagées par les lecteurs de telle revue, tels journal ou hebdomadaire), au nom de la pure subjectivité de son auteur (la critique d’humeur connaît encore de beaux jours) ou en essayant de produire des « preuves » prélevées dans le film pour corroborer la validité des jugements qu’elle émet. Cet article travaille pour l’essentiel ce qui ...

A tuberculose é tida como uma patologia infecciosa, tendo o Mycobacterium tuberculosis como agente etiológico, na qual afeta, principalmente, os pulmões e pode se desenvolver em outros órgãos do corpo, sendo que as manifestações clínicas estão diretamente relacionadas com o órgão atingido. Este estudo objetivou analisar o conhecimento de moradores quanto à transmissibilidade e prevenção da tuberculose e suas implicações biopsicossociais. Trata-se de um estudo descritivo, exploratório, com abordagem quantitativa, realizado com 118 clientes de uma Estratégia Saúde da Família de Minas Gerais. Utilizou-se um questionário estruturado como instrumento de coleta de dados. O tratamento dos dados se deu através de epidemiologia descritiva simples não paramétrica e não probabilística. Observou-se que a maior parte dos entrevistados era do sexo feminino, com idade entre 18-45 anos, pardos, com ensino médio e apresentavam ocupação. A maior parte da amostra conhece sobre a definição da doença (8...

In contrast to regular queries that are evaluated only once, a continuous query remains active over a period of time and has to be continuously evaluated to provide up to date answers. We propose a method for continuous range query processing for different types of queries, characterized by mobility of objects and/or queries which all follow paths in an underlying spatial network. The method assumes an available 2D indexing scheme for indexing spatial network data. An appropriately extended R *-tree, that primarily is used as an indexing scheme for network segments, provides matching of queries and objects according to their locations on the network or their network routes. The method introduces an additional pre-refinement step which generates main-memory data structures to support efficient, incremental reevaluation of continuous range queries in periodically performed refinement steps.

Resumo No Brasil existe a perspectiva de crescimento expressivo do volume de dados a ser processado pelas prestadoras de serviços de rastreamento de veículos em decorrência do aumento natural do uso de sistemas de rastreamento. Esse crescimento gera a necessidade da incorporação de ferramentas analíticas nos sistemas de gerenciamento do rastreamento e monitoramento de veículos e na gestão de risco, para aumentar a sua eficiência e atender ao crescimento do mercado. O presente estudo tem como objetivo o desenvolvimento de um modelo para identificação do Padrão de Comportamento Espacial de Veículos em Movimento – PCEVM, utilizando uma ferramenta de análise espacial para auxiliar o processo de tomada de decisão no monitoramento de veículos e na gestão do sistema de transporte urbano. Embora os resultados obtidos sejam válidos para a particular configuração apresentada neste artigo, a metodologia de análise proposta permite a caracterização de padrões espaciais de movimentação de veícul...

Large numbers of mobile objects and continuous queries about them characterize mobile object applications. Efficient and parallel evaluation of queries about mobile objects that continuously move is important for achieving acceptable response times. In such applications, the traditional approaches suffer from the need for parallel updates processing and real time querying and visualization. This results in poor performance in such critical systems. The emerging multicore and manycore microprocessing ...

Currently, large quantities of position-aware mobile objects, such as GPS, mobile phone, PDA, various smart vehicles are merging in distributed environment and systems. The real world applications such as Location-Based Services etc. are being developed in an ad hoc fashion. As a result, software technologies that enable the management of positions of distributed mobile objects capable of very large numbers and very frequent changes are in increasingly high demand. We introduce to mobile agent technology for managing mobile objects in a distributed computing environment. The paper firstly presents a framework of management of distributed mobile objects. A Hierarchical Location Schema for the indexing of historic and current positions of distributed mobile objects among nodes is put forward to locate node quickly. Time-stamped E-R model is put forwar d as the basis of data handling to support the schema. Also, mobile agent computing model is proposed for real-time update, load balancing and robust against network troubles. In the model, techniques of naming and addressing are applied and designed. For the purpose of implementation of distributed query processing, two kinds of mobile agents: collaborative agent and information agent are implemented. Taking the examples of real-time tracking simulation and distributed query processing, the proposed method and model are finally applied to demonstrate its effectiveness and robust for the design and development of distributed system.

Wireless sensor networks have the potential to great significant subsystems of networks applications. Tracking remote targets is an important wireless network application in both military and non-military fields for applications like finding objects or humans or guiding wireless robots in hard to reach areas e.g. nuclear-power plants etc. Tracking mobile targets involves detection and localization of the object of interest by processing the information provided by the remote nodes along with their location and route. Actually Target tracking is main problem in sensor network. Where it's detect and how accurate position can measured. i studies the target tracking problem in a MSN, where it is believed that mobility tracking can be exploited to improve the tracking resolution. This problem becomes more challenging when target and sensor are not at same position. I find out the correlations and sensitivity from a set of system parameters and the minimum number of mobile sensors tha...

To improve the profitability and the quality of services, and to confront the difficult competition, companies are in search of the effective approaches to improve their professions in general, and the management of the supply chain in particular which plays an essential role for reduction of cost, the improvement of the quality of services, and increase of the productivity. This work aims to improve the performance of supply chain by the conception of trajectories data warehouse intended to collect the data relative to the mobile objects. The information stored in the data warehouse will be analyzed to extract knowledge which we use to a decision-making and leading to strengthen the management of the supply chain.

Heidegger Reader of Augustine: Towards a Hermeneutics of Facticity, Through the Experience of Religious Life The aim of this article is to show how the young Heidegger, in his summer course of 1921, discovers in Augustine, while interpreting Book X of the Confessions, a proto-phenomenologist and hermeneuticist of the factical life (or facticity). We will show that Augustine's description of Christian religious life offers Heidegger concrete material for the elaboration of his own indicative-formal interpretation of existence, itself subordinated to a strict "methodological atheism".

The similarity between trajectory patterns in clustering has played an important role in discovering movement behaviour of different groups of mobile objects. Several approaches have been proposed to measure the similarity between sequences in trajectory data. Most of these measures are based on Euclidean space or on spatial network and some of them have been concerned with temporal aspect or ordering types. However, they are not appropriate to characteristics of spatiotemporal mobility patterns in wireless networks. In this paper, we propose a new similarity measure for mobility patterns in cellular space of wireless network. The framework for constructing our measure is composed of two phases as follows. First, we present formal definitions to capture mathematically two spatial and temporal similarity measures for mobility patterns. And then, we define the total similarity measure by means of a weighted combination of these similarities. The truth of the partial and total similarity measures are proved in mathematics. Furthermore, instead of the time interval or ordering, our work makes use of the timestamp at which two mobility patterns share the same cell. A case study is also described to give a comparison of the combination measure with other ones.

Volunteer Computing systems (VC) use the idle computing resources which are composed of unreliable volunteers whose exhibit volatile behavior and often they are not available because of the autonomy nature of owners. Scientific experiments that use internet-connected computers are internet based VC projects. However, the volatility of volunteer is significant challenge in VC and it is effective on applications that are using these types of hosts. Therefore, investigating resource characterization in order to derive efficient factors of host's availability is needed to improve VC systems. Factors analysis of hosts is fruitful in making better decision for job scheduler in order to improve system's performance. The purpose of this paper is determination the availability score model for volatile hosts according to statistical analysis of host's factors from actual occurrence trace data set. This study is proved the relationship across host's factors then it is proposed Scoring Availability Model.

Crosstalk is a problem in increasing the transmission capacity of multicore fiber networks. This research aimed to reduce inter-core crosstalk in multicore fiber networks. The method used was core allocation, i.e the core management and the spectrum slot. This method employs parallelization of two algorithms. First, the core prioritization algorithm which is based on the structural core of multicore fiber. Second, the core classification algorithm which is based on the required bandwidth connection. The research result indicated that this method worked well and effectively reduced the number of overlapping spectrum, so that it reduced the inter-core crosstalk of multicore fiber to 59.76%. It was concluded that the proposed method can reduce crosstalk problem in multicore fiber networks.

Large numbers of mobile objects and continuous queries about them characterize mobile object applications. Efficient and parallel evaluation of queries about mobile objects that continuously move is important for achieving acceptable response times. In such applications, the traditional approaches suffer from the need for parallel updates processing and real time querying and visualization. This results in poor performance in such critical systems. The emerging multicore and manycore microprocessing technologies have the potential to offer scalable performance improvement. How to explore the multicore resources to speed up mobile objects applications is thus a natural question but also a huge challenge for Moving Objects Applications (MOA). In this paper, we propose and evaluate a methodology to explore parallelism via multi-threading, transactional loosely coupled methodology design, and to implement it on multicore processors for Moving Objects Applications. We apply the proposed ...

In this paper, we formalize the novel concept of Constrained Reverse k-Nearest Neighbor (CRkNN) search on mobile objects (clients) performed at a central server. The CRkNN query computes for a given query object q the set RkNN(q) of objects having q as one of their k-nearest neighbors, iff the result set exceeds a specific threshold m, i.e. Card(RkN N (q)) ≥ m. Otherwise, the query reports an empty result. In our setting, the positions of the query object and database objects are approximated by minimal bounding rectangles that depend on the last reported location of the object, as well as on the time that has been passed since the object reported its recent exact location. We propose an approach that minimizes the amount of communication between clients and central server by using the approximation of the positions to identify true hits and true drops. We present a multi-step filter/refinement framework that uses a novel refinement heuristic to minimize the number of objects that are required to provide their exact location. Our solution does not assume any preprocessing steps which makes it applicable for dynamic environments where updates of the database frequently occur. Experiments show that our approach considerably reduces the communication load compared to existing approaches designed for traditional reverse nearest neighbor search in static data.

In this paper we focus on the problem of continuously monitoring the set of Reverse k-Nearest Neighbors (RkNNs) of a query object in a moving object database using a client server architecture. The RkNN monitoring query computes for a given query object q, the set RkNN(q) of objects having q as one of their k-nearest neighbors for each point in time. In our setting the central server can poll the exact positions of the clients if needed. However in contrast to most existing approaches for this problem we argue that in various applications, the limiting factor is not the computational time needed but the amount of traffic sent via the network. We propose an approach that minimizes the amount of communication between clients and central server by an intelligent approximation of the position of the clients. Additionally we propose several poll heuristics in order to further decrease the communication costs. In the experimental section we show the significant impact of our proposed improvements to our basic algorithm.

Some of the most difficult questions to answer when designing a distributed application are related to mobility: what information to transfer between sites and when and how to transfer it. Networktransparent distribution, the property that a program’s behavior is independent of how it is partitioned among sites, does not directly address these questions. Therefore we propose to extend all language entities with a network behavior that enables efficient distributed programming by giving the programmer a simple and predictable control over network communication patterns. In particular, we show how to give objects an arbitrary mobility behavior that is independent of the object’s definition. In this way, the syntax and semantics of objects are the same regardless of whether they are used as stationary servers, mobile agents, or simply as caches. These ideas have been implemented in Distributed Oz, a concurrent object-oriented language that is state aware and has dataflow synchronizatio...

Na última década a tecnologia OLAP tem sido redesenhada para melhor atender à demanda de dados textuais, tendo que remodelar suas medidas e dimensões. A hierarquia de tópicos surgiu como uma alternativa para organizar dimensões textuais em diferentes níveis semânticos. Contudo, tal hierarquia é criada uma única vez e utilizada para todos os cuboides do cubo. A hierarquia de tópicos é sensível ao conteúdo dos documentos, portanto diferentes células de um cubo agregam diferentes conjuntos de documentos, produzindo hierarquias de tópicos distintas. Este artigo apresenta uma abordagem para OLAP textual que constrói múltiplas hierarquias de tópicos para cada célula do cubo, denominada DTCubing. Múltiplas hierarquias são viáveis porque cada documento pode ser particionado em diversos segmentos de texto, tais como título, resumo, parágrafo, dentre outros. Este artigo também pretende contribuir com a apresentação dos resultados das consultas multidimensionais. O estado da arte em OLAP textu...

Large numbers of mobile objects and continuous queries about them characterize mobile object applications. Efficient and parallel evaluation of queries about mobile objects that continuously move is important for achieving acceptable response times. In such applications, the traditional approaches suffer from the need for parallel updates processing and real time querying and visualization. This results in poor performance in such critical systems. The emerging multicore and manycore microprocessing technologies have the potential to offer scalable performance improvement. How to explore the multicore resources to speed up mobile objects applications is thus a natural question but also a huge challenge for Moving Objects Applications (MOA). In this paper, we propose and evaluate a methodology to explore parallelism via multi-threading, transactional loosely coupled methodology design, and to implement it on multicore processors for Moving Objects Applications. We apply the proposed ...

O processo de treinamento de um cao-guia e dividido em algumas etapas. A socializacao e a primeira etapa da formacao, na qual o animal e encaminhado a uma familia socializadora. Esse artigo apresenta uma proposta para a analise de trajetorias de um cao-guia durante o processo de socializacao. Por meio de um algoritmo de pre-processamento os dados brutos de trajetorias passam por um processo de limpeza e enriquecimento semântico, com a finalidade de se reduzir a quantidade de dados armazenados e agregar um maior significado sobre as atividades realizadas durante o trajeto. Ao termino do pre-processamento e possivel inferir a quilometragem percorrida, tempo de permanencia e quantidade de paradas em certos locais, bem como os meios de transporte utilizados. Com esses indicadores busca-se determinar a qualidade da socializacao e das experiencias que o cao vivenciou. Por fim essas informacoes sao disponibilizadas em um portal web, com o objetivo de facilitar a visualizacao dos dados. Pal...

The constant increase in road traffic jams demands research related to urban mobility. These studies model the traffic analysis as a trajectory problem, i.e., from the individualized analysis of vehicles that continuously send their geolocations. Such moving objects function as trajectory sensors and produce large amounts of data. It is possible to observe, however, an absence of studies related to spatial-temporal aggregations from trajectories of the urban vehicles. As a preliminary work on this subject, this paper establishes a baseline for anomaly identification in urban mobility, which may be found useful for developing new approaches that provide a better comprehension of urban mobility systems. Resumo. O constante aumento de congestionamentos no tráfego rodoviário demanda pesquisas relacionadas a mobilidade urbana. Esses estudos modelam a análise do tráfego como um problema de trajetória, i.e., a partir da análise individualizada de veı́culos que continuamente transmitem suas...

In this paper we propose two algorithms aimed at increasing the performance of drill-across queries in data warehousing environments. The JM-G algorithm is used when numeric measures of different data warehouses are usually required together. The EG-JM algorithm extends the first one also considering storage requirements. The performance tests carried out using the TPC-H benchmark showed a huge improvement on the query performance with a reduced additional storage requirement.

Este artigo apresenta um sistema Web para busca de rotas de ônibus como ferramenta de auxílio a usuários de transporte público. A aplicação desenvolvida usa o algoritmo A*, conhecido no campo de inteligência artificial, como base para a geração de rotas de ônibus. A API do Google Maps é empregada para ilustrar os resultados visuais e descritivos de dada busca. Dois experimentos foram realizados a fim de avaliar a usabilidade e corretude da ferramenta.

This paper presents an approach based on hardware/software partitioning to minimize the logic area of System on a Programmable Chip (SOPC) while respecting a time constraint. Our contribution focuses on introducing a new hardware/software partitioning algorithm. This algorithm is based on the principle of Binary Search Trees (BST) and genetic algorithms. It aims to define the tasks that will run on the Hardware (HW) part and those that will run on the Software (SW) part. The proposed algorithm will determine the best partition that will reduce the number of tasks used by the HW and increase the number of tasks used by the SW and thereafter the area will be reduced. The results show that our algorithm significantly reduces the logic area compared to other well known algorithms.

The similarity between trajectory patterns in clustering has played an important role in discovering movement behaviour of different groups of mobile objects. Several approaches have been proposed to measure the similarity between sequences in trajectory data. Most of these measures are based on Euclidean space or on spatial network and some of them have been concerned with temporal aspect or ordering types. However, they are not appropriate to characteristics of spatiotemporal mobility patterns in wireless networks. In this paper, we propose a new similarity measure for mobility patterns in cellular space of wireless network. The framework for constructing our measure is composed of two phases as follows. First, we present formal definitions to capture mathematically two spatial and temporal similarity measures for mobility patterns. And then, we define the total similarity measure by means of a weighted combination of these similarities. The truth of the partial and total similarity measures are proved in mathematics. Furthermore, instead of the time interval or ordering, our work makes use of the timestamp at which two mobility patterns share the same cell. A case study is also described to give a comparison of the combination measure with other ones.