Passive infrared detector used for detection of very slowly moving of crawling people

The paper presents construction and principle of operation of passive IR detectors (PIR detectors) of a large detection range. Important virtue of these detectors is highly efficient detection of slowly moving or crawling people. The described here PIR detector detects crawling people at the distance of 140 m. To ensure high probability of detection of slowly moving objects, new method of signals analysis was applied. On the basis of the carried out real-time measurements, both probability of detection and false alarms were determined.     

A Communication Multiplexer Problem: Two Alternating Queues with Dependent Randomly-Timed Gated Regime

Two random traffic streams are competing for the service time of a single server (multiplexer). The streams form two queues, primary (queue 1) and secondary (queue 0). The primary queue is served exhaustively, after which the server switches over to queue 0. The duration of time the server resides in the secondary queue is determined by the dynamic evolution in queue 1. If there is an arrival to queue 1 while the server is still working in queue 0, the latter is immediately gated, and the server completes service there only to the gated jobs, upon which it switches back to the primary queue. We formulate this system as a two-queue polling model with a single alternating server and with randomly-timed gated (RTG) service discipline in queue 0, where the timer there depends on the arrival stream to the primary queue. We derive Laplace–Stieltjes transforms and generating functions for various key variables and calculate numerous performance measures such as mean queue sizes at polling instants and at an arbitrary moment, mean busy period duration and mean cycle time length, expected number of messages transmitted during a busy period and mean waiting times. Finally, we present graphs of numerical results comparing the mean waiting times in the two queues as functions of the relative loads, showing the effect of the RTG regime.     

A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem

In this paper, we present the design of a Polynomial Time Approximation Scheme (PTAS) for the Grade of Service Steiner Minimum Tree (GOSST) problem, which is known to be NP-Complete. Previous research has focused on geometric analyses and different approximation algorithms have been designed. We propose a PTAS that provides a polynomial time, near-optimal solution with performance ratio 1+. The GOSST problem has some important applications. In network design, a fundamental issue for the physical construction of a network structure is the interconnection of many communication sites with the best choice of the connecting lines and the best allocation of the transmission capacities over these lines. Good solutions should provide paths with enough communication capacities between any two sites, with the least network construction costs. Also, the GOSST problem has applications in transportation, for road constructions and some potential uses in CAD in terms of interconnecting the elements on a plane to provide enough flux between any two elements.     

Analysis of an SPP/G/1 system with multiple vacations and E-limited service discipline

Many researchers have studied variants of queueing systems with vacations. Most of them have dealt with M/G/1 systems and have explicitly analyzed some of their performance measures, such as queue length, waiting time, and so on. Recently, studies on queueing systems whose arrival processes are not Poissonian have appeared. We consider a single server queueing system with multiple vacations and E-limited service discipline, where messages arrive to the system according to a switched Poisson process. First, we consider the joint probability density functions of the queue length and the elapsed service time or the elapsed vacation time. We derive the equations for these pdf's, which include a finite number of unknown values. Using Rouché's theorem, we determine the values from boundary conditions. Finally, we derive the transform of the stationary queue length distribution explicitly.     

Enhanced Optical Image Verification Based on Joint Transform Correlator Adopting Fourier Hologram

In this paper two new architectures for optical image verification are proposed. Both architectures are based on conventional joint transform correlators (JTCs) adopting a Fourier hologram and can significantly improve the recovered image quality. First, an input phase-only function is Fourier transformed and then interferes with a reference wave that is diffracted from a plane wave incident on another random phase mask. Second, two phase-only functions are placed at the two input sides of a beamsplitter such that the interference pattern of their Fourier transforms can be detected. To obtain a predefined target image in the output plane, one of the input phase functions is iteratively retrieved by the use of the projection onto constraint sets algorithm. Simulation results show that the less mean squared error and better image quality are obtained for both the binary and grayscale images.     

劳动和社会保障办公系统的开发与应用

采用Lotus Domino/Notes文档数据库 Oracle关系数据库的独特结构模式,集成了Microsoft Office Outlook系统软件,主要功能通过浏览器/服务器(B/S)方式实现,系统设计采用了组件化、模块化的思想,为工作流程的定制和公文流转过程的控制提供了强大功能.     

Shift-tolerance Property of Optical Security System using Phase-based Virtual Image

The shift-tolerance property of the encrypted image or the Fourier decrypting key in the Fourier space is proposed based on a phase-encoded virtual image. The encrypted data is obtained by the Fourier transform of the product of a phase-encoded virtual image to camouflage the original one and a random phase image. Therefore, even if unauthorized users analyze the encrypted image, they cannot reconstruct the required image. This virtual image protects the original one from being counterfeited and from unauthorized access. We demonstrate the robustness to data loss and shift of the encrypted data or the Fourier decrypting key in the proposed decryption technique using an interferometer.     

An optimal service rate in a Poisson arrival queue with two-stage service policy*

We consider a two-stage service policy for a Poisson arrival queueing system. The idle server starts to work with ordinary service rate when a customer arrives. If the number of customers in the system reaches N, the service rate gets faster and continues until the system becomes empty. Otherwise, the server finishes the busy period with ordinary service rate. After assigning various operating costs to the system, we show that there exists a unique fast service rate minimizing the long-run average cost per unit time.This work was supported by Korea Research Foundation Grant(KRF-2002-070-C00021).     

Sojourn times in a processor sharing queue with service interruptions

We study the sojourn times of customers in an M/M/1 queue with the processor sharing service discipline and a server that is subject to breakdowns. The lengths of the breakdowns have a general distribution, whereas the on-periods are exponentially distributed. A branching process approach leads to a decomposition of the sojourn time, in which the components are independent of each other and can be investigated separately. We derive the Laplace–Stieltjes transform of the sojourn-time distribution in steady state, and show that the expected sojourn time is not proportional to the service requirement. In the heavy-traffic limit, the sojourn time conditioned on the service requirement and scaled by the traffic load is shown to be exponentially distributed. The results can be used for the performance analysis of elastic traffic in communication networks, in particular, the ABR service class in ATM networks, and best-effort services in IP networks.     

Applications of SMP Bounds to Multi-class Traffic in High-speed Networks

In this paper, we consider the stochastic fluid-flow model of a single node in a high-speed telecommunication network handling multi-class traffic. The node has multiple buffers, one for each class of traffic. The contents of these buffers are multiplexed onto a single output channel using one of the service scheduling policies: the Timed Round Robin Policy or the Static Priority Service Policy. The Quality of Service requirements for each class are based on cell loss probabilities. Using effective bandwidth methodologies and the recently developed bounds for semi-Markov modulated traffic, we solve call admission control problems for the two service scheduling policies at this node. We compare the performance of the effective bandwidth methodologies and the SMP bounds technique. We also numerically compare the performance of the two service scheduling policies.