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

2016 International Joint Conference on Neural Networks, IJCNN 2016

作者： Perez, Jorge Luis Rivero Ribeiro, Bernardete Perez, Carlos Morell Department of Informatics Engineering Faculty of Science and Technology University of Coimbra Portugal Department of Informatics Engineering CISUC-University of Coimbra Portugal Department of Computer Sciences Faculty of Computer Sciences Central University of Las Villas Cuba

ISBN: (纸本)9781509006199

With the massive data challenges nowadays and the rapid growing of technology, stream mining has recently received considerable attention. To address the large number of scenarios in which this phenomenon manifests itself suitable tools are required in various research fields. Instance-based data stream algorithms generally employ the Euclidean distance for the classification task underlying this problem. A novel way to look into this issue is to take advantage of a more flexible metric due to the increased requirements imposed by the data stream scenario. In this paper we present a new algorithm that learns a Mahalanobis metric using similarity and dissimilarity constraints in an online manner. This approach hybridizes a Mahalanobis distance metric learning algorithm and a k-NN data stream classification algorithm with concept drift detection. First, some basic aspects of Mahalanobis distance metric learning are described taking into account key properties as well as online distance metric learning algorithms. Second, we implement specific evaluation methodologies and comparative metrics such as Q statistic for data stream classification algorithms. Finally, our algorithm is evaluated on different datasets by comparing its results with one of the best instance-based data stream classification algorithm of the state of the art. The results demonstrate that our proposal is better in some scenarios and has shown to be competitive in others. © 2016 IEEE.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Automated synthesis of safe and robust PID controllers for stochastic hybrid systems

arXiv

引用

arXiv 2017年

作者： Shmarov, Fedor Paoletti, Nicola Bartocci, Ezio Lin, Shan Smolka, Scott A. Zuliani, Paolo School of Computing Newcastle University Department of Computer Science Stony Brook University NY United States Faculty of Informatics Tu Wien Department of Electrical and Computer Engineering Stony Brook University NY United States

We present a new method for the automated synthesis of safe and robust Proportional-Integral-Derivative (PID) controllers for stochastic hybrid systems. Despite their widespread use in industry, no automated method currently exists for deriving a PID controller (or any other type of controller, for that matter) with safety and performance guarantees for such a general class of systems. In particular, we consider hybrid systems with nonlinear dynamics (Lipschitz-continuous ordinary differential equations) and random parameters, and we synthesize PID controllers such that the resulting closed-loop systems satisfy safety and performance constraints given as probabilistic bounded reachability properties. Our technique leverages SMT solvers over the reals and nonlinear differential equations to provide formal guarantees that the synthesized controllers satisfy such properties. These controllers are also robust by design since they minimize the probability of reaching an unsafe state in the presence of random disturbances. We apply our approach to the problem of insulin regulation for type 1 diabetes, synthesizing controllers with robust responses to large random meal disturbances, thereby enabling them to maintain blood glucose levels within healthy, safe ranges. Copyright © 2017, The Authors. All rights reserved.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

VisualUrText: A Text Analytics Tool for Unstructured Textual Data

引用

Journal of Physics: Conference Series 2018年第1期1018卷

作者： Zuraini Zainol Mohd T.H. Jaymes Puteri N.E. Nohuddin Computer Science Department Faculty of Science and Defence Technology Universiti Pertahanan Nasional Malaysia Kem Sungai Besi Kuala Lumpur Malaysia Institute of Visual Informatics Universiti Kebangsaan Malaysia Bangi Malaysia

The growing amount of unstructured text over Internet is tremendous. Text repositories come from Web 2.0, business intelligence and social networking applications. It is also believed that 80-90% of future growth data is available in the form of unstructured text databases that may potentially contain interesting patterns and trends. Text Mining is well known technique for discovering interesting patterns and trends which are non-trivial knowledge from massive unstructured text data. Text Mining covers multidisciplinary fields involving information retrieval (IR), text analysis, natural language processing (NLP), data mining, machine learning statistics and computational linguistics. This paper discusses the development of text analytics tool that is proficient in extracting, processing, analyzing the unstructured text data and visualizing cleaned text data into multiple forms such as Document Term Matrix (DTM), Frequency Graph, Network Analysis Graph, Word Cloud and Dendogram. This tool, VisualUrText, is developed to assist students and researchers for extracting interesting patterns and trends in document analyses.

关键词：

来源：评论

学校读者我要写书评

暂无评论

引用

