• Title/Summary/Keyword: Bit node

Search Result 201, Processing Time 0.028 seconds

Current Drugs and Drug Targets in Non-Small Cell Lung Cancer: Limitations and Opportunities

  • Daga, Aditi;Ansari, Afzal;Patel, Shanaya;Mirza, Sheefa;Rawal, Rakesh;Umrania, Valentina
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.16 no.10
    • /
    • pp.4147-4156
    • /
    • 2015
  • Lung cancer is a serious health problem and leading cause of death worldwide due to its high incidence and mortality. More than 80% of lung cancers feature a non-small cell histology. Over few decades, systemic chemotherapy and surgery are the only treatment options in this type of tumor but due to their limited efficacy and overall poor survival of patients, there is an urge to develop newer therapeutic strategies which circumvent the problems. Enhanced knowledge of translational science and molecular biology have revealed that lung tumors carry diverse driver gene mutations and adopt different intracellular pathways leading to carcinogenesis. Hence, the development of targeted agents against molecular subgroups harboring critical mutations is an attractive approach for therapeutic treatment. Targeted therapies are clearly more preferred nowadays over systemic therapies because they target tumor specific molecules resulting with enhanced activity and reduced toxicity to normal tissues. Thus, this review encompasses comprehensive updates on targeted therapies for the driver mutations in non-small cell lung cancer (NSCLC) and the potential challenges of acquired drug resistance faced i n the field of targeted therapy along with the imminent newer treatment modalities against lung cancer.

Performance Evaluation of Wireless Network based on Mobile Multi-hop (모바일 다중 홉 기반의 무선 네트워크의 성능 평가)

  • Roh, Jae-Sung;Kim, Wan-Tae
    • Journal of Advanced Navigation Technology
    • /
    • v.12 no.6
    • /
    • pp.634-639
    • /
    • 2008
  • In mobile communication networks, the main power consumption is due to the actual transmissions power. Therefore, power efficiency network structures have gained considerable importance in mobile multi-hop systems and networks in recent years. In this paper, the performance of mobile multi-hop wireless system with M-QAM signal and forward error control (FEC) technique are analyzed The FEC technique uses extra processing power related to encoding and decoding, it is need complex functions to be built into the communication node. The probability of receiving a correct bit and codeword for relaying a data frame over h hop relay station to the final station is evaluated as a function of channel parameter and number of hops, and the distance between the different station.

  • PDF

Global Healthcare Information System

  • Singh, Dhananjay;Lee, Hoon-Jae;Chung, Wan-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.10a
    • /
    • pp.365-368
    • /
    • 2008
  • This paper presents a new concept of IP-based wireless sensor networks and also introduces a routing protocol that is based on clustering for global healthcare information system. Low-power wireless personal area networks (LoWPANs) conform the standard by IEEE 802.15.4-2003 to IPv6 that makes 6lowpan. It characterized by low bit rate, low power, and low cost as well as protocol for wireless connections. The 6lowpan node with biomedical sensor devices fixed on the patient body area network that should be connected to the gateway in personal area network. Each 6lowpan nodes have IP-addresses that would be directly connected to the internet. With the help of IP-address service provider can recognize or analysis patient biomedical data from anywhere on globe by internet service provider equipments such as cell phone, PDA, note book. The system has been evaluated by technical verification, clinical test, user survey and current status of patient. We used NS-2.33 simulator for our prototype and also simulate the routing protocols. The result shows the performance of biomedical data packets in multi-hope routing as well as represents the topology of the networks.

  • PDF

