Optimal (N,T)-policy for M/G/1 system with cost structures

In this paper, the optimal (N,T)-policy for M/G/1 system with cost structure is studied. The system operates only intermittently. It is shut down when no customers are present. A fixed set-up cost of K>0 is incurred each time the system is reopened. Also, a holding cost of h>0 per unit time is incurred for each customer present. The (N,T)-policy studied for this system is as follows: the system reactivates as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T (see A.S. Alfa, I. Frigui, Eur. J. Oper. Res. 88 (1996) 599-613; Y.N. Doganata, in: E. Arikan (Ed.), Communication, Control, and Signal Processing, 1990, pp. 1663–1669). Later on, as a comparison, the start of the timer count is relaxed as follows: the system reactivates as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. For both cases, the explicit optimal policy (N^*,T^*) for minimizing the long-run average cost per unit time are obtained. As extreme cases, we include the simple optimal policies for N-and T-polices. Several counter-intuitive results are obtained about the optimal T-policies for both types of models.     

AESS: Accelerated Exact Stochastic Simulation

The Stochastic Simulation Algorithm (SSA) developed by Gillespie provides a powerful mechanism for exploring the behavior of chemical systems with small species populations or with important noise contributions. Gene circuit simulations for systems biology commonly employ the SSA method, as do ecological applications. This algorithm tends to be computationally expensive, so researchers seek an efficient implementation of SSA. In this program package, the Accelerated Exact Stochastic Simulation Algorithm (AESS) contains optimized implementations of Gillespie?s SSA that improve the performance of individual simulation runs or ensembles of simulations used for sweeping parameters or to provide statistically significant results.

Program summary

Program title: AESSCatalogue identifier: AEJW_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEJW_v1_0.htmlProgram obtainable from: CPC Program Library, Queen?s University, Belfast, N. IrelandLicensing provisions: University of Tennessee copyright agreementNo. of lines in distributed program, including test data, etc.: 10 861No. of bytes in distributed program, including test data, etc.: 394 631Distribution format: tar.gzProgramming language: C for processors, CUDA for NVIDIA GPUsComputer: Developed and tested on various x86 computers and NVIDIA C1060 Tesla and GTX 480 Fermi GPUs. The system targets x86 workstations, optionally with multicore processors or NVIDIA GPUs as accelerators.Operating system: Tested under Ubuntu Linux OS and CentOS 5.5 Linux OSClassification: 3, 16.12Nature of problem: Simulation of chemical systems, particularly with low species populations, can be accurately performed using Gillespie?s method of stochastic simulation. Numerous variations on the original stochastic simulation algorithm have been developed, including approaches that produce results with statistics that exactly match the chemical master equation (CME) as well as other approaches that approximate the CME.Solution method: The Accelerated Exact Stochastic Simulation (AESS) tool provides implementations of a wide variety of popular variations on the Gillespie method. Users can select the specific algorithm considered most appropriate. Comparisons between the methods and with other available implementations indicate that AESS provides the fastest known implementation of Gillespie?s method for a variety of test models. Users may wish to execute ensembles of simulations to sweep parameters or to obtain better statistical results, so AESS supports acceleration of ensembles of simulation using parallel processing with MPI, SSE vector units on x86 processors, and/or using NVIDIA GPUs with CUDA.     

Pharmacophore and docking-based combined in-silico study of KDR inhibitors

The growth and metastasis of solid tumors is dependent on angiogenesis. The vascular endothelial growth factor (VEGF) and its cell surface receptor in human KDR (kinase domain containing receptor or VEGFR-2) have particular interest because of their importance in angiogenesis. The development of novel inhibitors of VEGFR-2 would be helpful to check the growth of tumors. Quantitative structure activity relationship (QSAR) analyses used to understand the structural factors affecting inhibitory potency of thiazole-substituted pyrazolone derivatives. Several pharmacophore-based models indicated the importance of steric, hydrophobic and hydrogen bond acceptor groups to inhibitory activity. The comparative molecular field analyses (CoMFA) and comparative molecular similarity indices analyses (CoMSIA) based 3D-QSAR models were derived using pharmacophore-based alignment. Both CoMFA (q² = 0.70, r² = 0.97 and ) and CoMSIA (q² = 0.54, r² = 0.82 and ) gave reasonable results. The molecular docking (receptor-guided technique) with a recently reported receptor structure (PDB = 1YWN) were performed. The docked alignment was subsequently used for 3D-QSAR (CoMFA; q² = 0.56, r² = 0.97, , CoMSIA; q² = 0.58 r² = 0.91, ). The overall both studies were indicated, steric, electrostatic and hydrogen bond acceptor effects contribute to the inhibitory activity. CoMFA and CoMSIA models suggested that a positive bulk with hydrophobic effect is desirable around position 4 and 5 and hydrogen bond acceptor groups around pyrazolones ring will be helpful.     

