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

Periodica polytechnica Electrical engineering and computer science 2017年第2期61卷 193-197页

作者： Csehi, Csongor Gy. Recski, András Department of Computer Science and Information Theory Faculty of Electrical Engineering and Informatics Budapest University of Techology and Economics P.O.B. 91 BudapestH-1521 Hungary

Consider a linear network composed of 2-terminal devices. Its interconnection structure is described by a graph G. The voltages or the currents of a subset of devices can independently be prescribed if and only if the subset of the corresponding edges in the graph G is circuit-free or cut set free, respectively. This classical result of Kirchhoff can be generalized for networks containing multiterminal devices as well: The independence structure can be described by the circuits and cut sets of a more general abstract mathematical structure, a matroid M. However, these matroids will not always be graphic. Using some recent mathematical results for characterizing graphic structures among the matroids, here we give a physical characterization of subclasses of those active networks where M happens to be graphic.

关键词： Linear networks

来源：评论

学校读者我要写书评

暂无评论

Micromorphology of AlN Epilayers on Sapphire Substrates

Micromorphology of AlN Epilayers on Sapphire Substrates

引用

2017 International Conference on computer, Electronics and Communication Engineering(CECE2017)

作者： ?tefan ??LU Dinara SOBOLA Pavel TOMáNEK Sebastian STACH Technical University of Cluj-Napoca Faculty of Mechanical Engineering Department of AETDiscipline of Descriptive Geometry and Engineering Graphics Brno University of Technology Faculty of Electrical Engineering and Communication Physics Department University of Silesia Faculty of Computer Science and Materials Science Institute of InformaticsDepartment of Biomedical Computer Systems

The purpose of this paper was to describe the 3 D nano-scaled surface topography of the aluminum nitride on sapphire. The structures were prepared by magnetron sputtering with heating of the sapphire substrate. The dependence of the layers topography on the substrate temperature was presented. Surface appearance was studied by atomic force microscopy(AFM). The quantitative topography data from AFM were used for surface characterization by fractal analysis and statistical parameters. The results of fractal analysis show the correlation of fractal dimension and statistical characteristics of surface topography. The data may contribute to manufacture of AlN thin films with desired surface characteristics.

关键词： Aluminum nitride Atomic force microscopy Fractal analysis Minkowsky functionals Surface micromorphology

来源：评论

学校读者我要写书评

暂无评论

Weak Moment of a Class of Stochastic Heat Equation with Martingale-valued Harmonic Function

arXiv

引用

arXiv 2017年

作者： Omaba, Ejighikeme Mcsylvester Department of Mathematics Computer Science Statistics and Informatics Faculty of Science Federal University Ndufu-Alike Ikwo P.M.B 1010 Abakaliki Ebonyi State Nigeria

A study of a non-linear parabolic SPDEs of the form ∂tu = Lu +∂ (u) f (Btx,t)w with w as the space-time white noise and f (Btx,t) a space-time harmonic function was done. The function ∂ : R → R is Lipschitz continuous and L the L2 -generator of a Lévy process. Some precise condition for existence and uniqueness of the solution were given and we show that the solution grows weakly(in law/distribution) in time (for large t) at most a precise exponential rate for the L;and grows in time at most a precise exponential rate for the case of L = -(-∆)α/2,α ∊(1,2] generator of an alpha-stable ***: 35R60, 60H15, Secondary: 82B44 Copyright © 2017, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Segmentation-based compound figure detection and separation methods

Segmentation-based compound figure detection and separation ...

引用

2016 International Symposium on Industrial Electronics, INDEL 2016

作者： Ševo, Igor Mijatovic, Tijana Department for Computer Science and Informatics Faculty of Electrical Engineering Banja Luka Bosnia and Herzegovina

ISBN: (纸本)9781509023295

Figure detection, separation and image classification are common problems occurring in various fields, especially medicine. Since image databases are usually large, manual classification would be a demanding task. In this paper, we proposed a method for automatic compound figure detection and separation, and gave a comparison between other recognition methods, such as convolutional neural networks. The proposed method is based on differentiating objects in the image, and merging object artifacts with the nearest large object. Parameters of size and distance were varied, and different criteria for determining the object boundaries were tested. Using this method, an accuracy of 90.20% was achieved on a test set of 500 images, with an average processing time less than 600ms per image for the given combination of parameters. © 2016 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Clustered class-dependant training method for digit recognition classifiers

Clustered class-dependant training method for digit recognit...

引用

2016 International Symposium on Industrial Electronics, INDEL 2016

作者： Ševo, Igor Kelečević, Aleksandar Department for Computer Science and Informatics Faculty of Electrical Engineering Banja Luka Bosnia and Herzegovina