作者： Nguyen, Linh Anh Nguyen, Thi Hong Khanh Nguyen, Ngoc-Thanh Ha, Quang-Thuy Division of Knowledge and System Engineering for ICT Faculty of Information Technology Ton Duc Thang University Ho Chi Minh City Viet Nam Institute of Informatics University of Warsaw Warsaw Poland Electric Power University Hoang Quoc Viet Tu Liem Hanoi Viet Nam Department of Information Systems Faculty of Computer Science and Management Wroclaw University of Science and Technology Str. Wyb. Wyspianskiego 27 Wroclaw50-370 Poland Faculty of Information Technology VNU University of Engineering and Technology Xuan Thuy Hanoi Viet Nam

We introduce comparisons w.r.t. information between interpretations in paraconsistent description logics and use them to define bisimilarity for such logics. This notion is useful for concept learning in description logics when inconsistencies occur. We give preservation results and the Hennessy-Milner property for comparisons w.r.t. information in paraconsistent description logics. As consequences, we obtain also invariance results and the Hennessy-Milner property for bisimilarity in paraconsistent description logics. © 2017 - IOS Press and the authors. All rights reserved.

关键词： Data description

来源：评论

学校读者我要写书评

暂无评论

Differential evolution with preferential interaction network

Differential evolution with preferential interaction network

引用

Congress on Evolutionary Computation

作者： Pavel Krömer Miloš Kudělka Roman Senkerik Michal Pluhacek Dept. of Computer Science VŠB - Technical University of Ostrava Ostrava Czech Republic Faculty of Applied Informatics Tomas Bata University in Zlin Zlin Czech Republic

ISBN: (纸本)9781509046027

Population-based metaheuristic optimization methods are built upon an algorithmic implementation of different types of complex dynamic behaviours. The problem-solving strategies they implement are often inspired by various natural and social phenomena whose fundamental principles were adopted for the use in practical search and optimization problems. New insights into complex systems, attained among others within the fields of network science and social network analysis, can be successfully incorporated into the study of evolutionary and swarm methods and used to improve their efficiency. Preferential attachment is a principle governing the growth of many real-world networks. That makes it a natural candidate for the use with network-based models of artificial evolution. Differential evolution is a widely-used evolutionary algorithm valued for its efficiency and versatility as well as simplicity and ease of implementation. In this paper, a variant of differential evolution, guided by an auxiliary model of population dynamics built with the help of the preferential attachment principle, is designed. The efficiency of the proposed approach is analyzed on the CEC 2017 real-parameter optimization benchmark.

关键词： Sociology Statistics Optimization Heuristic algorithms Benchmark testing Algorithm design and analysis Information exchange

来源：评论

学校读者我要写书评

暂无评论

Paper-based verification design of trade business license in Indonesia

引用

Telkomnika (Telecommunication Computing Electronics and Control) 2016年第4期14卷 1527-1533页

作者： Pizaini Guritman, Sugi Sukoco, Heru Department of Informatics Engineering Faculty of Science and Technology Universitas Islam Negeri Sultan Syarif Kasim Riau Indonesia Department of Mathematics Bogor Agricultural University Indonesia Department of Computer Science Bogor Agricultural University Indonesia Faculty of Mathematics and Natural Science Bogor Agricultural University Indonesia

The trade business license certificate (SIUP) is a paper-based license to conduct trade businesses in Indonesia issued by the government. Until today, there is no mechanism for verifying the validity of document unless to verify it manually. The current paper presents a design that allows paperbased verification of the printed trade business license. It aims to provide the verification mechanism and ensure the document validity. Our design implemented digital signature with QR Code image that placed into the document and the digital certificate issued by a certification authority (CA). The proposed scheme generated 442 Bytes of data and version 14 of QR Code to scan easily by a reader device. The experimental result indicates that our scheme is easy and feasible to implement in Indonesia with guaranteed the document integrity, authentication, and nonrepudiation. © 2016 Universitas Ahmad Dahlan.

关键词： Commerce

来源：评论

学校读者我要写书评

暂无评论

Publisher Correction: Global estimates on the number of people blind or visually impaired by cataract: a meta-analysis from 2000 to 2020

引用

Eye (London, England) 2024年第11期38卷 2229-2231页

