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

arXiv 2022年

作者： Iftikhar, Sundas Gill, Sukhpal Singh Song, Chenghao Xu, Minxian Aslanpour, Mohammad Sadegh Toosi, Adel N. Du, Junhui Wu, Huaming Ghosh, Shreya Chowdhury, Deepraj Golec, Muhammed Kumar, Mohit Abdelmoniem, Ahmed M. Cuadrado, Felix Varghese, Blesson Rana, Omer Dustdar, Schahram Uhlig, Steve School of Electronic Engineering and Computer Science Queen Mary University of London London United Kingdom University of Kotli Azad Jammu & Kashmir Azad Kashmir Kotli Pakistan Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China Department of Software Systems and Cybersecurity Faculty of Information Technology Monash University Australia Csiro DATA61 Australia Center for Applied Mathematics Tianjin University Tianjin China The Pennsylvania State University PA United States Naya Raipur India Abdullah Gül University Kayseri Turkey Department of Information Technology National Institute of Technology Jalandhar India Spain School of Computer Science University of St Andrews United Kingdom School of Computer Science and Informatics Cardiff University Cardiff United Kingdom Distributed Systems Group Vienna University of Technology Vienna Austria

Resource management in computing is a very challenging problem that involves making sequential decisions. Resource limitations, resource heterogeneity, dynamic and diverse nature of workload, and the unpredictability of fog/edge computing environments have made resource management even more challenging to be considered in the fog landscape. Recently Artificial Intelligence (AI) and Machine Learning (ML) based solutions are adopted to solve this problem. AI/ML methods with the capability to make sequential decisions like reinforcement learning seem most promising for these type of problems. But these algorithms come with their own challenges such as high variance, explainability, and online training. The continuously changing fog/edge environment dynamics require solutions that learn online, adopting changing computing environment. In this paper, we used standard review methodology to conduct this Systematic Literature Review (SLR) to analyze the role of AI/ML algorithms and the challenges in the applicability of these algorithms for resource management in fog/edge computing environments. Further, various machine learning, deep learning and reinforcement learning techniques for edge AI management have been discussed. Furthermore, we have presented the background and current status of AI/ML-based Fog/Edge Computing. Moreover, a taxonomy of AI/ML-based resource management techniques for fog/edge computing has been proposed and compared the existing techniques based on the proposed taxonomy. Finally, open challenges and promising future research directions have been identified and discussed in the area of AI/ML-based fog/edge computing. Copyright © 2022, The Authors. All rights reserved.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

Results of the Ontology Alignment Evaluation Initiative 2022 17

Results of the Ontology Alignment Evaluation Initiative 2022

引用

17th International Workshop on Ontology Matching, OM 2022

作者： Pour, Mina Abd Nikooie Algergawy, Alsayed Buche, Patrice Castro, Leyla J. Chen, Jiaoyan Dong, Hang Fallatah, Omaima Faria, Daniel Fundulaki, Irini Hertling, Sven He, Yuan Horrocks, Ian Huschka, Martin Ibanescu, Liliana Jiménez-Ruiz, Ernesto Karam, Naouel Laadhar, Amir Lambrix, Patrick Li, Huanyu Li, Ying Michel, Franck Nasr, Engy Paulheim, Heiko Pesquita, Catia Saveta, Tzanina Shvaiko, Pavel Trojahn, Cassia Verhey, Chantelle Wu, Mingfang Yaman, Beyza Zamazal, Ondrej Zhou, Lu Linköping University Swedish E-Science Research Center Linköping Sweden Heinz Nixdorf Chair for Distributed Information Systems Friedrich Schiller University Jena Germany UMR IATE INRAE University of Montpellier France ZB MED Information Centre for Life Sciences Germany Department of Computer Science The University of Manchester United Kingdom Department of Computer Science University of Oxford United Kingdom Information School The University of Sheffield Sheffield United Kingdom University of Lisbon Portugal Institute of Computer Science-FORTH Heraklion Greece Data and Web Science Group University of Mannheim Germany Fraunhofer Institute for High-Speed Dynamics Ernst-Mach-Institut EMI Germany Université Paris-Saclay INRAE AgroParisTech UMR MIA Paris-Saclay France City University of London United Kingdom Fraunhofer FOKUS Institute for Applied Informatics University of Leipzig Germany University of Stuttgart Germany University of Gävle Sweden University Côte d'Azur CNRS Inria France Albert Ludwig University of Freiburg Germany LASIGE Faculdade de Ciências Universidade de Lisboa Portugal Trentino Digitale SpA Trento Italy Institut de Recherche en Informatique de Toulouse France World Data System International Technology Office United States Australian Research Data Commons Australia ADAPT Centre Trinity College Dublin Ireland Prague University of Economics and Business Czech Republic TigerGraph Inc. United States SIRIUS University of Oslo Norway

