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

MOT Knowledge Model Integration Rules for Knowledge Warehousing

Procedia Computer Science 2017年 112卷 544-553页

作者： Rim Ayadi Yasser Hachaichi Jamel Feki Multimedia InfoRmation Systems and Advanced Computing Laboratory University of Sfax Sfax Tunisia Department of Computer Science and Quantitative Methods Higher Institute of Business Administration of Sfax Faculty of Computing and IT University of Jeddah Jeddah Saudi Arabia

A knowledge warehousing process aims to build an intelligent decision support system. It collects, homogenizes, integrates and stores knowledge for a decision-making process. In this paper, we are interested in knowledge integration. More accurately, we propose an integration process for knowledge homogenized/modeled according to the MOT (Modeling with Object Types) knowledge model. This integration process consists of three ordered steps based on the type of schemas to integrate and their similarity. For this process, we define five integration rules based on semantic relationships between elements of MOT knowledge models, and then we develop an algorithm using these integration rules.

关键词： Knowledge warehouse Knowledge integration MOT Knowledge Semantic relationships Integration rules

来源：评论

学校读者我要写书评

暂无评论

Novelty detection in data stream clustering using the artificial immune system 13

Novelty detection in data stream clustering using the artifi...

引用

13th European, Mediterranean and Middle Eastern Conference on information systems, EMCIS 2016

作者： Abid, Amai Jamoussi, Salma Multimedia Information systems and Advanced Computing Laboratory MIRACL Sfax University Tunisia

ISBN: (纸本)9789606897092

Data stream clustering poses many challenges to the data mining community where traditional data mining techniques become infeasible to mine such continuous flow of data. This paper presents a novel method for data stream clustering. In particular, we address the problem of novelty detection in data streams. For this purpose, the proposed method uses the Artificial Immune System meta-heuristic. The latter has been widely used for unsupervised data mining tasks and it owns the property of adaptability required by data stream clustering algorithms. Our method, called AIS-Clus (Artificial Immune System for data stream Clustering), is able to detect novel concepts using the performance of the learning process of AIS meta-heuristic. Furthermore, AIS-Clus has the ability to adapt its model to handle novel arriving items in textual data streams. Experimental results are given for two textual datasets and promising results are obtained. © Proceedings of the 13th European, Mediterranean and Middle Eastern Conference on information systems, EMCIS 2016. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Towards proactive SDN-controller attack and failure resilience

Towards proactive SDN-controller attack and failure resilien...

引用

International Conference on computing, Networking and Communications (ICNC)

作者： Mohamed Azab José A.B. Fortes City of Scientific Research and Technological Applications Alexandria University Alex Egypt Advanced Computing and Information Systems Laboratory ECE University of Florida USA

ISBN: (纸本)9781509045891

SDN networks rely mainly on a set of software defined modules, running on generic hardware platforms, and managed by a central SDN controller. The tight coupling and lack of isolation between the controller and the underlying host limit the controller resilience against host-based attacks and failures. That controller is a single point of failure and a target for attackers. “Linux-containers” is a successful thin virtualization technique that enables encapsulated, host-isolated execution-environments for running applications. In this paper we present PAFR, a controller sandboxing mechanism based on Linux-containers. PAFR enables controller/host isolation, plug-and-play operation, failure-and-attack-resilient execution, and fast recovery. PAFR employs and manages live remote checkpointing and migration between different hosts to evade failures and attacks. Experiments and simulations show that the frequent employment of PAFR's live-migration minimizes the chance of successful attack/failure with limited to no impact on network performance.

关键词： Containers Linux Resilience Checkpointing Security Control systems Servers

来源：评论

学校读者我要写书评

暂无评论

Joint power allocation and splitting (JoPAS) for SWIPT in doubly selective vehicular channels

Joint power allocation and splitting (JoPAS) for SWIPT in do...

引用

