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

Time-varying stiffness analysis on rotating shaft with elliptical-front crack

International Journal of Industrial and Systems Engineering 2014年第3期17卷 302-314页

作者： Wei, Xiaopeng Liu, Dajun Zhao, Lasheng Zhang, Qiang Key Laboratory of Advanced Design and Intelligent Computing Dalian University Ministry of Education Dalian 116622 China

The aim of this paper is to investigate the difference of time-varying stiffness characteristics between a semi-elliptical front crack and a straight front crack of shaft-element in order to obtain a more accurate and realistic cracked-rotor model for rotating machinery system. By calculating the correct time-varying area moments of inertia for the cross-section of cracked element and taking account the neutral axis position changes, the switching function is obtained, meanwhile the stiffness of shaft in a steady rotating cycle is determined. The result shows that a significant difference of stiffness appears as crack depth deepens. Especially, the difference between elliptical-front (EF) and straight-front (SF) cracked element is more obvious in the early crack propagation. © 2014 Inderscience Enterprises Ltd.

关键词： Cracks

来源：评论

学校读者我要写书评

暂无评论

Contact-based motion graph and its application in locomotion synthesis for virtual actors

引用

International Journal of Industrial and Systems Engineering 2015年第1期20卷 58-68页

作者： Wei, Xiaopeng Yi, Pengfei Zhang, Qiang School of Mechanical and Engineering Dalian University of Technology Dalian116024 China Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education Dalian University Dalian116622 China

To generate foot-skate free locomotion along user defined path for virtual actors, a novel data structure of contact-based motion graph is proposed. At first, sample motions are divided to contact clips according to the number of feet in contact with the ground. Then a directed graph can be built by producing nodes and basic edges based on these clips. After generating edges between nodes from different samples by linear interpolation, the contact-based motion graph can be defined as a strongly connected component of this graph. Applying synthesis strategy designed for nodes and edges, a path on contact-based motion graph can be converted to a smooth foot-skate free motion moving along the given path. The following experiments show the effectiveness of this method. Copyright © 2015 Inderscience Enterprises Ltd.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

The Liver Tumor Segmentation Benchmark (LiTS)

arXiv

引用

arXiv 2019年

