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

Emergence of an Onion-Like Network in Surface Growth and Its Strong Robustness

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2019年第10期E102A卷 1393-1396页

作者： Hayashi, Yukio Tanaka, Yuki Japan Adv Inst Sci & Technol Nomi 9231292 Japan

We numerically investigate that optimal robust onion-like networks can emerge even with the constraint of surface growth in supposing a spatially embedded transportation or communication system. To be onion-like, moderately long links are necessary in the attachment through intermediations inspired from a social organization theory.

关键词： complex network science optimal robust structure generation algorithm surface growth intermediation

来源：评论

学校读者我要写书评

暂无评论

Complexity of generation 1

引用

Symposium on 13th International Computer Science - Theory and Applications

作者： Gurvich, Vladimir Rutgers State Univ RUTCOR 100 Rockafeller Rd Piscataway NJ 08854 USA Rutgers State Univ RBS 100 Rockafeller Rd Piscataway NJ 08854 USA Natl Res Inst Higher Sch Econ Moscow Russia

ISBN: (数字)9783319905303

ISBN: (纸本)9783319905303;9783319905297

In this talk I summarize the results obtained in 1999-2008 by Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled Elbassiony, Kazuhisa Makino, and myself, on complexity of generation algorithms. These algorithms can be partitioned into three groups: supergraph, flash-light (backtrack), and dual-bounded generation. We will call a problem tractable if it can be solved by a polynomial (n(const)) or quasi-polynomial (n(polylog(n))) time algorithm. More generally, for any positive non-decreasing function g = g(n), generating can be performed in total or incremental time g, or with g-delay. Most of the polynomial delay algorithms are provided by the flash-light (backtrack) method. As for the incremental algorithms, generating the next object is equivalent with just verifying its existence, which is a standard decision problem. Thus, incremental generation, in contrast to the delay one, may be NP-hard or NP-complete. For example, we show that generating all vertices of a polyhedron, given by its facets, is NP-complete (while the complexity status is still open in case of the polytopes, that is, bounded polyhedra). This problem is reduced to generating all negative cycles of a weighted digraph, which is NP-complete (for graphs, too). Generating all minimal transversals to a hypergraph, so-called dualization, plays an important role. For this problem an incremental quasi-polynomial algorithm (but no polynomial one) is known. We outline several wide classes of generation problems that can be reduced to dualization and, thus, solved in incremental quasi-polynomial time. We survey algorithms and complexity bounds for the above and many other generation problems.

关键词： generation algorithm Polynomial Quasi-polynomial Total Incremental Dualization Dual or transversal hypergraph Supergraph Backtrack Flash-light Dual-bounded Independent set Matroid Submodular function Polymatroid function

来源：评论

学校读者我要写书评

暂无评论

Model-based Approach to Data Center Design and Power Usage Effectiveness Assessment 9

Model-based Approach to Data Center Design and Power Usage E...

引用

9th International Conference on Emerging Ubiquitous Systems and Pervasive Networks (EUSPN) / 8th International Conference on Current and Future Trends of Information and Communication Technologies in Healthcare (ICTH)

作者： Ounifi, Hibat-Allah Liu, Xu Gherbi, Abdelouahed Lemieux, Yves Li, Wubin ETS Dept Software & IT Engn Montreal PQ Canada Ericsson Ericsson Res Montreal PQ Canada

Data Centers (DC) are complex systems, which provide an environment to host Information and Technologies (IT) equipment. DCs are typically composed of a variety of components including servers, storage systems, networking infrastructures in addition to non-IT equipment such as power distribution and cooling systems. In order for a DC to function properly, all of its components need to be correctly configured and integrated. However, the variety of configurations and the interdependencies of DC sub-systems create challenges in understanding and optimizing DC complexities. In this paper, we present a system modeling approach, which supports the design of DCs and a quantitative assessment of their energy efficiency. This modeling approach aims at controlling the design complexity of DC infrastructure and ensuring the consistency of such designs. The cornerstone of our approach is a generic DC metamodel (DCMM), which captures the DCs heterogeneous structure, main characteristics, and diverse constraints. Furthermore, we propose a method to generate a Power Flow Model (PFM) from an input DC model. The PFM is then used to compute the DC Power Usage Effectiveness (PUE) metric. We evaluate the applicability of our approach through a use case of the Consortium Laval-UQAM-McGill and Eastern Quebec (CLUMEQ) data center. (C) 2018 The Authors. Published by Elsevier Ltd.

