2006 No. 3
Display Method:
2006, (3): 1-7.
Abstract:
Let A=(t4)lim (An,Pn) be the tracial limit of a sequence of unital C*-subalgebras An, this paper proved that (1) united manners of the structure of K0(An) can be transmitted to K0(A); (2) for ∨n ,n∈N and if the natural maps ikn:Uk(An)/Uk0(An) -- K1(An) are surjective, then ∨k∈N,ik:Uk(A)/Uk0(A) -- K1(A) are surjective too.
Let A=(t4)lim (An,Pn) be the tracial limit of a sequence of unital C*-subalgebras An, this paper proved that (1) united manners of the structure of K0(An) can be transmitted to K0(A); (2) for ∨n ,n∈N and if the natural maps ikn:Uk(An)/Uk0(An) -- K1(An) are surjective, then ∨k∈N,ik:Uk(A)/Uk0(A) -- K1(A) are surjective too.
2006, (3): 8-14.
Abstract:
It was shown that there are some C*-algebras maintaining the closing property with the tracial limit, especially under the condition of simplicity. Suppose A=(t2)limn - ∞ (An,pn). If each An admits at least one tracial state or has SP-property, then A has the same case. Suppose A=(t3)limn - ∞ (An,pn) and A is simple. If TR(An)=0, tsr(An)=1 and An has Cancelation of Projection, then A has the same case.
It was shown that there are some C*-algebras maintaining the closing property with the tracial limit, especially under the condition of simplicity. Suppose A=(t2)limn - ∞ (An,pn). If each An admits at least one tracial state or has SP-property, then A has the same case. Suppose A=(t3)limn - ∞ (An,pn) and A is simple. If TR(An)=0, tsr(An)=1 and An has Cancelation of Projection, then A has the same case.
2006, (3): 15-20.
Abstract:
Based on Bernstein's technique, this paper established the C1,1 a priori estimates for degenerate Hessian equation on Sn, which is corresponding to Christoffel-Minkowski problem in convexity geometry. It refined the results of Krylov.
Based on Bernstein's technique, this paper established the C1,1 a priori estimates for degenerate Hessian equation on Sn, which is corresponding to Christoffel-Minkowski problem in convexity geometry. It refined the results of Krylov.
2006, (3): 21-25.
Abstract:
A normality criterion for a family of holomorphic functions was got. Let F be a family of holomorphic functions on the unit disk ⊿, all of whose zeros are of multiplicity at least m; let M,N be two positive numbers; if for any f∈F, f(z)=0= |f(m)(z)| ≦M ,f(m)(z)=1 = |f(z)| ≧N , then F is normal on ⊿.
A normality criterion for a family of holomorphic functions was got. Let F be a family of holomorphic functions on the unit disk ⊿, all of whose zeros are of multiplicity at least m; let M,N be two positive numbers; if for any f∈F, f(z)=0= |f(m)(z)| ≦M ,f(m)(z)=1 = |f(z)| ≧N , then F is normal on ⊿.
2006, (3): 26-31.
Abstract:
This paper investigated three kinds of widely used generalized inverses of matrices: they are {1,3} and {1,4} inverses, and generalized Bott-Duffin inverse of L-zero matrices. Some new expressions and properties are obtained; and examples are given to illustrate their applications in finding least-square solutions and minimum problem solutions.
This paper investigated three kinds of widely used generalized inverses of matrices: they are {1,3} and {1,4} inverses, and generalized Bott-Duffin inverse of L-zero matrices. Some new expressions and properties are obtained; and examples are given to illustrate their applications in finding least-square solutions and minimum problem solutions.
2006, (3): 32-36.
Abstract:
Sufficient and necessary conditions of the efficient on semi-preinvex multiabjective programming are obtained. Based on these, the wolfe type dual is discussed and the corresponding duality are established.
Sufficient and necessary conditions of the efficient on semi-preinvex multiabjective programming are obtained. Based on these, the wolfe type dual is discussed and the corresponding duality are established.
2006, (3): 37-43.
Abstract:
Combined with the edge-connectivity, this paper investigated the upper embeddable graphs with specific minimum degree-sum of vertices in its independent-set, and obtained the following results. (1) Let G be a 2-edge-connected simple graph, if G satisfies the following conditions: for any 3-independent set I in G, ∨xi ,xj ∈I (i,j = 1,2,3), d(xi ,xj)≧3 (1 ≦ i ≠ j ≦ 3) =∑i = 13 d(xi) ≧ v + 1(v = | V(G)|}), then G is upper embeddable; (2) Let G be 3-edge-connected simple graph, if G satisfies the following conditions: for any 6-independent set I in G, ∨xi ,xj ∈I (1≦i,j≦6), d(xi,xj) ≧3(1 ≦ i ≠ j ≦ 6) = ∑i = 16 d(xi) ≧ v + 1(v = | V(G)|), then G is upper embeddable.
Combined with the edge-connectivity, this paper investigated the upper embeddable graphs with specific minimum degree-sum of vertices in its independent-set, and obtained the following results. (1) Let G be a 2-edge-connected simple graph, if G satisfies the following conditions: for any 3-independent set I in G, ∨xi ,xj ∈I (i,j = 1,2,3), d(xi ,xj)≧3 (1 ≦ i ≠ j ≦ 3) =∑i = 13 d(xi) ≧ v + 1(v = | V(G)|}), then G is upper embeddable; (2) Let G be 3-edge-connected simple graph, if G satisfies the following conditions: for any 6-independent set I in G, ∨xi ,xj ∈I (1≦i,j≦6), d(xi,xj) ≧3(1 ≦ i ≠ j ≦ 6) = ∑i = 16 d(xi) ≧ v + 1(v = | V(G)|), then G is upper embeddable.
2006, (3): 44-50.
Abstract:
Let D be a collection of invertible n×n real matrices and Γ a collection of points in Rn. this paper proved that when D={Aj,j∈Z}, A is a real n×n matrix, such thatA be diagonal matrix with submatrices us its elemets, where A1 is expansive, A2 is idempotent with det A2≠0, then there exists a (D,Γ) wavelet.
Let D be a collection of invertible n×n real matrices and Γ a collection of points in Rn. this paper proved that when D={Aj,j∈Z}, A is a real n×n matrix, such thatA be diagonal matrix with submatrices us its elemets, where A1 is expansive, A2 is idempotent with det A2≠0, then there exists a (D,Γ) wavelet.
2006, (3): 51-59.
Abstract:
A Jacobi elliptic function expansion method was used to solve generalized compound KdV-mKdV equations. Before this a transformation was introduced to simplify the solving process. Many solutions were obtained through this method, and some of them can be deduced to solutions of some famous nonlinear equations with particular parameters.
A Jacobi elliptic function expansion method was used to solve generalized compound KdV-mKdV equations. Before this a transformation was introduced to simplify the solving process. Many solutions were obtained through this method, and some of them can be deduced to solutions of some famous nonlinear equations with particular parameters.
2006, (3): 60-65.
Abstract:
The problem of output feedback adaptive stabilization for a class of uncertain dynamic system including time varying delayed perturbations was discussed.The uncertainties were assumed to satisfy the so-called matching conditions and the transfer function matrix of the nominal system was strictly feedback positive real.By using of the Lyapunov stability theory and Lyapunov-Krosovskii functional we proposed an output feedback adaptive controller,which guarantees that the closed-loop system is globally stable i the sense of uniform ultimate boundedness. Finally, an illustrative example was given to demonstrate the validity of the results.
The problem of output feedback adaptive stabilization for a class of uncertain dynamic system including time varying delayed perturbations was discussed.The uncertainties were assumed to satisfy the so-called matching conditions and the transfer function matrix of the nominal system was strictly feedback positive real.By using of the Lyapunov stability theory and Lyapunov-Krosovskii functional we proposed an output feedback adaptive controller,which guarantees that the closed-loop system is globally stable i the sense of uniform ultimate boundedness. Finally, an illustrative example was given to demonstrate the validity of the results.
2006, (3): 66-70,1.
Abstract:
A new level set approach for image segmentation was proposed based on the piecewise-constant Mumford-Shah model developed by Chan and Vese, The approach used AOS scheme, which is unconditional stable, to discrete the level set function. Besides, extended fast marching method for constructing the signed distance function was introduced to reduce the amount of computation significantly.
A new level set approach for image segmentation was proposed based on the piecewise-constant Mumford-Shah model developed by Chan and Vese, The approach used AOS scheme, which is unconditional stable, to discrete the level set function. Besides, extended fast marching method for constructing the signed distance function was introduced to reduce the amount of computation significantly.
2006, (3): 71-76.
Abstract:
System simulation was used to optimize stochastic inventory. It combined genetic algorithms with simulation of discrete event system and used genetic algorithms to guide the choice of control variables.A new selection operation and a candidate policies′ collector were proposed to overcome the randomicity of a stochastic inventory system.Test results of a (s, S) inventory system showed that the solution proposed is feasible and effective.
System simulation was used to optimize stochastic inventory. It combined genetic algorithms with simulation of discrete event system and used genetic algorithms to guide the choice of control variables.A new selection operation and a candidate policies′ collector were proposed to overcome the randomicity of a stochastic inventory system.Test results of a (s, S) inventory system showed that the solution proposed is feasible and effective.
2006, (3): 77-85.
Abstract:
A new method to trace region contours and generate chain code tree was proposed by defining the vertex chain code and constructing the pixel vertex matrix of binary images. While tracing contours of a region and extracting vertex chain codes of these contours, the chain code tree of the contours is created. Further more, the complexity of the algorithm is linear and it can be used for tracing the contour of any complex region.
A new method to trace region contours and generate chain code tree was proposed by defining the vertex chain code and constructing the pixel vertex matrix of binary images. While tracing contours of a region and extracting vertex chain codes of these contours, the chain code tree of the contours is created. Further more, the complexity of the algorithm is linear and it can be used for tracing the contour of any complex region.
2006, (3): 86-92.
Abstract:
A routing algorithm for Ad Hoc Networks associating reactive and proactive protocols, called preemptive algorithm, was proposed. The network nodes estimated valid duration of the link when the received signal strength was below the dangerous power threshold. If the estimated valid time was less than the response time,finding an alternative local route was triggered and the to-be-broken route was substituted before the dangerous link was broken. The simulation result shows the extended AODV protocol with the preemptive algorithm proposed significantly reduces the number of lose packets due to the broken paths,decreases the packet delivery delay in the situation of heavy traffic.
A routing algorithm for Ad Hoc Networks associating reactive and proactive protocols, called preemptive algorithm, was proposed. The network nodes estimated valid duration of the link when the received signal strength was below the dangerous power threshold. If the estimated valid time was less than the response time,finding an alternative local route was triggered and the to-be-broken route was substituted before the dangerous link was broken. The simulation result shows the extended AODV protocol with the preemptive algorithm proposed significantly reduces the number of lose packets due to the broken paths,decreases the packet delivery delay in the situation of heavy traffic.
2006, (3): 93-98.
Abstract:
Web page arrival principles,a knowledge modeling method,and a mapping mechanism between the model and pages were introduced. The main components of knowledge-based Crawler and its several key implementation techniques were presented. A knowledge relativity model was offered. This knowledge extraction method is useful to build next generation intelligent search engine.
Web page arrival principles,a knowledge modeling method,and a mapping mechanism between the model and pages were introduced. The main components of knowledge-based Crawler and its several key implementation techniques were presented. A knowledge relativity model was offered. This knowledge extraction method is useful to build next generation intelligent search engine.
2006, (3): 99-108.
Abstract:
This paper studied a distributed education resource service system named ERSDG, which based on grid in order to share and use Shanghai Education Resource. First, Globus Toolkit was indroduced, the framework and functions of ERSDG were elaborated, and specifications of resource file name and types of resource node were brought forward; and then system realization from synchronizing data,resource access service and monitor management were discussed. At last we analysed ERSDG′s performance on test of synchronizing data, user access and system monitor.
This paper studied a distributed education resource service system named ERSDG, which based on grid in order to share and use Shanghai Education Resource. First, Globus Toolkit was indroduced, the framework and functions of ERSDG were elaborated, and specifications of resource file name and types of resource node were brought forward; and then system realization from synchronizing data,resource access service and monitor management were discussed. At last we analysed ERSDG′s performance on test of synchronizing data, user access and system monitor.
2006, (3): 109-113.
Abstract:
A new scheduling algorithm based on economic model was proposed, which extends classic optimization algorithm, keeping the time of computation at the minimum. The algorithm takes “deadline” and “budget” which are provided by different gird users, into consideration. The performance of this new scheduling algorithm, achieving lower job completion time and satisfying user′s QoS demand, is demonstrated by its implementation on Gridsim.
A new scheduling algorithm based on economic model was proposed, which extends classic optimization algorithm, keeping the time of computation at the minimum. The algorithm takes “deadline” and “budget” which are provided by different gird users, into consideration. The performance of this new scheduling algorithm, achieving lower job completion time and satisfying user′s QoS demand, is demonstrated by its implementation on Gridsim.
2006, (3): 114-119.
Abstract:
NiFeP/CuBe composite wires were produced by electroless-deposition, then were annealed using a DC Joule annealing technique for certain time in the environment of nitrogen gas. The experiments showed that DC Joule annealing may induce circular anisotropy in the ferromagnetic layer, thus the GMI effect of the composite wires is increased greatly. When the annealing current is 2.8 A and the annealing time is 2 minutes, the sample’s GMI effect reaches the highest value of 53.2% at 475 kHz.
NiFeP/CuBe composite wires were produced by electroless-deposition, then were annealed using a DC Joule annealing technique for certain time in the environment of nitrogen gas. The experiments showed that DC Joule annealing may induce circular anisotropy in the ferromagnetic layer, thus the GMI effect of the composite wires is increased greatly. When the annealing current is 2.8 A and the annealing time is 2 minutes, the sample’s GMI effect reaches the highest value of 53.2% at 475 kHz.
2006, (3): 120-125.
Abstract:
The data format of short message in GSM and GPS was explained briefly, then the embedded Linux operation system was transplanted on the Sistang board. The hardware and the application software were researched about position navigation, remote control, personal communication etc. that based on embedded Linux handy device, and these application programs were designed under embedded Qt software design platform.
The data format of short message in GSM and GPS was explained briefly, then the embedded Linux operation system was transplanted on the Sistang board. The hardware and the application software were researched about position navigation, remote control, personal communication etc. that based on embedded Linux handy device, and these application programs were designed under embedded Qt software design platform.
2006, (3): 126-133.
Abstract:
A simplified method for USB(Universal Serial Bus) interface programming for embedded devices was proposed by adding some new functions (“head file”,“macro” and “code generator”) in the assemble compiler. A real application example “An analog signal logging unit based on ET44M210 with USB interface” was presented to illustrate the advantages and feasibility of this method.
A simplified method for USB(Universal Serial Bus) interface programming for embedded devices was proposed by adding some new functions (“head file”,“macro” and “code generator”) in the assemble compiler. A real application example “An analog signal logging unit based on ET44M210 with USB interface” was presented to illustrate the advantages and feasibility of this method.