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

International Conference on Information Technology

作者： B. K. Bhatta S. K. Jena Computer Science and Application Group Department of Mathematics Indian Institute of Technology Delhi School of Math.-Stat-Computer Science Utkal University

ISBN: (纸本)9781509004881

Sweep coverage is one of the important and recent issue for network monitoring in wireless sensor network (WSN). Sweep coverage is efficiently applicable where periodic monitoring is sufficient than continuous monitoring. Interference minimization is another main objective of topology control problem in wireless sensor network. Reducing interference in turn reduces the number of collision and packet retransmission, which decreases the energy consumption and increases lifetime of the network. In this paper, we introduce the Interference minimization global t-Gsweep coverage problem (IMGtSCP) where the objective is to minimize the interference number induced by set of mobile and static sensors with the constraint that the given set of point of interests (PoIs) guarantee t-Gsweep coverage. We prove that the IMGtSCP problem is NP-hard and cannot be approximated with a factor 2. We propose a new heuristic called Interference Minimization Sweep Coverage with Static and Mobile Sensors. We have shown that the time complexity of this heuristics is O(n~3 log n), We also conduct simulation to show the performance of our proposed algorithm.

关键词： Wireless Sensor Networks Topology Control Minimum Spanning Tree Graph Algorithms Sweep Coverage K-MST Mobile Sensors Interference

来源：评论

学校读者我要写书评

暂无评论

Contact graphs of circular arcs 1

引用

14th International Symposium on Algorithms and Data Structures, WADS 2015

作者： Alam, Md Jawaherul Eppstein, David Kaufmann, Michael Kobourov, Stephen G. Pupyrev, Sergey Schulz, André Ueckerdt, Torsten Department of Computer Science University of Arizona Tucson United States Computer Science Department University of California Irvine United States Wilhelm-Schickard-Institut Für Informatik Universität Tübingen Tübingen Germany Institute of Mathematics and Computer Science Ural Federal University Yekaterinburg Russia Institut Math. Logik und Grundlagenforschung Universität Münster Münster Germany Department of Mathematics Karlsruhe Institute of Technology Karlsruhe Germany

ISBN: (数字)9783319218403

ISBN: (纸本)9783319218397

We study representations of graphs by contacts of circular arcs, CCA-representations for short, where the vertices are interior-disjoint circular arcs in the plane and each edge is realized by an endpoint of one arc touching the interior of another. A graph is (2, k)-sparse if every s-vertex subgraph has at most 2s − k edges, and (2, k)-tight if in addition it has exactly 2n−k edges, where n is the number of vertices. Every graph with a CCA-representation is planar and (2, 0)-sparse, and it follows from known results that for k ≥ 3 every (2, k)-sparse graph has a CCA-representation. Hence the question of CCA-representability is open for (2, k)-sparse graphs with 0 ≤ k ≤ 2. We partially answer this question by computing CCArepresentations for several subclasses of planar (2, 0)-sparse graphs. Next, we study CCA-representations in which each arc has an empty convex hull. We show that every plane graph of maximum degree 4 has such a representation, but that finding such a representation for a plane (2, 0)-tight graph with maximum degree 5 is NP-complete. Finally, we describe a simple algorithm for representing plane (2, 0)-sparse graphs with wedges, where each vertex is represented with a sequence of two circular arcs (straight-line segments). © Springer International Publishing Switzerland 2015.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Intelligent model for measuring learners' satisfaction towards new contents

Intelligent model for measuring learners' satisfaction towar...

引用

International Conference on Information Technology Based Higher Education and Training, ITHET

作者： Fatiha Elghibari Rachid Elouahbi Fatima El Khoukhi Layla Ezzahri Said Amali Department of mathematics and computer Science Moulay Ismail University Meknes Morocco Team Modeling Applied Informatics in Humanities MIASH Moulay Ismail University Meknes Morocco Faculty of Sciences Moulay Ismail University Meknes Morocco Team Outils Mathématiques en Economie Moulay Ismail University Meknes Morocco

ISBN: (纸本)9781509007790

