An efficient location encoding method for moving objects using hierarchical administrative district and road network

Due to the rapid development in mobile communication technologies, the usage of mobile devices such as cell phone or PDA has increased significantly. As different devices require different applications, various new services are being developed to satisfy the needs. One of the popular services under heavy demand is the location-based service (LBS) that exploits the spatial information of moving objects per temporal changes. In order to support LBS well, in this paper, we investigate how spatio-temporal information of moving objects can be efficiently stored and indexed. In particular, we propose a novel location encoding method based on hierarchical administrative district information. Our proposal is different from conventional approaches where moving objects are often expressed as geometric points in two-dimensional space, (x, y). Instead, in ours, moving objects are encoded as one-dimensional points by both administrative district as well as road information. Our method becomes especially useful for monitoring traffic situation or tracing location of moving objects through approximate spatial queries.     

Beyond ‘mobility’: A new understanding of moving with technology

We report a surprising experience with mobile technology: the lead author found herself seeing and acting differently while running over part of her usual running track with the exercise‐tracking application ‘Strava’ on her phone, even without focal attention to the app. We apply the method of problematization to a detailed empirical account of this experience, in conjunction with a literature analysis of taken‐for‐granted assumptions underpinning research on ‘mobile technology use’. This reveals that, while the relationship of attention, perception, movement and technology was a key element of the surprise, these themes are not well accounted for in current IS literature. In response, we employ William Gibson's ecological theory of visual perception to reinterpret the empirical account and thereby build a new understanding of the human plus mobile technology that we term moving‐with‐technology. We introduce to IS: moving‐with‐technology as a new analytical perspective; the new phenomena of digital sub‐species, digital‐niches and asynchronous co‐location; and stimulus for new ecologically oriented ‘mobile methods’. Moving‐with‐technology also has practical implications for urban planners who are using data from digital trace‐making tools such as Strava in their decision‐making, thereby generating what we call ecological feedback loops.     

ROME4EU – A service‐oriented process‐aware information system for mobile devices

Nowadays, process‐aware information systems (PAISs) are widely used for the management of ‘administrative’ processes characterized by clear and well‐defined structures. Besides those scenarios, PAISs can be used also in mobile and pervasive scenarios, where process participants can be only equipped with smart devices, such as personal digital assistants. None of existing PAISs can be entirely deployed on smart devices, making unfeasible its usage in highly mobile scenarios. This paper presents ROME4EU, a mobile PAIS developed for being applied to the coordination of emergency operators, and an extensive validation of the system, both in term of performances and usability/acceptability by the users. Copyright © 2011 John Wiley & Sons, Ltd.     

oDect: an RFID‐based object detection API to support applications development on mobile devices

The RFID technology is becoming ever more popular in the development of ubiquitous computing applications. A full exploitation of the RFID potential requires the study and implementation of human–computer interaction (HCI) modalities to be able to support wide usability by the target audience. This implies the need for programming methodologies specifically dedicated to support the easy and efficient prototyping of applications to have feedback from early tests with users. On the basis of our field‐working experience, we have designed oDect, a high‐level language and platform‐independent application programming interface (API), ad hoc designed to meet the needs of typical applications for mobile devices (smart phones and PDAs). oDect aims at allowing application developers to create their prototypes focusing on the needs of the final users, without having to care about the low‐level software that interacts with the RFID hardware. Further, in an end‐user developing (EUD) approach, oDect provides specific support for the application end‐user herself to cope with typical problems of RFID applications in detecting objects. We describe in detail the features of the API and discuss the findings of a test with four programmers, where we analyse and evaluate the use of the API in four sample applications. We also present results of an end‐user test, which investigated strengths and weaknesses of the territorial agenda (TA) concept. The TA is an RFID‐based citizen guide that aids—through time‐ and location‐based reminders—users in their daily activities in a city. The TA directly exploits EUD features of oDect, in particular concerning the possibility of linking detected objects with custom actions. Copyright © 2008 John Wiley & Sons, Ltd.     

