• Title/Summary/Keyword: real-time mechanism

Search Result 1,052, Processing Time 0.024 seconds

An Effective Malware Detection Mechanism in Android Environment (안드로이드 환경에서의 효과적인 악성코드 탐지 메커니즘)

  • Kim, Eui Tak;Ryu, Keun Ho
    • The Journal of the Korea Contents Association
    • /
    • v.18 no.4
    • /
    • pp.305-313
    • /
    • 2018
  • With the explosive growth of smart phones and efficiency, the Android of an open mobile operating system is gradually increasing in the use and the availability. Android systems has proven its availability and stability in the mobile devices, the home appliances's operating systems, the IoT products, and the mechatronics. However, as the usability increases, the malicious code based on Android also increases exponentially. Unlike ordinary PCs, if malicious codes are infiltrated into mobile products, mobile devices can not be used as a lock and can be leaked a large number of personal contacts, and can be lead to unnecessary billing, and can be cause a huge loss of financial services. Therefore, we proposed a method to detect and delete malicious files in real time in order to solve this problem. In this paper, we also designed a method to detect and delete malicious codes in a more effective manner through the process of installing Android-based applications and signature-based malicious code detection method. The method we proposed and designed can effectively detect malicious code in a limited resource environment, such as mobile environments.

Influence of Ribosomal Protein L39-L in the Drug Resistance Mechanisms of Lacrimal Gland Adenoid Cystic Carcinoma Cells

  • Ye, Qing;Ding, Shao-Feng;Wang, Zhi-An;Feng, Jie;Tan, Wen-Bin
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.15 no.12
    • /
    • pp.4995-5000
    • /
    • 2014
  • Background: Cancer constitutes a key pressure on public health regardless of the economy state in different countries. As a kind of highly malignant epithelial tumor, lacrimal gland adenoid cystic carcinoma can occur in any part of the body, such as salivary gland, submandibular gland, trachea, lung, breast, skin and lacrimal gland. Chemotherapy is one of the key treatment techniques, but drug resistance, especially MDR, seriously blunts its effects. As an element of the 60S large ribosomal subunit, the ribosomal protein L39-L gene appears to be documented specifically in the human testis and many human cancer samples of different origins. Materials and Methods: Total RNA of cultured drug-resistant and susceptible lacrimal gland adenoid cystic carcinoma cells was seperated, and real time quantitative RT-PCR were used to reveal transcription differences between amycin resistant and susceptible strains of lacrimal gland adenoid cystic carcinoma cells. Viability assays were used to present the amycin resistance difference in a RPL39-L transfected lacrimal gland adenoid cystic carcinoma cell line as compared to control vector and null-transfected lacrimal gland adenoid cystic carcinoma cell lines. Results: The ribosomal protein L39-L transcription level was 6.5-fold higher in the drug-resistant human lacrimal gland adenoid cystic carcinoma cell line than in the susceptible cell line by quantitative RT-PCR analysis. The ribosomal protein L39-L transfected cells revealed enhanced drug resistance compared to plasmid vector-transfected or null-transfected cells as determined by methyl tritiated thymidine (3H-TdR) incorporation. Conclusions: The ribosomal protein L39-L gene could possibly have influence on the drug resistance mechanism of lacrimal gland adenoid cystic carcinoma cells.