Learner satisfaction is an important factor for a successful e-Learning. It allows learners to continue learning and provide their conveniences to facilitate the knowledge. That is why, the main purpose of this study is to enhance learning services in online environments, in order to keep learners' motivation and track their cognition' evolution. Namely, identify their satisfaction toward new inserted contents. In this paper, we present a learning model that detects satisfaction' degree of learners at two levels; during and after completing the course. During learning by using satisfaction agent (SA) that collects data and calculates satisfaction level towards each content' unit. This process allows to integrate improvement if we have a low levels of satisfaction. And after completing course in order to evaluate the evolution of learners' knowledge, and test the effectiveness of the methods and tools used in.

关键词： Electronic learning Training Computational modeling math.matical model computer science

来源：评论

学校读者我要写书评

暂无评论

Microwave spectro-polarimetry of matter and radiation across space and time

arXiv

引用

arXiv 2019年

作者： Delabrouille, Jacques Abitbol, Maximilian H. Aghanim, Nabila Ali-Haïmoud, Yacine Alonso, David Alvarez, Marcelo Banday, Anthony J. Bartlett, James G. Baselmans, Jochem Basu, Kaustuv Battaglia, Nicholas Climent, José Ramón Bermejo Bernal, José L. Béthermin, Matthieu Bolliet, Boris Bonato, Matteo Bouchet, François R. Breysse, Patrick C. Burigana, Carlo Cai, Zhen-Yi Chluba, Jens Churazov, Eugene Dannerbauer, Helmut de Bernardis, Paolo de Zotti, Gianfranco Valentino, Eleonora Di Dimastrogiovanni, Emanuela Endo, Akira Erler, Jens Ferraro, Simone Finelli, Fabio Fixsen, Dale Hanany, Shaul Hart, Luke Hernández-Monteagudo, Carlos Hill, J. Colin Hotinli, Selim C. Karatsu, Kenichi Karkare, Kirit Keating, Garrett K. Khabibullin, Ildar Kogut, Alan Kohri, Kazunori Kovetz, Ely D. Lagache, Guilaine Lesgourgues, Julien Madhavacheril, math.w Maffei, Bruno Mandolesi, Nazzareno Martins, Carlos Masi, Silvia math.r, John Melin, Jean-Baptiste Dizgah, Azadeh Moradinezhad Mroczkowski, Tony Mukherjee, Suvodip Nagai, Daisuke Negrello, Mattia Palanque-Delabrouille, Nathalie Paoletti, Daniela Patil, Subodh P. Piacentini, Francesco Raghunathan, Srinivasan Ravenni, Andrea Remazeilles, math.eu Revéret, Vincent Rodriguez, Louis Rotti, Aditya Martin, Jose-Alberto Rubiño Sayers, Jack Scott, Douglas Silk, Joseph Silva, Marta Souradeep, Tarun Sugiyama, Naonori Sunyaev, Rashid Switzer, Eric R. Tartari, Andrea Trombetti, Tiziana Zubeldia, Íñigo CNRS/IN2P3 Université Paris Diderot Paris Cedex 1375205 France IRFU CEA Université Paris Saclay Gif-sur-Yvette91191 France University of Oxford Denys Wilkinson Building Keble Road OxfordOX1 3RH United Kingdom Université Paris-Sud Bâtiment 121 Orsay91405 France Center for Cosmology and Particle Physics Department of Physics New York University New YorkNY10003 United States School of Physics and Astronomy Cardiff University The Parade CardiffCF24 3AA United Kingdom Berkeley Center for Cosmological Physics University of California BerkeleyCA94720 United States Lawrence Berkeley National Laboratory One Cyclotron Road BerkeleyCA94720 United States Institut de Recherche en Astrophysique et Planétologie 9 av du Colonel Roche BP 44346 Toulouse Cedex 431028 France Jet Propulsion Laboratory California Institute of Technology 4800 Oak Grove Drive PasadenaCA91109 United States Faculty of Electrical Eng. Math. and Computer Sc. Delft Univ. of Technology Mekelweg 4 Delft2628 CD Netherlands SRON Netherlands Institute for Space Research Sorbonnelaan 2 Utrecht3584 CA Netherlands Argelander-Institut für Astronomie Universität Bonn Auf dem Hügel 71 BonnD-53121 Germany Department of Astronomy Cornell University IthacaNY14853 United States INAF - Osservatorio di Astrofisica e Scienza dello Spazio Via Gobetti 101 BolognaI-40129 Italy ICC University of Barcelona IEEC-UB Martí i Franques 1 BarcelonaE08028 Spain Aix Marseille Université CNRS CNES LAM Marseille France Jodrell Bank Centre for Astrophysics Dept. of Physics & Astronomy University of Manchester ManchesterM13 9PL United Kingdom INAF - Istituto di Radioastronomia Via Piero Gobetti 101 BolognaI-40129 Italy INAF - Osservatorio Astronomico di Padova Vicolo Osservatorio 5 PadovaI-35122 Italy Institut d’Astrophysique de Paris 98 bis Boulevard Arago Paris75014 France Canadian Institute for Theoretical Astrophysics University of Toronto ONM5S 3H8 Canada CAS Key Laboratory for