K‐MING: A mobile proxy handoff control scheme for proximate group‐based geodata sharing

This work adopts a mobile social network in proximity (MSNP)–centric group touring service concept to share geo–points of interest's (POIs') data among mobile users belonging to the same touring group. In a group‐based touring service, a mobile user can create a group in the MSNP that can consist of some clusters in which some members having the 3G/3.5G/4G cellular network service are selected as cluster leaders to enable their Wi‐Fi hot spot functions as mobile proxies. After that, each group member can join one of the clusters by connecting with a cluster leader's Wi‐Fi hot spot. Thereafter, each cluster leader downloads geo‐POIs' data using 3G/3.5G/4G cellular network and then shares the downloaded POIs' data with its cluster members through its Wi‐Fi hot spot. This work proposed a handoff mechanism such that each mobile user can handoff from its currently connected cluster to the other one that belongs to the same MNSP group. The main handoff concern is that each handheld device only allows a limited number of handheld devices to connect with its Wi‐Fi hot spot at the same time. This work proposed a K‐member‐limited MSNP‐based INter Group handoff scheme called K‐MING to tackle the handoff problem. The performance analysis shows that K‐MING for the group touring scenario has better performance for the sharing of geo‐POIs' data downloading in terms of average power consumption and average downloaded data volume from 3G/3.5G/4G cellular network than that of the individual touring scenario.     

A telematics service discovery platform using the distributed peer‐to‐peer networking system

In this paper, a distributed telematics peer‐to‐peer networking system is proposed to provide an efficient and feasible service discovery mechanism for mobile users. When mobile users travel on the road, they may request for some services from service providers to meet their demands. Mobile users in vehicles are assumed to go through a lot of regions, in which each region is associated with a region server. Related information of all service providers in a region is stored in its region server, and each region server is in charge of the service discovery requests from all vehicles located in its region. This paper focuses on the issues of developing a distributed peer‐to‐peer telematics service discovery networking system over the vehicular network environment for mobile users. To provide the communication mechanism for telematics service discovery among region server, mobile users, and service providers, the Telematics Service Markup Language is proposed. According to clients' demands, three types of query scenarios are proposed, which are (1) reference point based query, (2) continual query, and (3) route‐based query. Finally, we present usage examples and system implementation of distributed telematics peer‐to‐peer. Copyright © 2012 John Wiley & Sons, Ltd.     

State‐constrained stabilization of beam‐balance systems

We present nonlinear control techniques to stabilize a beam‐balance system with state constraints. We consider two different actuator configurations: the first one is actuated by a cart moving on the beam, while in the second case, the actuation is by a single electromagnet. In the first case, the constrained stabilization problem is solved via an output feedback controller designed using feedback linearization, Luenberger‐like observer and linear matrix inequality based optimization. In the second case, a Lyapunov‐based controller is proposed that takes care of both the input and state constraints. Copyright © 2007 John Wiley & Sons, Ltd.     

NVMRA: utilizing NVM to improve the random write operations for NAND‐flash‐based mobile devices

NAND flash memory has become the major storage media in mobile devices, such as smartphones. However, the random write operations of NAND flash memory heavily affect the I/O performance, thus seriously degrading the application performance in mobile devices. The main reason for slow random write operations is the out‐of‐place update feature of NAND flash memory. Newly emerged non‐volatile memory, such as phase‐change memory, spin transfer torque, supports in‐place updates and presents much better I/O performance than that of flash memory. All these good features make non‐volatile memory (NVM) as a promising solution to improve the random write performance for NAND flash memory. In this paper, we propose a non‐volatile memory for random access (NVMRA) scheme to utilize NVM to improve the I/O performance in mobile devices. NVMRA exploits the I/O behaviors of applications to improve the random write performance for each application. Based on different I/O behaviors, such as random write‐dominant I/O behavior, NVMRA adopts different storing decisions. The scheme is evaluated on a real Android 4.2 platform. The experimental results show that the proposed scheme can effectively improve the I/O performance and reduce the I/O energy consumption for mobile devices. Copyright © 2015 John Wiley & Sons, Ltd.     

