检索结果-内蒙古大学图书馆

Medial profiles for modeling deformation and statistical analysis of shape and their use in medical image segmentation

引用

International Journal of shape Modeling 2004年第2期10卷 187-209页

作者： Hamarneh, Ghassan Abu-Gharbieh, Rafeef Mcinerney, Tim School of Computing Science Simon Fraser University Burnaby BC V5A 1S6 Canada Department of Electrical and Computer Engineering University of British Columbia Vancouver BC V6T 1Z4 Canada Department of Computer Science Ryerson University Toronto Ont. M5B 2K3 Canada

We present a novel medial-based, multi-scale approach to shape representation and controlled deformation. We use medial-based profiles for shape representation, which follow the geometry of the structure and describe general, intuitive, and independent shape measures (length, orientation, and thickness). Controlled shape deformations (stretch, bend, and bulge) are obtained either as a result of applying deformation operators at certain locations and scales on the medial profiles, or by varying the weights of the main variation modes obtained from a new hierarchical (multi-scale) and regional (multi-location) principal component analysis of the medial profiles. We demonstrate the ability to produce controlled shape deformations on a medial-based representation of the corpus callosum. We show how this control of shape deformations facilitates the design of a layered framework for image segmentation and present results of segmenting the corpus callosum from 2D mid-sagittal magnetic resonance images of the human brain. Furthermore we show how the medial-based representation facilitates hierarchical. deformation-specific statistical shape analysis of segmented corpora callosa. © World scientific Publishing Company.

关键词： Medical imaging

来源：评论

学校读者我要写书评

暂无评论

Utilization of time varying event-based customer interruption cost load shedding schemes

Utilization of time varying event-based customer interruptio...

引用

International Conference on Probabilistic Methods Applied to Power systems (PMAPs)

作者： W. Wangdee R. billinton Department of Electronic Computer Engineering The Hong Kong University of Science and Technology Kowloon Hong Kong SAR People’s Republic of China Electrical and Electronics Engineering R V College of Engineering Bangalore India

Load curtailments occurring under emergency conditions can have significant monetary impacts on the system customers. Customer satisfaction is becoming increasingly important in the new deregulated electric utility environment, and the customers in some jurisdictions are beginning to receive monetary compensation for power supply failures. Minimizing the customer interruption costs associated with a load curtailment event is an important factor in maintaining customer satisfaction. Customer interruption costs depend on many factors such as the customer types interrupted, the actual load demand at the time of the outage, the duration of the outage, the time of day and the day in which the outage occurs. This paper focuses on incorporating these interruption cost factors in a load shedding strategy. The load shedding algorithm was developed using an approximate event-based customer interruption cost evaluation technique to identify and determine the priority of the distribution feeders on a given bus during an emergency. The developed algorithm incorporates a time dependent feeder cost priority index (FCP). The optimum load shedding set determined using the FCP is a feeder or group of feeders that meet a capacity deficiency, and result in the lowest customer interruption cost for the specified emergency situation. This paper illustrates the algorithm development for a load shedding scheme and demonstrates the utilization of the technique on a sample load bus.

关键词： Customer satisfaction Power industry Power supplies Cost function Power system security voltage Frequency stability Joining processes Constraint optimization

来源：评论

学校读者我要写书评

暂无评论

bridge piers—drag force coefficients

引用

IsH Journal of Hydraulic engineering 2004年第1期10卷 48-55页

作者： Mallikarjuna, P. babu, Ch. suresh Murali, T. satish Kumar, M.R. Department of Civil Engineering S.V.U. College of Engineering Tirupati A.P. India N.B.K.R. Institute of Science and Technology A.P. Vidyanagar India S.V.U. College of Engineering Tirupati A.P. India S.V.U. College of Engineering Tirupati A.P. India

