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

The Form of High-Performance Computing: A Survey

学校读者我要写书评

暂无评论

IOP Conference Series: Materials Science and engineering 2019年第5期662卷

作者： Priati Assiroj H L H S Warnars R Kosala B Ranti S Supangat A I Kistijantoro E Abdurrachman Binus Graduate Program Doctor of Computer Science Bina Nusantara University Jakarta Information System Dept. Buana Perjuangan University Karawang Computer Science Department BINUS Graduate Program Doctor of Computer Science Bina Nusantara University Jakarta Information System Department Bina Nusantara University Jakarta Information System Technology Department Institut Teknologi Bandung School of Electronics Engineering and Informatics Institut Teknologi Bandung

Computational technology is an important thing that needed in the whole of human life. Along with the development of computer technology, there are a significant data created and wait to be processed; we will get more advantages if it well-processed, if not we will see the data explosion, the data is just a useless stack. Research mitigates the other research paper and makes a conclusion and a report by PRISMA method. The development of computer technology will support the development of an organization. Considering any factors in choosing the right and suitable high-performance computer resource due to our organization is a must. The existing high-performance computing forms are Supercomputer, Grid Computing, Cluster Computing, and Cloud Computing. Based on this work, the last form of high-performance computing, Cloud Computing is one of the most used forms thus we mitigate its advantages and disadvantages. Recently, to process this vast data, we must have a high-performance computer and to provide it, this is not a cheap resource.

关键词：

Understanding and Predicting Trends in Urban Freight Transport

学校读者我要写书评

暂无评论

Understanding and Predicting Trends in Urban Freight Transpo...

International Conference on Mobile Data Management

作者： Petar Mrazovic Bahaeddin Eravci Josep Lluis Larriba-Pey Hakan Ferhatosmanoglu Mihhail Matskin Dept. of Software and Computer Systems Royal Institute of Technology Stockholm Sweden Dept. of Computer Engineering Bilkent University Ankara Turkey Dept. of Computer Architecture Polytechnic University of Catalonia Barcelona Spain Max Planck Institute for Informatics Saarbruecken Germany

ISBN: (纸本)9781538639337

Among different components of urban mobility, urban freight transport is usually considered as the least sustainable. Limited traffic infrastructures and increasing demands in dense urban regions lead to frequent delivery runs with smaller freight vehicles. This increases the traffic in urban areas and has negative impacts upon the quality of life in urban populations. Data driven optimizations are essential to better utilize existing urban transport infrastructures and to reduce the negative effects of freight deliveries for the cities. However, there is limited work and data driven research on urban delivery areas and freight transportation networks. In this paper, we collect and analyse data on urban freight deliveries and parking areas towards an optimized urban freight transportation system. Using a new check-in based mobile parking system for freight vehicles, we aim to understand and optimize freight distribution processes. We explore the relationship between areas' availability patterns and underlying traffic behaviour in order to understand the trends in urban freight transport. By applying the detected patterns we predict the availabilities of loading/unloading areas, and thus open up new possibilities for delivery route planning and better managing of freight transport infrastructures.

关键词： Loading Urban areas Mobile communication Market research Mobile applications Sociology Statistics