Proxy‐guided Image‐based Rendering for Mobile Devices

VR headsets and hand‐held devices are not powerful enough to render complex scenes in real‐time. A server can take on the rendering task, but network latency prohibits a good user experience. We present a new image‐based rendering (IBR) architecture for masking the latency. It runs in real‐time even on very weak mobile devices, supports modern game engine graphics, and maintains high visual quality even for large view displacements. We propose a novel server‐side dual‐view representation that leverages an optimally‐placed extra view and depth peeling to provide the client with coverage for filling disocclusion holes. This representation is directly rendered in a novel wide‐angle projection with favorable directional parameterization. A new client‐side IBR algorithm uses a pre‐transmitted level‐of‐detail proxy with an encaging simplification and depth‐carving to maintain highly complex geometric detail. We demonstrate our approach with typical VR / mobile gaming applications running on mobile hardware. Our technique compares favorably to competing approaches according to perceptual and numerical comparisons.     

Peek‐in‐the‐Pic: Flying Through Architectural Scenes From a Single Image*

Many casually taken ‘tourist’ photographs comprise of architectural objects like houses, buildings, etc. Reconstructing such 3D scenes captured in a single photograph is a very challenging problem. We propose a novel approach to reconstruct such architectural scenes with minimal and simple user interaction, with the goal of providing 3D navigational capability to an image rather than acquiring accurate geometric detail. Our system, Peek‐in‐the‐Pic, is based on a sketch‐based geometry reconstruction paradigm. Given an image, the user simply traces out objects from it. Our system regards these as perspective line drawings, automatically completes them and reconstructs geometry from them. We make basic assumptions about the structure of traced objects and provide simple gestures for placing additional constraints. We also provide a simple sketching tool to progressively complete parts of the reconstructed buildings that are not visible in the image and cannot be automatically completed. Finally, we fill holes created in the original image when reconstructed buildings are removed from it, by automatic texture synthesis. Users can spend more time using interactive texture synthesis for further refining the image. Thus, instead of looking at flat images, a user can fly through them after some simple processing. Minimal manual work, ease of use and interactivity are the salient features of our approach.     

Position estimation of a mobile robot using images of a moving target in intelligent space with distributed sensors

Latest advances in hardware technology and state-of-the-art of mobile robots and artificial intelligence research can be employed to develop autonomous and distributed monitoring systems. A mobile service robot requires the perception of its present position to co-exist with humans and support humans effectively in populated environments. To realize this, a robot needs to keep track of relevant changes in the environment. This paper proposes localization of a mobile robot using images recognized by distributed intelligent networked devices in intelligent space (ISpace) in order to achieve these goals. This scheme combines data from the observed position, using dead-reckoning sensors, and the estimated position, using images of moving objects, such as a walking human captured by a camera system, to determine the location of a mobile robot. The moving object is assumed to be a point-object and projected onto an image plane to form a geometrical constraint equation that provides position data of the object based on the kinematics of the ISpace. Using the a priori known path of a moving object and a perspective camera model, the geometric constraint equations that represent the relation between image frame coordinates for a moving object and the estimated robot's position are derived. The proposed method utilizes the error between the observed and estimated image coordinates to localize the mobile robot, and the Kalman filtering scheme is used for the estimation of the mobile robot location. The proposed approach is applied for a mobile robot in ISpace to show the reduction of uncertainty in determining the location of a mobile robot, and its performance is verified by computer simulation and experiment.     

Optimal Motion Planning of Robotic Manipulators Removing Mobile Objects Grasped in Motion

The following study deals with motion optimization of robot arms having to transfer mobile objects grasped when moving. This approach is aimed at performing repetitive transfer tasks at a rapid rate without interrupting the dynamics of both the manipulator and the moving object. The junction location of the robot gripper with the object, together with grasp conditions, are partly defined by a set of local constraints. Thus, optimizing the robot motion in the approach phase of the transfer task leads to the statement of an optimal junction problem between the robot and the moving object. This optimal control problem is characterized by constrained final state and unknown traveling time. In such a case, Pontryagin"s maximum principle is a powerful mathematical tool for solving this optimization problem. Three simulated results of removing a mobile object on a conveyor belt are presented; the object is grasped in motion by a planar three-link manipulator.     

