TYPHOON PROCESS AND ITS IMPACT ON THE SURFACE CIRCULATION IN THE NORTHERN SOUTH CHINA SEA

A severe typhoon Utor,occurring between July 3 and 8,2001,brought heavy rainfall,strong wind and storm surge.Utor was responsible for tremendous destruction and economic losses in Philippines,Taiwan and Guangdong.An air-sea model system (MM5 and Princeton Ocean Model(POM))was built to simulate meteorological dynamics and ocean circulation in the South China Sea(SCS).In the POM the output of MM5 was used as the input data.With an increased number of vertical levels,a high-resolution planetary boundary layer scheme and updated landuse/vegetation data,the accuracy of computing wind,temperature and other meteorological fields are improved in near surface and upper levels in MM5 simulations.The simulated trajectory and wind speed of Utor are close to the observed results.The simulated distribution of rainfall is accorded well with measured data in the Pearl River Delta(PRD)area.At different meteorological stations in Hong Kong,the wind,temperature and sea surface pressure are well simulated.The simulated ocean surface current and surface temperature fields have an obvious rightward-biased response to the typhoon Utor,and the maximum velocity and the lowest temperature region appear in the 30 km of the right side of the typhoon track.The typhoon Utor could make the water 50m under the surface ocean unwell to surface and the ocean surface temperature decrease by about 2°C.     

基于Eclipse与JBoss的EJB3应用研究

本文介绍了JEE5及EJB3的新特点,研究了基于JBoss应用服务器的EJB3应用。     

光学显微镜数字化改造的设计及仿真

目前数字显微镜得到了广泛的应用,强大的图像处理功能和友好的用户接口是其主要优势。为了充分利用医学院校的传统光学显微镜,提出了数字化的改造方法。设计出通过CCD采集、DSP图像处理、视频显示的数字化显微图像分析系统仿真平台。并且根据显微图像噪声特点提出分频的对比度受限直方图均衡算法,从而提高图像的对比度,抑制噪声放大。仿真结果表明,硬件平台可以稳定、有效地增强显微图像,并可达到20帧/秒的处理速度。     

Using k-nn and discriminant analyses to classify rain forest types in a Landsat TM image over northern Costa Rica

Conservation and land use planning in humid tropical lowland forests urgently need accurate remote sensing techniques to distinguish among floristically different forest types. We investigated the degree to which floristically and structurally defined Costa Rican lowland rain forest types can be accurately discriminated by a non-parametric k nearest neighbors (k-nn) classifier or linear discriminant analysis. Pixel values of Landsat Thematic Mapper (TM) image and Shuttle Radar Topography Mission (SRTM) elevation model extracted from segments or from 5 × 5 pixel windows were employed in the classifications. 104 field plots were classified into three floristic and one structural type of forest (regrowth forest). Three floristically defined forest types were formed through clustering the old-growth forest plots (n = 52) by their species specific importance values. An error assessment of the image classification was conducted via cross-validation and error matrices, and overall percent accuracy and Kappa scores were used as measures of accuracy. Image classification of the four forest types did not adequately distinguish two old-growth forest classes, so they were merged into a single forest class. The resulting three forest classes were most accurately classified by the k-nn classifier using segmented image data (overall accuracy 91%). The second best method, with respect to accuracy, was the k-nn with 5 × 5 pixel windows data (89% accuracy), followed by the canonical discriminant analysis using the 5 × 5 pixel window data (86%) and the segment data (82%). We conclude the k-nn classifier can accurately distinguish floristically and structurally different rain forest types. The classification accuracies were higher for the k-nn classifier than for the canonical discriminant analysis, but the differences in Kappa scores were not statistically significant. The segmentation did not increase classification accuracy in this study.     

A Hidden‐picture Puzzles Generator

A hidden‐picture puzzle contains objects hidden in a background image, in such a way that each object fits closely into a local region of the background. Our system converts image of the background and objects into line drawing, and then finds places in which to hide transformed versions of the objects using rotation‐invariant shape context matching. During the hiding process, each object is subjected to a slight deformation to enhance its similarity to the background. The results were assessed by a panel of puzzle‐solvers.     

Quantifying requirements volatility effects