ISBN: (纸本)9781509023295

This paper presents a convolutional neural network clustering approach for handwritten digits recognition. Neural networks were trained individually, using the same training set and combined into clusters, depending on the training method used. These clusters formed a layered architecture, where each layer attempted to recognize the given digit, when the previous layers were not able to do so with sufficient certainty. We examine various ways of combining such clusters and training their constituent networks. © 2016 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Cost-benefit analysis game for efficient storage allocation in cloud-centric Internet of Things systems: A game theoretic perspective 15

Cost-benefit analysis game for efficient storage allocation ...

引用

15th IFIP/IEEE International Symposium on Integrated Network and Service Management, IM 2017

作者： Skourletopoulos, Georgios Mavromoustakis, Constandinos X. Mastorakis, George Sahalos, John N. Batalla, Jordi Mongay Dobre, Ciprian Department of Computer Science University of Nicosia Nicosia Cyprus Department of Informatics Engineering Technological Educational Institute of Crete Heraklion Crete Greece Department of Physics Aristotle University of Thessaloniki Thessaloniki Greece National Institute of Telecommunications and Warsaw University of Technology Szachowa Str. 1 and Nowowiejska Str. 15/19 Warsaw Poland Department of Computer Science and Engineering Faculty of Automatic Control and Computers University Politehnica of Bucharest Bucharest Romania

ISBN: (纸本)9783901882890

The advances in Internet of Everything (IoE) and the market-oriented cloud computing have provided opportunities to resolve the challenges caused by the Internet of Things (IoT) infrastructure virtualization, capacity planning, data storage or complexity. The volume and types of IoT data motivate the need for a data storage framework towards the integration of both structured and unstructured data. In this paper, we propose a novel game theoretic technique for efficient and dynamic storage allocation in cloud-centric IoT systems. The benefit maximization problem is formulated as a cost-benefit analysis game investigating the storage capacity currently used in the cloud. In view of each player's strategy to lease additional storage capacity, the game property is analyzed and we prove that the game always admits a pure strategy Nash equilibrium. Since the player's decision affects the level of benefit maximization, we elaborate on a cost-optimal storage allocation incentive mechanism, which scales effectively once non-linear or linear demand for storage capacity occurs, towards achieving optimal leasing conditions on cloud storage and computing capacity level. The experimental validation tests prove the effectiveness of the proposed game theoretic approach allocating the requests for more storage capacity in a cost-effective manner, which achieves to maximize the benefits. © 2017 IFIP.

关键词： Distributed cloud

来源：评论

学校读者我要写书评

暂无评论

Topological classification of ω-stable flows on surfaces by means of effectively distinguishable multigraphs4

arXiv

引用

arXiv 2017年

作者： Kruglov, Vladislav E. Malyshev, Dmitry S. Pochinka, Olga V. HSE Campus in Nizhny Novgorod Faculty of Informatics Mathematics and Computer Science Laboratory of Topological Methods in Dynamics. Trainee Researcher Lobachevsky State University of Nizhny Novgorod Institute ITMM Department of Mathematical Physics Optimal Control Master’s HSE Campus in Nizhny Novgorod Laboratory of Algorithms and Technologies for Networks Analysis. Leading Research Fellow HSE Campus in Nizhny Novgorod Faculty of Informatics Mathematics and Computer Science Department of Applied Mathematics and Informatics Lobachevsky State University of Nizhny Novgorod Institute ITMM Department of Algebra Geometry and Discrete Mathematics HSE Campus in Nizhny Novgorod Faculty of Informatics Mathematics and Computer Science Department of Fundamental Mathematics Department Head. HSE Campus in Nizhny Novgorod Faculty of Informatics Mathematics and Computer Science Laboratory for Topological Methods in Dynamics. Laboratory

Structurally stable (rough) flows on surfaces have only finitely many singularities and finitely many closed orbits, all of which are hyperbolic, and they have no trajectories joining saddle points. The violation of the last property leads to Ω-stable flows on surfaces, which are not structurally stable. However, in the present paper we prove that a topological classification of such flows is also reduced to a combinatorial problem. Our complete topological invariant is a multigraph, and we present a polynomial-time algorithm for the distinction of such graphs up to an isomorphism. We also present a graph criterion for orientability of the ambient manifold and a graph-associated formula for its Euler characteristic. Additionally, we give polynomial-time algorithms for checking the orientability and calculating the *** Codes 37D05 Copyright © 2017, The Authors. All rights reserved.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Implicit memory processing in the formation of a shared communication system 15

Implicit memory processing in the formation of a shared comm...

引用

15th International Conference on Cognitive Modeling, ICCM 2017

