• Title/Summary/Keyword: Time Constraint

Search Result 1,045, Processing Time 0.027 seconds

Quality Level Classification of ECG Measured using Non-Constraint Approach (무구속적 방법으로 측정된 심전도의 신뢰도 판별)

  • Kim, Y.J.;Heo, J.;Park, K.S.;Kim, S.
    • Journal of Biomedical Engineering Research
    • /
    • v.37 no.5
    • /
    • pp.161-167
    • /
    • 2016
  • Recent technological advances in sensor fabrication and bio-signal processing enabled non-constraint and non-intrusive measurement of human bio-signals. Especially, non-constraint measurement of ECG makes it available to estimate various human health parameters such as heart rate. Additionally, non-constraint ECG measurement of wheelchair user provides real-time health parameter information for emergency response. For accurate emergency response with low false alarm rate, it is necessary to discriminate quality levels of ECG measured using non-constraint approach. Health parameters acquired from low quality ECG results in inaccurate information. Thus, in this study, a machine learning based approach for three-class classification of ECG quality level is suggested. Three sensors are embedded in the back seat, chest belt, and handle of automatic wheelchair. For the two sensors embedded in back seat and chest belt, capacitively coupled electrodes were used. The accuracy of quality level classification was estimated using Monte Carlo cross validation. The proposed approach demonstrated accuracy of 94.01%, 95.57%, and 96.94% for each channel of three sensors. Furthermore, the implemented algorithm enables classification of user posture by detection of contacted electrodes. The accuracy for posture estimation was 94.57%. The proposed algorithm will contribute to non-constraint and robust estimation of health parameter of wheelchair users.

Synchronic relations with a time constraint

  • Koh, Inseon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1994.10a
    • /
    • pp.676-680
    • /
    • 1994
  • Three synchronic variables (Deviation Time, Fairness Time, Synchronic Time) are defined for Timed Place Petri Nets (TPPN). These parameters show the dependency between the firing of transition subsets in the time domain by different values. The approaches in this paper can be used to find synchronic relations in Stochastic Petri Nets. This paper presents how to decide the minimum resources required to a Flexible Manufacturing Cell using Synchronic Time concept.

  • PDF

Hierarchical Real-Time MAC Protocol for (m,k)-firm Stream in Wireless Sensor Networks

  • Teng, Zhang;Kim, Ki-Il
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.2
    • /
    • pp.212-218
    • /
    • 2010
  • In wireless sensor networks (WSNs), both efficient energy management and Quality of Service (QoS) are important issues for some applications. For creating robust networks, real-time services are usually employed to satisfy the QoS requirements. In this paper, we proposed a hierarchical real-time MAC (medium access control) protocol for (m,k)-firm constraint in wireless sensor networks shortly called HRTS-MAC. The proposed HRTS-MAC protocol is based on a dynamic priority assignment by (m,k)-firm constraint. In a tree structure topology, the scheduling algorithm assigns uniform transmitting opportunities to each node. The paper also provides experimental results and comparison of the proposed protocol with E_DBP scheduling algorithm.

A Study on the Cycle Time Reduction of Cylindrical Plunge Grinding Process with Recursive Constraint Bounding Method (RCB법에 의한 원통형 플런지 연삭공정의 싸이클 시간 감소에 관한 연구)

  • 최성주
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.6 no.1
    • /
    • pp.34-44
    • /
    • 1997
  • This study presents the recursive constraint bounding(RCB) method to reduce the cycle time in internal cylindrical plunge grinding process. This method can cope with process noise as well as modeling bias. The main features of RCB method are its utilization of measurements at the end of each cycle and its use of monotonicity analysis for determining the extremes of bias and noise. This method is investigated in simulation and evaluated by experiment in internal cylindrical plunge grinding operation. The results from simulation and experiment show that it is effective in reducing cycle time in spite of modeling uncertainty in the forms of process noise and modeling bias.

  • PDF

A Study of Departure Process on the Open and Nested Population Constrained Tandem Queueing Network with Constant Service Times (사용자 제한이 적용되는 2계층 대기행렬 네트워크 구조의 이탈과정에 관한 분석)

  • Rhee, Young
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.34 no.4
    • /
    • pp.113-121
    • /
    • 2009
  • In this paper, we consider the departure process from the open and nested tandem Queueing network with population constraint and constant service times. It is known that the Queueing network can be transformed into a simple Queueing network which can be easy to analyze. Using this simple Queueing network, upper and lower bounds on the interdeparture time are obtained. We prove that the variance of the interdeparture time is bounded within these two bounds. Validation against simulation data is shown that how it works the variance of the interdeparture time within two bounds. These bounds can be applied to obtain the better variance of the interdeparture time using a suitable method.

Optimal Berth and Crane Scheduling Using Constraint Satisfaction Search and Heuristic Repair (제약만족 탐색과 휴리스틱 교정기법을 이용한 최적 선석 및 크레인 일정계획)

  • 류광렬;김갑환;백영수;황준하;박영만
    • Journal of Intelligence and Information Systems
    • /
    • v.6 no.2
    • /
    • pp.1-14
    • /
    • 2000
  • The berth and crane scheduling problem in a container terminal encompasses the whole process of assigning berth to each ship, determining the duration of berthing, assigning container cranes to each ship, and determining the specific start and end time of each crane service, for all the ships scheduled to be arriving at the terminal during a certain scheduling horizon. This problem is basically a constraint satisfaction problem in which cranes and berths should be assigned in such a way that all the spatial and temporal constraints are satisfied without any interference. However, it is also an optimization problem because the requested arrival and departure time should be met for as many of the scheduled ships as possible, while the operation cost of the terminal should be minimized. In this paper, we present an effective and efficient approach to solving this type of problem, which combines constrain satisfaction search and heuristic repair. We first employ a constraint satisfaction search to find a feasib1e solution. Then, the feasible solution is modified to a more optimal one by iteratively applying our heuristic repair operations within the framework of constraint satisfaction search. Experimental results with a real data from Pusan East Container Terminal showed that our approach can derive a schedule of satisfactory quality in a very short time.

  • PDF

