• Title/Summary/Keyword: collaborative computation

Search Result 47, Processing Time 0.023 seconds

Collaborative Inference for Deep Neural Networks in Edge Environments

  • Meizhao Liu;Yingcheng Gu;Sen Dong;Liu Wei;Kai Liu;Yuting Yan;Yu Song;Huanyu Cheng;Lei Tang;Sheng Zhang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.7
    • /
    • pp.1749-1773
    • /
    • 2024
  • Recent advances in deep neural networks (DNNs) have greatly improved the accuracy and universality of various intelligent applications, at the expense of increasing model size and computational demand. Since the resources of end devices are often too limited to deploy a complete DNN model, offloading DNN inference tasks to cloud servers is a common approach to meet this gap. However, due to the limited bandwidth of WAN and the long distance between end devices and cloud servers, this approach may lead to significant data transmission latency. Therefore, device-edge collaborative inference has emerged as a promising paradigm to accelerate the execution of DNN inference tasks where DNN models are partitioned to be sequentially executed in both end devices and edge servers. Nevertheless, collaborative inference in heterogeneous edge environments with multiple edge servers, end devices and DNN tasks has been overlooked in previous research. To fill this gap, we investigate the optimization problem of collaborative inference in a heterogeneous system and propose a scheme CIS, i.e., collaborative inference scheme, which jointly combines DNN partition, task offloading and scheduling to reduce the average weighted inference latency. CIS decomposes the problem into three parts to achieve the optimal average weighted inference latency. In addition, we build a prototype that implements CIS and conducts extensive experiments to demonstrate the scheme's effectiveness and efficiency. Experiments show that CIS reduces 29% to 71% on the average weighted inference latency compared to the other four existing schemes.

User and Item based Collaborative Filtering Using Classification Property Naive Bayesian (분류 속성과 Naive Bayesian을 이용한 사용자와 아이템 기반의 협력적 필터링)

  • Kim, Jong-Hun;Kim, Yong-Jip;Rim, Kee-Wook;Lee, Jung-Hyun;Chung, Kyung-Yong
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.11
    • /
    • pp.23-33
    • /
    • 2007
  • The collaborative filtering has used the nearest neighborhood method based on the preference and the similarity using the Pearson correlation coefficient. Therefore, it does not reflect content of the items and has the problems of the sparsity and scalability as well. the item-based collaborative filtering has been practically used to improve these defects, but it still does not reflect attributes of the item. In this paper, we propose the user and item based collaborative filtering using the classification property and Naive Bayesian to supplement the defects in the existing recommendation system. The proposed method complexity refers to the item similarity based on explicit data and the user similarity based on implicit data for handing the sparse problem. It applies to the Naive Bayesian to the result of reference. Also, it can enhance the accuracy as computation of the item similarity reflects on the correlative rank among the classification property to reflect attributes.

Convergence study of traditional 2D/1D coupling method for k-eigenvalue neutron transport problems with Fourier analysis

  • Boran Kong ;Kaijie Zhu ;Han Zhang ;Chen Hao ;Jiong Guo ;Fu Li
    • Nuclear Engineering and Technology
    • /
    • v.55 no.4
    • /
    • pp.1350-1364
    • /
    • 2023
  • 2D/1D coupling method is an important neutron transport calculation method due to its high accuracy and relatively low computation cost. However, 2D/1D coupling method may diverge especially in small axial mesh size. To analyze the convergence behavior of 2D/1D coupling method, a Fourier analysis for k-eigenvalue neutron transport problems is implemented. The analysis results present the divergence problem of 2D/1D coupling method in small axial mesh size. Several common attempts are made to solve the divergence problem, which are to increase the number of inner iterations of the 2D or 1D calculation, and two times 1D calculations per outer iteration. However, these attempts only could improve the convergence rate but cannot deal with the divergence problem of 2D/1D coupling method thoroughly. Moreover, the choice of axial solvers, such as DGFEM SN and traditional SN, and its effect on the convergence behavior are also discussed. The results show that the choice of axial solver is a key point for the convergence of 2D/1D method. The DGFEM SN based 2D/1D method could converge within a wide range of optical thickness region, which is superior to that of traditional SN method.

