• Title/Summary/Keyword: update rate

Search Result 285, Processing Time 0.03 seconds

Design of High Speed LDPC Encoder Based on DVB-S2 Standard (DVB-S2 기반 고속 LDPC 부호기 설계)

  • Park, Gun Yeol;Lee, Seong Ro;Jeon, Sung Min;Jung, Ji-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.2
    • /
    • pp.196-201
    • /
    • 2013
  • In this paper, we proposed high speed LDPC encoder architecture for DVB-S2 standard. In conventional algorithm, the processes of parity calculations are serial fashion. Therefore conventional algorithm need clocks of number of parity. The proposed LDPC encoding architecture is based on a parallel 360 bits-wise operations. The key issues for realizing high speed are using the two kinds of index addresses and make use of memories efficiently. We implemented a half rate LDPC encoder on an FPGA, and confirmed its maximum throughput is up to 10 Gbps on 100MHz clock.

A Quorum-Based Dynamic Location Management Method for Mobile Computing Systems (이동 컴퓨팅 시스템을 위한 Quorum 기반 동적 위치 관리 기법)

  • Bae, In-Han;Kim, Yun-Jeong;Kim, Yun-Jeong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.10
    • /
    • pp.1217-1224
    • /
    • 1999
  • 이동 호스트들의 위치 정보를 관리하는 것은 이동 컴퓨터 시스템에서 중요한 문제이다. 이동 호스트가 이동할 때 위치 수정과 위치 탐색간에는 상반관계가 존재한다. 본 논문에서는 위치 서버를 이용한 간단한 quorum 기반 분산 동적 위치 관리 방법을 제안한다. 이 방법에서는 이동 호스트들의 위치 정보가 모든 위치 레지스터가 아닌 위치 레지스터들의 부분집합에서 효율적으로 관리되기 때문에 위치 수정 비용과 위치 탐색 비용이 감소된다. 그리고 위치 레지스터들의 부분집합은 동적으로 변하고, 각 위치 서버의 부하는 이동 호스트에 대한 질의율을 고려하므로 균등해진다. 제안된 알고리즘의 성능은 위치 수정비용과 위치 탐색비용의 전체비용으로 평가되었고, Prakash의 알고리즘과 비교되었다.Abstract Managing location information of mobile hosts is an important issue in mobile computing systems. There is a trade-off between location update and search, when a mobile host moves. This paper proposes a simple quorum-based distributed dynamic location management method using location registers. The cost of location updates and searches is reduced by our method because the location information of mobile hosts is managed efficiently in a subset of location registers instead of in all location registers. In our method, the subset of location registers is dynamically changed, and the load of each location register is balanced by considering query rate for mobile hosts. The performance of proposed algorithm is evaluated in terms of the total cost of a location update and a location search, and is compared with Prakash's algorithm.

Blockchain-Based User-Participatory Game Update: Maze Escape Game Case (블록체인 기반 사용자 참여 게임 업데이트: 미로탈출게임 사례)

  • Jeon, Mingyu;Hwang, Chiyeon;Na, Hyeon-Suk
    • Journal of Korea Game Society
    • /
    • v.19 no.4
    • /
    • pp.85-96
    • /
    • 2019
  • In this note, we propose a game system to fairly and transparently control and update game variables using blockchain. As an example, we present an Ethereum-based maze escape game, being the first blockchain-based maze game and the first attempt to control game level through blockchain. In this system, the level function computes maze level reflecting the amount of maze walls purchased/sold by users. Using blockchain for game management saves human and economic resources and prevents unfair practice of game developers unilaterally manipulating game level or item enhancement rate.

A Method on the Learning Speed Improvement of the Online Error Backpropagation Algorithm in Speech Processing (음성처리에서 온라인 오류역전파 알고리즘의 학습속도 향상방법)

  • 이태승;이백영;황병원
    • The Journal of the Acoustical Society of Korea
    • /
    • v.21 no.5
    • /
    • pp.430-437
    • /
    • 2002
  • Having a variety of good characteristics against other pattern recognition techniques, the multilayer perceptron (MLP) has been widely used in speech recognition and speaker recognition. But, it is known that the error backpropagation (EBP) algorithm that MLP uses in learning has the defect that requires restricts long learning time, and it restricts severely the applications like speaker recognition and speaker adaptation requiring real time processing. Because the learning data for pattern recognition contain high redundancy, in order to increase the learning speed it is very effective to use the online-based learning methods, which update the weight vector of the MLP by the pattern. A typical online EBP algorithm applies the fixed learning rate for each update of the weight vector. Though a large amount of speedup with the online EBP can be obtained by choosing the appropriate fixed rate, firing the rate leads to the problem that the algorithm cannot respond effectively to different learning phases as the phases change and the number of patterns contributing to learning decreases. To solve this problem, this paper proposes a Changing rate and Omitting patterns in Instant Learning (COIL) method to apply the variable rate and the only patterns necessary to the learning phase when the phases come to change. In this paper, experimentations are conducted for speaker verification and speech recognition, and results are presented to verify the performance of the COIL.

