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

LS-AMS: An Adaptive Indexing Structure for Realtime Search on Microblogs

IEEE Transactions on big data 2015年第4期1卷 125-137页

作者： Zhao, Feng Liu, Jun Zhou, Jingyu Jin, Hai Yang, Laurence T. Services Computing Technology and System Lab Big Data Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technolgoy Huazhong University of Science and Technology Wuhan China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China School of Computer Science and Technology Huazhong University of Science and Technology China Department of Computer Science St. Francis Xavier University Canada

Indexing microblogs for realtime search is challenging, because new microblogs are created at tremendous speed, and user query requests keep constantly changing. To guarantee user obtain complete query results, micro-blogging site maintains huge indices which leads to index fragmentation or extra merging overhead during realtime search. This paper proposes an efficient Log-Structured index structure with Adaptive Merging Strategy (LS-AMS) for realtime search on microblogs. LS-AMS structure consists of an inverted index buffer and a sequence of dynamically adjustable index packages with exponentially increasing sizes. These index packages manage their inverted indices using adaptive merging strategy, which can reduce the merging overhead to improve query performance and can adjust the index structure based on environmental factors, such as the arrival rate of query requests and new microblogs. Experimental results show that LS-AMS can greatly improve query performance without increasing the update cost and improve the self-adaptability in dynamic environment. © 2015 IEEE.

关键词： Merging

来源：评论

学校读者我要写书评

暂无评论

Identifying the best machine learning algorithms for brain tumor segmentation, progression assessment, and overall survival prediction in the BRATS challenge

arXiv

引用

arXiv 2018年

作者： Bakas, Spyridon Reyes, Mauricio Jakab, Andras Bauer, Stefan Rempfler, Markus Crimi, Alessandro Shinohara, Russell Takeshi Berger, Christoph Ha, Sung Min Rozycki, Martin Prastawa, Marcel Alberts, Esther Lipkova, Jana Freymann, John Kirby, Justin Bilello, Michel Fathallah-Shaykh, Hassan M. Wiest, Roland Kirschke, Jan Wiestler, Benedikt Colen, Rivka Kotrotsou, Aikaterini Lamontagne, Pamela Marcus, Daniel Milchenko, Mikhail Nazeri, Arash Weber, Marc-Andr Mahajan, Abhishek Baid, Ujjwal Gerstner, Elizabeth Kwon, Dongjin Acharya, Gagan Agarwal, Manu Alam, Mahbubul Albiol, Alberto Albiol, Antonio Albiol, Francisco J. Alex, Varghese Allinson, Nigel Amorim, Pedro H.A. Amrutkar, Abhijit Anand, Ganesh Andermatt, Simon Arbel, Tal Arbelaez, Pablo Avery, Aaron Azmat, Muneeza Pranjal, B. Bai, Wenjia Banerjee, Subhashis Barth, Bill Batchelder, Thomas Batmanghelich, Kayhan Battistella, Enzo Beers, Andrew Belyaev, Mikhail Bendszus, Martin Benson, Eze Bernal, Jose Bharath, Halandur Nagaraja Biros, George Bisdas, Sotirios Brown, James Cabezas, Mariano Cao, Shilei Cardoso, Jorge M. Carver, Eric N. Casamitjana, Adri Castillo, Laura Silvana Cat, Marcel Cattin, Philippe Cérigues, Albert Chagas, Vinicius S. Chandra, Siddhartha Chang, Yi-Ju Chang, Shiyu Chang, Ken Chazalon, Joseph Chen, Shengcong Chen, Wei Chen, Jefferson W. Chen, Zhaolin Cheng, Kun Choudhury, Ahana Roy Chylla, Roger Clrigues, Albert Colleman, Steven Colmeiro, Ramiro German Rodriguez Combalia, Marc Costa, Anthony Cui, Xiaomeng Dai, Zhenzhen Dai, Lutao Daza, Laura Alexandra Deutsch, Eric Ding, Changxing Dong, Chao Dong, Shidu Dudzik, Wojciech Eaton-Rosen, Zach Egan, Gary Escudero, Guilherme Estienne, Tho Everson, Richard Fabrizio, Jonathan Fan, Yong Fang, Longwei Feng, Xue Ferrante, Enzo Fidon, Lucas Fischer, Martin French, Andrew P. Fridman, Naomi Fu, Huan Fuentes, David Gao, Yaozong Gates, Evan Gering, David Gholami, Amir Gierke, Willi Glocker, Ben Gong, Mingming Gonzlez-Vill, Sandra Grosges, T. Guan, Yuanfang Guo, Sheng Gupta, Sudeep Han, Woo-Sup Han, Il Song Harmuth, Ko Center for Biomedical Image Computing and Analytics University of Pennsylvania PhiladelphiaPA United States Department of Radiology Perelman School of Medicine University of Pennsylvania PhiladelphiaPA United States Department of Pathology and Laboratory Medicine Perelman School of Medicine University of Pennsylvania PhiladelphiaPA United States Institute for Surgical Technology and Biomechanics University of Bern Bern Switzerland Center for MR-Research University Children's Hospital Zurich Zurich Switzerland Support Centre for Advanced Neuroimaging Inselspital Institute for Diagnostic and Interventional Neuroradiology Bern University Hospital Bern Switzerland University Hospital of Zurich Zurich Switzerland Center for Clinical Epidemiology and Biostatistics University of Pennsylvania Philadelphia United States Image-Based Biomedical Modeling Group Technical University of Munich Munich Germany Icahn School of Medicine Mount Sinai Health System New YorkNY United States Leidos Biomedical Research Inc. Frederick National Laboratory for Cancer Research FrederickMD21701 United States Cancer Imaging Program National Cancer Institute National Institutes of Health BethesdaMD20814 United States Department of Neurology University of Alabama at Birmingham BirminghamAL United States Department of Diagnostic Radiology University of Texas MD Anderson Cancer Center HoustonTX United States Department of Psychology Washington University St. LouisMO United States Neuroimaging Informatics and Analysis Center Washington University St. LouisMO United States Department of Radiology Washington University St. LouisMO United States Institute of Diagnostic and Interventional Radiology Pediatric Radiology and Neuroradiology University Medical Center Rostock Ernst-Heydemann-Str. 6 Rostock18057 Germany Tata Memorial Centre Homi Bhabha National Institute Mumbai India Shri Guru Gobind Singhji Institute of Engineering and Technology Nanded India NVIDIA Santa Clara

