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

arXiv 2019年

作者： Novotná, Jana Okrasa, Karolina Pilipczuk, Michal Rzążewski, Pawel van Leeuwen, Erik Jan Walczak, Bartosz Department of Applied Mathematics Faculty of Mathematics and Physics Charles University Prague Czech Republic Faculty of Mathematics and Information Science Warsaw University of Technology Poland Institute of Informatics Faculty of Mathematics Informatics and Mechanics University of Warsaw Poland Department of Information and Computing Sciences Utrecht University Netherlands Department of Theoretical Computer Science Faculty of Mathematics and Computer Science Jagiellonian University Kraków Poland

Let C and D be hereditary graph classes. Consider the following problem: given a graph G ∈ D, find a largest, in terms of the number of vertices, induced subgraph of G that belongs to C. We prove that it can be solved in 2o(n) time, where n is the number of vertices of G, if the following conditions are satisfied: the graphs in C are sparse, i.e., they have linearly many edges in terms of the number of vertices;the graphs in D admit balanced separators of size governed by their density, e.g., O(∆) or O(√m), where ∆ and m denote the maximum degree and the number of edges, respectively;and the considered problem admits a single-exponential fixed-parameter algorithm when parameterized by the treewidth of the input graph. This leads, for example, to the following corollaries for specific classes C and D: a largest induced forest in a Pt-free graph can be found in 2Õ(n2/3) time, for every fixed t;and a largest induced planar graph in a string graph can be found in 2Õ(n3/4) time. Copyright © 2019, The Authors. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

A proposal for a recommender system of scientific relevance

引用

Procedia computer science 2019年 162卷 199-206页

作者： Jared D.T. Guerrero-Sosas Francisco Pascual Romero Chicharro Jesus Serrano-Guerrero Victor Menendez-Dominguez Maria Enriqueta Castellanos-Bolaños Faculty of Mathematics Faculty of Education - Autonomous University of Yucatan - Merida Mexico Department of Technologies and Information Systems University College of Computer Science University of Castilla-La Mancha Paseo de la Universidad 4 13071 Ciudad Real Spain

The objective of this work is to present a proposal of a recommender system taking into account the scientific relevance of research groups and researchers by using indicators able to measure the productivity and impact of their publications. In the introduction, the related topics are presented, emphasizing the use of metadata, semantic textual similarity and bibliometric indicators. The methodology section exposes the steps for the design of the recommender system, considering the information gathering, building semantic knowledge, the use of Data and Text Mining, and the recommendations. Subsequently, a first implementation of the methodology used by a Mexican public university is presented. The results that have been obtained with Data and Text Mining techniques for the textual representation of the research groups are presented. Finally, some conclusions and future work are exposed.

关键词： Scientific relevance clustering association rules recommender system semantic textual similarity

来源：评论

学校读者我要写书评

暂无评论

Data Classification using Active Learning based Data Modification: An Application to Churn Prediction 3

Data Classification using Active Learning based Data Modific...

引用

3rd International Conference on Current Trends in computer, Electrical, Electronics and Communication, CTCEEC 2017

作者： Khalid, M.A.R. Farquad, M.A.H. Kamakshi Prasad, V. Department of Computer Science JNTUH College of Engineering Hyderabad Telangana State India Faculty of Computer and Information Systems Madinah Islamic University Madinah Saudi Arabia

ISBN: (纸本)9781538632420

Support Vector Machine (SVM) is on one of its kind of data mining algorithm, tends to always give away the global optimum solution to any given problem because of its convex optimization problem solving approach. SVM learns from the given training data and generates a linear hyperplane classifying the given instances. The training instances which are near this separating hyperplane are called support vectors, using which predictions are obtained. In other words, SVM considers the support vectors as important instances for prediction purposes and ignores other instances which are much away from hyperplane boundary. In this project the ability of SVM i.e. extraction of support vectors is explored further and active learning based synthetic data generation (nearest to the support vectors) is employed. Synthetic data generation near support vectors would provide the classification algorithm (Naïve Bayes algorithm in this project) with some extra and suitable instances to learn from which in-turn expected to result in improving the prediction accuracy of the classifier used. Results have shown that Naïve Bayes classifier yielded superior accuracy using the modified dataset when compared to the accuracy yielded using original data available. © 2017 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Retraction Note: Intelligent dynamic spectrum access using fuzzy logic in cognitive radio networks

引用

Discover applied sciences 2024年第1期7卷 1-1页