NP对PP

主要目的是研究NP与PP的关系。引入了一个NP的等价的随机定义。基于此等价定义,定义了另一个随机复杂性类：SUPER－NP。虽然SUPER－NP与NP非常接近,但令人吃惊的是发现了PP包含于SUPER－NP,从而NP包含于PP包含于SUPER－NP。考虑到NP＝PCP（log,O(1))以及NP和SUPER－NP的相似性,也希望能通过证明SUPER－NP包含于PCP（log^2,O(1))来解决PP包含于PCP（log^2,O(1))的猜想。     

Symbolic analysis via semantic reinterpretation

The paper presents a novel technique to create implementations of the basic primitives used in symbolic program analysis: forward symbolic evaluation, weakest liberal precondition, and symbolic composition. We used the technique to create a system in which, for the cost of writing just one specification—an interpreter for the programming language of interest—one obtains automatically generated, mutually-consistent implementations of all three symbolic-analysis primitives. This can be carried out even for languages with pointers and address arithmetic. Our implementation has been used to generate symbolic-analysis primitives for the x86 and PowerPC instruction sets.     

Proving Approximate Implementations for Probabilistic I/O Automata

In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task structure on the locally controlled actions and a task scheduler to resolve nondeterminism. The interaction between a scheduler and an automaton gives rise to a trace distribution—a probability distribution over the set of traces. We define a PIOA to be a (discounted) approximate implementation of another PIOA if the set of trace distributions produced by the first is close to that of the latter, where closeness is measured by the (resp. discounted) uniform metric over trace distributions. We propose simulation functions for proving approximate implementations corresponding to each of the above types of approximate implementation relations. Since our notion of similarity of traces is based on a metric on trace distributions, we do not require the state spaces nor the space of external actions of the automata to be metric spaces. We discuss applications of approximate implementations to verification of probabilistic safety and termination.     

On exact computational analysis of distributions of numbers in systems for M/G/1/N + 1 and GI/M/1/N + 1 queues using roots

In this paper, we obtain the distribution of number in system and other measures of efficiency for the M/G/1/N + 1 queuing system in terms of the roots of the associated characteristic equation (CE). Results for the GI/M/1/N + 1 queuing system have also been obtained from those of M/G/1/N + 1. Numerical results in the form of tables and graphs have been presented for a variety of service-(interarrival-) time distributions, e.g. Erlang (E_k), generalized Erlang (GE_k) and hyperexponential (HE_k).     

Using local-spin k-exclusion algorithms to improve wait-free object implementations

Summary.  We present the first shared-memory algorithms for k-exclusion in which all process blocking is achieved through the use of “local-spin” busy waiting. Such algorithms are designed to reduce interconnect traffic, which is important for good performance. Our k-exclusion algorithms are starvation-free, and are designed to be fast in the absence of contention, and to exhibit scalable performance as contention rises. In contrast, all previous starvation-free k-exclusion algorithms require unrealistic operations or generate excessive interconnect traffic under contention. We also show that efficient, starvation-free k-exclusion algorithms can be used to reduce the time and space overhead associated with existing wait-free shared object implementations, while still providing some resilience to delays and failures. The resulting “hybrid” object implementations combine the advantages of local-spin spin locks, which perform well in the absence of process delays (caused, for example, by preemptions), and wait-free algorithms, which effectively tolerate such delays. We present performance results that confirm that this k-exclusion-based technique can improve the performance of existing wait-free shared object implementations. These results also show that lock-based implementations can be susceptible to severe performance degradation under multiprogramming, while our hybrid implementations are not. Received: December 1995 / Accepted: February 1997     

A Mathematica Version of Zeilberger's Algorithm for Proving Binomial Coefficient Identities

Based on Gosper's algorithm for indefinite hypergeometric summation, Zeilberger's algorithm for proving binomial coefficient identities constitutes a recent breakthrough in symbolic computation. Mathematica implementations of these algorithms are described. Nontrivial examples are given in order to illustrate the usage of these packages which are available by e-mail request to the first-named author.     

An Extension of System F with Subtyping