Parameter reductions in N‐soft sets and their applications in decision‐making

Parameter reduction is an important operation for improving the performance of decision‐making processes in various uncertainty theories. The theory of N‐soft sets is emerging as a powerful mathematical tool for dealing with uncertainties beyond the standard formulation of the soft set theory. In this research article, we extend the notion of parameter reduction to N‐soft set theory, and we also justify its practical calculation. To this purpose, we define related theoretical concepts (e.g. N‐soft subset, reduct N‐soft set and redundant parameter) and examine some of their fundamental properties. Then, we argue that the idea of attributes reduction from the rough set theory cannot be employed in the N‐soft set theory in order to reduce the number of parameters. Consequently, we take an original position in order to adequately define and compute parameter reductions in N‐soft sets. Finally, we develop an application of parameter reduction of N‐soft sets.     

Investigating Modern‐Day Talaria: Mobile Phones and the Mobility‐Impaired in Singapore

Revisiting the medical and social models of disability, this study adopted the integrated biopsychosocial approach to examine experiences of 25 mobility‐impaired respondents in Singapore with using mobile phones. We found that mobile phones provided respondents a greater degree of mobility, a sense of control, and opportunities to escape the stigma of disability, thus challenging the boundaries between the able‐bodied and the disabled. Mobile phone appropriation allowed the management of personal identities and social networks, leading to a sense of empowerment. However, mobile phone usage might act as a double‐edged sword for disabled people, creating mobile dependencies and a spatial narrowing of social connections. Theoretical and practical implications are discussed.     

A3M: an agent architecture for automated manufacturing

This paper proposes a software architecture based on mobile agents for distributed process control applications. A set of agents is employed to handle, in a single manufacturing cell, automatic assignment of control tasks to controllers, monitoring of cell functionalities and dynamic cell reconfiguration. The agents operate in a two‐layered structure: at the highest level, the planning agents analyse the inputs of the system designer and automatically create the field agents, which operate at the lowest level and embed the control tasks to be executed. Field agents, which are mobile, are able to reach autonomously the controllers of the cell, in order to perform the control activity there. Exploiting the mobility enables a field agent to change its running device when the variation of the design parameters or a system fault requires a new task distribution. A load‐balancing algorithm is introduced, with the objective of assigning each field agent to a controller of the manufacturing cell in order to fairly distribute the computation load. The algorithm uses a branch‐and‐bound technique to explore all possible solutions and applies two heuristics to throw away non‐feasible solutions and select the best branch to analyse. The algorithm is designed to run on‐line in order to allow a fast task redistribution when a fault condition occurs in the process control environment. Copyright © 2008 John Wiley & Sons, Ltd.     

C‐LOD: Context‐aware Material Level‐of‐Detail applied to Mobile Graphics

Attention‐based Level‐Of–Detail (LOD) managers downgrade the quality of areas that are expected to go unnoticed by an observer to economize on computational resources. The perceptibility of lowered visual fidelity is determined by the accuracy of the attention model that assigns quality levels. Most previous attention based LOD managers do not take into account saliency provoked by context, failing to provide consistently accurate attention predictions. In this work, we extend a recent high level saliency model with four additional components yielding more accurate predictions: an object‐intrinsic factor accounting for canonical form of objects, an object‐context factor for contextual isolation of objects, a feature uniqueness term that accounts for the number of salient features in an image, and a temporal context that generates recurring fixations for objects inconsistent with the context. We conduct a perceptual experiment to acquire the weighting factors to initialize our model. We design C‐LOD, a LOD manager that maintains a constant frame rate on mobile devices by dynamically re‐adjusting material quality on secondary visual features of non‐attended objects. In a proof of concept study we establish that by incorporating C‐LOD, complex effects such as parallax occlusion mapping usually omitted in mobile devices can now be employed, without overloading GPU capability and, at the same time, conserving battery power.     

