• Title/Summary/Keyword: efficient throughput

Search Result 709, Processing Time 0.028 seconds

A Combined Multiple Regression Trees Predictor for Screening Large Chemical Databases (대용량 화학 데이터 베이스를 선별하기위한 결합다중회귀나무 예측치)

  • 임용빈;이소영;정종희
    • The Korean Journal of Applied Statistics
    • /
    • v.14 no.1
    • /
    • pp.91-101
    • /
    • 2001
  • It has been shown that the multiple trees predictors are more accurate in reducing test set error than a single tree predictor. There are two ways of generating multiple trees. One is to generate modified training sets by resampling the original training set, and then construct trees. It is known that arcing algorithm is efficient. The other is to perturb randomly the working split at each node from a list of best splits, which is expected to generate reasonably good trees for the original training set. We propose a new combined multiple regression trees predictor which uses the latter multiple regression tree predictor as a predictor based on a modified training set at each stage of arcing. The efficiency of those prediction methods are compared by applying to high throughput screening of chemical compounds for biological effects.

  • PDF

An Improved DSA Strategy based on Triple-States Reward Function (Triple-state 보상 함수를 기반으로 한 개선된 DSA 기법)

  • Ahmed, Tasmia;Gu, Jun-Rong;Jang, Sung-Jeen;Kim, Jae-Moung
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.11
    • /
    • pp.59-68
    • /
    • 2010
  • In this paper, we present a new method to complete Dynamic Spectrum Access by modifying the reward function. Partially Observable Markov Decision Process (POMDP) is an eligible algorithm to predict the upcoming spectrum opportunity. In POMDP, Reward function is the last portion and very important for prediction. However, the Reward function has only two states (Busy and Idle). When collision happens in the channel, reward function indicates busy state which is responsible for the throughput decreasing of secondary user. In this paper, we focus the difference between busy and collision state. We have proposed a new algorithm for reward function that indicates an additional state of collision which brings better communication opportunity for secondary users. Secondary users properly utilize opportunities to access Primary User channels for efficient data transmission with the help of the new reward function. We have derived mathematical belief vector of the new algorithm as well. Simulation results have corroborated the superior performance of improved reward function. The new algorithm has increased the throughput for secondary user in cognitive radio network.

Cost-Effective Deployment and Operation of the IEEE802.16j based WiBro MMR Network (IEEE802.16j 기반 WiBro MMR 네트워크의 효율적 구축 및 운용에 관한 연구)

  • Ryu, Seungwan;Choi, Go-Bong;Myung, Kwangsik;Park, Seikwon;Cho, Choong-Ho;Lee, Hyong-Woo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.34 no.2
    • /
    • pp.223-234
    • /
    • 2008
  • Mobile multi-hop relaying (MMR) technology is being considered as a promising solution capable to enhance coverage, user throughput, and system capacity of the current wired backbone dependent wireless access networks. Since the relaying nodes do not need a wired backbone access, MMR technology offers easy and low-cost deployment, flexible cell planning, and adaptive traffic handling performance. In this paper, we investigate performance and cost effectiveness of the MMR technology deployment in the IEEE802.16j based WiBro/WiMAX systems. We first introduce standardization activities and research issues of MMR WiBro/ WiMAX systems. Since the coverage extension problem may occur in metropolitan areas as well as suburban or rural areas where user density is relatively low or moderate, we introduce several MMR topologies and analyze cost-effectiveness of MMR based coverage extension with respect to the user traffic density. Then, we argue cost effect on MMR technology deployment and throughput performance, Finally, we introduce further study issues including sectorized base station based MMR deployment approaches and the single and multi-frame structure MMR approaches.

