• 제목/요약/키워드: Test Scheduling

검색결과 221건 처리시간 0.028초

Design of Coordinator Based on Android for Data Collection in Body Sensor Network

  • Min, Seongwon;Lee, Jong-Yong;Jung, Kye-Dong
    • International Journal of Advanced Culture Technology
    • /
    • 제5권2호
    • /
    • pp.98-105
    • /
    • 2017
  • Smartphones are fast growing in the IT market and are the most influential devices in our daily life. Smartphones are being studied for their use in body sensor networks with excellent processing power and wireless communication technology. In this paper, we propose a coordinator design that provides data collection, classification, and display using based on Android-smartphone in multiple sensor nodes. The coordinator collects data of sensor nodes that measure biological patterns using wireless communication technologies such as Bluetooth and NFC. The coordinator constructs a network using a multiple-level scheduling algorithm for efficient data collection at multiple sensor nodes. Also, to support different protocols between heterogeneous sensors, a data sheet recording wireless communication protocol information is used. The designed coordinator used Arduino to test the performance of multiple sensor node environments.

SEED 암호화 알고리즘의 설계 (A Design of SEED Cipher Algorithm)

  • 권명진;김도완;이종화;조상복
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 하계종합학술대회 논문집(2)
    • /
    • pp.313-316
    • /
    • 2002
  • (Korea Information Security Agency) is designed by using VHDL to Implement hardware architecture It has been adopted by most of the security systems in Korea SEED Is designed to utilize the S-boxes and permutations that balance with the current computing technology It has the Feistel structure with 16 rounds The same procedure for data encryption and decryption makes possible an easy and practical hardware implementation. The primary functions used In SEED are F function and G function. This paper proposes an Iterative architecture of F function, a modified architecture of G function and an Iterative architecture of key scheduling algorithm. The designed SEED encrypts and decrypts exactly the test vectors It is expected to extend to various application fields If the design of control blocks Is added.

  • PDF

Multi-factors Bidding method for Job Dispatching in Hybrid Shop Floor Control System

  • Lee, Seok--Hee;Park, Kyung-Hyun;Bae, Chang-Hyun
    • International Journal of Precision Engineering and Manufacturing
    • /
    • 제1권2호
    • /
    • pp.124-131
    • /
    • 2000
  • A shop floor can be considered as and importand level to develop a Computer Integrated Manufacturing system (CIMs). The shop foor is a dynamic environment where unexpected events contrinuously occur, and impose changes to planned activities. The shop floor should adopt an appropriate control system that is responsible for scheduling coordination and moving the manufacturing material and information flow. In this paper, the architecture of the hybrid control model identifies three levels; i.e., the shop floor controller (SFC), the cell controller(CC) and the equipment controller (EC). The methodology for developing these controller is employ an object-oriented approach for static models and IDEF0 for function models for dispatching a job. SFC and CC are coordinated by employing a multi-factors bidding and an adapted Analytic Hierarchy Process(AHP) prove applicability of the suggested method. Test experiment has been conducted by with the shopfloor, consisting of six manufacturing cells.

  • PDF

유전 알고리즘을 이용한 대규모의 발전기 기동정지계획에 관한 연구 (A Study on Large Scale Unit Commitment Using Genetic Algorithm)

  • 김형수;문경준;황기헌;박준호;정정원;김성학
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1997년도 추계학술대회 논문집 학회본부
    • /
    • pp.174-176
    • /
    • 1997
  • This paper proposes a unit commitment scheduling method based on hybrid genetic algorithm(GA). When the systems are scaled up, conventional genetic algorithms suffer from computational time limitations because of the growth of the search space. So greatly reduce the search space of the GA and to efficiently deal with the constraints of the problem, priority list unit ordering scheme are incorporated as the initial solution and the minimum up and down time constraints of the units are included. The violations of other constraints are handled by integrating penalty factors. To show the effectiveness of the proposed method. test results for system of 10 units is compared with results obtained using other methods.

  • PDF

예체능 방과후 교육프로그램의 질과 아동의 정서조절 및 사회적 능력 (The Quality of After-School Programs Focused on Artistic-Physical Activities and Children′s Emotional Regulation and Social Competence)

  • 전은경;최보가
    • 대한가정학회지
    • /
    • 제42권8호
    • /
    • pp.33-48
    • /
    • 2004
  • This study investigated the quality of after-school programs focused on artistic-physical activities, children's emotional regulation and social competence. The subjects were 224 elementary school children (1st through 6th grades) and 41 teachers. The measures were questionnaire(after-school activities), Assessment Profile for Early Childhood Programs(school-age), the Emotional Regulation Scale. and the Social Competency Scale. The data were analyzed by Cronbach's a, frequency, percentile, mean, and t-test. The results indicated that emotional regulation and, social competence were significantly different according to the quality of after-school programs: Children in a higher group of curriculum quality and interaction with teacher had better emotional regulation than did children in a lower group. Children in a higher group of curriculum quality and scheduling had better social competence(leadership and competence) than did children in a lower group.

