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

international symposium on distributed computing and applications to business, engineering and science (DCABES)

作者： Yang Yang Yang Xiao Peng Gao Feng Li Ye Tian State Grid Henan Electric Power Information and Telecommunication Company ZhengZhou China Henan Electric Power Industry Group Co. Ltd ZhengZhou China China International Telecommunication Construction Group Design Institute Co. Ltd ZhengZhou China

ISBN: (纸本)9781538621639

distributed storage technology adopts an extensible system structure, shares storage load by many storage servers, locates stored information through location servers. Compared with a previous framework that financial management and control system of electric power companies adopted centralized storage servers to store all the data, storage servers are no longer bottleneck of information system performance. The servers not only improve reliability, availability and access efficiency of system, but also are apt to extend.

关键词： Servers distributed databases Financial management Control systems Power systems

来源：评论

学校读者我要写书评

暂无评论

Surrogate-Based Multidisciplinary Design Optimization of an Autonomous Underwater Vehicle Hull

Surrogate-Based Multidisciplinary Design Optimization of an ...

引用

international symposium on distributed computing and applications to business, engineering and science (DCABES)

作者： Xu Chen Peng Wang Daiyu Zhang School of Marine Science and Technology Northwestern Polytechnical University Xi'an P.R. China School of Naval Architecture and Engineering Jiangsu University of Science and Technology Zhenjiang P.R. China

ISBN: (纸本)9781538621639

This paper performed multidisciplinary design optimization (MDO) of an AUV hull to minimize the energy consumption for sailing. The hull is decomposed into two disciplines and a multidisciplinary optimization problem is built. Multidisciplinary design feasible (MDF) architecture is adopted for optimization. A CFD-based analysis framework is proposed for resistance calculation of sample points in the hydrodynamics discipline and then a Kriging surrogate model is constructed. The optimal design of AUV hull is obtained and the computational cost is quite low with few high-fidelity CFD simulations.

关键词： Optimization Solid modeling Computational modeling Computer architecture Hydrodynamics Nose Resistance

来源：评论

学校读者我要写书评

暂无评论

Surrogate-Based Shape Optimization of an Underwater Glider via Airfoil Design

Surrogate-Based Shape Optimization of an Underwater Glider v...

引用

international symposium on distributed computing and applications to business, engineering and science (DCABES)

作者： Chengshan Li Peng Wang Xinjing Wang School of Marine Science and Technology Northwestern Polytechnical University Xi'an P.R. China

ISBN: (纸本)9781538621639

This paper proposes a shape optimization method for blended-wing-body underwater gliders (BWBUG). First, three crucial airfoil sections are selected from the BWBUG in this paper. Next, these airfoils are parameterized with Class-Shape function Transformation (CST). And then, the airfoils are optimized by a surrogate-based method along with CFD-based simulations. Besides, a parallel adaptive sequential sampling method is also applied. Finally, the shape of the optimized underwater glider is generated with the optimized airfoil sections. Results show that the lift-to-drag ratio of optimized shape gets improved.

关键词： Automotive components Shape Hydrodynamics Optimization methods Atmospheric modeling Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Study on Water Depth Observation at Chinese CTD Stations in Antarctica Based on Large Deviation Theory

Study on Water Depth Observation at Chinese CTD Stations in ...

引用

international symposium on distributed computing and applications to business, engineering and science (DCABES)

作者： Wenfang Cheng Jiangang Zhu Shesheng Zhang Polar Research Institute of China Shanghai China Wuhan University of Technology Wuhan China

ISBN: (纸本)9781538621639

Antarctic marine environment research is of practical significance because Antarctic marine environment monitoring, control and protection are the important tasks both at home and abroad. In this paper, the large deviation mathematical model of the maximum seawater observation depth at Chinese CTD stations in Antarctica is established, the large deviation calculation principle of maximum seawater observation depth at CTD stations in Antarctica is given, and the optimization algorithm of maximum observation depth of seawater at CTD stations is proposed, the examples are analyzed and calculated, the conclusions suggest that (1) The adverse Antarctic environmental conditions have a significant impact on the measurement accuracy, the deeper the sea water is, the greater the impact will be. (2) The eigenvalue of the high precision observation data can be extracted with a smaller number of measurement times in shallow water. (3) It needs multiple measurements to get a certain accuracy of the eigenvalue in deep water.