Enhancements of the Modified PCF in IEEE 802.11 WLANs

  • Kanjanavapastit Apichan;Landfeldt Bjorn
    • Journal of Communications and Networks
    • /
    • v.7 no.3
    • /
    • pp.313-324
    • /
    • 2005
  • The success of the IEEE 802.11 standard has prompted research into efficiency of the different medium access methods and their support for different traffic types. A modified version of the point coordination function (PCF) called modified PCF has been introduced as a way to improve the efficiency over the standard method. It has been shown through a simulation study and a mathematical analysis that channel utilization can be much improved compared to the standard, in case there is no so-called hidden station problem. However, under the hidden station problem, the efficiency of the modified PCF would obviously decrease. In this paper, some enhancements of the modified PCF are introduced. Firstly, we propose a retransmission process to allow frames involved in collisions to be retransmitted. Then, we propose a collision resolution mechanism to reduce the frame collision probability due to the hidden station problem. In addition, we propose a priority scheme to support prioritization for different traffic types such as interactive voice and video, and real-time data traffic in the modified PCF. To prevent the starvation of one low priority traffic, minimum transmission period is also guaranteed to each traffic type via an admission control algorithm. We study the performance of the modified PCF under the hidden station problem and the performance of the modified PCF with priority scheme through simulations. To illustrate the efficiency of the priority scheme, we therefore compare its simulation results with those of some standardized protocols: The distributed coordination function (DCF), the enhanced distributed channel access (EDCA), the PCF, and our previously proposed protocol: The modified PCF without priority scheme. The simulation results show that the increment of delay in the network due to the hidden station problem can be reduced using the proposed collision resolution mechanism. In addition, in a given scenario the modified PCF with priority scheme can provide better quality of service (QoS) support to different traffic types and also support a higher number of data stations than the previous proposals.

Flexible, Extensible, and Efficient VANET Authentication

  • Studer, Ahren;Bai, Fan;Bellur, Bhargav;Perrig, Adrian
    • Journal of Communications and Networks
    • /
    • v.11 no.6
    • /
    • pp.574-588
    • /
    • 2009
  • Although much research has been conducted in the area of authentication in wireless networks, vehicular ad-hoc networks (VANETs) pose unique challenges, such as real-time constraints, processing limitations, memory constraints, frequently changing senders, requirements for interoperability with existing standards, extensibility and flexibility for future requirements, etc. No currently proposed technique addresses all of the requirements for message and entity authentication in VANETs. After analyzing the requirements for viable VANET message authentication, we propose a modified version of TESLA, TESLA++, which provides the same computationally efficient broadcast authentication as TESLA with reduced memory requirements. To address the range of needs within VANETs we propose a new hybrid authentication mechanism, VANET authentication using signatures and TESLA++ (VAST), that combines the advantages of ECDSA signatures and TESLA++. Elliptic curve digital signature algorithm (ECDSA) signatures provide fast authentication and non-repudiation, but are computationally expensive. TESLA++ prevents memory and computation-based denial of service attacks. We analyze the security of our mechanism and simulate VAST in realistic highway conditions under varying network and vehicular traffic scenarios. Simulation results show that VAST outperforms either signatures or TESLA on its own. Even under heavy loads VAST is able to authenticate 100% of the received messages within 107ms. VANETs use certificates to achieve entity authentication (i.e., validate senders). To reduce certificate bandwidth usage, we use Hu et al.'s strategy of broadcasting certificates at fixed intervals, independent of the arrival of new entities. We propose a new certificate verification strategy that prevents denial of service attacks while requiring zero additional sender overhead. Our analysis shows that these solutions introduce a small delay, but still allow drivers in a worst case scenario over 3 seconds to respond to a dangerous situation.

