ISSN 
2001 Vol. 30, No. 1
2001, 30(1): 1-4,25.
Abstract:
By using 1-dimensional DOA searching rather than resort to multidimensional parametric searching, an algorithm for DOA estimation is given based on first order approximation of distributed sources induced by local scattering. It is applicable in circumstance where distributed function form of sources is unknown or sources with different distributed function forms coexist. Numerical examples illuminate that the performance of DOA estimation is improved compared with that of conventional MUSIC method.
By using 1-dimensional DOA searching rather than resort to multidimensional parametric searching, an algorithm for DOA estimation is given based on first order approximation of distributed sources induced by local scattering. It is applicable in circumstance where distributed function form of sources is unknown or sources with different distributed function forms coexist. Numerical examples illuminate that the performance of DOA estimation is improved compared with that of conventional MUSIC method.
2001, 30(1): 5-8.
Abstract:
A new method of polarimetric SAR three-dimensional imaging using polarimetric SAR data is proposed which provides both a direct measure of terrain azimuthal slopes and derived estimate of terrain elevation. The algorithms discussed in this paper include the fast searching algorithm and the solving ambiguity algorithm of the polarimetric ellipse rotation angle ψ. The terrain height is also obtained by employing the method.
A new method of polarimetric SAR three-dimensional imaging using polarimetric SAR data is proposed which provides both a direct measure of terrain azimuthal slopes and derived estimate of terrain elevation. The algorithms discussed in this paper include the fast searching algorithm and the solving ambiguity algorithm of the polarimetric ellipse rotation angle ψ. The terrain height is also obtained by employing the method.
2001, 30(1): 9-12.
Abstract:
According to the optimization theory and the neural network (NN) theory, a multiuser detector (MUD) is proposed, which takes the optimum MUD problem as combinatorial optimum problem. Using the neural network which has the ability of fast optimization computing, the Lagrange neural network (LNN) MUD is derived. Theoretical analysis and numerical results show that in aspect of bit-error rate and multiple access interfernce, the LNN MUD is better than the conventional and decorrelated MUD in aspect of "near-far" resistance, the LNN MUD is better than the conventional MUD and worse than the decorrelated detector and the LNN MUD can be easily implemented by VLSI technology.
According to the optimization theory and the neural network (NN) theory, a multiuser detector (MUD) is proposed, which takes the optimum MUD problem as combinatorial optimum problem. Using the neural network which has the ability of fast optimization computing, the Lagrange neural network (LNN) MUD is derived. Theoretical analysis and numerical results show that in aspect of bit-error rate and multiple access interfernce, the LNN MUD is better than the conventional and decorrelated MUD in aspect of "near-far" resistance, the LNN MUD is better than the conventional MUD and worse than the decorrelated detector and the LNN MUD can be easily implemented by VLSI technology.
2001, 30(1): 13-16.
Abstract:
This paper presents general high-level stochastic petri nets (GHLSPN), by which the method of modeling and performance analyzing for computer networks is proposed. Several real network parameters are considered, such as the control by acknowledgement, window suits and repeat mechanism for errors, which generally determine the overall performance of the computer networks. The algorithm overcomes some restrictions in previous algorithms.
This paper presents general high-level stochastic petri nets (GHLSPN), by which the method of modeling and performance analyzing for computer networks is proposed. Several real network parameters are considered, such as the control by acknowledgement, window suits and repeat mechanism for errors, which generally determine the overall performance of the computer networks. The algorithm overcomes some restrictions in previous algorithms.
2001, 30(1): 17-20.
Abstract:
This paper deals with four methods of real-time simulation of RF echo signal of 3D targets:the adoption of special hardware accelerating cards to calculate RF echo signal in real-time; the use of multi-computers' system to calculate RF echo signal in real-time; the adoption of autoregressive (AR) model or 3-spline to extrapolate or interpolate RF echo data; the use of scattering centers extracted from inverse synthetic aperture radar (ISAR) image to calculate RF echo signal. The differences of suchmethods are analyzed.
This paper deals with four methods of real-time simulation of RF echo signal of 3D targets:the adoption of special hardware accelerating cards to calculate RF echo signal in real-time; the use of multi-computers' system to calculate RF echo signal in real-time; the adoption of autoregressive (AR) model or 3-spline to extrapolate or interpolate RF echo data; the use of scattering centers extracted from inverse synthetic aperture radar (ISAR) image to calculate RF echo signal. The differences of suchmethods are analyzed.
2001, 30(1): 21-25.
Abstract:
In this paper, a novel class of complex wavelet is introduced. Time, frequency and time-frequency localization characteristics are investigated using time operator. Theoretical and numerical analysis shows that the new class of wavelet possesses excellent time-frequency localization. Many complex wavelets are constructed, which are approximate to the optimal time-frequency window function by changing two controlling parameters of the new wavelet.
In this paper, a novel class of complex wavelet is introduced. Time, frequency and time-frequency localization characteristics are investigated using time operator. Theoretical and numerical analysis shows that the new class of wavelet possesses excellent time-frequency localization. Many complex wavelets are constructed, which are approximate to the optimal time-frequency window function by changing two controlling parameters of the new wavelet.
2001, 30(1): 26-28,32.
Abstract:
Three variable Boolean functions with balance and strict avalanche are tested and analyzed, and an expansion method of Boolean functions from single-variable to multi-variable is given. Some valuable results are obtained. Finally, a generation method of constructing multi-variable Boolean functions with balance and strict avalanche is suggested.
Three variable Boolean functions with balance and strict avalanche are tested and analyzed, and an expansion method of Boolean functions from single-variable to multi-variable is given. Some valuable results are obtained. Finally, a generation method of constructing multi-variable Boolean functions with balance and strict avalanche is suggested.
2001, 30(1): 29-32.
Abstract:
Based on the basic principle of data fusion, a fuzzy neural network model for data fusion of radar net is presented. The WTA competition for maximizing the fussy membership function in neuron(s receptive field and the problem of the repeated fusion about target data are analyzed. Simulation of data conjunction for three targets demonstrates the validity of the method.
Based on the basic principle of data fusion, a fuzzy neural network model for data fusion of radar net is presented. The WTA competition for maximizing the fussy membership function in neuron(s receptive field and the problem of the repeated fusion about target data are analyzed. Simulation of data conjunction for three targets demonstrates the validity of the method.
2001, 30(1): 33-36.
Abstract:
The exact solution of the elliptic cone stripline is derived based on the TEM mode and perfect conductor assumptions. Using the coordinate transform and conformal mapping technique, the ellipilic cone stripline is transformed to a parallel plate stripline. The basic parameters including the characteristic impedance, effective dielectric constant and capacidance per unit length are obtained using elliptic integral transform. The method used in this paper is useful for the problems of circular, elliptic cylinders and circular, elliptic cones.
The exact solution of the elliptic cone stripline is derived based on the TEM mode and perfect conductor assumptions. Using the coordinate transform and conformal mapping technique, the ellipilic cone stripline is transformed to a parallel plate stripline. The basic parameters including the characteristic impedance, effective dielectric constant and capacidance per unit length are obtained using elliptic integral transform. The method used in this paper is useful for the problems of circular, elliptic cylinders and circular, elliptic cones.
2001, 30(1): 37-40.
Abstract:
The mathematics models used in the prediction of electromagnetic interference between radar systems are obtained, in which the interference prediction equations are given. The radiated characteristics of emission device, transmission paths including two different terrains, receiver response and coupling between antennas are introduced. The interference probability is studied as radar antennas scan. The prediction programs can be compiled by the models.
The mathematics models used in the prediction of electromagnetic interference between radar systems are obtained, in which the interference prediction equations are given. The radiated characteristics of emission device, transmission paths including two different terrains, receiver response and coupling between antennas are introduced. The interference probability is studied as radar antennas scan. The prediction programs can be compiled by the models.
2001, 30(1): 41-45.
Abstract:
In this paper, the methods to calculate the capacitance coefficients in VLSI circuits are discussed, which are classified as formula method and numerical method. The latter includes the finite difference method (FDM), the finite element method (FEM), the boundary element method (BEM) and the Green(s Function method, etc. The theories, advantages and disadvantages of the methods are analyzed, respectively.
In this paper, the methods to calculate the capacitance coefficients in VLSI circuits are discussed, which are classified as formula method and numerical method. The latter includes the finite difference method (FDM), the finite element method (FEM), the boundary element method (BEM) and the Green(s Function method, etc. The theories, advantages and disadvantages of the methods are analyzed, respectively.
2001, 30(1): 46-48,65.
Abstract:
One-dimension spatial resolution soft X-ray spectra of laser-produced Ta plasmas is obtained by using a bent crystal spectrometer. Some resonance transition of the type 4f-3d in the Ni and Co-like isoelectronic sequence are identified. The Ni -like isoelectronic sequence wavelengths and Co-like 4f-3d resonance transition possible value are introduced. Wavelengths are measured with an uncertainty of ±5×10-5 nm。
One-dimension spatial resolution soft X-ray spectra of laser-produced Ta plasmas is obtained by using a bent crystal spectrometer. Some resonance transition of the type 4f-3d in the Ni and Co-like isoelectronic sequence are identified. The Ni -like isoelectronic sequence wavelengths and Co-like 4f-3d resonance transition possible value are introduced. Wavelengths are measured with an uncertainty of ±5×10-5 nm。
2001, 30(1): 49-52.
Abstract:
On the basis of analysis of geometric and mechanics relations, this paper derives the relation between the lateral and the action/torque, and gives a different strategy for searching hole and preventing wedging and jamming. With the wrist force sensor, the experiments are processed on the AdeptOne robot. The peg-hole assembly task with the diameter of 20 mm, the clearance of 3 μm and the start lateral of 4.0 mm is realized.
On the basis of analysis of geometric and mechanics relations, this paper derives the relation between the lateral and the action/torque, and gives a different strategy for searching hole and preventing wedging and jamming. With the wrist force sensor, the experiments are processed on the AdeptOne robot. The peg-hole assembly task with the diameter of 20 mm, the clearance of 3 μm and the start lateral of 4.0 mm is realized.
2001, 30(1): 53-57.
Abstract:
A small signal theory——space charge wave physics relevant to modulation properties of intense relativistic electron beams in klystron amplifiers is described in this paper. The properties are the dispersion equation of IREBs drifting in the tube, and the transmission line model of IREBs interacting with the gap electrical field of input cavity of RKA and bunching in the drift tube. The expression of modulated current after the gap of input cavity is got, which is content with the experimental results. In experiment,a voltage 500 kV,current 3 kA, pulse width 1.4 μs hollow electron beam modulated by 70 kW input microwave power generates 9.8% modulated current, and it is content with the results of theory.
A small signal theory——space charge wave physics relevant to modulation properties of intense relativistic electron beams in klystron amplifiers is described in this paper. The properties are the dispersion equation of IREBs drifting in the tube, and the transmission line model of IREBs interacting with the gap electrical field of input cavity of RKA and bunching in the drift tube. The expression of modulated current after the gap of input cavity is got, which is content with the experimental results. In experiment,a voltage 500 kV,current 3 kA, pulse width 1.4 μs hollow electron beam modulated by 70 kW input microwave power generates 9.8% modulated current, and it is content with the results of theory.
2001, 30(1): 58-61.
Abstract:
In this paper, two models of Internet database accessing:the two layer model and the three layer model are studied and compared. Three methods of current Internet database implementing:CGI method, API method, JDBC method are described. The comparing data of the relative database operation under three methods are also given.
In this paper, two models of Internet database accessing:the two layer model and the three layer model are studied and compared. Three methods of current Internet database implementing:CGI method, API method, JDBC method are described. The comparing data of the relative database operation under three methods are also given.
2001, 30(1): 62-65.
Abstract:
Safety kernel is a new mechanism providing safety assurance in safety-critical system. In this paper, many important concepts and characteristics of safety kernel are discussed by analyzing kernel method, such as the reason for its building, the requirements for its actualization, safety policies and architectures, etc. In addition, a reusable safety kernel mechanism is designed in this paper, which can address common problems found in safety kernel supporting reuse, such as dependencies on specific application software, in harmony of safety parameter expressiveness, etc.
Safety kernel is a new mechanism providing safety assurance in safety-critical system. In this paper, many important concepts and characteristics of safety kernel are discussed by analyzing kernel method, such as the reason for its building, the requirements for its actualization, safety policies and architectures, etc. In addition, a reusable safety kernel mechanism is designed in this paper, which can address common problems found in safety kernel supporting reuse, such as dependencies on specific application software, in harmony of safety parameter expressiveness, etc.
2001, 30(1): 66-71.
Abstract:
For an existing open system environment, the concept of real-time action and a two-layer management model for real-time are proposed in this paper. Related schedulable strategies of real-time actions for the two layers are discussed in detail. For the sake of making such kind of support into reality, a computer model is presented.
For an existing open system environment, the concept of real-time action and a two-layer management model for real-time are proposed in this paper. Related schedulable strategies of real-time actions for the two layers are discussed in detail. For the sake of making such kind of support into reality, a computer model is presented.
2001, 30(1): 72-76.
Abstract:
The characteristics of the B/S(Browser/Server) mode and the C/S(Client/Server) mode applied in management information system are analyzed. The system structure of management information system employing both the B/S mode and the C/S mode for the modern enterprises is presented. The system structure is used in the development of management information system for mechanical standard parts.
The characteristics of the B/S(Browser/Server) mode and the C/S(Client/Server) mode applied in management information system are analyzed. The system structure of management information system employing both the B/S mode and the C/S mode for the modern enterprises is presented. The system structure is used in the development of management information system for mechanical standard parts.
2001, 30(1): 77-81,86.
Abstract:
Though intelligent Agent can be considered as an entity from outside, it shows the property of separation because of its need inside. The conclusion is put forward based upon the thought that EGO is used to indicate the center of intelligent Agent's spirit. The multiple characteristics of Agent's need and desire are revealed in this paper, and the qualities and characteristics of Agent's separation are analyzed and discussed further. The knowledge about Agent's structure lays a foundation to analyze its behavior according to its structure.
Though intelligent Agent can be considered as an entity from outside, it shows the property of separation because of its need inside. The conclusion is put forward based upon the thought that EGO is used to indicate the center of intelligent Agent's spirit. The multiple characteristics of Agent's need and desire are revealed in this paper, and the qualities and characteristics of Agent's separation are analyzed and discussed further. The knowledge about Agent's structure lays a foundation to analyze its behavior according to its structure.
2001, 30(1): 82-86.
Abstract:
This paper introduces an examination base, in which DELPHI method is applied to realize its design structure.The examination base is developed by the use of visual tool and can be used in wide range of applications.
This paper introduces an examination base, in which DELPHI method is applied to realize its design structure.The examination base is developed by the use of visual tool and can be used in wide range of applications.
2001, 30(1): 87-90.
Abstract:
In this paper, the problem of the reduction of dimensions for Laplace equation(s conformal transformation is discussed. Based on the Schwarz-Christoffel transformation method and mathematical analysis, the method of reducing dimensions for Laplace equation is obtained. The results of this paper are generalized which solve problems of 2-dimension and 3-dimension for Laplace equation, with the boundary problem of complex.
In this paper, the problem of the reduction of dimensions for Laplace equation(s conformal transformation is discussed. Based on the Schwarz-Christoffel transformation method and mathematical analysis, the method of reducing dimensions for Laplace equation is obtained. The results of this paper are generalized which solve problems of 2-dimension and 3-dimension for Laplace equation, with the boundary problem of complex.
2001, 30(1): 91-94.
Abstract:
Minimum problems of functional about polygon spline interpolation are extended in this paper, which treat the constraints with penalty function method after quadratic functional being discreted. Five-point difference schemes are obtained according to optimal condition. The convergence theorem shows that iteration method can be used to solve large systems. Through a computation example, the method is proved to be available to solve the problems about interpolation of scattered data.
Minimum problems of functional about polygon spline interpolation are extended in this paper, which treat the constraints with penalty function method after quadratic functional being discreted. Five-point difference schemes are obtained according to optimal condition. The convergence theorem shows that iteration method can be used to solve large systems. Through a computation example, the method is proved to be available to solve the problems about interpolation of scattered data.
2001, 30(1): 95-99.
Abstract:
On the basis of dependent bound convergence uniformly theorem and Knopp-Kojima formula of lower side bivalent Dirichlet series, this paper introduces one random variable sequence, and defines lower side bivalent random Dirichlet series on probability space (Ω,A,P). The converge theory and Knopp-Kojima extending formula of the lower side bivalent random Dirichlet series are established.
On the basis of dependent bound convergence uniformly theorem and Knopp-Kojima formula of lower side bivalent Dirichlet series, this paper introduces one random variable sequence, and defines lower side bivalent random Dirichlet series on probability space (Ω,A,P). The converge theory and Knopp-Kojima extending formula of the lower side bivalent random Dirichlet series are established.
2001, 30(1): 100-102.
Abstract:
In this paper, the concept of p-metric space is introduced. According to the theory of functional analysis, the fixed point problems on p-metric space are studied. A common fixed-point theorem for a series of contraction mappings on p-metric space is also given, in which the metric space 2-metric space and 3-metric space are the special cases of p-metric space.
In this paper, the concept of p-metric space is introduced. According to the theory of functional analysis, the fixed point problems on p-metric space are studied. A common fixed-point theorem for a series of contraction mappings on p-metric space is also given, in which the metric space 2-metric space and 3-metric space are the special cases of p-metric space.
2001, 30(1): 103-106.
Abstract:
This paper present a new variant of successive quadratic programming methods with inequality and equality constraint. In calculation process, this methods need only to solve a quadratic programming problem at each iteration. In certain conditions, the global and fast local convergence properties of this algorithm is proved, whose step size of unity is acceptable and whose Maratos effect is obviated.
This paper present a new variant of successive quadratic programming methods with inequality and equality constraint. In calculation process, this methods need only to solve a quadratic programming problem at each iteration. In certain conditions, the global and fast local convergence properties of this algorithm is proved, whose step size of unity is acceptable and whose Maratos effect is obviated.
2001, 30(1): 107-110.
Abstract:
In this paper, some information of computation software on electromagnetics based on FDTD arithmetic are analyzed. Their application scopes and interfaces are summarized. The boundary condition and the method of accelerating computation are introduced. Their excitation styles and the methods of setting parameter are illuminated. The input and output files are also described.
In this paper, some information of computation software on electromagnetics based on FDTD arithmetic are analyzed. Their application scopes and interfaces are summarized. The boundary condition and the method of accelerating computation are introduced. Their excitation styles and the methods of setting parameter are illuminated. The input and output files are also described.
