基于JSP技术的Web网站安全性研究

通过对基于JSP技术的Web网站的体系结构的介绍．从Web服务器安全、JSP脚本编程及数据库安全等几方面分析研究了web网站存在的安全问题，并探讨了web网站开发时应采取的安全措施。     

铁路远程网络维护的有效方法--呼叫回拨

本文阐述了网络远程维护人员进行网络维护时比较有用的三种有效方法的原理及其设置 ,较好地解决了故障排除的时间和网络维护成本的矛盾。     

珠海台网络硬盘多频道数字播控系统

叙述了以视频服务器为中心构建的网络化多频道自动播出系统的实践、见解和系统的特点。该系统着重考虑了视频服务器选型、系统可靠性、网络化控制及监控、信号共享等问题；同时，实现了多路同时上载、多路边播边上载，以及自动延时播出等功能。     

Attractors for a Three-Dimensional Thermo-Mechanical Model of Shape Memory Alloys

Abstract In this note, we consider a Frémond model of shape memory alloys. Let us imagine a piece of a shape memory alloy which is fixed on one part of its boundary, and assume that forcing terms, e.g., heat sources and external stress on the remaining part of its boundary, converge to some time-independent functions, in appropriate senses, as time goes to infinity. Under the above assumption, we shall discuss the asymptotic stability for the dynamical system from the viewpoint of the global attractor. More precisely, we generalize the paper [12] dealing with the one-dimensional case. First, we show the existence of the global attractor for the limiting autonomous dynamical system; then we characterize the asymptotic stability for the non-autonomous case by the limiting global attractor. * Project supported by the MIUR-COFIN 2004 research program on “Mathematical Modelling and Analysis of Free Boundary Problems”.     

Minimal Ellipsoid Circumscribing a Polytope Defined by a System of Linear Inequalities

In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven.     

Solving Problems with Min-Type Functions by Disjunctive Programming

We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency.     

A search technique for global optimization in a chaotic environment

We describe a new algorithm which uses the trajectories of a discrete dynamical system to sample the domain of an unconstrained objective function in search of global minima. The algorithm is unusually adept at avoiding nonoptimal local minima and successfully converging to a global minimum. Trajectories generated by the algorithm for objective functions with many local minima exhibit chaotic behavior, in the sense that they are extremely sensitive to changes in initial conditions and system parameters. In this context, chaos seems to have a beneficial effect: failure to converge to a global minimum from a given initial point can often be rectified by making arbitrarily small changes in the system parameters.     

小波变换在金融数据分析中的应用

市场上的数据,从本质上讲都是一种时间序列。它和小波分析中的信号具有相同的特性。因此,完全可以将这些经济时间序列看成信号,应用小波变换进行分析和预测。     

On the analysis of a dynamic evolutionary algorithm

Evolutionary algorithms are applied as problem-independent optimization algorithms. They are quite efficient in many situations. However, it is difficult to analyze even the behavior of simple variants of evolutionary algorithms like the (1+1) EA on rather simple functions. Nevertheless, only the analysis of the expected run time and the success probability within a given number of steps can guide the choice of the free parameters of the algorithms. Here static (1+1) EAs with a fixed mutation probability are compared with dynamic (1+1) EAs with a simple schedule for the variation of the mutation probability. The dynamic variant is first analyzed for functions typically chosen as example-functions for evolutionary algorithms. Afterwards, it is shown that it can be essential to choose the suitable variant of the (1+1) EA. More precisely, functions are presented where each static (1+1) EA has exponential expected run time while the dynamic variant has polynomial expected run time. For other functions it is shown that the dynamic (1+1) EA has exponential expected run time while a static (1+1) EA with a good choice of the mutation probability has polynomial run time with overwhelming probability.     

Some degenerate and quasilinear parabolic systems not in divergence form

This paper deals with positive solutions of degenerate and quasilinear parabolic systems not in divergence form: u_t=u^p(Δu+av), v_t=v^q(Δv+bu), with null Dirichlet boundary conditions and positive initial conditions, where p, q, a and b are all positive constants. The local existence and uniqueness of classical solution are proved. Moreover, it will be proved that all solutions exist globally if and only if ab?λ₁², where λ₁ is the first eigenvalue of −Δ in Ω with homogeneous Dirichlet boundary condition.