• Title/Summary/Keyword: 다중작업

Search Result 691, Processing Time 0.03 seconds

A Study on the Performance of Librarians (사서의 작업성과에 관한 연구 - 대학도서관 사서를 중심으로 -)

  • 방준필
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.11 no.1
    • /
    • pp.111-124
    • /
    • 2000
  • The Purpose of this study is to find out the relationships of affective outcomes and work itself performed by librarians. General job satisfaction, internal work motivation and growth satisfaction were set as independent variables in this study. Work effectiveness was set as a dependent variable. The result of multiple regressions by the data from 88 systems librarians who work at university libraries showed that affective outcomes affect work effectiveness, and growth satisfaction is important to affective outcome.

  • PDF

Validating Real-Time Constraints of Jobs with Dependencies in Distributed Systems (실시간 분산시스템에서의 종속적 작업들의 시간 제한요건 검증)

  • Ha, Ran
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.2
    • /
    • pp.164-175
    • /
    • 1999
  • 본 논문은 종속적인 작업들의 시간 제한요건 검증에 관한 연구이다. 종속적인 작업들은 임의의 시간 제한요건과 가변의 수행시간을 가지며 우선순위 구동 방식에 따라 동적으로 다중프로세서 시스템에 스케줄된다. 본 논문에서는 종속적인 작업들이 예측 가능한 방법으로 수행될 수 있는 조건들을 제시한다. 즉, 모든 작업들이 각각 가장 긴 수행시간을 갖는 경우를 시뮬레이션했을 때의 종료시각이 모든 작업들의 수행종료 시각을 바운드하는 경우들을 제시하고 증명한다. 또한, 일반적인 경우에 모든 작업들의 가장 늦은 수행종료시각을 바운드할 수 있는 알고리즘들을 제시한다.

Prediction model of whole-body postural discomfort for automobile assembly tasks (자동차 조립 작업에서의 전신 자세 불편도 예측 모델)

  • 이인석;정민근;기도형;김상호
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.792-796
    • /
    • 2002
  • 관찰적 작업자세 평가기법은 각 관절의 자세를 관찰 기록하여 자세 부하를 평가하는 실용적인 인간공학적 작업평가 기법이다. 본 연구에서는 각 관절의 불편도 지수와 전신의 자세 부하의 관계성을 모형화하고, 전신의 작업자세 부하를 평가하는 방법론을 제시하였다. 자동차 조립공정의 대표적인 작업자세들을 대상으로 하여 정적인 자세의 심물리학적 부하를 전신에 대하여 평가하였다 전신의 불편도는 비중립 자세를 취하고 있는 각 관절의 조합에 의해 영향을 받는다. 특히, 자동차 조립공정에서는 어깨 높이 이상의 작업을 대상으로 하는 경우에 어깨, 목, 허리, 손목 등에서 비중립 자세를 동시에 취하여 전신의 불편도가 큰 것으로 나타났다. 평가된 전신의 불편도와 각 자세의 관절별 불편도 지수의 관계를 다중선형회귀모형으로 모형화하는 것이 타당한 것으로 나타났다. 모형에서 전신 불편도에 가장 큰 영향을 미치는 관절은 어깨이며, 손목의 영향이 가장 적은 것으로 나타났다. 이 모형을 통해 작업자세 부하를 정량적으로 평가하는 것이 가능할 것으로 기대된다.

  • PDF

우수성의 추구를 통한 골판지포장 산업의 이미지 제고(9)

  • 한국골판지포장공업협동조합
    • Corrugated packaging logistics
    • /
    • no.55 s.12
    • /
    • pp.93-106
    • /
    • 2004
  • 이 장에서는 코루게이터 건부와 건부의 작업 변경에 대해 자세히 다룸과 동시에 후반부에서는 단일 또는 다중 건부 재단의 선택에 대한 빈번한 논의에 관해서도 다루겠다. 코루게이터 건부는 습부에서 만들어진 판지를 받아 기계 흐름 방향으로 자르고 괘선을 넣거나 횡방향으로 절단 후 시트로 소비자에게 전달하며 또 상자, 블랭크, 조립 혹은 전시품등을 만드는 가공기계로 이송하기 위하여 적재한다. 연속 공정 장치의 일부로서 건부는 연속 작업이 행해지는 동안 작업 변경에 대처할 수 있는 수단과 파지를 배출 시킬 수 있는 시설을 갖추고 있어야 한다.

  • PDF

PECOLE+: An Extension of PECOLE Collaborative System for Supporting Effective Multiple Groups (PECOLE+: 다중그룹을 효과적으로 지원하기 위한 PECOLE 협업 시스템의 확장)

  • Kim, Bo-Hyeon;Park, Jong-Moon;Lee, Myung-Joon;Park, Yang-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.1
    • /
    • pp.101-115
    • /
    • 2011
  • PECOLE (Peer-to-Peer Collaborative Environment) is a P2P-based multimedia distributed collaborative environment supporting a collaborative workspace which is composed of a variety of collaborative applications such as multi-chat, video conferencing, screen sharing and etc. Unfortunately, due to the PECOLE's simple group management, it is impossible to perform collaboration activities while joining multiple groups. In this paper, we present the design and implementation of PECOLE+ which is an extension of PECOLE. PECOLE+ resolves the drawback of PECOLE by providing the Group Management Service and the Workspace Management Service. The Group Management Service provides functionalities such as creating groups, joining multiple groups, and searching groups, and etc. The Workspace Management Service provides each group with an associated workspace, supporting the execution of collaborative applications over the workspace. In addition, any collaborative applications with the provided plug-in interfaces can be executed over the workspace as a PECOLE+ collaborative application.