System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F_<: (pronounced ef-sub), that combines parametric polymorphism with subtyping. The main focus of the paper is the equational theory of F_<:, which is related to PER models and the notion of parametricity. We study some categorical properties of the theory when restricted to closed terms, including interesting categorical isomorphisms. We also investigate proof-theoretical properties, such as the conservativity of typing judgments with respect to F. We demonstrate by a set of examples how a range of constructs may be encoded in F_<:. These include record operations and subtyping hierarchies that are related to features of object-oriented languages.     

Necessary and sufficient conditions on Q ( = C( I + PC)) for stabilization of the linear feedback system S(P, C)

We find the following necessary and sufficient conditions for Q (:=C(I+PC)⁻¹) to -stabilize the standard linear time-invariant unity feedback system S(P, C) where P has the l.c.f. (D_pl, N_pl) and the r.c.f. (N_pr, D_pr); and is a principal ideal domain. (i) Q must have elements in (ii) (resp. (iii)) Q must factorize in with D_pr, (resp. D_pl) as a left (resp. right) factor and (iv) (I – QP) must factor in with D_pr, as a left factor.     

Nearest-neighbor algorithms for load-balancing in parallel computers

With nearest-neighbor load-balancing algorithms, a processor makes balancing decisions based on localized workload information and manages workload migrations within its neighborhood. The paper compares a couple of fairly well-known nearest-neighbor algorithms, the dimension-exchange (DE) and the diffusion (DF) methods and their several variants—the average dimension-exchange (ADE), optimally tuned dimension-exchange (ODE), local average diffusion (ADF) and optimally tuned diffusion (ODF). The measures of interest are their efficiency in driving any initial workload distribution to a uniform distribution and their ability in controlling the growth of the variance among the processors' workloads. The comparison is made with respect to both one-port and all-port communication architectures and in consideration of various implementation strategies including synchronous/asynchronous invocation policies and static/dynamic random workload behaviors. It turns out that the dimension-exchange method outperforms the diffusion method in the one-port communication model. In particular, the ODE algorithm is best suited for statically synchronous implementations of a load-balancing process regardless of its underlying communication models. The strength of the diffusion method is in asynchronous implementations in the all-port communication model; the ODF algorithm performs best in that case. The underlying communication networks considered assume the most popular topologies, the mesh and the torus and their special cases: the hypercube and the k-ary n-cube.     

FEWZ 2.0: A code for hadronic Z production at next-to-next-to-leading order

We introduce an improved version of the simulation code FEWZ (Fully Exclusive W and Z Production) for hadron collider production of lepton pairs through the Drell–Yan process at next-to-next-to-leading order (NNLO) in the strong coupling constant. The program is fully differential in the phase space of leptons and additional hadronic radiation. The new version offers users significantly more options for customization. FEWZ now bins multiple, user-selectable histograms during a single run, and produces parton distribution function (PDF) errors automatically. It also features a significantly improved integration routine, and can take advantage of multiple processor cores locally or on the Condor distributed computing system. We illustrate the new features of FEWZ by presenting numerous phenomenological results for LHC physics. We compare NNLO QCD with initial ATLAS and CMS results, and discuss in detail the effects of detector acceptance on the measurement of angular quantities associated with Z-boson production. We address the issue of technical precision in the presence of severe phase-space cuts.

Program summary

Program title: FEWZCatalogue identifier: AEJP_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEJP_v1_0.htmlProgram obtainable from: CPC Program Library, Queen?s University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 6 280 771No. of bytes in distributed program, including test data, etc.: 173 027 645Distribution format: tar.gzProgramming language: Fortran 77, C++, PythonComputer: Mac, PCOperating system: Mac OSX, Unix/LinuxHas the code been vectorized or parallelized?: Yes. User-selectable, 1 to 219RAM: 200 Mbytes for common parton distribution functionsClassification: 11.1External routines: CUBA numerical integration library, numerous parton distribution sets (see text); these are provided with the code.Nature of problem: Determination of the Drell–Yan Z/photon production cross section and decay into leptons, with kinematic distributions of leptons and jets including full spin correlations, at next-to-next-to-leading order in the strong coupling constant.Solution method: Virtual loop integrals are decomposed into master integrals using automated techniques. Singularities are extracted from real radiation terms via sector decomposition, which separates singularities and maps onto suitable phase space variables. Result is convoluted with parton distribution functions. Each piece is numerically integrated over phase space, which allows arbitrary cuts on the observed particles. Each sample point may be binned during numerical integration, providing histograms, and reweighted by parton distribution function error eigenvectors, which provides PDF errors.Restrictions: Output does not correspond to unweighted events, and cannot be interfaced with a shower Monte Carlo.Additional comments: !!!!! The distribution file for this program is over 170 Mbytes and therefore is not delivered directly when download or E-mail is requested. Instead a html file giving details of how the program can be obtained is sent.Running time: One day for total cross sections with 0.1% integration errors assuming typical cuts, up to 1 week for smooth kinematic distributions with sub-percent integration errors for each bin.     