An Efficient Cluster Routing Protocol Based on 2-level Tree for Wireless Ad Hoc Networks (무선 애드 혹 네트워크에서 에너지 효율적인 2-level 트리 기반의 클러스터 라우팅 프로토콜)

  • Lee, Young Joon;Kim, Sung Chun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.5
    • /
    • pp.155-162
    • /
    • 2014
  • We proposed a 2 level tree based cluster based routing protocol for mobile ad hoc networks. it is our crucial goal to establish improved clustering's structure in order to extend average node life-time and elevate the average packet delivery ratio. Because of insufficient wireless resources and energy, the method to form and manage clusters is useful for increasing network stability. but cluster-head fulfills roles as a host and a router in clustering protocol of Ad hoc networks environment. Therefore energy exhaustion of cluster-head causes communication interruption phenomenon. Effective management of cluster-head is key-point which determines the entire network performance. The scheme focuses on improving the performance the life time of the network and throughput through the management of cluster-heads and its neighbor nodes. In simulation, we demonstrated that it would obtain averagely better 17% performance than LS2RP.

A multi-radio sink node designed for wireless SHM applications

  • Yuan, Shenfang;Wang, Zilong;Qiu, Lei;Wang, Yang;Liu, Menglong
    • Smart Structures and Systems
    • /
    • v.11 no.3
    • /
    • pp.261-282
    • /
    • 2013
  • Structural health monitoring (SHM) is an application area of Wireless Sensor Networks (WSNs) which usually needs high data communication rate to transfer a large amount of monitoring data. Traditional sink node can only process data from one communication channel at the same time because of the single radio chip structure. The sink node constitutes a bottleneck for constructing a high data rate SHM application giving rise to a long data transfer time. Multi-channel communication has been proved to be an efficient method to improve the data throughput by enabling parallel transmissions among different frequency channels. This paper proposes an 8-radio integrated sink node design method based on Field Programmable Gate Array (FPGA) and the time synchronization mechanism for the multi-channel network based on the proposed sink node. Three experiments have been performed to evaluate the data transfer ability of the developed multi-radio sink node and the performance of the time synchronization mechanism. A high data throughput of 1020Kbps of the developed sink node has been proved by experiments using IEEE.805.15.4.

Performance Modeling and Evaluation of IEEE 802.15.4 Collision Free Period for Batch Traffic (배치 트래픽 특성을 고려한 IEEE 802.15.4 비경합구간 성능 모델링 및 평가)

  • Kim, Tae-Suk;Choi, Duke Hyun
    • The Journal of the Korea Contents Association
    • /
    • v.16 no.11
    • /
    • pp.83-90
    • /
    • 2016
  • In this paper, we performed the analysis of transmission performance for Collision Free Period(CFP) supported by the low-power communication technology, IEEE 802.15.4 MAC (Media Access Control). For the analysis, periodic traffic, original service target of CFP, is considered and, according to the Quality of Service required, packet arrival pattern to MAC layer is categorized as batch and non-batch, and analysis on throughput, delay, and energy is performed for those patterns. On the basis of the obtained analysis, performance comparison with Collision Avoidance Period(CAP) is carried out for the health care applications that generate periodic traffic such as Pedometer, ECG, EMG. The evaluation confirms that CFP is more energy efficient for healthcare applications that generate periodic and time-critical traffic and moreover for the application with high bandwidth requirement CFP achieves up to 46% energy savings compared to CAP.

Adaptive Upstream Backup Scheme based on Throughput Rate in Distributed Spatial Data Stream System (분산 공간 데이터 스트림 시스템에서 연산 처리율 기반의 적응적 업스트림 백업 기법)

  • Jeong, Weonil
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.10
    • /
    • pp.5156-5161
    • /
    • 2013
  • In distributed spatial data stream processing, processed tuples of downstream nodes are replicated to the upstream node in order to increase the utilization of distributed nodes and to recover the whole system for the case of system failure. However, while the data input rate increases and multiple downstream nodes share the operation result of the upstream node, the data which stores to output queues as a backup can be lost since the deletion operation delay may be occurred by the delay of the tuple processing of upstream node. In this paper, the adaptive upstream backup scheme based on operation throughput in distributed spatial data stream system is proposed. This method can cut down the average load rate of nodes by efficient spatial operation migration as it processes spatial temporal data stream, and it can minimize the data loss by fluid change of backup mode. The experiments show the proposed approach can prevent data loss and can decrease, on average, 20% of CPU utilization by node monitoring.

