On the (Im-)Possibility of Extending Coin Toss

We consider the task of extending a given coin toss. By this, we mean the two-party task of using a single instance of a given coin toss protocol in order to interactively generate more random coins. A bit more formally, our goal is to generate n common random coins from a single use of an ideal functionality that gives \(m<n\) common random coins to both parties. In the framework of universal composability, we show the impossibility of securely extending a coin toss for statistical and perfect security. On the other hand, for computational security, the existence of a protocol for coin toss extension depends on the number m of random coins that can be obtained “for free.” For the case of stand-alone security, i.e., a simulation-based security definition without an environment, we present a protocol for statistically secure coin toss extension. Our protocol works for superlogarithmic m, which is optimal as we show the impossibility of statistically secure coin toss extension for smaller m. Combining our results with already known results, we obtain a (nearly) complete characterization under which circumstances coin toss extension is possible.     

An Optimally Controlled Respirator

An optimally controlled respirator was developed. It has three main features: 1) ventilation is controlled by the patient's metabolic rate from continuously measured C02 output, 2) physiologic dead space approximated as a linear function of tidal volume is used to estimate alveolar ventilation, and 3) respiratory rate is computed to minimize ventilatory work.     

An Optimally Energized Cardiac Pacemaker

Batteries that power implanted cardiac pacemakers deteriorate because of energy drain and permeation of body fluids. They must, therefore, be replaced periodically, most often by means of an operation. In this paper, the stimulating waveform that draws the least amount of energy from the battery and also delivers the minimum energy to a heart cell is derived. It is shown that a 31-percent reduction in energy (with respect to that required by the standard rectangular pulse) can be achieved if the pulse duration is about twice the cell time constant. Moreover, it is demonstrated that the required energy is insensitive to pulse-duration variations (due to component changes). An easily synthesized suboptimal approximation is developed and requires only slightly more energy than the optimal pulse.     

An Optimally Designed Process for Submicrometer MOSFET's

An n-channel MOS process has been optimized to yield desirable characteristics for submicrometer channel-length, MOSFET's. Process/device simulation is extensively used to find an optimized processing sequence compatible with typical production-line processes. The simulation results show an excellent agreement with experimental data. We have obtained long-channel subthreshold characteristics, saturation drain characteristics up to 5 V, and a minimized substrate bias sensitivity for transistors with channel lengths as small as 0.5 /spl mu/m. The short-channel effects have been also minimized. A new self-aligned silicidation technology has been developed to reduce the increased resistance of diffused layers with down-scaled junction depths.     

一种改进的链路容量优化路由策略

设计能够适应高移动环境下的空基自组网路由协议是目前研究的重点方向。提出了基于负载均衡的优化路由协议,该协议在获得位置信息的前提下,首先预测出通信链路的有效时间,然后在满足数据的时延、带宽以及链路有效性等多约束条件下,路由协议以均衡节点负载为优化目标,使得网络节点都能合理承担数据传输任务。仿真结果表明,设计的路由协议能够保证网络节点合理分担传输任务,充分利用链路资源,提高网络的吞吐量。     

一种基于最优组合模型的火箭弹跟踪算法

提出一种基于最优组合模型对火箭弹运行参数进行预测,利用它对跟踪的特征点下一位置进行预测。该模型的主要特点是避免了单一预测模型仅利用部分信息而带来的不足,详细推导了算法的数学模型。仿真结果证实了该模型较单一预测方法降低了预测误差、提高了预测精度,使得跟踪算法的精度得到很大提高。     

Optimally sensitive networks

The constraints on LC transfer-function coefficients are investigated for networks to be optimally sensitive according to Schoeffler's criterion considered by Leeds and Ugron.     

Sharing Memory Optimally

Efficient design of service facilities, such as data or computer networks that meet random demands, often leads to the sharing of resources among users. Contention for the use of a resource results in queueing. The waiting room is a part of any such service facility. The number of accepted service requests per unit of time (throughput), or the fraction of the time the servers are busy (utilization), are often used as performance measures to compare designs. Most common models in queueing theory consider the design of the waiting rooms with the assumption that, although individual requests may differ from one another, they are statistically indistinguishable. However, there are several instances where available information allows us to classify the requests for service into different types. In such cases the design of the service facility not only involves the determination of an optimum size for the waiting room but also the rules of sharing it among the different types. Even with a fixed set of resources, the rules of sharing them can influence performance. In data networks (or computer networks) the "waiting room" consists of memory of one kind or another. Messages (jobs) destined for different locations (processors) sharing common storage is an important example of shared use of memory. Recently, Kleinrock and Kamoun have modeled such use of memory and computed the performance of various policies for managing the allocation of memory to several types of users. Decisions to accept or reject a demand for service were based on the number of waiting requests of each type. However, the optimal policy was not determined even in the case where there were only two types of users. We determine the structure of optimal policies for the model considered with three types of users. The optimal policy consists of limiting the number of waiting requests of each type, and reserving a part of the memory to each type.     

一种改进的公平分享调度算法

调度算法是操作系统处理的核心任务之一.在仔细分析Linux调度算法以及公平分享调度算法FSS的基础上,针对Linux现有调度算法的不足,结合原有公平分享调度算法提出了一种改进的公平分享调度算法UTRS,并通过实验数据证明了算法在用户公平调度上的有效性.     