关键词： UML Data center Metamodel generation algorithm Power flow model PUE

来源：评论

学校读者我要写书评

暂无评论

Model-based Approach to Data Center Design and Power Usage Effectiveness Assessment

引用

Procedia Computer Science 2018年 141卷 143-150页

作者： Hibat-Allah Ounifi Xu Liu Abdelouahed Gherbi Yves Lemieux Wubin Li Department of Software and IT Engineering École de Technologie Supérieure (ÉTS) Montréal Canada Ericsson Research Ericsson Montréal Canada

关键词： UML Data center Metamodel generation algorithm Power flow model PUE

来源：评论

学校读者我要写书评

暂无评论

An algorithm for Key-Dependent S-Box generation in Block Cipher System

引用

INFORMATICA 2015年第1期26卷 51-65页

作者： Kazlauskas, Kazys Vaicekauskas, Gytis Smaliukas, Robertas Vilnius State Univ Inst Informat & Math LT-08663 Vilnius Lithuania

A nonlinear substitution operation of bytes is the main strength factor of the Advanced Encryption Standard (AES) and other modern cipher systems. In this paper we have presented a new simple algorithm to generate key-dependent S-boxes and inverse S-boxes for block cipher systems. The quality of this algorithm was tested by using NIST tests, and changing only one bit of the secret key to generate new key-dependent S-boxes. The fact that the S-boxes are key-dependent and unknown is the main strength of the algorithm, since the linear and differential cryptanalysis require known S-boxes. In the second section of the paper, we analyze S-boxes. In the third section we describe the key-dependent S-boxes and inverse S-boxes generation algorithm. Afterwards, we experimentally investigate the quality of the generated key-dependent S-boxes. Comparison results suggest that the key-dependent S-boxes have good performance and can be applied to AES.

关键词： block cipher systems key-dependent S-boxes generation algorithm experimental results

来源：评论

学校读者我要写书评

暂无评论

Automatic Combination Technology of Fuzzy CPN for OWL-S Web Services in Supercomputing Cloud Platform

引用

INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE 2017年第7期31卷 1759010-1759010页

作者： Deng, Ziyun Zhang, Jing He, Tingqin Changsha Commerce & Tourism Coll Changsha 410116 Hunan Peoples R China Hunan Univ Coll Elect & Informat Engn Changsha 410082 Hunan Peoples R China Hunan Univ Coll Informat Sci & Engn Changsha 410082 Hunan Peoples R China

Supercomputing Cloud Platform (SCP) provides a simple online Web way for computer aided engineering (CAE) simulation on supercomputer "Tianhe No.1." We develop SCP prototype by using service-oriented architecture (SOA). Fuzzy colored Petri nets (FCPN) is selected as the automatic combination technology for the Ontology Web Language for Services (OWL-S) in our SCP. To build the dependency relation graphs among Web services in our SCP, we put forward some definitions of semantic threshold similarity for Web services. Based on these definitions, we propose a generation algorithm to build the FCPN dependency relation graph based on semantic similarity of Web services, and analyze an example about this algorithm. Also, we design an algorithm to simplify the FCPN dependency relation graph for fast responding the user's requirements. The research works of this paper (SCP prototype) have been applied in real world, and we show the engineering design and application at the end. We will further research the service verification, transaction model and exception recovery mechanism in the future.

关键词： Supercomputing Cloud Platform (SCP) Ontology Web Language for Services (OWL-S) fuzzy colored Petri nets (FCPN) generation algorithm simplification algorithm

来源：评论

学校读者我要写书评

暂无评论

Weighted social networks for a large scale artificial society

引用

MODERN PHYSICS LETTERS B 2016年第2期30卷 1-1页

作者： Fan, Zong Chen Duan, Wei Zhang, Peng Qiu, Gang Natl Univ Def Technol Coll Informat Syst & Management Changsha 410073 Hunan Peoples R China

