Orthogonal drawings of graphs with vertex and edge labels.docx

1、Orthogonal drawings of graphs with vertex and edge labelsMagnetic Resonance Imaging, Volume 21, Issue 10, December 2003, Pages 1175-1189G. Garreffa, M. Carn, G. Gualniera, G. B. Ricci, L. Bozzao, D. De Carli, P. Morasso, P. Pantano, C. Colonnese, V. Roma, B MaravigliaShow preview| Related articles|R

2、elated reference work articles Purchase$ 31.50737Edge enhancement by local deconvolutionOriginal Research ArticlePattern Recognition, Volume 38, Issue 5, May 2005, Pages 661-672O. Laligant, F. Truchetet, A. DupasquierClose preview| Related articles|Related reference work articles AbstractAbstract |

3、Figures/TablesFigures/Tables | ReferencesReferences AbstractIn this paper a new approach for blurred image restoration is presented. Our algorithm is based on human vision which zooms back and forth in the image in order to identify global structures or details. Deconvolution parameters are estimate

4、d by an edge detection and correspond to the ones of a chosen edge detection model. The segmentation is obtained by merging multiscale information provided by multiscale edge detection. The edge detection is achieved by using a derivative approach following a generalization of CannyDeriche filtering

5、. This multiscale analysis performs an efficient edge detection in noisy blurred images. The merging leads to the best local representation of edge information across scales. The algorithm deals with a mixed (coarse-to-fine/fine-to-coarse) approach and searches for candidate edge points through the

6、scales. Edge characteristics are estimated by the merging algorithm for the chosen model. Scale, direction and amplitude informations allow a local deconvolution of the original image. The noise problem is not considered in this work since it does not disturb the process. Results show that this meth

7、od allows non-uniformly blurred image restoration. An implementation of the whole algorithm in an intelligent camera (DSP) has been performed.Article Outline1. Introduction2. Edge detection 2.1. Edge model2.2. Edge detector2.3. Responses and performances of the detectors 2.3.1. Response2.3.2. Edge l

8、ocalization2.3.3. Signal to noise criterion2.4. Strategy for restoration3. Edge image representation 3.1. Multiscale edge detection3.2. Influence of a neighbor edge3.3. Merging4. Restoration 4.1. Model parameters estimate4.2. Deconvolution4.3. Results5. ConclusionAppendix A. Response of the detector

9、s to the edge modelAppendix B. LocalizationAppendix C. Signal over noise ratioAppendix D. Scale of the detectors for maximum in localizationReferencesVitaePurchase$ 31.50738Algorithms for optimal multi-resolution quantizationOriginal Research ArticleJournal of Algorithms, Volume 50, Issue 1, January

10、 2004, Pages 1-22Sorina Dumitrescu, Xiaolin WuClose preview| Related articles|Related reference work articles AbstractAbstract | ReferencesReferences AbstractMulti-resolution quantization is a way of constructing a progressively refinable description of adiscrete random variable. The underlying disc

11、rete optimization problem is to minimize an expected distortion over all refinement levels weighted by the probability or importance of the descriptions of different resolutions. This research is motivated by the application of multimedia communications via variable-rate channels. We propose an O(rN

12、2) time and O(N2logN) space algorithm to design a minimum-distortion quantizer of r levels for a random variable drawn from an alphabet of sizeN. It is shown that for a very large class of distortion measures the objective function of optimal multi-resolution quantization satisfies the convex Monge

13、property. The efficiency of the proposed algorithm hinges on the convex Monge property. But our algorithm is simpler (even though of the same asymptotic complexity) than the well-known SMAWK fast matrix search technique, which is the best existing solution to the quantization problem. For exponentia

14、l random variables our approach leads to a solution of even lower complexity: O(rN) time and O(NlogN) space, which outperforms all the known algorithms for optimal quantization in both multi- and single-resolution cases. We also generalize the multi-resolution quantization problem to a graph problem

15、, for which our algorithm offers an efficient solution.Purchase$ 31.50739The effects of static, dynamic and fatigue behavior on three-dimensional shape optimization of hip prosthesis by finite element methodOriginal Research ArticleMaterials & Design, Volume 28, Issue 8, 2007, Pages 2269-2277Oguz Ka