In the past few decades, a standard model of cosmology, ΛCDM, has emerged. According to our understanding, our Universe is about 13.8 billion years old, and expanded from an initial hot and dense state. Baryonic matter accounts for 5% of its present matter-energy content, non-baryonic dark matter for about 25%, and some unknown form of energy with negative pressure, dubbed dark energy, for the remaining 70%. The galaxies and clusters of galaxies that we observe today form by the gravitational collapse of tiny primordial fluctuations of the spacetime metric, thought to originate from an early stage of fast accelerated expansion, known as cosmic inflation. But very fundamental questions remain unanswered: we do not know what the dark matter and dark energy are, whether dark matter interacts, or if extra light particles exist. We are unsure whether inflation did indeed take place and exactly what physics was at work in the very early Universe. We still have to reconcile the laws of gravitation with the standard model of particle interactions – both of which are known to be incomplete and require extensions to explain existing observations. We do not know the topology of the Universe, or whether it is finite or infinite. We do not fully understand how structure forms, or why some structures on small scales appear to be incompatible with ΛCDM predictions. We do not have a convincing explanation for anomalies in the large-scale statistics of cosmic microwave background (CMB) anisotropies, except invoking chance multipole alignments and excursions in tails of the realization of a Gaussian random field. The distribution of matter and energy in the Universe, by virtue of being the product of physical laws and their effect on the Universe’s constituents, encodes answers to these questions. We thus propose to conduct an unprecedented full census of this distribution, over scales from one arcminute to the entire sky, and over 99% of cosmic history. The census will be carried ou

关键词： Galaxies

来源：评论

学校读者我要写书评

暂无评论

Using the Findings of a Mapping Study to Conduct a Research Project: A Case in Knowledge Management in Software Testing

Using the Findings of a Mapping Study to Conduct a Research ...

引用

Euromicro Conference on Software Engineering and Advanced Applications (SEAA)

作者： Érica F. Souza Ricardo A. Falbo Nandamudi L. Vijaykumar Department of Computer Federal Technological University of Parana UTFPR Cornelio Brazil Department of Computer Science Federal University of Espírito Santo Brazil Lab. of Comp. and Applied Math. National Institute for Space Research Brazil

A mapping study provides a broad overview of a research area in order to determine whether there is research evidence on a particular topic. Results of a systematic mapping may identify suitable areas for performing future research. In this paper, we discuss our experience in using the findings of a mapping study on Knowledge Management (KM) in Software Testing for performing a real research project, which also applied other empirical approaches. The main goals of this paper are: (i) to reinforce the importance of a systematic mapping in the conduction of a research project by discussing a real case of such application, and (ii) to present the results of our survey on the most important aspects of KM when applied to software testing.

关键词： Software testing Ontologies Software Software engineering Systematics Planning

来源：评论

学校读者我要写书评

暂无评论

Adaptive Interest Lifetimes for Information-Centric Wireless Multi-hop Communication

Adaptive Interest Lifetimes for Information-Centric Wireless...

引用

Joint IFIP Wireless and Mobile Networking Conference (WMNC)

作者： Carlos Anastasiades Lukas von Rotz Torsten Braun Institute of Computer Science and Applied Mathematics University of Bern Switzerland Inst. of Comput. Sci. & Appl. Math. Universitat Bern Bern BE CH

ISBN: (纸本)9781509000913