关键词： Handheld computers distributed computing business

来源：评论

学校读者我要写书评

暂无评论

Efficient and timely misinformation blocking under varying cost constraints

引用

Online Social Networks and Media 2017年 2卷 19-31页

作者： Litou, Iouliana Kalogeraki, Vana Katakis, Ioannis Gunopulos, Dimitrios Athens University of Economics and Business Athens Greece University of Athens Athens Greece

Online Social Networks (OSNs) constitute one of the most important communication channels and are widely utilized as news sources. Information spreads widely and rapidly in OSNs through the word-of-mouth effect. However, it is not uncommon for misinformation to propagate in the network. Misinformation dissemination may lead to undesirable effects, especially in cases where the non-credible information concerns emergency events. Therefore, it is essential to timely limit the propagation of misinformation. Towards this goal, we suggest a novel propagation model, namely the Dynamic Linear Threshold (DLT) model, that effectively captures the way contradictory information, i.e., misinformation and credible information, propagates in the network. The DLT model considers the probability of a user alternating between competing beliefs, assisting in either the propagation of misinformation or credible news. Based on the DLT model, we formulate an optimization problem that under cost constraints aims in identifying the most appropriate subset of users to limit the spread of misinformation by initiating the propagation of credible information. We prove that our suggested approach achieves an approximation ratio of 1−1/e and demonstrate by experimental evaluation that it outperforms its competitors. © 2017 Elsevier B.V.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Time-message trade-offs in distributed algorithms 32

Time-message trade-offs in distributed algorithms

引用

32nd international symposium on distributed computing, DISC 2018

作者： Gmyr, Robert Pandurangan, Gopal Department of Computer Science University of Houston United States

ISBN: (纸本)9783959770927

This paper focuses on showing time-message trade-offs in distributed algorithms for fundamental problems such as leader election, broadcast, spanning tree (ST), minimum spanning tree (MST), minimum cut, and many graph verification problems. We consider the synchronous CONGEST distributed computing model and assume that each node has initial knowledge of itself and the identifiers of its neighbors – the so-called KT1 model – a well-studied model that also naturally arises in many applications. Recently, it has been established that one can obtain (almost) singularly optimal algorithms, i.e., algorithms that have simultaneously optimal time and message complexity (up to polylogarithmic factors), for many fundamental problems in the standard KT0 model (where nodes have only local knowledge of themselves and not their neighbors). The situation is less clear in the KT1 model. In this paper, we present several new distributed algorithms in the KT1 model that trade off between time and message complexity. Our distributed algorithms are based on a uniform and general approach which involves constructing a sparsified spanning subgraph of the original graph – called a danner – that trades off the number of edges with the diameter of the sparsifier. In particular, a key ingredient of our approach is a distributed randomized algorithm that, given a graph G and any δ ∈ [0, 1], with high probability1 constructs a danner that has diameter Õ(D+ n1−δ) and Õ(min(m, n1+δ)) edges in Õ(n1−δ) rounds while using Õ(min(m, n1+δ)) messages, where n, m, and D are the number of nodes, edges, and the diameter of G, respectively.2 Using our danner construction, we present a family of distributed randomized algorithms for various fundamental problems that exhibit a trade-off between message and time complexity and that improve over previous results. Specifically, we show the following results (all hold with high probability) in the KT1 model, which subsume and improve over prior bounds in the KT1

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

A Fast distributed Principal Component Analysis with Variance Reduction

A Fast Distributed Principal Component Analysis with Varianc...

引用

international symposium on distributed computing and applications to business, engineering and science (DCABES)

作者： Shiyuan Shang-Guan Jianping Yin Department of Computer Science and Technology National University of Defense Technology Changsha China

ISBN: (纸本)9781538621639