作者： Wang, Dexin Zhang, Rongqing Cheng, Xiang Quan, Zhi Yang, Liuqing Department of Electrical and Computer Engineering Colorado State University Fort CollinsCO80523 United States State Key Laboratory of Advanced Optical Communication Systems and Networks School of Electronics Engineering and Computing Sciences Peking University Beijing100871 China College of Information Engineering Shenzhen University Shenzhen518060 China

In recent years, the capacity and charging speed of batteries have become the bottleneck of mobile communications systems. With the development of wireless power transfer technologies, simultaneous wireless information and power transfer (SWIPT) emerges as a potential solution for green communications. Due to hardware limitations, the energy harvesting circuit cannot decode the signal directly. Power splitting is a popular and effective solution to this problem. Consequently, the problem of optimal power splitting at the receiver arises in addition to the conventional problem of power allocation in communications systems. SWIPT in vehicular networks is a promising technology that helps extend the lifetime of sensors installed on vehicles and roadside units. However, existing SWIPT schemes fail to consider the doubly selective characteristics of vehicular channels. In this paper, joint power allocation and splitting for SWIPT over such channels is proposed with the objective of maximizing the achievable data rate with constraints on the delivered energy. Simulations show significantly improved performance compared with the existing dynamic power splitting scheme. A suboptimal algorithm, named decoupled power allocation and splitting, is also proposed with significantly reduced computational complexity and simulations demonstrate its near-optimum performance. © 2017 IEEE.

关键词： Energy harvesting

来源：评论

学校读者我要写书评

暂无评论

An environment for sustainable research software in Germany and beyond: Current state, open challenges, and call for action

arXiv

引用

arXiv 2020年

作者： Anzt, Hartwig Bach, Felix Druskat, Stephan Löffler, Frank Loewe, Axel Renard, Bernhard Y. Seemann, Gunnar Struck, Alexander Achhammer, Elke Aggarwal, Piush Appel, Franziska Bader, Michael Brusch, Lutz Busse, Christian Chourdakis, Gerasimos Dabrowski, Piotr W. Ebert, Peter Flemisch, Bernd Friedl, Sven Fritzsch, Bernadette Funk, Maximilian D. Gast, Volker Goth, Florian Grad, Jean-Noël Hermann, Sibylle Hohmann, Florian Janosch, Stephan Kutra, Dominik Linxweiler, Jan Muth, Thilo Peters-Kottig, Wolfgang Rack, Fabian Raters, Fabian H.C. Rave, Stephan Reina, Guido Reißig, Malte Ropinski, Timo Schaarschmidt, Joerg Seibold, Heidi Thiele, Jan P. Uekerman, Benjamin Unger, Stefan Weeber, Rudolf Germany Innovative Computing Lab University of Tennessee KnoxvilleTN United States Department of English Studies Friedrich Schiller University Jena Germany Germany Department of Computer Science Humboldt-Universität zu Berlin Germany Heinz Nixdorf Chair for Distributed Information Systems Friedrich Schiller University Jena Germany Michael Stifel Center Jena Germany Center for Computation and Technology Louisiana State University Baton Rouge United States Germany Robert Koch Institute Berlin Germany Hasso Plattner Institute Faculty of Digital Engineering University of Potsdam Germany Institute for Experimental Cardiovascular Medicine University Heart Centre Freiburg Bad Krozingen Germany Faculty of Medicine University of Freiburg Freiburg Germany Matters of Activity. Image Space Material. Cluster of Excellence at Humboldt-Universität zu Berlin Germany Technische Universität München Germany Language Technology Lab Universität Duisburg-Essen Germany Germany Department of Informatics Technical University of Munich Germany Technische Universität Dresden Germany Deutsches Krebsforschungszentrum Heidelberg Germany Scientific Computing in Computer Science Technical University Munich Germany School of Computing Communication and Business Hochschule für Technik und Wirtschaft Berlin Germany Center for Bioinformatics Saar Saarland Informatics Campus Germany Institute for Modelling Hydraulic and Environmental Systems University of Stuttgart Germany Berlin Institute of Health Germany Scientific Computing Alfred Wegener Institute Helmholtz Center for Polar and Marine Research Bremerhaven Germany Max-Planck-Gesellschaft e.V. Institut für Theoretische Physik und Astrophysik Universität Würzburg Germany Institut für Computerphysik University of Stuttgart Germany University Library University of Stuttgart Germany Universität Bremen Germany Max Planck Institute of Molecular Cell Biology and Genetics Dresden Germany European Molecular Biology Laboratory Heidelb