In an organization operating in the bancassurance sector we identified a low-risk IT subportfolio of 84 IT projects comprising together 16,500 function points, each project varying in size and duration, for which we were able to quantify its requirements volatility. This representative portfolio stems from a much larger portfolio of IT projects. We calculated the volatility from the function point countings that were available to us. These figures were aggregated into a requirements volatility benchmark. We found that maximum requirements volatility rates depend on size and duration, which refutes currently known industrial averages. For instance, a monthly growth rate of 5% is considered a critical failure factor, but in our low-risk portfolio we found more than 21% of successful projects with a volatility larger than 5%. We proposed a mathematical model taking size and duration into account that provides a maximum healthy volatility rate that is more in line with the reality of low-risk IT portfolios. Based on the model, we proposed a tolerance factor expressing the maximal volatility tolerance for a project or portfolio. For a low-risk portfolio its empirically found tolerance is apparently acceptable, and values exceeding this tolerance are used to trigger IT decision makers. We derived two volatility ratios from this model, the π-ratio and the ρ-ratio. These ratios express how close the volatility of a project has approached the danger zone when requirements volatility reaches a critical failure rate. The volatility data of a governmental IT portfolio were juxtaposed to our bancassurance benchmark, immediately exposing a problematic project, which was corroborated by its actual failure. When function points are less common, e.g. in the embedded industry, we used daily source code size measures and illustrated how to govern the volatility of a software product line of a hardware manufacturer. With the three real-world portfolios we illustrated that our results serve the purpose of an early warning system for projects that are bound to fail due to excessive volatility. Moreover, we developed essential requirements volatility metrics that belong on an IT governance dashboard and presented such a volatility dashboard.     

An LMI approach to synthesis subject to almost asymptotic regulation constraints

A multi-objective controller synthesis problem is considered in which an output is to be regulated approximately by assuring a bound on the steady-state peak amplification in response to an infinite-energy disturbance, while also guaranteeing a desired level of performance measured in terms of the worst-case energy gain from a finite-energy input to a performance output. Relying on a characterization of the controllers with which almost asymptotic regulation is accomplished, the problem of guaranteeing the desired level of performance is reduced to solving a system of linear matrix inequalities subject to a set of linear equality constraints. Based on the solution of this system, a procedure is outlined for the construction of a suitable controller whose order is equal to the order of the plant plus the order of the exogenous system.     

control with limited communication and message losses

We propose an H^∞ approach to a remote control problem where the communication is constrained due to the use of a shared channel. The controller employs a periodic time sequencing scheme for message transmissions from multiple sensors and to multiple actuators of the system. It further takes into account the information on the random message losses that occur in the channel. An exact characterization for controller synthesis is obtained and is stated in terms of linear matrix inequalities. Furthermore, an analysis on the loss probabilities of the messages to accomplish stabilization is carried out. The results are illustrated through a numerical example.     

Direct 5-axis tool-path generation from point cloud input using 3D biarc fitting

In reverse engineering, geometrical information of a product is obtained directly from a physical shape by a digitizing device. To fabricate the product, manufacturing information (usually tool-path) must be generated from a CAD model. The data digitized must be processed and in most cases, a surface model is constructed from them using some of the surface fitting technologies. However, these technologies are usually complicated and the process for constructing a surface patch from a massive digitizing data is time-consuming. To simplify the process for getting tool-path information, a simple algorithm is proposed in this paper. The algorithm is used to generate a 5-axis machining tool-path. Instead of implementing any complicated surface fitting techniques, a direct method is proposed for constructing three-dimensional (3D) triangular mesh from the digitizing data with the mesh points considered as the tool contact locations. Depending on the locations of the points digitized, a decimation procedure is applied such that some of the digitizing data will be filtered out. Then, the tool axis orientations which must be determined in 5-axis tool-path are calculated and the tool center locations are determined accordingly. A 3D biarc fitting technique is applied for all the tool center locations so that a complete 5-axis tool-path is obtained.     

系统用户密码MD5加密的分析和实现

该文介绍和分析了MD5（Message-DigestAlgorithm5）加密算法及其工作原理,介绍基于．NET环境下系统用户密码的MD5加密实现方法,并提出了自己的改进思想。