Ductility and ductility reduction factor for MDOF systems

  • Reyes-Salazar, Alfredo
    • Structural Engineering and Mechanics
    • /
    • v.13 no.4
    • /
    • pp.369-385
    • /
    • 2002
  • Ductility capacity is comprehensively studied for steel moment-resisting frames. Local, story and global ductility are being considered. An appropriate measure of global ductility is suggested. A time domain nonlinear seismic response algorithm is used to evaluate several definitions of ductility. It is observed that for one-story structures, resembling a single degree of freedom (SDOF) system, all definitions of global ductility seem to give reasonable values. However, for complex structures it may give unreasonable values. It indicates that using SDOF systems to estimate the ductility capacity may be a very crude approximation. For multi degree of freedom (MDOF) systems some definitions may not be appropriate, even though they are used in the profession. Results also indicate that the structural global ductility of 4, commonly used for moment-resisting steel frames, cannot be justified based on this study. The ductility of MDOF structural systems and the corresponding equivalent SDOF systems is studied. The global ductility values are very different for the two representations. The ductility reduction factor $F_{\mu}$ is also estimated. For a given frame, the values of the $F_{\mu}$ parameter significantly vary from one earthquake to another, even though the maximum deformation in terms of the interstory displacement is roughly the same for all earthquakes. This is because the $F_{\mu}$ values depend on the amount of dissipated energy, which in turn depends on the plastic mechanism, formed in the frames as well as on the loading, unloading and reloading process at plastic hinges. Based on the results of this study, the Newmark and Hall procedure to relate the ductility reduction factor and the ductility parameter cannot be justified. The reason for this is that SDOF systems were used to model real frames in these studies. Higher mode effects were neglected and energy dissipation was not explicitly considered. In addition, it is not possible to observe the formation of a collapse mechanism in the equivalent SDOF systems. Therefore, the ductility parameter and the force reduction factor should be estimated by using the MDOF representation.

Mechanism of Fatty Acid Synthase in Drug Tolerance Related to Epithelial-mesenchymal Transition of Breast Cancer

  • Li, Jun-Qin;Xue, Hui;Zhou, Lan;Dong, Li-Hua;Wei, Da-Peng;Li, Hua
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.15 no.18
    • /
    • pp.7617-7623
    • /
    • 2014
  • Objective: The mechanism of action of fatty acid synthase (FASN) in drug tolerance of breast cancer cells with epithelial-mesenchymal transition (EMT) features was investigated. Methods: The breast cancer cell line MCF-7-MEK5 with stably occurring EMT and tumour necrosis factor-${\alpha}$ (TNF-${\alpha}$) tolerance was used as the experimental model, whereas MCF-7 acted as the control. Tumour cells were implanted into nude mice for in vivo analysis, and cerulenin was used as a FASN inhibitor. RT-PCR, real-time quantitative PCR and Western blot were employed to detect the expression of FASN, TNFR-1, TNFR-2, Wnt-1, ${\beta}$-catenin and cytC at the RNA and protein levels. Results: Compared with MCF-7, TNFR-1 expression in MCF-7-MEK5 was slightly changed, TNFR-2 was decreased, and FASN, Wnt-1, ${\beta}$-catenin and cytC were increased. The expression of Wnt-1 and ${\beta}$-catenin in MCF-7-MEK5 decreased after cerulenin treatment, whereas cytC expression increased. Conclusions: The important function of FASN in the drug tolerance of breast cancer may be due to the following mechanisms: FASN downregulated TNFR-2 expression through lipid rafts to make the cells less sensitive to TNF-${\alpha}$, and simultaneously activated the Wnt-$1/{\beta}$-catenin signalling pathway. Thus, cytC expression increased, which provided cells with anti-apoptotic capacity and induced drug tolerance.

A Monitoring System based on Layered Architecture (계층형 구조를 기반으로 한 모니터링 시스템)

  • Kwon Sung-Ju;Choi Jae-Young;Lee Ji-Soo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.7
    • /
    • pp.440-447
    • /
    • 2006
  • Grid computing is the complex deployments of various hardware and software components. The Grid environment should provide a mechanism for real-time monitoring and notification. It is very important to implement a monitoring mechanism in the Grid environment. Most existing monitoring systems only focus on their own requirements. With the development of Grid computing technology, the extensible monitoring systems become more and more feasible and popular. In this paper, we describe our research and development works on M-Mon, a novel framework for the flexible and adaptive Grid monitoring system. M-Mon system focuses on some critical issues like scalability, reusability, runtime extensibility, protocol transparency and uniform data representation. To provide interoperability with other monitoring systems and to reuse legacy facilities with a minimum effort, our monitoring system has been developed using service-oriented architecture.

