Earticle

There are some literatures focusing on correlation character and the portfolio perfor- mance with that. However, it is hard to nd literatures directly showing any empirical evidence of correlation eect through a existing nancial asset. Using the publicly oered Two Asset Reverse Convertible (TARC) data, which embedded correlation fea- ture, we derive the theoretical price and study how correlation attributes to the value of the TARC. Also we ensure that correlation is an important factor to the issuer as a timer and a hedger. The existence of trade o relationship between as a timer, or a hedger enables us to understand the asset selection mechanism of the issuer.

오픈 소스 하드웨어 기반의 아두이노는 많은 IoT 디바이스로 사용되고 있으며 IoT 디바이스들은 다양한 입출력을 위한 멀티태스킹을 필요로 한다. 아두이노 기반의 멀티태스킹을 위해 많이 사용되는 몇 가지 방법 중 세 가지 방법인 millis() 를 사용한 타이밍 호출 방법, SimpleTimer 라이브러리 사용 방법, Timer 라이브러리 사용 방법을 비교 분석한다. 각 방법의 측정과 시간지연으로 발생되는 실행 오류를 측정하기 위해 두 가지 상황을 생성하여 분석한다. 첫 번째 상황은 일정한 크기 의 임의 작업을 10개 생성하여 각 방법의 시간지연을 측정하고 두 번째 상황은 일정하지 않는 크기의 임의 작업을 10개 생성 하여 Timer 라이브러리의 시간지연으로 발생되는 실행 오류를 비교 분석하였다. 첫 번째 상황에서 millis() 타이밍 호출 방법 과 Simple Timer 라이브러리 사용 방법은 비슷한 시간지연이 발생하였고 Timer 라리브러리 사용 방법은 더 많은 시간지연 이 발생하였다. 두 번째 상황에서는 크기가 작은 작업들이 시간지연으로 정확한 타이밍에 콜백되지 않는 실행 오류가 발생되었다.

Arduino, based on open source hardware, is used in many IoT devices, and IoT devices require multitasking for various inputs and outputs. Among the several methods used for multitasking based on Arduino, we compare three methods: Timing Call by using millis(), Simple Timer library method, and Timer library method. In order to measure the execution error caused by measurement and time delay of each method, two situations are created and analyzed. In the first case, 10 random tasks of a certain size are generated to measure the time delay of each method. In the second situation, 10 random tasks of a certain size are generated to compare execution errors caused by the time lag of the Timer library. In the first case, the millis() timing call method and the Simple Timer library method have a similar time delay and the Timer library method has more time delay. In the second situation, an execution error occurred in which small-size tasks were not called back at the correct timing due to the time delay.

This paper sets forth an adaptive timer handoff algorithm with respect to the shortcoming of fixed timer handoff algorithm. In the algorithm, the real-time handoff timer value T is calculated based on the distance di between current mobile station and original serving cell as well as three constant variables: rank, ram and p, thus changing the handoff waiting time in real time. The simulation results showed that: the handoff occurs only when the mobile station needs to move to a far position from the original serving cell in the fixed timer handoff algorithm and larger set timer value T, and the strength of signals received by the mobile station in the original serving cell is poor; however, in the adaptive timer handoff algorithm, the ping-pong effect can be eliminated, the average handoff times are reduced, the mean strength of signals at handoff is better, the handoff position concentrates rationally and the overall performance reaches to the optimal effect.

TCP is considered as one of the major candidate transport protocols even for constrained IoT networks..In our previous work, we investigated the congestion control mechanism of the uIP TCP. Since the uIP TCP sets the window size to one segment by default, managing the retransmission timer is the primary approach to congestion control. However, the original uIP TCP sets the retransmission timer based on the fixed RTO, it performs poorly when a radio duty cycling mechanism is enabled and the hidden terminal problem is severe. In our previous work, we proposed a TCP retransmission timer adjustment scheme for uIP TCP which adopts the notion of weak RTT estimation of CoCoA, exponential backoffs with variable limits, and dithering. Although our previous work showed that the proposed retransmission timer adjustment scheme can improve performance, we observe that the scheme often causes a node to set the retransmission timer for an excessively too long time period. In this work, we show that slightly modifying the dithering mechanism of the previous scheme is effective for improving TCP fairness.

These days embedded systems are making great strides with the development of hardware to satisfy user’s varied demands. As one can see many kinds of systems operated in our daily life, software becomes dependent on real-time processing functions as well as various functions (for instance, multimedia system or network). These systems have the disadvantage of increasing complexity and are prone to problems when system engineer develop the system. Especially, if problems occur in the kernel layer, a developer needs to spend a lot of time and effort to solve them. In addition, as of now there are not enough tools for solving kernel timer latency problem effectively. In this paper, we propose a system named Kernel Timer Analysis System (KTAS) that can detect timer problems in kernel. The KTAS find High Resolution Timer latency which is a serious problem for the real-time processing system in kernel layer. It can effectively detect the problem and help finding its cause. In the future, we want to generalize the system to detect other problems and their causes to support the developers.