An Efficient Algorithm to Minimize Total Error of the Imprecise Real Time Tasks with 0/1 Constraint (0/1 제약조건을 갖는 부정확한 실시간 태스크들의 총오류를 최소화시키는 효율적인 알고리즘)

  • Song, Gi-Hyeon
    • Journal of the Korea Computer Industry Society
    • /
    • v.7 no.4
    • /
    • pp.309-320
    • /
    • 2006
  • The imprecise real-time system provides flexibility in scheduling time-critical tasks. Most scheduling problems of satisfying both 0/1 constraint and timing constraints, while the total error is minimized, are NP-complete when the optional tasks have arbitrary processing times. Liu suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on uniprocessors for minimizing the total error. Song et al suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on multiprocessors for minimizing the total error. But, these algorithms are all off-line algorithms. In the online scheduling, NORA algorithm can find a schedule with the minimum total error for the imprecise online task system. In the NORA algorithm, the EDF strategy is adopted in the optional scheduling.<중략> The algorithm, proposed in this paper, can be applied to some applications efficiently such as radar tracking, image processing, missile control and so on.

  • PDF

A perceptual study of the wh-island constraint in Seoul Korean (서울말의 wh-섬 제약 지각 연구)

  • Yun, Weonhee
    • Phonetics and Speech Sciences
    • /
    • v.13 no.2
    • /
    • pp.27-35
    • /
    • 2021
  • This study investigated the status of the wh-island constraint in Seoul Korean. The syntactic movement of a wh-phrase out of an embedded sentence so as to have wide scope at LF is known to be invalid as it violates the wh-island constraint, but there have been studies in which such a movement was possible when the sentence is read with a wh-intonation. We conducted perceptual tests in which subjects were asked to select an answer after listening to each of the four types of interrogative sentences. Three of them were with 'Nugu-leul', which is an accusative form of the wh-phrase 'who' as well as an indefinite form. The fourth sentence contained the name of a person. 'Nugu-leul' and the noun were positioned in the same embedded sentence to see whether the subjects accepted a matrix scope interpretation of the wh-phrases. Response time was transformed to normalized log response time and checked to find any differences in the time taken to select the answers depending on different types of interrogative sentences. The results showed the subjects had a definite preference for the matrix scope interpretation for the sentences with a wh-intonation. The response time required to select the matrix scope interpretation was longer than for any other type of interrogative sentence. We concluded that the wh-island constraint in Seoul Korean is weak.

Time Series Pattern Recognition based on Branch and Bound Dynamic Time Warping (분기 한정적인 동적 타임 워핑 기반의 시계열 패턴인식)

  • Jang, Seok-Woo;Park, Young-Jae;Kim, Gye-Young
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.7
    • /
    • pp.584-589
    • /
    • 2010
  • The dynamic time warping algorithm generally used in time series pattern recognition spends most of the time in generating the correlation table, and it establishes the global path constraint to reduce the corresponding time complexity. However, the constraint restrains just in terms of the time axis, not considering the contents of input patterns. In this paper, we therefore propose an efficient branch and bound dynamic time warping algorithm which sets the global constraints by adaptively reflecting the patterns. The experimental results show that the proposed method outperforms conventional methods in terms of the speed and accuracy.

The associations between marital satisfaction and life satisfaction among retirees in later life: a longitudinal comparison (은퇴 노인의 부부관계 만족도와 삶 만족도의 관계에 대한 종단적 비교)

  • Choi, Bomi;Jun, Hey Jung;Joo, Susanna
    • Journal of Family Relations
    • /
    • v.21 no.2
    • /
    • pp.77-96
    • /
    • 2016
  • Objectives: The aims of this study are to examine the associations between marital satisfaction and life satisfaction among Korean retirees in later life and to test whether the degrees of associations increased over time. Method: Nationally representative Korean Longitudinal Study of Ageing data from wave 1 (in 2006) to wave 4 (in 2012) was utilized and retirees in later life (65-89 years old, N=402) were analyzed. Latent growth modeling (LGM) and model constraint were applied using Mplus 7.3. Age, sex, household income, subjective health, depressive symptoms and elapsed time after retirement were included as control variables. Results: Linear unconditional LGM fitted the data well and showed gradual decrease in life satisfaction. Conditional LGM revealed significant associations between marital satisfaction and life satisfaction from time 1 to time 4. According to model constraint test, the size of associations between marital satisfaction and life satisfaction did not change with time. Conclusions: To sum up these results, the associations between marital satisfaction and life satisfaction were significant and relatively stable over time among retirees in later life. This study suggests one's spouse is a fundamental component of social convoy among Korean retirees in later life. Therefore, intervention programs targeted toward enhancing marital relationships among retirees' couples will help them to live a better life.