An agent-based service network for personal mobile devices

We propose the Agent Network for Bluetooth Devices, a system that uses personal mobile devices as adaptive human-environment interfaces to supply people with ad hoc information and high-level services. The ANBD system operates with a hierarchical framework of service-providing nodes, dynamically composed and managed by mobile agents.     

Financing and reliability analysis for schedules in the project calendar planning problem

We continue our earlier studies of the profit maximization problem in calendar planning of investment projects taking into account reinvesting of the obtained revenue and possible credit financing. We construct the corresponding model and describe a situation when only part of the jobs is financed with own money and credits, and the rest is raised by reinvesting the revenue. We study the calendar planning problem where incomes from various jobs are random values. We study the risks related both to getting a smaller income than expected and to failing a project. We propose an approach to estimate the reliability of job schedules.     

移动增值服务支付协议的设计与分析

增值服务在移动通信网络中的重要地位日趋显著。分析了当前基于PayWord构建的方案中存在的透支及低效等问题。基于全局PKI,提出新型移动通信环境中的增值服务支付协议。运用BAN逻辑对协议的安全性目标予以了证明,并对协议的计算复杂度等方面进行了比较分析。结论显示新方案具备适用于特定环境的用户端计算载荷低等众多特性,高效地解决了透支等问题。     

On strictly optimal schedules for the cumulative cost-optimal scheduling problem

Given a set ofn events (or jobs) which are constrained by a precedence relation, we want to order them into a totally ordered sequence (i. e., one machine schedule). Each event has an integer cost (which may be negative) associated with it, and our objective is to minimize the maximum cumulative cost within a schedule, i. e., to obtain a cumulative cost-optimal schedule. We introduce the concept of “strict optimality” and investigate properties of strictly optimal schedules. The usefulness of these schedules is demonstrated in the special case where the precedence relation is “series-parallel”. For this case we describe an algorithm which finds a cumulative cost-optimal schedule inO (n logn) time.     

An indoor location tracking based on mobile RFID for smart exhibition service

Recently, various smart application services have been developed using GPS (Global Positioning System), RFID (Radio Frequency IDentification) and sensor networks. The GPS has been successfully applied for outdoor location tracking by many applications, but it might still be insufficient in an indoor environment where GPS signals are often severely obstructed. The RFID technology has been utilized to play an important role in location tracking for indoor smart applications. Therefore, in this paper, we present the scenario and architecture of an indoor location tracking service for things or space in an exhibition environment based on mobile RFID. The RFID tags of things or spaces are identified as the locations of point being passed and we obtain the spatial data from the tags using mobile RFID readers, Web server and Database server. We have designed and implemented the prototype of location tracking system for exhibition scenario using Microsoft .NET framework. Additionally, we have verified the functionality of this system so various other indoor smart services may be provided using the proposed system.     

Stochastic bounds for queueing systems with limited service schedules

Motivated by the study of cyclic service queue processor schedules and token ring local area networks, upper and lower stochastic bounds for a GI/G/1 vacation model with limited service are developed. The limited service vacation model is compared with the Bernoulli schedule vacation model. For the case of Poisson arrivals and infinitely divisible vacation durations simple, closed-form expressions are given for upper and lower bounds of the first two moments of the waiting time. Some upper and lower bounds are also derived for cyclic queues with limited service. The quality of the bounds is illustrated through numerical examples.     

Context-aware mobile service for routing the fastest subway path

The rapid growth of the IT industry during the last few decades has increased demands on mobile devices such as PDAs, cellular phones, and GPS navigation systems. With emerging concepts of context-aware computing, the mobile devices can provide mobile users with timely information by using not only common knowledge but also environmental context such as current time and location. Lately, the context-aware applications have been actively investigated and have been contributed to numerous application areas such as real-time electronic catalogues and navigation systems for tourists. In this paper, we propose a new context-aware application for finding the fastest subway route. We have developed the proposed application as an implemented system named Optimize Your Time System (OYT System, for short). A terminal device of the OYT System is equipped with a GPS receiver and the system’s server contains a timetable of all trains in a target subway system. On perceiving users’ context such as current time and location automatically from GPS, the OYT System can display the optimal route which takes the shortest time for the user to reach the specified destination. In this paper, we present details of the OYT System and some experimental examples.     

An empirical investigation of mobile ticketing service adoption in public transportation

In this paper, we present results from a study of mobile ticketing service adoption in public transportation. The theoretical background of the study is based on technology adoption and trust theories, which are augmented with concepts of mobile use context and mobility. Our empirical findings from analyses of a survey data suggest that compatibility of the mobile ticketing service with consumer behavior is a major determinant of adoption. Mobility and contextual factors, including budget constraints, availability of other alternatives, and time pressure in the service use situation were also found to have a strong effect on the adoption decision. Our findings suggest that contextual and mobile service-specific features are important determinants of mobile service adoption and should thus be integrated into the traditional adoption models.     

Personal service areas for mobile Web applications