存储区域网络的数据安全访问

本文讨论了存储区域网络的可能的安全威胁，剖析了安全威胁点的概念，提出了三层安全边界的SAN安全体系架构，并且着重分析了内部边界的LUN屏蔽和分区两种实现方式。     

Scaling analysis of a neocortex inspired cognitive model on the Cray XD1

This paper presents the implementation and scaling of a neocortex inspired cognitive model on a Cray XD1. Both software and reconfigurable logic based FPGA implementations of the model are examined. This model belongs to a new class of biologically inspired cognitive models. Large scale versions of these models have the potential for significantly stronger inference capabilities than current conventional computing systems. These models have large amounts of parallelism and simple computations, thus allowing highly efficient hardware implementations. As a result, hardware-acceleration of these models can produce significant speedups over fully software implementations. Parallel software and hardware-accelerated implementations of such a model are investigated for networks of varying complexity. A scaling analysis of these networks is presented and utilized to estimate the throughput of both hardware-accelerated and software implementations of larger networks that utilize the full resources of the Cray XD1. Our results indicate that hardware-acceleration can provide average throughput gains of 75 times over software-only implementations of the networks we examined on this system.

A reification calculus for model-oriented software specification

This paper presents a transformational approach to the derivation of implementations from model-oriented specifications of abstract data types.The purpose of this research is to reduce the number of formal proofs required in model refinement, which hinder software development. It is shown to be applicable to the transformation of models written in META-IV (the specification language of VDM) towards their refinement into, for example, Pascal or relational DBMSs. The approach includes the automatic synthesis of retrieve functions between models, and data-type invariants.The underlying algebraic semantics is the so-calledfinal semantics à la Wand: a specification is amodel (heterogeneous algebra) which is the final object (up to isomorphism) in the category of all its implementations.The transformational calculus approached in this paper follows from exploring the properties of finite, recursively defined sets.This work extends the well-known strategy of program transformation to model transformation, adding to previous work on a transformational style for operation-decomposition in META-IV. The model-calculus is also useful for improving model-oriented specifications.     

基于CWDM的FC-SAN I/O接口模块的设计

研究了SAN的光纤通道技术和低成本、高带宽的CWDM波分复用技术,在分析QLA2200光纤通道卡原理的基础上,设计了一个基于CWDM的FC-SANI/O接口模块,实现了应用CWDM技术对SAN的远程连接,对构建专有线路的基于CWDM的SAN容灾系统具有一定意义。     

H optimization problem with sign-indefinite quadratic form

This paper presents the solution to min-max control problem arising when the matrix C₁^TC₁ of the cost function in the standard H^∞ control problem (Doyle et al., 1989) is replaced by an arbitrary matrix Q 0. This difference is proved to be sufficient for results obtained in (Doyle et al., 1989) not to cover such the case. Their derivations essentially base on the cost function being H^∞ norm and can not be adjusted to deal with sign-indefinite quadratic form. With some sort of strict frequency condition assumed, state space technique is fruitful to obtain the necessary and sufficient conditions of the solvability of the problem. The solution is given by two Riccati equations and has some difference when compared to that of (Doyle et al., 1989).     

The <Emphasis Type="Italic">systems edge</Emphasis> of the Parameterized Linear Array with a Reconfigurable Pipelined Bus System (LARPBS(p)) optical bus parallel computing model

This paper is about exploring the various systems related aspects pertinent in the recent Parameterized Linear Array with a Reconfigurable Pipelined Bus System (LARPBS(p)) model. The two principal features of the LARPBS(p) model is, firstly, its bridging model definition similar to that of the BSP model leading to a more detailed algorithm cost analysis than other models, and secondly, the incorporation of several new communication primitives not defined in earlier models. This paper reviews the systems related aspects of earlier optical bus models and summarizes the LARPBS(p) model. The main part of this paper considers some practical systems related aspects of the LARPBS(p) model, specifically: fiber and free space based implementations, feasibility study, communication traffic analysis, bus collision avoidance, and the cost analysis of a MIMD algorithm. An overview perspective of the work is presented, thereby: the edge of systems related research is identified.