• Title/Summary/Keyword: (max,+)-linear system

Search Result 68, Processing Time 0.028 seconds

Application of (Max, +)-algebra to the Waiting Times in Deterministic 2-node Tandem Queues with Blocking ((Max, +)-대수를 이용한 2-노드 유한 버퍼 일렬대기행렬에서의 대기시간 분석)

  • Seo Dong-Won
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.30 no.1
    • /
    • pp.149-159
    • /
    • 2005
  • In this study, we consider characteristics of stationary waiting times in single-server 2-node tandem queues with a finite buffer, a Poisson arrival process and deterministic service times. The system has two buffers: one at the first node is infinite and the other one at the second node is finite. We show that the sojourn time or departure process does not depend on the capacity of the finite buffer and on the order of nodes (service times), which are the same as the previous results. Furthermore, the explicit expressions of waiting times at the first node are given as a function of the capacity of the finite buffer and we are able to disclose a relationship of waiting times between under communication blocking and under manufacturing blocking. Some numerical examples are also given.

Ranging Performance Enhancement by Successive Interference Cancellation in Multiuser M-WiMAX System (다중 사용자 M-WiMAX 시스템에서 직렬 간섭 제거를 이용한 레인징 성능 향상 기법)

  • Kim, Jong-Hun;Chang, Kyung-Hi
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12A
    • /
    • pp.998-1005
    • /
    • 2009
  • In the uplink of OFDMA (Orthogonal Frequency Division Multiple Access) based M-WiMAX(Mobile-Worldwide Interoperability for Microwave Access) system, linear phase shift is caused by signals transmitted from multiuser with different delay time and thus, MAI (Multiple Access Interference) occurs. MAI degrades the performance of ranging code detection and delay time estimation in the uplink. Therefore, in this paper, we propose ranging algorithm, applying SIC (Successive Interference Cancellation) to the conventional ranging algorithm, to minimize MAI and to improve ranging performance. The proposed ranging algorithm is verified through the Monte Carlo simulation, which shows the improved performance of ranging code detection and delay time estimation compared to the conventional algorithms. Through compared with random access of the 3GPP LTE, we can know limit of ranging performance.

Study on Thermal Expansion of $Si_2O-Al_2O_3$ System ($Si_2O-Al_2O_3$계의 열팽창성에 관한 연구)

  • 이종근;이병하;전승관
    • Journal of the Korean Ceramic Society
    • /
    • v.17 no.3
    • /
    • pp.141-144
    • /
    • 1980
  • Thermal expansion property of $SiO_2-Al_2O_3$ system consisted of Muan clay, Hadong Pink Kaolin and Dangjin Silica was studied. Specimens were heated at the constant rate of 18$0^{\circ}C$/hr to the max. temperatures of 115$0^{\circ}C$ to 130$0^{\circ}C$ with an interval of $25^{\circ}C$, and matured for 3hrs. The result of X-Ray diffraction analysis showed that main crystals formed were $\alpha$-quartz, $\alpha$-cristobalite and mullite. Linear thermal expansion was measured at 90$0^{\circ}C$. The results of the linear thermal expansion were decreased regularly with the increase of the sintering temperature in accordance with the following equation. $y=5$\chi$\perp1100^{\circ}$. Where $\chi$ is amounts of kaolin (wt%), and y is temperature of the changing point of linear thermal expansion.

  • PDF

Modeling and Scheduling of Cyclic Shops with Time Window Constraints

  • Seo, Jeong-Won;Lee, Tae-Eog
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.10a
    • /
    • pp.161-164
    • /
    • 2000
  • A cyclic shop is a production system that repeatedly produces identical sets of jobs, called minimal part sets, in the same loading and processing sequence. We consider a version of cyclic shop where the operations are processed and unloaded within time limits, so called a time window. We model the shop using an event graph model, a class of Petri nets. To represent the time window constraint, we introduce places with negative time delays. From the shop modeling graph, we develop a linear system model based on the max- plus algebra and characterize the conditions on the existence of a stable schedule.

  • PDF

Explicit Formulae for Characteristics of Finite-Capacity M/D/1 Queues

  • Seo, Dong-Won
    • ETRI Journal
    • /
    • v.36 no.4
    • /
    • pp.609-616
    • /
    • 2014
  • Even though many computational methods (recursive formulae) for blocking probabilities in finite-capacity M/D/1 queues have already been produced, these are forms of transforms or are limited to single-node queues. Using a distinctly different approach from the usual queueing theory, this study introduces explicit (transform-free) formulae for a blocking probability, a stationary probability, and mean sojourn time under either production or communication blocking policy. Additionally, the smallest buffer capacity subject to a given blocking probability can be determined numerically from these formulae. With proper selection of the overall offered load ${\rho}$, the approach described herein can be applicable to more general queues from a computational point of view if the explicit expressions of random vector $D_n$ are available.

