A large amount of information available on the Web is formatted in HTML tables, which are mainly presentation-oriented and are not suited for database applications. As a result, how to capture information in HTML tabl...
详细信息
ISBN:
(纸本)0769522165
A large amount of information available on the Web is formatted in HTML tables, which are mainly presentation-oriented and are not suited for database applications. As a result, how to capture information in HTML tables semantically and integrate relevant information is a challenge. In this paper, we present a new approach that automatically captures the semantic hierarchies of HTML tables, and semi-automatically integrates HTML tables. It first automatically captures the attribute-value pairs in HTML tables by normalization, and introduces the notion of eigenvalue in formatting information to recognize the headings of HTML tables. After generating the global concepts and global schema manually by defining what data to be integrated, it then learns the lexical semantic set for each global concept, the contexts via labelling the attributes of example HTML tables to their corresponding global concept. Finally, it integrates the data of each source HTML table using the lexical semantic sets and the contexts to eliminate the conflicts and solve the nondeterministic problems in mapping each source schema to the global schema.
We present a new approach to automatically convert HTML documents into XML documents. It first captures the inter-blocks nested structure, then the intra-blocks nested structure, which consists of blocks including hea...
详细信息
The main difficulty arising in designing an *** congestion control scheme lies in the large propagation delay in data transfer which usually leads to a mismatch between the network resources and the amount of admitted...
ISBN:
(纸本)9783540241287
The main difficulty arising in designing an *** congestion control scheme lies in the large propagation delay in data transfer which usually leads to a mismatch between the network resources and the amount of admitted traffic. To attack this problem, this paper describes a novel congestion control scheme that is based on a Back Propagation (BP) neural network technique. We consider a general computer communication model with multiple sources and one destination node. The dynamic *** occupancy of the bottleneck node is predicted and controlled by using a BP neural network. The controlled best-effort traffic of the sources uses the bandwidth, which is left over by the guaranteed traffic. This control mechanism is shown to be able to avoid network congestion efficiently and to optimize the transfer performance both by the theoretic analyzing procedures and by the simulation studies.
We present a new approach that automatically captures the semantic hierarchies in HTML tables, and semi-automatically integrates HTML tables belonging to a domain. It first automatically captures the attribute-value p...
详细信息
Adapted from the concept of views in databases, workflow views are derived form workflows as a fundamental support for workflow inter-operability and visibility by external parties in a web services environment. Howev...
详细信息
Program slicing is widely used in applications such as program comprehension, software testing, debugging, measurement, and reengineering. This paper proposes a new approach for program slicing, called modular monadic...
详细信息
ISBN:
(纸本)0769522092
Program slicing is widely used in applications such as program comprehension, software testing, debugging, measurement, and reengineering. This paper proposes a new approach for program slicing, called modular monadic slicing, basing on modular monadic semantics of the program analysed. We abstract the computation of program slicing as a language-independence entity: slice monad transformer. On the basis of this, we present and illustrate modular monadic dynamic and static slice algorithms in detail. We conclude that modular monadic slicing has excellent flexibility and reusability properties comparing with the existing program slicing algorithms. It computes program slices on abstract syntax directly without intermediate structures such as dependence graphs
Web application testing is concerned with numerous and complicated testing objects, methods and processes. So a testing framework fitting for the properties of Web application is needed to guide and organize all the t...
详细信息
ISBN:
(纸本)0769521401
Web application testing is concerned with numerous and complicated testing objects, methods and processes. So a testing framework fitting for the properties of Web application is needed to guide and organize all the testing tasks. Based on the analysis for Web application characters and traditional software testing process, the process for Web application testing is modeled, which describes a series of testing flows such as the testing requirement analysis, test cases generation and selection, testing execution, and testing results analysis and measurement. Furthermore, the realization techniques are also investigated so as to integrate each testing step and implement the whole testing process harmoniously and effectively. Thus the framework is suitable for the Internet environment and can guide the Web application testing actively and availably.
This paper describes a novel multi-rate multicast congestion control scheme based on the well-known proportional plus integrative control technique, where the control parameters can be designed to ensure the stability...
详细信息
This paper describes a novel multi-rate multicast congestion control scheme based on the well-known proportional plus integrative control technique, where the control parameters can be designed to ensure the stability of the control loop In terms of source rate. The congestion controller is located at the next upstream nodes of multicast receivers and has explicit rate (ER) algorithm to regulate the rate of the receivers. We further analyze the theoretical aspects of the proposed algorithm, show how the control mechanism can be used to design a controller to support many-to-many multi-rate multicast transmission based on ER feedback, and verify its agreement with simulations in the case of bottleneck link appearing in a multicast tree. Simulation results show the efficiency of our scheme in terms of the system stability, high link utilizations, fast response, scalability, high throughput and fairness.
In this paper, we construct an evolutionary algorithm. It yields good performance on a collection of elliptic parameter identification problems. The evolutionary algorithm has a good tolerability for the noise in the ...
详细信息
ISBN:
(纸本)0780385152
In this paper, we construct an evolutionary algorithm. It yields good performance on a collection of elliptic parameter identification problems. The evolutionary algorithm has a good tolerability for the noise in the observed data. Even when the noise level is up to 10%, we can also get such a good result. The result of numerical experiments shows explicitly that the algorithm is very fit for solving this kind of inverse problem but not very sensitive to the noise.
Dynamic optimisation problems are becoming increasingly important; meanwhile, progress in optimisation techniques and in computational resources are permitting the development of effective systems for dynamic optimisa...
详细信息
Dynamic optimisation problems are becoming increasingly important; meanwhile, progress in optimisation techniques and in computational resources are permitting the development of effective systems for dynamic optimisation, resulting in a need for objective methods to evaluate and compare different techniques. The search for effective techniques may be seen as a multi-objective problem, trading off time complexity against effectiveness; hence benchmarks must be able to compare techniques across the Pareto front, not merely at a single point. We propose benchmarks for the dynamic travelling salesman problem, adapted from the CHN-144 benchmark of 144 Chinese cities for the static travelling salesman problem. We provide an example of the use of the benchmark, and illustrate the information that can be gleaned from analysis of the algorithm performance on the benchmarks.
暂无评论