Combining multi-task autoencoder with Wasserstein generative adversarial networks for improving speech recognition performance (음성인식 성능 개선을 위한 다중작업 오토인코더와 와설스타인식 생성적 적대 신경망의 결합)

  • Kao, Chao Yuan;Ko, Hanseok
    • The Journal of the Acoustical Society of Korea
    • /
    • v.38 no.6
    • /
    • pp.670-677
    • /
    • 2019
  • As the presence of background noise in acoustic signal degrades the performance of speech or acoustic event recognition, it is still challenging to extract noise-robust acoustic features from noisy signal. In this paper, we propose a combined structure of Wasserstein Generative Adversarial Network (WGAN) and MultiTask AutoEncoder (MTAE) as deep learning architecture that integrates the strength of MTAE and WGAN respectively such that it estimates not only noise but also speech features from noisy acoustic source. The proposed MTAE-WGAN structure is used to estimate speech signal and the residual noise by employing a gradient penalty and a weight initialization method for Leaky Rectified Linear Unit (LReLU) and Parametric ReLU (PReLU). The proposed MTAE-WGAN structure with the adopted gradient penalty loss function enhances the speech features and subsequently achieve substantial Phoneme Error Rate (PER) improvements over the stand-alone Deep Denoising Autoencoder (DDAE), MTAE, Redundant Convolutional Encoder-Decoder (R-CED) and Recurrent MTAE (RMTAE) models for robust speech recognition.

Data Communication Prediction Model in Multiprocessors based on Robust Estimation (로버스트 추정을 이용한 다중 프로세서에서의 데이터 통신 예측 모델)

  • Jun Janghwan;Lee Kangwoo
    • The KIPS Transactions:PartA
    • /
    • v.12A no.3 s.93
    • /
    • pp.243-252
    • /
    • 2005
  • This paper introduces a noble modeling technique to build data communication prediction models in multiprocessors, using Least-Squares and Robust Estimation methods. A set of sample communication rates are collected by using a few small input data sets into workload programs. By applying estimation methods to these samples, we can build analytic models that precisely estimate communication rates for huge input data sets. The primary advantage is that, since the models depend only on data set size not on the specifications of target systems or workloads, they can be utilized to various systems and applications. In addition, the fact that the algorithmic behavioral characteristics of workloads are reflected into the models entitles them to model diverse other performance metrics. In this paper, we built models for cache miss rates which are the main causes of data communication in shared memory multiprocessor systems. The results present excellent prediction error rates; below $1\%$ for five cases out of 12, and about $3\%$ for the rest cases.

Mutual Authentication Protocol for Safe Data Transmission of Multi-distributed Web Cluster Model (다중 분산 웹 클러스터모델의 안전한 데이터 전송을 위한 상호 인증 프로토콜)

  • Lee, Kee-Jun;Kim, Chang-Won;Jeong, Chae-Yeong
    • The KIPS Transactions:PartC
    • /
    • v.8C no.6
    • /
    • pp.731-740
    • /
    • 2001
  • Multi-distributed web cluster model expanding conventional cluster system is the cluster system which processes large-scaled work demanded from users with parallel computing method by building a number of system nodes on open network into a single imaginary network. Multi-distributed web cluster model on the structured characteristics exposes internal system nodes by an illegal third party and has a potential that normal job performance is impossible by the intentional prevention and attack in cooperative work among system nodes. This paper presents the mutual authentication protocol of system nodes through key division method for the authentication of system nodes concerned in the registration, requirement and cooperation of service code block of system nodes and collecting the results and then designs SNKDC which controls and divides symmetrical keys of the whole system nodes safely and effectively. SNKDC divides symmetrical keys required for performing the work of system nodes and the system nodes transmit encoded packet based on the key provided. Encryption packet given and taken between system nodes is decoded by a third party or can prevent the outflow of information through false message.

  • PDF

Integer Programming-based Operation Sequencing for Multi-operation on Single Machine (정수계획법을 통한 다중작업 수행 단일기계에서의 작업순서 결정)

  • Park, Seonyeong;Shin, Moonsoo
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.9 no.3
    • /
    • pp.261-270
    • /
    • 2019
  • With the advent of the Fourth Industrial Revolution, multi-variety production in the up-to-date manufacturing environment is proceeding more rapidly whereby production planning and management have been getting more complicated. Moreover, the need to improve production efficiency through effective operation sequencing is further heightened. Fundamentally, the effective operation sequencing can reduce the set-up of the equipment, efficiently utilize the equipment, shorten the set-up time, and ultimately contribute to productivity improvement. This study deals with the problem of efficient operation sequencing in a situation where a single machine performs multiple operations. The complexity of the problem is very high when compared to the case where only one operation is performed on one machine, which is covered in most existing studies. In this paper, we propose an integer programming model to minimize the number of setups. This study aims at minimizing the number of mold replacement times in the process of processing a given production order for the wiring harness manufacturing process, which is one of the components of automobile electric field. In addition, brief case studies are presented to verify the validity of the proposed mathematical model.

Multi-queue Hybrid Job Scheduling Mechanism in Grid Computing (그리드 컴퓨팅의 다중 큐 하이브리드 작업스케줄링 기법)

  • Kang, Chang-Hoon;Choi, Chang-Yeol;Park, Kie-Jin;Kim, Sung-Soo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.7
    • /
    • pp.304-318
    • /
    • 2007
  • Grid computing is a service that share geographically distributed computing resources through high speed network. In this paper, we propose hybrid scheduling scheme which considers not only meta-scheduling scheme to distribute the job between the nodes of grid computing system but also the job scheduling to distribute the job within the local nodes. According to the number of processors needed and expected execution time, the job with high priority is allocated to job queue while the one with low priority and remote job are allocated to backfill queue. We evaluate the proposing scheme through the various experiments and the results show that the utilization of grid computing system increases and the job slowdown decreases.