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

International Conference for Internet Technology and Secured Transactions (ICITST)

作者： Lo'ai A. Tawalbeh Turki F. Somani Hilal Houssain Computer Engineering Department Umm Al-Qura University Mecca Saudi Arabia Faculty of Computer and Information Technology Jordan University of Science and Technology Irbid Jordan Information and Knowledge Services Division IDB Group Jeddah Saudi Arabia

ISBN: (纸本)9781509048526

There are many recent revolutionary technologies and advances in wireless communication and networking that changed the lives of millions of people around us. The wide spread of the Internet and the smart mobile devices which is equipped with wireless technologies to access the Internet, enabled people to contact each other regardless of their geographic location. These communications involve sharing and transferring sensitive information that must be protected. Therefore, there is an increasing need to secure the individuals and organizations data which is considered a big challenge in communication and networking systems nowadays. The cryptographic algorithms are used to provide many security services to secure the communication channels and networks such as authentication, data integrity and confidentiality. But, recently, there are cyber attacks on these crypto-functions and their implementations, mainly Side Channel Attacks. So, compromising the security of these algorithms implies compromising the security of the communication systems that are using them. Among the most known asymmetric encryption algorithms is the Elliptic Curve Cryptography which is used to protect sensitive data in many financial and government applications. In this research, we present most recent Side channel attacks on Elliptic Curve Cryptography. Also, we discuss the suitable effective countermeasures used to protect from these cyber attacks towards obtaining more secure communication systems.

关键词： computer crime Multimedia communication Elliptic curve cryptography Acceleration

来源：评论

学校读者我要写书评

暂无评论

VID Join： Mapping Trajectories to Points of Interest to Support Location-Based Services

引用

Journal of computer science & Technology 2015年第4期30卷 725-744页

作者：商烁谢珂心郑凯刘家俊文继荣 Department of Computer Science China University of Petroleum Beijing 102249 China School of Information Technology and Electrical Engineering The University of Queensland Brisbane QLD 4072 Australia School of Computer Science and Technology Soochow University Suzhou 215006 China Commonwealth Scientific and Industrial Research Organisation Kenmore QLD 4069 Australia Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing 100080 China

Variable influence duration （VID） join is a novel spatio-temporal join operation between a set T of trajectories and a set P of spatial points. Here, trajectories are traveling histories of moving objects （e.g., travelers）, and spatial points are points of interest （POIs, e.g., restaurants）. VID join returns all pairs of （τs, p） if τs is spatially close to p for a long period of time, where τs is a segment of trajectory τ ∈ T and p ∈ P. Each returned （τs, p） implies that the moving object associated with τs stayed at p （e.g., having dinner at a restaurant）. Such information is useful in many aspects, such as targeted advertising, social security, and social activity analysis. The concepts of influence and influence duration are introduced to measure the spatial closeness between τ and p, and the time spanned, respectively. Compared to the conventional spatio-temporal join, the VID join is more challenging since the join condition varies for different POIs, and the additional temporal requirement cannot be indexed effectively. To process the VID join e？ciently, three algorithms are developed and several optimization techniques are applied, including spatial duplication reuse and time duration based pruning. The performance of the developed algorithms is verified by extensive experiments on real spatial data.

关键词： trajectory spatial database spatial join spatio-temporal join

来源：评论

学校读者我要写书评

暂无评论

On learning vector representations in hierarchical label spaces 3

On learning vector representations in hierarchical label spa...

引用

3rd International Conference on Learning Representations, ICLR 2015

作者： Nam, Jinseok Fürnkranz, Johannes Knowledge Engineering Group Department of Computer Science Technische Universität Darmstadt Germany Knowledge Discovery in Scientific Literature German Institute for Educational Research Germany

An important problem in multi-label classification is to capture label patterns or underlying structures that have an impact on such patterns. This paper addresses one such problem, namely how to exploit hierarchical structures over labels. We present a novel method to learn vector representations of a label space given a hierarchy of labels and label co-occurrence patterns. Our experimental results demonstrate qualitatively that the proposed method is able to learn regularities among labels by exploiting a label hierarchy as well as label co-occurrences. It highlights the importance of the hierarchical information in order to obtain regularities which facilitate analogical reasoning over a label space. We also experimentally illustrate the dependency of the learned representations on the label hierarchy. © 2015 International Conference on Learning Representations, ICLR. All rights reserved.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Performance analysis and forecasting on Crude Oil: Novel support vector regression application to market demand

