The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The following topics are dealt with: Web service; computer network; information processing; machine learning; mobile commerce; cryptography; information security; risk analysis; electronic commerce; electronic payment; innovative e-business model; enterprise integration application; information hiding and watermarking; intelligent system and international finance.
Genetic Algorithms are excellent approaches to solving complex problem in optimization with difficult constraints. The vehicle routing problem (VRP) has been shown as an NP-complete problem. On the foundation of stressing the limitations of the network in VRP this paper introduces a finite automaton (FA) to produce individual population and implement a new evolution way using genetic algorithm. Besides,...
With the fast development of the technology in Database and Internet, excessive information has become a problem that decision makers engage in electronic commerce have to affront. This paper firstly establishes the decision table for excessive data, then reduces knowledge of the decision table, and obtains the best rules. This can reduce the redundancy of the data, and improve the efficiency of knowledge...
For topic distillation and topic exploration, a rich resource is the information from hyper linked Web pages. The anchor text, an objective summary of Web pages, is of strong topic and semantic indication. As to the triangular relationship of the hub Web page, anchor text, and authoritative Web page, a good hub Web page is the one that is directed to a good authoritative Web page through the authoritative...
High payload information hiding schemes with the good visual quality of stego images are suitable for steganographic applications such as online content distribution systems. This paper proposes a novel steganographic scheme based on the (7, 4) Hamming code for digital images.The proposed scheme embeds a segment of seven secret bits into a group of seven cover pixels at a time. The experimental results...
In 2000, a new type of multi-secret sharing scheme, called the multiple secret sharing scheme, is proposed by Chien et al., in which more than one secret instead of only one secret can be shared in the same sharing session. In 2004, Yang et al. proposed another implementation of the above scheme based on Shamir's secret sharing to reduce the complexity of computation. In 2005, Pang et al. also proposed...
A new algorithm of Web text clustering mining is presented, which is based on the Discovery Feature Sub-space Model (DFSSM). This algorithm includes the training stage of SOM and the clustering stage, which characterizes self-stability and powerful antinoise ability. It can distinguishes the most meaningful features from the Concept Space without the evaluation function. we have applied the algorithm...
Data reduction, which can simplify large scale data and not lose useful information, is an important topic of knowledge discovery, data clustering and classification. Aiming to solve the current problem that continuous attribute in algorithm of clustering or classification has to be discrete, a new algorithm of data reduction based on cloud model is put forward. By use of cloud model, this algorithm...
A typical characteristic of Bayesian network topology is dependences of each variable within the network, which makes it impossible to optimize variables. This problem is solved by the developed approach to Bayesian network construction based on self-organizing genetic algorithm (SGA) from knowledge base. The genetic algorithm (GA) is improved by self-organizing organism and an effective operator...
In this paper, an efficient algorithm for the computation of Tate pairing on general curves is presented. Our approach is to change the binary representation of the involved integer to its non-adjacent form at first, and then pre-organize this form to make further improvement on its efficiency. We also show this algorithm has better performance than BMX and LHC algorithms.
Since computation of grids enable the sharing, selection, query and aggregation of geographically distributed resources for solving large-scale problems, developing mechanisms for grid resource scheduling is a complex undertaking problem. We had investigated several famous schedule methods proposed by Nimrod-G, a famous computational economy framework for regulating the supply and demand for resources...
Traditional workflow management systems (WfMS) is hard to meet the requirements of the dynamic, flexible modern business process. In recent years, Web services technology has been developing. It not only makes the activity in workflow by Web services form, but also workflow itself is invoked by Web services, especially semantic Web services technology is developing, which makes it possible to compose...
This paper introduces improving rate and proposes the incremental mining algorithm for optimizing association rules based on CBA mining algorithm. Comparing with the traditional algorithm, the improved algorithm is fast, efficient in incremental data mining and can find trends in association rules. The decision making reliability is enhanced by the association rules obtained from the improved algorithm...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.