一种嵌入式GUI软件结构实现方案

综合比较了嵌入式GUI的几种实现方式,结合嵌入式系统的特点,研究了嵌入式GUI中的关键技术,分析了嵌入式GUI与普通GUI系统的不同之处,提出一种通用的嵌入式图形用户界面系统的设计思想和体系结构,这种嵌入式GUI实现方案具有轻型、占用资源少、可剪裁等特点。     

The struggle of autonomy and authenticity: framing the savage refugee

James Hathaway has described refugee law as ‘fundamentally oriented to the promotion of autonomy’. Borrowed from the Kantian roots of liberal rights theory, this theme has come to the fore as refugee advocates decry increasingly draconian experiments in deflection and deterrence. But what exactly does it mean for a refugee to exercise autonomy? And how is it connected to that other popular refrain – that those who arrive irregularly by boat in Australia, despite high recognition rates, are not ‘genuine’ refugees? By examining the assumptions underpinning autonomy as a contemporary political value, and working within the theoretical construct that identifies a state's ‘recognition’ of autonomy with authenticity, this article explores tensions within both public discourse on refugees and the discipline of refugee law itself. It considers how and why the refugee exercising ‘authentic’ moral agency by boarding a boat is depicted not just as a threat, but as inherently irrational (and thus not ‘authentically’ autonomous) and less ‘genuine’ (and thus virtuous) than the ‘passive’ refugee languishing in a camp overseas, awaiting ‘our’ redemptive touch. Finally, it asks whether refugee law similarly suffers from the contradictory moral promise of human rights law which places autonomy at its heart while in practice requiring that humanity be split between victim, savage and redeemer.     

A two phases queueing system with Bernoulli vacation schedule under multiple vacation policy

This paper deals with a single server Poisson arrival queue with two phases of heterogeneous service along with a Bernoulli schedule vacation model, where after two successive phases service the server either goes for a vacation with probability p (0≤p≤1) or may continue to serve the next unit, if any, with probability q(=1−p). Further the concept of multiple vacation policy is also introduced here. We obtained the queue size distributions at a departure epoch and at a random epoch, Laplace Stieltjes Transform of the waiting time distribution and busy period distribution along with some mean performance measures. Finally we discuss some statistical inference related issues.     

First-exit times for compound poisson processes for some types of positive and negative jumps

We consider the one-sided and the two-sided first-exit problem for a compound Poisson process with linear deterministic decrease between positive and negative jumps. This process (X(t)) _t≥0 occurs as the workload process of a single-server queueing system with random workload removal, which we denote by M/G _u /G _d /1, where G _u (G _d ) stands for the distribution of the upward (downward) jumps; other applications are to cash management, dams, and several related fields. Under various conditions on G _u and G _d (assuming e.g. that one of them is hyperexponential, Erlang or Coxian), we derive the joint distribution of τ _y =inf{t≥0|X(t)?(0,y)}, y>0, and X(τ _y ) as well as that of T=inf{t≥0|X(t)≤0} and X(T). We also determine the distribution of sup{X(t)|0≤t≤T}.     

基于排队论的业务流程重组绩效分析方法

竞争的激烈化和顾客需求的多样化迫使企业从根本上重新思考企业过程重组。企业过程重组(BPR)的原则之一是横向集成活动。但是横向集成活动究竟有没有提高企业的绩效,这是个值得研究的问题。本文运用排队论的数学模型,研究活动合并对企业流程绩效之一——成本的影响,详细地讨论了活动的成本要素,比较了重组前后成本的变化。     

Approximating M/G/1 Waiting Time Tail Probabilities

Abstract

We propose a new approximation formula for the waiting time tail probability of the M/G/1 queue with FIFO discipline and unlimited waiting space. The aim is to address the difficulty of obtaining good estimates when the tail probability has non-exponential asymptotics. We show that the waiting time tail probability can be expressed in terms of the waiting time tail probability of a notional M/G/1 queue with truncated service time distribution plus the tail probability of an extreme order statistic. The Cramér–Lundberg approximation is applied to approximate the tail probability of the notional queue. In essence, our technique extends the applicability of the Cramér–Lundberg approximation to cases where the standard Lundberg condition does not hold. We propose a simple moment-based technique for estimating the parameters of the approximation; numerical results demonstrate that our approximation can yield very good estimates over the whole range of the argument.     

Non-linear models 1

This is the first application of a new method for testing stationary random point processes. Consider the class of all stationary ergodic point processes on the real line with arbitrary dependences among the inter–point distances (spacing).The hypothesis is :The observed process φ is a homogeneous Poisson process or more (resp.less) regular than a Poisson process.The sample is the vector of the first n points t₁, …,t_n.There is a close relation between our method for testing and queueing theory: For finding an appropriate test statistic, we observe the behaviour of a single server queue with the input φ.A table of critical values is given.     

A Retrial Queue with a Constant Retrial Rate,Server Downs and Impatient Customers

ABSTRACT

In this paper, we consider a retrial queueing system consisting of a waiting line of infinite capacity in front of a single server subject to breakdowns. A customer upon arrival may join the queue (waiting line) or go to the retrial orbit (another queue) to retry for service after a random time. Only the customer at the head of the retrial orbit is allowed to retry for service. Upon retrial, the customer enters the service if the server is idle; otherwise, it may go back to the retrial orbit or leave the system (become impatient). All the interarrival times, service times, server up times, server down times and retrial times are exponential, and all the necessary independence conditions in these variables are assumed. For this system, we provide sufficient conditions under which, for any given number of customers in the orbit, the stationary probability of the number of customers in the waiting line decays geometrically. We also provide explicitly an expression for the decay parameter.     

电子商务系统的足够容量问题分析

运用性能定律和队列理论,对电子商务系统的足够容量问题进行了分析,给出一般的分析和评价方法.以此为基础,构建了一个新系统,计算了该系统的最大流量、最多在线人数和最长的响应时间,取得一定的实际效果.     

Modelling the effects of repellent chemicals on foraging bees

Summary.  Many pesticide sprays that are used for crop protection are harmful to honey-bees. It can therefore be beneficial to add to the spray chemical compounds that are repellent to bees, to discourage them from feeding on recently sprayed crops. Experiments were conducted using an artificial feeding station to assess the repellent effects of various compounds. In this system, bees arrive at the feeding station, choose between feeding dishes to which different chemicals have been added, feed for a variable period and then depart. The number of bees at each feeding dish is recorded at intervals of 1 min. We discuss the analysis of data from this type of experiment, based on a queuing theory model.