Information-centric networking (ICN) is a promising approach for wireless communication because users can exploit the broadcast nature of the wireless medium to quickly find desired content at nearby nodes. However, wireless multi-hop communication is prone to collisions and it is crucial to quickly detect and react to them to optimize transmission times and avoid spurious retransmissions. Several adaptive retransmission timers have been used in related ICN literature but they have not been compared and evaluated in wireless multi-hop environments. In this work, we evaluate existing algorithms in wireless multi-hop communication. We find that existing algorithms are not optimized for wireless communication but slight modifications can result in considerably better performance without increasing the number of transmitted Interests.

关键词： Wireless communication Communication system security Spread spectrum communication Algorithm design and analysis Delays Throughput Emulation

来源：评论

学校读者我要写书评

暂无评论

Optimized video steganography using Cuckoo Search algorithm

Optimized video steganography using Cuckoo Search algorithm

引用

IEEE International Conference on Intelligent Computing and Information Systems (ICICIS)

作者： Sameh A. Abbas Taha I. B. El Arif Fayed F. M. Ghaleb Sohier M. Khamis Dev. Of CS Faculty of Science ASU Cairo Egypt Department of Computer Science Faculty of Computer and Information Science ASU Cairo Egypt Dev. Of CS Dept. of Math. Faculty of Science ASU Cairo Egypt

Steganography is a process of concealing the secret information into cover object such as text, audio, image, and video. In this paper, we propose a new treatment of Cuckoo Search (CS) algorithm to solve the problem of video steganography. CS is a metaheuristic search algorithm which was recently devolved by Xin-She Yang and Suash Deb in 2009, inspired by the cuckoo bird breeding behavior. The suggested algorithm is based on taking secret data byte by byte. The bits of each byte are arranged to obtain five different forms. The next step focuses on searching about the best carrier pixel in the cover frame. The best pixel is determined using Euclidian distance which evaluate the similarity between the pixels and different byte forms. The random move from pixel to another is achieved using Lévy flight random walk. Finally, the suitable carrier pixel is detected and embedded in its RGB components using the 3-3-2 Least Significant Bit (LSB) replacement technique. In addition, each secret image's color component is embedded separately into a selected cover video's frame. Results show that CS is superior to Genetic Algorithm (GA) and the base technique in term of Peak Signal to Noise Ratio (PSNR).

关键词： Discrete wavelet transforms Robustness Cryptography Tuning MATLAB

来源：评论

学校读者我要写书评

暂无评论

On the consistency of the likelihood maximization vertex nomination scheme: bridging the gap between maximum likelihood estimation and graph matching

The Journal of Machine Learning Research

引用

The Journal of Machine Learning Research 2016年第1期17卷

作者： Kevin Murphy Bernhard Schölkopf Vince Lyzinski Keith Levin Donniell E. Fishkind Carey E. Priebe Google MPI for Intelligent Systems Department of Applied Math and Statistics Johns Hopkins University Baltimore MD Department of Computer Science Johns Hopkins University Baltimore MD

Given a graph in which a few vertices are deemed interesting a priori, the vertex nomination task is to order the remaining vertices into a nomination list such that there is a concentration of interesting vertices at the top of the list. Previous work has yielded several approaches to this problem, with theoretical results in the setting where the graph is drawn from a stochastic block model (SBM), including a vertex nomination analogue of the Bayes optimal classifier. In this paper, we prove that maximum likelihood (ML)-based vertex nomination is consistent, in the sense that the performance of the ML-based scheme asymptotically matches that of the Bayes optimal scheme. We prove theorems of this form both when model parameters are known and unknown. Additionally, we introduce and prove consistency of a related, more scalable restricted-focus ML vertex nomination scheme. Finally, we incorporate vertex and edge features into ML-based vertex nomination and briey explore the empirical effectiveness of this approach.

关键词： graph inference graph matching graph mining stochastic block model vertex nomination

来源：评论

学校读者我要写书评

暂无评论

Automatic Command Queue Scheduling for Task-Parallel Workloads in OpenCL

Automatic Command Queue Scheduling for Task-Parallel Workloa...

引用

IEEE International Conference on Cluster Computing

作者： Ashwin Mandayam Aji Antonio J. Peña Pavan Balaji Wu-chun Feng AMD Research Advanced Micro Devices Inc. +Math. and Comp. Sci. Division Argonne National Laboratory Department of Computer Science Virginia Tech