The Ontology Alignment Evaluation Initiative (OAEI) aims at comparing ontology matching systems on precisely defined test cases. These test cases can be based on ontologies of different levels of complexity and use different evaluation modalities. The OAEI 2022 campaign offered 14 tracks and was attended by 18 participants. This paper is an overall presentation of that campaign. © 2022 Copyright for this paper by its authors.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Reconstructing gene trees from Fitch's xenology relation

arXiv

引用

arXiv 2017年

作者： Geiß, Manuela Anders, John Stadler, Peter F. Wieseke, Nicolas Hellmuth, Marc Bioinformatics Group Department of Computer Science Interdisciplinary Center of Bioinformatics University of Leipzig Härtelstraße 16-18 LeipzigD-04107 Germany Dpt. of Mathematics and Computer Science University of Greifswald Walther- Rathenau-Strasse 47 GreifswaldD-17487 Germany Saarland University Center for Bioinformatics Building E 2.1 P.O. Box 151150 SaarbrückenD-66041 Germany Max-Planck-Institute for Mathematics in the Sciences Inselstraße 22 LeipzigD-04103 Germany Inst. f. Theoretical Chemistry University of Vienna Währingerstraße 17 WienA-1090 Austria Santa Fe Institute 1399 Hyde Park Rd. Santa Fe United States Parallel Computing and Complex Systems Group Department of Computer Science Leipzig University Augustusplatz 10 Leipzig04109 Germany

Two genes are xenologs in the sense of Fitch if they are separated by at least one horizontal gene transfer event. Horizonal gene transfer is asymmetric in the sense that the transferred copy is distinguished from the one that remains within the ancestral lineage. Hence xenology is more precisely thought of as a non-symmetric relation: y is xenologous to x if y has been horizontally transferred at least once since it diverged from the least common ancestor of x and y. We show that xenology relations are characterized by a small set of forbidden induced subgraphs on three vertices. Furthermore, each xenology relation can be derived from a unique least-resolved edge-labeled phylogenetic tree. We provide a linear-time algorithm for the recognition of xenology relations and for the construction of its least-resolved edge-labeled phylogenetic tree. The fact that being a xenology relation is a heritable graph property, finally has far-reaching consequences on approximation problems associated with xenology relations. Copyright © 2017, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

From event labeled gene trees to species trees

arXiv

引用

arXiv 2017年

作者： Hernandez-Rosales, Maribel Hellmuth, Marc Wieseke, Nicolas Huber, Katharina T. Moulton, Vincent Stadler, Peter F. Dpt. of Mathematics and Computer Science University of Greifswald Walther- Rathenau-Strasse 47 GreifswaldD-17487 Saarland University Center for Bioinformatics Building e 2.1 P.O. Box 151150 SaarbrückenD-66041 Bioinformatics Group Department of Computer Science Interdisciplinary Center of Bioinformatics University of Leipzig Härtelstraße 16-18 LeipzigD-04107 Germany School of Computing Sciences University of East Anglia NorwichNR4 7TJ United Kingdom Max-Planck-Institute for Mathematics in the Sciences Inselstraße 22 LeipzigD-04103 Germany Inst. F. Theoretical Chemistry University of Vienna Währingerstraße 17 WienA-1090 Austria Santa Fe Institute 1399 Hyde Park Rd. Santa Fe United States Parallel Computing and Complex Systems Group Department of Computer Science Leipzig University Augustusplatz 10 Leipzig04109 Germany

Background: Tree reconciliation problems have long been studied in phylogenetics. A particular variant of the reconciliation problem for a gene tree T and a species tree S assumes that for each interior vertex x of T it is known whether x represents a speciation or a duplication. This problem appears in the context of analyzing orthology data. Results: We show that S is a species tree for T if and only if S displays all rooted triples of T that have three distinct species as their leaves and are rooted in a speciation vertex. A valid reconciliation map can then be found in polynomial time. Simulated data shows that the event-labeled gene trees convey a large amount of information on underlying species trees, even for a large percentage of losses. Conclusions: The knowledge of event labels in a gene tree strongly constrains the possible species tree and, for a given species tree, also the possible reconciliation maps. Nevertheless, many degrees of freedom remain in the space of feasible solutions. In order to disambiguate the alternative solutions additional external constraints as well as optimization criteria could be employed. Copyright © 2017, The Authors. All rights reserved.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Self-Awareness for Autonomous systems

