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.
This paper is to practice the art of three-dimensional map based on a university campus which can be used for tourism. The spatial elements and animated character are initially built in Maya, and exported into Virtools. This paper explores ways to make the system interactive and view in the web using Virtools. This paper also presents a general system architecture which is able to be reused in other...
A method of page segmentation and recognition based on generalized hidden Markov model is present in this paper, according to the page content as well as the structural configuration. It can effective carry on the division to the homepage, thus distinguishes each homepage block part with GHMM. The experimental result indicated that, compares with the original page segmentation algorithm, this algorithm...
Due to the difference between Web page and plain text document, the concept of Web object is introduced in this paper. Besides, the supposed state transition and the emission symbol conditions are improved based on Pseudo two dimension hidden Markov model (P2D-HMM), and a novel web objects information extraction method is proposed. Finally, through an example, it shows that the proposed method has...
This paper presents a new algorithm of Web page classification, CUCS(Combined UC and SVM), for large training set. CUCS combines the advantages of SVM (Support Vector Machine) and UC (Unsupervised Clustering), achieving high precision and fast speed. In the training stage, CUCS gets clustering centers, which include positive example centers and negative ones, by means of UC. Then CUCS prunes training...
Based on the problem of TB level mass data lacking of parallel patterns which is distributed on Earth and accessed by Internet, we focus on the research of parallel computing architecture structure--virtual cluster based on cloud computing. Meanwhile, the parallel data mining algorithm is studied, and the effectiveness of parallel data mining algorithm based on this platform is proved.
In VoIP (Voice over Internet Protocol) applications, packet loss affects the received speech quality greatly. PCM (Pulse Code Modulation) coders are often used for VoIP and also face such problems. In this paper a side information based packet loss recovery algorithm is proposed, which introduces a small part of corrective information to provide an enhanced reconstruction of the lost packets. A virtual...
Due to the differences between Web page and plain text document, the concept of Web object is introduced in this paper. Besides, the supposed state transition and the emission symbol conditions are improved based on generalized hidden Markov model (GHMM), and a novel web objects information extraction method is proposed. Finally, through an example, it shows that the proposed method has a very high...
Multicast transmission is a key technology in Internet, which can send the same information simultaneously to several receivers. A new multicast routing algorithm based on network coding is proposed in this paper, searching the routing groups from source to each receiver by using Dijkstra reduction network. Simulation results show that, compared with traditional multicast routing algorithms, performances...
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.