Gibbs sampling based distributed OFDMA resource allocation

In this article, we present a distributed resource and power allocation scheme for muRip]e-resource wireless cellular networks. The global optimization of multi-cell multi-link resource allocation problem is known to be NP-hard in the general case. We use Gibbs sampling based algorithms to perform a distributed optimization that would lead to the global optimum of the problem. The objective of this article is to show how to use the Gibbs sampling （GS） algorithm and its variant the Metropolis-Hastings （MH） algorithm. We also propose an enhanced method of the MH algorithm, based on a priori known target state distribution, which improves the convergence speed without increasing the complexity. Also, we study different temperature cooling strategies and investigate their impact on the network optimization and convergence speed. Simulation results have also shown the effectiveness of the proposed methods.     

Nondeterministic Probabilistic Petri Net — A New Method to Study Qualitative and Quantitative Behaviors of System

There are many variants of Petri net at present,and some of them can be used to model system with both function and performance specification,such as stochastic Petri net,generalized stochastic Petri net and probabilistic Petri net.In this paper,we utilize extended Petri net to address the issue of modeling and verifying system with probability and nondeterminism besides function aspects.Using probabilistic Petri net as reference,we propose a new mixed model NPPN(Nondeterministic Probabilistic Petri Net) system,which can model and verify systems with qualitative and quantitative behaviours.Then we develop a kind of process algebra for NPPN system to interpret its algebraic semantics,and an actionbased PCTL(Probabilistic Computation Tree Logic) to interpret its logical semantics.Afterwards we present the rules for compositional operation of NPPN system based on NPPN system process algebra,and the model checking algorithm based on the action-based PCTL.In order to put the NPPN system into practice,we develop a friendly and visual tool for modeling,analyzing,simulating,and verifying NPPN system using action-based PCTL.The usefulness and effectiveness of the NPPN system are illustrated by modeling and model checking an elaborate model of travel arrangements workflow.     

Semi-Online Algorithms for Scheduling with Machine Cost

In this paper, we consider the following semi-online List Model problem with known total size. We are given a sequence of independent jobs with positive sizes, which must be assigned to be processed on machines. No machines are initially provided, and when a job is revealed the algorithm has the option to purchase new machines. By normalizing all job sizes and machine cost, we assume that the cost of purchasing one machine is 1. We further know the total size of all jobs in advance. The objective is to minimize the sum of the makespan and the number of machines to be purchased. Both non-preemptive and preemptive versions are considered. For the non-preemptive version, we present a new lower bound 6/5 which improves the known lower bound 1.161. For the preemptive version, we present an optimal semi-online algorithm with a competitive ratio of 1 in the case that the total size is not greater than 4, and an algorithm with a competitive ratio of 5/4 otherwise, while a lower bound 1.0957 is also presented for general case.     

Lattice-based key exchange on small integer solution problem

In this paper, we propose a new hard problem, called bilateral inhomogeneous small integer solution （Bi-ISIS）, which can be seen as an extension of the small integer solution problem on lattices. The main idea is that, instead of choosing a rectangle matrix, we choose a square matrix with small rank to generate Bi-ISIS problem without affecting the hardness of the underlying SIS problem. Based on this new problem, we present two new hardness problems： computational Bi-ISIS and decisional problems. As a direct application of these problems, we construct a new lattice-based key exchange （KE） protocol, which is analogous to the classic Diffie- Hellman KE protocol. We prove the security of this protocol and show that it provides better security in case of worst-case hardness of lattice problems, relatively efficient implementations, and great simplicity.     

Scientific articles recommendation with topic regression and relational matrix factorization

In this paper we study the problem of recommending scientific articles to users in an online community with a new perspective of considering topic regression modeling and articles relational structure analysis simultaneously. First, we present a novel topic regression model, the topic regression matrix factorization （tr-MF）, to solve the problem. The main idea of tr-MF lies in extending the matrix factorization with a probabilistic topic modeling. In particular, tr-MF introduces a regression model to regularize user factors through probabilistic topic modeling under the basic hypothesis that users share similar preferences if they rate similar sets of items. Consequently, tr-MF provides interpretable latent factors for users and items, and makes accurate predictions for community users. To incorporate the relational structure into the framework of tr-MF, we introduce relational matrix factorization. Through combining tr-MF with the relational matrix femtorization, we propose the topic regression collective matrix factorization （tr-CMF） model. In addition, we also present the collaborative topic regression model with relational matrix factorization （CTR-RMF） model, which combines the existing collaborative topic regression （CTR） model and relational matrix factorization （RMF）. From this point of view, CTR-RMF can be considered as an appropriate baseline for tr-CMF. Further, we demonstrate the efficacy of the proposed models on a large subset of the data from CiteULike, a bibliography sharing service dataset. The proposed models outperform the state-of-the-art matrix factorization models with a significant margin. Specifically, the proposed models are effective in making predictions for users with only few ratings or even no ratings, and support tasks that are specific to a certain field, neither of which has been addressed in the existing literature.     