The rational approach for estimating afflux at bridge constrictions requires the knowledge of drag coefficient. This paper presents experimental investigations on the variation of drag coefficient with Reynolds number for piers with semicircular nose and tail and lens-shaped nose and tail considering the effects of flow contraction and length-width ratio of piers. It is observed that the drag coefficient varies directly with contraction ratio and length-width ratio of piers. A relation of the form CD1sub> = CRisup>esub> σjsup> αksup> is also proposed for the experimental range of Rcsub> = 7 × 104sup> to 5 × 105sup> for the two shapes of piers. © 2004 Taylor & Francis Group, LLC.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Detector concepts

Detector concepts

引用

2005 International Linear Collider Workshop, LCWs 2005

作者： Aarons, Gerald Abe, Toshinori Abernathy, Jason Ablikim, Medina Abramowicz, Halina Adey, David Adloff, Catherine Adolphsen, Chris Afanaciev, Konstantin Agapov, Ilya Ahn, Jung-Keun Aihara, Hiroaki Akemoto, Mitsuo Del CarmenAlabau, Maria Albert, Justin Albrecht, Hartwig Albrecht, Michael Alesini, David Alexander, Gideon Alexander, Jim Allison, Wade Amann, John Amirikas, Ramila An, Qi Anami, shozo Ananthanarayan, b. Anderson, Terry Andricek, Ladislav Anduze, Marc Anerella, Michael Anfimov, Nikolai Angal-Kalinin, Deepa Antipov, sergei Antoine, Claire Aoki, Mayumi Aoza, Atsushi Aplin, steve Appleby, Rob Arai, Yasuo Araki, sakae Arkan, Tug Arnold, Ned Arnold, Ray Arnowitt, Richard Artru, Xavier Arya, Kunal Aryshev, Alexander Asakawa, Eri Asiri, Fred Asner, David Atac, Muzaffer Atoian, Grigor Attié, David Augustin, Jean-Eudes Augustine, David b. Ayres, bradley Aziz, Tariq baars, Derek badaud, Frederique baddams, Nigel bagger, Jonathan bai, sha bailey, David bailey, Ian R. baker, David balalykin, Nikolai I. balbuena, Juan Pablo baldy, Jean-Luc ball, Markus ball, Maurice ballestrero, Alessandro ballin, Jamie baltay, Charles bambade, Philip ban, syuichi band, Henry bane, Karl banerjee, bakul barbanotti, serena barbareschi, Daniele barbaro-Galtieri, Angela barber, Desmond P. barbi, Mauricio bardin, Dmitri Y. barish, barry barklow, Timothy L. barlow, Roger barnes, virgil E. barone, Maura bartels, Christoph bartsch, valeria basu, Rahul battaglia, Marco batygin, Yuri baudot, Jerome baur, Ulrich baynham, D. Elwyn beard, Carl bebek, Chris bechtle, Philip becker, Ulrich J. bedeschi, Franco bedjidian, Marc behera, Prafulla behnke, Ties bellantoni, Leo bellerive, Alain bellomo, Paul bentson, Lynn D. benyamna, Mustapha bergauer, Thomas berger, Edmond bergholz, Matthias beri, suman berndt, Martin bernreuther, Werner bertolini, Alessandro besancon, Marc besson, Auguste beteille, Andre bettoni, simona beyer, Michael bhandari, R.K. bharadwaj, vinod bhatnagar, vipin bhattacharya, satyaki bhattacharyya, Gautam bhattacherjee, biplob bhuyan, Abdus Salam International Centre for Theoretical Physics Strada Costriera 11 Trieste34014 Italy Str. Atomistilor No. 407 P.O. Box MG-6 Bucharest - MagureleR-76900 Romania AGH University of Science and Technology Akademia Gorniczo-Hutnicza im. Stanislawa Staszica w Krakowie Al. Mickiewicza 30 CracowPL-30-059 Poland Albert-Ludwigs Universität Freiburg Physikalisches Institut Hermann-Herder Str. 3 FreiburgD-79104 Germany Aligarh Muslim University AligarhUttar Pradesh202002 India Amberg Engineering AG Trockenloostr. 21 P.O. Box 27 Regensdorf-Watt8105 Switzerland Forschungszentrum Karlsruhe Hermann-von-Helmholtz-Platz 1 Eggenstein-LeopoldshafenD-76344 Germany 9700 S. Cass Avenue ArgonneIL60439 United States Baylor University Department of Physics 101 Bagby Avenue WacoTX76706 United States Beijing University Department of Physics Beijing100871 China Belarusian State University National Scientific and Educational Center Particle and HEP Physics M. Bogdanovich St. 153 Minsk240040 Belarus Benares Hindu University Benares Varanasi221005 India Bhabha Atomic Research Centre Trombay Mumbai400085 India Birla Institute of Technology and Science EEE Dept. PilaniRajasthan India Bogazici University Physics Department Bebek / Istanbul34342 80820 Turkey Boston University Department of Physics 590 Commonwealth Avenue BostonMA02215 United States Brandenburg University of Technology Postfach 101344 CottbusD-03013 Germany Brno University of Technology Antonínská548/1 BrnoCZ 601 90 Czech Republic P.O. Box 5000 UptonNY11973-5000 United States Brown University Department of Physics Box 1843 ProvidenceRI02912 United States Novosibirsk630090 Russia Calcutta University Department of Physics 92 A.P.C. Road Kolkata700009 India 1200 East California Blvd. PasadenaCA91125 United States Carleton University Department of Physics 1125 Colonel By Drive OttawaONK1S 5B6 Canada Carnegie Mellon University Department of Physics Wean