MicroMAIS: executing and orchestrating Web services on constrained mobile devices

Mobile devices with their more and more powerful resources allow the development of mobile information systems in which services are not only provided by traditional systems but also autonomously executed and controlled in the mobile devices themselves. Services distributed on autonomous mobile devices allow both the development of cooperative applications without a back‐end infrastructure and the development of applications blending distributed and centralized services. In this paper, we propose MicroMAIS: an integrated platform for supporting the execution of Web service‐based applications natively on a mobile device. The MicroMAIS platform is composed of mAS and μ‐BPEL. The former allows the execution of a single Web service, whereas the latter permits the orchestration of several Web services according to the WS‐BPEL standard. Copyright © 2011 John Wiley & Sons, Ltd.     

Feedback limitations of linear sampled‐data periodic digital control

We present a set of feedback limitations for linear time‐invariant systems controlled by periodic digital controllers based upon an analysis of the inter‐sample response of the closed‐loop system to sinusoidal inputs. Fundamental sensitivity and complementary sensitivity functions govern the fundamental and harmonic components of the continuous closed‐loop response. The continuous and discrete response of the system is sensitive to variations in the analog plant at frequencies integer multiples of ω_s/N away from the excitation frequency, where ω_s is the sampling frequency and N is the period of the controller. These functions satisfy interpolation and integral constraints due to open‐loop non‐minimum phase zeros and unstable poles. In addition, the use of periodic digital control may result in a reduction in closed‐loop bandwidth. Copyright © 2000 John Wiley & Sons, Ltd.     

Mobiiscape: Middleware support for scalable mobility pattern monitoring of moving objects in a large-scale city

With the explosive proliferation of mobile devices such as smartphones, tablets, and sensor nodes, location-based services are getting even more attention than before, considered as one of the killer applications in the upcoming mobile computing era. Developing location-based services necessarily requires an effective and scalable location data processing technology. In this paper, we present Mobiiscape, a novel location monitoring system that collectively monitors mobility patterns of a large number of moving objects in a large-scale city to support city-wide mobility-aware applications. Mobiiscape provides an SQL-like query language named Moving Object Monitoring Query Language (MQL) that allows applications to intuitively specify Mobility Pattern Monitoring Queries (MPQs). Further, Mobiiscape provides a set of scalable location monitoring techniques to efficiently process a large number of MPQs over a large number of location streams. The scalable processing techniques include a (1) Place Border Index, a spatial index for quickly searching for relevant queries upon receiving location streams, (2) Place-Based Window, a spatial-purpose window for efficiently detecting primitive mobility patterns, (3) Shared NFA, a shared query processing technique for efficiently matching complex mobility patterns, and (4) Attribute Pre-matching Bitmap, an in-memory data structure for efficiently filtering out moving objects based on their attributes. We have implemented a Mobiiscape prototype system. Then, we show the usefulness of the system by implementing promising location-based applications based on it such as a ubiquitous taxicab service and a location-based advertising. Also, we demonstrate the performance benefit of the system through extensive evaluation and comparison.     

Space‐Time Co‐Segmentation of Articulated Point Cloud Sequences

Consistent segmentation is to the center of many applications based on dynamic geometric data. Directly segmenting a raw 3D point cloud sequence is a challenging task due to the low data quality and large inter‐frame variation across the whole sequence. We propose a local‐to‐global approach to co‐segment point cloud sequences of articulated objects into near‐rigid moving parts. Our method starts from a per‐frame point clustering, derived from a robust voting‐based trajectory analysis. The local segments are then progressively propagated to the neighboring frames with a cut propagation operation, and further merged through all frames using a novel space‐time segment grouping technqiue, leading to a globally consistent and compact segmentation of the entire articulated point cloud sequence. Such progressive propagating and merging, in both space and time dimensions, makes our co‐segmentation algorithm especially robust in handling noise, occlusions and pose/view variations that are usually associated with raw scan data.