Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 233 papers published in subject: > since this site started. |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. Query Expansion Based on Concept Lattice | |||
Xu Wei,Chen Guang | |||
Computer Science and Technology 16 March 2007 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:A query expansion method based on concept lattice is proposed in this paper. It gives the expansion module and an incremental construction algorithm which can accept the new attributes. A simple example illuminates the expansion method. The result shows that the method is in favor of describing the customer’s query concisely and researching the preferably results. | |||
TO cite this article:Xu Wei,Chen Guang. Query Expansion Based on Concept Lattice[OL].[16 March 2007] http://en.paper.edu.cn/en_releasepaper/content/11465 |
2. The Capturing of Water Level by Using the technology of Image Pattern Recognition | |||
Xiayang Zhao,Jinshui Chen | |||
Computer Science and Technology 01 February 2007 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Two methods can be used to measure water level. One is creating a water-level measuring post, then read it by human each time. Another one is using sensor to derive the analog water level, then transform it to digital value. There are many different sensors for water level measuring, such as float model, pressure model, supersonic model, etc. This paper provides a method that derives the image of water level by camera firstly, then by employing the methodology of image preprocessing, we can get the number of the calibrations above the water, in the end conduct the water level value. Using this method, the devices are easily to install, can save cost, and has high precision, so it is suitable to apply in irrigation district. | |||
TO cite this article:Xiayang Zhao,Jinshui Chen. The Capturing of Water Level by Using the technology of Image Pattern Recognition[OL].[ 1 February 2007] http://en.paper.edu.cn/en_releasepaper/content/11006 |
3. Identification and Speed Control of Ultrasonic Motors Based on Modified Immune Algorithm and Elman Neural Networks | |||
Qiao Zhang,Xu Xu | |||
Computer Science and Technology 29 October 2006 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:An improved artificial immune algorithm with a dynamic threshold is presented in this paper. Numerical experiments show that compared with the genetic algorithm and the originally real-valued coding artificial immune algorithm, the improved algorithm possesses high speed of convergence and good performance of preventing the premature convergence. The proposed algorithm is employed to train the network structure, weights, initial inputs of the context units and self-feedback coefficient of the modified Elman network. A novel identifier and controller are constructed successively based on the proposed algorithm. A simulated dynamic system of the ultrasonic motor (USM) is considered as an example of a highly nonlinear system. The novel identifier and controller are applied to perform the speed identification and control of the ultrasonic motors. Numerical results show that both the identifier and controller based on the proposed algorithm possesses not only high convergent precision but also robustness to the external noise. | |||
TO cite this article:Qiao Zhang,Xu Xu. Identification and Speed Control of Ultrasonic Motors Based on Modified Immune Algorithm and Elman Neural Networks [OL].[29 October 2006] http://en.paper.edu.cn/en_releasepaper/content/9071 |
4. A Wireless Mutilmedia Service Design Based on nRF2401 | |||
Chen Chen | |||
Computer Science and Technology 27 September 2006 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, a wireless multi-node multimedia service based on simplified IP protocol is designed, and the realization scheme and main module design method are discussed. The system based on video compression with TMS3C6211 (DSP) is centrally controlled through S3C4210 (ARM), and has a wireless communication on the public frequency 2.4 GHz by means of nRF2401 wireless chip. The system could be applied widely in safety insurance, storage, education and other fields. | |||
TO cite this article:Chen Chen. A Wireless Mutilmedia Service Design Based on nRF2401[OL].[27 September 2006] http://en.paper.edu.cn/en_releasepaper/content/8520 |
5. Three Dimensional Strain Field Morphing | |||
Han-Bing Yan,Shi-Min Hu,Ralph Martin | |||
Computer Science and Technology 12 December 2005 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, we present a new technique for 3D shape morphing using strain fields. Strain is an important geometric quantity used in mechanics to describe the deformation extent of objects. We use it to analyze and control deformation in morphing. Using the position vector field, the strain field between source and target shapes can be obtain. This strain field is then interpolated between zero and its final value to give the position field for intermediate shapes. This method ensures that the 3D morphing process is smooth and no shape jittering or wobbling happens, and that locally, volumes suffer minimal distortion. We also show how to modify the method so that changes of shape (in particular, lengths) vary linearly with time. | |||
TO cite this article:Han-Bing Yan,Shi-Min Hu,Ralph Martin. Three Dimensional Strain Field Morphing[OL].[12 December 2005] http://en.paper.edu.cn/en_releasepaper/content/4233 |
6. Adaptive Multicast in Wireless Networks | |||
Keke Cai,Huaizhong Lin | |||
Computer Science and Technology 30 November 2005 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, we investigated an efficient multicast scheme in wireless networks, which can automatically identify the changes of clients’ preferences. Our scheme utilizes clustering technique to realize the group of similar clients. The goal of our method is to dynamically present information tailored to specific groups of clients and ensure that the multicast information clients received can satisfy their interests. | |||
TO cite this article:Keke Cai,Huaizhong Lin. Adaptive Multicast in Wireless Networks[OL].[30 November 2005] http://en.paper.edu.cn/en_releasepaper/content/3896 |
7. Adaptive Singular Value Extraction (ASVE) as a Method of Image Compression,Hebbian learning | |||
Mei Tian,Siwei Luo,Lingzhi Liao,Lianwei Zhao | |||
Computer Science and Technology 22 November 2005 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper we describe a neural network model-adaptive singular value extraction(ASVE) for multiple singular values extraction based on an extension of the Hebbian learning rule, and then apply it to image compression. The ASVE-based image compression scheme is based on the APEX–like algorithm proposed by Diamantaras. It is shown experimentally that the proposed scheme leads to good compression ratio and satisfactory image quality. | |||
TO cite this article:Mei Tian,Siwei Luo,Lingzhi Liao, et al. Adaptive Singular Value Extraction (ASVE) as a Method of Image Compression,Hebbian learning[OL].[22 November 2005] http://en.paper.edu.cn/en_releasepaper/content/3745 |
8. An-OARSMan: An Obstacle-Avoiding Rectilinear Steiner Tree Algorithm with Good Length Performance | |||
Yu Hu,Tong Jing,Xianlong Hong,feng zhe,hu xiaodong,yan guiying | |||
Computer Science and Technology 01 February 2005 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimal tree (RSMT) construction is an essential part of routing. Since macro cells, IP blocks, and pre-routed nets are often regarded as obstacles in the routing phase, obstacle-avoiding RSMT (OARSMT) algorithms are useful for practical routing applications. This paper focuses on the OARSMT problem and presents an algorithm, named An-OARSMan, based on ant colony optimization. A greedy obstacle penalty distance (OP-distance) local heuristic is used in the algorithm and performed on the track graph. The algorithm has been implemented and tested on different kinds of obstacles. Experimental results show that An-OARSMan can handle complex obstacle cases including both convex and concave polygon obstacles with good length performance. It can always achieve the optimal solution in the cases with no more than 7 terminals. | |||
TO cite this article:Yu Hu,Tong Jing,Xianlong Hong, et al. An-OARSMan: An Obstacle-Avoiding Rectilinear Steiner Tree Algorithm with Good Length Performance[OL].[ 1 February 2005] http://en.paper.edu.cn/en_releasepaper/content/1529 |
9. FORSTer: An Efficient Heuristic for Obstacle-Avoiding Rectilinear Steiner Tree Construction | |||
Yu Hu,Zhe Feng,Tong Jing,hong xianlong,yang yang,hu xiaodong,yan guiying | |||
Computer Science and Technology 01 February 2005 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:acro cells, IP blocks, and pre-routed nets are often regarded as obstacles in VLSI routing phase. Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) algorithms are often used to meet the needs of practical routing applications. However, OARSMT algorithms with multi-terminal nets routing still can not satisfy the requirements of practical applications. This paper presents a 3-step heuristic, named FORSTer, to tackle the OARSMT problem. In Step1, we partition all terminals into some subsets in the presence of obstacles. Then in Step2, we connect terminals in each connected graph with one or more trees, respectively. In Step3, we connect the forest consisting of trees constructed in Step2 into a completed Steiner tree spanning all terminals while avoiding all obstacles. Two algorithms, called ACO-RSMT and GFST-RSMT, are proposed to construct OARSMT in a connected graph in Step2, which are suitable for different situations. This algorithm has been implemented and tested on cases | |||
TO cite this article:Yu Hu,Zhe Feng,Tong Jing, et al. FORSTer: An Efficient Heuristic for Obstacle-Avoiding Rectilinear Steiner Tree Construction[OL].[ 1 February 2005] http://en.paper.edu.cn/en_releasepaper/content/1528 |
10. Multi-layer Mechanism Based Physical Design System Integration | |||
Yu Hu,Tong Jing,Xianlong Hong | |||
Computer Science and Technology 31 January 2005 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:This paper studies and implements an integrated system for VLSI/ULSI physical design. The multi-layer mechanism is used to get great efficiency and speedup. The physical design system is integrated in three different layers, which are called the data interface layer (DIL), the data management layer (DML) and the data display layer (DDL). A quad-tree data structure is used in DDL to accelerate the graphics showing and the interaction between users and the system. | |||
TO cite this article:Yu Hu,Tong Jing,Xianlong Hong. Multi-layer Mechanism Based Physical Design System Integration[OL].[31 January 2005] http://en.paper.edu.cn/en_releasepaper/content/1518 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
|
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated