• Title/Summary/Keyword: Distributed process

Search Result 2,397, Processing Time 0.034 seconds

Exploration to Model CSCL Scripts based on the Mode of Group Interaction

  • SONG, Mi-Young;YOU, Yeong-Mahn
    • Educational Technology International
    • /
    • v.9 no.2
    • /
    • pp.79-95
    • /
    • 2008
  • This paper aims to investigate modeling scripts based on the mode of group interaction in a computer-supported collaborative learning environment. Based on a literature review, this paper assumes that group interaction and its mode would have strong influence on the online collaborative learning process, and furthermore lead learners to create and share significant knowledge within a group. This paper deals with two different modes of group interaction- distributed and shared interaction. Distributed interaction depends on the external representation of individual knowledge, while shared interaction is concerned with sharing knowledge in group action. In order to facilitate these group interactions, this paper emphasizes the utilization of appropriate CSCL scripts, and then proposes the conceptual framework of CSCL scripts which integrate the existing scripts such as implicit, explicit, internal and external scripts. By means of the model regarding CSCL scripts based on the mode of group interaction, the implications for research on the design of CSCL scripts are explored.

Direct position tracking method for non-circular signals with distributed passive arrays via first-order approximation

  • Jinke Cao;Xiaofei Zhang;Honghao Hao
    • ETRI Journal
    • /
    • v.46 no.3
    • /
    • pp.421-431
    • /
    • 2024
  • In this study, a direct position tracking method for non-circular (NC) signals using distributed passive arrays is proposed. First, we calculate the initial positions of sources using a direct position determination (DPD) approach; next, we transform the tracking into a compensation problem. The offsets of the adjacent time positions are calculated using a first-order Taylor expansion. The fusion calculation of the noise subspace is performed according to the NC characteristics. Because the proposed method uses the signal information from the previous iteration, it can realize automatic data associations. Compared with traditional DPD and two-step localization methods, our novel process has lower computational complexity and provides higher accuracy. Moreover, its performance is better than that of the traditional tracking methods. Numerous simulation results support the superiority of our proposed method.

RDP: A storage-tier-aware Robust Data Placement strategy for Hadoop in a Cloud-based Heterogeneous Environment

  • Muhammad Faseeh Qureshi, Nawab;Shin, Dong Ryeol
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.9
    • /
    • pp.4063-4086
    • /
    • 2016
  • Cloud computing is a robust technology, which facilitate to resolve many parallel distributed computing issues in the modern Big Data environment. Hadoop is an ecosystem, which process large data-sets in distributed computing environment. The HDFS is a filesystem of Hadoop, which process data blocks to the cluster nodes. The data block placement has become a bottleneck to overall performance in a Hadoop cluster. The current placement policy assumes that, all Datanodes have equal computing capacity to process data blocks. This computing capacity includes availability of same storage media and same processing performances of a node. As a result, Hadoop cluster performance gets effected with unbalanced workloads, inefficient storage-tier, network traffic congestion and HDFS integrity issues. This paper proposes a storage-tier-aware Robust Data Placement (RDP) scheme, which systematically resolves unbalanced workloads, reduces network congestion to an optimal state, utilizes storage-tier in a useful manner and minimizes the HDFS integrity issues. The experimental results show that the proposed approach reduced unbalanced workload issue to 72%. Moreover, the presented approach resolve storage-tier compatibility problem to 81% by predicting storage for block jobs and improved overall data block placement by 78% through pre-calculated computing capacity allocations and execution of map files over respective Namenode and Datanodes.

Framework of MANPro-based control for intelligent manufacturing systems (지능형 생산시스템의 MANPro기반 제어 기초구조)

  • Sin, Mun-Su;Jeong, Mu-Yeong
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.05a
    • /
    • pp.467-470
    • /
    • 2004
  • MANPro-based control is a novel control paradigm aimed at intelligent manufacturing systems on the basis of mobile agent-based negotiation process (MANPro). MANPro is a negotiation mechanism based on the agent-based control architecture and, especially, it adapts a mobile agent system called N-agent for the negotiation process. N-agent travels around the network of distributed manufacturing systems to acquire information, and it makes a decision for system control according to the obtained information. MANPro includes communication architecture and information architecture for intelligent shop floor control. MANPro also considers the following issues: (1) negotiation mechanism, (2) single-agent internal strategic policies, and (3) information model. Communication architecture concerns the first issue of the negotiation mechanism. It provides information exchanging mechanism with functional modules. In specific, N-agent is equipped with an intelligent reasoning engine with a built-in knowledge base. This reasoning engine is closely related to the single-agent internal strategic policies of the second issue. Finally, ontology-based information architecture addresses information models and provides a framework for information modeling on negotiation. In this paper, these three issues are addressed in detail and a framework of MANPro-based control is also proposed.

  • PDF

Design and Implementation of Mobile Agent Model Supporting the Optimal Path Search through Traffic Sense (트래픽 감지를 통한 최적 경로 탐색 이동 에이전트 모델 설계 및 구현)

  • Kim Kwang-jong;Ko Hyun;Kim Youngja;Lee Yon-sik
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.10
    • /
    • pp.1421-1435
    • /
    • 2004
  • When various work was given from user, the existing mobile agent model migrated from node to node and process the work at the point that much traffics according to passive routing schedule are happened, until it makes service the work result, time cost of round work process for the distributed nodes are increased. Therefore, the existing agent systems need migration method to solve the problems of agent size increment or a lack of interoperability among agent systems. To solve these problems in this thesis, we design and implement an CORBA-based Mobile Agent Model(CMAM) for the efficient work process into the distributed nodes, when the mobile agents are migrated among the nodes, using an optimal path search by sensing of network traffic.

  • PDF

Dual Response Surface Optimization using Multiple Objective Genetic Algorithms (다목적 유전 알고리즘을 이용한 쌍대반응표면최적화)

  • Lee, Dong-Hee;Kim, Bo-Ra;Yang, Jin-Kyung;Oh, Seon-Hye
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.43 no.3
    • /
    • pp.164-175
    • /
    • 2017
  • Dual response surface optimization (DRSO) attempts to optimize mean and variability of a process response variable using a response surface methodology. In general, mean and variability of the response variable are often in conflict. In such a case, the process engineer need to understand the tradeoffs between the mean and variability in order to obtain a satisfactory solution. Recently, a Posterior preference articulation approach to DRSO (P-DRSO) has been proposed. P-DRSO generates a number of non-dominated solutions and allows the process engineer to select the most preferred solution. By observing the non-dominated solutions, the DM can explore and better understand the trade-offs between the mean and variability. However, the non-dominated solutions generated by the existing P-DRSO is often incomprehensive and unevenly distributed which limits the practicability of the method. In this regard, we propose a modified P-DRSO using multiple objective genetic algorithms. The proposed method has an advantage in that it generates comprehensive and evenly distributed non-dominated solutions.

A Control Chart Method Using Quartiles for Asymmetric Distributed Processes (비대칭 분포를 따르는 공정에서 사분위수를 이용한 관리도법)

  • Park Sung-Hyun;Park Hee-Jin
    • The Korean Journal of Applied Statistics
    • /
    • v.19 no.1
    • /
    • pp.81-96
    • /
    • 2006
  • This paper proposes a simple control chart method which can be practically used for asymmetric process data where the distribution is unknown. If we use the Shewhart type control charts which are based on normality assumption for the asymmetric process data, the type I error could increase as the asymmetry increases and the effectiveness of control chart to control variation decreases. To solve such problems, this paper suggests to calculate the control limits based on the quartiles. If we obtain the control limits by such quartile method, the type I error could decrease and it looks much more practical for asymmetric distributed process data.

A web-based collaborative framework for facilitating decision making on a 3D design developing process

  • Nyamsuren, Purevdorj;Lee, Soo-Hong;Hwang, Hyun-Tae;Kim, Tae-Joo
    • Journal of Computational Design and Engineering
    • /
    • v.2 no.3
    • /
    • pp.148-156
    • /
    • 2015
  • Increased competitive challenges are forcing companies to find better ways to bring their applications to market faster. Distributed development environments can help companies improve their time-to-market by enabling parallel activities. Although, such environments still have their limitations in real-time communication and real-time collaboration during the product development process. This paper describes a web-based collaborative framework which has been developed to support the decision making on a 3D design developing process. The paper describes 3D design file for the discussion that contains all relevant annotations on its surface and their visualization on the user interface for design changing. The framework includes a native CAD data converting module, 3D data based real-time communication module, revision control module for 3D data and some sub-modules such as data storage and data management. We also discuss some raised issues in the project and the steps underway to address them.

Genome Scale Protein Secondary Structure Prediction Using a Data Distribution on a Grid Computing

  • Cho, Min-Kyu;Lee, Soojin;Jung, Jin-Won;Kim, Jai-Hoon;Lee, Weontae
    • Proceedings of the Korean Biophysical Society Conference
    • /
    • 2003.06a
    • /
    • pp.65-65
    • /
    • 2003
  • After many genome projects, algorithms and software to process explosively growing biological information have been developed. To process huge amount of biological information, high performance computing equipments are essential. If we use the remote resources such as computing power, storages etc., through a Grid to share the resources in the Internet environment, we will be able to obtain great efficiency to process data at a low cost. Here we present the performance improvement of the protein secondary structure prediction (PSIPred) by using the Grid platform, distributing protein sequence data on the Grid where each computer node analyzes its own part of protein sequence data to speed up the structure prediction. On the Grid, genome scale secondary structure prediction for Mycoplasma genitalium, Escherichia coli, Helicobacter pylori, Saccharomyces cerevisiae and Caenorhabditis slogans were performed and analyzed by a statistical way to show the protein structural deviation and comparison between the genomes. Experimental results show that the Grid is a viable platform to speed up the protein structure prediction and from the predicted structures.

  • PDF

Economic Selection of the Lower Limit and the Process Mean for a Continuous Production Process (연속생산공정에서 규격하한과 공정평균의 경제적 설정)

  • Hong, Sung-Hoon;Lim, Hoon
    • Journal of Korean Society for Quality Management
    • /
    • v.23 no.3
    • /
    • pp.20-32
    • /
    • 1995
  • This paper is concerned with the economic selection of both the lower limit and the process mean for a continuous production process. Consider a production process where items are produced continuously. All of the items are subject to acceptance inspection. The items for which the measured values of the quality characteristic are larger than the lower limit are accepted, and those smaller than the lower limit are rejected and excluded from shipment. The process mean may be set higher to reduce the costs incurred by imperfect quality. Using a higher process mean, however, results in a higher production cost when production cost is an increasing function of the quality characteristic. Assuming that the quality characteristic is normally distributed with known variability, cost models are constructed which involve production cost, cost incurred by imperfect quality, rejection cost, and inspection cost. Methods of finding optimal values of the lower limit and the process mean are presented and numerical examples are given.

  • PDF