Performance analysis and forecasting on Crude Oil: Novel sup...

引用

2015 International Conference on Soft Computing Techniques and Implementations, ICSCTI 2015

作者： Seyedan, Seyedeh Mahya Adli, Navid Nazari Omid Mahdi Ebadati, E. Department of Knowledge Engineering and Decision Sciences Kharazmi University Tehran Iran Department of Mathematics and Computer Science Kharazmi University Tehran Iran

ISBN: (纸本)9781467367929

Forecasting demand plays a major role in manufacturing and a great big influence in modern countries. A good forecast can save the cost, lack of demand and expenses of surplus. Existing of oil in the production chain in various manufactures shows its importance. Main Object of this paper is to forecast Iran oil consumption forecasting, by using Support Vector Regression algorithm, which is measured to determine the amount of its extraction to be sell based on market's demands. Predicting the amount of oil extraction is correlated with some other important deliberations in that country. For such diversity, the utilized algorithm employs a neural network to estimate a function between social and economic inputs and oil consumption as output. GDP, population, import and export are the inputs and the vital considered parameters of this study. The required data regarding to the oil production and extraction is taken from OPEC bulletin. To accurately reach to our main aim, we used the data from 1987 to 2011, which the available data from 1987 to 2006 is used to train the algorithm and data from 2007 to 2011 for tests the capability. The results show the algorithm has 0.0005 errors for the last five years and the SVR algorithm can be more accurate than other development approaches in oil consumption forecasting and shows the aim significance. © 2015 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

MRI-based surgical planning for lumbar spinal stenosis

arXiv

引用

arXiv 2017年

作者： Abbati, Gabriele Schüffler, Peter J. Winklhofer, Sebastian Burgstaller, Jakob M. Held, Ulrike Steurer, Johann Bauer, Stefan Buhmann, Joachim M. Department of Engineering Science University of Oxford Eagle House Walton Well Road OxfordOX2 6ED United Kingdom Thomas Fuchs Lab Medical Machine Learning & Computational Pathology Memorial Sloan Kettering Cancer Center 417 E 68th St. New YorkNY10065 United States Klinik für Neuroradiologie University Hospital Zürich Rämistrasse 100 Zürich8091 Switzerland Horten Centre for Patient Oriented Research Knowledge Transfer University Hospital Zürich Pestalozzistrasse 24 Zürich8032 Switzerland Department of Computer Science ETH Zürich Universittstrasse 6 Zürich8006 Switzerland

The most common reason for spinal surgery in elderly patients is lumbar spinal stenosis (LSS). For LSS, treatment decisions based on clinical and radiological information as well as personal experience of the surgeon shows large variance. Thus a standardized support system is of high value for a more objective and reproducible decision. In this work, we develop an automated algorithm to localize the stenosis causing the symptoms of the patient in magnetic resonance imaging (MRI). With 22 MRI features of each of five spinal levels of 321 patients, we show it is possible to predict the location of lesion triggering the symptoms. To support this hypothesis, we conduct an automated analysis of labeled and unlabeled MRI scans extracted from 788 patients. We confirm quantitatively the importance of radiological information and provide an algorithmic pipeline for working with raw MRI scans. Copyright © 2017, The Authors. All rights reserved.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

York University at CLEF eHealth 2015: Medical document retrieval 16

York University at CLEF eHealth 2015: Medical document retri...

引用

16th Conference and Labs of the Evaluation Forum, CLEF 2015

作者： Ghoddousi, Andia Huang, Jimmy Xiangji Information Retrieval and Knowledge Management Research Lab Department of Computer Science and Engineering School of Information Technology York University Canada

This paper presents the results for task 2 of ShAre/CLEF 2015 eHealth Evaluation Lab. We use BM25 as our base normalization method and Pseudo Relevance Feedback to retrieve information regarding patients' health and find the best results to expand the efficiency of information retrieval system. Participants in task 2 are provided with a collection of datasets focused on health web pages. We used queries and submitted 10 runs in TREC style. The runs include the top1000 documents returned for each query. The objective of task 2 is to evaluate the effectiveness of information retrieval system and develop search engines for searching on the web looking for health related documents[1].

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Efficient mining of class association rules with the itemset constraint

