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 13 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. Curvature Computing Based on Shape Operator for Implicit Surfaces | |||
Mao Zhihong | |||
Computer Science and Technology 16 December 2013 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The shape operator, whose eigenvalues and eigenvectors are the principal curvature values and directions, have been widely used to compute surface curvature for a parametric surface. In this paper we present mathematical representations to compute the surface curvatures based on the shape operator on implicit surfaces. Compared to the existing curvature formulae for implicit surfaces, our curvature formulae are easy to understand and simple to compute. Moreover, we bridge the gap between the classical differential geometry theories and the curvature computing formulae for implicit surfaces. Finally, we demonstrate our method with several examples. | |||
TO cite this article:Mao Zhihong. Curvature Computing Based on Shape Operator for Implicit Surfaces[OL].[16 December 2013] http://en.paper.edu.cn/en_releasepaper/content/4574762 |
2. An Augmented Lagrangian Method for VLSI Global Placement Optimization | |||
Li Weiguo,Chen Jianli,Zhu Wenxing | |||
Computer Science and Technology 27 December 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Ignoring some cell overlaps, global placement computes the bestposition for each cell to minimize some cost metric (e.g., totalwirelength, density overflow). It is a crucial step in very largescale integration(VLSI) physical design, since it affectsroutability, performance, and power consumption of a circuit. Inthis paper, we propose an Augmented Lagrangian method to solve theVLSI global placement. In this method, a cautiousdynamic density weight increasing strategy is used to balance thewirelength and density constraint. We incorporated our method intoNTUplace3's global placement framework,and tested it on the IBM mixed-size benchmark circuits.Experimental results show that it obtains high-quality results in areasonable running time. | |||
TO cite this article:Li Weiguo,Chen Jianli,Zhu Wenxing. An Augmented Lagrangian Method for VLSI Global Placement Optimization[OL].[27 December 2012] http://en.paper.edu.cn/en_releasepaper/content/4509484 |
3. CAH B-Spline Curves and Its Applications | |||
Xie Jin | |||
Computer Science and Technology 28 May 2012 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:A kind of quasi-cubic uniform B-spline curves (briefly CAH B-spline curves) unified by algebraic and hyperbolic polynomial using weight method is presented in this paper. Here weight coefficients are called weight parameters. The interval [0, 1] of weight parameter values can be extended to [-62.1748, 12.6061]. The curves can include cubic B-spline curve as special case and reach the both sides of cubic B-spline curve. Not only can the shape of the curve be adjusted totally or locally, but also the type of some segments of a blending curve can be switched by taking different values of the weight parameters. If letting weight parameters be 31.0739, the curve can interpolate certain control points directly without solving system of equations. The defined curves can be used to precisely represent some conics and transcendental curves with the weight parameter and the positions of the control points chosen properly. | |||
TO cite this article:Xie Jin. CAH B-Spline Curves and Its Applications[OL].[28 May 2012] http://en.paper.edu.cn/en_releasepaper/content/4479870 |
4. Research on Assembly Sequence Planning Based on Improved Slope One Algorithm | |||
JIN Yu,HOU Wenjun,YANG Fuxing | |||
Computer Science and Technology 09 October 2011 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:According to the characteristics and needs of complicated products, a method for handing assembly sequence based on improved Slope One algorithm was proposed. On the basis of that the network graph of assembly relationship was constructed, and a method for simplifying it was proposed by expressing elliptically same parts, identifying and hiding fasteners. In this paper, Slope One algorithm was initially introduced into the assembly sequence planning, and it was improved according to the problems to be resolved. In the meantime, particle swarm optimization algorithm was introduced into the feedback of the recommendation result. The method has been proved that it was not only used to obtain a good recommendation of assembly sequence but also sensitive to the individuation of designers. | |||
TO cite this article:JIN Yu,HOU Wenjun,YANG Fuxing. Research on Assembly Sequence Planning Based on Improved Slope One Algorithm[OL].[ 9 October 2011] http://en.paper.edu.cn/en_releasepaper/content/4445176 |
5. Applying Collaborative Filtering Techniques for Individual Fashion ecommendation | |||
Lei Jianlan,Wang Jin,Lu Guodong | |||
Computer Science and Technology 28 December 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Collaborative filtering (CF) technique is the most successful method for recommendation system. In this article, we developed a fashion recommendation system by using CF technique. In order to improve on data sparseness problems in CF technique, firstly we built users’ similarities based on users’ background information which is related with fashion, then the neighbors’ predicting ratings were filled into the U-I rating matrix in advance before the traditional collaborative filtering. While computing the background information similarities, we develop a hybrid similarity model which can deal with different types of properties. The method can solve the data sparseness of U-I rating matrix effectively. | |||
TO cite this article:Lei Jianlan,Wang Jin,Lu Guodong. Applying Collaborative Filtering Techniques for Individual Fashion ecommendation[OL].[28 December 2009] http://en.paper.edu.cn/en_releasepaper/content/38147 |
6. TRIZ in 3D Garment CAD | |||
Li Weilong,Wang Jin,Lu Guodong | |||
Computer Science and Technology 28 December 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The 40 inventive principles of TRIZ are useful methods for solving engineering design problem. 3D garment CAD is significant for improve the efficiency and level of fashion design. This article describes the application of these principles of TRIZ in three-dimensional garment CAD. Based on the characteristics and requirements of fashion design, the author analyze the basic meaning of these inventive principles, and use them in the research and application three-dimensional garment CAD, such as decomposition and combination of apparel components, clothing structural design, setting of clothing color and pattern library, inter-conversion between three-dimensional mesh of clothing and two-dimensional pieces and so on. Some examples show that the application of these principles is feasible and effective. | |||
TO cite this article:Li Weilong,Wang Jin,Lu Guodong. TRIZ in 3D Garment CAD[OL].[28 December 2009] http://en.paper.edu.cn/en_releasepaper/content/38143 |
7. A Novel Fast and Effective Hierarchical Thermal-Aware Floorplanning Algorithm | |||
Pingjie Cheng,Ning Xu | |||
Computer Science and Technology 24 February 2009 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Hierarchical approaches are employed in current floorplanning algorithms for scaling to large number modules. With the development of VLSI technology, the thermal problem has been emerged as one of the key issues for IC design. In this paper, we propose a novel power density clustering method to guide the optimization of floorplanning, which aims to efficiently reduce the hotspots while optimizing design metrics such as area and total wirelength.The experimental results with GSRC benchmarks show that the thermal effect is well controlled so that the temperature of ”hot spots” has decreased on the chip. Our algorithm is compared with the state-of-the-art thermal-aware floorplanning algorithm Hotspot Floorplan, it can reduce the max temperature by 3% while saving time by about 300%. | |||
TO cite this article:Pingjie Cheng,Ning Xu. A Novel Fast and Effective Hierarchical Thermal-Aware Floorplanning Algorithm[OL].[24 February 2009] http://en.paper.edu.cn/en_releasepaper/content/29596 |
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