作者： Kishore, K. Krishna Rajasekaran, Arun Sekar Keshta, Ismail Byeon, Haewon Bhatt, Mohammed Wasim Irshad, Azeem Ofori, Isaac Department of Electronics and Communication Vasavi College of Engineering Hyderabad India Department of Electronics and Communication Engineering SR University Warangal India Computer Science and Information Systems Department College of Applied Sciences AlMaarefa University Riyadh Saudi Arabia Department of Digital Anti-Aging Healthcare Inje University Gimhae Republic of Korea Model Institute of Engineering and Technology Jammu India Asghar Mall College Rawalpindi Higher Education Department (HED) Govt. of the Punjab Rawalpindi Pakistan University of Mines and Technology (UMaT) Tarkwa Ghana

来源：评论

学校读者我要写书评

暂无评论

Joint beamforming and power splitting design for C-RAN with multicast fronthaul

arXiv

引用

arXiv 2020年

作者： Hao, Wanming Sun, Gangcan Zeng, Ming Zhu, Zhengyu Jiang, Bin Yang, Shouyi School of Information Engineering Henan Institute of Advanced Technology Zhengzhou University Zhengzhou450001 China National Center for International Joint Research of Electronic Materials and Systems Zhengzhou450001 China School of Information Engineering Zhengzhou University Zhengzhou450001 China Faculty of Science and Engineering Laval University QuebecG1V0A6 Canada Faculty of Engineering and Applied Science Memorial University St. JohnsNLA1B 3X9 Canada College of Information and Communication National University of Defense Technology Wuhan430010 China

In this paper, we investigate the joint beamforming and power splitting design problem in a base station (BS) clusterbased cloud radio access network (C-RAN) with multicast fronthaul, where users are jointly served by BSs within each cluster. Meanwhile, each user can simultaneously obtain information and energy from received signals. On this basis, under predefined minimum harvested energy of each user and maximum transmit power of each BS and central processor, we formulate a sum rate maximization problem by jointly optimizing multicast fronthaul beamforming, cooperative access beamforming and power split ratios. Due to the difficulty in solving the formulated problem, we first transform it into a convex one by successive convex approximate and semidefinite program (SDP) relaxation techniques, and then propose an effective iterative algorithm. Moreover, we design a randomization method that can always obtain the rankone solution. Finally, numerical results are conducted to validate the effectiveness of our proposed algorithm. Copyright © 2020, The Authors. All rights reserved.

关键词： Multicasting

来源：评论

学校读者我要写书评

暂无评论

Quantified self using IoT wearable devices 3rd

Quantified self using IoT wearable devices

引用

3rd International Conference on Advanced Intelligent systems and Informatics, AISI 2017

作者： Shehab, Abdulaziz Ismail, Ahmed Osman, Lobna Elhoseny, Mohamed El-Henawy, I.M. Information Systems Department Faculty of Computers and Information Mansoura University Mansoura Egypt Department of Electronics and Communications Engineering Delta Higher Institute of Engineering and Technology Talkha Egypt Faculty of Computer Science and Information Systems Zagazig University Zagazig Egypt Cairo Egypt

ISBN: (纸本)9783319648606

Nowadays, designing and developing wearable devices that could detect many types of diseases has become inevitable for E-health field. The decision-making of those wearable devices is done by various levels of analysis of enormous databases of human health records. systems that demand a huge number of input data to decide to require real-time data collected from devices, processes, and analyzing the data. Many researchers utilize the Internet of Things (IoT) in medical wearable devices to detect different diseases by using different sensors together for one goal. The IoT promises to revolutionize the lifestyle using a wealth of new services, based on interactions between large numbers of devices data. The proposed work is human monitor system to track the human body troubles. Smart wearable devices can provide users with overall health data, and alerts from sensors to notify them on their mobile phones accordingly. The proposed system developed a technique using Internet of Things technique to decrease the load on IOT network and decrease the overall cost of the users. The simulation results proved that the proposed system could provide identical communication for IOT devices even if many nodes are used. © 2018, Springer International Publishing AG.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Quantum speedup for track reconstruction in particle accelerators

arXiv

引用

arXiv 2021年