Considerations and recommendations from the ISMRM Diffusion Study Group for preclinical diffusion MRI: Part 2 — Ex vivo imaging: added value and acquisition

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Schilling, Kurt G. Grussu, Francesco Ianus, Andrada Hansen, Brian Howard, Amy F.D. Barrett, Rachel L.C. Aggarwal, Manisha Michielse, Stijn Nasrallah, Fatima Syeda, Warda Wang, Nian Veraart, Jelle Roebroeck, Alard Bagdasarian, Andrew F. Eichner, Cornelius Sepehrband, Farshid Zimmermann, Jan Soustelle, Lucas Bowman, Christien Tendler, Benjamin C. Hertanu, Andreea Jeurissen, Ben Verhoye, Marleen Frydman, Lucio de Looij, Yohan van Hike, David Dunn, Jeff F. Miller, Karla Landman, Bennett A. Shemesh, Noam Anderson, Adam McKinnon, Emilie Farquharson, Shawna Acqua, Flavio Dell Pierpaoli, Carlo Drobnjak, Ivana Leemans, Alexander Harkins, Kevin D. Descoteaux, Maxime Xu, Duan Huang, Hao Santin, Mathieu D. Grant, Samuel C. Obenaus, Andre Kim, Gene S. Wu, Dan Le Bihan, Denis Blackband, Stephen J. Ciobanu, Luisa Fieremans, Els Bai, Ruiliang Leergaard, Trygve B. Zhang, Jiangyang Dyrby, Tim B. Allan Johnson, G. Cohen-Adad, Julien Budde, Matthew D. Jelescu, Ileana O. Radiology and Radiological Sciences Vanderbilt University Medical Center NashvilleTN United States Vanderbilt University Institute of Imaging Science Vanderbilt University NashvilleTN United States Radiomics Group Vall d’Hebron Institute of Oncology Vall d’Hebron Barcelona Hospital Campus Barcelona Spain Queen Square MS Centre Queen Square Institute of Neurology Faculty of Brain Sciences University College London London United Kingdom Champalimaud Research Champalimaud Foundation Lisbon Portugal Center of Functionally Integrative Neuroscience Aarhus University Aarhus Denmark Department of Bioengineering Imperial College London London United Kingdom FMRIB Centre Wellcome Centre for Integrative Neuroimaging Nuffield Department of Clinical Neurosciences University of Oxford Oxford United Kingdom Department of Neuroimaging Institute of Psychiatry Psychology and Neuroscience King's College London London United Kingdom NatBrainLab Department of Forensics and Neurodevelopmental Sciences Institute of Psychiatry Psychology and Neuroscience King's College London London United Kingdom Russell H. Morgan Department of Radiology and Radiological Science Johns Hopkins University School of Medicine BaltimoreMD United States Maastricht University Medical Center Maastricht Netherlands The Queensland Brain Institute The University of Queensland Queensland Australia Melbourne Neuropsychiatry Centre The University of Melbourne ParkvilleVIC Australia Department of Radiology and Imaging Sciences Indiana University IN United States Stark Neurosciences Research Institute Indiana University School of Medicine IN United States Center for Biomedical Imaging NYU Grossman School of Medicine New YorkNY United States Faculty of psychology and Neuroscience Maastricht University Maastricht Netherlands Department of Chemical & Biomedical Engineering FAMU-FSU College of Engineering Florida State University TallahasseeFL United States Center for Interdisciplinary Magnetic Re

The value of preclinical diffusion MRI (dMRI) is substantial. While dMRI enables in vivo non-invasive characterization of tissue, ex vivo dMRI is increasingly being used to probe tissue microstructure and brain connectivity. Ex vivo dMRI has several experimental advantages including higher signal-to-noise ratio (SNR) and spatial resolution compared to in vivo studies, and enabling more advanced diffusion contrasts for improved microstructure and connectivity characterization. Another major advantage of ex vivo dMRI is the direct comparison with histological data, as a crucial methodological validation. However, there are a number of considerations that must be made when performing ex vivo experiments. The steps from tissue preparation, image acquisition and processing, and interpretation of results are complex, with many decisions that not only differ dramatically from in vivo imaging of small animals, but ultimately affect what questions can be answered using the data. This work represents "Part 2" of a 3-part series of recommendations and considerations for preclinical dMRI. We describe best practices for dMRI of ex vivo tissue, with a focus on the value that ex vivo imaging adds to the field of dMRI and considerations in ex vivo image acquisition. We first give general considerations and foundational knowledge that must be considered when designing experiments. We briefly describe differences in specimens and models and discuss why some may be more or less appropriate for different studies. We then give guidelines for ex vivo protocols, including tissue fixation, sample preparation, and MR scanning. In each section, we attempt to provide guidelines and recommendations, but also highlight areas for which no guidelines exist (and why), and where future work should lie. An overarching goal herein is to enhance the rigor and reproducibility of ex vivo dMRI acquisitions and analyses, and thereby advance biomedical knowledge. © 2022, CC BY.

关键词： Image acquisition

Resilience or Robustness: Identifying Topological Vulnerabilities in Rail Networks

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Pagani, Alessio Mosquera, Guillem Alturki, Aseel Johnson, Samuel Jarvis, Stephen Wilson, Alan Guo, Weisi Varga, Liz Alan Turing Institute United Kingdom Mathematics Inst. University of Warwick United Kingdom Dept. of Computer Science University of Warwick United Kingdom Sch. of Mathematics University of Birmingham United Kingdom Sch. of Engineering University of Warwick United Kingdom Sch. of Management Cranfield University United Kingdom

