Some negacyclic BCH codes and quantum codes

Quantum Information Processing - Any quantum communication task requires a common reference frame (i.e., phase, coordinate system). In particular, quantum key distribution requires different bases...     

Internet Banking: Client-Side Attacks and Protection Mechanisms

Although current mechanisms protect against offline credential-stealing attacks, effective protection against online channel-breaking attacks requires technologies to defeat man-in-the-middle (MITM) attacks, and practical protection against content-manipulation attacks requires transaction-authentication technologies.     

Database inferencing for decision support

The use of databases for management decision support requires flexible inferencing mechanisms. The use of logic programming for these purposes is explored. To be flexible, however, this requires the logical decomposition of the database into elementary predicates.     

Cyber-Resilience: Seven Steps for Institutional Survival

No enterprise will ever be 100% secure. There are just too many threats. This article presents seven practical steps to achieving cyber-resilience. Cyber resilience is not a traditional defensive stance. It requires a change in the way organizations approach security of its information and communication technology (ICT) asset base. Cyber resilience is integrated into the “bones” of the organization and requires the organization to develop a well-defined, explicit architecture of controls to ensure cyber resiliency. The controls assure provable protection of critical ICT assets and their various interdependencies from every form of electronic, human and physical threat; inside and outside the enterprise’s eco-system. Cyber-resilient architectures make attacks less likely to succeed, minimize the consequences when they do, increase the work-factor cost and uncertainty for the adversary, and possibly act as a deterrent against future attacks. Cyber resilience is enforced as an organizational condition rather than a deployed set of explicit countermeasures. This goal requires that a robust set of concrete controls are embedded in the enterprise architecture. Effective implementation of a cyber-resilient enterprise architecture requires strategic vision. It also requires day-to-day engagement across the enterprise to ensure that the controls that enable cyber resilience are effective.     

基于特征迹的软件演化研究

需求变化是导致软件演化的根本原因,而问题空间与解空之间存在的缺口是软件难以成功演化的根源。通过系统接口,把变化的需求与支持它的特征迹联系起来,定义了基于需求和特征迹的软件演化。根据需求的不同,把软件演化分为功能演化、非功能演化和环境演化,并对软件演化方法进行了讨论。根据特征迹的私有消息、局部消息和公有消息之间的关系,对演化影响进行了定量分析,得到了可演化软件的一些性质。基于特征迹的软件演化,有利于演化定位、演化管理和演化的验证.     

Practical formal verification in microprocessor design

Practical application of formal methods requires more than advanced technology and tools; it requires an appropriate methodology. A verification methodology for data-path-dominated hardware combines model checking and theorem proving in a customizable framework. This methodology has been effective in large-scale industrial trials, including verification of an IEEE-compliant floating-point adder     

On-line planning in automatic control systems for industrial processes

As is generally known, efficient production control requires permanent acquisition, processing and storage of production and technological data. Moreover, it requires analysis of the data, on-line control of manufacturing and industrial processes, as well as their scheduling. The mentioned functions are successfully performed by updated version of InfinitySuite, software product developed by EleSi company.     

拜占庭容错纠删码分布式存储协议

研究了从数据密集大部分拜占庭容错分布式存储协议使用复制技术,但是当存储的数据块很大时,复制技术要求大量的存储空间并占用网络带宽,效率低下。采用纠删码技术则将数据块编码为长度相同的分片,然后把各个分片分别存储在对应的存储节点上,这样可以节省存储空间和网络带宽。拜占庭容错纠删码分布式存储需要额外的开销、附加的服务器甚至要版本化存储,才能保证数据的一致性。通过对通常的情况进行优化,采用新颖的机制并引入同态指纹检验码,使得需要最少的服务器、最小的额外计算量和最小的通信回合数目,达到了低开销,并且可以保证时间戳不跳跃。     

An all-digital DFT scheme for testing catastrophic faults in PLLs

Traditional functional testing of mixed-signal ICs is slow and requires costly, dedicated test equipment. The authors update the standard PLL architecture to allow simple digital testing. The all-digital strategy yields catastrophic fault coverage as high as that of the classical functional test, plus it is fast, extremely simple to implement, and requires only standard digital test equipment.     

The complexity of almost-optimal simultaneous coordination

The problem of fault-tolerant coordination is fundamental in distributed computing. In the past, researchers have considered achieving simultaneous coordination under various failure assumptions. It has been shown that doing so optimally in synchronous systems with send/receive omission failures requires NP-hard local computation. This paper studiesalmost-optimal simultaneous coordination, which requires processors to coordinate within a constant additive or multiplicative number of rounds of the coordination time of an optimal protocol. It shows that achieving such coordination also requires NP-hard computation. This work was supported in part by the National Science Foundation under Grants CCR-9106627 and CCR-9301454. R. A. Bazzi was supported in part by a scholarship from the Hariri Foundation.     

Visualization of Complex Automotive Data: A Tutorial

Visualization is a method of representing large amounts of complex data in ways that are easier to understand, analyze, and support decision making. Large automotive manufacturers such as General Motors (GM) use visualization with great success. Visualization requires combinations of manual and automated data harvesting. Users must find and access the correct digital data based on a correct configuration of the product to be visualized. In addition, each type of visualization, from real-time design reviews to marketing-based image rendering, requires data to be prepared with appropriate materials, backgrounds, and lighting. Each of these processes requires a different set of expert users and their own optimized process to create specific visualizations or views of data. Making complicated data easier to understand has always been a challenge.     