A Relay Selection and Power Allocation Scheme for Cooperative Wireless Sensor Networks

  • Qian, Mujun;Liu, Chen;Fu, Youhua;Zhu, Weiping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.4
    • /
    • pp.1390-1405
    • /
    • 2014
  • This paper investigates optimal relay selection and power allocation under an aggregate power constraint for cooperative wireless sensor networks assisted by amplify-and-forward relay nodes. By considering both transmission power and circuit power consumptions, the received signal-to-noise ratio (SNR) at the destination node is calculated, based on which, a relay selection and power allocation scheme is developed. The core idea is to adaptively adjust the selected relays and their transmission power to maximize the received SNR according to the channel state information. The proposed scheme is derived by recasting the optimization problem into a three-layered problem-determining the number of relays to be activated, selecting the active relays, and performing power allocation among the selected relays. Monte Carlo simulation results demonstrate that the proposed scheme provides a higher received SNR and a lower bit error rate as compared to the average power allocation scheme.

Self-Updating One-Time Password Mutual Authentication Protocol for Ad Hoc Network

  • Xu, Feng;Lv, Xin;Zhou, Qi;Liu, Xuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.5
    • /
    • pp.1817-1827
    • /
    • 2014
  • As a new type of wireless network, Ad hoc network does not depend on any pre-founded infrastructure, and it has no centralized control unit. The computation and transmission capability of each node are limited. In this paper, a self-updating one-time password mutual authentication protocol for Ad hoc network is proposed. The most significant feature is that a hash chain can update by itself smoothly and securely through capturing the secure bit of the tip. The updating process does not need any additional protocol or re-initialization process and can be continued indefinitely to give rise to an infinite length hash chain, that is, the times of authentication is unlimited without reconstructing a new hash chain. Besides, two random variable are added into the messages interacted during the mutual authentication, enabling the protocol to resist man-in-the-middle attack. Also, the user's identity information is introduced into the seed of hash chain, so the scheme achieves anonymity and traceability at the same time.

The Effects of Organic Contamination and Surface Roughness on Cylindrical Capacitors of DRAM during Wet Cleaning Process

  • Ahn, Young-Ki;Ahn, Duk-Min;Yang, Ji-Chul;Kulkarni, Atul;Choi, Hoo-Mi;Kim, Tae-Sung
    • Journal of the Semiconductor & Display Technology
    • /
    • v.10 no.3
    • /
    • pp.15-19
    • /
    • 2011
  • The performance of the DRAM is strongly dependent on the purity and surface roughness of the TIT (TiN/Insulator/ TiN) capacitor electrodes. Hence, in the present study, we evaluate the effects of organic contamination and change of surface roughness on the cylindrical TIT capacitor electrodes during the wet cleaning process by various analytical techniques such as TDMS, AFM, XRD and V-SEM. Once the sacrificial oxide and PR (Photo Resist) are removed by HF, the organic contamination and surface oxide films on the bottom Ti/TiN electrode become visible. With prolonged HF process, the surface roughness of the electrode is increased, whereas the amount of oxidized Ti/TiN is reduced due to the HF chemicals. In the 80nm DRAM device fabrication, the organic contamination of the cylindrical TIT capacitor may cause defects like SBD (Storage node Bridge Defect). The SBD fail bit portion is increased as the surface roughness is increased by HF chemicals reactions.

Parallel Paths in Folded Hyper-Star Graph (Folded 하이퍼-스타 그래프의 병렬 경로)

  • Lee, Hyeong-Ok;Choi, Jung;Park, Seung-Bae;Cho, Chung-Ho;Lim, Hyeong-Seok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.7
    • /
    • pp.1756-1769
    • /
    • 1999
  • Parallel paths in an interconnection network have some significance in that message transmission time can be reduced because message is divided into packets and transmitted in parallel through several paths, and also an whose nodes has 2n binary bit string, is an interconnection network which has a lower network cost than hypercube and its variation. In this paper, we analyze node disjoint parallel path in Folded Hyper-Star graph FHS(2n,n) proposed as the topology of parallel computers and, using the result, prove that the fault diameter of a Folded Hyper-Star graph FHS(2n,n) is 2n-1.

  • PDF

