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

Structure and Metrics of Emerging computing 15

Structure and Metrics of Emerging Computing

15th International Conference on Advanced Trends in Radioelectronics, Telecommunications and Computer Engineering (TCSET)

作者： Vugar, Abdullayev Khakhanova, Hanna Hahanov, Ivan Hahanov, Vladimir Chumachenko, Svetlana Litvinova, Eugenia Shevchenko, Olga Azerbaijan State Oil & Ind Univ Comp Engn Dept Baku Azerbaijan Kharkov Natl Univ Radioelect Design Automat Dept Kharkov Ukraine

ISBN: (纸本)9781728155661

A metric and structure of computing 2020 is proposed in the form of Top 12 Technology Trends, which will influence on investment in science, education and industry in developing countries. The primary social and technological problem of the protection of society and critical facilities through the creation of Global Intelligent Cyber Security is formulated. The axioms of the constructive formation of developing countries on the basis of the adoption of moral relations are formulated. models, methods and algorithms of cyber-social computing are proposed that are focused on processing big data, searching for keywords and test fragments. New characteristic equations of similarity - differences between the processes and phenomena are synthesized for the exact information retrieval by keywords in cyber-physical space. A computing model of the development of the Universe is formulated, where the binary interactions of entities and forms are harmonic functions of the phase state. A structure of interactive computing of the creative process based on a metric assessment of the development status with world achievements is proposed.

关键词： emerging computing cyber-social computing cyber-physical space computing model interactive computing

来源：评论

学校读者我要写书评

暂无评论

Fast Iterative Graph Computation: A Path Centric Approach 14

Fast Iterative Graph Computation: A Path Centric Approach

引用

International Conference on High Performance computing, Networking, Storage and Analysis

作者： Yuan, Pingpeng Zhang, Wenya Xie, Changfeng Jin, Hai Liu, Ling Lee, Kisung Huazhong Univ Sci & Technol Cluster & Grid Comp Lab Sch Comp Sci & Technol Serv Comp Technol & Syst Lab Wuhan Peoples R China Georgia Inst Technol Coll Comp Sch Comp Sci Distributed Data Intens Syst Lab Atlanta GA 30332 USA

ISBN: (纸本)9781479955008

Large scale graph processing represents an interesting challenge due to the lack of locality. This paper presents PathGraph for improving iterative graph computation on graphs with billions of edges. Our system design has three unique features: First, we model a large graph using a collection of tree-based partitions and use an path-centric computation rather than vertex-centric or edge-centric computation. Our parallel computation model significantly improves the memory and disk locality for performing iterative computation algorithms. Second, we design a compact storage that further maximize sequential access and minimize random access on storage media. Third, we implement the path-centric computation model by using a scatter/gather programming model, which parallels the iterative computation at partition tree level and performs sequential updates for vertices in each partition tree. The experimental results show that the path-centric approach outperforms vertexcentric and edge-centric systems on a number of graph algorithms for both in-memory and out-of-core graphs.

关键词： Graph Iterative computation Path computing model Storage

来源：评论

学校读者我要写书评

暂无评论

Presenting a computing Method for Finding the Central Verse of Quranic Surahs 8

Presenting a Computing Method for Finding the Central Verse ...

引用

8th International Conference on Computer and Knowledge Engineering (ICCKE)

作者： Ahmadi, Meisam Khadangi, Ehsan Shariatpanahi, Seyed Peyman Foroughmand-Araabi, Mohammad-Hadi Iran Univ Sci & Technol Artificial Intelligence Tehran Iran Shahid Beheshti Univ Quran Miracle Res Inst Tehran Iran Inst Res Fundamental Sci IPM Sch Comp Sci Tehran Iran Univ Tehran Inst Biochem & Biophys Tehran Iran Sharif Univ Technol Fac Math Sci Tehran Iran

ISBN: (纸本)9781538695692

In recent years, many efforts have been made to present the structure of surahs in Quran and consequently to present interpretative content from these structures. Despite the considerable improvements in this field and spread of novel knowledge from the appearance of Quranic verses, there is still no clear and firm method for finding structure of different surahs and the selection of different structures by scientists is in most cases carried out based on their personal knowledge. The present study deals with the introduction of a computing model to find the central verse of Quranic surahs. In this method, the amount of similarity of Quranic verses is defined through quantification of the similarity between Quranic roots. Based on the results, verses' similarity graph is modeled. Then, a tree structure is gained for the surah by finding the maximum spanning tree of the similarity network. Finally, the central verse is detected using different centrality measures. For studying the benefits and limitations of our method, it is applied to the surah Ya-Seen particularly and the tree structure of this surah's verses is modeled. Based on applying betweenness and closeness to the tree structure, the central verse of this surah is obtained. Accordingly, some interpretational contents are presented with regard to the meaning of the central verse which are innovatively clear and coherent.

关键词： Quran Mining Ya-seen computing model Central Verse

来源：评论

学校读者我要写书评

暂无评论

Conditionally Evolving Memory for Computers 15