有线电视用户收费银行联网系统的研究与设计

电子缴费要求有线电视台将执行事务性工作的环境网络化、信息化,需要集成目前有线电视台已存在的一些异构应用系统,而对这样的环境和需求,新的系统必须基于Web提供服务,能够跨平台、可重用、可扩展.本文采用J2EE技术构建了一个有线电视用户收费银行联网系统.详细介绍了系统的功能、具体设计思想和实现方法.     

A low-overhead technique for dynamic blackboarding using morphing technology

We present a simple, low-overhead method for “dynamic blackboarding”, using inexpensive, commercially available morphing technology. The method, which allows rapid production of animated presentations for classroom use, requires the user to construct a storyboard using a conventional graphical editor, and then link the storyboard frames into a QuickTime animation using the morphing software. The technique requires less effort to produce satisfactory simple animations than conventional algorithm animation techniques, and also requires less training. (Note to readers: Since this paper makes extensive reference to animations, it is best to view the accompanying animations at the appropriate points while reading the paper. These animations are available on the World Wide Web; their URLs are given at the appropriate points in the paper.)     

Fractal recognition of compact artifacts on color images

Analysis of small test fragments or compact artifacts is essential for many color correction problems. An efficient method of analysis is the recognition of compact artifacts. However, pattern recognition by features requires the determination of significant features for each applied problem. An alternative approach to the recognition of compact artifacts, which requires no feature extraction and is based on systems of iterated functions and comparison of their attractors, is proposed.     

基于截止期错失率可预测的高利用率容错调度

现代导航与通信等实时系统经常面临着复杂的实时数字信号处理及信息交互需求,处理器处于高利用率状态.对于此类高利用率实时系统,传统的时间冗余容错通常会引发多个任务连续错失截止期的灾难性后果.针对高利用率情况,提出一种截止期错失率可预测的容错调度方法,截止期错失次数不大于出现错误的次数,消除了多个任务截止期连续错失的多米诺效应.进一步地在该方法中融合时间冗余方法的优点,提出了求解检测点上界位置的离线快速算法,有效地降低了截止期错失率.仿真实验表明,与目前已知的同类方法相比,该方法具有更低的截止期错失率.     

Initialization method for self-calibration using 2-views

Recently, 3D structure recovery through self-calibration of camera has been actively researched. Traditional calibration algorithm requires known 3D coordinates of the control points while self-calibration only requires the corresponding points of images, thus it has more flexibility in real application. In general, self-calibration algorithm results in the nonlinear optimization problem using constraints from the intrinsic parameters of the camera. Thus, it requires initial value for the nonlinear minimization. Traditional approaches get the initial values assuming they have the same intrinsic parameters while they are dealing with the situation where the intrinsic parameters of the camera may change. In this paper, we propose new initialization method using the minimum 2 images. Proposed method is based on the assumption that the least violation of the camera's intrinsic parameter gives more stable initial value. Synthetic and real experiment shows this result.     

The complexity of basic complex operations

It is well-known that the product of two complex numbersX+iY andU+iV requires exactly 3 realm/d. We study the algebraic complexity of several other operations from the repertoire of complex arithmetic. We show, for instance, that complex inversion requires exactly 4m/d and that general complex division requires at least 5m/d. For the latter problem an upperbound of 6m/d is known, leaving some speculation as to its precise complexity. The proofs illustrate several criteria which may be of more general use in assessing the complexity of concrete sets of rational functions.     

Elementary function generators for neural-network emulators

Piecewise first- and second-order approximations are employed to design commonly used elementary function generators for neural-network emulators. Three novel schemes are proposed for the first-order approximations. The first scheme requires one multiplication, one addition, and a 28-byte lookup table. The second scheme requires one addition, a 14-byte lookup table, and no multiplication. The third scheme needs a 16-byte lookup table, no multiplication, and no addition. A second-order approximation approach provides better function precision; it requires more hardware and involves the computation of one multiplication and two additions and access to a 28-byte lookup table. We consider bit serial implementations of the schemes to reduce the hardware cost. The maximum delay for the four schemes ranges from 24- to 32-bit serial machine cycles; the second-order approximation approach has the largest delay. The proposed approach can be applied to compute other elementary function with proper considerations.     

Simplified parameter quantization procedure for adaptive estimation

Optimum Kalman filter design often requires estimation of the true value of an unknown parameter vector. In Magill's adaptive procedure, the parameter space must be quantized. An accurate estimate of the true value requires fine quantization, but this results in an unreasonable number of elemental filters. Iterative techniques that require only binary quantization of each unknown parameter are proposed. This reduces the number of elemental filters without sacrificing accuracy of the parameter estimate.     

一种改进的动态散列方法

线性散列方法是一种有效的动态散列方法。但是，一般的线性散列方法都不能保证查询时只要一次读磁盘操作。本文提出一种采用签名技术的改进方法，可以保证上述要求，同时保持线性散列方法的优点。此外，本文还对线性散列技术作了一般性扩充，并通过模拟实验研究了方法的性能。