• 제목/요약/키워드: Machine Computation

검색결과 296건 처리시간 0.032초

전자렌지 캐비티의 전자파 해석 (Analysis of 3D Microwave Oven Using Finite Element Method)

  • 박광수;김권집;손종철;김상권;박윤서
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1996년도 하계학술대회 논문집 C
    • /
    • pp.1753-1755
    • /
    • 1996
  • This paper presents an analysis of the 3D microwave oven considering its forming. The results were compared with experimental data. Finite Element Method(FEM) using edge clement is employed for the analysis. For solving the large sparse system matrix equation was solved using the parallelized QMR method. Analysis of the 3d cavity has troublesome difficulties such as spurious solutions, too many memory and long computation time. We overcome this difficulties by using edge clement for spurious solutions and the parallelized QMR method by the aid of Paralle Virtual Machine(PVM) for the memory and computation time.

  • PDF

수동 변속기용 동기기구의 마찰력과 마찰재의 영향 분석 (An Analysis on the Affects of Friction Material and Force of Manual Transmission Synchronizer Ring)

  • 조용이;윤중현;유광석
    • 한국공작기계학회논문집
    • /
    • 제15권2호
    • /
    • pp.44-50
    • /
    • 2006
  • A driver's feelings of transmission serve as a basis to judge not only the transmission but also the entire automobile that he or she drives. The importance of transmission feelings is increasing daily because of driver's desire for increased torque and other improved functions. In order to accommodate such desire of drivers, new friction materials have been developed. The study in this report compared the affects of such materials and the force for transmission theoretically and empirically. By doing so, the study attempted to establish basic references for computation of capacity and other factors to be determined at the time of design of synchronizer system.