来源：评论

学校读者我要写书评

暂无评论

Design-a-trial: A rule-based decision support system for clinical trial design

Design-a-trial: A rule-based decision support system for cli...

引用

作者： Nammuni, K. Pickering, C. Modgil, s. Montgomery, A. Hammond, P. Wyatt, J.C. Altman, D.G. Dunlop, R. Potts, H.W.W. e-Science Centre School of Engineering Sciences University of Southampton Highfield Southampton SO17 1BJ United Kingdom InferMed Ltd 25 Bedford Square London WC1B 3HW United Kingdom Biomedical Informatics Unit Eastman Dent. Inst. Oral Hlth Care University College London 256 Gray's Inn Road London WC1B 3HW United Kingdom Natl. Inst. for Clinical Excellence MidCity Place 71 High Holborn London WC1V 6NA United Kingdom CRUK/NHS Centre for Statistics in Medicine Institute of Health Sciences Old Road Headington Oxford OX3 7LF United Kingdom Ctr. Hlth. Info./Multiprof. Educ. University College London Highgate Hill London N19 5LW United Kingdom

The complexity of clinical research has meant that clinical trial protocols are often scientifically and ethically unsound. Trial designers often have limited statistical skills and experience in clinical research. This problem is exacerbated in the academic arena, in which access to statistical expertise is limited. Design-a-Trial (DaT) is an expert system that assists trial designers in designing and planning clinical trials. The system is developed in visual *** and Prolog, and is due for commercial release in september 2003. The main aim of DaT is to help trial designers with limited statistical and research experience to design scientifically and ethically sound trials. It also serves as a checklist for the more experienced designers and can potentially be used to assist in the training of new clinical researchers. © 2004 Elsevier b.v. All rights reserved.

关键词： Decision support systems

来源：评论

学校读者我要写书评

暂无评论

TRAvERsAL OF A QUAsI-PLANAR sUbDIvIsION WITHOUT UsING MARK bITs

引用

Journal of Interconnection Networks 2004年第4期5卷 395-407页

