Measurements of Time-Varying Characteristics of Optical Signals and Inhomogeneities of Tested Substances with Additional Phase Modulation

The problem of investigation of the amplitude and phase structure of a time-varying probing optical signal and the structure of time-varying inhomogeneities of a substance tested by this signal is considered. The analysis is concerned, in particular, with determination of the structure of signals and processes with resolution in the pico- and femtosecond range. The scheme used for the analysis is based on registration of four spatially separated spectra of the studied radiation. The spectra are formed in a four-channel scheme with a twin-wave Michelson interferometer and a spectral device. Modulators based on electrooptical crystals (perovskites) are placed in the channels. The sum spectra are formed: without modulators, with the effect of either of the modulators, and with both of them affecting the radiation. The effect of the studied substance implies either modulating the radiation (in this case it is described by multiplication) or redistributing the radiation (then it is described by convolution).     

基于Apollo信号控制台的NQR炸药探测方法

介绍了一种基于Apollo信号控制台的核四极矩共振（NQR）炸药探测方法，描述了系统的结构组成、工作原理和实现方法，并给出了对RDX的测试试验结果. 试验表明该方法可实现对RDX信号的探测.     

On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm

In this paper we focus on the problem of identifying the index sets P(x):=i|x_i>0, N(x):={i|F_i(x)>0 and C(x):=i|x_i=F_i(x)=0} for a solution x of the monotone nonlinear complementarity problem NCP(F). The correct identification of these sets is important from both theoretical and practical points of view. Such an identification enables us to remove complementarity conditions from the NCP and locally reduce the NCP to a system which can be dealt with more easily. We present a new technique that utilizes a sequence generated by the proximal point algorithm (PPA). Using the superlinear convergence property of PPA, we show that the proposed technique can identify the correct index sets without assuming the nondegeneracy and the local uniqueness of the solution.This work was supported in part by a Grant-in-Aid for Scientific Research from the Ministry of Education, Science, Sports and Culture of Japan.Mathematics Subject Classification (2000): 90C33, 65K10     

Minimal expansions in redundant number systems: Fibonacci bases and Greedy algorithms

We study digit expansions with arbitrary integer digits in base q (q integer) and the Fibonacci base such that the sum of the absolute values of the digits is minimal. For the Fibonacci case, we describe a unique minimal expansion and give a greedy algorithm to compute it. Additionally, transducers to calculate minimal expansions from other expansions are given. For the case of even integer bases q, similar results are given which complement those given in [6].     

Generating cryptographically strong Boolean functions using partial information

Periodica Mathematica Hungarica - In our paper we study the usage of partially defined Boolean functions (PDBFs) for generating cryptographically strong Boolean functions. A PDBF can be considered...     

匹配问题实例空间和解空间结构

本文通过研究匹配问题的实例空间，匈牙利算法和解空间三者之间的关系，指出S实例空间的数目与问题复杂度之间的关系既不是充分也不是必要的，而如何对问题的解空间进行合理的分解才能是问题的关键。     

全景图像几何畸变校正的算法研究及其软件实现

对于360°视场的全景图像,本文提出了分别对其进行切向和径向畸变校正的处理算法,并用插值处理提高处理精度。达到了将全景图像恢复为常规视场平面像的目的。它是进一步图像分析的前期工作。     

A modular integer GCD algorithm

This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors.     

基于改进遗传算法的布局优化子问题

本针对子问题，构造了布局子问题(关于同构布局等价类)的改进遗传算法。将该算法应用于二维布局优化子问题，数值实验表明该算法能够在很好地保持图元的邻接关系的前提下找到子问题的最优解。由于布局优化问题可分解为有限个子问题，所以利用该算法可以找到整个布局优化问题的全局最优解。     

Integrated Smart Sensor Calibration

In many applications electronic sensors are used toimprove performance and reliability of measurement systems. Suchsensors should provide a correct transfer from the physical signalto be measured to the electrical output signal. One importantstep to achieve this, is to calibrate each sensor by applyingdifferent reference input signals and adjusting the sensor transferaccordingly. Besides expensive reference equipment the calibrationprocess takes much time and attention per individual sensor,which means a considerable increase in sensor production costs.By including at the sensor or sensor interface chip a programmablecalibration facility the calibration of such smart sensors caneasily be automated and can be executed for a batch of sensorsat a time, thus minimizing the calibration time and costs. Thispaper presents a calibration method and options for integrationin the smart sensor concept, in hardware as well as in software.An advantage of the proposed method is that it does not needa large matrix of calibration data, which needs to be storedin a look-up table or converted into a correction formula, butinstead it uses a step-by-step approach to correct the sensortransfer at each calibration measurement until the error is sufficientlysmall.