16、yabasi, Bulent EkiciClose preview| Related articles|Related reference work articles AbstractAbstract | Figures/TablesFigures/Tables | ReferencesReferences AbstractThe finite element method, one of the most advanced simulation techniques in solid mechanics, is used for orthopedic biomechanics. It is

17、used as a tool for the design and analysis of total joint replacement and other orthopedic devices. The design of hip joint prostheses is a complex process that requires close co-operation between engineers and surgeons. To design highly durable prostheses one has to take into account the natural pr

18、ocesses occurring in the bone. One of the most important factors in the implant design is to reduce stress on the femur and the bone-cement. The purpose of this study is to investigate the behavior of newly designed implants under body weight load during stumbling by parametric modeling. Two differe

19、nt implant materials have been selected to study appropriate material and fatigue life resistant. In the parametric design, the prosthesis functional requirement is that the locking of stem to the femur head using cement should be strong enough to preclude unlocking during the life time of a patient

20、 and to prevent sliding of the implant into the bone-cement. In the finite element analysis, physical interactions among joints are simulated by contact algorithms. The femurbone-cement interface and the bone-cementimplant interface surface to surface contact algorithms of ANSYS were used for implic

21、it static analysis. Three stem-cement interface conditions are considered: completely bonded, debonded with coefficient of friction 0, and debonded with coefficient of friction 0.2. In the analysis, a viscoelastic material model is utilized for bone-cement. Numerical shape optimization is applied to

22、 the prosthesis. The results of finite element simulations are compared with Charnleys implant results and appropriate material for the implant is proposed. The best stem shapes fulfilling the desired functional requirements are chosen for the design. These findings can form a base for further resea

23、rch such as the optimum design of bone-implant hip prosthesis.Article Outline1. Introduction2. Methods, geometric and finite element modeling 2.1. Methods2.2. Parametric and geometric modeling2.3. Finite element modeling3. Results4. ConclusionReferencesPurchase$ 41.95740Assisting conceptual design o

24、f building structures by an interactive description logic based plannerOriginal Research ArticleAdvanced Engineering Informatics, Volume 17, Issue 1, January 2003, Pages 41-57Michael Eisfeld, Raimar SchererClose preview| Related articles|Related reference work articles AbstractAbstract | Figures/Tab

25、lesFigures/Tables | ReferencesReferences AbstractDesigning structural configurations for todays building structures is a challenging engineering activity that needs to be supported. Existing systems often cannot support the engineer in designing a structural configuration with a robust global load t

26、ransfer. In this paper, we discuss an interactive planning algorithm that assists the engineer in the conceptual design task by knowledge about structure. Central to our approach is the use of adapted inference services of a description logic reasoner that controls the global load transfer of the st

27、ructural configuration under development and the design process on their evaluation results. We introduce the expressive description logic language to represent structural knowledge acquired from practitioners. A hierarchical planning language on top of it used for representing the dynamic design pr

28、ocess.Article Outline1. Introduction2. Problem formulation3. Computational conceptual design task 3.1. The language and the reasoning services for conceptual design support3.2. The planning language on 3.3. Interactive algorithm ConEd4. Detailed example5. Related work6. ConclusionsAcknowledgementsRe

29、ferencesVitaePurchase$ 41.95741A mars communication constellation for human exploration and network scienceOriginal Research ArticleAdvances in Space Research, Volume 45, Issue 1, 4 January 2010, Pages 183-199Francesco Castellini, Andrea Simonetto, Roberto Martini, Michle LavagnaClose preview| Relat

30、ed articles|Related reference work articles AbstractAbstract | Figures/TablesFigures/Tables | ReferencesReferences AbstractThis paper analyses the possibility of exploiting a small spacecrafts constellation around Mars to ensure a complete and continuous coverage of the planet, for the purpose of su

31、pporting future human and robotic operations and taking advantage of optical transmission techniques. The study foresees such a communications mission to be implemented at least after 2020 and a high data-rate requirement is imposed for the return of huge scientific data from massive robotic exploration or to allow video transmissions from a possible human outpost. In addition, the set-up of a communication constellation around Mars would give the opportunity of exploiting this multi-platform infrastructure to perform network science, that would largely