Extending Hoare Logic with an Infinite While-Rule

In the paper we generalize the while-rule in Hoare calculus to an infinite one and then present a sufficient condition much weaker than the expressiveness for Cook‘2 relative completeness theorem with respect to our new axiomatic system.Using the extended Hoare calculus we can derive true Hoare formulas which contain while statements free of loop invariants.It is also pointed out that the weak condition is a first order property and therefore provides a possible approach to the characterization of relative completeness which is also a first order property.     

Range Query Processing in Multidisk Systems

In order to reduce the disk access time,a database can be stored on several simultaneously accessible disks.In this paper,we are concerned with the dynamic d-attribute database allocation problem for range queries,An allocation method,called coordinate moule allocation method,is proposed to allocate data in a d-attribute database among disks so that the maximum disk accessing concurrency can be achieved for range queries.Our analysis and experiments show that the method achieves the optimum or near-optimum parallelism for range queries.The paper offers the conditions under which the method is optimal .The worst case bounds of the performance of the method are also given.In addition,the parallel algorithm of processing range queries in described at the end of the paper.The method has been used in the statistic and scientific database management system whic is being designed by us.     

Robust output regulation for nonlinear systems with nonpolynomial nonlinearity under nonlinear exosystems

This paper studies a robust output regulation problem with nonlinear exosystems without the assumption that the solution to the regulator equations along the trajectory of the exosystems should be polynomial. Based on the extended concepts of steady-state generator and internal model, a set of sufficient conditions for the solvability of the problem are given. Thus, the result developed in this paper can allow the robust output regulation problem with nonlinear exosystems to accommodate much more general nonlinear given plants including those which contain nonpolynomial nonlinearity.     

An Optimal Model and Algorithm of Distributed Information System

Distributed information system makes itself be placed in changing file storage position according to the users＇ request pattern. In this paper, we rebuild the model for a management system to turn the process of file managing into a 0-1 programming problem, and present a new individual form to improve the operating efficiency. Aiming at the model, we define a neighborhood span to make segmentation for searching space by using the fitness, based on the region contraction algorithm, present a new evolution algorithm which has the capability of self-adaptively generating new individuals, and ultimately solve the management problem of the distributed file system.     

COMPLEXITY REDUCTION FOR OPTIMIZATION OF DETERMINISTIC TIMED PETRI-NET SCHEDULING BY TRUNCATION

Methods of applying Petri nets to model and analyze scheduling problems, with constraints such as precedence relationships and multiple resource allocation, have been available in the literature. Searching for an optimum schedule can be implemented by combining the branch-and-bound technique with the execution of the timed Petri net. The resulting complexity problem in a large Petri net is handled by a truncation technique such that the original large Petri net is divided into several smaller subnets. The complexity involved in the analysis of each subnet individually is greatly reduced. However, as illustrated in this paper, the schedules for the subnets obtained by treating them separately may not lead to an optimal overall schedule for the original Petri net. To circumvent this problem, algorithms are developed that can be used to search for a proper schedule for each subnet such that the combination of these schedules yields an overall optimum schedule for the original timed Petri net. These algorithms are based on the idea of Petri net execution and branch-and-bound with modification. Finally, the practical application of the timed Petri net truncation technique to scheduling problems in manufacturing systems is illustrated by an example of multirobot task scheduling.     

工程项目工作流的Petri网表示及模型建立

根据工程项目产品实现过程与工作流组成的相似性,将工程项目的微观工作任务分解为基于工作流管理范畴的一个有机活动的操作序列。引入赋时Petri网和着色Petri网分别对项目活动的工期、项目所需的资源等属性进行描述,建立基于赋时着色Petri网的工程项目工作流模型,并分析资源配置规则和资源调用过程,为项目多活动、多任务间的协同管理打下基础。     

