• 제목/요약/키워드: machine utilization

검색결과 403건 처리시간 0.024초

CAD/CAM을 활용한 기계설계 및 2.5축 복합가공에 대한 연구 (A Study on the Mechanical Design and the 2.5-axial Combined Machining by CAD/CAM)

  • 이양창
    • 한국공작기계학회논문집
    • /
    • 제17권6호
    • /
    • pp.97-103
    • /
    • 2008
  • In this paper, the Post Process for the manifold complex processing using CAD/CAM Software of two and a half Dimensions(2.5D) has been developed to maximize the application of the manifold manufacturing machine. Many companies are currently making use of high price systems to improve manufacturing process using the multi-axial complex manufacturing machine. In accordance with the requirements, the utilization of CAD/CAM Software for the manifold complex manufacturing machine is earnestly demanded. However, the experts who have experience in manifold manufacturing machine are insufficient. Consequently the outcomes of the Post Process for 2.5D CAD/CAM Systems have been dealt in order to be smoothly operated by those who have basic skills and be understood in process drawings. CNC program functions can be specially used as they are, when drawn up. The Post Process for the original point designation and transformation of coordinates has been developed and applied. The results gave proof of practical manufacturing outcomes.

음료자동판매기의 그린디자인에 관한 연구 (A Study on the Green Design for a Drink Vending Machine)

  • 문금희
    • 디자인학연구
    • /
    • 18호
    • /
    • pp.177-186
    • /
    • 1996
  • 국민들의 생활수준 향상에 따른 생활패턴의 변화와 더불어 환경오염 문제가 날로 심각해져 가고 있다. 각종 폐기물의 급증으로 파괴되는 환경의 보전을 도모하기 이해 자원의 절약과 재활용 촉진이 불가피하게 되었다. 이러한 환경문제에 대한 인식과 더불어 국민들의 건강, 환경문제에 대한 인식이 점차 강화되고 무공해에 대한 갈망이 환경상품에 대한 욕구로 대체되어 환경소비주의를 대두시켰다. 음료자동판매기는 일회용 용기를 주로 사용하므로 환경문제와 밀접한 관계를 맺고 있고 따라서 그린디자인이 적용되어야만 하는 제품이다. 본 연구에서는 그린디자인의 배경 및 개념과 음료자동판매기의 분류, 구조 및 환경에 대해 조사하였다. 그것을 배경으로 하여 음료자동판매기의 그린디자인 전개방향에 대한 컨셉을 설정하였고 대안들을 분리수거형과 재사용형으로 선정하였다. 대안들을 다시 벽면부착형, 중앙설치형 및 데스크탑형의 셋 방향으로 포커스 모델을 제시하였다. 결론적으로 음료자동판매기의 디자인을 위해서는 환경 문제 해결을 위한 그린디자인, 사용 성을 높이기 위한 인간 공학적 배려와 주변환경과의 조화를 위한 조형이미지 등에 대한 연구가 필요하다.

  • PDF

A Predictive Virtual Machine Placement in Decentralized Cloud using Blockchain

  • Suresh B.Rathod
    • International Journal of Computer Science & Network Security
    • /
    • 제24권4호
    • /
    • pp.60-66
    • /
    • 2024
  • Host's data during transmission. Data tempering results in loss of host's sensitive information, which includes number of VM, storage availability, and other information. In the distributed cloud environment, each server (computing server (CS)) configured with Local Resource Monitors (LRMs) which runs independently and performs Virtual Machine (VM) migrations to nearby servers. Approaches like predictive VM migration [21] [22] by each server considering nearby server's CPU usage, roatative decision making capacity [21] among the servers in distributed cloud environment has been proposed. This approaches usage underlying server's computing power for predicting own server's future resource utilization and nearby server's resource usage computation. It results in running VM and its running application to remain in waiting state for computing power. In order to reduce this, a decentralized decision making hybrid model for VM migration need to be proposed where servers in decentralized cloud receives, future resource usage by analytical computing system and takes decision for migrating VM to its neighbor servers. Host's in the decentralized cloud shares, their detail with peer servers after fixed interval, this results in chance to tempering messages that would be exchanged in between HC and CH. At the same time, it reduces chance of over utilization of peer servers, caused due to compromised host. This paper discusses, an roatative decisive (RD) approach for VM migration among peer computing servers (CS) in decentralized cloud environment, preserving confidentiality and integrity of the host's data. Experimental result shows that, the proposed predictive VM migration approach reduces extra VM migration caused due over utilization of identified servers and reduces number of active servers in greater extent, and ensures confidentiality and integrity of peer host's data.

A Study on Comparison of Lung Cancer Prediction Using Ensemble Machine Learning

  • NAM, Yu-Jin;SHIN, Won-Ji
    • 한국인공지능학회지
    • /
    • 제7권2호
    • /
    • pp.19-24
    • /
    • 2019
  • Lung cancer is a chronic disease which ranks fourth in cancer incidence with 11 percent of the total cancer incidence in Korea. To deal with such issues, there is an active study on the usefulness and utilization of the Clinical Decision Support System (CDSS) which utilizes machine learning. Thus, this study reviews existing studies on artificial intelligence technology that can be used in determining the lung cancer, and conducted a study on the applicability of machine learning in determination of the lung cancer by comparison and analysis using Azure ML provided by Microsoft. The results of this study show different predictions yielded by three algorithms: Support Vector Machine (SVM), Two-Class Support Decision Jungle and Multiclass Decision Jungle. This study has its limitations in the size of the Big data used in Machine Learning. Although the data provided by Kaggle is the most suitable one for this study, it is assumed that there is a limit in learning the data fully due to the lack of absolute figures. Therefore, it is claimed that if the agency's cooperation in the subsequent research is used to compare and analyze various kinds of algorithms other than those used in this study, a more accurate screening machine for lung cancer could be created.