面向ABR业务的公平排队策略

在基于ＡＴＭ－ＴＣＰ技术实现ＡＢＲ中,一个信元的丢失会导致该信元所属分组破坏,致命该信元所属分组的网络中传输都变得无效,重传机制来确保传输正确性,分组多次重传浪费大量带宽,并进一步加剧网络拥塞状况。ＡＴＭ－ＴＣＰ只保证每个信元对网络访问的公平性,而忽略了ＴＣ究组的公平性。本文提出了一种与分组长度无关的公平排队策略,提出以抛弃信元的代价为权值,来决定要抛弃的信元。它不仅能保证分组的公平性,而且能使网     

Optimally isotropic Laplacian operator

Laplacian operators used in the literature for digital image processing are not rotationally invariant. We examine the anisotropy of 3x3 Laplacian operators for images quantized in square pixels, and find the operator which has the minimum overall anisotropy.     

Optimally adaptive transform coding

The optimal linear block transform for coding images is well known to be the Karhunen-Loeve transformation (KLT). However, the assumption of stationarity in the optimality condition is far from valid for images. Images are composed of regions whose local statistics may vary widely across an image. While the use of adaptation can result in improved performance, there has been little investigation into the optimality of the criterion upon which the adaptation is based. In this paper we propose a new transform coding method in which the adaptation is optimal. The system is modular, consisting of a number of modules corresponding to different classes of the input data. Each module consists of a linear transformation, whose bases are calculated during an initial training period. The appropriate class for a given input vector is determined by the subspace classifier. The performance of the resulting adaptive system is shown to be superior to that of the optimal nonadaptive linear transformation. This method can also be used as a segmentor. The segmentation it performs is independent of variations in illumination. In addition, the resulting class representations are analogous to the arrangement of the directionally sensitive columns in the visual cortex.     

可撤销匿名的公平盲代理签名方案的改进

论文利用公平电子现金的思想,在谷利则等人的盲代理签名方案的基础上提出了一个可撤销匿名、可回收代理签名权的代理签名方案。该方案既保证了原始签名人的利益,也保护了代理签名人的隐私。方案满足匿名代理签名特征：可验证性、强不可伪造性、可追踪性,并且计算量较小。同时,第三方易于揭开给定签名和撤销指定代理人的代理签名权。     

Optimally Interleaved Signals for SFN

This paper focuses on how designing transmit signals improves performance of single frequency networks (SFNs), employing multiple distributed transmit antennas. Considering the effect of multipath fading, pairwise error probability conditioned on shadowing is derived to show that the achievable diversity order of SFNs increases as the number of resolvable channel taps between transmit and receive antennas increases. One transmit signal based on interleaved-partition subcarrier grouping is proposed to obtain the achievable diversity order. Further, we show that different interleaving methods result in different performance due to asynchronous delays caused by unequal distances between distributed transmit antennas and mobile receivers. To optimize the proposed transmit signal, one interleaving scheme, establishing a tradeoff between mobile receivers' location and performance, is introduced in terms of the asynchronous delays. Simulation results are presented in a representative scenario to demonstrate the performance gains offered by the proposed optimum transmit signal. The proposed scheme does not introduce any changes at the mobile receivers.     

An Efficient Quantum Mechanism Based Fair Non-Repudiation Protocol

In this paper, an efficient quantum public key signature based fair non-repudiation message exchanging protocol is proposed. This protocol could guarantee fairness which means both the receiver and the sender could get the evidences of each other at the end of message transmission. Compared with the traditional nonrepudiation protocols, this protocol provides higher security because of the superiority of quantum cryptography as well as enhances the running time efficiency and reliability since it avoids the involvement of TTP （Trusted third party）.     

一种基于紧急程度的自时钟开始时间公平排队分组调度算法

为了克服目前GPS (Generalized Processor Sharing)类调度算法中实时应用分组的排队时延较大且不稳定的局限性,该文提出一种新的分组排队调度算法,该调度算法在计算分组服务标签时添加了一个紧急程度函数,调整了到达分组间的竞争关系,从而可以按照实时性应用的要求来调整到达分组的转发先优级,由此显著降低了实时性应用分组的排队时延和抖动幅度。分析和仿真实验表明,与GPS类其它调度算法相比,该调度算法对于实时应用的分组能提供较低的、更稳定的排队时延保证,同时还继承了GPS类算法的公平性和排队时延有界等特性,而且对系统虚拟时间的跟踪计算更为简捷高效。     

Optimally sensitive controller for digital systems

A scheme is developed which allows an optimal control policy to be maintained in cases where the parameters of the controlled system deviate by a small amount from the values expected. This is achieved by augmenting the nominally correct controller design to allow updating of the system control vector on the basis of observed deviations from the ideal state trajectory.     

Optimally aggregated models of high-order systems

A straightforward scheme for generating optimally aggregated models of high-order systems is presented. The simplicity of the scheme is a direct result of generalising the model forms under consideration. The interesting case of optimal projection along invariant subspaces is a special case. Finally, the notion of quasioptimal aggregated models is introduced, which reduces computation considerably.