Many critical infrastructure systems have network structure and are under stress. Despite their national importance, the complexity of large-scale transport networks means we do not fully understand their vulnerabilities to cascade failures. The research in this paper examines the interdependent rail networks in Greater London and surrounding commuter area. We focus on the morning commuter hours, where the system is under the most demand stress. There is increasing evidence that the topological shape of the network plays an important role in dynamic cascades. Here, we examine whether the different topological measures of resilience (stability) or robustness (failure) are more appropriate for understanding poor railway performance. The results show that resilience and not robustness has a strong correlation to the consumer experience statistics. Our results are a way of describing the complexity of cascade dynamics on networks without the involvement of detailed agent-based-models, showing that cascade effects are more responsible for poor performance than failures. The network science analysis hints at pathways towards making the network structure more resilient by reducing feedback loops. Copyright © 2018, The Authors. All rights reserved.

关键词： Autonomous agents

Service overlay forest embedding for software-defined cloud networks

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Kuo, Jian-Jhih Shen, Shan-Hsiang Yang, Ming-Hong Yang, De-Nian Tsai, Ming-Jer Chen, Wen-Tsuen Inst. of Information Science Academia Sinica Taipei Taiwan Dept. of Computer Science and Information Engineering National Taiwan University of Science and Technology Taipei Taiwan Dept. of Computer Science and Engineering University of Minnesota MinneapolisMN United States Dept. of Computer Science National Tsing Hua University Hsinchu Taiwan

Network Function Virtualization (NFV) on Software-Defined Networks (SDN) can effectively optimize the allocation of Virtual Network Functions (VNFs) and the routing of network flows simultaneously. Nevertheless, most previous studies on NFV focus on unicast service chains and thereby are not scalable to support a large number of destinations in multicast. On the other hand, the allocation of VNFs has not been supported in the current SDN multicast routing algorithms. In this paper, therefore, we make the first attempt to tackle a new challenging problem for finding a service forest with multiple service trees, where each tree contains multiple VNFs required by each destination. Specifically, we formulate a new optimization, named Service Overlay Forest (SOF), to minimize the total cost of all allocated VNFs and all multicast trees in the forest. We design a new 3ρST-approximation algorithm to solve the problem, where ρSTdenotes the best approximation ratio of the Steiner Tree problem, and the distributed implementation of the algorithm is also presented. Simulation results on real networks for data centers manifest that the proposed algorithm outperforms the existing ones by over 25%. Moreover, the implementation of an experimental SDN with HP OpenFlow switches indicates that SOF can significantly improve the QoE of the Youtube service. Copyright © 2017, The Authors. All rights reserved.

关键词： Network function virtualization

Road map extraction from satellite imagery using connected component analysis and landscape metrics

学校读者我要写书评

暂无评论

Road map extraction from satellite imagery using connected c...

IEEE International Conference on Big Data

作者： Kulsawasd Jitkajornwanich Peerapon Vateekul Teerapong Panboonyuen Siam Lawawirojwong Siwapon Srisonphan Dept. of Computer Science King Mongkut's Institute of Technology Bangkok Thailand Dept. of Computer Engineering Faculty of Engineering Chulalongkorn University Bangkok Thailand GISTDA Academy Geo-Informatics & Space Technology Development Agency (PO) Bangkok Thailand Dept. of Electrical Engineering Kasetsart University Bangkok Thailand

Road map extraction is considered an essential task in GIS as its results are the basis of location-based applications in various domains. Examples include GPS navigation on cell phone, delivery route optimization and planning, tourist attraction locator, and location-based marketing. Satellite imagery, one of the big spatial data sources, is used in this research - though other types of remotely-sensed images can also be applied, such as aerial photographs from aircrafts, UAVs or drones. Despite several methods and techniques proposed and accompanied with different performance criteria, the focus was mainly on the accuracy aspect rather than the completeness of the result sets. That is, the results were said to be satisfactory if it met a certain accuracy criterion associated with some benchmark data sets, regardless of whether all results were retrieved. In many cases; however, both accuracy and completeness are equally important. In this paper, we enhance the result accuracy by incorporating connected component analysis into the method as well as the completeness performance by utilizing an ecology concept, called Landscape Metrics, which describes spatial characteristics, patterns, and correlations of areas/patches through different indices. Two types of metrics are used: shape metrics and isolation metrics. The performance is evaluated based on four criteria: precision, recall, quality, and F1 scores. The results show that more than 90% of performance is achieved in all four criteria.