리눅스 컴퓨터 시스템에 실시간 웅용프로그램들을 실행할 경우, 실시간 응용프로그램 자체의 내부나 하부에 실시간 시스템 지원을 위한 엔진을 내장하고 있어야 만다. 그러나 기존의 리눅스 시스템들에 실시간 웅용프로그램을 적용하기 위만 실시간성을 보장 받기 위해서는 스케줄러의 실시간성 빈약 등으로 인해 운영체제의 수정이 불가피한 상황이다. 또한 운영체제의 수정은 호환성의 결여라는 문제를 야기시킨다. 이를 위해 사용하는 방식이 Middleware 방식이다. 실시간 시스템 지원 Middleware 는 운영체제와 실시간 지원 응용프로그램 사이에 위치하여 운영체제 자제가 가지고 있는 부족한 실시간성을 보완하여 주고, 응용프로그램이 적절하고 효과적으로 시스템 서비스들을 이용할 수 있게 해준다. 본 논문에서는 Middleware가 부족간 실시간성을 보완하기 위하여 사용할 수 있는 Middleware 스케줄러의 방식에 대하여 논하고, 효율적인 설계방식을 제안한다.

내장형 시스템은 우리들의 생활에 커다란 변화를 가져왔으며, 많은 적용분야와 다양한 기능을 갖추고 있어서 일상 생활에 널리 사용되고 있다. 문제는 이러한 기기들이 마이크로 컨트롤러에 가해지는 전기적 잡음과 전자기 방해가 많은 환경에서 사용되어지고 있다는 점이다. 따라서 이러한 환경에서는 시스템의 안정적인 운영을 도울 수 있는 기술중의 하나인 Watchdog Timer(WDT)가 필요하다. 본 논문에서는 WDT를 이용한 시스템 오류제어를 실시간 운영체제인 $UbiFOS^{TM}$에 적용하였다.

전기/하이브리드 자동차, 도금용 정루기 등에 들어가는 전력변환장치는 SCR, MOSFET, IGBT와 같은스위칭 소자가 필수적으로 사용되며 이를 구동하기위해서는 Gate Driver가 역시 필수적으로 사용된다.1) 본 논문에서는 대용량 전력변환장치에 사용되는 스위칭소자 SCR/IGBT를 구동하는데 필요한 Gate Driver 를 제안한다. 제안된 Gate Driver는 4개의 BJT를 이용한 H-Bridge를 포함하며, 이는 입력된 DC 전력을 AC로 변환하여 Transformer를 통하여 Isolate 된 전원을 생성한다. 또한 Gate 제어 신호는 입력 전원과Isolated된 전원이 연결된 Photo Coupler를 통해Isolate된 제어 신호로 변환하여 실제 SCR/IGBT를구동한다.2) 본 논문에서는 Simulation을 통해서 설계된 555 Timer를 통한 H-Bridge 동작을 검증하며 시제품을 제작하여 27V 50,000A 급의 도금용 정류기를구동시켜 파형을 확인함으로써 제안된 Gate Driver의 타당성을 검증한다.

Electronic/hybrid car and electroplating rectifier should have switching devices such as SCR, MOSFET, IGBT. And those switching devices should be operated by gate driver. In this paper, we propose high power gate driver that contains H-Bridge using 4 BJTs. H-Bridge and transformer generate isolate power. And gate control signal is transferred to isolated one by photo coupler and operate real switching device. We designed H-Bridge and 555-Timer by PSpice simulation and manufactured real product. Finally we succeed to operate 27V 50,000A electroplating rectifier using proposed gate driver.

Timed token protocols inadequately provide periodic communication service, although this is crucial for hard real time systems. We propose an approach to guaranteeing periodic communication service on a timed token protocol network. In this approach, we allocate bandwidth to each node so that the summation of bandwidth allocations is Target Token Rotation Time (TTRT). If a node cannot consume the allocated time, the residual time can be used by other nodes for non-periodic service using a timer which contains the unused time value and is appended to the token. This approach can always guarantee transmission of real-time messages before their deadlines when the network utilization is less than 50%.

AAL2 전송 방식은 3G WCDMA 망에서 Node-B와 RNC사이에서 음성 및 데이터 트래픽을 전송하는데 사용되고 있다. AAL2의 성능을 분석하기 위하여 이산 마코프 체인 모델을 이용하여 음성 트래픽의 압축밀도와 대역이득을 분석하였으며, 시뮬레이션을 통하여 이 결과를 검증하였다. 또한 집선기에서 AAL2 다중화기의 성능을 세부적으로 분석하였다. 분석에 의하여 Node-B에서의 최적의 Timer_CU를 결정하기 위한 근거를 제안하였으며, 대역이득의 측면에서 집선기에서의 부가적인 AAL2 다중화기의 이점이 매우 작다는 것을 확인하였다. 또한 Node-B와 Iub인터페이스의 집선기에서 AAL2를 사용했을 때 데이터 트래픽의 경우 음성 트래픽에 비하여 그 이점이 매우 작다는 것을 알 수 있었다.