引用

PROCEEDINGS OF THE IEEE 2020年第7期108卷 971-975页

作者： Dutt, Nikil Regazzoni, Carlo S. Rinner, Bernhard Yao, Xin Nikil Dutt (Fellow IEEE) received the Ph.D. degree from the University of Illinois at Urbana–Champaign Champaign IL USA in 1989.""He is currently a Distinguished Professor of computer science (CS) cognitive sciences and electrical engineering and computer sciences (EECS) with the University of California at Irvine Irvine CA USA. He is a coauthor of seven books. His research interests include embedded systems electronic design automation (EDA) computer architecture distributed systems healthcare Internet of Things (IoT) and brain-inspired architectures and computing.""Dr. Dutt is a Fellow of ACM. He was a recipient of the IFIP Silver Core Award. He has received numerous best paper awards. He serves as the Steering Committee Chair of the IEEE/ACM Embedded Systems Week (ESWEEK). He is also on the steering organizing and program committees of several premier EDA and embedded system design conferences and workshops. He has served on the Editorial Boards for the IEEE Transactions on Very Large Scale Integration (VLSI) Systems and the ACM Transactions on Embedded Computing Systems and also previously served as the Editor-in-Chief (EiC) for the ACM Transactions on Design Automation of Electronic Systems. He served on the Advisory Boards of the IEEE Embedded Systems Letters the ACM Special Interest Group on Embedded Systems the ACM Special Interest Group on Design Automationt and the ACM Transactions on Embedded Computing Systems. Carlo S. Regazzoni (Senior Member IEEE) received the M.S. and Ph.D. degrees in electronic and telecommunications engineering from the University of Genoa Genoa Italy in 1987 and 1992 respectively.""He is currently a Full Professor of cognitive telecommunications systems with the Department of Electrical Electronics and Telecommunication Engineering and Naval Architecture (DITEN) University of Genoa and a Co-Ordinator of the Joint Doctorate on Interactive and Cognitive Environments (JDICE) international Ph.D. course started initially as EU Erasmus Mundus Project and

Autonomous systems are able to make decisions and potentially take actions without direct human intervention, which requires some knowledge about the system and its environment as well as goal-oriented reasoning. In computer systems, one can derive such behavior from the concept of a rational agent with autonomy (“control over its own actions”), reactivity (“react to events from the environment”), proactivity (“act on its own initiative”), and sociality (“interact with other agents”) as fundamental properties \n[1]\n. Autonomous systems will undoubtedly pervade into our everyday lives, and we will find them in a variety of domains and applications including robotics, transportation, health care, communications, and entertainment to name a few. \nThe articles in this month’s special issue cover concepts and fundamentals, architectures and techniques, and applications and case studies in the exciting area of self-awareness in autonomous systems.

关键词： Special issues and sections Autonomous systems Self-aware Robot sensing systems Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Preface

引用

CEUR Workshop Proceedings 2017年 1826卷

作者： Kopp, Oliver Lenhard, Jörg Pautasso, Cesare University of Stuttgart Institute for Parallel and Distributed Systems Universitätsstraße 38 StuttgartDE70569 Germany Karlstad University Department of Mathematics and Computer Science Universitetsgatan 2 KarlstadSE65188 Sweden USI Faculty of Informatics Architecture Design and Web Information Systems Engineering Research Group Via Buffi 13 LuganoCH6900 Switzerland

来源：评论

学校读者我要写书评

暂无评论

Cograph editing: Merging modules is equivalent to editing P4s

arXiv

引用

arXiv 2017年

作者： Fritz, Adrian Hellmuth, Marc Wieseke, Nicolas Stadler, Peter F. Computational Biology of Infection Research Helmholtz Centre for Infection Research Inhoffenstraße 7 BraunschweigD-38124 Germany University of Greifswald Dpt. of Mathematics and Computer Science Walther- Rathenau-Strasse 47 GreifswaldD-17487 Germany Saarland University Center for Bioinformatics Building e 2.1 P.O. Box 151150 SaarbrückenD-66041 Germany Parallel Computing and Complex Systems Group Department of Computer Science University of Leipzig Augustusplatz 10 LeipzigD-04109 Germany Bioinformatics Group Department of Computer Science Interdisciplinary Center of Bioinformatics University of Leipzig Härtelstraße 16-18 LeipzigD-04107 Germany Max-Planck-Institute for Mathematics in the Sciences Inselstraße 22 LeipzigD-04103 Germany Inst. F. Theoretical Chemistry University of Vienna Währingerstraße 17 WienA-1090 Austria Santa Fe Institute 1399 Hyde Park Rd. Santa FeNM87501 United States