一种用于柔性制造系统仿真的图形Petri网软件工具

本文致力于图形Ｐｅｔｒｉ网软件工具—ＧＰＮＳＴ软件包的设计与实现。首先介绍了ＧＰＮＳＴ的结构和功能，分析了它在Ｐｅｔｒｉ网图形编辑和网结构分析方面的能力；其次正式定义了Ｐｅｔｒｉ网的扩展—赋时着色Ｐｅｔｒｉ网（ＴＣＰＮ），并且使用ＴＣＰＮ建立了柔性制造系统（ＦＭＳ）的简化仿真模型。利用这个模型，能基本实现ＦＭＳ的动态仿真，同时显示整个仿真的过程；最后将调度算法、启发式规则、ＴＣＰＮ模型和仿真结合起来，构成一个基于专家系统的调度器，产生出虽非最优，但是具有比较好结果的可行调度，有效地解决了动态仿真中的ＦＭＳ调度问题。     

一类FMS的最佳活Petri网模型的综合

利用Petri网为一类柔性制造系统建模,并讨论避免系统死锁问题.通过Petri网模 型的结构分析,证明了系统产生死锁的一个充分必要条件.给出了避免死锁的最佳控制器,它 可以通过给系统的Petri网模型增加一些新的位置与相应的弧来实现.从而导出了这类制造 系统的最佳活Petri网模型.     

离散制造装配系统的活性控制

首次研究离散制造装配系统的活性控制问题.建立了系统的工件加工过程Petri网 模型.通过对系统Petri网模型的结构分析,提出了导致系统死锁的两类元素结构及活性特 征.对一类离散制造装配系统提出了避免死锁的Petri网控制器,这类控制器容易实现,对系 统的限制小,而且使得受控系统仍具Petri网模型.对一般离散制造装配系统提出了保证系统 活性的控制策略.     

一种基于时间Petri网的工作流模型

面向任务流和资源流并行的业务过程,讨论了一类如何通过资源流控制任务流的工作流建模问题.在时间Petri网的基础上提出了一种称作资源/任务网(R/T-net)的工作流概念模型,并给出了基于R/T-net的工作流建模过程.设置在任务模型中的资源依赖和资源期望可以有效地实现资源流对任务流的控制,而其中的资源点火规则和资源路由规则可以灵活地实现资源的协调、同步、分配和传递,因此,比仅用时间属性刻画任务转移的时间Petri网模型更符合诸如办公、制造、物流运输等业务过程.     

基于赋时有色petri网的维修过程模型

维修过程模型是研究维修保障系统结构与运行的基础。petri网模型具有直观、形象的优点，又是严格定义的数学对象，既可用于静态的结构分析，又可用于动态的行为分析，具有灵活的建模和强大的系统性能分析能力，是描述维修过程的有力工具。该文介绍了petri网方法的有关概念、特性。假定了典型的维修资源配置环境，对维修资源进行了分类。描述了典型的维修过程，应用赋时着色Petri网建立了维修过程的petri网模型。文章最后讨论了模型的应用。     

基于Petri网的启发式生产调度

提出一种新的柔性制造系统调度方法.该方法可以通过引入测试弧增强普通Petri网 的建模能力,可以对系统中的设备维护、设备优先级以及操作优先级进行建模,并进一步利用搜 索算法对模型的状态转换空间进行启发式搜索得到优化调度.文中的实例展示了算法的有 效性.     

点发序列问题的控制策略

在离散事件系统的Petri网模型下,讨论是否存在控制策略使得仅有希望的序列使 能,而又保持事件的并发性的问题.证明了存在这种策略的必要充分条件是给定的目标序 列集是可控的.在目标序列集不可控而所考虑的序列集都是Petri网点发序列集时,提出了 综合给定序列集的极大可控子序列集生成器的方法.     

A control synthesis approach for time discrete event systems

In this paper, we introduce a control synthesis method for discrete event systems whose behavior is dependent on explicit values of time. Our goal is to control the occurrence dates of the controllable events so that the functioning of the system respects given specifications. The system to be controlled is modeled by a time Petri net. In a previous work we proposed a systematic method to build the timed automaton which models the exact behavior of a time Petri net. Furthermore, the forbidden behaviors of the system are modeled by forbidden timed automaton locations. This paper focuses on the control synthesis method, which consists in computing new firing conditions for the timed automaton transitions so that the forbidden locations are no longer reachable.