Research software has become a central asset in academic research. It optimizes existing and enables new research methods, implements and embeds research knowledge, and constitutes an essential research product in itself. Research software must be sustainable in order to understand, replicate, reproduce, and build upon existing research or conduct new research effectively. In other words, software must be available, discoverable, usable, and adaptable to new needs, both now and in the future. Research software therefore requires an environment that supports sustainability. Hence, a change is needed in the way research software development and maintenance are currently motivated, incentivized, funded, structurally and infrastructurally supported, and legally treated. Failing to do so will threaten the quality and validity of research. In this paper, we identify challenges for research software sustainability in Germany and beyond, in terms of motivation, selection, research software engineering personnel, funding, infrastructure, and legal aspects. Besides researchers, we specifically address political and academic decision-makers to increase awareness of the importance and needs of sustainable research software practices. In particular, we recommend strategies and measures to create an environment for sustainable research software, with the ultimate goal to ensure that software-driven research is valid, reproducible and sustainable, and that software is recognized as a first class citizen in research. This paper is the outcome of two workshops run in Germany in 2019, at deRSE19 - the first International Conference of Research Software Engineers in Germany - and a dedicated DFG-supported follow-up workshop in Berlin. Copyright © 2020, The Authors. All rights reserved.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Regularized Training of the Extreme Learning Machine using the Conjugate Gradient Method

Regularized Training of the Extreme Learning Machine using t...

引用

International Joint Conference on Neural Networks

作者： Philip de Chazal Mark D. McDonnell Charles Perkins Centre Faculty of Engineering and Information Technology School of Electrical and Information Engineering The University of Sydney Computational Learning Systems Laboratory Advanced Computing Research Centre School of Information Technology and Mathematical Sciences University of South Australia

ISBN: (纸本)9781509061839

We describe a new algorithm providing regularized training of the extreme learning machine (ELM) that uses a modified conjugate gradient (CG) method to determine the network hidden to output weights. The CG method is modified to include a validation set performance calculation at each iteration step. The solution is initialized to zero and during the CG iterations, we monitor the validation set error. When the error begins to rise we terminate the CG algorithm. The operations per iteration is O(P~2), where P is the number of output weights, which is significantly faster than the O(P~3) operations per iteration required by ridge regression regularization methods. We demonstrate the effectiveness of our method by classifying the MNIST database and achieve an accuracy of 99.2% using an ELM classifier processing the unmodified pixel values.

关键词： Cholesky Conjugate gradient method Early stopping Extreme Learning Machine Regularization QR SVD conjugate gradient methods Learning machines Cholesky iterative methods quick release Swine vesicular disease Singular value decomposition BMP8B protein, human performance calculation gradient methods Ecosystem models Elm TEST SETS

来源：评论

学校读者我要写书评

暂无评论

Adapted pruning scheme for the framework of imbalanced data-sets

引用

Procedia Computer Science 2017年 112卷 1542-1553页

作者： Ikram CHAABANE Radhouane GUERMAZI Mohamed HAMMAMI Multimedia InfoRmation systems and Advanced Computing Laboratory Sfax University Tunis road Km 10 3021 Sfax Tunisia Saudi Electronic University Abu Bakr Street PO Box: 93499 11673 Riyad Kingdom of Saudi Arabia

