Abstract:Analogously to what occurs in other European Countries,the current policy of the European Union concerning the economic and monetary union is having a dramatic impact on Public Administration and utilities in Italy.As for Public Administrations,efficient services have to be provided,and even distributed via the Internet,to citizens and enterprises.On the other hand,the deregulation of the market is aimed at promoting a higher level of competitiveness:today also "natural" monopolies (like energy,gas,water,and telecommunications) are forced to competition.This new paradigm requires an organizational change which has a significant impact on information systems and on their most valuable component:the database.In this paper,the authors present the impact of the European policy on databases in two case studies:Regione Lombardia,an Italian Local Public Administration located in Milan,and ACEA,an Italian Energy Undertaking located in Rome.The authors show common issues related to the impact of the new legislation on database design and maintenance.In particular,the authors discuss issues related to the re-design of databases to be federated or split,as a consequence of the new legal context.

Abstract:A novel public key encryption scheme with multiple private keys is presented.The security of this encryption method depends on the difficulty of the decoding problem for block codes over finite fields.Based on the encryption method,a pirate tracing scheme is proposed for the copyright protection of digital data.In this tracing scheme,for each legal copy of digital data there is a codeword buried in the corresponding decryption software or box.The scheme can extract the codeword efficiently,and uncover all authorized users involved in making the illegal copy by using a proper decoding algorithm if the number of such users is not more than the error-correcting capacity of a given code.Compared with known tracing schemes,this scheme is efficient in performance,and easy in implementation.Potential applicable areas of the encryption method include the protection of copyrights of various forms of digital data such as computer software and audio/video products.

Abstract:In this paper,the author redesigns web collaboration system framework using component management model.Component management model gets the connection information between components and high-level development knowledge with Key,Content,and Configuration information.It can show the connection information between components with Key and Content information of each component and support the design knowledge of the sub system of specific application also.The author introduces component management model for easier management of the framework components and easier use of framework itself.

Abstract:The computational and compositional features are very important while constructing parallel software for the workstation clusters.However,lack of suitable supporting environment for parallel software development makes most existing distributed parallel software systems very weak in these two aspects,especially in the compositional feature.In this paper,a distributed object based framework for parallel computation is proposed.The goal of the framework is to achieve high efficiency for parallel computing,to construct a mechanism to encapsulate and reuse parallel programs,and to guarantee load balancing and fault tolerance.The framework is a four-layer model that includes an object-group layer and a mobile object layer.The experimental results verify the efficiency of the scheme.

Abstract:With the evolvement of the Internet, the number of users and applications using Internet increases very quickly. Congestion has become an important issue. To keep the stability of the whole network, congestion control algorithms have been extensively studied. There are two primary components in congestion control. One is the source algorithm executed by host computers and edge devices, the other is the link algorithm executed by network devices. In this paper, the basic concepts of congestion control algorithm,and the research no source algorithm and link algorithm of end-to-end congestion control is summarized.Further research problems in this area are also discussed.

Abstract:The integration of IP TE (traffic engineering) and DS (differentiated service) is a new method to enhance QoS (quality of service) guarantee in network. In this paper, based on analyzing the requirement of DS for TE, the integrating framework is constructed, a schedule method suitable to TE is put forward, as well as the principle and the method of partitioning and mapping. This method carries out traffic splitting according to table.not only distinguishes the priorities of packets forwarded in DS domain, but also guarantees the requirements for delay and disting uishes the priorities ofr delay and synchronization of data flow.

Abstract:In this paper, client-proxy-server based volume callback algorithms are introduced to address two key issues that face the traditional algorithms: scalability and client disconnection. Proxies extend scalability by alleviating loading on servers. Volume based callback accelerates validation process and eliminates revalidation bottleneck when reconnected. Simulation results show that the improved volume callback algorithms save validation messages by 86% compared with the traditional algorithms. And its overall performance is close to ATTL(adaptive time to live)algorithm.