关键词： Roads Measurement Shape Indexes Satellites Filtering Feature extraction

Online multicast traffic engineering for software-defined networks

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Chiang, Sheng-Hao Kuo, Jian-Jhih Shen, Shan-Hsiang Yang, De-Nian Chen, Wen-Tsuen Inst. of Information Science Academia Sinica Taipei Taiwan Dept. of Computer Science & Information Engineering National Taiwan University of Science & Technology Taipei Taiwan Dept. of Computer Science National Tsing Hua University Hsinchu Taiwan

Previous research on SDN traffic engineering mostly focuses on static traffic, whereas dynamic traffic, though more practical, has drawn much less attention. Especially, online SDN multicast that supports IETF dynamic group membership (i.e., any user can join or leave at any time) has not been explored. Different from traditional shortest-path trees (SPT) and graph theoretical Steiner trees (ST), which concentrate on routing one tree at any inst.nt, online SDN multicast traffic engineering is more challenging because it needs to support dynamic group membership and optimize a sequence of correlated trees without the knowledge of future join and leave, whereas the scalability of SDN due to limited TCAM is also crucial. In this paper, therefore, we formulate a new optimization problem, named Online Branch-aware Steiner Tree (OBST), to jointly consider the bandwidth consumption, SDN multicast scalability, and rerouting overhead. We prove that OBST is NP-hard and does not have a |Dmax|1−Ε-competitive algorithm for any Ε > 0, where |Dmax| is the largest group size at any time. We design a |Dmax|competitive algorithm equipped with the notion of the budget, the deposit, and Reference Tree to achieve the tightest bound. The simulations and implementation on real SDNs with YouTube traffic manifest that the total cost can be reduced by at least 25% compared with SPT and ST, and the computation time is small for massive SDN. Copyright © 2017, The Authors. All rights reserved.

关键词： Software defined networking

Evaluation of algorithms for multi-modality whole heart segmentation: An open-access grand challenge

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Zhuang, Xiahai Li, Lei Payer, Christian Štern, Darko Urschler, Martin Heinrich, Mattias P. Oster, Julien Wang, Chunliang Smedby, Örjan Bian, Cheng Yang, Xin Heng, Pheng-Ann Mortazi, Aliasghar Bagci, Ulas Yang, Guanyu Sun, Chenchen Galisot, Gaetan Ramel, Jean-Yves Brouard, Thierry Tong, Qianqian Si, Weixin Liao, Xiangyun Zeng, Guodong Shi, Zenglin Zheng, Guoyan Wang, Chengjia MacGillivray, Tom Newby, David Rhode, Kawal Ourselin, Sebastien Mohiaddin, Raad Keegan, Jennifer Firmin, David Yang, Guang School of Data Science Fudan University Shanghai200433 China Fudan-Xinzailing Joint Research Center for Big Data Fudan University Shanghai200433 China School of Biomedical Engineering Shanghai Jiao Tong University Shanghai200240 China Institute of Computer Graphics and Vision Graz University of Technology Graz8010 Austria Ludwig Boltzmann Institute for Clinical Forensic Imaging Graz8010 Austria Institute of Medical Informatics University of Lubeck Lubeck23562 Germany Inserm Université de Lorraine U1254 IADI Nancy France School for Technology and Health KTH Royal Institute of Technology StockholmSE-10044 Sweden School of Biomed. Eng. Health Science Centre Shenzhen University Shenzhen518060 China Dept. of Comp. Sci. and Eng. Chinese University of Hong Kong Hong Kong China University of Central Florida Orlando32816 United States School of Computer Science and Engineering Southeast University Nanjing210096 China Université de Tours 64 avenue Jean Portalis Tours37200 France School of Computer Science Wuhan University Wuhan430072 China Guangdong Provincial Key Laboratory of Computer Vision and Virtual Reality Technology SIAT Shenzhen China Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen518055 China Institute for Surgical Technology & Biomechanics University of Bern Bern3014 Switzerland BHF Centre for Cardiovascular Science University of Edinburgh Edinburgh United Kingdom Edinburgh Imaging Facility QMRI University of Edinburgh Edinburgh United Kingdom Department of Imaging Sciences & Biomedical Engineering Kings College London London United Kingdom Cardiovascular Research Centre Royal Brompton Hospital LondonSW3 6NP United Kingdom National Heart and Lung Institute Imperial College London London LondonSW7 2AZ United Kingdom