Learning from imbalanced data is attracting an increasing interest by the machine learning community. This is mainly due to the high number of real applications that are affected by this situation. The adaptation of the standard decision trees to deal with imbalanced data represents one of the important number of approaches that have been developed to address this problem. This adaptation has been proposed under three different perspectives: splitting criterion, assignment rule and pruning. In this paper, we focus our attention to the pruning of decision trees. We propose an adaptation of the standard pruning algorithm MCCP to address the skewed-data problem. Our contribution affects two levels: adaption of the metric used in selecting nodes to be firstly pruned and change of the evaluation measure used in selecting the best decision-tree through the pruning set. Our goal is to show that, contrary to the popular belief in the literature enquiring into the uselessness of decision tree pruning, an adaptive pruning technique for imbalanced situations is more efficient and more accurate towards the minority class. A total of twelve binary class data-sets having different imbalance ratio are used to test the performance of the proposed method. Experimental results show that the proposed post-pruning approach can increase the performance of imbalanced decision trees in terms of evaluation measures that are recent and appropriate for the context of imbalanced classification.

关键词： imbalanced class decision-tree pruning skewed data-sets IBA B42

来源：评论

学校读者我要写书评

暂无评论

Input optics systems of the KAGRA detector during O3GK (vol 2023, 023F01, 2023)

引用

PROGRESS OF THEORETICAL AND EXPERIMENTAL PHYSICS 2023年第5期2023卷

