基于SOA技术的高校URP建设的研究

通过基于SOA技术的高校管理工作一体化信息系统软件的设计,综合性地量化学校各项重要信息,使信息一体化程度更为集中,帮助管理工作者、校务管理人员做出动态的管理决策调整,对于URP流程改造提供具体的实践模型参考。同时研究出一种能够应用于各类普通高校管理工作的无线与网络相结合的软件系统设计模型,提供一种可量化的工作数据系统样本,以比较低廉的代价解决校园信息化过程中的信息孤岛问题,进一步提升校园信息一体化程度。     

分布式网格资源发现研究综述

网格是实现分布式资源共享的重要系统,资源发现是此类系统应提供的一项主要服务。给定用户的资源需求,系统应能发现并返回匹配的资源列表。作为网格研究的热点课题,资源发现受到了众多研究者的关注,取得了丰富的研究成果,也预留了若干问题尚未解决。详述了该领域近年来的研究成果,包括基于有结构和无结构对等模型的扁平模式、超级对等架构、分组聚类模型和语义匹配等分布式方法。对每类方案,讨论了其代表系统、核心问题及实现机制等内容。     

多项目多资源均衡问题及其基于Pareto的向量评价微粒群算法

首先针对多项目多资源均衡问题的特点,建立描述问题的多目标优化模型;然后将Pareto方法嵌入向量评价微粒群算法(VEPSO),提出一种新的基于Pareto的向量评价微粒群算法(VEPSO-BP);最后利用一个算例测试了VEPSO-BP的性能,并与VEPSO进行了对比.实验结果表明,VEPSO-BP的收敛性能优于VEPSO,实现了对多项目多资源均衡问题的高质量求解.     

On Lazy Bin Covering and Packing problems

In this paper, we study two interesting variants of the classical bin packing problem, called Lazy Bin Covering (LBC) and Cardinality Constrained Maximum Resource Bin Packing (CCMRBP) problems. For the offline LBC problem, we first prove the approximation ratio of the First-Fit-Decreasing and First-Fit-Increasing algorithms, then present an APTAS. For the online LBC problem, we give a competitive analysis for the algorithms of Next-Fit, Worst-Fit, First-Fit, and a modified HARMONIC_M algorithm. The CCMRBP problem is a generalization of the Maximum Resource Bin Packing (MRBP) problem Boyar et al. (2006) [1]. For this problem, we prove that its offline version is no harder to approximate than the offline MRBP problem.     

Distributed bandwidth allocation based on alternating evolution algorithm

In a network, end nodes have to compete for bandwidth through some distributed congestion control algorithms. It is a great challenge to ensure the efficiency and fairness of the distributed control algorithms. TCP congestion control algorithms do not perform well in terms of their efficiency and fairness in high speed networks. In this paper, we propose a novel asymptotic evolution algorithm based on the Logistic Model to allocate limited bandwidth resource. The algorithm introduces an explicit bandwidth pre-allocation factor. The factor is carried by the packet and is computed in routers based on the information of the router capacity, the aggregate load, and the instantaneous queue length; therefore the algorithm does not require the routers to keep the per-flow state. According to this pre-allocation bandwidth factor, the senders asymptotically adjust their sending rate and the bandwidth factor changes asymptotically along with the variation of the aggregate load and the queue length in the routers; therefore the sending rate and the pre-allocation bandwidth factor form alternating evolution and eventually reach a steady state.     

基于蚁群算法的网格资源发现模型研究

本文通过对传统的网格资源发现存在的问题进行分析,针对其不足,引入蚁群算法,提出基于蚁群算法的网格资源发现模型（AA_GRRM）,设计并分析AA_GRRM的体系结构,并对其关键模块分析设计,以提高网格资源发现效率。     

Does India need to harmonize the law of patent exhaustion and parallel imports?

The amendment of patent law of India in 2005 to fulfill her international obligation under the TRIPS Agreement (World Trade Organization Agreement on Trade Related Intellectual Property Rights) was an outcome of an attempt to balance the competing interests of several stakeholders, including indigenous pharmaceutical companies, multi-national pharmaceutical companies, non-governmental organizations and civil society groups concerned with access to affordable drugs. The adverse consequence of this delicate balancing is introduction of some provisions in the Act whose compatibility with the TRIPS Agreement is questionable, and which therefore are prone to litigations. Section 107A(b) of the amended patent law dealing with parallel imports is one such provision, which, if interpreted word for word could have significant connotations for the rights of a patent owner. This article aims to examine the inconsistencies intrinsic in Section 107A(b) and discusses the divergences in the Indian patent law associated with the doctrine of exhaustion and parallel imports. This article also proposes legal amendments with a view to eliminate inconsistencies intrinsic in the section and enlarge the ambit of the exhaustion principle conceptualized therein, while concurrently remaining compliant with the TRIPS Agreement.     

基于WSRF的FPGA远程实验服务

介绍WSRF规范,结合FPGA实验特点和WSRF协议中状态管理,设计基于WSRF的远程实验架构。使用WSRF.NET设计与实现FPGA实验资源服务,通过实验验证了服务的正确性。实验结果表明,使用WSRF规范设计FPGA实验资源服务能解决实验的中间状态问题,实现实验时间、空间的开放。     

Inverse data envelopment analysis model to preserve relative efficiency values: The case of variable returns to scale

This paper studies the inverse Data Envelopment Analysis (inverse DEA) for the case of variable returns to scale (inverse BCC). The developed inverse BCC model can preserve relative efficiency values of all decision making units (DMUs) in a new production possibility set composing of all current DMUs and a perturbed DMU with new input and output values. We consider the inverse BCC model for a resource allocation problem, where increases of some outputs and decreases of the other outputs of the considered DMU can be taken into account simultaneously. The inverse BCC problem is in the form of a multi-objective nonlinear programming model (MONLP), which is not easy to solve. We propose a linear programming model, which gives a Pareto-efficient solution to the inverse BCC problem. However, there exists at least an optimal solution to the proposed model if and only if the new output vector is in the set of current production possibility set. The proposed approach is illustrated via a case study of a motorcycle-part company.     

On scheduling a single machine with resource dependent release times

We consider a single machine scheduling problem with resource dependent release times that can be controlled by a non-increasing convex resource consumption function. The objective is to minimize the weighted total resource consumption and sum of job completion times with an initial release time greater than the total processing times. It is known that the problem is polynomially solvable in O(n⁴) with n the number of jobs.