Gliomas are the most common primary brain malignancies, with different degrees of aggressiveness, variable prognosis and various heterogeneous histologic sub-regions, i.e., peritumoral edematous/invaded tissue, necrotic core, active and non-enhancing core. This intrinsic heterogeneity is also portrayed in their radio-phenotype, as their sub-regions are depicted by varying intensity profiles disseminated across multi-parametric magnetic resonance imaging (mpMRI) scans, reflecting varying biological properties. Their heterogeneous shape, extent, and location are some of the factors that make these tumors difficult to resect, and in some cases inoperable. The amount of resected tumor is a factor also considered in longitudinal scans, when evaluating the apparent tumor for potential diagnosis of progression. Furthermore, there is mounting evidence that accurate segmentation of the various tumor sub-regions can offer the basis for quantitative image analysis towards prediction of patient overall survival. This study assesses the state-of-the-art machine learning (ML) methods used for brain tumor image analysis in mpMRI scans, during the last seven instances of the International Brain Tumor Segmentation (BraTS) challenge, i.e., 2012-2018. Specifically, we focus on i) evaluating segmentations of the various glioma sub-regions in pre-operative mpMRI scans, ii) assessing potential tumor progression by virtue of longitudinal growth of tumor sub-regions, beyond use of the RECIST/RANO criteria, and iii) predicting the overall survival from pre-operative mpMRI scans of patients that underwent gross total resection. Finally, we investigate the challenge of identifying the best ML algorithms for each of these tasks, considering that apart from being diverse on each instance of the challenge, the multi-institutional mpMRI BraTS dataset has also been a continuously evolving/growing dataset. Copyright © 2018, The Authors. All rights reserved.

关键词： Tumors

来源：评论

学校读者我要写书评

暂无评论

26th Annual Computational Neuroscience Meeting (CNS*2017): Part 3 Antwerp, Belgium. 15-20 July 2017 Abstracts

引用

BMC NEUROSCIENCE 2017年第SUPPL 1期18卷 95-176页