作者： Morita, Junya Konno, Takeshi Okuda, Jiro Samejima, Kazuyuki Li, Guanhong Fujiwara, Masayuki Hashimoto, Takashi Faculty of Informatics Shizuoka University 3-5-1 Johoku Naka-ku Hamamatsu Shizuoka Japan Information and Communication Engineering Kanazawa Institute of Technology 7-1 Ohgigaoka Nonoichi Ishikawa Japan Faculty of Computer Science and Engineering Kyoto Sangyo University 458 Koyama Kamigamo Kita-Ku Kyoto Japan Graduate School of Brain Science Tamagawa University 6-1-1 Tamagawa-Gakuen Machida Tokyo Japan School of Knowledge Science Japan Advanced Institute of Science and Technology 1-1 Asahidai Nomi Ishikawa Japan

This paper presents a simulation study focusing on implicit memory in the formation of a new communication system. In the models presented here, two agents aim to achieve their common goal by exchanging messages composed of two figures, whose meanings are not defined in advance. The effect of implicit memory has been studied with two different symbolic processes, implemented in ACT-R. Our results indicate that the difference caused by symbolic processes reduces when implicit memory is incorporated into the model. We have also found the effect of implicit memory on the creation of an isomorphic communication system, shared among agents. These findings suggest that implicit memory has some roles in the formation of a human communication system. © Copyright 2017 retained by the authors.

关键词： ACT-R Communication Imitation Implicit process

来源：评论

学校读者我要写书评

暂无评论

Retracted: LUC Algorithm in Visual Cryptography

Retracted: LUC Algorithm in Visual Cryptography

引用

2018 Workshop on Multidisciplinary and Its Applications: Applied Mathematics, computer science, Information Systems, and Information Technology, WMA-Mathcomtech 2018

作者： Achmad Daengs, G.S. Ratnadewi Alpha, Christian Dio Napitupulu, Darmawan Nurdiyanto, Heri Kurniasih, Nuning Hasibuan, Abdurrozaq Daengs, Achmad Manurung, Rosida Tiurma Mulyaningsih, Indrya Rahim, Robbi Sugianto, Castaka Agus Abdullah, Dahlan Department of Electrical Engineering Universitas Kristen Maranatha Bandung Indonesia Research Center for Quality System and Testing Technology Indonesian Institute of Sciences Banten Indonesia STMIK Dharma Wacana Indonesia Faculty of Communication Sciences Library and Information Science Program Universitas Padjadjaran Bandung Indonesia Universitas Islam Sumatera Utara Indonesia University of 45 Surabaya Indonesia Graduate Program in Scientific Psychology Universitas Kristen Maranatha Bandung Indonesia Department of Education Institut Agama Islam Negeri Syekh Nurjati Cirebon Indonesia School of Computer and Communication Engineering Universiti Malaysia Perlis Kubang Gajah Malaysia Politeknik TEDC Bandung Indonesia Department of Informatics Universitas Malikussaleh Aceh Utara Indonesia

Nowadays, messaging technology in digital data form more often used and not less messages that confidentially wanted. Then it should be modified so that can be understood only by the sender and the intended recipients. All of this system can be realization by using cryptography. LUC algorithms are introduced by Smith and Lennon in 1993. LUC algorithm is an algorithm that based on the use of Lucas sequence (specific arithmetic operations derived from Lucas row) that rarely used to enhance the security of the messages. In this research, LUC algorithm is combined with visual cryptography to process the encryption and the description of a colored image. Four different images were used in the trial here. The performance of the system is assessed using Structural similarity (SSIM) which has an assessment similar to human eye. If the image quality is the same as the original image, then the SSIM value is one. Whereas if the quality of decryption image is very different from the original image then the value of SSIM is zero. © Published under licence by IOP Publishing Ltd.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

White Paper and Roadmap for Quantum Gravity Phenomenology in the Multi-Messenger Era

arXiv

引用

arXiv 2023年