作者： Magano, Duarte Kumar, Akshat Kālis, Mārtiņš Locāns, Andris Glos, Adam Pratapsi, Sagar Quinta, Gonçalo Dimitrijevs, Maksims Rivošs, Aleksander Bargassa, Pedrame Seixas, João Ambainis, Andris Omar, Yasser Physics of Information and Quantum Technologies Group Instituto de Telecomunicações Portugal Instituto Superior Técnico Universidade de Lisboa Portugal Department of Mathematics Clarkson University United States Center for Quantum Computer Science Faculty of Computing University of Latvia Latvia Institute of Theoretical and Applied Informatics Polish Academy of Sciences Poland Portuguese Quantum Institute Portugal Laboratório de Instrumentação e Física Experimental de Partículas Portugal Center for Physics and Engineering of Advanced Materials Portugal

To investigate the fundamental nature of matter and its interactions, particles are accelerated to very high energies and collided inside detectors, producing a multitude of other particles that are scattered in all directions. As charged particles traverse the detector, they leave signals of their passage. The problem of track reconstruction is to recover the original trajectories from these signals. This challenging data analysis task will become even more demanding as the luminosity of future accelerators increases, leading to collision events with a more complex structure. We identify four fundamental routines present in every local tracking method and analyse how they scale in the context of a standard tracking algorithm. We show that for some of these routines we can reach a lower computational complexity with quantum search algorithms. Although the found quantum speedups are mild, this constitutes, to the best of our knowledge, the first rigorous evidence of a quantum advantage for a high-energy physics data processing task. Copyright © 2021, The Authors. All rights reserved.

关键词： Charged particles

来源：评论

学校读者我要写书评

暂无评论

A practical index for approximate dictionary matching with few mismatches

引用

Computing and Informatics 2018年第5期36卷 1088-1106页

作者： Cislak, Aleksander Grabowski, Szymon Warsaw University of Technology Faculty of Mathematics and Information Science ul. Koszykowa 75 Warsaw00-662 Poland Lodz University of Technology Institute of Applied Computer Science Al. Politechniki 11 Lód90-924 Poland

Approximate dictionary matching (checking if a pattern occurs in a collection of strings) is a classic problem with applications in e.g. spellchecking, online catalogs, and web searchers. We present a simple solution called split index, which is based on the Dirichlet principle, for matching a keyword with few mismatches, and experimentally show that it offers competitive space-time tradeoffs. Our implementation in the C++ language is focused mostly on data compaction, which is beneficial for the search speed. We compare our solution with other algorithms and we show that it is faster when the Hamming distance is used. Query times in the order of 1 microsecond were reported for one mismatch for a few-megabyte natural language dictionary on a medium-end PC. We also demonstrate that a basic compression technique consisting in q-gram substitution can significantly reduce the index size (up to 50% of the input text size for the DNA sequences).

关键词： Hamming distance

来源：评论

学校读者我要写书评

暂无评论

Charge-Sign Dependent Cosmic-Ray Modulation Observed with the Calorimetric Electron Telescope on the International Space Station

引用

Physical Review Letters 2023年第21期130卷 211001-211001页

