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

2nd IFIP TC 12 International Conference on Intelligence Science, ICIS 2017

作者： Zang, Di Ling, Jiawei Cheng, Jiujun Tang, Keshuang Li, Xin Department of Computer Science and Technology Tongji University Shanghai China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Department of Transportation Information and Control Engineering Tongji University Shanghai China Shanghai Lujie Electronic Technology Co. Ltd. Pudong Shanghai China

ISBN: (纸本)9783319681207

In this paper, we present a deep learning based approach to performing the whole-day prediction of the traffic speed for the elevated highway. In order to learn the temporal features of traffic speed data in a hierarchical way, an improved convolutional neural network (CNN) with asymmetric kernels is proposed. Speed data are collected from loop detectors of Yan’an elevated highway of Shanghai. To test the performance of the presented method, we compare it with some conventional approaches of traffic speed estimation. Experimental results demonstrate that our method outperforms all of them. © IFIP International Federation for Information Processing 2017.

关键词： Speed

来源：评论

学校读者我要写书评

暂无评论

6TiSCH operation sublayer (6top) implementation on Contiki OS

6TiSCH operation sublayer (6top) implementation on Contiki O...

引用

International Communication Systems and Networks and Workshops, COMSNETS

作者： Lijo Thomas R Shalu J Jerry Daniel S. V. R Anand Malati Hegde Centre for Development of Advanced Computing Control and Instrumentation Group Thiruvananthapuram India Centre for Development of Advanced Computing Juhu Maharashtra IN Department of Electrical Communication Engineering Indian Institute of Science Bangalore India

ISBN: (纸本)9781509042517

The Internet engineering Task Force (IETF) has set up the 6TiSCH Working Group (WG) to focus on enabling IPv6 over the Time Slotted Channel Hoping (TSCH) mode of the IEEE 802.15.4-2015 standard. This paper describes our Contiki implementation of the 6TiSCH operation sublayer, 6top, which is used for dynamic scheduling of bandwidth between the neighboring sensor nodes and facilitate the On the Fly (OTF) scheduling.

关键词： Computer architecture Dynamic scheduling Bandwidth Schedules IEEE 802.15 Standard Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

Automated data extraction from synthetic and real radargrams of district heating pipelines

Automated data extraction from synthetic and real radargrams...

引用

International Workshop on Advanced Ground Penetrating Radar (IWAGPR)

作者： Aleksandar Ristić Milan Vrtunski Miro Govedarica Lara Pajewski Xavier Derobert Department for computing and control engineering University of Novi Sad Novi Sad Serbia Department of Information Engineering Electronics and Telecommunications Sapienza University of Rome Rome Italy GERS Department LUNAM University Bouguenais France

ISBN: (纸本)9781509054855

The main goal of this paper is to investigate the performance of an algorithm for point extraction from hyperbolic reflections in synthetic and real Ground-Penetrating Radar (GPR) data. The real radargrams that we considered contain hyperbolic reflections due to the presence, in the surveyed area, of district heating pipelines DN250 (250mm inner diameter pipe). These are buried 88 cm deep in a soil trench, and covered by compacted sand and concrete bricks (behaton pavement). The synthetic radargrams result from the simulation of a model representing the real geometry on the location of interest. The simulation was carried out by using gprMax, ver. 3.

关键词： Reflection Ground penetrating radar Heating systems Pipelines Soil Concrete Geometry

来源：评论

学校读者我要写书评

暂无评论

Mathematical modeling of the synthesis process of vinyl acetate

引用

Journal of Physics: Conference Series 2019年第1期1278卷

作者： D Arapov S Tikhomirov S Podvalny V Denisenko I Avcinov Chair of Higher Mathematics and Information Technology Voronezh State University of Engineering Technologies 19 Revolution Avenue Voronezh 394036 Russian Federation Chair of Information and Control Systems Voronezh State University of Engineering Technologies 19 Revolution Avenue Voronezh 394036 Russian Federation Head of the Department of Automated and Computing Systems Voronezh State Technical University 14 Moskovsky Avenue Voronezh 394026 Russian Federation

A complete mathematical modeling of the technological process of manufacturing vinyl acetate monomer by vapor-phase method has been implemented. The model is partial differential equations of the material and energy balance and catalyst aging. An algorithm for an integrated equation based on the second-order Gregg-Bulirsh-Shter rectangle symbol has been developed. The error in modeling the process is equal (CH3COOCH=CH2) ± 5.4% rel. for the target matter, and (CO2) ± 6.4% rel. for the secondary substance The kinetic coefficients of differential equations, namely the pre-exponential factors and the activation energy have been refined. The obtained data of the modeling of the vapor-phase manufacturing process of vinyl acetate are shown in the form of tables and graphic three-dimensional dependencies of quality indicators on technological parameters.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Verification of algorithm for point extraction from hyperbolic reflections in GPR data

Verification of algorithm for point extraction from hyperbol...

引用

International Workshop on Advanced Ground Penetrating Radar (IWAGPR)

作者： Aleksandar Ristić Željko Bugarinović Miro Govedarica Lara Pajewski Xavier Derobert Department for computing and control engineering University of Novi Sad Novi Sad Serbia Department of Information Engineering Electronics and Telecommunications Sapienza University of Rome Rome Italy IFFSTAR LUNAM University Bouguenais France