作者： Bilic, Patrick Christ, Patrick Li, Hongwei Bran Vorontsov, Eugene Ben-Cohen, Avi Kaissis, Georgios Szeskin, Adi Jacobs, Colin Mamani, Gabriel Efrain Humpire Chartrand, Gabriel Lohöfer, Fabian Holch, Julian Walter Sommer, Wieland Hofmann, Felix Hostettler, Alexandre Lev-Cohain, Naama Drozdzal, Michal Amitai, Michal Marianne Vivanti, Refael Sosna, Jacob Ezhov, Ivan Sekuboyina, Anjany Navarro, Fernando Kofler, Florian Paetzold, Johannes C. Shit, Suprosanna Hu, Xiaobin Lipková, Jana Rempfler, Markus Piraud, Marie Kirschke, Jan Wiestler, Benedikt Zhang, Zhiheng Hülsemeyer, Christian Beetz, Marcel Ettlinger, Florian Antonelli, Michela Bae, Woong Bellver, Míriam Bi, Lei Chen, Hao Chlebus, Grzegorz Dam, Erik B. Dou, Qi Fu, Chi-Wing Georgescu, Bogdan Giró-I-Nieto, Xavier Gruen, Felix Han, Xu Heng, Pheng-Ann Hesser, Jürgen Moltz, Jan Hendrik Igel, Christian Isensee, Fabian Jäger, Paul Jia, Fucang Kaluva, Krishna Chaitanya Khened, Mahendra Kim, Ildoo Kim, Jae-Hun Kim, Sungwoong Kohl, Simon Konopczynski, Tomasz Kori, Avinash Krishnamurthi, Ganapathy Li, Fan Li, Hongchao Li, Junbo Li, Xiaomeng Lowengrub, John Ma, Jun Maier-Hein, Klaus Maninis, Kevis-Kokitsi Meine, Hans Merhof, Dorit Pai, Akshay Perslev, Mathias Petersen, Jens Pont-Tuset, Jordi Qi, Jin Qi, Xiaojuan Rippel, Oliver Roth, Karsten Sarasua, Ignacio Schenk, Andrea Shen, Zengming Torres, Jordi Wachinger, Christian Wang, Chunliang Weninger, Leon Wu, Jianrong Xu, Daguang Yang, Xiaoping Yu, Simon Chun-Ho Yuan, Yading Yue, Miao Zhang, Liping Cardoso, Jorge Bakas, Spyridon Braren, Rickmer Heinemann, Volker Pal, Christopher Tang, An Kadoury, Samuel Soler, Luc van Ginneken, Bram Greenspan, Hayit Joskowicz, Leo Menze, Bjoern Department of Informatics Technical University of Munich Germany Department of Quantitative Biomedicine University of Zurich Switzerland Ecole Polytechnique de Montréal Canada Department of Medical Imaging Radboud University Medical Center Nijmegen Netherlands Department of Biomedical Engineering Tel-Aviv University Israel Germany Pattern Analysis and Learning Group Department of Radiation Oncology Heidelberg University Hospital Heidelberg Germany Philips Research China Philips China Innovation Campus Shanghai China School of Biomedical Engineering & Imaging Sciences King0s College London London United Kingdom Institute for AI in Medicine Technical University of Munich Germany Department of Computer Science Guangdong University of Foreign Studies China Institute for diagnostic and interventional radiology Klinikum rechts der Isar Technical University of Munich Germany Institute for Diagnostic and Interventional Neuroradiology Klinikum Rechts der Isar Technical University of Munich Germany Department of Hepatobiliary Surgery The Affiliated Drum Tower Hospital Nanjing University Medical School China Department of Computing Imperial College London London United Kingdom Institute for Tissue Engineering and Regenerative Medicine Helmholtz Zentrum München Neuherberg Germany Brigham and Women's Hospital Harvard Medical School United States School of Computer Science and Engineering The Hebrew University of Jerusalem Israel University of Pennsylvania PA United States Pte. Ltd. Singapore Medical Imaging and Reconstruction Lab Department of Engineering Design Indian Institute of Technology Madras India Sensetime Shanghai China Department of Radiology Perelman School of Medicine University of Pennsylvania United States Department of Pathology and Laboratory Medicine Perelman School of Medicine University of Pennsylvania PA United States Co. Ltd China MontréalQC Canada Department of Radiology Radiation Oncology and Nuclear Medicine University of Montréal

In this work, we report the set-up and results of the Liver Tumor Segmentation Benchmark (LiTS), which was organized in conjunction with the IEEE International Symposium on Biomedical Imaging (ISBI) 2017 and the International Conferences on Medical Image computing and Computer-Assisted Intervention (MICCAI) 2017 and 2018. The image dataset is diverse and contains primary and secondary tumors with varied sizes and appearances with various lesion-to-background levels (hyper-/hypo-dense), created in collaboration with seven hospitals and research institutions. Seventy-five submitted liver and liver tumor segmentation algorithms were trained on a set of 131 computed tomography (CT) volumes and were tested on 70 unseen test images acquired from different patients. We found that not a single algorithm performed best for both liver and liver tumors in the three events. The best liver segmentation algorithm achieved a Dice score of 0.963, whereas, for tumor segmentation, the best algorithms achieved Dices scores of 0.674 (ISBI 2017), 0.702 (MICCAI 2017), and 0.739 (MICCAI 2018). Retrospectively, we performed additional analysis on liver tumor detection and revealed that not all top-performing segmentation algorithms worked well for tumor detection. The best liver tumor detection method achieved a lesion-wise recall of 0.458 (ISBI 2017), 0.515 (MICCAI 2017), and 0.554 (MICCAI 2018), indicating the need for further research. LiTS remains an active benchmark and resource for research, e.g., contributing the liver-related segmentation tasks in http://***/. In addition, both data and online evaluation are accessible via ***. © 2019, CC BY-NC-ND.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Time-varying stiffness analysis of a rotor system with a straight–fronted slant breathing crack

