A set of generalized symmetries with arbitrary functions of t for the Konopelchenko-Dubrovsky (KD)equation in 2+1 space dimensions is given by using a direct method called formal function series method presented by Lo...
详细信息
A set of generalized symmetries with arbitrary functions of t for the Konopelchenko-Dubrovsky (KD)equation in 2+1 space dimensions is given by using a direct method called formal function series method presented by Lou. These symmetries constitute an infinite-dimensional generalized w∞ algebra.
We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes combine flooding and random walks, look ahead...
详细信息
In this paper, an efficient technique is proposed to optimize the geometie and arrangements of the slots of the CARLSAs. Moment method in carried out to obtain the unknown excitation coefficients after spliting the sl...
详细信息
In this paper, a new technique is proposed to analyse the mutual admittance between the slots of the radial line slot antennas (RLSA). No Green's functions are required since the mutual and self admittance of the ...
详细信息
We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes combine flooding and random walks, look ahead...
详细信息
We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes combine flooding and random walks, look ahead and replication. We consider both regular topologies and topologies with supernodes. We introduce a general search scheme, of which flooding and random walks are special instances, and show how to use locally maintained network information to improve the performance of searching. Our main findings are: (a) a small number of supernodes in an otherwise regular topology can offer sharp savings in the performance of search, both in the case of search by flooding and search by random walk, particularly when it is combined with 1-step replication. We quantify, analytically and experimentally, that the reason of these savings is that the search is biased towards nodes that yield more information. (b) There is a generalization of search, of which flooding and random walk are special instances, which may take further advantage of locally maintained network information, and yield better performance than both flooding and random walk in clustered topologies. The method determines edge critically and is reminiscent of fundamental heuristics from the area of approximation algorithms.
We use two fourth order geometric partial differential equations to efficiently solve several surface modelling problems, including the surface blending, the N-sided hole filling and the free-form surface fitting with...
详细信息
We use two fourth order geometric partial differential equations to efficiently solve several surface modelling problems, including the surface blending, the N-sided hole filling and the free-form surface fitting with the G/sup 1/ boundary continuity. The nonlinear equations used include the surface diffusion flow and the Willmore flow. These nonlinear equations are discretized using the mixed finite element method based on the combination of the loop's basis and the linear basis. The proposed approach is simple, efficient and gives very desirable results.
Amphiphiles are molecules with hydrophobic tails and hydrophilic heads. When dispersed in solvents, they self assemble into complex mesophases including the beautiful cubic gyroid phase. The goal of the TeraGyroid exp...
详细信息
We present a parallel bisection mesh refinement algorithm based on ALBERT (Adaptive multi-Level finite element toolbox using Bisection refinement and Error control by Residual Techniques). The goal is to develop a par...
详细信息
We present a parallel bisection mesh refinement algorithm based on ALBERT (Adaptive multi-Level finite element toolbox using Bisection refinement and Error control by Residual Techniques). The goal is to develop a parallel adaptive finite element code suitable for distributed memory parallel computers or PC clusters. An overview on the basic strategy for the parallelization of ALBERT is given. Issues on the parallel mesh refinement are addressed. A modified mesh refinement algorithm, which can be implemented efficiently on distributed memory parallel computers, is proposed and its properties are discussed. Numerical experiments with parallel bisection mesh refinement algorithm are shown.
Line search method and trust region method are two important classes of techniques for solving optimization problems and have their advantages respectively. In this paper we use the Armijo line search rule in a more a...
详细信息
Line search method and trust region method are two important classes of techniques for solving optimization problems and have their advantages respectively. In this paper we use the Armijo line search rule in a more accurate way and propose a new line search method for unconstrained optimization problems. Global convergence and convergence rate of the new method are analyzed under mild conditions. Furthermore, the new Armijo-type line search strategy is shown to be equivalent to an approximation of a trust region method then has both advantages of line search strategy and trust region strategy.
Presents an improved technique for the design of CA-RLSAs in which the slot paths are split into several identical regions. The conventional Galerkin's moment method is carried out to solve the unknown excitation ...
详细信息
ISBN:
(纸本)0780388836
Presents an improved technique for the design of CA-RLSAs in which the slot paths are split into several identical regions. The conventional Galerkin's moment method is carried out to solve the unknown excitation coefficients
暂无评论