作者： Konrad Pesudovs Hugh R. Taylor Tabassom Sedighi Rupert R. A. Bourne Shahina Pardhan Van Charles Lansingh John H. Kempen Ian Tapply Arthur G. Fernandes Maria Vittoria Cicinelli Alessandro Arrigo Nicolas Leveziel Serge Resnikoff Seth Flaxman Mukkharram M. Bikbov Tasanee Braithwaite Alain Bron Ching-Yu Cheng Monte A. Del Monte Joshua R. Ehrlich Leon B. Ellwein David Friedman João M. Furtado Gus Gazzard Ronnie George M. Elizabeth Hartnett Jost B. Jonas Rim Kahloun Moncef Khairallah Rohit C. Khanna Janet Leasher Julie-Anne Little Vinay Nangia Michal Nowak Tunde Peto Pradeep Ramulu Fotis Topouzis Mitiadis Tsilimbaris Ya Xing Wang Ningli Wang Paul Svitil Briant Theo Vos Katrin Burkart Kaleb Coberly Xiaochen Dai Stephen S. Lim Tomislav Mestrovic Ali H. Mokdad Christopher J. L. Murray Jaimie D. Steinmetz Awoke Misganaw Yohannes Habtegiorgis Abate Mohammad Abdollahi Mozhan Abdollahi Ayele Mamo Abebe Olumide Abiodun Richard Gyan Aboagye Woldu Aberhe Abrha Hasan Abualruz Hiwa Abubaker Ali Eman Abu-Gharbieh Salahdein Aburuz Tadele Girum Girum Adal Mesafint Molla Adane Isaac Yeboah Addo Qorinah Estiningtyas Sakilah Adnani Muhammad Sohail Afzal Muhammad Umair Shahin Aghamiri Bright Opoku Ahinkorah Aqeel Ahmad Sajjad Ahmad Ali Ahmadi Siamak Sabour Ayman Ahmed Haroon Ahmed Ahmad Samir Alfaar Abid Ali Syed Shujait Shujait Ali Awais Altaf Hubert Amu Emmanuel Manu Sofia Androudi Rodrigo Anguita Abhishek Anil Rimple Jeet Kaur Muhammad Aaqib Shamim Saeid Anvari Anayochukwu Edward Anyasodor Francis Appiah Jalal Arabloo Haleh Ayatollahi Mosab Arafat Damelash Areda Reza Arefnezhad Brhane Berhe Aregawi Akeza Awealom Asgedom Tahira Ashraf Seyyed Shamsadin Athari Bantalem Tilaye Tilaye Atinafu Birhan Tsegaw Taye Maha Moh’d Wahbi Atout Alok Atreya Ahmed Y. Azzam Hassan Babamohamadi Sara Bagherieh Yogesh Bahurupi Atif Amin Baig Shumaila Nargus Biswajit Banik Mainak Bardhan Saurav Basu Kavita Batra Nebiyou Simegnew Bayileyegn Fatemeh Bazvand Addisu Shunu Beyene Awoke Masrie Asrat Derese Devidas S. Bhagat Akshaya Srikanth Bhagavathula Pankaj Bh Medicine & Health University of New South Wales Sydney NSW Australia School of Optometry and Vision Science University of New South Wales Sydney NSW Australia School of Population and Global Health University of Melbourne Carlton VIC Australia Vision and Eye Research Institute Anglia Ruskin University Cambridge UK HelpMeSee Instituto Mexicano de Oftalmologia Santiago de Querétaro Mexico University of Miami Gables FL USA University of Utah Salt Lake City UT USA Chief Medical Office HelpMeSee New York NY USA Mexican Institute of Ophthalmology Queretaro Mexico Department of Ophthalmology Massachusetts Eye and Ear/Shepens Eye Research Institute/Harvard Medical School Boston MA USA Eye Unit MyungSung Christian Medical Center (MCM) Comprehensive Specialized Hospital and MyungSun Medical College Addis Ababa Ethiopia Department of Ophthalmology Addis Ababa University Addis Ababa Ethiopia Sight for Souls Bellevue WA USA Department of Ophthalmology Harvard University Boston MA USA Eye Unit MyungSung Medical College Addis Ababa Ethiopia Addenbrooke’s Hospital Cambridge UK Department of Ophthalmology Cambridge University Hospitals Cambridge UK Federal University of Sao Paolo Sao Paolo SP Brazil University of Calgary Calgary AB Canada Department of Ophthalmology and Visual Sciences Federal University of São Paulo Sao Paulo Brazil School of Medicine Vita-Salute San Raffaele University Milan Italy Department of Ophthalmology IRCCS San Raffaele Scientific Institute Milan Italy Department of Ophthalmology San Raffaele Scientific Institute Milano Italy IRCCS San Raffaele Scientific Institute Vita-Salute University Milan Italy Scientific Institute San Raffaele Hospital Vita-Salute University Milan Italy University of Poitiers Poitiers France CHU de Poitiers Poitiers France Ophthalmology Department CHU de Poitiers (Poitiers University Hospital) Poitiers France Unité 1084 National Institute of Health and Medical Research (INSERM) Poitiers France