Medical Image Compression in the Wavelet Transform Domain (Wavelet 변환 영역에서 의료영상압축)

  • 이상복;신승수
    • The Journal of the Korea Contents Association
    • /
    • v.2 no.4
    • /
    • pp.23-29
    • /
    • 2002
  • This paper suggest the image compression that is needed to process PACS in medical information system. The image decoding method is used Linear-predictor and Lloyd-Max quantizer(quantization) in the Wavelet transform domain. Wavelet Transform Method is processed the multi-resolution by dividing image into 10 sub-bands of 3 levels. Low frequency domain that is sensitive to human visual characteristic is encoded by DPCM which is lossless encoding methods, and Lloyed-Max quantizer, the optimal quantizer for reducing ringing and aliasing in the image of inter sub-band, is used in the remaining high frequency domain of sub-band. The examination verifies that decompressed images are superior by the result that PSNR is 28.53dB on the input image, 512$\times$152 abdominal CT image and Chest image.

  • PDF

Fabrication of IMT-2000 Linear Power Amplifier using Current Control Adaptation Method in Signal Cancelling Loop (신호 제거 궤환부의 전류 제어 적응형 알고리즘을 이용한 IMT-2000용 선형화 증폭기 제작)

  • 오인열;이창희;정기혁;조진용;라극한
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.1
    • /
    • pp.24-36
    • /
    • 2003
  • The digital mobile communication will be developed till getting multimedia service in anyone, any where, any time. Theses requiring items are going to be come true via IMT-2000 system. Transmitting signal bandwidth of IMT-2000 system is 3 times as large as IS-95 system. That is mean peak to average of signal is higher than IS-95A system. So we have to design it carefully not to effect in adjacent channel. HPA(High Power Amplifier) located in the end point of system is operated in 1-㏈ compression point(Pl㏈), then it generates 3rd and 5th inter modulation signals. Theses signals affect at adjacent channel and RF signal is distorted by compressed signal which is operated near by Pl㏈ point. Then the most important design factor is how we make HPA having high linearity. Feedback, Pre-distorter and Feed-forward methods are presented to solve theses problems. Feed-forward of these methods is having excellent improving capacity, but composed with complex structure. Generally, Linearity and Efficiency in power amplifier operate in the contrary, then it is difficult for us to find optimal operating point. In this paper we applied algorithm which searches optimal point of linear characteristics, which is key in Power Amplifier, using minimum current point of error amplifier in 1st loop. And we made 2nd loop compose with new structure. We confirmed fabricated LPA is operated by having high linearity and minimum current condition with ACPR of -26 ㏈m max. @ 30㎑ BW in 3.515㎒ and ACLR of 48 ㏈c max@${\pm}$㎒ from 1W to 40W.

Optimal Buffer Allocation in Tandem Queues with Communication Blocking

  • Seo, Dong-Won;Ko, Sung-Seok;Jung, Uk
    • ETRI Journal
    • /
    • v.31 no.1
    • /
    • pp.86-88
    • /
    • 2009
  • In this letter, we consider an m-node tandem queue (queues in series) with a Poisson arrival process and either deterministic or non-overlapping service times. With the assumption that each node has a finite buffer except for the first node, we show the non-increasing convex property of stationary waiting time with respect to the finite buffer capacities. We apply it to an optimization problem which determines the smallest buffer capacities subject to probabilistic constraints on stationary waiting times.

  • PDF

Design of a DSP Controller and Driver for the Power-by-wire(PBW) Driving System Using BLDC Servo Motor Pump (BLDC 서보 모터 펌프를 이용하는 직동력(PBW) 구동시스템의 DSP 제어기 및 구동기 설계)

  • Joo, Jae-Hun;Sim, Dong-Seouk;Choi, Jung-Keyng
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.5
    • /
    • pp.1207-1212
    • /
    • 2011
  • This paper presents a study on the DSP(Digital Signal Processor) controller for the PBW(power-by-wire) system using BLDC(Brushless Direct Current) servo motor pump. The PBW hydraulic actuator was realized with hydraulic pump driven by BLDC servo motor, hydraulic cylinder and controller. This PBW system needs speed control of servo motor for linear thrust action of hydraulic cylinder. This paper implements a servo controller with vector control algorithm and MIN-MAX PWM technique. As CPU of a controller, TMS320F2812 DSP was adopted because it has PWM waveform generator, A/D converter, SPI(Serial Peripheral Interface) port and many input/output port etc.

Stationary Waiting Times in Simple Fork-and-Join Queues with Finite Buffers and Communication Blocking (통신차단규칙을 따르는 유한버퍼 단순 조립형 대기행렬 망에서의 안정대기시간)

  • Seo, Dong-Won;Lee, Seung-Man
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.3
    • /
    • pp.109-117
    • /
    • 2010
  • In this study, we consider stationary waiting times in a simple fork-and-join type queue which consists of three single-server machines, Machine 1, Machine 2, and Assembly Machine. We assume that the queue has a renewal arrival process and that independent service times at each node are either deterministic or non-overlapping. We also assume that the Machines 1 and 2 have an infinite buffer capacity whereas the Assembly Machine has two finite buffers, one for each machine. Services at each machine are given by FIFO service discipline and a communication blocking policy. We derive the explicit expressions for stationary waiting times at all nodes as a function of finite buffer capacities by using (max,+)-algebra. Various characteristics of stationary waiting times such as mean, higher moments, and tail probability can be computed from these expressions.