Three-dimensional beam propagation method based on the variable transformed Galerkin''''s method

A novel three-dimensional beam propagation method (BPM) based on the variable transformed Galerkin's method is introduced for simulating optical field propagation in three-dimensional dielectric structures. The infinite Cartesian x-y plane is mapped into a unit square by a tangent-type function transformation. Consequently, the infinite region problem is converted into the finite region problem. Thus, the boundary truncation is eliminated and the calculation accuracy is promoted. The three-dimensional BPM basic equation is reduced to a set of first-order ordinary differential equations through sinusoidal basis function, which fits arbitrary cladding optical waveguide, then direct solution of the resulting equations by means of the Runge-Kutta method. In addition, the calculation is efficient due to the small matrix derived from the present technique. Both z-invariant and z-variant examples are considered to test both the accuracy and utility of this approach.     

Sensor‐independent analysis method for hyperspectral data based on the pattern decomposition method

This paper describes a modified pattern decomposition method with a supplementary pattern. The proposed approach can be regarded either as a type of spectral mixing analysis or as a kind of multivariate analysis; the later explanation is more suitable considering the presence of the additional supplementary patterns. The sensor‐independent method developed herein uses the same normalized spectral patterns for any sensor: fixed multi‐band (1260 bands) spectra serve as the universal standard spectral patterns. The resulting pattern decomposition coefficients showed sensor independence. That is, regardless of sensor, the three coefficients had nearly the same values for the same samples. The estimation errors for pattern decomposition coefficients depended on the sensor used. The estimation errors for Landsat/MSS and ALOS/AVNIR‐2 were larger than those of Landsat/TM (ETM+), Terra/MODIS and ADEOS‐II/GLI. The latter three sensors had negligibly small errors.     

A comparison study for displacement computation – Horn and Shunck's method versus March's method

The aim of this study is to reveal the effectiveness of a displacement computation method proposed by March in 1988. In common with a method proposed by Horn and Shunck in 1981, March's method also utilizes the measure of the departure from smoothness in the computed displacement as a regularization term. However, these two method have a difference in the definition of the correspondence error between images. Horn and Shunck eliminated the second and higher order terms of spatial brightness variation, so that the correspondence error is defined as a linear model. On the other hand, March defined a non-linear model in which the second and higher order terms are preserved. In order to verify the difference between two methods experimentally, we compare two methods with simulation images. Consequently, it is shown that March's method gives more accurate displacement for non-linearity in the brightness variation and less computation cost.     

Two-grid method for two-dimensional nonlinear Schrödinger equation by mixed finite element method

A conservative two-grid mixed finite element scheme is presented for two-dimensional nonlinear Schrödinger equation. One Newton iteration is applied on the fine grid to linearize the fully discrete problem using the coarse-grid solution as the initial guess. Moreover, error estimates are conducted for the two-grid method. It is shown that the coarse space can be extremely coarse, with no loss in the order of accuracy, and still achieve the asymptotically optimal approximation as long as the mesh sizes satisfy $H=O\left(h^{\frac{1}{2}}\right)$ in the two-grid method. The numerical results show that this method is very effective.     

Nested strong loader apparatus and method

An apparatus and method provides one or more controlled, dynamically loaded, modular, cryptographic fillers. Fillers may be loaded by a single loader, multiple independent loaders, or nested loaders. Loaders may be adapted to load other loaders, within cryptographic controls extant and applicable thereto. Integration into a base executable having one or more slots, minimizes, controls, and links the interface between the fillers and base executables. The filler may itself operate recursively to load another filler in nested operations, whether or not the fillers are in nested relation to one another. An ability of any filler to be loaded may be controlled by the base executable verifying the integrity, authorization, or both for any filler. The base executable may rely on an integrated loader to control loading and linking of fillers and submodules. A policy may limit each module's function, access, and potential for modification or substitution. Dynamically loaded modules (loaders, other fillers, and s     

Nonlinear system compound inverse control method

A compound neural network is utilized to identify the dynamic nonlinear system. This network is composed of two parts： one is a linear neural network, and the other is a recurrent neural network. Based on the inverse theory a compound inverse control method is proposed. The controller has also two parts： a linear controller and a nonlinear neural network controller. The stability condition of the closed-loop neural network-based compound inverse control system is demonstrated .based on the Lyapunov theory. Simulation studies have shown that this scheme is simple and has good control accuracy and robustness.     

Coefficient compensation method for embedded CODEC

A simple coefficient compensation method is proposed for the discarded low-bit coefficient in embedded decoding system. First, the coefficient matrix of image is extended as a ＂general＂ image. Then some traditional conceptions and quantitative index of image＇s quality in spatial domain can be borrowed to evaluate the coefficient matrix in transform domain. By defining a special evaluation rule PSNR_W for the coefficient matrix, a simple method is deduced to compensate the coefficients before inverse transformation operation. Experiments indicated its effect to enhance the quality of decoded image. This method can also be used in other codec based on bit-plane scanning.     

The discrete collocation method for Fredholm–Hammerstein integral equations based on moving least squares method

The purpose of this paper is to investigate the discrete collocation method based on moving least squares (MLS) approximation for Fredholm–Hammerstein integral equations. The scheme utilizes the shape functions of the MLS approximation constructed on scattered points as a basis in the discrete collocation method. The proposed method is meshless, since it does not require any background mesh or domain elements. Error analysis of this method is also investigated. Some numerical examples are provided to illustrate the accuracy and computational efficiency of the method.     

Reverse triple Ⅰ method of fuzzy reasoning

A theory of reverse triple I method with sustention degree is presented by using the implication operator R0 in every step of the fuzzy reasoning. Its computation formulas of supremum for fuzzy modus ponens and infimum for fuzzy modus tollens are given respectively. Moreover, through the generalization of this problem, the corresponding formulas of α-reverse triple I method with sustention degree are also obtained. In addition, the theory of reverse triple I method with restriction degree is proposed as well by using the operator R0, and the computation formulas of infimum for fuzzy modus ponens and supremum for fuzzy modus tollens are shown.     

A general method for function synthesis†

This paper proposes some mathematical relations that may be used to describe conditions in systems after connections have been altered. The common rules of conservation of charge and flux emerge as particular instances of these more general relations. The results obtained apply in systems containing amplifiers (subject to model adequacy)—a case excluded by the normal conservation stipulations.

The conditions under which a peculiar form of instability is encountered are presented.     

The video capture method base on DIrectShow

A method of using DirectShow to implement the video captures and storage was described in this paper.During his research,the author used this mdthod to solve the problem of video capture,compress and storage on different video card.At the same time,this technology also can be used at the video process of TV,Network bradcast,DVD,So it has brad application field.     

Saved Web page security system and method

A system and method of saving a Web page from a Website on an Internet to a computer-readable medium is disclosed.A Web page is downloaded from the Intemet to the computer-readable medium.The Internet address for the Web page isstored on the computer—readable medium When the Web pageis opened from the computer-readable medium the Internetaddress is used to identify a security context for the Web page.By using the Internet address to identify the security context forthe Web page,the system and method of the present inventionallows users to securely view and execute Web pages down-loaded from the Internet.     

Brown�CRobinson method for interval matrix games

In this paper, two-person interval matrix games are considered, and by means of acceptability index, Brown–Robinson method to find a mixed-strategy equilibrium is adapted to interval matrix games. Numerical examples are also given.     

A simplified NARMAX method using nonlinear input-output data

A system identification method for nonlinear systems with unknown structure is presented using short input-output data. The method simplifies the original NARMAX method. It introduces more general model structures for nonlinear systems. The group method of data handling （GMDH） method is employed to obtain the model terms and parameters. Effectiveness of the proposed method is illustrated by a typical nonlinear system with unknown structure and deficient input-output data.     

Implementable L ∞ penalty-function method for semi-infinite optimization

This paper considers general non-linear semi-infinite programming problems and presents an implementable method which employs an exact L _∞ penalty function. Since the L _∞ penalty function is continuous even if the number of representative constraints changes, trust-region techniques may effectively be adopted to obtain global convergence. Numerical results are given to show the efficiency of the proposed algorithm.     

Spectral grouping using the Nyström method

Spectral graph theoretic methods have recently shown great promise for the problem of image segmentation. However, due to the computational demands of these approaches, applications to large problems such as spatiotemporal data and high resolution imagery have been slow to appear. The contribution of this paper is a method that substantially reduces the computational requirements of grouping algorithms based on spectral partitioning making it feasible to apply them to very large grouping problems. Our approach is based on a technique for the numerical solution of eigenfunction problems known as the Nystrom method. This method allows one to extrapolate the complete grouping solution using only a small number of samples. In doing so, we leverage the fact that there are far fewer coherent groups in a scene than pixels.     

Semi-discrete method for generalized Schrödinger-type equations

In this article, a semi-discrete method for solving a class of generalized Schrödinger-type equations is presented. By discretization of the spatial variables, the initial-boundary value problem for partial differential equations can be reduced to the initial value problem for ordinary differential systems. And it is very convenient for numerical analyses and computations.