来源：评论

学校读者我要写书评

暂无评论

Approximation strategies for generalized binary search in weighted trees

arXiv

引用

arXiv 2017年

作者： Dereniowski, Dariusz Kosowski, Adrian Uznanski, Przemyslaw Zou, Mengchuan Faculty of Electronics Telecommunications and Informatics Gdansk University of Technology Poland Inria Paris Irif Université Paris Diderot France Department of Computer Science Eth Zürich Switzerland

We consider the following generalization of the binary search problem. A search strategy is required to locate an unknown target node t in a given tree T. Upon querying a node v of the tree, the strategy receives as a reply an indication of the connected component of T \ {v} containing the target t. The cost of querying each node is given by a known non-negative weight function, and the considered objective is to minimize the total query cost for a worst-case choice of the target. Designing an optimal strategy for a weighted tree search instance is known to be strongly NP-hard, in contrast to the unweighted variant of the problem which can be solved optimally in linear time. Here, we show that weighted tree search admits a quasi-polynomial time approximation scheme (QPTAS): for any 0 O(log n/ϵ2). Thus, the problem is not APX-hard, unless NP ⊆ DTIME(nO(log n)). By applying a generic reduction, we obtain as a corollary that the studied problem admits a polynomial-time O(√ log n)-approximation. This improves previous Ô (log n)-approximation approaches, where the Ô-notation disregards O(poly log log n)- factors. Copyright © 2017, The Authors. All rights reserved.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Power structure in Chilean news media

arXiv

引用

arXiv 2017年

作者： Bahamonde, Jorge Bollen, Johan Elejalde, Erick Ferres, Leo Poblete, Barbara Department of Computer Science University of Chile Santiago Chile School of Informatics and Computing Indiana University BloomingtonIN United States Computer Science Department Faculty of Engineering Universidad de Concepción Concepción Chile Institute of Data Science Faculty of Engineering Universidad del Desarrollo & Telefónica R&D Santiago Chile

Even democracies endowed with the most active free press struggle to maintain diversity of news coverage. Consolidation and market forces may cause only a few dominant players to control the news cycle. Editorial policies may be biased by corporate ownership relations, narrowing news coverage and focus. To an increasing degree this problem also applies to social media news distribution, since it is subject to the same socio-economic drivers. To study the effects of consolidation and ownership on news diversity, we model the diversity of Chilean coverage on the basis of ownership records and social media data. We create similarity networks of news outlets on the basis of their ownership and the topics they cover. We then examine the relationships between the topology of ownership networks and content similarity to characterize how ownership affects news coverage. A network analysis reveals that Chilean media is highly concentrated both in terms of ownership as well as in terms of topics covered. Our method can be used to determine which groups of outlets and ownership exert the greatest influence on news coverage. Copyright © 2017, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Comparative analysis of RC4+ algorithm, RC4 NGG algorithm and RC4 GGHN algorithm on image file security

引用

IOP Conference Series: Materials science and Engineering 2018年第1期420卷

作者： F Akbar H Mawengkang S Efendi Master Program (S2) of Informatics Engineering Faculty of Computer Science and Information Technology Universitas Sumatera Utara Medan Indonesia. Department of Mathematics University Sumatera Utara Medan Indonesia. Faculty of Computer Science and Information Technology University of Sumatera Utara Medan Indonesia.

File security is very important in maintaining the confidentiality of the information contained in the file. For that we need a way for information to be kept secrecy, that is with the science of cryptography. Cryptography is one method that disguises data to form encrypted data. In the symmetric RC4+ (Ron Code or Rivest's Cipher) algorithm, it provides secure message security and is an efficient stream cipher. RC4 NGG stream cipher algorithm 3-5 times faster than RC4 algorithm and but still have weakness in KSA randomization. The RC4 GGHN stream cipher algorithm is based on the RC4 algorithm and is relatively more efficient but still has weaknesses. Based on literature review from several research sources, it was stated that RC4+, RC4 NGG, RC4 GGHN are algorithms that are faster and more efficient than RC4 algorithm. Therefore, it is necessary to compare the encryption process with the aim of comparing and knowing which algorithm is better from running time and algorithm complexity. In this research we will perform two tests on each algorithm, image encryption using different key length and same image size and image encryption using the same key length and different image size. The results obtained in this research is RC4 NGG algorithm is the fastest algorithm between the three algorithms that is 13.3% faster than RC4+ and 10.2% faster than RC4 GGHN where the key lengths used in encryption do not affect the processing time and image size used in encryption very affects the processing time.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：