作者： Batista, R. Alves Amelino-Camelia, G. Boncioli, D. Carmona, J.M. di Matteo, A. Gubitosi, G. Lobo, I. Mavromatos, N.E. Pfeifer, C. Rubiera-Garcia, D. Saridakis, E.N. Terzić, T. Vagenas, E.C. Moniz, P. Vargas Abdalla, H. Adamo, M. Addazi, A. Anagnostopoulos, F.K. Antonelli, V. Asorey, M. Ballesteros, A. Basilakos, S. Benisty, D. Boettcher, M. Bolmont, J. Bonilla, A. Bosso, P. Bouhmadi-López, M. Burderi, L. Campoy-Ordaz, A. Caroff, S. Cerci, S. Cortes, J.L. D’Esposito, V. Das, S. de Cesare, M. Demirci, M. Di Lodovico, F. Di Salvo, T. Diego, J.M. Djordjevic, G.S. Domi, A. Ducobu, L. Escamilla-Rivera, C. Fabiano, G. Fernández-Silvestre, D. Franchino-Vin͂as, S.A. Frassino, A.M. Frattulillo, D. Gaug, M. Gergely, L.Á. Guendelman, E.I. Guetta, D. Gutierrez-Sagredo, I. He, P. Heefer, S. Jurić, T. Katori, T. Kowalski-Glikman, J. Lambiase, G. Said, J. Levi Li, C. Li, H. Luciano, G.G. Ma, B.-Q. Marciano, A. Martinez, M. Mazumdar, A. Menezes, G. Mercati, F. Minic, D. Miramonti, L. Mitsou, V.A. Mustamin, M.F. Navas, S. Olmo, G.J. Oriti, D. Övgün, A. Pantig, R.C. Parvizi, A. Pasechnik, R. Pasic, V. Petruzziello, L. Platania, A. Rasouli, S.M.M. Rastgoo, S. Relancio, J.J. Rescic, F. Reyes, M.A. Rosati, G. Sakallı, I. Salamida, F. Sanna, A. Staicova, D. Strišković, J. Cerci, D. Sunar Torri, M.D.C. Vigliano, A. Wagner, F. Wallet, J.-C. Wojnar, A. Zarikas, V. Zhu, J. Zornoza, J.D. Instituto de Física Teórica UAM-CSIC Universidad Autónoma de Madrid C/ Nicolás Cabrera 13-15 Madrid28049 Spain Dipartimento di Fisica Ettore Pancini Universitá di Napoli Federico II Complesso Univ. Monte S. Angelo NapoliI-80126 Italy Istituto Nazionale di Fisica Nucleare Sezione di Napoli Complesso Univ. Monte S. Angelo NapoliI-80126 Italy Università degli Studi dell’Aquila Dipartimento di Scienze Fisiche e Chimiche via Vetoio L’Aquila67100 Italy Istituto Nazionale di Fisica Nucleare Laboratori Nazionali del Gran Sasso via Acitelli AQ Assergi67100 Italy Departamento de Física Teórica Universidad de Zaragoza C/ Pedro Cerbuna 12 Zaragoza50009 Spain Istituto Nazionale di Fisica Nucleare Sezione di Torino Via Pietro Giuria 1 Torino10125 Italy Federal University of Paraíba Rodovia BR 079 - km 12 PB Areia58397-000 Brazil Federal University of Lavras Caixa Postal 3037 MG Lavras37200-900 Brazil National Technical University of Athens School of Applied Mathematical and Physical Sciences Department of Physics 9 Iroon Polytechniou Str. Zografou Campus Athens157 80 Greece King’s College London Department of Physics Strand LondonWC2R 2LS United Kingdom University of Bremen Am Fallturm 2 Bremen28359 Germany Departamento de Física Teórica IPARCOS Universidad Complutense de Madrid MadridE-28040 Spain National Observatory of Athens Athens Greece University of Science and Technology of China Anhui Hefei China Universidad Católica del Norte Antofagasta Chile University of Rijeka Faculty of Physics Radmile Matejčić 2 Rijeka51000 Croatia Department of Physics College of Science Kuwait University Sabah Al Salem University City P.O. Box 2544 Safat1320 Kuwait Departamento de Física e Centro de Matemática e Aplicações Universidade da Beira Interior UBI Rua Marques dAvila e Bolama Covilhã6200 Portugal IPARCOS Department of EMFTEL Universidad Complutense de Madrid MadridE-28040 Spain Centre for Space Research North-West University Potchef

The unification of quantum mechanics and general relativity has long been elusive. Only recently have empirical predictions of various possible theories of quantum gravity been put to test, where a clear signal of quantum properties of gravity is still missing. The dawn of multi-messenger high-energy astrophysics has been tremendously beneficial, as it allows us to study particles with much higher energies and travelling much longer distances than possible in terrestrial experiments, but more progress is needed on several fronts. A thorough appraisal of current strategies and experimental frameworks, regarding quantum gravity phenomenology, is provided here. Our aim is twofold: a description of tentative multimessenger explorations, plus a focus on future detection experiments. As the outlook of the network of researchers that formed through the COST Action CA18108 "Quantum gravity phenomenology in the multi-messenger approach (QGMM)", in this work we give an overview of the desiderata that future theoretical frameworks, observational facilities, and data-sharing policies should satisfy in order to advance the cause of quantum gravity phenomenology. Copyright © 2023, The Authors. All rights reserved.

关键词： Cosmology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：