作者： [Anonymous] Department of Neuroscience Yale University New Haven CT 06520 USA Department Physiology & Pharmacology SUNY Downstate Brooklyn NY 11203 USA NYU School of Engineering 6 MetroTech Center Brooklyn NY 11201 USA Departament de Matemàtica Aplicada Universitat Politècnica de Catalunya Barcelona 08028 Spain Institut de Neurobiologie de la Méditerrannée (INMED) INSERM UMR901 Aix-Marseille Univ Marseille France Center of Neural Science New York University New York NY USA Aix-Marseille Univ INSERM INS Inst Neurosci Syst Marseille France Laboratoire de Physique Théorique et Modélisation CNRS UMR 8089 Université de Cergy-Pontoise 95300 Cergy-Pontoise Cedex France Department of Mathematics and Computer Science ENSAT Abdelmalek Essaadi’s University Tangier Morocco Laboratory of Natural Computation Department of Information and Electrical Engineering and Applied Mathematics University of Salerno 84084 Fisciano SA Italy Department of Medicine University of Salerno 84083 Lancusi SA Italy Dipartimento di Fisica Università degli Studi Aldo Moro Bari and INFN Sezione Di Bari Italy Data Analysis Department Ghent University Ghent Belgium Coma Science Group University of Liège Liège Belgium Cruces Hospital and Ikerbasque Research Center Bilbao Spain BIOtech Department of Industrial Engineering University of Trento and IRCS-PAT FBK 38010 Trento Italy Department of Data Analysis Ghent University Ghent 9000 Belgium The Wellcome Trust Centre for Neuroimaging University College London London WC1N 3BG UK Department of Electronic Engineering NED University of Engineering and Technology Karachi Pakistan Blue Brain Project École Polytechnique Fédérale de Lausanne Lausanne Switzerland Departement of Mathematics Swansea University Swansea Wales UK Laboratory for Topology and Neuroscience at the Brain Mind Institute École polytechnique fédérale de Lausanne Lausanne Switzerland Institute of Mathematics University of Aberdeen Aberdeen Scotland UK Department of Integrativ

来源：评论

学校读者我要写书评

暂无评论

Garbage collection and wear leveling for flash memory: Past and future

Garbage collection and wear leveling for flash memory: Past ...

引用

International Conference on Smart computing (SMARTCOMP)

作者： Ming-Chang Yang Yu-Ming Chang Che-Wei Tsao Po-Chun Huang Yuan-Hao Chang Tei-Wei Kuo Institute of Information Science Academia Sinica Taipei Taiwan R.O.C. Graduate Institute of Networking and Multimedia National Taiwan University Taipei Taiwan R.O.C. Macronix International Co. Ltd. Emerging System Lab. Hsinchu Taiwan R.O.C. Department of Computer Science and Engineering Innovation Center for Big Data and Digital Convergence Yuan Ze University Taoyuan Taiwan R.O.C. Research Center for Information Technology Innovation Academia Sinica Taipei Taiwan R.O.C. Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan R.O.C.

ISBN: (纸本)9781479957125

Recently, storage systems have observed a great leap in performance, reliability, endurance, and cost, due to the advance in non-volatile memory technologies, such as NAND flash memory. However, although delivering better performance, shock resistance, and energy efficiency than mechanical hard disks, NAND flash memory comes with unique characteristics and operational constraints, and cannot be directly used as an ideal block device. In particular, to address the notorious write-once property, garbage collection is necessary to clean the outdated data on flash memory. However, garbage collection is very time-consuming and often becomes the performance bottleneck of flash memory. Moreover, because flash memory cells endure very limited writes (as compared to mechanical hard disks) before they are worn out, the wear-leveling design is also indispensable to equalize the use of flash memory space and to prolong the flash memory lifetime. In response, this paper surveys state-of-the-art garbage collection and wear-leveling designs, so as to assist the design of flash memory management in various application scenarios. The future development trends of flash memory, such as the widespread adoption of higher-level flash memory and the emerging of three-dimensional (3D) flash memory architectures, are also discussed.

关键词： Ash Memory management Performance evaluation Reliability Resource management Dynamic scheduling Organizations

来源：评论

学校读者我要写书评

暂无评论

AMSPM: Adaptive Model Selection and Partition Mechanism for Edge Intelligence-driven 5G Smart City with Dynamic computing Resources

引用

ACM Transactions on Sensor Networks 1000年

作者： Xin Niu Xuejiao Cao Chen Yu Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