Abstract:Firewall, VPN (virtual private network) and NAT (network address translation) are traditional network security technologies and each has different function. But some network security systems cannot combine these technologies, cannot give attention to efficiency of system, and scarce of fine-granularity inner security management. In order to solve these problems, an integrated and scalable network security system, NEUSec (NEUsoft security system), is presented in this paper, which integrates packet-filter, VPN and NAT technologies(NEUsoft security systenm),is presented in this paper,which integrates packet-filter,VPN and NAT technologies under Linux environment,combines NAT and proxy technogies to construct scalable virtual proxy server,the radix-based security policy search mechanism is presented,and the RBAC(role-based access control)technology is inrtod to solve inner security management.Compared with other security systems,NEUSes,is an all-around and scalable security system and gives an attention to efficency.It has achieved a satisfactory result in practice.

Abstract:It is difficult to control the motion of the assembling parts precisely with current virtual reality I/O devices during virtual assembly. In this paper, a semantics recognition method is presented to capture the user抯 intention. A motion guidance method based on semantics recognition and constraint recognition is provided to help the user move or rotate the parts in the virtual environment freely and precisely. The semantics recognition is implemented according to the matching of spatial position, assembly relationship on assembly task-level rather than lower-level geometry constraints.The methods are implemenred in the development of VIRDAS(virtual reality design and assembly system)and a virtual assembly example of automotive engine component is also given in this paper.

Abstract:A constrained bin packing problem with start-up space (SBPP) is proposed in this paper, in which an additional start-up space is needed if different items are put into a same bin. The problem has many applications such as job allocation, multiprocessor scheduling and real-world packing. A linear offline approximation algorithm C-NF is presented to solve the SBPP problem. It is proved that the C-NF algorithm has an asymptotic worst-case performance ratio of 2, which is independent of the size of start-up space.And the experimental average-case performances of C-NF are given.Also,the online property of SBPP is studied.It is pointed out that most of the classic online algorithms cannot offer definite worst-case performance ratios when applied on SBPP.And an online algorithm is proposed with a finite asymptotic worst-case performance ratio for any start-up space.

Abstract:In this paper, an approximation approach is presented for offsetting curve by approximating the normal curve of the base curve using Legendre least-square polynomials. After computing the perturbed vectors, the offset curve can be obtained by shifting the control points of the base curve. By the comparison with other approaches based on shifting control points, such as the methods by Tiller, Cobb, Coquillart and Elber, etc., it shows that the approximated offset curve obtained by this approach has the least numder of control points and the least time of subdivision for the curves.The approximated offset has the same form with the original curve.This approach is of intuition and of easy implementation.It,has imposing foreround of application.

Abstract:The SVM (support vector machines) is a classification technique based on the structural risk minimization principle. In this paper, another method is given to implement the structural risk minimization principle. And an exact maximal margin algorithm is proposed when classification problem is linearly separable. The linearly non-separable problem can be changed to separable linearly by using the proposed concept of the contraction of a closed convex set. The method in this paper has the same function and quality as SVM and Cortes'soft margin algorithm,but its theoretical system is simple and strict,and geometric meaning of its optimization probem is very clear and obvious.

Abstract:Discovering frequent patterns in multiple time series is important in practices. Methods appeared in literatures assume that the multiple time series are synchronous, but in the real world, that is not always satisfied, in most cases they are non-synchronous. In this paper, an algorithm for discovering frequent patterns in non-synchronous multiple time series is proposed. In this algorithm, first, the time series is segmented and symbolized with the linear segment representation and the vector shape clustering method,so that each symbol can represent aprimitive and independent pattenr.Thenthe minimal occurrence representaion of time series and the association rule discovery algorithm proposed by Agrawal is combined to extrac frequent patterns of various structures from non-synchonous multiple time series.Compared with the previous methods,the algorithm is more simple and flexible,and does not require time series to be synchronous.Experimental results show the efficency of the algorithm.

Abstract:By grouping similar Web documents into clusters, the search space can be reduced, the search accelerated, and its precision improved. In this paper, a new clustering algorithm is introduced. In the clustering technique, topics are represented according to VSM (vector space model), documents are represented according to topics, and the relation between documents and topics is viewed in a transactional form, each document corresponds to a transaction and each topic corresponds to an item. A frequent item sets can be found by using the association riles discovery algorithm,corresponding documents can be seen as initial clusters.These clusters are merged according to the disance between clusters,or divided aivided according to the strength of connection among documents of a cluster.By real Wed documents,experimental results show the algorithm's effectivenss and suitability for tackling the overlapping clusters inhered by documents.