Application of Collaborative Optimization Using Genetic Algorithm and Response Surface Method to an Aircraft Wing Design

  • Jun Sangook;Jeon Yong-Hee;Rho Joohyun;Lee Dong-ho
    • Journal of Mechanical Science and Technology
    • /
    • v.20 no.1
    • /
    • pp.133-146
    • /
    • 2006
  • Collaborative optimization (CO) is a multi-level decomposed methodology for a large-scale multidisciplinary design optimization (MDO). CO is known to have computational and organizational advantages. Its decomposed architecture removes a necessity of direct communication among disciplines, guaranteeing their autonomy. However, CO has several problems at convergence characteristics and computation time. In this study, such features are discussed and some suggestions are made to improve the performance of CO. Only for the system level optimization, genetic algorithm is used and gradient-based method is used for subspace optimizers. Moreover, response surface models are replaced as analyses in subspaces. In this manner, CO is applied to aero-structural design problems of the aircraft wing and its results are compared with the multidisciplinary feasible (MDF) method and the original CO. Through these results, it is verified that the suggested approach improves convergence characteristics and offers a proper solution.

Parameter identifiability of Boolean networks with application to fault diagnosis of nuclear plants

  • Dong, Zhe;Pan, Yifei;Huang, Xiaojin
    • Nuclear Engineering and Technology
    • /
    • v.50 no.4
    • /
    • pp.599-605
    • /
    • 2018
  • Fault diagnosis depends critically on the selection of sensors monitoring crucial process variables. Boolean network (BN) is composed of nodes and directed edges, where the node state is quantized to the Boolean values of True or False and is determined by the logical functions of the network parameters and the states of other nodes with edges directed to this node. Since BN can describe the fault propagation in a sensor network, it can be applied to propose sensor selection strategy for fault diagnosis. In this article, a sufficient condition for parameter identifiability of BN is first proposed, based on which the sufficient condition for fault identifiability of a sensor network is given. Then, the fault identifiability condition induces a sensor selection strategy for sensor selection. Finally, the theoretical result is applied to the fault diagnosis-oriented sensor selection for a nuclear heating reactor plant, and both the numerical computation and simulation results verify the feasibility of the newly built BN-based sensor selection strategy.

3D Model Compression For Collaborative Design

  • Liu, Jun;Wang, Qifu;Huang, Zhengdong;Chen, Liping;Liu, Yunhua
    • International Journal of CAD/CAM
    • /
    • v.7 no.1
    • /
    • pp.1-10
    • /
    • 2007
  • The compression of CAD models is a key technology for realizing Internet-based collaborative product development because big model sizes often prohibit us to achieve a rapid product information transmission. Although there exist some algorithms for compressing discrete CAD models, original precise CAD models are focused on in this paper. Here, the characteristics of hierarchical structures in CAD models and the distribution of their redundant data are exploited for developing a novel data encoding method. In the method, different encoding rules are applied to different types of data. Geometric data is a major concern for reducing model sizes. For geometric data, the control points of B-spline curves and surfaces are compressed with the second-order predictions in a local coordinate system. Based on analysis to the distortion induced by quantization, an efficient method for computation of the distortion is provided. The results indicate that the data size of CAD models can be decreased efficiently after compressed with the proposed method.

An Empirical Analysis of Worldwide Cyberinfrastructure

  • Cho, Manhyung
    • Asian Journal of Innovation and Policy
    • /
    • v.4 no.3
    • /
    • pp.381-396
    • /
    • 2015
  • Cyberinfrastructure is a research infrastructure that provides an environment in which research communities can get access to distributed resources and collaborate at unprecedented levels of computation, storage, and network capacity. The Worldwide LHC Computing Grid (WLCG) is a global collaborative project of computing or data centers that enables access to scientific data generated by the Large Hadron Collider (LHC) experiments at CERN. This case study analyzes the WLCG as a model of cyberinfrastructure in research collaboration. WLCG provides a useful case of how cyberinfrastructure can work in providing an infrastructure for collaborative researches under data-intensive paradigm. Cyberinfrastructure plays the critical role of facilitating collaboration of diverse and widely separated communities of researchers. Data-intensive science requires new strategies for research support and significant development of cyberinfrastructure. The sustainability of WLCG depends on the resources of partner organizations and virtual organizations at international levels, essential for research collaboration.

