Mixed coordination mechanisms for scheduling games on hierarchical machines

In this paper, we study scheduling games under mixed coordination mechanisms on hierarchical machines. The two scheduling policies involved are ‐ and ‐, where ‐ (resp., ‐) policy sequences jobs in nondecreasing order of their hierarchies, and jobs of the same hierarchy in nonincreasing (resp., nondecreasing) order of their processing times. We first show the existence of a Nash equilibrium. Then we present the price of anarchy and the price of stability for the games with social costs of minimizing the makespan and maximizing the minimum machine load. All the bounds given in this paper are tight.     

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.     

动态高压微射流处理对方竹笋膳食纤维理化及结构特性的影响

以方竹笋中提取的膳食纤维为研究对象，采用动态高压微射流（dynamic high-pressure micro-fluidization, DHPM）在不同压力条件（0，50，100，150，200 MPa）下进行处理，探究其对竹笋膳食纤维（bamboo shoots dietary fiber, BSDF）理化和结构特性的影响。结果表明，随着处理压力的增大，BSDF粒径先增大后减小，当处理压力为150 MPa时，粒径最小，为（370±11） nm，此条件下BSDF的持水力、持油力和膨胀力达到最大，较对照组分别提高了47.74%，50.54%，61.27%，且差异显著（P<0.05）。红外光谱分析表明DHPM处理不会改变BSDF的官能团，但会使BSDF内部的部分氢键断裂和半纤维素、木质素等发生降解；X射线衍射和热重分析表明DHPM处理不会引起BSDF的晶体结构改变，但晶体有序度会下降，进而导致其热稳定性降低；微观结构分析显示DHPM处理会使BSDF颗粒尺寸减小、表面粗糙、组织松散，且当处理压力为200 MPa时，颗粒发生团聚。综上，DHPM可以有效改善BSDF的理化性质，在膳食纤维改性方面具有一定的应用价值。     

光照水电站装设筒形阀分析

筒形阀是一种新型的水轮机进水阀,它与球阀或蝴蝶阀相比较有防止机组飞逸事故扩大效果明显、减轻导叶全关时导水机构的快速破坏并减少漏水量,以及动水开启方便、所需时间短等优点,但对运行条件也有一定的要求。光照水电站是贵州省第1个拟采用筒形阀的电站,为此对装设筒形阀的可行性和必要性进行了认真的分析。     

Model Selection for Unsupervised Learning of Visual Context

This study addresses the problem of choosing the most suitable probabilistic model selection criterion for unsupervised learning of visual context of a dynamic scene using mixture models. A rectified Bayesian Information Criterion (BICr) and a Completed Likelihood Akaike’s Information Criterion (CL-AIC) are formulated to estimate the optimal model order (complexity) for a given visual scene. Both criteria are designed to overcome poor model selection by existing popular criteria when the data sample size varies from small to large and the true mixture distribution kernel functions differ from the assumed ones. Extensive experiments on learning visual context for dynamic scene modelling are carried out to demonstrate the effectiveness of BICr and CL-AIC, compared to that of existing popular model selection criteria including BIC, AIC and Integrated Completed Likelihood (ICL). Our study suggests that for learning visual context using a mixture model, BICr is the most appropriate criterion given sparse data, while CL-AIC should be chosen given moderate or large data sample sizes.     

Scalable and Structured Scheduling

Scheduling a program (i.e. constructing a timetable for the execution of its operations) is one of the most powerful methods for automatic parallelization. A schedule gives a blueprint for constructing a synchronous program, suitable for an ASIC or VLIW processor. However, constructing a schedule entails solving a large linear program. Even if one accepts the (experimental) fact that the Simplex is almost always polynomial, the scheduling time is of the order of a large power of the program size. Hence, the method does not scale well. The present paper proposes two methods for improving the situation. First, a large program can be divided into smaller units (processes), which can be scheduled separately. This is structured scheduling. Second, one can use projection methods for solving linear programs incrementally. This is specially efficient if the dependence graph is sparse.     

新一代IP QoS的实现

文章介绍了新一代IP骨干网上的IP QoS实现技术，论述了集成业务(IntServ)与差分业务(DiffServ)解决方案的特点，详细介绍了相关的队列管理与排队机制。并结合多协议标签交换（MPLS)技术的最新发展，阐述了综合多协议标签交换流量工程与DiffServ技术体系端到端IP QoS的实现。     

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.     

嵌入式RTOS中任务优先级反转问题研究

针对嵌入式实时系统任务调度策略的特点，任务在运行的时候可能被更高优先级的任务中断。分析了嵌入式RTOS中的最高就绪任务的查找算法，指出该调度算法存在的不同优先级的反转问题，并且针对这一问题进行研究，给出了相应的优先级继承方案。较好地解决了RTOS中任务调度中的优先级的反转问题。     

燃气管网动态仿真的研究及应用

研究和了解燃气在管道中的流动，是进行燃气管网系统优化和提高管网输运系统安全性的前提和基础。以流体力学三大守恒方程为基础，建立了等温和非等温条件下的燃气管网稳态和动态仿真理论模型。以有限差分法为基础，得到了上述模型的求解方法，并加入了耗散项，提高了求解方法的稳定性。通过增加初始点和延长出口点的方法，简化了模型的求解。通过在北京六环天然气管网中的初步应用，分别得到了与实际值综合相对误差为1.21％和2.62％的压力和流量仿真值，从而验证了模型及求解方法的可靠性。