Abstract:In allusion to the deficiency of image detecting ability of current network security system, anintelligent network security system model is developed based on image content detecting. It adopts aninformation-feedback and knowledge-aid mechanism, brings forward an image content retrieval algorithm based on layout feature extraction and multi-agent technology as the kernel of image content detecting-analysis model, and realizes a security-auditing mechanism based on genetic algorithm to audit and mine the history knowledge base intelligently.Therefore,it can improve the security and reliability of yhe network system.Furthermore,a prototype of the system model is described.

Abstract:Lees multivalued bidirectional associative memory operating on a complex domain (CDBAM) extends Koskos BAM (bidirectional associative memory) not only to complex domain but also to multivalued situation in favor of associating on multivalued model. Based on the CDBAM, a new extended model, ICDBAM (intraconnected multivalued bidirectional associative memory operating on a complex domain), is presented in this paper. The stability of the new model in synchronous and asynchronous updating modes, is proven by defining an cenergy function such that it can ensure all the training pattern pairs to become its asymptotically stable points.Inaddition,it eliminates CDBAM's complementing encoding problem.The computer simulations show that the proposed model has higher storage capacity and better error-correcting calability than CDBAM.

Abstract:The connections of traditional ANN (artificial neural network) are fixed, and the learning algorithm is to change the weight of every connection. In this paper, a new model is presented which is based on the characteristic of physiological neuron, and as a unit, a homogenous associative memory neural network was built, the learning algorithm was performed to change the structure of the neural network. The characteristic of this algorithm sets the input and output field of a neuron, adjusts the connection between synapse and axon and parallel iterative self-mapping.The matrix model of the network and the experiment results are also presented in this paper.

Abstract:Agent organization is an important research topic of MAS (multi-agent systems). The explicit expressions of Agent organization structure are more widely used in the implementation of Agent organizations. A formal semantics of processes of Agent organization structure design is given in this paper based on p-calculus and the chemical abstract machine (CHAM). Components associated with the organization structure design are taken as molecules of CHAM and use the executions of the CHAM to express procedures of Agent organization structure formation.This formal semantic method is both accurate and direct.It is convenient to implement Agent organization structure design and improves the work of Ferber and Xu about implementation and semantics of Agent oranization and organization structure.

Abstract:On the basis of Ritter real morphological associative memory (RMAM), complex lattices and complex rings are defined respectively through introducing two ordinal relationships between complex numbers, consequently the same recall rules are obtained as RMAM in complex domain and construct a class of complex MAM (CMAM), called extended RMAM. The CMAM can directly process complex signals such as FFT-ed complex data. In this paper, the convergence of the proposed model is proved, its error-correction capability and storage capacity are analyzed,and at the same time the corresponding theorems and properties similar to the RMAM are obtained.Further the difference between the CMAM andother neural networks such as Hopfield network is stressed.The carried-out computer simulations show its feasibility.

Abstract:By combining Zerotree, bit plane and arithmetic coding together, a new image compression algorithm based on Zerotree and bit plane called ZBP is presented in this paper. ZBP exploits the correlation among the Zerotree symbols and the bit data of wavelet coefficients, so the efficiency of arithmetic coding is improved. Experimental results demonstrate that ZBP performs better compression than the existing wavelet imagecompression algorithms.

Abstract:In this paper, an enhanced algorithm is proposed for page clustering, which considers both the content of web pages and the site topology. By introducing the content-link ratio and the group inter-link degree and modifying the computation of the support of frequently visited page group, the algorithm can increase theinterestingness of the mining result. The experimental results show that the algorithm converges more rapidly and could find out more interesting page groups than the normal algorithm.

Abstract:Recently, the study on the multifractal nature of Internet traffic has been becoming a hot-point in the field of study on communication networks. There have been some results on the problem of the source ofmultifractal in Internet traffic, most of which think that the source comes from the hierarchical feature of networks protocols. However, these results ignore the fact that the traffic load in modern Internet is very heavy, which makes important effects on traffics. After analyzing the existing results, it is found that,in the case of heavy loading,the source of the multifactal in Internet traffic is the aggregation of lots of TCP(transmission control protocol)connections,as well as the particular sending behavior of TCP protocol.To support the find,means of wavelet analysis,simulation,and practical data calculating are used.As the find is concluded on the base of practical case in Moden Internet,it is more approach to the truth than existing results,and is more valuable in neworking designing and performance evaluating.