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

9th European workshop on Structural Health Monitoring, EWSHM 2018

作者： Kwon, Il-Bum Seo, Dae-Cheol Yoon, Dong-Jin Choi, Bo-Hun Center for Safety Measurements Korea Research Institute of Standards and Science Daejeon Korea Republic of Department of Materials Physics Dong-A University Saha-gu Busan Korea Republic of

Impact damage detection is one of the big issues for getting the reliability of composite structures. Many researches were performed to develop impact damage detection techniques by continuous real time monitoring. However, this real time monitoring has several disadvantages such as continuous operation of the detection system, and sometimes missing the impact events. Therefore, we are trying to develop a periodic inspection system for impact damage detection of composite structures using fiber optic BOCDA(Brillouin optical correlation domain analysis) sensor with a sensing optical fiber. By applying a distributed sensing optical fiber embedded in a composite cylinder with filament winding process, this long distributed sensing optical fiber can detect the impact damages from the residual strain changes measured by fiber optic BOCDA sensor. In this study, three kinds of optical fibers, which are a single-mode fiber, a polyimide coated fiber, and an aluminum coated optical fiber, were prepared to measure the residual strain change. The residual strain magnitude of the aluminum coated optical fiber was bigger than other fibers at the same impact energy level. However, the single-mode optical fiber was also shown the residual strain detection capability. After investigating the residual strain measurement, three composite cylinders having the sensing optical fibers were fabricated and tested by a drop weight impact machine. Several damages in composite cylinders were generated by these tests. The location and severity of these damages were well detected from the residual strain changes measured by fiber optic BOCDA sensor. After all, it can be concluded that this distributed sensing technique can be used to detect the location and severity of composite damages after impact events. © 2018 ***. All rights reserved.

关键词： Fiber optics

来源：评论

学校读者我要写书评

暂无评论

Current workflow execution using job scheduling for the NICA experiments 8

Current workflow execution using job scheduling for the NICA...

引用

Selected Papers of the 8th International Conference "distributed Computing and Grid-Technologies in Science and Education", GRID 2018

作者： Gertsenberger, K.V. Rogachevsky, O.V. Laboratory of High Energy Physics Joint Institute for Nuclear Research 6 Joliot-Curie Dubna Moscow Region141980 Russia

Simulated and experimental data processing is an important issue in modern high-energy physics experiments. High interaction rate and particle multiplicity in addition to the long sequential processing time of million events are the main reasons to parallelize event processing on distributed computing systems for the NICA experiments. The paper presents one of the directions of distributed data processing: job scheduling for user task distribution on computing clusters. The software and hardware environments being used for the current workflow execution are briefly noted. The current MPD-Scheduler system developed to simplify parallel execution of user ROOT macros for simulation, reconstruction and data analysis is described in details. The practical values of the speedup for simulated event processing in the MPD experiment are shown. The possible workflow management systems being under discussion for the NICA experiments are also noted. © 2018 Konstantin V. Gertsenberger, Oleg V. Rogachevsky.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Detecting Multiple Information Sources Based on the Quantum Walk 5

Detecting Multiple Information Sources Based on the Quantum ...

引用

5th International Conference on systems and Informatics (ICSAI)

作者： Wang, Xin Zhang, Yi Lu, Kai Wang, Xiaoping Liu, Kai Natl Univ Def Technol Coll Comp Sci Sci & Technol Parallel & Distributed Proc Lab Changsha Hunan Peoples R China

ISBN: (纸本)9781728101200

The source detection problem is the reverse of information diffusion. It is identifying information sources of the diffusion process. However, most existing algorithms have limited performance due to various reasons, therefore the application is limited. We propose an approach, namely Quantum Walk based Source Detection (QWSD), to identify the source nodes based on the continuous-time quantum walk (CTQW). The continuous-time quantum walk can be utilized to simulate the diffusion process. Therefore, we utilize the reversed quantum walk to reverse the diffusion, thus revealing the probability for a node to be a source node. It is the first time that the continuous-time quantum walk is applied to the source detection problem. Extensive experiments demonstrate that our algorithm outperforms other source detection algorithms on both synthetic datasets and real-world datasets.

关键词： Source detection Continuous-time quantum walk Graph mining Data mining

来源：评论

学校读者我要写书评

暂无评论

A Block EM Algorithm for Multivariate Skew Normal and Skew t-Mixture Models

引用

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING systems 2018年第11期29卷 5581-5591页

作者： Lee, Sharon X. Leemaqz, Kaleb L. McLachlan, Geoffrey J. Univ Queensland Dept Math Brisbane Qld 4072 Australia