作者： Akutsu, T. Ando, M. Arai, K. Arai, Y. Araki, S. Araya, A. Aritomi, N. Asada, H. Aso, Y. Bae, S. Bae, Y. Baiotti, L. Bajpai, R. Barton, M. A. Cannon, K. Cao, Z. Capocasa, E. Chan, M. Chen, C. Chen, K. Chen, Y. Chiang, C-I Chu, H. Chu, Y-K Eguchi, S. Enomoto, Y. Flaminio, R. Fujii, Y. Fujikawa, Y. Fukunaga, M. Fukushima, M. Furuhata, T. Gao, D. Ge, G-G Ha, S. Hagiwara, A. Haino, S. Han, W-B Hasegawa, K. Hattori, K. Hayakawa, H. Hayama, K. Himemoto, Y. Hiranuma, Y. Hirata, N. Hirose, E. Hong, Z. Hsieh, B-H Huang, G-Z Huang, H-Y Huang, P. Huang, Y-C Huang, Y-J Hui, D. C. Y. Ide, S. Ikenoue, B. Imam, S. Inayoshi, K. Inoue, Y. Ioka, K. Ito, K. Itoh, Y. Izumi, K. Jeon, C. Jin, H-B Jung, K. Jung, P. Kaihotsu, K. Kajita, T. Kakizaki, M. Kamiizumi, M. Kanbara, S. Kanda, N. Kang, G. Kataoka, Y. Kawaguchi, K. Kawai, N. Kawasaki, T. Kim, C. Kim, J. Kim, J. C. Kim, Ws Kim, Y-M Kimura, N. Kita, N. Kitazawa, H. Kojima, Y. Kokeyama, K. Komori, K. Kong, A. K. H. Kotake, K. Kozakai, C. Kozu, R. Kumar, R. Kume, J. Kuo, C. Kuo, H-S Kuromiya, Y. Kuroyanagi, S. Kusayanagi, K. Kwak, K. Lee, H. K. Lee, H. W. Lee, R. Leonardi, M. Li, K. L. Lin, L. C-C Lin, C-Y Lin, F-K Lin, F-L Lin, H. L. Liu, G. C. Luo, L-W Majorana, E. Marchio, M. Michimura, Y. Mio, N. Miyakawa, O. Miyamoto, A. Miyazaki, Y. Miyo, K. Miyoki, S. Mori, Y. Morisaki, S. Moriwaki, Y. Nagano, K. Nagano, S. Nakamura, K. Nakano, H. Nakano, M. Nakashima, R. Nakayama, Y. Narikawa, T. Naticchioni, L. Negishi, R. Quynh, L. Nguyen Ni, W-T Nishizawa, A. Nozaki, S. Obuchi, Y. Ogaki, W. Oh, J. J. Oh, S. H. Ohashi, M. Ohishi, N. Ohkawa, M. Ohta, H. Okutani, Y. Okutomi, K. Oohara, K. Ooi, C. Oshino, S. Otabe, S. Pan, K-C Pang, H. Parisi, A. Park, J. Arellano, F. E. Pena Pinto, I. Sago, N. Saito, S. Saito, Y. Sakai, K. Sakai, Y. Sakuno, Y. Sato, S. Sato, T. Sawada, T. Sekiguchi, T. Sekiguchi, Y. Shao, L. Shibagaki, S. Shimizu, R. Shimoda, T. Shimode, K. Shinkai, H. Shishido, T. Shoda, A. Somiya, K. Son, E. J. Sotani, H. Sugimoto, R. Suresh, J. Suzuki, T. Suzuki, T. Tagoshi, H. Takahashi, H Gravitational Wave Science Project National Astronomical Observatory of Japan 2-21-1 Osawa Mitaka City Tokyo 181-8588 Japan Advanced Technology Center National Astronomical Observatory of Japan 2-21-1 Osawa Mitaka City Tokyo 181-8588 Japan Department of Physics The University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo 113-0033 Japan Research Center for the Early Universe The University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo 113-0033 Japan Institute for Cosmic Ray Research KAGRA Observatory The University of Tokyo 5-1-5 Kashiwa-no-Ha Kashiwa City Chiba 277-8582 Japan Accelerator Laboratory High Energy Accelerator Research Organization (KEK) 1-1 Oho Tsukuba City Ibaraki 305-0801 Japan Earthquake Research Institute The University of Tokyo 1-1-1 Yayoi Bunkyo-ku Tokyo 113-0032 Japan Department of Mathematics and Physics Graduate School of Science and Technology Hirosaki University 3 Bunkyo-cho Hirosaki Aomori 036-8561 Japan Kamioka Branch National Astronomical Observatory of Japan 238 Higashi-Mozumi Kamioka-cho Hida City Gifu 506-1205 Japan The Graduate University for Advanced Studies (SOKENDAI) 2-21-1 Osawa Mitaka City Tokyo 181-8588 Japan Korea Institute of Science and Technology Information 245 Daehak-ro Yuseong-gu Daejeon 34141 Republic of Korea National Institute for Mathematical Sciences 70 Yuseong-daero 1689 Beon-gil Yuseong-gu Daejeon 34047 Republic of Korea International College Osaka University 1-1 Machikaneyama-cho Toyonaka City Osaka 560-0043 Japan School of High Energy Accelerator Science The Graduate University for Advanced Studies (SOKENDAI) 1-1 Oho Tsukuba City Ibaraki 305-0801 Japan Department of Astronomy Beijing Normal University Xinjiekouwai Street 19 Haidian District Beijing 100875 China Department of Applied Physics Fukuoka University 8-19-1 Nanakuma Jonan Fukuoka City Fukuoka 814-0180 Japan Department of Physics Tamkang University No. 151 Yingzhuan Road Danshui Dist. New Taipei City 25137 Taiwan Department of Physics

KAGRA, the underground and cryogenic gravitational-wave detector, was operated for its solo observation from February 25 to March 10, 2020, and its first joint observation with the GEO 600 detector from April 7 to April 21, 2020 (O3GK). This study presents an overview of the input optics systems of the KAGRA detector, which consist of various optical systems, such as a laser source, its intensity and frequency stabilization systems, modulators, a Faraday isolator, mode-matching telescopes, and a high-power beam dump. These optics were successfully delivered to the KAGRA interferometer and operated stably during the observations. The laser frequency noise was observed to limit the detector sensitivity above a few kilohertz, whereas the laser intensity did not significantly limit the detector sensitivity.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Joint product numerical range and geometry of reduced density matrices