Conditionally Evolving Memory for Computers

引用

Fifteenth International Conference on Advances in ICT for Emerging Regions (ICTer)

作者： Weerakoon, W. A. C. Karunananda, A. S. Dias, N. G. J. Univ Moratuwa Fac Informat Technol Dept Computat Math Katubedda Sri Lanka Univ Kelaniya Fac Sci Dept Stat & Comp Sci Kelaniya Sri Lanka

ISBN: (纸本)9781467394413

Most of the contemporary computers are evolved from the Von-Neumann architecture which was built based on the Charles Babbage's mill and the store concept. Thereby this architecture consists of a processor and a memory where the memory improves the processing power. Later different kinds of smaller memories such as registers & caches were introduced to enhance the processing power of the computer. It is an existing great research challenge to improve the performance of the computer and in doing so, there is a trend to design computing models by imitating human mind. © 2015 IEEE.

关键词： computing model Conditional Process 24-Causal Relations Turing Machine

来源：评论

学校读者我要写书评

暂无评论

computing on many cores

Computing on many cores

引用

Euro-Par Conference / 7th International Workshop on Programming models and Applications for Multicores and Manycores (PMAM) held in conjunction with the 21st SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP)

作者： Goossens, Bernard Parello, David Porada, Katarzyna Rahmoune, Djallal UPVD DALI 52 Ave Paul Alduy F-66860 Perpignan 9 France UM2 CNRS UMR 5506 LIRMM 161 Rue Ada F-34095 Montpellier 5 France

This paper presents an alternative method to parallelize programs, better suited to manycore processors than actual operating system-/API-based approaches like OpenMP and MPI. The method relies on a parallelizing hardware and an adapted programming style. It frees and captures the instruction-level parallelism (ILP). A many-core design is presented in which cores are multithreaded and able to fork new threads. The programming style is based on functions. The hardware creates a concurrent thread at each function call. The programming style and the hardware create the conditions to free the ILP, by eliminating the architectural dependences between a call and its continuation after return. We illustrate the method on a sum reduction, a matrix multiplication and a sort. We measure the ILP of the parallel runs and show that it is high enough to feed thousands of cores because it increases with data size. We compare our method to pthread parallelization, showing that (1) our parallel execution is deterministic, (2) our thread management is cheap, (3) our parallelism is implicit, and (4) our method parallelizes functions and loops. Implicit parallelism makes parallel code easy to write and read. Deterministic parallel execution makes parallel code easy to debug.

关键词： computing model deterministic parallelism instruction level parallelism many-core processor multithreading parallelizing core

来源：评论

学校读者我要写书评

暂无评论

Moving load effect on pavements at random excitation 24th

Moving load effect on pavements at random excitation

引用

24th Russian-Polish-Slovak Seminar on Theoretical Foundation of Civil Engineering

作者： Valaskova, Veronika Melcer, Jozef Lajcakova, Gabriela Fac Civil Engn Dept Struct Mech Univ 8215-1 Zilina 01026 Slovakia

Moving load effect on pavements is currently and frequently analyzed task in engineering practice. Random road profile represents the source of kinematical excitation of vehicle. Vehicle response and its dynamic effect on pavements can be analyzed by numerical or by experimental way. The analyses can by carried out in time or in frequency domain. But from complex point of view both analyses are needed. The submitted paper is dedicated to the numerical simulation of motion of vehicle quarter model along random road profile and to the analysis of vehicle response in time and in frequency domain. (C) 2015 The Authors. Published by Elsevier Ltd.

关键词： Numerical simulation Dynamic load Pavement Quarter model of vehicle computing model road unevenness

来源：评论

学校读者我要写书评

暂无评论

SpeedStream: A Real-Time Stream Data Processing Platform in The Cloud

SpeedStream: A Real-Time Stream Data Processing Platform in ...

引用

34th IEEE International Performance, computing, and Communications Conference (lPCCC)

作者： Li Zhao Zhang Chuang Xu Ke-fu Chinese Acad Sci Inst Informat Engn Beijing Peoples R China

ISBN: (纸本)9781467385909

SpeedStream is a universal distributed platform that can handle with massive data flows with the features of low coupling, high availability, low latency and high scalability. Focusing on the core technologies of real-time stream computing platform in cloud environment, this paper conducts a series of researches and implementation of the system. First of all, aiming at the availability of real-time streaming computing platform, we design a high availability framework based on Zookeeper. It ensures fault detection and recovery of process level and node level timely by monitoring heartbreak of each modules and strategy of fault migration. Secondly, in order to increase the application types of the platform, by means of directed cycle detection and iteration protection, we design a real-time streaming computing model that based on directed graph with sources and sinks, which can not only satisfy the needs of common DAG computing services, but also support iteration computing services including directed cycle, bidirectional arcs and annular arcs. In addition, the platform can realize personalized task scheduling strategy for users by establishing task allocation matrix and optimize task allocation model. Finally, in order to solve the many-to-many dynamic load-balancing between tasks, we apply scheduler with status and distributed session table. It overcomes the difficulty of maintaining consistency of session without global session table. We also testified the convergence of this method. The experiment indicates that the throughput and data processing delay of SpeedStream are superior to other alternatives in dealing with the businesses of iteration applications, high traffic fluctuation applications, and high demand of load-balancing applications. This platform provides reliable, universal, and real-time solutions to process massive data flows, such as to process the real-time trading data in e-commerce, to analyze sensing flow in internet of things, and monitor traff