Automatic Recommendation of (IP)TV programs based on A Rank Model using Collaborative Filtering (협업 필터링을 이용한 순위 정렬 모델 기반 (IP)TV 프로그램 자동 추천)

  • Kim, Eun-Hui;Pyo, Shin-Jee;Kim, Mun-Churl
    • Journal of Broadcast Engineering
    • /
    • v.14 no.2
    • /
    • pp.238-252
    • /
    • 2009
  • Due to the rapid increase of available contents via the convergence of broadcasting and internet, the efficient access to personally preferred contents has become an important issue. In this paper, for recommendation scheme for TV programs using a collaborative filtering technique is studied. For recommendation of user preferred TV programs, our proposed recommendation scheme consists of offline and online computation. About offline computation, we propose reasoning implicitly each user's preference in TV programs in terms of program contents, genres and channels, and propose clustering users based on each user's preferences in terms of genres and channels by dynamic fuzzy clustering method. After an active user logs in, to recommend TV programs to the user with high accuracy, the online computation includes pulling similar users to an active user by similarity measure based on the standard preference list of active user and filtering-out of the watched TV programs of the similar users, which do not exist in EPG and ranking of the remaining TV programs by proposed rank model. Especially, in this paper, the BM (Best Match) algorithm is extended to make the recommended TV programs be ranked by taking into account user's preferences. The experimental results show that the proposed scheme with the extended BM model yields 62.1% of prediction accuracy in top five recommendations for the TV watching history of 2,441 people.

Object Picking and Concurrency for Collaborative Design System (협동설계시스템을 위한 오브젝트 Picking Concurrency)

  • 윤보열;송승헌;김응곤
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.04b
    • /
    • pp.631-633
    • /
    • 2001
  • 협동설계시스템에서의 공유 오브젝트는 3D 도형이 되며, 사용자가 임의의 오브젝트를 picking하는 문제와 그 오브젝트에 어떤 조작을 취할 때 동시성제어(concurrency)하는 문제가 생긴다. 본 논문에서는 오브젝트의 picking이 마우스 포인터에서의 ray와 오브젝트간에 intersection을 계산하는 방법 외에 scene graph의 노드에 picking 속성을 주는 방법, bounds를 설정하는 방법, picking test의 범위를 한정하는 방법을 사용하여 computation의 부담을 줄이고 효과적인 동시성제어가 이루어지도록 action에 따라 공유(shared)lock과 전용(exclusive)lock을 사용한다.

  • PDF

Exercise Recommendation System Using Deep Neural Collaborative Filtering (신경망 협업 필터링을 이용한 운동 추천시스템)

  • Jung, Wooyong;Kyeong, Chanuk;Lee, Seongwoo;Kim, Soo-Hyun;Sun, Young-Ghyu;Kim, Jin-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.6
    • /
    • pp.173-178
    • /
    • 2022
  • Recently, a recommendation system using deep learning in social network services has been actively studied. However, in the case of a recommendation system using deep learning, the cold start problem and the increased learning time due to the complex computation exist as the disadvantage. In this paper, the user-tailored exercise routine recommendation algorithm is proposed using the user's metadata. Metadata (the user's height, weight, sex, etc.) set as the input of the model is applied to the designed model in the proposed algorithms. The exercise recommendation system model proposed in this paper is designed based on the neural collaborative filtering (NCF) algorithm using multi-layer perceptron and matrix factorization algorithm. The learning proceeds with proposed model by receiving user metadata and exercise information. The model where learning is completed provides recommendation score to the user when a specific exercise is set as the input of the model. As a result of the experiment, the proposed exercise recommendation system model showed 10% improvement in recommended performance and 50% reduction in learning time compared to the existing NCF model.