The method of artificial society has provided a powerful way to study and explain how individual behaviors at micro level give rise to the emergence of global social phenomenon. It also creates the need for an appropriate representation of social structure which usually has a significant influence on human behaviors. It has been widely acknowledged that social networks are the main paradigm to describe social structure and reflect social relationships within a population. To generate social networks for a population of interest, considering physical distance and social distance among people, we propose a generation model of social networks for a large-scale artificial society based on human choice behavior theory under the principle of random utility maximization. As a premise, we first build an artificial society through constructing a synthetic population with a series of attributes in line with the statistical (census) data for Beijing. Then the generation model is applied to assign social relationships to each individual in the synthetic population. Compared with previous empirical findings, the results show that our model can reproduce the general characteristics of social networks, such as high clustering coefficient, significant community structure and small-world property. Our model can also be extended to a larger social micro-simulation as an input initial. It will facilitate to research and predict some social phenomenon or issues, for example, epidemic transition and rumor spreading.

关键词： Social networks artificial society behavior choice model generation algorithm

来源：评论

学校读者我要写书评

暂无评论

Finger ECG De-noising Based on GA-wavelet Shrinkage

Finger ECG De-noising Based on GA-wavelet Shrinkage

引用

2016 International Conference on Electrical, Mechanical and Industrial Engineering (ICEMIE 2016)

作者： Shenshen Zou Xiaohong Zhang School of Communication Engineering Hangzhou Dianzi University School of Electronic Information Engineering Hangzhou Dianzi University

ISBN: (纸本)9781510823778

In view of the low signal to noise ration and the difficulty on de-noising for ECG signal collected under unconstrained environment,a GA(generation algorithm) based wavelet method of finger ECG de-noising is proposed after a systematic study of wavelet threshold de-noising and generation *** new algorithm can dynamically get the optimal solution to fit the threshold in accordance with the characteristic of finger *** the algorithm is verified by fitting ECG and finger *** with other algorithm,results show that the proposed method get the better performance according to the performance index including the output SNR,correlation coefficient and root mean square.

关键词： finger ECG generation algorithm wavelet de-noising

来源：评论

学校读者我要写书评

暂无评论

generation OF NEURONAL TREES BY A NEW THREE LETTERS ENCODING

引用

COMPUTING AND INFORMATICS 2014年第6期33卷 1428-1450页

作者： Amani, Mahdi Nowzari-Dalini, Abbas Ahrabian, Hayedeh Univ Tehran Dept Comp Sci Sch Math Stat & Comp Sci Tehran Iran Inst Studies Theoret Phys & Math IPM Tehran Iran

A neuronal tree is a rooted tree with n leaves whose each internal node has at least two children;this class not only is defined based on the structure of dendrites in neurons, but also refers to phylogenetic trees or evolutionary trees. More precisely, neuronal trees are rooted-multistate phylogenetic trees whose size is defined as the number of leaves. In this paper, a new encoding over an alphabet of size 3 (minimal cardinality) is introduced for representing the neuronal trees with a given number of leaves. This encoding is used for generating neuronal trees with n leaves in A-order with constant average time and O(n) time complexity in the worst case. Also, new ranking and unranking algorithms are presented in time complexity of O(n) and O(n log n), respectively.

关键词： Neuronal tree evolutionary tree phylogenetic tree tree of life cladistic rooted tree generation algorithm ranking and unranking algorithms

来源：评论

学校读者我要写书评

暂无评论

The generation of k-graceful figure and graceful label 4

The generation of k-graceful figure and graceful label

引用

4th International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)

作者： Jia Peipei Zhang Tai Zhang Yuanyuan Hebei Coll Finance Fundamental Dept Baoding Peoples R China Hebei Software Inst Expt Training Ctr Baoding Peoples R China Tongji Univ Dept Math Shanghai 200092 Peoples R China

This paper introduces the concept of graceful figure, discusses a special kind of graceful figure: K-graceful figure, draw all the graceful figure of the generated by the n side of all the beautiful label generation a... 详细信息

ISBN: (纸本)9781479965755

关键词： K-graceful figure graceful labeling generation algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：