근사 임계값 추정을 통한 Otsu 알고리즘의 연산량 개선 (A Computational Improvement of Otsu's Algorithm by Estimating Approximate Threshold)

  • 이영우;김진헌
    • 한국멀티미디어학회논문지
    • /
    • 제20권2호
    • /
    • pp.163-169
    • /
    • 2017
  • There are various algorithms evaluating a threshold for image segmentation. Among them, Otsu's algorithm sets a threshold based on the histogram. It finds the between-class variance for all over gray levels and then sets the largest one as Otsu's optimal threshold, so we can see that Otsu's algorithm requires a lot of the computation. In this paper, we improved the amount of computational needs by using estimated Otsu's threshold rather than computing for all the threshold candidates. The proposed algorithm is compared with the original one in computation amount and accuracy. we confirm that the proposed algorithm is about 29 times faster than conventional method on single processor and about 4 times faster than on parallel processing architecture machine.

치차-분지계를 갖는 비틀림 축계의 설계를 위한 위험속도 계산 (Computation of Critical Speeds for Design of Torsional Shafting with Gear-Branched Systems)

  • 최명수
    • 수산해양기술연구
    • /
    • 제39권4호
    • /
    • pp.276-283
    • /
    • 2003
  • While designing a torsional shafting with various gear-branched systems, it is very important for system designers to obtain critical speeds accurately and easily. The author has studied the transfer stiffness coefficient method (TSCM) as a structural analysis algorithm. In this paper, the TSCM is applied to the computation of critical speeds for torsional shafting with gear-branched systems. The accuracy of the present method is confirmed by comparing with the results of the finite element method.

경계 추출 및 처리를 통한 다이아몬드 휠 검사 (Inspection of Diamond Wheel through Boundary Detection and Processing)

  • 하종은
    • 제어로봇시스템학회논문지
    • /
    • 제22권11호
    • /
    • pp.932-936
    • /
    • 2016
  • In this paper, we present a method for the inspection of diamond wheels. In total, six items, including height, radius, and angle, need to be checked during the manufacturing of a diamond wheel. Automatic inspection through image processing is presented in this paper. First, a contour corresponding to the boundary of the diamond wheel is extracted from an image. Next, control points are selected by processing the contour. Seven control points are detected and used for the computation of the required item. Detailed procedures for the computation of the height, radius, and angle using control points are presented in this paper. Experimental results show the feasibility of the presented method.

개선된 다중 구간 샘플링 배경제거 알고리즘 (An Improved Multiple Interval Pixel Sampling based Background Subtraction Algorithm)

  • 무하마드 타릭 마흐무드;최영규
    • 반도체디스플레이기술학회지
    • /
    • 제18권3호
    • /
    • pp.1-6
    • /
    • 2019
  • Foreground/background segmentation in video sequences is often one of the first tasks in machine vision applications, making it a critical part of the system. In this paper, we present an improved sample-based technique that provides robust background image as well as segmentation mask. The conventional multiple interval sampling (MIS) algorithm have suffer from the unbalance of computation time per frame and the rapid change of confidence factor of background pixel. To balance the computation amount, a random-based pixel update scheme is proposed and a spatial and temporal smoothing technique is adopted to increase reliability of the confidence factor. The proposed method allows the sampling queue to have more dispersed data in time and space, and provides more continuous and reliable confidence factor. Experimental results revealed that our method works well to estimate stable background image and the foreground mask.

기계학습 기반 저 복잡도 긴장 상태 분류 모델 (Design of Low Complexity Human Anxiety Classification Model based on Machine Learning)

  • 홍은재;박형곤
    • 전기학회논문지
    • /
    • 제66권9호
    • /
    • pp.1402-1408
    • /
    • 2017
  • Recently, services for personal biometric data analysis based on real-time monitoring systems has been increasing and many of them have focused on recognition of emotions. In this paper, we propose a classification model to classify anxiety emotion using biometric data actually collected from people. We propose to deploy the support vector machine to build a classification model. In order to improve the classification accuracy, we propose two data pre-processing procedures, which are normalization and data deletion. The proposed algorithms are actually implemented based on Real-time Traffic Flow Measurement structure, which consists of data collection module, data preprocessing module, and creating classification model module. Our experiment results show that the proposed classification model can infers anxiety emotions of people with the accuracy of 65.18%. Moreover, the proposed model with the proposed pre-processing techniques shows the improved accuracy, which is 78.77%. Therefore, we can conclude that the proposed classification model based on the pre-processing process can improve the classification accuracy with lower computation complexity.

A Novel Method for Virtual Machine Placement Based on Euclidean Distance

  • Liu, Shukun;Jia, Weijia
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권7호
    • /
    • pp.2914-2935
    • /
    • 2016
  • With the increasing popularization of cloud computing, how to reduce physical energy consumption and increase resource utilization while maintaining system performance has become a research hotspot of virtual machine deployment in cloud platform. Although some related researches have been reported to solve this problem, most of them used the traditional heuristic algorithm based on greedy algorithm and only considered effect of single-dimensional resource (CPU or Memory) on energy consumption. With considerations to multi-dimensional resource utilization, this paper analyzed impact of multi-dimensional resources on energy consumption of cloud computation. A multi-dimensional resource constraint that could maintain normal system operation was proposed. Later, a novel virtual machine deployment method (NVMDM) based on improved particle swarm optimization (IPSO) and Euclidean distance was put forward. It deals with problems like how to generate the initial particle swarm through the improved first-fit algorithm based on resource constraint (IFFABRC), how to define measure standard of credibility of individual and global optimal solutions of particles by combining with Bayesian transform, and how to define fitness function of particle swarm according to the multi-dimensional resource constraint relationship. The proposed NVMDM was proved superior to existing heuristic algorithm in developing performances of physical machines. It could improve utilization of CPU, memory, disk and bandwidth effectively and control task execution time of users within the range of resource constraint.

Dynamic stiffness based computation of response for framed machine foundations

  • Lakshmanan, N.;Gopalakrishnan, N.;Rama Rao, G.V.;Sathish kumar, K.
    • Geomechanics and Engineering
    • /
    • 제1권2호
    • /
    • pp.121-142
    • /
    • 2009
  • The paper deals with the applications of spectral finite element method to the dynamic analysis of framed foundations supporting high speed machines. Comparative performance of approximate dynamic stiffness methods formulated using static stiffness and lumped or consistent or average mass matrices with the exact spectral finite element for a three dimensional Euler-Bernoulli beam element is presented. The convergence of response computed using mode superposition method with the appropriate dynamic stiffness method as the number of modes increase is illustrated. Frequency proportional discretisation level required for mode superposition and approximate dynamic stiffness methods is outlined. It is reiterated that the results of exact dynamic stiffness method are invariant with reference to the discretisation level. The Eigen-frequencies of the system are evaluated using William-Wittrick algorithm and Sturm number generation in the $LDL^T$ decomposition of the real part of the dynamic stiffness matrix, as they cannot be explicitly evaluated. Major's method for dynamic analysis of machine supporting structures is modified and the plane frames are replaced with springs of exact dynamic stiffness and dynamically flexible longitudinal frames. Results of the analysis are compared with exact values. The possible simplifications that could be introduced for a typical machine induced excitation on a framed structure are illustrated and the developed program is modified to account for dynamic constraint equations with a master slave degree of freedom (DOF) option.

A Container Orchestration System for Process Workloads

  • Jong-Sub Lee;Seok-Jae Moon
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제15권4호
    • /
    • pp.270-278
    • /
    • 2023
  • We propose a container orchestration system for process workloads that combines the potential of big data and machine learning technologies to integrate enterprise process-centric workloads. This proposed system analyzes big data generated from industrial automation to identify hidden patterns and build a machine learning prediction model. For each machine learning case, training data is loaded into a data store and preprocessed for model training. In the next step, you can use the training data to select and apply an appropriate model. Then evaluate the model using the following test data: This step is called model construction and can be performed in a deployment framework. Additionally, a visual hierarchy is constructed to display prediction results and facilitate big data analysis. In order to implement parallel computing of PCA in the proposed system, several virtual systems were implemented to build the cluster required for the big data cluster. The implementation for evaluation and analysis built the necessary clusters by creating multiple virtual machines in a big data cluster to implement parallel computation of PCA. The proposed system is modeled as layers of individual components that can be connected together. The advantage of a system is that components can be added, replaced, or reused without affecting the rest of the system.