作者： EDGAR CHÁvEZ ŠTEFAN DObREv EvANGELOs KRANAKIs JAROsLAv OPATRNY LADIsLAv sTACHO JORGE URRUTIA Escuela de Ciencias Físico-Matemáticas de la Universidad Michoacana de San Nicolás de Hidalgo Mexico School of IT and Engineering University of Ottawa 800 King Eduard Ottawa Ontario Canada K1N 6N5 Canada School of Computer Science Carleton University 1125 Colonel By Drive Ottawa Ontario Canada K1S 5B6 Canada Department of Computer Science Concordia University 1455 de Maisonneuve Blvd West Montral Qubec Canada H3G 1M8 Canada Department of Mathematics Simon Fraser University 8888 University Drive Burnaby British Columbia Canada V5A 1S6 Canada Instituto de Matemticas Universidad Nacional Autnoma de Mxico Circuito Exterior Ciudad Universitaria Coyoacn 04510 Mxico D.F. Mxico Mexico

The problem of traversal of planar subdivisions or other graph-like structures without using mark bits is central to many real-world applications [7, 8, 11, 12, 13, 17, 18]. The first such algorithms developed were able to traverse triangulated subdivisions [10]. Later these algorithms were extended to traverse vertices of an arrangement or a convex polytope [3]. The research progress culminated to an algorithm that can traverse any planar subdivision [6, 9]. In this paper, we extend the notion of planar subdivision to quasi-planar subdivision in which we allow many edges to cross each other. We generalize the algorithm from [9] to traverse any quasi-planar subdivision that satisfies a simple geometric requirement. If we use techniques from [6] the worst case running time of our algorithm is O(|E| log |E|); matching the running time of the traversal algorithm for planar subdivisions [6].

关键词： traversal planar graph surface walk

来源：评论

学校读者我要写书评

暂无评论

Erratum to “Three-dimensional distribution of gas hydrate beneath southern Hydrate Ridge: constraints from ODP Leg 204” [Earth Planet. sci. Lett. 222 (2004) 845–862]

引用

Earth and Planetary science Letters 2004年第3-4期227卷 557-558页

作者： A.M. Tréhu M.E. Torres P.E. Long G. bohrmann F.R. Rack T.s. Collett D.s. Goldberg A.v. Milkov M. Riedel P. schultheiss N.L. bangs s.R. barr W.s. borowski G.E. Claypool M.E. Delwiche G.R. Dickens E. Gracia G. Guerin J.L. Weinberger College of Oceanic and Atmospheric Science Oregon State University Corvallis OR 97331-5503 USA Pacific Northwest National Laboratory Richland WA 99352 USA Department of Geosciences University of Bremen Klagenfurterstrasse D-28359 Bremen Germany JOI 1755 Massachusetts Ave. NW suite 700 Washington DC 20036 USA U.S. Geological Survey Denver Federal Center Denver CO 80225 USA Borehole Research Group Lamont-Doherty Earth Observatory Palisades NY 10964 USA Geology and Geophysics WHOI Woods Hole MA 02543 USA Geological Survey of Canada Pacific Geoscience Centre Sidney BS Canada V8L4B2 GEOTEK Daventry Northants NN11 5RD UK Institute for Geophysics University of Texas at Austin 4412 Spicewood Springs Rd. Austin TX 78759 USA Department of Geology University of Leicester Leicester LE1 7RH UK Department of Earth Sciences Eastern Kentucky University 512 Lancaster Ave. Richmond KY 40475 USA 8910 West 2nd Avenue Lakewood CO 80226 USA Idaho National Engineering and Environmental Laboratory Idaho Falls ID 83415-2203 USA Department of Earth Science Rice University Houston TX 77005 USA Unitat de Tecnologia Marina Centre Mediterrani d'Investigacions Marines i Ambientals 08003 Barcelona Spain Scripps Institution of Oceanography University of California San Diego CA 92093-0244 USA

来源：评论

学校读者我要写书评

暂无评论

High performance code generation through lazy activation records 7

High performance code generation through lazy activation rec...

引用

7th Workshop on Interaction between Compilers and computer Architectures, INTERACT-7 2003

作者： satpathy, M. Mahapatrg, R.N. Choudhuri, s. Chitnis, s.v. Applied Software Engineering Group Department of Computer Science University of Reading ReadingRG6 6AY United Kingdom Hardware Software Codesign Group Department of Computer Science Texas AandM University College StationTX77843-5534 United States CMG Wireless Data Solutions B.V. Merweplein 5 Nieuwegein3432 GNß Netherlands