The Intelligent Intrusion Detection Systems using Automatic Rule-Based Method (자동적인 규칙 기반 방법을 이용한 지능형 침입탐지시스템)

  • Yang, Ji-Hong;Han, Myung-Mook
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.6
    • /
    • pp.531-536
    • /
    • 2002
  • In this paper, we have applied Genetic Algorithms(GAs) to Intrusion Detection System(TDS), and then proposed and simulated the misuse detection model firstly. We have implemented with the KBD contest data, and tried to simulated in the same environment. In the experiment, the set of record is regarded as a chromosome, and GAs are used to produce the intrusion patterns. That is, the intrusion rules are generated. We have concentrated on the simulation and analysis of classification among the Data Mining techniques and then the intrusion patterns are produced. The generated rules are represented by intrusion data and classified between abnormal and normal users. The different rules are generated separately from three models "Time Based Traffic Model", "Host Based Traffic Model", and "Content Model". The proposed system has generated the update and adaptive rules automatically and continuously on the misuse detection method which is difficult to update the rule generation. The generated rules are experimented on 430M test data and almost 94.3% of detection rate is shown.3% of detection rate is shown.

Real-time monitoring of ship's dynamic behavior characteristics by AIS (AIS에 의한 선박거동의 실시간 모니터링)

  • Lee, Dae-Jae
    • Journal of the Korean Society of Fisheries and Ocean Technology
    • /
    • v.44 no.3
    • /
    • pp.218-228
    • /
    • 2008
  • This paper describes on the real-time tracking of ship's dynamic behavior by AIS information in the coastal waters. The AIS data was received at a land station by using the antenna of AIS receiver mounted on the rooftop of the laboratory, Pukyong National University (PKNU), Busan, Korea, and stored as a NMEA format of serial output sentence of VDM(VHF Data-Link Message) and displayed on the ENC(Electronic Navigational Chart) of a PC-based ECDIS. In this study, the AIS receiver was mainly used to obtain the dynamic information that is necessary to evaluate and track the movement situation of training ship "KAYA" of PKNU in the coastal waters. The change of position with time for the ship turning under the rudder angle of port $30^{\circ}$ was correctly tracked with the turning circle of 940 m in diameter on the ENC of a PC-based ECDIS. Then, the dynamic information of the AIS system was updated every 6.29 seconds under the turning situation for the speed of 10.9 knots and every 21.65 seconds under the situation running at the speed of 11.05 knots on the straight line route of $155^{\circ}$, respectively. In case of AIS target tracking in the inshore zone behind large topographical obstructions, such as mountain and apartment buildings, the update rate of dynamic information was irregularly changed by the existence of land obstacles. However, the position tracking by AIS information under the situation existing no sea obstructions was achieved in real or near real-time and the instant presentation of course alternations for the ship was correctly monitored by using a PC-based ECDIS. From these results, we concluded that the PC-based ECDIS technology and methodology combined with the AIS information can be easily extended and applied to the surveillance and management for the fishing operation of fishing vessels in the coastal zone and in the EEZ fishing grounds.

A Adaptive Garbage Collection Policy for Flash-Memory Storage System in Embedded Systems (실시간 시스템에서의 플래시 메모리 저장 장치를 위한 적응적 가비지 컬렉션 정책)

  • Park, Song-Hwa;Lee, Jung-Hoon;Lee, Won-Oh;Kim, Hee-Earn
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.12 no.3
    • /
    • pp.121-130
    • /
    • 2017
  • NAND flash memory has advantages of non-volatility, little power consumption and fast access time. However, it suffers from inability that does not provide to update-in-place and the erase cycle is limited. Moreover, the unit of read/write operation is a page and the unit of erase operation is a block. Therefore, erase operation is slower than other operations. The AGC, the proposed garbage collection policy focuses on not only garbage collection time reduction for real-time guarantee but also wear-leveling for a flash memory lifetime. In order to achieve above goals, we define three garbage collection operating modes: Fast Mode, Smart Mode, and Wear-leveling Mode. The proposed policy decides the garbage collection mode depending on system CPU usage rate. Fast Mode selects the dirtiest block as victim block to minimize the erase operation time. However, Smart Mode selects the victim block by reflecting the invalid page number and block erase count to minimizing the erase operation time and deviation of block erase count. Wear-leveling Mode operates similar to Smart Mode and it makes groups and relocates the pages which has the similar update time. We implemented the proposed policy and measured the performance compare with the existing policies. Simulation results show that the proposed policy performs better than Cost-benefit policy with the 55% reduction in the operation time. Also, it performs better than Greedy policy with the 87% reduction in the deviation of erase count. Most of all, the proposed policy works adaptively according to the CPU usage rate, and guarantees the real-time performance of the system.