Predicted Optimum Efficiency due to Changes in the Design Parameters of the Small Electrostatic Precipitator (설계인자 변화에 따른 소형 전기집진장치의 최적효율 예측)

  • Suh, Jeong-Min;Yi, Pyong-In;Jung, Moon-Sub;Park, Jeong-Ho;Lim, Woo-Taik;Park, Chool-Jae;Choi, Kum-Chan
    • Journal of Environmental Science International
    • /
    • v.22 no.9
    • /
    • pp.1187-1197
    • /
    • 2013
  • The result of a small electrostatic precipitator which is in order to decrease indoor air pollution for optimal efficiency was shown as follows. Although the closer distance between the discharge electrode and dust collecting electrode shows the better throughput efficiency by forming strong electrostatic Field, it does not have profound impact in case of optimal dust collecting area. G.P(gas passage) which is the distance from dust collecting electrode to dust collecting electrode is a crucial factor to decide dust collecting efficiency. The narrower distance of G.P shows the better throughput efficiency whereas it decreases when the distance is too narrow since sparks ensue by increasing the capacity of electrostatic charging system 5 mm regards as optimal efficiency in this experiment. Although the higher voltage shows the higher dust collecting efficiency overall, the experiment was not able to keep performing since the sparks which decrease dust collecting efficiency ensue over 40 kV. The efficient and safe voltage state is considered 3.6 kV in this experiment. The most crucial factor for dust collecting efficiency of an electrostatic precipitator which is in order to decrease indoor air pollution is applied voltage. In addition, optimal raw gas flow rate(2.4 m/sec) is more important factor than the excessive increase of dust collecting area.

A Congestion release Advertisement Method to Improve the IEEE 802.17 Resilient Packet Ring (체증해제 통보에 방식에 의한 IEEE 802.17 레질런트 패킷 링의 성능개선 연구)

  • Kim Tae-joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.9B
    • /
    • pp.581-590
    • /
    • 2005
  • The IEEE 802.17 Resilient Packet Ring Working Group develops standards to support the development and deployment of Resilient Packet Ring networks in Local, Metropolitan, and Wide Area Networks for resilient and efficient transfer of data Packets at rates scalable to many gigabits Per second. It was known that the fairness algorithm of the IEEE 802.17 Resilient Packet Ring suffers from throughput degradation under an unbalanced overload. This Paper proposes a congestion release advertisement method to improve this throughput degradation and discusses its performance. Under the proposed method, a congested node decides whether its congestion is released or not. If released, it advertises the congestion release to upstream nodes, and then upstream nodes transmit their traffic without uy regulation. The proposed method is compatible with the legacy fairness algorithm.

Sphere Decoding Algorithm and VLSI Implementation Using Two-Level Search (2 레벨 탐색을 이용한 스피어 디코딩 알고리즘과 VLSI 구현)

  • Huynh, Tronganh;Cho, Jong-Min;Kim, Jin-Sang;Cho, Won-Kyung
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.45 no.6
    • /
    • pp.104-110
    • /
    • 2008
  • In this paper, a novel 2-level-search sphere decoding algorithm for multiple-input multiple-output (MIMO) detection and its VLSI implementation are presented. The proposed algorithm extends the search space by concurrently performing symbol detection on 2 level of the tree search. Therefore, the possibility of discarding good candidates can be avoided. Simulation results demonstrate the good performance of the proposed algorithm in terms of bit-error-rate (BER). From the proposed algorithm, an efficient very large scale integration (VLSI) architecture which incorporates low-complexity and fixed throughput features is proposed. The proposed architecture supports many modulation techniques such as BPSK, QPSK, 16-QAM and 64-QAM. The sorting block, which occupies a large portion of hardware utilization, is shared for different operating modes to reduce the area. The proposed hardware implementation results show the improvement in terms of area and BER performance compared with existing architectures.