Knowledge of whole heart anatomy is a prerequisite for many clinical applications. Whole heart segmentation (WHS), which delineates substructures of the heart, can be very valuable for modeling and analysis of the anatomy and functions of the heart. However, automating this segmentation can be arduous due to the large variation of the heart shape, and different image qualities of the clinical data. To achieve this goal, a set of training data is generally needed for constructing priors or for training. In addition, it is difficult to perform comparisons between different methods, largely due to differences in the datasets and evaluation metrics used. This manuscript presents the methodologies and evaluation results for the WHS algorithms selected from the submissions to the Multi-Modality Whole Heart Segmentation (MM-WHS) challenge, in conjunction with MICCAI 2017. The challenge provides 120 three-dimensional cardiac images covering the whole heart, including 60 CT and 60 MRI volumes, all acquired in clinical environments with manual delineation. Ten algorithms for CT data and eleven algorithms for MRI data, submitted from twelve groups, have been evaluated. The results show that many of the deep learning (DL) based methods achieved high accuracy, even though the number of training datasets were limited. A number of them also reported poor results in the blinded evaluation, probably due to overfitting in their training. The conventional algorithms, mainly based on multi-atlas segmentation, demonstrated robust and stable performance, even though the accuracy is not as good as the best DL method in CT segmentation. The challenge, including provision of the annotated training data and the blinded evaluation for submitted algorithms on the test data, continues as an ongoing benchmarking resource via its homepage (***/zhuangxiahai/0/mmwhs/). Copyright © 2019, The Authors. All rights reserved.

关键词： Heart

Ocean surface current prediction based on HF radar observations using trajectory-oriented association rule mining

学校读者我要写书评

暂无评论

Ocean surface current prediction based on HF radar observati...

IEEE International Conference on Big Data

作者： Kulsawasd Jitkajornwanich Peerapon Vateekul Upa Gupta Teeranai Kormongkolkul Arnon Jirakittayakorn Siam Lawawirojwong Siwapon Srisonphan Dept. of Computer Science King Mongkut's Institute of Technology Ladkrabang Bangkok Thailand Dept. of Computer Engineering Chulalongkorn University Bangkok Thailand Chulalongkorn University Big Data Analytics & IoT Center (CUBIC) Dept. of Computer Engineering Faculty of Engineering Chulalongkorn University Bangkok 10330 Thailand GISTDA Academy Geo-Informatics & Space Technology Development Agency (PO) Bangkok Thailand Dept. of Electrical Engineering Kasetsart University Bangkok Thailand

HF (high frequency) coastal radar system is used to capture the surface current behavior - in terms of velocity and direction - in the ocean near the coast. 18 HF coastal radar stations were implemented along the Gulf of Thailand in order to monitor for disasters (e.g., Tsunami) as well as relevant risks. The HF systems are also to serve other life-critical applications, such as water quality control and monitoring, chemical spill backtracking, and marine navigation. However, not all the applications can benefit from this near-real-time HF data; some applications in different domains require forecast values. The examples include search-and-rescue system and hazardous materials spill trajectory prediction. Therefore, in this paper, we propose a predictive model for future current data based on historical HF coastal radar data sets, utilizing association rule mining combined with an object dispersion concept. So, the full potential of HF radar systems can be exploited. The spatial and temporal dimensions are taken into account when designing our predictive system, which consists of two phases: ocean surface current track formulation and spatio-temporal association rule mining. The experiments are performed on a two-year HF radar dataset (2014-2015) using Google Cloud Platform. The resulting forecast current values: velocity and direction are then compared with testing datasets (using 10-fold cross validation) of the actual recorded values and evaluated based on percentage accuracy and RMSE, respectively.

关键词：