• Title/Summary/Keyword: Timing constraints

Search Result 115, Processing Time 0.03 seconds

Differences in the Control of Anticipation Timing Response by Spatio-temporal Constraints

  • Seok-Hwan LEE;Sangbum PARK
    • Journal of Sport and Applied Science
    • /
    • v.7 no.2
    • /
    • pp.39-51
    • /
    • 2023
  • Purpose: The purpose of this study was to investigate differences in the control process to satisfy spatial and temporal constraints imposed upon the anticipation timing response by analyzing the effect of spatio-temporal accuracy demands on eye movements, response accuracy, and the coupling of eye and hand movements. Research design, data, and methodology: 12 right-handed male subjects participated in the experiment and performed anticipation timing responses toward a stimulus moving at three velocities (0.53m/s, 0.66m/s, 0.88m/s) in two task constraint conditions (temporal constraint, spatial constraint). During the response, response accuracy and eye movement patterns were measured from which timing and radial errors, the latency of saccade, fixation duration of the point of gaze (POG), distance between the POG and stimulus, and spatio-temporal coupling of the POG and hand were calculated. Results: The timing and radial errors increased with increasing stimulus velocity, and the spatio-temporal constraints led to larger timing errors than the temporal constraints. The latency of saccade and the temporal coupling of eye and hand decreased with increasing stimulus velocity and were shorter and longer respectively in the spatio-temporal constraint condition than in the temporal constraint condition. The fixation duration of the POG also decreased with increasing stimulus velocity, but no difference was shown between task constraint conditions. The distance between the POG and stimulus increased with increasing stimulus velocity and was longer in the temporal constraint condition compared to the spatio-temporal constraint condition. The spatial coupling of eye and hand was larger with the velocity 0.88m/s than those in other velocity conditions. Conclusions: These results suggest that differences in eye movement patterns and spatio-temporal couplings of stimulus, eye and hand by task constraints are closely related with the accuracy of anticipation timing responses, and the spatial constraints imposed may decrease the temporal accuracy of response by increasing the complexity of perception-action coupling.

A Schedulability analysis and Recovery Technique of Real-Time System using TCPN (TCPN을 이용한 실시간 시스템의 스케쥴가능성 분석 및 회복기법)

  • Kim, Chun-Bae;Park, Heung-Bok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.10
    • /
    • pp.2797-2808
    • /
    • 1999
  • Timing Constraint Petri Nets(TCPN) extend petri nets by adding timing constraints, it is provide a formal method for the modeling and analysis of real-time system. A real-time schedulability analysis decide that a set of concurrent processes will always meet its deadline. In this paper, we present TCPN model for real-time system include timing constraints and propose a schedulability analysis algorithm using them. Also, When the TCPN model is unscheduleable under the imposed timing constraints, we propose a recovery technique that will be scheduleable by the system specification modifying or timing constraints relaxing in the optimized time.

  • PDF

Design and Implementation of DMA priority section module (DMA Priority selection module 설계 및 구현)

  • Hwang, In-Ki
    • Proceedings of the KIEE Conference
    • /
    • 2002.11c
    • /
    • pp.264-267
    • /
    • 2002
  • This paper proposed a effective priority selection algorithm named weighted round-robin algorithm and show the implementation result of DMAC priority selection module using prosed weighted round-robin algorithm. I parameterize timing constraints of each functional module, which decide the effectiveness of system. Proposed weighted round-robin algorithm decide the most effective module for data transmission using parameterize timing constraints and update timing parameter of each module for next transmission module selection. I implement DMAC priority selection module using this weighted round-robin algorithm and can improve the timing effective for data transmission from memory to functional module or one functional module to another functional module.

  • PDF

Analysis of Timing Constraints for Timely Collaboration among Web-Based Distributed Business Systems (웹기반 분산 기업시스템의 적기협력을 위한 시간 제약 조건의 분석)

  • Suh, Tae-Jung;Lee, Dong-Woo
    • 대한공업교육학회지
    • /
    • v.33 no.2
    • /
    • pp.232-247
    • /
    • 2008
  • Timely collaboration among businesses is required these days such as in B2B E-Commerce. That is, emergency requests or urgent information among businesses should be processed in an immediate mode. In this paper we investigate the semantics on timing constraints of timely collaboration among businesses in terms of event, data, and action and present ECA rule construction related to the timing constraints and its violation. The prototype is implemented using web-based active functionality component.

Designing Distributed Real-Time Systems with Decomposition of End-to-End Timing Donstraints (양극단 지연시간의 분할을 이용한 분산 실시간 시스템의 설계)

  • Hong, Seong-Soo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.3 no.5
    • /
    • pp.542-554
    • /
    • 1997
  • In this paper, we present a resource conscious approach to designing distributed real-time systems as an extension of our original approach [8][9] which was limited to single processor systems. Starting from a given task graph and a set of end-to-end constraints, we automatically generate task attributes (e.g., periods and deadlines) such that (i) the task set is schedulable, and (ii) the end-to-end timing constraints are satisfied. The method works by first transforming the end-to-end timing constraints into a set of intermediate constraints on task attributes, and then solving the intermediate constraints. The complexity of constraint solving is tackled by reducing the problem into relatively tractable parts, and then solving each sub-problem using heuristics to enhance schedulability. In this paper, we build on our single processor solution and show how it can be extended for distributed systems. The extension to distributed systems reveals many interesting sub-problems, solutions to which are presented in this paper. The main challenges arise from end-to-end propagation delay constraints, and therefore this paper focuses on our solutions for such constraints. We begin with extending our communication scheme to provide tight delay bounds across a network, while hiding the low-level details of network communication. We also develop an algorithm to decompose end-to-end bounds into local bounds on each processor of making extensive use of relative load on each processor. This results in significant decoupling of constraints on each processor, without losing its capability to find a schedulable solution. Finally, we show, how each of these parts fit into our overall methodology, using our previous results for single processor systems.

  • PDF