Finite mixtures of skew distributions provide a flexible tool for modeling heterogeneous data with asymmetric distributional features. However, parameter estimation via the Expectation-Maximization (EM) algorithm can become very time consuming due to the complicated expressions involved in the E-step that are numerically expensive to evaluate. While parallelizing the EM algorithm can offer considerable speedup in time performance, current implementations focus almost exclusively on distributed platforms. In this paper, we consider instead the most typical operating environment for users of mixture models-a standalone multicore machine and the R programming environment. We develop a block implementation of the EM algorithm that facilitates the calculations on the E-and M-steps to be spread across a number of threads. We focus on the fitting of finite mixtures of multivariate skew normal and skew t distributions, and show that both the E- and M-steps in the EM algorithm can be modified to allow the data to be split into blocks. Our approach is easy to implement and provides immediate benefits to users of multicore machines. Experiments were conducted on two real data sets to demonstrate the effectiveness of the proposed approach.

关键词： Expectation-Maximization (EM) algorithm mixture models parallel algorithm skew distributions

来源：评论

学校读者我要写书评

暂无评论

LIFE: A FLEXIBLE TESTBED FOR LIGHT FIELD EVALUATION

LIFE: A FLEXIBLE TESTBED FOR LIGHT FIELD EVALUATION

引用

3DTV-Conference - The True Vision - Capture, Transmission and Display of 3D Video (3DTV-CON)

作者： Dima, Elijs Sjostrom, Marten Olsson, Roger Kjellqvist, Martin Litwic, Lukasz Zhang, Zhi Rasmusson, Lennart Floden, Lars Mid Sweden Univ Dept Informat Syst & Technol Sundsvall Sweden Ericsson AB Ericsson Res Digital Representat & Interact Stockholm Sweden Observit AB Sundsvall Sweden

ISBN: (纸本)9781538661253

Recording and imaging the 3D world has led to the use of light fields. Capturing, distributing and presenting light field data is challenging, and requires an evaluation platform. We define a framework for real-time processing, and present the design and implementation of a light field evaluation system. In order to serve as a testbed, the system is designed to be flexible, scalable, and able to model various end-to-end light field systems. This flexibility is achieved by encapsulating processes and devices in discrete framework systems. The modular capture system supports multiple camera types, general-purpose data processing, and streaming to network interfaces. The cloud system allows for parallel transcoding and distribution of streams. The presentation system encapsulates rendering and display specifics. The real-time ability was tested in a latency measurement;the capture and presentation systems process and stream frames within a 40 ms limit.

关键词： Multiview 3DTV Light field distributed surveillance 360 video

来源：评论

学校读者我要写书评

暂无评论

Improving parallelism in Data-Intensive Workflows with distributed Databases

Improving Parallelism in Data-Intensive Workflows with Distr...

引用

IEEE International Conference on Services Computing (IEEE SCC) Part of the IEEE World Congress on Services

作者： Watanabe, Elaine Naomi Braghetto, Kelly Rosa Univ Sao Paulo Inst Math & Stat Dept Comp Sci Rua Matao 1010 BR-05508090 Sao Paulo SP Brazil

ISBN: (纸本)9781538672501

The efficient execution of data-intensive workflows relies on strategies to enable parallel data processing, such as partitioning and replicating data across distributed resources. The maximum degree of parallelism a workflow can reach during its execution is usually defined at design time. However, designing workflow models capable to provide an efficient use of distributed computing platforms is not a simple task and requires specialized expertise. Furthermore, since Workflow Management systems see workflow activities as black-boxes, they are not able to automatically explore data parallelism in the workflow execution. To address this problem, in this work we propose a novel method to automatically improve data parallelism in workflows based on annotations that characterize how activities access and consume data. For an annotated workflow model, the method defines a model transformation and a database setup (including data sharding, replication, and indexing) to support data parallelism in a distributed environment. To evaluate this approach, we implemented and tested two workflows that process up to 20.5 million data objects from real-world datasets. We executed each model in 21 different scenarios in a cluster on a public cloud, using a centralized relational database and a distributed NoSQL database. The automatic parallelization created by the proposed method reduced the execution times of these workflows up to 66.6%, without increasing the monetary costs of their execution.

关键词： parallel processing distributed databases Data models Integrated circuits Data collection"

来源：评论

学校读者我要写书评

暂无评论

Nemesyst: A hybrid parallelism deep learning-based framework applied for internet of things enabled food retailing refrigeration systems

引用

COMPUTERS IN INDUSTRY 2019年 113卷 103133-000页

作者： Onoufriou, George Bickerton, Ronald Pearson, Simon Leontidis, Georgios Univ Lincoln Sch Comp Sci Brayford Pool Campus Lincoln LN6 7TS England Univ Lincoln Sch Engn Brayford Pool Campus Lincoln LN6 7TS England Univ Lincoln Lincoln Inst Agrifood Technol Brayford Pool Campus Lincoln LN6 7TS England