引用

Science China(Physics,Mechanics & Astronomy) 2017年第2期60卷 9-17页

作者： Jianxin Chen Cheng Guo Zhengfeng Ji Yiu-Tung Poon Nengkun YU Bei Zeng Jie Zhou Joint Center for Quantum Information and Computer Science University of Maryland College Park 20740 USA Institute for Advanced Study Tsinghua University Beijing 100084 China Centre for Quantum Computation ＆ Intelligent Systems School of Software Faculty of Engineering and Information Technology University of Technology Sydney Sydney 2007 Australia State Key Laboratory of Computer Science.Institute of Software Chinese Academy of Sciences Beijing 100084 China Department of Mathematics Iowa State University Ames 50011-2140 USA Institute for Quantum Computing University of Waterloo Waterloo N2L 3G1 Canada Department of Mathematics ＆ Statistics University of Guelph Guelph N1G 2 W1 Canada Perimeter Institute for Theoretical Physics Waterloo N2L 2Y5 Canada

The reduced density matrices of a many-body quantum system form a convex set, whose three-dimensional projection is convex in R3. The boundary of may exhibit nontrivial geometry, in particular ruled surfaces. Two physical mechanisms are known for the origins of ruled surfaces： symmetry breaking and gapless. In this work, we study the emergence of ruled surfaces for systems with local Hamiltonians in infinite spatial dimension, where the reduced density matrices are known to be separable as a consequence of the quantum de Finetti＇s theorem. This allows us to identify the reduced density matrix geometry with joint product numerical range II of the Hamiltonian interaction terms. We focus on the case where the interaction terms have certain structures, such that a ruled surface emerges naturally when taking a convex hull of ∏. We show that, a ruled surface on sitting in ∏ has a gapless origin, otherwise it has a symmetry breaking origin. As an example, we demonstrate that a famous ruled surface, known as the oloid, is a possible shape of , with two boundary pieces of symmetry breaking origin separated by two gapless lines.

关键词： reduced density matrices quantum tomography numerical range quantum information oloid ruled surface

来源：评论

学校读者我要写书评

暂无评论

Fake news propagate differently from real news even at early stages of spreading

arXiv

引用

arXiv 2018年

作者： Zhao, Zilong Zhao, Jichang Sano, Yukie Levy, Orr Takayasu, Hideki Takayasu, Misako Li, Daqing Wu, Junjie Havlin, Shlomo School of Reliability and Systems Engineering Beihang University Beijing100191 China Science and Technology on Reliability and Environmental Engineering Laboratory Beijing100191 China School of Economics and Management Beihang University Beijing100191 China Faculty of Engineering Information and Systems University of Tsukuba Tennodai Tsukuba Ibaraki305-8573 Japan Department of Physics Bar-Ilan University Ramat Gan5290002 Israel Sony Computer Science Laboratories 3-14-13 Higashi-Gotanda Tokyo141-0022 Japan Institute of Innovative Research Tokyo Institute of Technology Yokohama226-8502 Japan Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China

Social media can be a double-edged sword for society, either as a convenient channel exchanging ideas or as an unexpected conduit circulating fake news through a large population. While existing studies of fake news focus on theoretical modeling of propagation or identification methods based on machine learning, it is important to understand the realistic mechanisms between theoretical models and black-box methods. Here we track large databases of fake news and real news in both, Weibo in China and Twitter in Japan from different culture, which include their complete traces of re-postings. We find in both online social networks that fake news spreads distinctively from real news even at early stages of propagation, e.g. five hours after the first re-postings. Our finding demonstrates collective structural signals that help to understand the different propagation evolution of fake news and real news. Different from earlier studies, identifying the topological properties of the information propagation at early stages may offer novel features for early detection of fake news in social media. Copyright © 2018, The Authors. All rights reserved.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：