A Distributed Model of WebGIS Based on Java Servlett

According to the application of Java in Web Geographical Information System （WebGIS）, a model of WebGIS based on Java Servlet is defined and a new distributed model is proposed. The dislributed model relies on the implementation of distribt, tcd Servlet. And in the model a locator is adopted to manage client access to the Servlet and balance the loads of cluster Web servers. The programming rule of distributcd Servlet and the operating principle of locator are studied in detail. The model has been applied in a practical system, and the actual operating effect shows that it remarkably improves access performance of the WebGIS application and possesses characteristics of load balance, fail-over and so on.     

Modular supervisory control for multi-floor manufacturing processes

Due to space availability limitations and high land costs, there is an increasing development of multi-floor manufacturing (MFM) systems in urban and industrial areas. The problem of coordination in a multi-floor manufacturing process, in the Ramadge Wonham framework, is introduced. The manufacturing chain of each floor and the elevator system are modeled in the form of finite deterministic automata. The models of the multi-floor manufacturing process are parametric with respect to the number of floors and the number of manufacturing machines on each floor. The coordination desired performance is formulated in the form of desired regular languages in analytic forms. The languages are realized by appropriate supervisors in the form of finite deterministic automata. The models of the supervisors are also parametric with respect to the number of floors and the number of manufacturing machines on each floor. The total control of the coordination of the multi-floor manufacturing process is accomplished via a modular supervisory control architecture. The complexity of the supervisors as well as the complexity of the total modular supervisory architecture are determined in analytic forms with respect to the number of floors and the number of manufacturing machines on each floor. The special case of a two floor manufacturing process is presented as an illustrative example.     

Frontiers of Algorithmics Workshop 2008 (FAW 2008)

Introduction The Workshop will provide a focused forum on current trends in research on algorithms,discrete structures,and their applications,and will bring together international experts at the research frontiers in those areas to exchange ideas and to present significant new reshlts.     

Efficient aggregation algorithms on very large compressed data warehouses

Multidimensional aggregation is a dominant operation on data warehouses for on-line analytical processing(OLAP).Many efficinet algorithms to compute multidimensional aggregation on relational database based data warehouses have been developed.However,to our knowledge,there is nothing to date in the literature about aggregation algorithms on multidimensional data warehouses that store datasets in mulitidimensional arrays rather than in tables.This paper presents a set of multidimensional aggregation algorithms on very large and compressed multidimensional data warehouses.These algorithms operate directly on compressed datasets in multidimensional data warehouses without the need to first decompress them.They are applicable to a variety of data compression methods.The algorithms have different performance behavior as a function of dataset parameters,sizes of out puts and ain memory availability.The algorithms are described and analyzed with respect to the I/O and CPU costs,A decision procedure to select the most efficient algorithm ,given an aggregation request,is also proposed.The analytical and experimental results show that the algorithms are more efficient than the traditional aggregation algorithms.     

Asymptotic behavior of asynchronous stochastic approximation

The pathwise convergence of a distributed, asynchronous stochastic approximation (SA) scheme is analyzed. The conditions imposed on the step size and noise are the weakest in comparison with the existing ones. The step sizes in different processors are allowed to be different, and the time-delays between processors are also allowed to be different and even time-varying.     

Modeling and analysis of nano-sized GMRs based on Co,NiFe and Ni materials

Magnetic simulation method is introduced to analyze giant magnetoresistances(GMRs)in nanoscale for nano-sized biosensors.A spin valve model with special gridding corresponding to the exchange interaction length is proposed to study the influence of easy axes,exchange coefcients,pinning fields and feature widths on magnetization reversals and hysteresis characteristics of nano-sized GMRs with diferent pinned layer and free layer materials of Co,NiFe and Ni.The switching field is found to be almost linear with the pinning field and decrease with the absolute exchange coefcients and the feature widths for the nano-sized GMRs.The increase rate of each depends on the spin valve stacks.Further investigations into variations of the magnetization distribution reveal that the initial magnetization distribution and the magnetization reversal mode depend greatly on easy axes and materials The dependence on easy axes based mainly on the magnetocrystalline anisotropy is illustrated in detail.     

Multimedia Production and Multi（media） Literacy in Gymnasiums

The article displays the possibilities for introducing multimedia production based on computer science to gymnasiums （general secondary school programs）, where students who usually continue their education at college are educated. The purpose of the research was to prepare an assessment of the situation and recommendations to gymnasiums on how to improve the situation in this field and what options and opportunities appear for schools and the media environment in which they are active. Special attention was paid to the situation of activities （extracurricular activities and optional subjects） related to multimedia production and uses of ICT （information-communication technology）.     

Specification of Initial Shapes for Dynamic Implicit Curve/Surface Reconstruction

The dynamic implicit curve/surface reconstruction demands no special requirement on the initial shapes in general. In order to speed up the iteration in the reconstruction, we discuss how to specify the initial shapes so as to reflect the geometric information and the topology structure of the given data. The basic idea is based on the combination of the distance function and the generalized eigenvector fitting model.     

IEEE The Sixth International Conference on Control and Automation

The 6th Intemational Conference on Control and Automation(ICCA'07)will be held on May 30 to June 1,2007,in Guangzhou,China.The conference is jointly organized by the IEEE Control Systems Chapter,Singapore and IEEE Control Systems Chapter,Guangzhou,China,and spon- sored by South China University of Technology,China and Chinese University of Hong Kong, Hong Kong.It is to create a forum for scientists and practicing engineers throughout the world to present the latest research findings and ideas in the areas of control and automation.     

Analyses and Solutions of Specific Cases in Spatial Angles Calculation

1 Introduction “Spatial Angles Calculations” means that all the calculations of given and unknown parameters are related to calculating angles in 3D space. The functions and relevant parameters in 3D space are much more complicated than that in 2D space, i.e. on a plane. Professor Sun, based on his research conducting for more than a decade, presented a series of new algorithms to calculate angles in space which are valuable in both theory and applications[1]. The authors found that, in g…