Time-varying stiffness analysis of a rotor system with a str...

引用

2014 International Conference on Simulation and Modeling Methodologies, Technologies and Applications, SMTA 2014

作者： Han, Minglei Zhang, Jianxin Zhang, Qiang Wei, Xiaopeng Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education Dalian university Dalian China

ISBN: (纸本)9781845649821

This paper calculates the finite element stiffness of a rotating shaft with a straight-fronted slant crack based on neutral axis method. In a steady rotation cycle, a 45-degree straight-fronted slant breathing crack is compared with a transverse one in different depths in the area of the crack breathing mechanism and time-varying characteristics of the shaft stiffness. The comparison between a slant crack and a transverse crack shows that the opening and closing mechanism is substantially the same, while the shaft stiffness differences are significant;as the crack inclination angle decreased, the stiffness of the shaft element tends to harmonic vibration. © 2014 WIT Press.

关键词： Stiffness

来源：评论

学校读者我要写书评

暂无评论

Sentence Alignment of Historical Classics based on Mode Prediction and Term Translation Pairs 3

Sentence Alignment of Historical Classics based on Mode Pred...

引用

3rd CIPS-SIGHAN Joint Conference on Chinese Language Processing, CLP 2014

作者： Che, Chao Zheng, Xiaojun Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education Dalian University Dalian116622 China

Parallel corpora are essential resources for the construction of bilingual term dictionary of historical classics. To obtain large-scale parallel corpora, this paper proposes a sentence alignment method based on mode prediction and term translation pairs. On one hand, the method rebuilds the sentence alignment process according to characteristics of the translation of historical classics, and adds mode prediction into the sentence alignment. On the other hand, due to the lack of bilingual ancient Chinese dictionary, the method exploits the term translation pairs extracted from manually aligned sentence pairs to perform alignment. The method first predicts the alignment mode probability according to the character number, punctuation number and some characters of Chinese sentence, then performs sentence alignment using length alignment probability, term alignment probability and mode probability. Besides, the method selects anchor sentence pairs based on sentence length and predicted mode to prevent the spread of alignment errors. The experiment on "Shi Ji" demonstrates that mode prediction and term translation pair both enhance the performance of sentence alignment obviously. © 2014 CLP 2014 - 3rd CIPS-SIGHAN Joint Conference on Chinese Language Processing. All rights reserved.

关键词： Alignment

来源：评论

学校读者我要写书评

暂无评论

Shape Matching Optimization via Atomic Potential Function and Artificial Bee Colony Algorithms with Various Search Strategies

Shape Matching Optimization via Atomic Potential Function an...

引用

International Symposium on Computational Intelligence and design, ISCID

作者： Bai Li Hongxin Cao Mandong Hu Changjun Zhou College of Control Science and Engineering Zhejiang University Hangzhou China Zhejiang University Hangzhou Zhejiang CN College of Software Technique Qingdao University Qingdao China Key Laboratory of Advanced Design and Intelligent Computing Dalian University Dalian China

ISBN: (纸本)9781467395885

Visual shape matching is a critical topic in pattern recognition applications. Atomic potential matching (APM) model is a relatively new shape matching methodology inspired by potential field attractions. Compared to the conventional edge potential function model, APM not only encourages the right matching parts through attraction, but also repels the wrong matching parts. This feature enables APM to cope with targets that hide in the intricate background. This study comprehensively investigates the convergence performances of various state-of-the-art artificial bee colony (ABC) algorithms in shape matching problems on the basis of APM framework. Repeated simulations are conducted to evaluate the optimization abilities of the concerned ABC variants and experimental results indicate that the prevailing remedies for the conventional ABC algorithm, especially efforts made in the local exploitation phase, are not efficacious to promote optimization capability. Explanations regarding the comparative results are provided as well.