ISBN: (纸本)0769518893

For call intensive programs, function calls are major bottlenecks during program execution since they usually force register contents to be spilled into memory. such register to memory spills are much more pronounced in presence of recursion. A function call is usually accompanied by the creation of its activation record at function entry. In this paper, we will deviate from this usual practice;we create an activation record only when we find it necessary. The result is that on many occasions we can execute a function call without actually creating its activation record. We call our strategy lazy activation record strategy (LARs) and show how this strategy is particularly important for call-intensive programs. The LARs subsumes many traditional techniques like leaf-call optimization and tail-recursion optimization, and in addition, it extends Chow's shrink-wrapping in terms of scope and granularity. We also demonstrate how the LARs can be an effective optimization strategy in the case of battery operated embedded systems, since not only can it reduce execution time but also energy consumption. © 2003 IEEE.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Lukaszewicz-style answer set programming: A preliminary report

Lukaszewicz-style answer set programming: A preliminary repo...

引用

2nd International Workshop on Answer set Programming Advances in Theory and Implementation, AsP 2003

作者： Delgrande, J.P. Gharib, M. Mercer, R.E. Risch, v. schaub, T. School of Computing Science Simon Fraser University Burnaby BC V5A 1S6 Canada Institut für Informatik Universität Potsdam D-14415 Potsdam Germany Cognitive Engineering Laboratory Department of Computer Science University of Western Ontario London ON N6A 5B7 Canada InCA Team LSIS - UMR CNRS 6168 Domaine Universitaire de Saint-Jérôme avenue Escadrille Normandie Niemen F-13397 Marseille cédex 20 France

The correspondence between Reiter's default reasoning and logic programming has been exhaustively studied (e.g. [1], [2], [3]). A Contrario the relation with the many variants of the initial theory of Reiter seems far less known. This paper aims to present a preliminary investigation on applying a variant of default reasoning proposed by Witold Lukaszewicz [5] to extended logic programs. We show that the modification made to the notion of extension by Lukaszewicz has its counterpart as a relaxed notion of answer set of an extended logic program. As can be expected from this correspondence: (1) any extended logic program has always at least one relaxed answer set;(2) classical answer sets can be completely characterized among the set of relaxed answer sets of an extended logic program.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

MEssY bROADCAsTING IN MULTIDIMENsIONAL DIRECTED TORI

引用

Journal of Interconnection Networks 2003年第1期4卷 37-51页

作者： FRANCEsC COMELLAs HOvHANNEs A. HARUTYUNYAN ARTHUR L. LIEsTMAN Departament de Matemàtica Aplicada IV Universitat Politècnica de Catalunya Campus Nord Edifici C3 J. Girona Salgado 1-3 08034 Barcelona Catalunya Spain Supported by a NATO Collaborative Research Grant (ref. 972241) and from CICYT Spain project TIC97-0963 Department of Computer Science Concordia University Montreal QC H3G 1M8 Canada Supported by the Natural Sciences and Engineering Research Council of Canada School of Computing Science Simon Fraser University Burnaby B.C. V5A 1S6 Canada

In classical broadcast models, once a vertex receives the broadcast message, it sends the message out in such a way as to achieve the minimum possible broadcasting time. It is assumed either that there is a leader who coordinates the actions of all vertices during the broadcasting process, or that the vertices have a coordinated set of protocols which allow them to achieve minimum time broadcast for any originator. In the messy broadcast model, there is no leader, the vertices of the network do not know the starting time of the broadcast or the originator, the state of the whole scheme is unknown to any vertex, and the protocols are not coordinated. This model also describes a network with vertices that have small memories insufficient to store a set of coordinated protocols. In this paper, we continue the study of messy broadcasting and present the first results for directed graphs. We obtain exact values for and bounds on the messy broadcast times of multidimensional directed tori.

关键词： broadcasting Messy broadcasting Directed tori

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：