Virtual Machine Placement Methods using Metaheuristic Algorithms in a Cloud Environment - A Comprehensive Review

  • Alsadie, Deafallah
    • International Journal of Computer Science & Network Security
    • /
    • 제22권4호
    • /
    • pp.147-158
    • /
    • 2022
  • Cloud Computing offers flexible, on demand, ubiquitous resources for cloud users. Cloud users are provided computing resources in a virtualized environment. In order to meet the growing demands for computing resources, data centres contain a large number of physical machines accommodating multiple virtual machines. However, cloud data centres cannot utilize their computing resources to their total capacity. Several policies have been proposed for improving energy proficiency and computing resource utilization in cloud data centres. Virtual machine placement is an effective method involving efficient mapping of virtual machines to physical machines. However, the availability of many physical machines accommodating multiple virtual machines in a data centre has made the virtual machine placement problem a non deterministic polynomial time hard (NP hard) problem. Metaheuristic algorithms have been widely used to solve the NP hard problems of multiple and conflicting objectives, such as the virtual machine placement problem. In this context, we presented essential concepts regarding virtual machine placement and objective functions for optimizing different parameters. This paper provides a taxonomy of metaheuristic algorithms for the virtual machine placement method. It is followed by a review of prominent research of virtual machine placement methods using meta heuristic algorithms and comparing them. Finally, this paper provides a conclusion and future research directions in virtual machine placement of cloud computing.

임베디드 자바가상기계를 위한 고정 크기 메모리 할당 및 해제 (Fixed-Length Allocation and Deallocation of Memory for Embedded Java Virtual Machine)

  • 양희재
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅲ
    • /
    • pp.1335-1338
    • /
    • 2003
  • Fixed-size memory allocation is one of the most promising way to avoid external fragmentation in dynamic memory allocation problem. This paper presents an experimental result of applying the fixed- size memory allocation strategy to Java virtual machine for embedded system. The result says that although this strategy induces another memory utilization problem caused by internal fragmentation, the effect is not very considerable and this strategy is well-suited for embedded Java system. The experiment has been performed in a real embedded Java system called the simpleRTJ.

  • PDF

비단조 뉴런 모델을 이용한 결정론적 볼츠만 머신 (Deterministic Boltzmann Machine Based on Nonmonotonic Neuron Model)

  • 강형원;박철영
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅲ
    • /
    • pp.1553-1556
    • /
    • 2003
  • In this paper, We evaluate the learning ability of non-monotonic DBM(Deterministic Boltzmann Machine) network through numerical simulations. The simulation results show that the proposed system has higher performance than monotonic DBM network model. Non-monotonic DBM network also show an interesting result that network itself adjusts the number of hidden layer neurons. DBM network can be realized with fewer components than other neural network models. These results enhance the utilization of non-monotonic neurons in the large scale integration of neuro-chips.

  • PDF

비단조뉴런 DBM 네트워크의 학습 능력에 관한 연구 (Learning Ability of Deterministic Boltzmann Machine with Non-Monotonic Neurons)

  • 박철영;이도훈
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2001년도 추계학술대회 학술발표 논문집
    • /
    • pp.275-278
    • /
    • 2001
  • In this paper, We evaluate the learning ability of non-monotonic DBM(Deterministic Boltzmann Machine) network through numerical simulations. The simulation results show that the proposed system has higher performance than monotonic DBM network model. Non-monotonic DBM network also show an interesting result that network itself adjusts the number of hidden layer neurons. DBM network can be realized with fewer components than other neural network models. These results enhance the utilization of non-monotonic neurons in the large scale integration of neuro-chips.

  • PDF

제한된 크기의 버퍼를 가진 생산 시스템의 분석 (Analysis of Transfer Lines with Finite Storage Buffers)

  • 허성관;하정진
    • 산업경영시스템학회지
    • /
    • 제15권26호
    • /
    • pp.151-157
    • /
    • 1992
  • This paper presents a method for analyzing the transfer lines with finite storage buffers. Each machine spends a random amount of time processing each material. This transfer line can be modeled by the tandem queueing system with finite buffers. The great dimensionality of the state space renders the analysis of such system a formidable task. We propose an efficient algorithm to obtain the marginal state probabilities based on the exact algorithm for the two-machine system. Other performance measures, such as the utilization, the blocking probability, the average sojourn time, and the average queue length, can be easily calculated.

  • PDF

비단조 뉴런에 의한 결정론적 볼츠만머신의 성능 개선 (Performance Improvement of Deterministic Boltzmann Machine Based on Nonmonotonic Neuron)

  • 강형원;박철영
    • 한국산업정보학회:학술대회논문집
    • /
    • 한국산업정보학회 2003년도 춘계학술대회
    • /
    • pp.52-56
    • /
    • 2003
  • In this paper, We evaluate the learning ability of non-monotonic DBM(Deterministic Boltzmann Machine) network through numerical simulations. The simulation results show that the proposed system has higher performance than monotonic DBM network model. Non-monotonic DBM network also show an interesting result that network itself adjusts the number of hidden layer neurons. DBM network can be realized with fewer components than other neural network models. These results enhance the utilization of non-monotonic neurons in the large scale integration of neuro-chips.

  • PDF