병렬기계에서 납기지연 가중 합을 최소화하기 위한 유전 알고리듬 (A Genetic Algorithm for the Parallel-Machine Total Weighted Tardiness Problem)

  • 박문원
    • 대한산업공학회지
    • /
    • 제26권2호
    • /
    • pp.183-192
    • /
    • 2000
  • This paper considers the problem of scheduling a set of n jobs on m parallel machines to minimize total weighted tardiness. For the problem a genetic algorithm is proposed, in which solutions are encoded using the random key method suggested by Bean and new crossover operators are employed to increase performance of the algorithm. The algorithm is compared with the Modified Due-Date (MDD) algorithm after series of tests to find appropriate values for genetic parameters. Results of computational tests on randomly generated test problems show that the suggested algorithm performs better than the MDD algorithm and gives good solutions in a reasonable amount of computation time.

  • PDF

원료의 선택 및 혼합비율의 변경 횟수를 최소화하기 위한 정수계획법 모형 및 근사해 발견 기법 (An Integer Programming Model and Heuristic Algorithm to Minimize Setups in Product Mix)

  • 이영호;김성인;심보경;한정희
    • 경영과학
    • /
    • 제24권1호
    • /
    • pp.35-43
    • /
    • 2007
  • Minimizing the total number of setup changes of a machine increases the throughput and improves the stability of a production process, and as a result enhances the product qualify. In this context, we consider a new product-mix problem that minimizes the total number of setup changes while producing the required quantities of a product over a given planning horizon. For this problem, we develop a mixed integer programming model. Also, we develop an efficient heuristic algorithm to find a feasible solution of good quality within reasonable time bounds. Computational results show that the developed heuristic algorithm finds a feasible solution as good as the optimal solution in most test problems.

임의 주기를 가지는 실시간 멀티 태스크를 위한 체크포인트 구간 최적화 (Optimizing Checkpoint Intervals for Real-Time Multi-Tasks with Arbitrary Periods)

  • 곽성우;양정민
    • 전기학회논문지
    • /
    • 제60권1호
    • /
    • pp.193-200
    • /
    • 2011
  • This paper presents an optimal checkpoint strategy for fault-tolerance in real-time systems. In our environment, multiple real-time tasks with arbitrary periods are scheduled in the system by Rate Monotonic (RM) algorithm, and checkpoints are inserted at a constant interval in each task while the width of interval is different with respect to the task. We propose a method to determine the optimal checkpoint interval for each task so that the probability of completing all the tasks is maximized. Whenever a fault occurs to a checkpoint interval of a task, the execution time of the task would be prolonged by rollback and re-execution of checkpoints. Our scheme includes the schedulability test to examine whether a task can be completed with an extended execution time. A numerical experiment is conducted to demonstrate the applicability of the proposed scheme.

원료 하역순서(原料 荷役順序)의 결정(決定) (A Heuristic Unloading Scheduling for the Raw-Material-Carrying Vessels)

  • 성덕현;이용황;김윤호;한재호;김재연
    • 산업공학
    • /
    • 제1권2호
    • /
    • pp.35-44
    • /
    • 1988
  • The purpose of this paper is to prepare an unloading schedule of the raw-material-carrying vessels at Pohang port so as to minimize the total demurrages. A mixed integer programming(MIP) model was constructed, in which only three berths were considered. For the feasible application of the model an approximation approach was employed. The results of the test run of the model based on the past four-month's real data of P company revealed the company could have saved a considerable amount of demurrages, if the model had been applied during the same period. In addition, all the processes were computerized for the clerk-in-charge not only to utilize the results of this study easily but also to rearrange the schedule in quick response to any possible changes.

  • PDF

CAN 기반 분산 제어시스템의 종단 간 지연 시간 분석과 온라인 글로벌 클럭 동기화 알고리즘 개발 (End-to-end Delay Analysis and On-line Global Clock Synchronization Algorithm for CAN-based Distributed Control Systems)

  • 이희배;김홍렬;김대원
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 B
    • /
    • pp.677-680
    • /
    • 2003
  • In this paper, the analysis of practical end-to-end delay in worst case is performed for distributed control system considering the implementation of the system. The control system delay is composed of the delay caused by multi-task scheduling of operating system, the delay caused by network communication, and the delay caused by the asynchronous between them. Through simulation tests based on CAN(Controller Area Network), the proposed end-to-end delay in worst case is validated. Additionally, online clock synchronization algorithm is proposed here for the control system. Through another simulation test, the online algorithm is proved to have better performance than offline one in the view of network bandwidth utilization.

  • PDF