Location-based mobile services let wireless mobile users access Web-based information about resources in their immediate vicinities. The authors describe an algorithm that draws on context mobility elements, such as the user's travel direction and speed, to form personal service areas. Their experimental context-aware tourist information system (CATIS) leverages XML technologies and Web services to provide tourist information to mobile users based on these personal service areas and the users' preferences. Because Web service performance depends on the underlying databases, the authors also developed a layered caching scheme for storing environmental data to improve response time.     

A smartphone watch for mobile surveillance service

Mobile surveillance service is regarded as one of the Internet applications to which much attention is recently given. However, the time and cost problem resulting from using heterogeneous platforms and proprietary protocols must be a burden to developing such systems and expanding their services. In this paper, we present a framework of mobile surveillance service for smartphone users. It includes the design and implementation of a video server and a mobile client called smartphone watch. A component-based architecture is employed for the server and client for easy extension and adaptation. We also employ the well-known standard web protocol HTTP to provide higher compatibility and portability than using a proprietary one. Three different video transmission modes are provided for efficient usage of limited bandwidth resource. We demonstrate our approach via real experiments on a commercial smartphone.     

WFB服务安全问题分析及防范策略研究

认识WEB服务的安全漏洞、欺骗的基本原理，了解WEBN务欺骗的常用方法及手段，掌握常用的安全防范措施，对广大网络用户而言，具有积极和现实的应用价值。     

An efficient algorithm for finding ideal schedules

We study the problem of scheduling unit execution time jobs with release dates and precedence constraints on two identical processors. We say that a schedule is ideal if it minimizes both maximum and total completion time simultaneously. We give an instance of the problem where the min-max completion time is exceeded in every preemptive schedule that minimizes total completion time for that instance, even if the precedence constraints form an intree. This proves that ideal schedules do not exist in general when preemptions are allowed. On the other hand, we prove that, when preemptions are not allowed, then ideal schedules do exist for general precedence constraints, and we provide an algorithm for finding ideal schedules in O(n ³) time, where n is the number of jobs. In finding such ideal schedules we resolve a conjecture of Baptiste and Timkovsky (Math. Methods Oper. Res. 60(1):145–153, 2004) Further, our algorithm for finding min-max completion-time schedules requires only O(n ³) time, while the most efficient solution to date has required O(n ⁹) time.     

移动电子商务安全支付的业务模型分析及优化

本文介绍了移动电子商务安全支付的技术标准,分析了移动电子商务安全支付的业务模型——SeMoPS模型。最后,优化了SeMoPS模型的业务流程。     

Local search heuristics for the mobile facility location problem

In the mobile facility location problem (MFLP), one seeks to relocate (or move) a set of existing facilities and assign clients to these facilities so that the sum of facility movement costs and the client travel costs (each to its assigned facility) is minimized. This paper studies formulations and develops local search heuristics for the MFLP. First, we develop an integer programming (IP) formulation for the MFLP by observing that for a given set of facility destinations the problem may be decomposed into two polynomially solvable subproblems. This IP formulation is quite compact in terms of the number of nonzero coefficients in the constraint matrix and the number of integer variables; and allows for the solution of large-scale MFLP instances. Using the decomposition observation, we propose two local search neighborhoods for the MFLP. We report on extensive computational tests of the new IP formulation and local search heuristics on a large range of instances. These tests demonstrate that the proposed formulation and local search heuristics significantly outperform the existing formulation and a previously developed local search heuristic for the problem.     

An intelligent system for problem analysis in organizations

In this paper, we will present the work carried out in the field of Group Decision-making Systems, and in particular those problems that, because they are poorly defined (as are many of those encountered by organizations), require a previous analysis as systematized as possible. The work we are presenting was carried out in task 4.2. entitled ‘Negotiation Tools' of ESPRIT III Project no. 8749. The working group by which it was developed is still trying to introduce efficiently Knowledge Engineering techniques and methods so as to endow this system with greater flexibility and reliability. In this paper, we will try to describe the context of these types of problems, we will mention classic approaches to these problems and then we will describe the approach followed in the Project.     

On one problem of construction of energy-saving schedules

Construction of energy-saving schedules for the execution of n jobs on a processor with the use of the dynamic voltage scaling (DVS) mechanism is considered. A formal problem statement is presented. The problem is shown to be NP-hard. An algorithm with complexity O(n ₂/ε) guaranteeing finding of a (1 + ε)-approximate solution is suggested.     

An authentication protocol offering service anonymity of mobile device in ubiquitous environment

With the advent of ubiquitous era, various devices and services using wireless network are increasing. For communications in wireless network, mobile devices are used and various services are increasingly provided through mobile devices. The AAA (Authentication, Authorization, and Accounting) that authorizes and manages the mobile devices is processing the standardization for various application services for the purpose of the standardization of authentication, authorization, and accounting to provide safety and reliability of various services and protocols of both wired and wireless network. However, even if AAA exists the development of network varies vulnerabilities and attack types, and accordingly the exposure of information appears as the biggest problem. Therefore, this study suggests the safe authentication method that protects against information exposure by guaranteeing anonymity of service with temporal ID, and provides efficiency because AAA authentication server is based on the ticket given to a service server without the need of re-authentication when mobile node authorized from the AAA authentication server receives service.