An AAL2 transmission scheme is used to deliver voice and data traffic between Node-B and RNC on 3G WCDMA network. To predict performance of AAL2 multiplexing precisely, we derived analytically bandwidth gain and cell packing density using discrete-time Markov chain model for voice service and validated these results with simulation. We also performed detailed simulation for AAL2 multiplexing in a concentrator. Based on the analytical result, we propose the engineering guideline to select the optimal Timer_CU in a Node-B. We found that there is no major benefit of additional AAL2 multiplexing in a concentrator and the benefit of AAL2 switching in tub for data services is much less than that for voice service.

Wireless Sensor Networks (WSNs) have merged to become one of the most promising applications of wireless ad hoc networks. A defer timer has been used in some of existing network protocols to solve a set of problems in WSNs. We first investigate the use of a defer timer to fully take the advantage of it in WSNs. We demonstrate that by properly setting up the defer timers, many difficult issues in sensor networks, such as power limitation, the broadcast storm problem, and the construction of the virtual backbone, can be easily tackled with only the help of simple localized information at each node. In this paper, we present the power of a defer timer in the design of dominating set construction protocol for broadcasting. The ns 2 computer simulations are carried out for performance study.

Wireless Sensor Networks (WSNs) have merged to become one of the most promising applications of wireless ad hoc networks. A defer timer has been used in some of existing network protocols to solve a set of problems in WSNs. We first investigate the use of a defer timer to fully take the advantage of it in WSNs. We demonstrate that by properly setting up the defer timers, many difficult issues in sensor networks, such as power limitation, the broadcast storm problem, and the construction of the virtual backbone, can be easily tackled with only the help of simple localized information at each node. In this paper, we present the power of a defer timer in the design of dominating set construction protocol for broadcasting. The ns 2 computer simulations are carried out for performance study.

.

In this paper, a multi-modulus divider (MMD) operating at 5 GHz has been designed using a 65-nm CMOS process. The MMD core is composed of cascaded DIV2/3 cells. The first three stages were composed of TSPC D-flipflop, and the last stage was composed of static D-flipflop. We propose a re-timer that extends the duty cycle by generating an asynchronous reset through digital logic gates. This not only removes accumulated circuit noise, but also generates a duty cycle from at least 43% to 53% depending on the division ratio. Based on the output frequency of 200MHz, when N is 25, the total power consumption is 0.9mW, and the circuit size is 75μm*30.5μm.

Virtualization allows multiple commodity operating systems to share on a single physical machine. Resource allocation among virtual machines is a key to determine virtual machine performance. To satisfy time-sensitive task on a domain, hypervisor needs to observe the resource requirements and allocates proper amount of CPU resources in a timely manner. In this paper, we propose a realtime credit scheduler for latency sensitive application on virtual machines. The key idea is to register a time event in the Xen hypervisor. Experiment result shows that the proposed scheme is superior to Credit scheduler.

멀티캐스트 트래픽의 효율적 전달을 위해서는 멀티캐스트 라우팅과 신뢰성 있는 전송 방식이 요구된다. 신뢰성 있는 전송은 손실 패킷에 대한 재전송을 필요로 하며, 이를 위해 전송된 패킷은 재전송 버퍼에 저장되어 있어야만 한다. 따라서 재전송 버퍼의 관리 문제가 중요하며, 본 논문에서는 재전송 버퍼에 얼마나 많은 패킷을 저장할 것인가 하는 문제를 다룬다. 본 논문에서 제안하는 방식인 TBM(Timer based Buffer Management)은 멀티캐스트 트리 상의 응답자와 수신자들 사이의 NAK를 이용해서 얻어진 타이머 값을 기준으로 적정량의 버퍼를 유지하며, 동적인 네트워크 상황에 적응한다. 실험을 통해 TBM이 오류 상황이나 네트워크의 크기 등에 상관없이 버퍼를 능동적으로 관리하는 것을 보인다.

In order to deliver multicast traffic efficiently, multicast routing and reliable transmission mechanisms are required. The reliable delivery implies that lost packets must be retransmitted, which in turn requires that transmitted packets be stored in a retransmission buffer. Therefore how to manage a retransmission buffer is important and, in this paper, we try to solve the problem of how many packets should be maintained in the buffer. Our proposed scheme, the timer-based buffer management (TBM), maintains only necessary amount of buffer based on the timer value calculated from the NAKs between the replier and receivers on a multicast tree and can adjust to the dynamic network conditions. By performing simulations, we show that TBM manages the buffer efficiently regardless of the error situation, network size, and so on.