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

18th International Conference on Membrane Computing, CMC 1018

作者： Csuhaj-Varjú, Erzsébet Verlan, Sergey Department of Algorithms and Their Applications Faculty of Informatics ELTE Eötvös Loránd University Pázmány Péter sétány 1/c Budapest1117 Hungary UPEC Créteil94010 France

ISBN: (纸本)9783319733586

Generalized communicating P systems are particular variants of networks of cells where each rule moves only two objects. In this paper we show that GCPSs with three cells and with only join, or only split, or only chain rules are computationally complete computing devices. These bounds are improvements of the previous results. © 2018, Springer International Publishing AG.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Synthesis of Hypothetical Sociograms for Social Network Analysis

Synthesis of Hypothetical Sociograms for Social Network Anal...

引用

International Conference on Soft Computing and Machine Intelligence (ISCMI)

作者： Abejide Ade-Ibijola Formal Structures Algorithms and Industrial Applications Research Cluster Department of Applied Information Systems University of Johannesburg South Africa

ISBN: (纸本)9781728113029;9781728113012

Sociograms (or Social Network Graphs) have evolved to be insightful tools. These are graphs that depict social relationships amongst individual entities or organisations. Inferences (such as media influence, information transmission, behavioural change, and evolution of interactions across geographical regions) can be made from Sociograms. However, there are privacy concerns around using real life social media profiles to generate graphs for analytics in practice/illustration sessions. In this paper, we present an algorithm for the automatic generation of hypothetical Sociograms. This algorithm generates random hypothetical names as vertices, and random relationships between them as directed edges. Each generated graph is rendered graphically using the Microsoft's Automatic Graph Layout API. Results showing 1,000 distinct synthesised social network graphs can be found at: ***/SynthesisedSociograms. These synthesised sociograms can be useful in describing hypothetical scenarios in instruction or planning sessions, where real-life data is not necessary.

关键词： Social networking (online) Tools Data visualization Graph theory Layout Inference algorithms Information systems

来源：评论

学校读者我要写书评

暂无评论

APCol systems with teams 18th

APCol systems with teams

引用

18th International Conference on Membrane Computing, CMC 1018

作者： Ciencialová, Lucie Cienciala, Luděk Csuhaj-Varjú, Erzsébet Institute of Computer Science and Research Institute of the IT4Innovations Centre of Excellence Silesian University in Opava Opava Czech Republic Department of Algorithms and Their Applications Faculty of Informatics ELTE Eötvös Loránd University Pázmány Péter sétány 1/c Budapest1117 Hungary

ISBN: (纸本)9783319733586

We investigate the possibility of "going beyond" Turing in the terms of Automaton-like P Colonies (APCol systems, for short), variants of P colonies processing strings as their environments. We use the notion of teams of agents as a restriction for the maximal parallelism of the computation. In addition, we assign a colour to each team. In the course of the computation, the colour is changing according to the team that is currently active. We show that we can simulate red-green counter machines with APCol systems with two-coloured teams of minimal size. Red-green counter machines are computing devices with infinite run on finite input that exceed the power of Turing machines. © 2018, Springer International Publishing AG.

关键词： Turing machines

来源：评论

学校读者我要写书评

暂无评论

Detailed investigation of deep features with sparse representation and dimensionality reduction in CBIR: A comparative study

arXiv

引用

arXiv 2018年

作者： Tarawneh, Ahmad S. Celik, Ceyhun Hassanat, Ahmad Chetverikov, Dmitry Department of Algorithms and their Applications Eötvös Loránd University Budapest Hungary Department of Computer Engineering Gazi University Ankara Turkey Department of Information Technology Mutah University Karak Jordan