关键词： real-time stream processing computing model iteration computing services task allocation matrix dynamic load balancing

来源：评论

学校读者我要写书评

暂无评论

Produkce materiálově využitelných odpadů

Produkce materiálově využitelných odpadů

引用

作者： Odstrčil, Marek Brno University of Technology

Hlavní cíl této práce je pochopit současný systém zpracování komunálních odpadů v rámci odpadového hospodářství České republiky. Součást&... 详细信息

Hlavní cíl této práce je pochopit současný systém zpracování komunálních odpadů v rámci odpadového hospodářství České republiky. Součástí je i vymodelování tohoto systému pro všechny obce s rozšířenou působností a vyhodnocení jednotlivých výstupů a jejich významných parametrů.

关键词： Materiálové využití odpadu komunální odpad výpočtový model Material recovery of waste municipal waste computing model Text

来源：评论

学校读者我要写书评

暂无评论

Novel OneM2M Communication Mechanism Based on Labeling of IoT Devices

引用

SENSORS AND MATERIALS 2021年第2期33卷 775-788页

作者： Chang, Dong-Meau Tsai, Yao-Hong Hsu, Tse-Chuan Tseng, Hsien-Wei Longyan Univ Sch Math & Informat Engn 1 North Dongxiao Rd Longyan 364012 Fujian Peoples R China Hsuan Chuang Univ Dept Informat Management 48 Hsuan Chuang Rd Hsinchu 300 Taiwan Hsuan Chuang Univ Dept Healthcare Informat & Management Ming Chuan Univ 48 Xuanzhuang Rd Hsinchu 300 Taiwan

The increasing demand for food has raised the profile of the agricultural sector. The Internet of Things (IoT) is an important technology that is capable of solving many problems in modern agriculture. In traditional IoT communication technology, the operation technology of a single platform through remote or decentralized management is reasonably mature. In such an environment, all devices need to return the results of their execution tasks to the core server, and the server dispatches further script tasks to be performed. However, there is a problem in the mechanisms used for communication management of the devices at the same time when a large amount of data needs to be transmitted. The machine-to-machine (M2M) service platform has been standardized to enable the communication of devices, which is the basis for smart environments with IoT. Recently, the OneM2M standard communication mechanism has provided a way for devices to send messages to core servers and assign specific tasks to other devices, and a two-way communication mechanism capable of returning and sending instructions has been realized. In this study, an innovative label computing model combined with the M2M communication mechanism was proposed, and labels were used to record events in a standard way. By notifying all devices of the result of the labeling through the M2M mechanism, the cost of data transmission among the devices of a network can be reduced. The proposed model can also automatically determine how to assign and execute IoT operation tasks through the labeling mechanism. Finally, the proposed model was implemented in a smart agriculture environment to increase agricultural production. The execution time on a simulated smart agricultural system was reduced by about 30% compared with that on an existing system.

关键词： OneM2M IoT communication computing model

来源：评论

学校读者我要写书评

暂无评论

Explicit Solution for Critical Depth in Closed Conduits Flowing Partly Full

引用

WATER 2019年第10期11卷 2124-2124页

作者： Shang, Haixin Xu, Song Zhang, Kuandi Zhao, Luyou Northwest A&F Univ Minist Educ Arid Areas Key Lab Agr Soil & Water Engn Weihui Rd Yangling 712100 Shaanxi Peoples R China Northwest A&F Univ State Key Lab Soil Eros & Dryland Farming Loess P Yangling 712100 Shaanxi Peoples R China

Critical depth is an essential parameter for the design, operation, and maintenance of conduits. Circular, arched, and egg-shaped sections are often used in non-pressure conduits in hydraulic engineering, irrigation, and sewerage works. However, equations governing the critical depth in various sections are complicated implicit transcendental equations. The function model is established for the geometric features of multiple sections using the mathematical transform method and while considering non-dimensional parameters. Then, revised PSO algorithms are implemented in MATLAB, and the right solution's formula for the critical depths in various non-pressure conduit sections is established through optimization. The error analysis results show that the established formula has broad applicability. The maximum relative errors of the formula for critical depths are less than 0.182%, 0.0629%, and 0.170% in circular, arched, and egg-shaped sections, respectively, which are more accurate than those of existing formulas;the form of the formula proposed in this work is also more compact than that of the existing formulas. The results of this research may be useful in design, operation, and maintenance in conduit engineering.

关键词： circular sections arched sections egg-shaped sections critical depth PSO algorithms computing model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：