A computer-enabled solution procedure for food wholesalers’ distribution decision in cities with a circular transportation infrastructure

This paper addresses the food distribution decision from a wholesaler's perspective, as the wholesalers are often faced with thorny issues such as when, where, how to deliver products at the lowest costs to best satisfy the retailers’ changing needs. This research relies on a distribution problem encountered at Northern Grocery Company in Beijing as an example to develop a two-stage solution procedure and subsequent computer-enabled programs for identifying efficient vehicle routing alternatives. The solution process, which integrates heuristic search algorithms and an integer programming model, can be applied to a wide range of distribution problems with specified route durations and a circular transportation network structure as exemplified by City of Beijing.     

对等数据管理系统中模式映射的备份机制

针对对等数据管理系统中节点因自治性而动态离开和返回网络造成模式映射路径频繁断裂的问题,提出一种基于模式映射备份机制的离开节点绕过方法,向下游节点提供以树状结构组织的上游映射信息。当映射路径中有节点离开时,其下游节点的查询以此映射信息和备份的上游映射,绕过离开节点。仿真和分析的结果表明,映射备份机制的引入提高了查询的可达性,从而可以从更多的局部数据库中获得返回结果。     

改进的基于目录的Cache一致性协议

介绍几种典型目录一致性协议并分析它们的优缺点。在综合全映射目录和有限目录优点的基础上,通过在存储器层上增加一个存储器高速缓存（Cache）层的方式,提出并讨论一种改进后的Cache一致性协议。该协议相对有限目录存储开销增加不多的情况下,提高了系统性能和可扩展性。     

TPC-H自动测试工具TPCHDriver的研究

TPC—H基准测试可以比较不同数据库系统之间的查询性能差别,它的测试结果已经成为评价DBMS和服务器的重要标准。该文开发了自动化的TPC—H测试工具TPCHDriver,该工具应用面向对象设计、Java语言开发,图形用户界面,实现了从数据装载到Power测试和Throughtput测试、生成测试报告整个过程的自动化。简述了TPC—H基准的测试模型、TPCHDriver程序的结构和主要功能,阐述了TPCHDriver的关键实现技术。     

CORBA在电信网络管理中的应用

国际电信联盟ITU提出的电信管理网TMN(Telecommunication Management Network)概念,目的在于建立一个具有综合管理能力的网管体系结构对电信网络进行有效的管理.而将CORBA应用到TMN中已成为必然趋势,需要利用CORBA在开发分布式系统方面的优势来构造具有强大功能的综合网络管理平台.阐述CORBA的技术特点和核心概念,并且基于这些技术特点,研究利用CORBA建立分布式网络管理的管理模型.     

An efficient image encryption algorithm based on a novel chaotic map

Multimedia Tools and Applications - In this paper, we propose a novel low dimensional chaotic map, namely, compounded piecewise linear map (CPLM) in order to balance between security and...     

Reachability determination in acyclic Petri nets by cell enumeration approach

Reachability is one of the most important behavioral properties of Petri nets. We propose in this paper a novel approach for solving the fundamental equation in the reachability analysis of acyclic Petri nets, which has been known to be NP-complete. More specifically, by adopting a revised version of the cell enumeration method for an arrangement of hyperplanes in discrete geometry, we develop an efficient solution scheme to identify firing count vector solution(s) to the fundamental equation on a bounded integer set, with a complexity bound of O((nu)^n−m), where n is the number of transitions, m is the number of places and u is the upper bound of the number of firings for all individual transitions.