Research on content-based image retrieval (CBIR) has been under development for decades, and numerous methods have been competing to extract the most discriminative features for improved representation of the image content. Recently, deep learning methods have gained attention in computer vision, including CBIR. In this paper, we present a comparative investigation of different features, including low-level and high-level features, for CBIR. We compare the performance of CBIR systems using different deep features with state-of-the-art low-level features such as SIFT, SURF, HOG, LBP, and LTP, using different dictionaries and coefficient learning techniques. Furthermore, we conduct comparisons with a set of primitive and popular features that have been used in this field, including colour histograms and Gabor features. We also investigate the discriminative power of deep features using certain similarity measures under different validation approaches. Furthermore, we investigate the effects of the dimensionality reduction of deep features on the performance of CBIR systems using principal component analysis, discrete wavelet transform, and discrete cosine transform. Unprecedentedly, the experimental results demonstrate high (95% and 93%) mean average precisions when using the VGG-16 FC7 deep features of Corel-1000 and Coil-20 datasets with 10-D and 20-D K-SVD, respectively. Copyright © 2018, The Authors. All rights reserved.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Deep face image retrieval: A comparative study with dictionary learning

arXiv

引用

arXiv 2018年

作者： Tarawneh, Ahmad S. Hassanat, Ahmad B.A. Celik, Ceyhun Chetverikov, Dmitry Rahman, M. Sohel Verma, Chaman Department of Algorithms and Their Applications Eötvös Loránd University Budapest Hungary Department of Information Technology Mutah University Karak Jordan Department of Computer Engineering Gazi University Ankara Turkey Department of CSE BUET ECE Building West Palasi Dhaka1205 Bangladesh

Facial image retrieval is a challenging task since faces have many similar features (areas), which makes it difficult for the retrieval systems to distinguish faces of different people. With the advent of deep learning, deep networks are often applied to extract powerful features that are used in many areas of computer vision. This paper investigates the application of different deep learning models for face image retrieval, namely, Alexlayer6, Alexlayer7, VGG16layer6, VGG16layer7, VGG19layer6, and VGG19layer7, with two types of dictionary learning techniques, namely K-means and K-SVD. We also investigate some coefficient learning techniques such as the Homotopy, Lasso, Elastic Net and SSF and their effect on the face retrieval system. The comparative results of the experiments conducted on three standard face image datasets show that the best performers for face image retrieval are Alexlayer7 with K-means and SSF, Alexlayer6 with K-SVD and SSF, and Alexlayer6 with K-means and SSF. The APR and ARR of these methods were further compared to some of the state of the art methods based on local descriptors. The experimental results show that deep learning outperforms most of those methods and therefore can be recommended for use in practice of face image retrieval Copyright © 2018, The Authors. All rights reserved.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

On tree-restricted regular-controlled context-free grammars

引用

International Journal of Computer Mathematics: Computer Systems Theory 2017年第4期2卷 147-163页

作者： Meduna, A. Soukup, O. Csuhaj-Varjú, E. Brno University of Technology Faculty of Information Technology IT4Innovations Centre of Excellence Brno Czech Republic Department of Algorithms And Their Applications Faculty of Informatics Eötvös Loránd University Budapest Hungary

This paper gives simple tree-based conditions under which regular-controlled context-free grammars generate context-free languages of finite index, so they cannot even generate all context-free languages. It defines the notion of path-changing derivation step which corresponds to performing two consecutive rewritings of nonterminal symbols present in the different branches of the derivation tree. It proves that if there exists a certain constant that limits the number of path-changing derivation steps, then, the regular-controlled grammar generates a context-free language of finite index. At the end, we generalize achieved result and provide some open problems for future study. © 2017, © 2017 Informa UK Limited, trading as Taylor & Francis Group.

关键词： context-freeness of finite index Regular-controlled context-free grammars restricted derivation trees

来源：评论

学校读者我要写书评

暂无评论

Quantum Computing for High-Energy Physics State of the Art and Challenges Summary of the QC4HEP Working Group

arXiv

引用

arXiv 2023年

