Previous work on moving object mobile group pattern mining defined and proposed algorithms for mobile group mining based on their individual movement data. Movement data is expected to be widely available owing to the increasing popularity of tractable mobile devices on the cutting edge. However, existing approaches of mobile group pattern mining do not consider temporal dimension. Considering that human beings often act as a group according to some temporal features such as routine activities, in this thesis, we engage in the discovery of valid mobile groups that pertain to the some temporal patterns. In our research, we introduce the calendar-based representation mechanism to be our representation of temporal dimension. Taking the calendar patterns into account, we define a new problem called calendar-based mobile group mining problem and develop efficient algorithms for the problem. The proposed algorithms are evaluated via synthetic location data generated by a sensible data generator.

The global mobile telecommunications service market has witnessed an explosion of users after telecommunication liberalization, and the market is still growing. The global mobile phone subscribers will climb to 2 billion by the end of 2005, accounting for 1/3 of the global population. In the meantime, mobile communications system evolves into the 3rd generation system, which has wider bandwidth and higher transmission speed. Except for the pure voice services, mobile services increase variousvalue added services, helping mobile operators generate new revenues andfight back the declining voice ARPU. Consequently, mobile contentproviders, which creating, producing, aggregating and publishing themobile content, are attracted to this important emerging industry. In sum, mobile phone is a new media, which has great potential. At this moment, large mobile content providers grow quickly through acquisition. The global business scale is forming. On the other hand, giant brand media gradually enter the mobile content industry and enhancethe competition of the industry.After the telecommunication liberalization, Taiwan mobilesubscribers had grown dramatically in the late 1990s and now the market ismatured.Therefore, the value added services are more important to the mobileindustry. However, compare to the other countries, Taiwan market islimited and lack of economic of scale. Also, Taiwan subscribers do not get used to the mobile Internet, and the voice service is the most part of usage. The percentage of mobile data revenue is 5% only, far below that of Koreaand Japan. The whole environment is unfavorable to the mobile contentproviders.To break through the development bottleneck in Taiwan, this researchoffers the following suggestions.(1) The large mobile content aggregators / publishers should establish thebrand awareness and customer loyalty, based on the stable,differentiate, and various content products, convenient market channels,and superior community management.(2) The smaller mobile content providers with limited resources shouldverify and reinforce the core competence, look for the complementaryresources setting up an agreement or alliance to enhance thecompetitive advantage.(3) Content providers should think about the global oriented products whendesigning the product, which is favorable for export.Besides, the mobile operators and government should play animportant role to establish the friendly environment to boost the mobile content industry. 1. Only integrated business platform can satisfy users expectations of MC and such platforms providers hold the role of value distributor in MC value net. 2. Leaderships are proved again the key driving force to lead corporate exploring MC opportunities, especially the leaders¡¦ vision and strategic move of focusing on business platform rather than product activates new core competences which can generate new values. 3. Integrality of MC business platform determines its competition advantages, while the extensibility of which determines its potential market scale. 4. Products or serviced with clear core functions, simple operation and easy user interface will win the MC game. Sophisticated and complicated integration products only brings hurdle to the majority of end users. 5. Right tariff model turns the MC business platform to positive cycle. Challenge to new MC business platform providers is to convince relevant partners a beneficial intergrowth model and, on the other hand, accept ion of user value oriented tariff model, e.g. flat rate, to lower down users hurdle to adopt new service. Keywords ¡G Mobile Commerce, Business Model

IP multicast is an efficient means of sending to a group. Our protocol is built on top of the existing static hosts IP unicast and multicast forwarding services to avoid triangle routing which always occurs in Mobile IP. Relying only on the existing multicast service model and reconstructing the delivery tree every time a multicast member and/or source move is not always a good solution. By applying the ideas of bi-directional tunneled multicast [3], our protocol attempts to hide host mobility from all other members of the group. Therefore, the multicast distribution tree will not be updated for the sake of member location change. Furthermore, our protocol has near shortest delivery paths like remote subscription protocol [3]. Our protocol can also adapt to the fluctuation of both host movement and the number of mobile members (i.e., having mobility and scalability properties). According to our protocol, the tunnel convergence problem resulting from bi-directional tunneling will be solved. By changing service range ``R', we can trade off the advantages and disadvantages of both bi-directional tunneling and remote subscription (they are the extremes of RBMoM). We measure the system performance and cost in different service range, topology size and mobile population density through simulation. According to the results of our simulation, we believe our protocol has much better performance without using the current Mobile IP multicast solutions.