作者： O. Adriani Y. Akaike K. Asano Y. Asaoka E. Berti G. Bigongiari W. R. Binns M. Bongi P. Brogi A. Bruno J. H. Buckley N. Cannady G. Castellini C. Checchia M. L. Cherry G. Collazuol G. A. de Nolfo K. Ebisawa A. W. Ficklin H. Fuke S. Gonzi T. G. Guzik T. Hams K. Hibino M. Ichimura K. Ioka W. Ishizaki M. H. Israel K. Kasahara J. Kataoka R. Kataoka Y. Katayose C. Kato N. Kawanaka Y. Kawakubo K. Kobayashi K. Kohri H. S. Krawczynski J. F. Krizmanic P. Maestro P. S. Marrocchesi A. M. Messineo J. W. Mitchell S. Miyake A. A. Moiseev M. Mori N. Mori H. M. Motz K. Munakata S. Nakahira J. Nishimura S. Okuno J. F. Ormes S. Ozawa L. Pacini P. Papini B. F. Rauch S. B. Ricciarini K. Sakai T. Sakamoto M. Sasaki Y. Shimizu A. Shiomi P. Spillantini F. Stolzi S. Sugita A. Sulaj M. Takita T. Tamura T. Terasawa S. Torii Y. Tsunesada Y. Uchihori E. Vannuccini J. P. Wefel K. Yamaoka S. Yanagita A. Yoshida K. Yoshida W. V. Zober Department of Physics University of Florence Via Sansone 1 - 50019 Sesto Fiorentino Italy INFN Sezione di Firenze Via Sansone 1 - 50019 Sesto Fiorentino Italy Waseda Research Institute for Science and Engineering Waseda University 17 Kikuicho Shinjuku Tokyo 162-0044 Japan JEM Utilization Center Human Spaceflight Technology Directorate Japan Aerospace Exploration Agency 2-1-1 Sengen Tsukuba Ibaraki 305-8505 Japan Institute for Cosmic Ray Research The University of Tokyo 5-1-5 Kashiwa-no-Ha Kashiwa Chiba 277-8582 Japan Institute of Applied Physics (IFAC) National Research Council (CNR) Via Madonna del Piano 10 50019 Sesto Fiorentino Italy Department of Physical Sciences Earth and Environment University of Siena via Roma 56 53100 Siena Italy INFN Sezione di Pisa Polo Fibonacci Largo B. Pontecorvo 3 - 56127 Pisa Italy Department of Physics and McDonnell Center for the Space Sciences Washington University One Brookings Drive Saint Louis Missouri 63130-4899 USA Heliospheric Physics Laboratory NASA/GSFC Greenbelt Maryland 20771 USA Center for Space Sciences and Technology University of Maryland Baltimore County 1000 Hilltop Circle Baltimore Maryland 21250 USA Astroparticle Physics Laboratory NASA/GSFC Greenbelt Maryland 20771 USA Center for Research and Exploration in Space Sciences and Technology NASA/GSFC Greenbelt Maryland 20771 USA Department of Physics and Astronomy Louisiana State University 202 Nicholson Hall Baton Rouge Louisiana 70803 USA Department of Physics and Astronomy University of Padova Via Marzolo 8 35131 Padova Italy INFN Sezione di Padova Via Marzolo 8 35131 Padova Italy Institute of Space and Astronautical Science Japan Aerospace Exploration Agency 3-1-1 Yoshinodai Chuo Sagamihara Kanagawa 252-5210 Japan Kanagawa University 3-27-1 Rokkakubashi Kanagawa Yokohama Kanagawa 221-8686 Japan Faculty of Science and Technology Graduate School of Science and Technology Hirosaki University 3 Bunkyo Hirosaki Aomori 036

We present the observation of a charge-sign dependent solar modulation of galactic cosmic rays (GCRs) with the Calorimetric Electron Telescope onboard the International Space Station over 6 yr, corresponding to the positive polarity of the solar magnetic field. The observed variation of proton count rate is consistent with the neutron monitor count rate, validating our methods for determining the proton count rate. It is observed by the Calorimetric Electron Telescope that both GCR electron and proton count rates at the same average rigidity vary in anticorrelation with the tilt angle of the heliospheric current sheet, while the amplitude of the variation is significantly larger in the electron count rate than in the proton count rate. We show that this observed charge-sign dependence is reproduced by a numerical “drift model” of the GCR transport in the heliosphere. This is a clear signature of the drift effect on the long-term solar modulation observed with a single detector.

关键词： Cosmic ray composition & spectra Cosmic ray propagation Cosmic ray sources Cosmic rays & astroparticles

来源：评论

学校读者我要写书评

暂无评论

Smartphone Application for Badminton sports community

引用

Journal of Physics: Conference Series 2020年第2期1477卷

作者： Nizirwan Anwar Eric HendroAsali Heryanto Teddy Budiyanto Willy Hendyan Harco Leslie Hendric Spits Warnars Faculty of Computer Science Esa Unggul University Jakarta Indonesia Information Systems Department School of Information Systems Bina Nusantara University Jakarta Indonesia Computer Science Department BINUS Graduate Program - Doctor of Computer Science Bina Nusantara University Jakarta Indonesia

Nowadays, there are so many people in Indonesia particularly young people who are interested in playing badminton, but at the end of the day, this game will make boring for young people particularly with the booming of the smartphone game. Literally, it will make the young generation too lazy for outing activity or doing sports and busy with their digital technology, particularly their smartphone. Obviously, we are interested in using the mobile application which can be used to bridge the boring of doing sports mainly badminton sport, wherewith this mobile application is not just only for field badminton or coach booking, but can extend their friendship and community in positive ways. Hopefully, with this mobile application not just only booking for Badminton fields, but beyond that, there will be a mobile application that supports the fans of the badminton sports community when can know each other from different places and make friendship and competition among the members. At the end of the day, we hope this mobile application will support young people to stay away from trouble and drug and to have a positive life with the sport, particularly badminton sport as Indonesian's favorite sport.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：