The main goal of this paper is to determine the characteristics of an algorithm for point extraction from hyperbolic reflections in Ground-Penetrating Radar (GPR) data with different acquisition settings. Analysis is performed on a series of experimental radargrams that were collected in real conditions, on the same location. Two district heating pipes DN250 in atrench, covered by compacted sand, were scanned and the acquisition was done by using a 900MHz antenna. The pipe depth and the axial distance were measured when the trench was open. Measured dimensions were then compared with the values obtained by the algorithm.

关键词： Ground penetrating radar Reflection Algorithm design and analysis Data mining Heating systems Artificial neural networks Civil engineering

来源：评论

学校读者我要写书评

暂无评论

Angular Speed control of Brushed DC Motor Using Nonlinear Method: Design and Experiment 35

Angular Speed Control of Brushed DC Motor Using Nonlinear Me...

引用

第35届中国控制会议

作者： ZHANG Sen GU Wanli HU Yunfeng DU Juan CHEN Hong Department of Control Science and Engineering Jilin University State Key Laboratory of Automotive Simulation and Control Jilin University Computing Center of Jilin Province

ISBN: (纸本)9781509009107

The major concentration of this study is on developing a novel control system with response and tracking accuracy features capable of precise angular speed regulation of brushed DC motor. Towards this objective, speed loop controller of brushed DC motor based on Triple-step nonlinear method has been designed. The Triple-step nonlinear method consists of the steady-state control, the reference variation-based feed-forward control, the error feedback control. The designed nonlinear controller has the advantage of concision and specific signification. The controller can greatly enhance the transient response performance of brushed DC motor. When a brushed DC motor running at low angular speed, the system appears the speed fluctuation and dead-zone characteristic. Therefore, the friction model of motor is considered in the design of controller. Current dynamic is neglected due to the fast electric response, the commonly used feedforward controller and PI feedback controller is designed. The effectiveness of the control method compared with conventional PID controllers is verified through experiments.

关键词： Brushed DC Motor Triple-step Method Friction model Angular Speed control

来源：评论

学校读者我要写书评

暂无评论

Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds 17

Minimum Fill-In: Inapproximability and Almost Tight Lower Bo...

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete Algorithms

作者： Yixin Cao R. B. Sandeep Department of Computing Hong Kong Polytechnic University Department of Computer Science & Engineering Indian Institute of Technology Hyderabad India and Institute for Computer Science and Control Hungarian Academy of Sciences

ISBN: (纸本)9781510836358

Performing Gaussian elimination to a sparse matrix may turn some zeroes into nonzero values, so called fill-ins, which we want to minimize to keep the matrix sparse. Let n denote the rows of the matrix and k the number of fill-ins. For the minimum fill-in problem, we exclude the existence of polynomial time approximation schemes, assuming P≠NP, and the existence of 2~(O(n~(1-δ)))-time approximation schemes for any positive δ, assuming the Exponential Time Hypothesis. Also implied is a 2~(O(k~(1/2-δ)))·n~(O(1)) parameterized lower bound. Behind these results is a new reduction from vertex cover, which might be of its own interest: All previous reductions for similar problems are from some kind of graph layout problems.

关键词： Lower bound Gaussian elimination Sparse matrix minimum Exponential time approximation Polynomial time

来源：评论

学校读者我要写书评

暂无评论

Random asynchronous iterations in distributed coordination algorithms

arXiv

引用

arXiv 2018年

作者： Chen, Yao Xia, Weiguo Cao, Ming Lü, Jinhu Department of Computer Science Southwestern University of Finance and Economics Chengdu611130 China School of Control Science and Engineering Dalian University of Technology Dalian116024 China Faculty of Science and Engineering ENTEG University of Groningen Groningen9747 AG Netherlands School of Automation Science and Electrical Engineering State Key Laboratory of Software Development Environment Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China

Distributed coordination algorithms (DCA) carry out information processing processes among a group of networked agents without centralized information fusion. Though it is well known that DCA characterized by an SIA (stochastic, indecomposable, aperiodic) matrix generate consensus asymptotically via synchronous iterations, the dynamics of DCA with asynchronous iterations have not been studied extensively, especially when viewed as stochastic processes. This paper aims to show that for any given irreducible stochastic matrix, even non-SIA, the corresponding DCA lead to consensus successfully via random asynchronous iterations under a wide range of conditions on the transition probability. Particularly, the transition probability is neither required to be independent and identically distributed, nor characterized by a Markov chain. Copyright © 2018, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Euclidean proximity function in image processing

Euclidean proximity function in image processing

引用

2016 Signal Processing: Algorithms, Architectures, Arrangements, and Applications, SPA 2016

作者： Stasik, Pawel M. Department of Control and Systems Engineering Faculty of Computing Science Poznán University of Technology Poznań Poland

ISBN: (纸本)9788362065271

In image processing measuring and valuing a distance between two points is important. The obtained values can be used for determining whether two points are close to each other or to define weights for a filter concentrated around a central element. While there are measures of proximity, neither of them was defined with a such use in mind, mostly concentrating on problem of an optimization. The idea is to turn the Euclidean distance between two points into a measure of how close (or far) two points are from each other, basing on two given ranges. The function was mostly obtained by a theoretical analysis supported with a mathematical calculation and examples of use. As it was proven in the work, the obtained function can be implemented not only to measure proximity, but also as a flexible kernel for image filters, allowing for blurring or edge-detection.

关键词： Edge detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：