作者： Di Meglio, Alberto Jansen, Karl Tavernelli, Ivano Alexandrou, Constantia Arunachalam, Srinivasan Bauer, Christian W. Borras, Kerstin Carrazza, Stefano Crippa, Arianna Croft, Vincent de Putter, Roland Delgado, Andrea Dunjko, Vedran Egger, Daniel J. Fernández-Combarro, Elias Fuchs, Elina Funcke, Lena González-Cuadra, Daniel Grossi, Michele Halimeh, Jad C. Holmes, Zoë Kühn, Stefan Lacroix, Denis Lewis, Randy Lucchesi, Donatella Martinez, Miriam Lucio Meloni, Federico Mezzacapo, Antonio Montangero, Simone Nagano, Lento Radescu, Voica Ortega, Enrique Rico Roggero, Alessandro Schuhmacher, Julian Seixas, Joao Silvi, Pietro Spentzouris, Panagiotis Tacchino, Francesco Temme, Kristan Terashi, Koji Tura, Jordi Tüysüz, Cenk Vallecorsa, Sofia Wiese, Uwe-Jens Yoo, Shinjae Zhang, Jinglei GenevaCH-1211 Switzerland CQTA Deutsches Elektronen-Synchrotron DESY Platanenallee 6 Zeuthen15738 Germany Computation-based Science and Technology Research Center The Cyprus Institute 20 Constantinou Kavafi str. Nicosia2121 Cyprus IBM Quantum IBM Research – Zurich Rüschlikon8803 Switzerland Department of Physics University of Cyprus PO Box 20537 Nicosia1678 Cyprus IBM Quantum IBM Research 1101 Kitchawan Rd Yorktown HeightsNY United States Physics Division LBNL - M/S 50A5104 1 Cyclotron Rd BerkeleyCA United States Deutsches Elektronen-Synchrotron DESY Notkestrasse 85 Hamburg22607 Germany RWTH Aachen University Templergraben 55 Aachen52062 Germany TIF Lab Dipartimento di Fisica Università degli Studi di Milano INFN Sezione di Milano Milan Italy Institut für Physik Humboldt-Universität zu Berlin Newtonstr. 15 Berlin12489 Germany haQaLi Applied Quantum Algorithms Leiden Netherlands Physics Division Oak Ridge National Laboratory Oak RidgeTN37831 United States Department of Computer Science Facultad de Ciencias University of Oviedo Asturias33007 Spain Institute of Theoretical Phyiscs Leibniz University Hannover Hannover30167 Germany Physikalisch-Technische Bundesanstalt Braunschweig38116 Germany University of Bonn Nußallee 14-16 Bonn53115 Germany Institute for Theoretical Physics University of Innsbruck Innsbruck6020 Austria Institute for Quantum Optics and Quantum Information the Austrian Academy of Sciences Innsbruck6020 Austria Department of Physics Arnold Sommerfeld Center for Theoretical Physics Ludwig-Maximilians-Universität München Germany Munich Center for Quantum Science and Technology Germany LausanneCH-1015 Switzerland Paris-Saclay University CNRS IN2P3 IJCLab Orsay91405 France Department of Physics and Astronomy York University TorontoONM3J 1P3 Canada Department of Physics and Astronomy Università di Padova V. Marzolo 8 PadovaI-35131 Italy INFN - Sezione di Padova Via Marzolo 8 Padova35131 Italy Ni

Quantum computers offer an intriguing path for a paradigmatic change of computing in the natural sciences and beyond, with the potential for achieving a so-called quantum advantage, namely a significant (in some cases exponential) speed-up of numerical simulations. The rapid development of hardware devices with various realizations of qubits enables the execution of small scale but representative applications on quantum computers. In particular, the high-energy physics community plays a pivotal role in accessing the power of quantum computing, since the field is a driving source for challenging computational problems. This concerns, on the theoretical side, the exploration of models which are very hard or even impossible to address with classical techniques and, on the experimental side, the enormous data challenge of newly emerging experiments, such as the upgrade of the Large Hadron Collider. In this roadmap paper, led by CERN, DESY and IBM, we provide the status of high-energy physics quantum computations and give examples for theoretical and experimental target benchmark applications, which can be addressed in the near future. Having the IBM 100 100 challenge in mind, where possible, we also provide resource estimates for the examples given using error mitigated quantum computing. © 2023, CC BY-SA.