A Dual Modeling Method for a Real-Time Palpation Simulator

  • Kim, Sang-Youn;Park, Se-Kil;Park, Jin-Ah
    • Journal of Information Processing Systems
    • /
    • v.8 no.1
    • /
    • pp.55-66
    • /
    • 2012
  • This paper presents a dual modeling method that simulates the graphic and haptic behavior of a volumetric deformable object and conveys the behavior to a human operator. Although conventional modeling methods (a mass-spring model and a finite element method) are suitable for the real-time computation of an object's deformation, it is not easy to compute the haptic behavior of a volumetric deformable object with the conventional modeling method in real-time (within a 1kHz) due to a computational burden. Previously, we proposed a fast volume haptic rendering method based on the S-chain model that can compute the deformation of a volumetric non-rigid object and its haptic feedback in real-time. When the S-chain model represents the object, the haptic feeling is realistic, whereas the graphical results of the deformed shape look linear. In order to improve the graphic and haptic behavior at the same time, we propose a dual modeling framework in which a volumetric haptic model and a surface graphical model coexist. In order to inspect the graphic and haptic behavior of objects represented by the proposed dual model, experiments are conducted with volumetric objects consisting of about 20,000 nodes at a haptic update rate of 1000Hz and a graphic update rate of 30Hz. We also conduct human factor studies to show that the haptic and graphic behavior from our model is realistic. Our experiments verify that our model provides a realistic haptic and graphic feeling to users in real-time.

A 20-Year Update on the Practice of Thoracic Surgery in Canada: A Survey of the Canadian Association of Thoracic Surgeons

  • Sami Aftab Abdul;Frances Wright;Christian Finley;Sebastien Gilbert;Andrew J. E. Seely;Sudhir Sundaresan;Patrick J. Villeneuve;Donna Elizabeth Maziak
    • Journal of Chest Surgery
    • /
    • v.56 no.6
    • /
    • pp.420-430
    • /
    • 2023
  • Background: This study provides an update to a landmark 2004 report describing demographics, training, and trends in adherence to thoracic surgery practice standards in Canada. Methods: An updated questionnaire was administered to all members of the Canadian Association of Thoracic Surgeons via email (n=142, compared to n=68 in 2004). Our report incorporates internal data from Ontario Health and the Canadian Partnership Against Cancer. Results: Forty-eight surgeons completed the survey (male, 70.8%; mean±standard deviation age, 50.3±9.3 years). This represents a 33.8% response rate, compared to 64.7% in 2004. Most surgeons (69%) served a patient population of over 1 million per center; 32%-34% reported an on-call ratio of 1:4-1:5 days, and the average weekly hours worked was 56.4±11.9. Greater access to dedicated geographic units per center (73% in 2021 vs. 53% in 2004) has improved thoracic-associated services and house staff, notably endoscopy units (100% vs. 91%), with 73% of respondents having access to both endobronchial and endoscopic ultrasound. Access to thoracic radiology has also improved, particularly regarding positron emission tomography scanners per center (76.9% vs. 13%). Annual case volumes for lung (255 vs. 128), esophageal (41 vs. 19), and mediastinal resections (30 vs. 13), along with hiatal hernia repair (45 vs. 20), have increased substantially despite reports of operating room availability and radiology as rate-limiting steps. Conclusion: This survey characterizes compliance with current practice standards, addressing the needs of thoracic surgeons across Canada. Over 85% of respondents were aware of the 2004 compliance paper, and 35% had applied for resources and equipment in response.

A Distributed Power Optimization Method for CDMA Cellular Mobile Systems Using an Adaptive Search Scheme

  • Lee, Young-Dae
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.1982-1985
    • /
    • 2003
  • Future cellular networks will mainly be driven by, high quality channels, high band with utilization, low power consumption and efficient network management. For a given channel allocation, the capacity and quality of communication of cellular radio systems using CDMA(Code Division Multiple Access) can be increased by using a transmitter power control scheme to combat the near-far problem. Centralized power control schemes or distributed ones to maximize the minimum signal-to-interference in each user of CDMA wireless network have been investigated. This paper has proposed a distributed power control algorithm, which employs an adaptive search scheme, in order to solve quickly the linear systems of equations for power update in CDMA cellular radio systems. The simulation results show that the proposed scheme has faster convergence rate than the typical bang-bang type of distributed power control algorithm, which has been much used as a reference algorithm in IS-95A and W-CDMA communication network.

  • PDF