Principal Component Analysis (PCA) and Singular Value Decomposition (SVD) are widely used in dimension reduction, feature extraction, low-rank matrix approximation and so on. In large-scale applications, a common alternative is to use cluster which have multiple nodes and multiple cores to accelerate the time of solving problem. Most of the existing distributed PCA algorithm focus on reducing the communication, and there is little attention to the frequent waiting phenomenon caused by the synchronization mechanism. Meanwhile, most of these works are based on either the distributed memory of the processes-level parallelism or the shared memory of threads-level parallelism. In this paper, we propose a fast distributed PCA algorithm with variance reduced, which based on stochastic sampling and Stale Synchronous Parallel. Our algorithm contains the processes-level and threads-level parallelism. Experiments on the "Tianhe-2" super computer demonstrate that our algorithm has a good performance, speedup, and scalability.

关键词： Servers Principal component analysis Parallel processing Algorithm design and analysis Instruction sets Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Forecasting Method of Balance Treasure Fund Flow

Research on Forecasting Method of Balance Treasure Fund Flow

引用

international symposium on distributed computing and applications to business, engineering and science (DCABES)

作者： Zhao Chen International School of Software Wuhan University Wuhan China

ISBN: (纸本)9781538621639

Capital inflow and outflow is very important for the survival of financial companies. This paper analyzes the data flowing out and out of some users of the balance. The use of more than 28,000 users of the balance in 14 months according to operating records, the user will be separated from large users, the remaining users by operating frequency is divided into inactive users, more active users, active users, ultra-active users. The ARIMA model is used to model the five classes respectively. Finally, the prediction results of the classification are obtained. There are significant differences in the inflow and outflow patterns of these five categories of people. The results of classification prediction are better than the overall forecast in the prediction of capital inflow.

关键词： Time series analysis Predictive models Mathematical model Data models Finance Forecasting

来源：评论

学校读者我要写书评

暂无评论

An Algorithm Q-PSO for Community Detection in Complex Networks

An Algorithm Q-PSO for Community Detection in Complex Networ...

引用

international symposium on distributed computing and applications to business, engineering and science (DCABES)

作者： Xiaohong Cai Yuan Shi Youze Zhu Yulu Qiao Fang Hu College of Information Engineering Hubei University of Chinese Medicine Wuhan P.R. China

ISBN: (纸本)9781538621639

In this paper, based on the particle swarm optimization (PSO) algorithm, introducing the idea of modularity function optimization, a new algorithm Q-PSO for detecting community is proposed. This algorithm can identify the community structure accurately and effectively. In order to verify the performance of this algorithm, which is tested on several representative real-world networks and a set of computer-generated networks based on LFR-benchmark. The experimental results demonstrated that this algorithm can identify the communities accurately, and compared with CNM, Walktrap and infomap algorithms, the presented algorithm can acquire higher values of modularity and NMI in most networks.

关键词： Algorithm design and analysis Complex networks Particle swarm optimization Clustering algorithms Dolphins Optimization Color

来源：评论

学校读者我要写书评

暂无评论

An Energy Efficient VM Migration Algorithm in Data Centers

An Energy Efficient VM Migration Algorithm in Data Centers

引用

international symposium on distributed computing and applications to business, engineering and science (DCABES)

作者： Xiaodong Wu Yuzhu Zeng Guoxin Lin Faculty of Mathematics and Computer Science Fujian Province University Quanzhou China

ISBN: (纸本)9781538621639

In order to reduce operation and maintenance expense and also increase the resource utilization rate, server consolidation and virtualization solutions have been adopted in modern cloud computing data centers. Further, the scheduling policies of virtual machine (VM) migration have been regarded as an effective method for energy conservation. In this paper, we address the problem of VM consolidation in cloud data centers. A power aware scheduling algorithm THR_MUG, which is combined with a utilization threshold strategy and a VM selection policy, is proposed. THR_MUG tries to select the most appropriate VMs for migration each time when a physical machine (PM) is considered as being overloaded, such that the utilization of this PM is just not more than the utilization threshold, such that both the energy consumption and the number of VM migration can be reduced. The experimental results show that compared with other algorithm, the proposed algorithm can effectively reduce the number of VM migrations as well as the energy consumption.

关键词： Energy consumption Servers Cloud computing Virtual machining Computational modeling Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：