The modular decomposition of a graph G = (V;E) does not contain prime modules if and only if G is a cograph, that is, if no quadruple of vertices induces a simple connected path P4. The cograph editing problem consists in inserting into and deleting from G a set F of edges so that H = (V,EΔF) is a cograph and |F| is minimum. This NP-hard combinatorial optimization problem has recently found applications, e.g., in the context of phylogenetics. Efficient heuristics are hence of practical importance. The simple characterization of cographs in terms of their modular decomposition suggests that instead of editing G one could operate directly on the modular decomposition. We show here that editing the induced P4s is equivalent to resolving prime modules by means of a suitable defined merge operation on the submodules. Moreover, we characterize so-called module-preserving edit sets and demonstrate that optimal pairwise sequences of module-preserving edit sets exist for every non-cograph. This eventually leads to an exact algorithm for the cograph editing problem. In addition, we provide two heuristics with time complexity O(|V|3), resp., O(|V|2). Copyright © 2017, The Authors. All rights reserved.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Measuring success for a future vision: Defining impact in science gateways/virtual research environments

Measuring success for a future vision: Defining impact in sc...

引用

作者： Calyam, Prasad Wilkins-Diehr, Nancy Miller, Mark Brookes, Emre H. Arora, Ritu Chourasia, Amit Jennewein, Douglas M. Nandigam, Viswanath Drew LaMar, M. Cleveland, Sean B. Newman, Greg Wang, Shaowen Zaslavsky, Ilya Cianfrocco, Michael A. Ellett, Kevin Tarboton, David Jeffery, Keith G. Zhao, Zhiming González-Aranda, Juan Perri, Mark J. Tucker, Greg Candela, Leonardo Kiss, Tamas Gesing, Sandra Department of Electrical Engineering and Computer Science University of Missouri ColumbiaMO United States San Diego Supercomputer Center University of California San DiegoCA United States Department of Biochemistry University of Texas Health Science Center HoustonTX United States Texas Advanced Computing Center University of Texas at Austin AustinTX United States Information Technology Services University of South Dakota VermillionSD United States Biology Department College of William and Mary WilliamsburgVA United States Information Technology Services–Cyberinfrastructure University of Hawaii HonoluluHI United States Natural Resource Ecology Laboratory Colorado State University Fort CollinsCO United States Department of Geography and Geographic Information Science University of Illinois UrbanaIL United States Department of Biological Chemistry and Life Sciences Institute University of Michigan Ann ArborMI United States Pervasive Technology Institute Indiana University BloomingtonIN United States Civil and Environmental Engineering Utah State University LoganUT United States Keith G. Jeffery Consultants Faringdon United Kingdom Multiscale Networked Systems Group University of Amsterdam Amsterdam Netherlands Chief Technology Office LifeWatch ERIC Seville Spain Chemistry Department Sonoma State University Rohnert ParkCA United States Department of Geological Sciences CIRES University of Colorado Boulder BoulderCO United States National Research Council of Italy Pisa Italy Research Center for Parallel Computing University of Westminster London United Kingdom Center for Research Computing University of Notre Dame Notre DameIN United States

Scholars worldwide leverage science gateways/virtual research environments (VREs) for a wide variety of research and education endeavors spanning diverse scientific fields. Evaluating the value of a given science gateway/VRE to its constituent community is critical in obtaining the financial and human resources necessary to sustain operations and increase adoption in the user community. In this article, we feature a variety of exemplar science gateways/VREs and detail how they define impact in terms of, for example, their purpose, operation principles, and size of user base. Further, the exemplars recognize that their science gateways/VREs will continuously evolve with technological advancements and standards in cloud computing platforms, web service architectures, data management tools and cybersecurity. Correspondingly, we present a number of technology advances that could be incorporated in next-generation science gateways/VREs to enhance their scope and scale of their operations for greater success/impact. The exemplars are selected from owners of science gateways in the science Gateways Community Institute (SGCI) clientele in the United States, and from the owners of VREs in the International Virtual Research Environment Interest group (VRE-IG) of the Research Data Alliance. Thus, community-driven best practices and technology advances are compiled from diverse expert groups with an international perspective to envisage futuristic science gateway/VRE innovations. © 2020 John Wiley & Sons, Ltd.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Cost model and copyright management for 3D digital contents using multilevel complex objects

引用

systems and computers in Japan 2000年第12期31卷 73-82页