关键词： Shape Optimization Image edge detection Algorithm design and analysis Aircraft Visualization Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Algorithm of Detecting and Filling Small Holes in Triangular Mesh Surface

引用

Computer Aided Drafting,design and Manufacturing 2014年第4期24卷 33-38页

作者： ZHOU Dong-sheng JIANG Chao DONG Jing LIU Rui Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education Dalian University

In some scattered point cloud triangular mesh restoration algorithm, small triangular mesh holes problem will often affect the quality of the model. For small holes at the details, this paper propose a method for identifying and extracting hollow edge,and use a triangle growth way based on boundary edge angle to fill the empty void. First, according the relationship of the point, side and face of the triangle mesh model to identify the hole, then extracting the holes boundary edge and classifying it. Finally, using a triangle growth method based on holes boundary edge angle to fill each small holes separated from the boundary. Compared with other algorithm of filling holes, this method is high efficiency for small holes of smooth surface,and itimprovesthe quality of the triangular mesh model.

关键词： triangular mesh holes detection holes filling

来源：评论

学校读者我要写书评

暂无评论

Key Frames Extraction Based on the Improved Genetic Algorithm

引用

Computer Aided Drafting,design and Manufacturing 2014年第4期24卷 74-78页

作者： ZHOU Dong-sheng JIANG Wei YI Peng-fei LIU Rui Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education Dalian University

In order toovercomethe poor local search ability of genetic algorithm, resulting in the basic genetic algorithm is time-consuming, and low search abilityin the late evolutionary, we use thegray coding instead ofbinary codingatthebeginning of the coding;we use multi-point crossoverto replace the originalsingle-point ***, theexperimentshows that the improved genetic algorithmnot only has a strong search capability, but also thestability has been effectively improved.

关键词： key frames extraction grey code binary code genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Motion Key-frames extraction based on amplitude of distance characteristic curve

引用

International Journal of Computational Intelligence Systems 2014年第3期7卷 506-514页

作者： Zhang, Qiang Xue, Xiang Zhou, Dongsheng Wei, Xiaopeng Key Laboratory of Advanced Design and Intelligent Computing of Ministry of Education Dalian University Dalian China

The key frames extraction technique extracts key postures to describe the original motion sequence, which has been widely used in motion compression, motion retrieval, motion edition and so on. In this paper, we propose a method based on the amplitude of curve to find key frames in a motion captured sequence. First we select a group of joint distance features to represent the motion and adopt the Principal Component Analysis (PCA) method to obtain the one dimension principal component as a features curve which will be used. Then we gain the initial key-frames by extracting the local optimum points in the curve. At last, we get the final key frames by inserting frames based on the amplitude of the curve and merging key frames too close. A number of experimental examples demonstrate that our method is practicable and efficient not only in the visual performance but also in the aspect of the compression ratio and error rate.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Motif mining based on network space compression

引用

BioData mining 2015年第1期8卷 29页

作者： Qiang Zhang Yuan Xu Key Laboratory of Advanced Design and Intelligent Computing (Dalian university) Ministry of Education Dalian 116622 China.

A network motif is a recurring subnetwork within a network, and it takes on certain functions in practical biological macromolecule applications. Previous algorithms have focused on the computational efficiency of network motif detection, but some problems in storage space and searching time manifested during earlier studies. The considerable computational and spacial complexity also presents a significant challenge. In this paper, we provide a new approach for motif mining based on compressing the searching space. According to the characteristic of the parity nodes, we cut down the searching space and storage space in real graphs and random graphs, thereby reducing the computational cost of verifying the isomorphism of sub-graphs. We obtain a new network with smaller size after removing parity nodes and the "repeated edges" connected with the parity nodes. Random graph structure and sub-graph searching are based on the Back Tracking Method; all sub-graphs can be searched for by adding edges progressively. Experimental results show that this algorithm has higher speed and better stability than its alternatives.

关键词： Associated matrix Parity nodes Space compression Sub-graph mark

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：