With the help of 5G network, edge intelligence (EI) can not only provide distributed, low-latency, and high-reliable intelligent services, but also enable intelligent maintenance and management of smart city. However, the constantly changing available computing resources of end devices and edge servers cannot continuously guarantee the performance of intelligent inference. In order to guarantee the sustainability of intelligent services in smart city, we propose the Adaptive Model Selection and Partition Mechanism (AMSPM) in 5G smart city where EI provides services, which mainly consists of Adaptive Model Selection (AMS) and Adaptive Model Partition (AMP). In AMSPM, the model selection and partition of deep neural network (DNN) are formulated as an optimization problem. Firstly, we propose a recursive-based algorithm named AMS based on the computing resources of edge devices to derive an appropriate DNN model that satisfies the latency demand of intelligent services. Then, we adaptively partition the selected DNN model according to the computing resources of edge devices. The experimental results demonstrate that, when compared with state-of-the-art model selection and partition mechanisms, AMSPM not only reduces latency but also enhances computing resource utilization.

关键词： Edge intelligence changing available computing resources adaptive model selection and partition smart city sustainable intelligent services

来源：评论

学校读者我要写书评

暂无评论

Automate Legibility through Inverse Reinforcement Learning

引用

ACM Transactions on Autonomous and Adaptive systems 1000年

作者： Buxin Zeng Yinghui Pan Jing Tang Yifeng Zeng Department of Computer and Information Sciences Northumbria University UK School of Artificial Intelligence & National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Newcastle Business School Northumbria University UK

When intelligent agents act in a stochastic environment, the principle of maximizing expected rewards is used to optimize their policies. The rationality of the maximum rewards becomes a single objective when agents’ decision problems are solved in most cases. This sometimes leads to the agents’ behaviors (the optimal policies for solving the decision problems) that are not legible. In other words, it is difficult for users (or other agents and even humans) to understand the agents’ intentions when they are executing the optimal policies. Hence, it becomes pertinent to consider the legibility of agents’ decision problems. The key challenge lies in formulating a proper legibility function in the problems. Using domain experts’ inputs leans to be subjective and inconsistent in specifying legibility values, and the manual approach quickly becomes infeasible in a complex problem domain. In this article, we aim to learn such a legibility function parallel to developing a (conventional) reward function. We adopt inverse reinforcement learning techniques to automate a legibility function in agents’ decision problems. We first demonstrate the effectiveness of the inverse reinforcement learning technique when legibility is solely considered in a decision problem. Things become complicated when both the reward and legibility functions are to be found. We develop a multi-objective inverse reinforcement learning method to automate the two functions in a good balance simultaneously. We vary problem domains in the performance study and provide empirical results in support.

关键词： Legibility Inverse Reinforcement Learning Decision Making

来源：评论

学校读者我要写书评

暂无评论

Cheetah: Accelerating Dynamic Graph Mining with Grouping Updates

引用

ACM Transactions on Architecture and Code Optimization 1000年

作者： Yi Zhang Xiaomeng Yi Yu Huang Jingrui Yuan Chuangyi Gui Dan Chen Long Zheng Jianhui Yue Xiaofei Liao Hai Jin Jingling Xue National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Zhejiang Lab Hangzhou China National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab Cluster and Grid Computing Lab School of Software Engineering Huazhong University of Science and Technology Wuhan China Eastern Institute of Technology Ningbo China National University of Singapore Singapore Singapore Michigan Technological University Houghton United States School of Computer Science and Engieering UNSW Sydney Kensington Australia

Graph pattern mining is essential for deciphering complex networks. In the real world, graphs are dynamic and evolve over time, necessitating updates in mining patterns to reflect these changes. Traditional methods use fine-grained incremental computation to avoid full re-mining after each update, which improves speed but often overlooks potential gains from examining inter-update interactions holistically, thus missing out on overall efficiency *** this paper, we introduce Cheetah, a dynamic graph mining system that processes updates in a coarse-grained manner by leveraging exploration domains. These domains exploit the community structure of real-world graphs to uncover data reuse opportunities typically missed by existing approaches. Exploration domains, which encapsulate extensive portions of the graph relevant to updates, allow multiple updates to explore the same regions efficiently. Cheetah dynamically constructs these domains using a management module that identifies and maintains areas of redundancy as the graph changes. By grouping updates within these domains and employing a neighbor-centric expansion strategy, Cheetah minimizes redundant data accesses. Our evaluation of Cheetah across five real-world datasets shows it outperforms current leading systems by an average factor of 2.63 ×.

关键词： Graph mining system dynamic graph incremental computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：