Reusing Technique of Primitive Motions for Effective Implementation of Complex Action (복합적 행동들을 효율적으로 구현하기 위한 기본 동작의 재활용 기법)

  • Choi, Jun-Seong;Park, Jong-Hee
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.9
    • /
    • pp.1-13
    • /
    • 2014
  • Apart from the physical realism, the implementation of various physical actions of an agent to respond to dynamically changing situations is essential for the design of an agent in a cyber world. To achieve a maximum diversity in actions, we develop a mechanism that allows composite actions to be constructed by reusing a set of primitive motions and enables an agent to instantly react to changes in the ambient states. Specifically we model an agent's body in terms of joints, and a primitive or composite motion is performed in a real time. To implement this mechanism, we produce an animation for basic joint movements and develop a method to construct overall motions out of the primitive motions. These motions can be assembled into a plan by which an agent can achieve a goal. In this manner, diverse actions can be implemented without excessive efforts. This approach has conspicuous advantages when constructing a parallel action, e.g., eating while walking, that is, two or more parallel actions can be naturally merged into a parallel action according to their priority. We implement several composite and parallel actions to demonstrate the viability of our approach.

A Study on MPLS OAM Functions for Fast LSP Restoration on MPLS Network (MPLS 망에서의 신속한 LSP 복구를 위한 MPLS OAM 기능 연구)

  • 신해준;임은혁;장재준;김영탁
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.7C
    • /
    • pp.677-684
    • /
    • 2002
  • Today's Internet does not have efficient traffic engineering mechanism to support QoS for the explosive increasing internet traffic such as various multimedia traffic. This functional shortage degrades prominently the quality of service, and makes it difficult to provide multi-media service and real-time service. Various technologies are under developed to solve these problems. IETF (Internet Engineering Task Force) developed the MPLS (Multi-Protocol Label Switching) technology that provides a good capabilities of traffic engineering and is independent layer 2 protocol, so MPLS is expected to be used in the Internet backbone network$\^$[1][2]/. The faults occurring in high-speed network such as MPLS, may cause massive data loss and degrade quality of service. So fast network restoration function is essential requirement. Because MPLS is independent to layer 2 protocol, the fault detection and reporting mechanism for restoration should also be independent to layer 2 protocol. In this paper, we present the experimental results of the MPLS OAM function for the performance monitoring and fault detection 'll'&'ll' notification, localization in MPLS network, based on the OPNET network simulator

A TCP-Friendly Congestion Control Scheme using Hybrid Approach for Reduction of Transmission Delay for Real-Time Video Stream (실시간 비디오 스트림의 전송지연 축소를 위한 TCP 친화적 하이브리드 혼잡제어 기법)

  • 김형진;조정현;나인호
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.2
    • /
    • pp.304-309
    • /
    • 2004
  • Recently, the needs for multimedia stream such as digital audio and video in the Internet has increased tremendously. Unlike TCP, the UDP protocol, which has been used to transmit streaming traffic thorough the Internet, does not apply any congestion control mechanism to regulate the data flow thorough the shared network And it leads to congestion collapse of the Internet and results in long-term transmission delay. To avoid any adverse effect on the current Internet functionality, a now protocol of modification or addition of some functionality to perform congestion control and to reduce huge transmission delay in transmitting of multimedia stream are in study. TCP-friendly congestion control mechanism is classified into two : one is window-based congestion control scheme using general window management functionalities, the other is rate-based congestion control scheme using TCP modeling equation. In this paper, we propose an algorithm for improving the transmitting rate on a hybrid TCP-friendly congestion control scheme combined with widow-based and late-based congestion control for multimedia stream. And we also simulate the performance of improved TEAR implementation using NS. With He simulation results, we show that the improved TEAR can provide better fairness and lower rate fluctuations than TCP.