关键词： High energy physics

来源：评论

学校读者我要写书评

暂无评论

Regex parser II: Teaching regular expression fundamentals via educational gaming 46th

Regex parser II: Teaching regular expression fundamentals vi...

引用

46th Annual Conference of the Southern African Computer Lecturers’ Association, SACLA 2017

作者： Rosenfeld, Ariel Ade-Ibijola, Abejide Ewert, Sigrid School of Computer Science and Applied Mathematics University of the Witwatersrand Johannesburg South Africa Formal Structures Algorithms and Industrial Applications Research Cluster Department of Applied Information Systems University of Johannesburg Auckland Park South Africa

ISBN: (纸本)9783319696690

We present an educational game that is expected to improve the teaching of and stimulate the interest in regular expressions. The game generates regular expressions using pseudo-random numbers and predefined templates and asks the player to provide strings that are in the language corresponding to the given regular expression while a timer counts down. Points in the game are awarded on how many strings the player was able to enter before time runs out (The game, which requires the JRE, is available via http://***/RegexParserII). © Springer International Publishing AG 2017.

关键词： Computer games

来源：评论

学校读者我要写书评

暂无评论

On the power of permitting semi-conditional grammars

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2017年 10396 LNCS卷 173-184页

作者： Gazdag, Zsolt Tichler, Krisztián Department of Foundations of Computer Science University of Szeged Szeged Hungary Department of Algorithms and Their Applications Eötvös Loránd University Budapest Hungary

ISBN: (纸本)9783319628080

Permitting semi-conditional grammars are such extensions of context-free grammars where each rule is associated with a word v, and such a rule can be applied to a sentential form u only if v is a subword of u. In this paper we show that the class of languages generated by permitting semi-conditional grammars with no erasing rules is strictly included in the class of context-sensitive languages. © Springer International Publishing AG 2017.

关键词： Context free grammars

来源：评论

学校读者我要写书评

暂无评论

Watson-Crick T0L Systems and Red-Green Register Machines

Watson-Crick T0L Systems and Red-Green Register Machines

引用

作者： Csuhaj-Varjú, Erzsébet Freund, Rudolf Vaszil, György Department of Algorithms and Their Applications Faculty of Informatics Eötvös Loránd University Pazmany Peter setany 1/c Budapest1117 Hungary Institut of Computer Languages Technische Universität Wien Favoritenstraße 9-11 Wien1040 Austria Department of Computer Science University of Debrecen Kassai út 26 Debrecen4028 Hungary

In this paper we establish a connection between two concepts of unconventional computing, namely Watson-Crick T0L systems (schemes) and red-green Turing machines or redgreen register machines. Our research was inspired by the conceptual similarity of a mind change of a red-green Turing or register machine and of a turn to the complementary string in Watson- Crick T0L systems as well as by the fact that both red-green Turing or register machines and Watson-Crick T0L systems define infinite computations on finite inputs. We define language recognition for Watson-Crick T0L systems based on the infinite sequences they generate, and we show that the sets of (vectors of) natural numbers which can be recognized by so-called standard Watson-Crick T0L schemes (with a context-free trigger) include the sets recognized by red-green register machines (or red-green Turing machines). The obtained results imply that using Watson- Crick T0L schemes we may "go beyond Turing" as the red-green register machines and red-green Turing machines can do. Furthermore, we also show that for any deterministic Watson-Crick 0L scheme with a regular trigger the recognizability problem of a word is decidable.

关键词： Turing machines

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：