Synthesis of Asynchronous Circuits from Deterministic Signal Transition Graph with Timing Constraints (시간 제한 조건을 가진 결정성 신호 전이 그래프로부터 비동기 회로의 합성)

  • Kim, Hee-Sook;Jung, Sung-Tae
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.2
    • /
    • pp.216-226
    • /
    • 2000
  • This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a deterministic signal transition graph specification with timing constraints. First, a timing analysis extracts the timed concurrency and timed causality relations between any two signal transitions. Then, a hazard-free implementation under the timing constraints is synthesized by constructing a precedence graph and finding paths in the graph. The major result of this work is that the method does not suffer from the state explosion problem, achieves significant reductions in synthesis time, and generates circuits that have nearly the same area as compared to previous methods.

  • PDF

Speech Rhythm and the Three Aspects of Speech Timing: Articulatory, Acoustic and Auditory

  • Yun, Il-Sung
    • Speech Sciences
    • /
    • v.8 no.1
    • /
    • pp.67-76
    • /
    • 2001
  • This study is targeted at introducing the three aspects of speech timing (articulatory, acoustic and auditory) and discussing their strong and weak points in describing speech timing. Traditional (extrinsic) articulatory timing theories exclude timing representation in the speaker's articulatory plan for his utterance, while the (intrinsic) articulatory timing theories headed by Fowler incorporate time into the plan for an utterance. As compared with articulatory timing studies with crucial constraints in data collection, acoustic timing studies can deal with even several hours of speech relatively easily. This enables us to perform suprasegmental timing studies as well as segmental timing studies. On the other hand, perception of speech timing is related to psychology rather than physiology and physics. Therefore, auditory timing studies contribute to enhancing our understanding of speech timing from the psychological point of view. Traditionally, some theories of speech timing (e.g. typology of speech rhythm: stress-timing; syllable-timing or mora-timing) have been based on our perception. However, it is problematic that auditory timing can be subjective despite some validity. Many questions as to speech timing are expected to be answered more objectively. Acoustic and articulatory description of timing will be the method of solving such problems of auditory timing.

  • PDF

Derivation of the Timing Constraints for Multi-Sampled Multitasks in a Real-Time Control System (다중샘플링 다중작업을 수행하는 실시간제어시스템의 시계수제한성 유도)

  • 이대현;김학배
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.2
    • /
    • pp.145-150
    • /
    • 1999
  • A real-time control system, composed of the controlled processor and the controller computer(s), may have a variety of task types, some of which have tight timing-constraints in generating the correct control input. The maximum period of those task failures tolerable by the system is called the hard deadline, which depends on not only fault characteristics but also task characteristics. In the paper, we extend a method deriving the hard deadline in LTI system executing single task. An algorithm to combine the deadlines of all the elementary tasks in the same operation-mode is proposed to derive the hard deadline of the entire system. For the end, we modify the state equation for the task to capture the effects of task failures (delays in producing correct values) and inter-correlation. We also classify the type of executing the tasks according to operation modes associated with relative importance of correlated levels among tasks, into series, parallel, and cascade modes. Some examples are presented to demonstrate the effectiveness of the proposed methods.

  • PDF

Design of a High-Level Synthesis System Supporting Asynchronous Interfaces (비동기 인터페이스를 지원하는 정원 수준 합성 시스템의 설계)

  • 이형종;이종화;황선영
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.2
    • /
    • pp.116-124
    • /
    • 1994
  • This paper describes the design of a high-level synthesis system. ISyn: Interface Synthesis System for ISPS-A. which generates hardware satisfying timing constraints. The original version of ISPS is extended to be used for the description/capture of interface operations and timing constraints in the ISPS-A. To generate the schedule satisfying interface constraints the scheduling process is divided into two steps:pre-scheduling and post-scheduling. ISyn allocates hardware modules with I/O ports by the clique partitioning algorithm. Experimental results show that ISyn is capable of synthesizing hardware modules effectively for internal and/or interactive operations.

  • PDF

Timing Agency in Digital Comics : Focused on Multimedia Comics (전자만화의 타이밍 에이전시 : 멀티미디어와 혼합된 만화를 중심으로)

  • Yoh, Mi-Ju
    • Cartoon and Animation Studies
    • /
    • s.27
    • /
    • pp.79-97
    • /
    • 2012
  • Comic book readers have respectively different reading speed and this means that time in comics is translated by readers' view. The authors arrange panels and gutters to control time, but time recognition in comics depends on the readers and generally it is the readers' role. On the contrary, the phenomenon having occurred by infinite canvas varied the authority of timing. Infinite canvas can give the comic book authors more authority of controlling timing than the readers by intervening in readers' relative time as an agents and transforming their fictive time into absolute time. Following to the concept of "Agency" in games, agency is the power which satisfies the players by reemergence of their intentions. Since some of digital comics absorbed the properties of other media such as animation and sound, we can see that the reader's timing agency is shifted to the author's timing agency. The purpose of this study is to analyse this phenomenon and to remind that agency motivated by the balance between material constraints and formal constraints becomes a condition of readability of digital comics but excessive timing constraints given to the readers causes a decrease of the readers' timing agency. This also can be a considerable matter when we produce digital comics.