Recently, the explosive growth of the World Wide Web (WWW for short) has raised great. The performance, scalability and availability of web system is importance. So, large-scale web sites use cluster architecture at now. Although web cluster architecture provides those advantages of performance, scalability and availability, and so on, but management is too trouble. As a result, efficient management and maintenance will be a primarily concern on the performance of such complex system. And we know that administrator is not always at office, maybe go out. If anything come up in the system, how to do? So, let administrator to do mobile administration at anytime, any time, and intelligent function sole system event quickly. Administration anywhere will come true. In this paper, we design and implement the Mobile Administration System for Distributed Web Server to solve above problems. In the system, we illustrate mobile devices at now, for example, mobile phone, PDA, hand-held device, and so on. For the sake of let all mobile devices to use administration system, we design a gateway that using Model-View-Controller architecture. The gateway supports all data type, for example, WML, VHTML, XHTML, and so on. We also design the Push Function to tell administrator what happened in the system. Besides, Intelligent Function help administrator to handle system event quickly, the system will be more reliability. Mobile Administration System for Distributed Web Server let administrator to do mobile administration at anytime, any time. Another, intelligent function sole system event quickly, so the system will be more reliability. The Mobile Administration System has below features¡G1.Support all mobile to manage. 2.Push Function tells administrator what happened in the system. 3.Intelligent Function handles system event quickly.

Personal robotics applications require autonomous mobile robot navigation methods that are safe, robust, and inexpensive. Two requirements for autonomous use of robots for such applications are an automatic motion planner to select paths and a robust way of ensuring that the robot can follow the selected path given the unavoidable odometer and control errors that must be dealt with for any inexpensive robot. Additional difficulties are faced when there is more than one robot involved. In this dissertation, we describe a new roadmapbased method for mobile robot navigation. It is suitable for partially known indoor environments and requires only inexpensive range sensors. The navigator selects paths from the roadmap and designates localization points on those paths. In particular, the navigator selects feasible paths that are sensitive to the needs of the application (e.g., no sharp turns) and of the localization algorithm (e.g., within sensing range of two features). We present a new sectorbased localizer that is robust in the presence of sensor limitations and unknown obstacles while still maintaining computational efficiency. We extend our approach to teams of robots focusing on quickly sensing ranges from all robots while avoiding sensor crosstalk, and reducing the pose uncertainties of all robots while using a minimal number of sensing rounds. We present experimental results for mobile robots and describe a webbased route planner for the Texas A&M campus that utilizes our navigator.

This thesis presents the results from a modification of a previously existing research project titled the Intelligent Pothole Repair Vehicle (IPRV). The direction of the research in this thesis was changed toward the development of an industrially based mobile robot. The principal goal of this work was the demonstration of the Precision Mechatronics Lab (PML) robot. This robot should be capable of traversing any known distance while maintaining a minimal position error. An optical correction capability has been added with the addition of a webcam and the appropriate image processing software. The primary development goal was the ability to maintain the accuracy and performance of the robot with inexpensive and low-resolution hardware. Combining the two abilities of dead-reckoning and optical correction on a single platform will yield a robot with the ability to accurately travel any distance. As shown in this thesis, the additional capability of off-loading its visual processing tasks to a remote computer allows the PML robot to be developed with less expensive hardware. The majority of the literature research presented in this paper is in the area of visual processing. Various methods used in industry to accomplish robotic mobility, optical processing, image enhancement, and target interception have been presented. This background material is important in understanding the complexity of this field of research and the potential application of the work conducted in this thesis. The methods shown in this research can be extended to other small robotic vehicles, with two separate drive wheels. An empirical method based upon system identification was used to develop the motion controllers. This research demonstrates a successful combination of a dead-reckoning capability, an optical correction method, and a simplified controller methodology capable of accurate path following. Implementation of this procedure could be extended to multiple and inexpensive robots used in a manufacturing setting.

Building autonomous mobile agents has been a major research effort for a while with cooperative mobile robotics receiving a lot of attention in recent times. Motion planning is a critical problem in deploying autonomous agents. In this research we have developed two novel global motion planning schemes for a group of mobile agents which eliminate some of the disadvantages of the current methods available. The first is the homotopy method in which the planning is done in polynomial space. In this method the position in local frame of each mobile agent is mapped to a complex number and a time varying polynomial contains information regarding the current positions of all mobile agents, the degree of the polynomial being the number of mobile agents and the roots of the polynomial representing the position in local frame of the mobile agents at a given time. This polynomial is constructed by finding a path parameterized in time from the initial to the goal polynomial (represent the initial and goal positions in local frame of the mobile agents) so that the discriminant variety or the set of polynomials with multiple roots is avoided in polynomial space. This is equivalent to saying that there is no collision between any two agents in going from initial position to goal position. The second is the homogeneous deformation method. It is based on continuum theory for motion of deformable bodies. In this method a swarm of vehicles is considered at rest in an initial configuration with no restrictions on the initial shape or the locations of the vehicles within that shape. A motion plan is developed to move this swarm of vehicles from the initial configuration to a new configuration such that there are no collisions between any vehicles at any time instant. It is achieved via a linear map between the initial and desired final configuration such that the map is invertible at all times. Both the methods proposed are computationally attractive. Also they facilitate motion coordination between groups of mobile agents with limited or no sensing and communication.

No description available.

Techn. Universiẗat, Diss. u.d.T.:Blankenbach, Jörg: Architektur und Umsetzung mobiler standortbezogener Anwendungen und Dienste unter Berücksichtigung von Interoperabilität--Darmstadt, 2006.

Ph.D--Åbo--Akademi university, 2005. / Notes bibliogr.