地方高校图书馆面向区域产业社会化服务模式的探讨——以北部湾经济区为例

通过对北部湾经济区50家企业进行调查,了解被调查企业的基本情况、信息获取渠道、信息需求情况和“馆企”合作意愿等方面,据此提出了地方高校图书馆面向区域产业开展社会化服务模式的思路,要深入北部湾经济区产业园区,了解企业的信息需求是开展信息服务的前提;在高校“产学研”中寻找社会化服务的契合点;建设北部湾高校图书馆联盟,实现区域资源共建共享;建设特色数据库,为区域产业提供文献保障。     

新公共服务：西方行政管理发展新趋势

新公共行政管理模式在历史上一度成为西方国家政府改革效仿的对象,随着行政管理市场导向的推进,新公共服务模式进入西方行政管理的视野。通过对传统公共管理模式的思考,提出了新公共服务行政责任观,同时对传统的新公共管理模式予以对比和批判,提出新公共服务模式的行政实践,即竭诚为公民提供服务的核心理念。     

网格GIS中空间信息描述语言的研究

在网格GIS系统中,分布在不同位置的数据、信息、互操作、协同等需要具有一种标准的语言,使相互之间能够进行对话和交流,GridGML(GridGeographicMarkupLanguage)将是解决这些问题的关键技术。在XML技术、网格体系结构技术及OGC的GML3标准的基础上,对GridGML进行了研究,提出了其设计思想。     

采用XML Web Service实现异构系统的数据交换

广州石化为实现"销售管理系统"与汽车衡"称重管理系统"的数据交互,采用XML Web Service技术使两个系统实现了无缝的数据交互.介绍采用XML Web Service实现异构系统数据交换的技术和实现方法.     

An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints

We provide an efficient computational approach to solve the mixed integer programming (MIP) model developed by Tarim and Kingsman [8] for solving a stochastic lot-sizing problem with service level constraints under the static-dynamic uncertainty strategy. The effectiveness of the proposed method hinges on three novelties: (i) the proposed relaxation is computationally efficient and provides an optimal solution most of the time, (ii) if the relaxation produces an infeasible solution, then this solution yields a tight lower bound for the optimal cost, and (iii) it can be modified easily to obtain a feasible solution, which yields an upper bound. In case of infeasibility, the relaxation approach is implemented at each node of the search tree in a branch-and-bound procedure to efficiently search for an optimal solution. Extensive numerical tests show that our method dominates the MIP solution approach and can handle real-life size problems in trivial time.     

Comparative analysis of the machine repair Problem with imperfect coverage and service pressure condition

In this paper we analyze the warm-standby M/M/R machine repair problem with multiple imperfect coverage which involving the service pressure condition. When an operating machine (or warm standby) fails, it may be immediately detected, located, and replaced with a coverage probability c by a standby if one is available. We use a recursive method to develop the steady-state analytic solutions which are used to calculate various system performance measures. The total expected profit function per unit time is derived to determine the joint optimal values at the maximum profit. We first utilize the direct search method to measure the various characteristics of the profit function followed by Quasi-Newton method to search the optimal solutions. Furthermore, the particle swarm optimization (PSO) algorithm is implemented to find the optimal combinations of parameters in the pursuit of maximum profit. Finally, a comparative analysis of the Quasi-Newton method with the PSO algorithm has demonstrated that the PSO algorithm provides a powerful tool to perform the optimization problem.     

Service differentiation through selective lateral transshipments

We consider a multi-item spare parts problem with multiple warehouses and two customer classes, where lateral transshipments are used as a differentiation tool. Specifically, premium requests that cannot be met from stock at their preferred warehouse may be satisfied from stock at other warehouses (so-called lateral transshipments). We first derive approximations for the mean waiting time per class in a single-item model with selective lateral transshipments. Next, we embed our method in a multi-item model minimizing the holding costs and costs of lateral and emergency shipments from upstream locations in the network. Compared to the option of using only selective emergency shipments for differentiation, the addition of selective lateral transshipments can lead to significant further cost savings (14% on average).     

Make-or-buy service capacity decision in a supply chain providing after-sales service

We consider a supply chain comprising a manufacturer and a retailer. The manufacturer supplies a product to the retailer, while the retailer sells the product bundled with after-sales service to consumers in a fully competitive market. The sales volume is affected by the retailer’s service-level commitment. The retailer can build service capacity in-house at a deterministic price before service demand is realized, or buy the service from an outsourcing market at an uncertain price after service demand realization. We find that the outsourcing market encourages the retailer to make a higher level of service commitment, while prompting the manufacturer to reduce the wholesale price, resulting in more demand realization. We analyze how the expected cost of the service in the outsourcing market and the retailer’s risk attitude affect the decisions of both parties. We derive the conditions under which the retailer is willing to build service capacity in-house and under which it will buy the service from the outsourcing market. Moreover, we find that the manufacturer’s sharing with the retailer the cost to build service capacity improves the profits of both parties.     

Two hyperfinite constructions of the brownian bridge

Infinitesimal Analysis is used to give two constructions of the brownian bridge process. In the first construction a hyperfinite tied down random walk is used and a brownian bridge is obtained via the standard part map. As a consequence it is shown that the brownian bridge is the weak limit of a sequence of normalized tied down random walks. The second construction is based on a hyperfinite uniform empirical process. This construction gives an almost trivial proof of Donsker's Invariance Principle for the uniform empirical process     

On a bulk arrival bulk service infinite service queue

This paper considers an infinite server queue in continuous time in which arrivals are in batches of variable size X and service is provided in groups of fixed size R. We obtain analytical results for the number of busy servers and waiting customers at arbitrary time points. For the number of busy servers, we obtain a recursive relation for the partial binomial moments both in transient and steady states. Special cases are also discussed