OpenCL is a portable interface that can be used to program cluster nodes with heterogeneous compute devices. The OpenCL specification tightly binds its workflow abstraction, or "command queue," to a specific device for the entire program. For best performance, the user has to find the ideal queue -- device mapping at command queue creation time, an effort that requires a thorough understanding of the match between the characteristics of all the underlying device architectures and the kernels in the program. In this paper, we propose to add scheduling attributes to the OpenCL context and command queue objects that can be leveraged by an intelligent runtime scheduler to automatically perform ideal queue - device mapping. Our proposed extensions enable the average OpenCL programmer to focus on the algorithm design rather than scheduling and automatically gain performance without sacrificing programmability. As an example, we design and implement an OpenCL runtime for task-parallel workloads, called MultiCL, which efficiently schedules command queues across devices. Within MultiCL, we implement several key optimizations to reduce runtime overhead. Our case studies include the SNU-NPB OpenCL benchmark suite and a real-world seismology simulation. We show that, on average, users have to apply our proposed scheduler extensions to only four source lines of code in existing OpenCL applications in order to automatically benefit from our runtime optimizations. We also show that MultiCL always maps command queues to the optimal device set with negligible runtime overhead.

关键词： Kernel Runtime Performance evaluation Processor scheduling Context Schedules Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

Foreword

Proceedings of the 2016 International Conference on Image Pr...

引用

Proceedings of the 2016 International Conference on Image Processing, computer Vision, and Pattern Recognition, IPCV 2016 2016年

作者： Abd-Wahab, Mohd Helmy Al-Bakry, Abbas Al-Holou, Nizar Arabnia, Hamid R. Bhattacharya, Mahua Martinez Castillo, Juan Jose Daimi, Kevin Deligiannidis, Leonidas Djoudi, Lamia Atma Duong, Trung Eshaghian-Wilner, Mary Mehrnoosh Gravvanis, George A. Huang, Ruizhu Jandieri, George Kim, Byung-Gyu Kim, Tai-hoon Korovin, Iakov Lai, Guoming Lee, Hyo Jong Bin Mansor, Muhammad Naufal Marsh, Andrew Mostafaeipour, Ali Park, James J. Patil, Shashikant Ponalagusamy, R. Schaefer, Gerald Singh, Akash Solo, Ashu M.G. Swee, Sim Kok Thomas, Jaya Tinetti, Fernando G. Vladimir, Hahanov Wang, Shiuh-Jeng Yang, Mary Yoe, Hyun You, Jane Zhao, Wenbing Department of Computer Engineering University Tun Hussein Onn Malaysia Malaysia University of IT and Communications Baghdad Iraq Electrical and Computer Engineering Department IEEE/SEM-Computer Chapter University of Detroit Mercy DetroitMI United States University of Georgia United States ABV Indian Institute of Information Technology and Management MHRD Government of India India Acantelys Alan Turing Nikola Tesla Research Group and GIPEB Universidad Nacional Abierta Venezuela Computer Science and Software Engineering Programs Department of Mathematics Computer Science and Software Engineering University of Detroit Mercy DetroitMI United States Department of Computer Information Systems Wentworth Institute of Technology BostonMA United States Synchrone Technologies France Rutgers University State University of New Jersey New Jersey United States University of Southern California California United States Electrical Engineering University of California Los Angeles Los Angeles [UCLA CA United States Advanced Scientific Computing Applied Math and Applications Research Group Applied Mathematics and Numerical Computing and Department of ECE School of Engineering Democritus University of Thrace Xanthi Greece Texas Advanced Computing Center University of Texas AustinTX United States Georgian Technical University Tbilisi Georgia Institute of Cybernetics Georgian Academy of Science Georgia Multimedia Processing CommunicationsLab.[MPCL Department of Computer Science and Engineering College of Engineering SunMoon University Korea Republic of School of Information and Computing Science University of Tasmania Australia Southern Federal University Russia Computer Science and Technology Sun Yat-Sen University Guangzhou China Center for Advanced Image and Information Technology Division of Computer Science and Engineering Chonbuk National University Korea Republic of Faculty of Engineering Technology Kampus Uniciti Alam Universiti Malaysia Perlis UniMAP Malaysi

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：