Deep learning has attracted considerable attention across multiple application domains, including computer vision, signal processing and natural language processing. Although quite a few single node deep learning frameworks exist, such as tensorfiow, pytorch and keras, we still lack a complete processing structure that can accommodate large scale data processing, version control, and deployment, all while staying agnostic of any specific single node framework. To bridge this gap, this paper proposes a new, higher level framework, i.e. Nemesyst, which uses databases along with model sequentialisation to allow processes to be fed unique and transformed data at the point of need. This facilitates near real-time application and makes models available for further training or use at any node that has access to the database simultaneously. Nemesyst is well suited as an application framework for internet of things aggregated control systems, deploying deep learning techniques to optimise individual machines in massive networks. To demonstrate this framework, we adopted a case study in a novel domain;deploying deep learning to optimise the high speed control of electrical power consumed by a massive internet of things network of retail refrigeration systems in proportion to load available on the UK National Grid (a demand side response). The case study demonstrated for the first time in such a setting how deep learning models, such as Recurrent Neural Networks (vanilla and Long-Short-Term Memory) and Generative Adversarial Networks paired with Nemesyst, achieve compelling performance, whilst still being malleable to future adjustments as both the data and requirements inevitably change over time. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Deep learning Databases distributed computing parallel computing Demand side response Refrigeration Internet of things

来源：评论

学校读者我要写书评

暂无评论

Automatic runtime calculation of communications for data-parallel expressions with periodic conditions

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2019年第5期31卷

作者： Moreton-Fernandez, Ana Gonzalez-Escribano, Arturo Univ Valladolid Dept Informat Valladolid Spain

Many real-world applications feature data accesses on periodic domains. Manually implementing the synchronizations and communications associated to the data dependences on each case is cumbersome and error-prone. It is increasingly interesting to support these applications in high-level parallel programming languages or parallelizing compilers. In this paper, we present a technique that, for distributed-memory systems, calculates the specific communications derived from data-parallel codes with or without periodic boundary conditions on affine access expressions. It makes transparent to the programmer the management of aggregated communications for the chosen data partition. Our technique moves to runtime part of the compile-time analysis typically used to generate the communication code for affine expressions, introducing a complete new technique that also supports the periodic boundary conditions. We present an experimental study to evaluate our proposal using several study cases. Our experimental results show that our approach can automatically obtain communication codes as efficient as those found in MPI reference codes, reducing the development effort.

关键词： communications distributed memory parallel programming periodic boundary condition

来源：评论

学校读者我要写书评

暂无评论

A novel parallel distance metric-based approach for diversified ranking on large graphs

引用

FUTURE GENERATION COMPUTER systems-THE INTERNATIONAL JOURNAL OF ESCIENCE 2018年 88卷 79-91页

作者： Li, Jin Yang, Yun Wang, Xiaoling Zhao, Zhiming Li, Tong Yunnan Univ Sch Software Kunming Yunnan Peoples R China Key Lab Software Engn Yunnan Prov Kunming Yunnan Peoples R China Kunming Key Lab Data Sci & Intelligent Comp Kunming Yunnan Peoples R China East China Normal Univ Shanghai Key Lab Trustworthy Comp Shanghai Peoples R China Univ Amsterdam Amsterdam Netherlands

Diversified ranking on graphs (DRG) is an important and challenging issue in researching graph data mining. Traditionally, this problem is modeled by a submodular optimization objective, and solved by applying a cardinality constrained monotone submodular maximization. However, the existing submodular objectives do not directly capture the dis-similarity over pairs of nodes, while most of algorithms cannot easily take full advantage of the power of a distributed cluster computing platform, such as Spark, to significantly promote the efficiency of algorithms. To overcome the deficiencies of existing approaches, in this paper, a generalized distance metric based on a subadditive set function over the symmetry difference of neighbors of pairs of nodes is introduced to capture the pairwise dis-similarity over pairs of nodes. In our approach, DRG is formulated as a Max-Sum k-dispersion problem with metrical edge weights, which is NP-hard, in association with the proposed distance metric, a centralized linear time 2-approximation algorithm GA is then developed to significantly solve the problem of DRG. Moreover, we develop a highly parallelizable algorithm for DRG, which can be easily implemented in MapReduce style parallel computation models using GA as a basic reducer. Finally, extensive experiments are conducted on real network datasets to verify the effectiveness and efficiency of our proposed approaches. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Graph algorithms Diversified ranking Distance metric parallel computing MapReduce

来源：评论

学校读者我要写书评

暂无评论

NEAT 2018 - Proceedings of the 2018 workshop on Networking for Emerging Applications and Technologies, Part of SIGCOMM 2018

NEAT 2018 - Proceedings of the 2018 Workshop on Networking f...

引用

ACM SIGCOMM 2018 workshop on Networking for Emerging Applications and Technologies, NEAT 2018

ISBN: (纸本)9781450359078

The proceedings contain 9 papers. The topics discussed include: bridging the ICN deployment gap with IPoC: an IP-over-ICN protocol for 5G networks;data-driven approaches to edge caching;FEC killed the cut-through switch;a new framework and protocol for future networking applications;open carrier interface: an open source edge computing framework;a distributed core network architecture for 5G systems and beyond;AIRCoN-stack - introducing flexibility to wireless industrial real-time applications;fast network congestion detection and avoidance using P4;and supporting emerging applications with low-latency failover in P4.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：