Linux2.6进程调度机制的剖析

阐述了Linux2.4内核进程调度系统存在的缺陷,详细分析了Linux2.6内核进程调度的时机,策略和O(1)算法的实现细节.与2.4相比,这些改进使得linux2.6进程调度系统实现了O(1)调度算法,支持抢占式调度,并增强了对实时任务和SMP的支持.     

反馈后优先非抢占的M/M/1排队系统的等待队长分析

考虑反馈后优先排队非抢占的M/M/1排队系统,固定每位顾客的反馈次数为1次,即每位顾客的服务要求数为2,利用相关文献中系统总服务要求数的分布,推出了系统中等待服务的服务要求数的分布.同时研究了等待服务要求数与等待队长的关系,得出了系统模型的等待队长的分布及平均等待队长.     

快乐钓鱼台

游戏规则:1.将小鱼平放在桌面上,通过"石头、剪刀、布"决定游戏的优先权。2.每位钓鱼者的垂钓时间为30秒,依次轮流。3.所有的小鱼都被钓起后,将各人钓起的鱼身上的分数累加,根据分数的多少决定胜负。     

Spiking neural P systems with anti-spikes and without annihilating priority as number acceptors

Spiking neural P systems with anti-spikes （ASN P systems） are variant forms of spiking neural P systems, which are inspired by inhibitory impulses/spikes or inhibitory synapses. The typical feature of ASN P systems is when a neuron contains both spikes and anti-spikes, spikes and anti-spikes wil immediately annihilate each other in a maximal way. In this paper, a restricted variant of ASN P systems, cal ed ASN P systems without anni-hilating priority, is considered, where the annihilating rule is used as the standard rule, i.e., it is not obligatory to use in the neuron associated with both spikes and anti-spikes. If the annihilating rule is used in a neuron, the annihilation wil consume one time unit. As a result, such systems using two categories of spiking rules （identified by （a, a） and （a,a^-）） can achieve Turing completeness as number accepting devices.     

DS-TE环境下LSP抢占算法

原有V-PREPT(Versatile Preemption)算法关心的是抢占总代价最小化, 灵活性较好但带宽利用率不高。为此, 在研究DS-TE环境下的抢占机制及现行的抢占算法基础上, 提出了BH-PREPT(Bandwidth Preemption)算法。该算法能在最小化抢占总代价的条件下提高带宽的利用率, 在保证被抢占的总带宽满足需求带宽的前提下, 通过采取枚举法找出抢占总代价最小的LSP(Label Switching Path)组合, 且优先选择被抢占LSP数目最少的组合实施抢占。通过Matlab的仿真结果表明, BH-PREPT算法在提高带宽利用率方面比V PREPT算法更具有优势。     

对未注册商标使用权法律保护的深层思考

通过论述未注册商标使用权的权利性质，指出未注册商标使用权是一项合法的民事权利。在分析未注册商标使用权不予以法律保护的种种理论和实践上的弊端后得出结论。未注册商标使用权应受到商标法的保护。     

Broadcast Scheduling Strategy Based on the Priority of Real.Time Data in a Mobile Environment

Data broadcast is an important data dissemination approach in mobile environment. On broadcast channel,scalability and efficiency of data transmission are satisfied. In a mobile environment, there exists a kind of real-time database application in which both the transactions and data can have their timing constraints and priorities of different levels.In order to meet the requirement of real-time data disseminaring and retrieving, a broadcast scheduling strategy HPF-ED F (Highest Priority First with Earlier Deadline and Frequency) is proposed under the BoD (Broadcast on Demand) model. Using the strategy, data items are scheduled according to their priority the transaction imposed on them or system set for them. The strategy also considers other characteristics of data items such as deadline and popularity of data. The extensive simulation experiments have been conducted to evaluate the performance of the proposed algorithm. Results show that it can achieve excellent performance compared with existing strategies.     

电子商务的战略装备

一方面,我们说电子商务必定会成为未来的投资热点,但是另一方面我们也要清醒地看到,网站的爆炸式增长和网站的无效益落地已经形成了巨大的反差。一场网络企业的淘汰赛已经开始。所以,研究电     

服务台可修的成批到达PR排队系统分析

研究了服务台可修的具有强占－继续型优先服务规则的多类顾客成批到达排队系统，用补充变量法得到了该系统主要的排队论指标和服务台的可靠性指标。