Efficient mining of class association rules with the itemset...

引用

作者： Nguyen, Dang Nguyen, Loan T.T. Vo, Bay Pedrycz, Witold Division of Data Science Ton Duc Thang University Ho Chi Minh City Viet Nam Division of Knowledge and System Engineering for ICT Ton Duc Thang University Ho Chi Minh City Viet Nam Faculty of Information Technology Ton Duc Thang University Ho Chi Minh City Viet Nam Faculty of Information Technology Ho Chi Minh City University of Technology Viet Nam College of Electronics and Information Engineering Sejong University Seoul Korea Republic of Department of Electrical and Computer Engineering University of Alberta EdmontonABT6R 2V4 Canada Department of Electrical and Computer Engineering Faculty of Engineering King Abdulaziz University Jeddah21589 Saudi Arabia Systems Research Institute Polish Academy of Sciences Warsaw Poland

Mining class association rules (CARs) with the itemset constraint is concerned with the discovery of rules, which contain a set of specific items in the rule antecedent and a class label in the rule consequent. This task is commonly encountered in mining medical data. For example, when classifying which section of the population is at high risk for the HIV infection, epidemiologists often concentrate on rules which include demographic information such as gender, age, and marital status in the rule antecedent, and HIV-Positive in the rule consequent. There are two naive strategies to solve this problem, namely pre-processing and post-processing. The post-processing methods have to generate and consider a huge number of candidate CARs while the performance of the pre-processing methods depend on the number of records filtered out. Therefore, such approaches are time consuming. This study proposes an efficient method for mining CARs with the itemset constraint based on a lattice structure and the difference between two sets of object identifiers (diffset). Firstly, a lattice structure is built to store all frequent itemsets in the dataset. To reduce memory usage, instead of the entire set of object identifiers, the diffset is used. Secondly, the lattice is traversed to generate only rules which satisfy the itemset constraint. The experimental results show that the proposed algorithm outperforms existing methods in terms of both the mining time and memory usage. © 2016 Elsevier B.V. All rights reserved.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Introduction

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2016年 9792 LNCS卷 1-8页

作者： González-Beltrán, Alejandra Osborne, Francesco Peroni, Silvio Oxford e-Research Centre University of Oxford Oxford United Kingdom Data Science Group Knowledge Media Institute The Open University Milton Keynes United Kingdom Digital and Semantic Publishing Laboratory Department of Computer Science and Engineering University of Bologna Bologna Italy

We provide the motivation and overview of the SAVE-SD workshop series and introduce the manuscripts that were accepted as part of these proceedings of the SAVE-SD 2016 edition. © Springer International Publishing...

ISBN: (纸本)9783319536361

关键词：

来源：评论

学校读者我要写书评

暂无评论

Exponential stability assignment of inverse LQ regulator for neutral systems with time-varying delay

IEEJ Transactions on Electronics, Information and Systems

引用

IEEJ Transactions on Electronics, Information and Systems 2016年第10期136卷 1466-1472页

作者： Matsuki, Tsuyoshi Kubo, Tomohiro Oya, Hidetoshi Department of Electronics and Control Engineering National Institute of Technology Niihama College 7-1 Yagumo-cho Niihama Ehime792-8580 Japan Institute of Science and Technology Tokushima University 2-1 Minamijosanjima-cho Tokushima Tokushima770-8506 Japan Department of Computer Science Faculty of Knowledge Engineering Tokyo City University 1-28-1 Tamazutsumi Setagaya-ku Tokyo158-0087 Japan

In this paper, we propose a design method of an inverse LQ regulator for neutral systems with a time-varying delay, in which the resulting system is assured to have a pre-assigned degree of exponential stability. Using this method, the closed-loop system is asymptotically stabilized and a feedback law constructed easily is the optimal control minimizing a class of a cost functional without relation to the exponential stability assignment. In addition, the regulator promises to have a good robust stability as same as ordinary finite dimensional LQ regulators, even when a static nonlinear or a dynamic linear perturbation is inserted in the control input. Finally, the method is demonstrated by numerical examples with and without the exponential stability assignment. In the simulation, it is shown that the proposed method allows designers to seek more fast closed-loop responses by selecting two scalar parameters and the degree of exponential stability in a condition given by LMIs. © 2016 The Institute of Electrical Engineers of Japan.

关键词： Closed loop systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：