An Efficient Addressing Scheme Using (x, y) Coordinates in Environments of Smart Grid (스마트 그리드 환경에서 (x, y) 좌표값을 이용한 효율적인 주소 할당 방법)

  • Cho, Yang-Hyun;Lim, Song-Bin;Kim, Gyung-Mok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.1
    • /
    • pp.61-69
    • /
    • 2012
  • Smart Grid is the next-generation intelligent power grid that maximizes energy efficiency with the convergence of IT technologies and the existing power grid. Smart Grid is created solution for standardization and interoperability. Smart Grid industry enables consumers to check power rates in real time for active power consumption. It also enables suppliers to measure their expected power generation load, which stabilizes the operation of the power system. Smart industy was ecolved actively cause Wireless communication is being considered for AMI system and wireless communication using ZigBee sensor has been applied in various industly. In this paper, we proposed efficient addressing scheme for improving the performance of the routing algorithm using ZigBee in Smart Grid environment. A distributed address allocation scheme used an existing algorithm has wasted address space. Therefore proposing x, y coordinate axes from divide address space of 16 bit to solve this problem. Each node was reduced not only bitwise but also multi hop using the coordinate axes while routing than Cskip algorithm. I compared the performance between the standard and the proposed mechanism through the numerical analysis. Simulation verify performance about decrease averaging multi hop count that compare proposing algorithm and another. The numerical analysis results show that proposed algorithm reduce multi hop than ZigBee distributed address assignment and another.

$M^2$ MAC: MAC protocol for Real Time Robot Control System based on Underwater Acoustic Communication ($M^2$ MAC(Message Merging): 수중음파통신 기반의 실시간 로봇 제어 시스템을 위한 MAC 프로토콜)

  • Kim, Yung-Pyo;Park, Soo-Hyun
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.6
    • /
    • pp.88-96
    • /
    • 2011
  • Underwater acoustic communication is applicable in various areas, such as ocean data collection, undersea exploration and development, tactical surveillance, etc. Thus, robot control system construction used for underwater-robot like AUV or ROV is essential in these areas. In this paper, we propose the Message Merging MAC($M^2$-MAC) protocol, which is suitable for real time robot control system, considering energy efficiency in important parts of underwater acoustic sensor network constitution. In this proposed MAC protocol, gateway node receives the data from robot nodes according to the time slots that were allotted previously. And messages delivered from base-station are generated to one MAC frame by buffering process. Finally, generated MAC frames are broadcasted to all robot nodes in the cluster. Our suggested MAC protocol can also be hybrid MAC protocol, which is successful blend of contention based and contention-free based protocol through relevant procedure with Maintenance&Sleep (M&S) period, when new nodes join and leave as an orphan. We propose mathematical analysis model concerned about End-to-End delay and energy consumption, which is important factor in constructing real-time robot control system. We also verify the excellence of performance according to comparison of existing MAC protocols with our scheme.

Development and Performance Study of a Zero-Copy File Transfer Mechanism for Ink-based PC Cluster Systems (VIA 기반 PC 클러스터 시스템을 위한 무복사 파일 전송 메커니즘의 개발 및 성능분석)

  • Park Sejin;Chung Sang-Hwa;Choi Bong-Sik;Kim Sang-Moon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.11_12
    • /
    • pp.557-565
    • /
    • 2005
  • This paper presents the development and implementation of a zero-copy file transfer mechanism that improves the efficiency of file transfers for PC cluster systems using hardware-based VIA(Virtual Interface Architecture) network adapters. VIA is one of the representative user-level communication interfaces, but because there is no library for file transfer, one copy occurs between kernel buffer and user boilers. Our mechanism presents a file transfer primitive that does not require the file system to be modified and allows the NIC to transfer data from the kernel buffer to the remote node directly without copying. To do this, we have developed a hardware-based VIA network adapter, which supports the PCI 64bit/66MHz bus and Gigabit Ethernet, as a NIC, and implemented a zero-copy file transfer mechanism. The experimental results show that the overhead of data coy and context switching in the sender is greatly reduced and the CPU utilization of the sender is reduced to $30\%\~40\%$ of the VIA send/receive mechanism. We demonstrate the performance of the zero-copy file transfer mechanism experimentally. and compare the results with those from existing file transfer mechanisms.