作者： Kidawara, Yutaka Sugiyama, Yuichi Tanaka, Katsumi Telecom. Adv. Organization of Japan Kobe 650-0046 Japan Div. of Media and Computer Sciences Grad. Sch. of Science and Technology Kobe University Kobe 657-0013 Japan Dept. of Comp. and Syst. Engineering Grad. Sch. of Science and Technology Kobe University Kobe 657-0013 Japan Instrumentation Department School of Engineering Kobe University Kobe Steel Ltd. Telecom. Adv. Organization of Japan Dept. of Comp. and Syst. Engineering Grad. Sch. of Sci. and Engineering Kobe University Information Processing Council Syst. Contr. and Info. Association Eng. and Information Department Kyoto University Education Department Kobe University Engineering School Engineering Department Div. of Media and Computer Sciences Grad. Sch. of Science and Technology Database Systems Research Group Information Processing Council Next Generation Digit. Image C. Res. Distributed Devmt.-type D. Min. of Educ.'s Focal Topic Research Kobe Multimedia Internet Cooperative Information Processing Council Artif. Intelligence Association IEEE Computer Society

The authors discuss multimedia data communications using the Internet from the standpoint of providing services, and propose a cost model based on multilevel complex objects for the purpose of responding to the various needs of users. The proposed cost model creates multiple levels of the service which provide each element of the complex object, and then introduces the concept of `service ranges' that can dynamically vary the service which can be received within the scope of the price paid. Conventional multimedia data can only provide one service. However, the authors' service can be selected dynamically from within a range based on the price paid by the user. In order to evaluate these methods, the authors created a framework which can be applied to 3DCG content using VRML by using Java and OODBMS. In addition, rights such as copyrights that are frequently a part of 3DCG content must be protected. The proposed multilevel complex object can confirm a user's rights by using a built-in user authentication function. Thus, copyright management features that provide services within a service range available to valid users and block out illegal users can be realized.

关键词： Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

parallel AND distributed TLM COMPUTATION WITH SIGNAL-PROCESSING FOR ELECTROMAGNETIC-FIELD MODELING

引用

INTERNATIONAL JOURNAL OF NUMERICAL MODELLING-ELECTRONIC NETWORKS DEVICES AND FIELDS 1995年第3-4期8卷 169-185页

作者： SO, PPM ESWARAPPA, C HOEFER, WJR NSERC/MPR Teltech Research Chair in RF Engineering Department of Electrical and Computer Engineering University of Victoria Victoria British Columbia V8W 3P6 Canada Poman So received his B.Sc. degree in computer science and physics from the University of Toronto Toronto Onatario Canada in 1985. He obtained his B.A. Sc. and M.A.Sc. degrees in electrical engineering (summa cum laude) from the University of Ottawa Ottawa Ontario Canada in 1987 and 1989 respectively. Mr So was a research engineer in the University of Ottawa from January 1989 to October 1991 his research interests included CAD techniques of microwave circuits and numerical methods for electromagnetic wave modelling. He specialized in the development of electromagnetic engineering CAD software and successfully implemented a number of electromagnetic wave simulators based on the two-dimensional and three-dimensional transmission-line matrix methods. From August 1990 to February 1991 he accompanied Professor W. J. R. Hoefer to Rome Italy and Sophia Antiopolas France. During that time he implemented a parallel version of the 3D-TLM simulator for the CM-2 Connection Machine using C-Star and X Windows Library. He is a research engineer and a Ph.D. student at the University of Victoria Victoria British Columbia Canada. He ported the 2D- and 3D-TLM simulators to DECmpp 1200 massively parallel computer using MPL C and C++. He also combined OSA90/hope a commercially available microwave CAD program with a 2D-TLM simulation module for geometry optimization using the Datapipe technique of OSA90/hope. Recently he has developed a distributed client-server computing technique for the TLM method this technique could accelerate the TLM simulation by more than an order of magnitude. Channabasappa Eswarappa received the M.Tech. degree in electrical engineering from the Indian Institute of Technology Kanpur India in 1983 and Ph. D. degree from the University of Ottawa Canada in 1990. He worked as an Assistant Executive Engineer and later as

This paper describes the implementation of transmission-line matrix (TLM) method algorithms on a massively parallel computer (DECmpp 12000), the technique of distributed computing in the UNIX environment, and the combination of TLM analysis with Prony's method as well as with autoregressive moving average (ARMA) digital signal processing for electromagnetic field modelling. By combining these advanced computation techniques, typical electromagnetic field modelling of microwave structures by TLM analysis can be accelerated by a few orders of magnitude.

关键词： Mathematical models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：