Sustainability of ride-hailing services in China’s mobility market: A simulation model of socio-technical system transition

As a symbol of sharing economy, ride-hailing services have spread to Asia, where various forms of services have been established according to the existing socio-technical regimes, including legal, policy, and environmental concerns. China, in particular, has accepted ride-hailing services by revising existing institutions. This study analyzes China’s acceptance of ride-hailing services in the socio-technical system context set up for legacy services. Simulation modeling, combined with transition theory and an agent-based model, is used to analyze the data. This study calculates consumer disutility based on mobility market share, reflecting consumer preference, and predicts the sustainability of ride-hailing services. The simulation results conclude that legalization and socio-technical context are of importance for sustainable mobility.     

Liner services network design and fleet deployment with empty container repositioning

Transportation demand of shipping container fluctuates due to the seasonality of international trade, thus, every 3–6 months, the liner company has to alter its current liner shipping service network, redeploy ships and design cargo routes with the objective of minimizing the total cost. To solve the problem, the paper presents a mixed integer linear program model. The proposed model incorporates several relevant constraints, such as weekly frequency, the transshipment of cargo between two or more service routes, and transport time. Extensive numerical experiments based on realistic date of Asia–Europe–Oceania shipping operations show that the proposed model can solve real-case problems efficiently by CPLEX. The results demonstrate that the model can reduce ship’s capacity consumption and raise ships’ capacity utilization.     

Quantum computation based bundling optimization for combinatorial auction in freight service procurements

Combinatorial auction is a useful trade manner for transportation service procurements in e-marketplaces. To enhance the competition of combinatorial auction, a novel auction mechanism of two-round bidding with bundling optimization is proposed. As the recommended the auction mechanism, the shipper/auctioneer integrates the objects into several bundles based on the bidding results of first round auction. Then, carriers/bidders bid for the object bundles in second round. The bundling optimization is described as a multi-objective model with two criteria on price complementation and combination consistency. A Quantum Evolutionary Algorithm (QEA) with β-based rotation gate and the encoding scheme based on non-zero elements in complementary coefficient matrix is developed for the model solution. Comparing with a Contrast Genetic Algorithm, QEA can achieve better computational performances for small and middle size problems.     

Research on Circular Area Search algorithm of multi-robot service based on SOA cloud platform

Considering autonomous mobile robots with a variety of specific functions as a kind of service, when there are many types and quantities of services and the density of regional services is large, proposing an algorithm of Circular Area Search (CAS) because of the problem of multi-robot service scheduling in various areas. Firstly, Django is used as the web framework to build the Service-Oriented Architecture (SOA) multi-robot service cloud platform, which is the basic platform for multi-service combination. Then, the service type, the latitude and longitude and the scoring parameters of the service are selected as the service search metrics to design the CAS algorithm that based on the existing service information registered in MySQL and the Gaode Map for screening optimal service, and then providing the service applicant with the best service. Finally, the service applicant applies for the self-driving tour service as an example to perform performance simulation test on the proposed CAS algorithm. The results show that the CAS algorithm of the multi-robot service cloud platform proposed in this paper is practical compared to the global search. And compared with the Greedy Algorithm experiment, the service search time is reduced about 58% compared with the Greedy Algorithm, which verifies the efficiency of CAS algorithm.     

Effective Location Based Services with Dynamic Data Management in Mobile Environments

With the proliferation of mobile computing technologies, location based services have been identified as one of the most promising target application. We classify mobile information service domains based on feature characteristics of the information sources and different patterns of mobile information access. By carefully examining the service requirements, we identify the dynamic data management problem that must be addressed for effective location based services in mobile environments. We then devise a general architecture and cost model for servicing both location independent and location dependent data. Based on the architecture and cost model, we propose a set of dynamic data management strategies that employs judicious caching, proactive server pushing and neighborhood replication to reduce service cost and improve response time under changing user mobility and access patterns. Detail behavior analysis helps us in precisely capturing when and how to apply these strategies. Simulation results suggest that different strategies are effective for different types of data in response to different patterns of movement and information access. Shiow-yang Wu is an associate professor of the Department of Computer Science and Information Engineering at National Dong Hwa University, Hualien, Taiwan, R.O.C. He received the BS and MS degrees in computer engineering from National Chiao Tung University, Hsinchu, Taiwan, ROC, and the PhD degree in computer science from the University of Texas at Austin in 1984, 1986, and 1995, respectively. His research interests include data/knowledge bases, mobile computing, distributed processing, intelligence information systems, and electronic commerce. Kun-Ta Wu was born in Taipei, Taiwan, R.O.C., in 1976. He received the B.S. degree in computer science from Soochow University, Taipei, Taiwan, R.O.C., in 1999 and the M.S. degree in computer science and information engineering from National Dong Hwa University, Hualien, Taiwan, R.O.C., in 2001. Currently, he is an Assistant Researcher in the Domestic Division at Science and Technology Information Center, National Science Council, R.O.C., as a member of Information Gathering and Analysis Group of National Information and Communication Security Taskforce. His research interests include mobile computing, wireless network and information security.     

全球宽带电话市场分析

近两年．IP电话又叫网络电话的发展受到全球的关注。随着宽带接入的发展，基于宽带接入提供的网络电话具有了更大的生命力。从宽带电话的经营模式出发，探究这类业务的出现时现有话音业务市场的影响，进而分析这类业务的发展前景。     

Revising deductive knowledge and stereotypical knowledge in a student model

A user/student model must be revised when new information about the user/student is obtained. But a sophisticated user/student model is a complex structure that contains different types of knowledge. Different techniques may be needed for revising different types of knowledge. This paper presents a student model maintenance system (SMMS) which deals with revision of two important types of knowledge in student models: deductive knowledge and stereotypical knowledge. In the SMMS, deductive knowledge is represented by justified beliefs. Its revision is accomplished by a combination of techniques involving reason maintenance and formal diagnosis. Stereotypical knowledge is represented in the Default Package Network (DPN). The DPN is a knowledge partitioning hierarchy in which each node contains concepts in a sub-domain. Revision of stereotypical knowledge is realized by propagating new information through the DPN to change default packages (stereotypes) of the nodes in the DPN. A revision of deductive knowledge may trigger a revision of stereotypical knowledge, which results in a desirable student model in which the two types of knowledge exist harmoniously.     

缺省理论的简化

缺省理论△=(D,W)中的缺省规则集D,是该理论的不确定因素.如果能去掉一些缺省规则而又不影响该理论的延伸,则就在一定程度上简化了该理论.本文证明了关于规范缺省理论的延伸的若干性质,利用这些性质,我们可以把某些规范缺省理论在一定条件下得以化简,有的甚至可以把它们化为一阶逻辑理论.     

跟踪世界先进技术 振兴我国智能网产业

本文全面介绍了我国跟踪智能网世界先进技术，研究开发自主产权的国产智能网情况，简述了国产主流产品ＣＩＮ系列智能网产品产业化和应用情况，对国产智能网的发展应用和产业化提出了建议。     

Web服务提供方安全模型的分析与设计

讨论了Web服务提供方的安全问题,通过对Web服务调用方式的分析,为Web服务的提供方设计了安全模型.所设计的模型不依赖于服务提供方选用的安全策略,方便策略的更改和安全检查机制的更新.该模型同样适用于Web服务的需求方.