• Biotechnology and Bioprocess Engineering:BBE
• /
• v.7 no.3
• /
• pp.178-184
• /
• 2002

High-throughput screening has become a popular method used to identify new “leads”for potentially therapeutic compounds. Further screening of these lead compounds is typically done with secondary assays which may utilize living, functioning cells as screening tools. A problem (or benefit) with these cell-based assays is that living cells are very sensitive to their environment. We have been interested in the process of stem cell migration and how it relates to the cellular therapy of bone marrow transplantation. In this study we describe a secondary, cell-based assay for screening the effects of various in-vitro conditions on Immature Hematopoietic Cell (IHC) migration. Our results have revealed many subtle factors, such as the cell's adhesive characteristics, or the effect of a culture's growth phase, that need to be accounted for in a screening protocol. Finally, we show that exponentially glowing KG1a cells (a human IHC cell line) were 10 times more motile than those in the lag or stationary phases. These data strongly suggest that KG1a cells secrete a chemokinetic factor during the exponential growth phase of a culture.

• Journal of Microbiology and Biotechnology
• /
• v.21 no.1
• /
• pp.37-42
• /
• 2011

A new versatile acrylonitrile-bioconverting strain isolated from a petroleum-contaminated sludge sample and identified as Rhodococcus ruber AKSH-84 was used for optimization of medium and biotransformation conditions for nitrilase activity to produce acrylic acid. A simple and rapid HPLC protocol was optimized for quantification of acrylic acid, acrylamide, and acrylonitrile. The optimal medium conditions for nitrilase activity were pH of 7.0, temperature of $30^{\circ}C$, agitation of 150 rpm, and inoculum level of 2%. Glycerol as a carbon source and sodium nitrate as the nitrogen source provided good nutritional sources for achieving good biotransformation. Nitrilase activity was constitutive in nature and was in the exponential growth phase after 24 h of incubation under optimal conditions without addition of any inducer. The substrate preference was acrylonitrile and acetonitrile. The present work demonstrates the biotransformation of acrylonitrile to acrylic acid with the new strain, R. ruber AKSH-84, which can be used in green biosynthesis of acrylic acid for biotechnological processes. The nitrilase produced by the isolate was purified and characterized.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.5
• /
• pp.58-70
• /
• 2008

Earlier researches on Sensor Networks preferred symmetric key-based authentication schemes in consideration of limitations in network resources. However, recent advancements in cryptographic algorithms and sensor-node manufacturing techniques have opened suggestion to public key-based solutions such as Merkle tree-based schemes. These previous schemes, however, must perform the authentication process one-by-one in hierarchical manner and thus are not fit to be used as primary authentication methods in sensor networks which require mass of multiple authentications at any given time. This paper proposes a new concept of public key-based authentication that can be effectively applied to sensor networks. This scheme is based on exponential distributed data concept, a derivative from Shamir's (t, n) threshold scheme, in which the authentication of neighbouring nodes are done simultaneously while minimising resources of sensor nodes and providing network scalability. The performance advantages of this scheme on memory usage, communication overload and scalability compared to Merkle tree-based authentication are clearly demonstrated using performance analysis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8B
• /
• pp.768-776
• /
• 2009

This paper analyses the message complexity of TDMA ad hoc MAC protocols. Since the network resource of ad hoc networks is limited due to the multiple interferences and the contention-based wireless channel, the scalability issue is one of the main research topics in developing ad hoc algorithms. Simulation demonstrates that SMACS protocol has the lowest message complexity, whereas TMMAC has the highest. In addition, it is found that since the effect of unicast dominates in the message complexity compared to other factors with an increasing number of nodes, Z-MAC tends to have the property of linearity, whereas BMA and TMMAC show exponential increases in their complexities.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.10
• /
• pp.81-88
• /
• 2013

Since nowadays mobile phone messages are flourishing, the application of electronic coupon (e-coupon) will become a trend for mobile users. E-coupon for mobile commerce can provide mobility for users and distribution flexibility for issuers. In this paper, we propose a mobile e-coupon system that just applies some simple cryptographic techniques, such as one-way hash function and XOR operation. In our system, the customer can control the number of issued e-coupons and the issuer can prevent them from double-redeeming. The customer does not need to perform any exponential computation in redeeming and transferring the coupons. Our scheme uses one-way hash chains for preventing from double-spending.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4825-4847
• /
• 2016

In this paper, we focus on the per-flow throughput analysis of IEEE 802.11 multi-hop ad hoc networks. The importance of an accurate saturation throughput model lies in establishing the theoretical foundation for effective protocol performance improvements. We argue that the challenge in modeling the per-flow throughput in IEEE 802.11 multi-hop ad hoc networks lies in the analysis of the freezing process and probability of collisions. We first classify collisions occurring in the whole transmission process into instantaneous collisions and persistent collisions. Then we present a four-dimensional Markov chain model based on the notion of the fixed length channel slot to model the Binary Exponential Backoff (BEB) algorithm performed by a tagged node. We further adopt a continuous time Markov model to analyze the freezing process. Through an iterative way, we derive the per-flow throughput of the network. Finally, we validate the accuracy of our model by comparing the analytical results with that obtained by simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.1
• /
• pp.237-253
• /
• 2019

For massive multiple-input multiple-output (MIMO) circumstances with time division duplex (TDD) protocol, pilot contamination becomes one of main system performance bottlenecks. This paper proposes an uplink pilot sequence assignment to alleviate this problem for spatially correlated massive MIMO circumstances. Firstly, a single-cell TDD massive MIMO model with multiple terminals in the cell is established. Then a spatial correlation between two channel response vectors is established by the large-scale fading variables and the angle of arrival (AOA) span with an infinite number of base station (BS) antennas. With this spatially correlated channel model, the expression for the achievable system capacity is derived. To optimize the achievable system capacity, a problem regarding uplink pilot assignment is proposed. In view of the exponential complexity of the exhaustive search approach, a pilot assignment algorithm corresponding to the distinct channel AOA intervals is proposed to approach the optimization solution. In addition, simulation results prove that the main pilot assignment algorithm in this paper can obtain a noticeable performance gain with limited BS antennas.

• International Journal of Computer Science & Network Security
• /
• v.22 no.1
• /
• pp.269-275
• /
• 2022

Public healthcare has recently become an issue of great importance due to the exponential growth in the human population, the increase in medical expenses, and the COVID-19 pandemic. Speed is one of the crucial factors in saving life, particularly in case of heart attack. Therefore, a healthcare device is needed to continuously monitor and follow up heart health conditions remotely without the need for the patient to attend a medical center. Therefore, this paper proposes a portable electrocardiogram (ECG) monitoring system to improve healthcare for heart attack patients in both home and ambulance settings. The proposed system receives the ECG signals of the patient and sends the ECG values to a MySQL database on the IoT-cloud via Wi-Fi. The signals are displayed as an ECG data chart on a webpage that can be accessed by the patient's doctor based on the HTTP protocol that is employed in the IoT-cloud. The proposed system detects the ECG data of the patient to calculate the total number of heartbeats, number of normal heartbeats, and the number of abnormal heartbeats, which can help the doctor to evaluate the health status of the patient and decide on a suitable medical intervention. This system therefore has the potential to save time and life, but also cost. This paper highlights the five main advantages of the proposed ECG monitoring system and makes some recommendations to develop the system further.

• Journal of KIISE:Information Networking
• /
• v.31 no.4
• /
• pp.414-428
• /
• 2004

Many portable devices are coming to be commercially successful and provide useful services to mobile users. Mobile devices may request a variety of data types, including text and multimedia data, thanks to the rich content of the Internet. Different types of data and/or different classes of users may need to be treated with different qualities of service. The implementation of service differentiation in wireless networks is very difficult because of device mobility and wireless channel contention when the backoff algorithm is used to resolve contention. Modification of the t)mary exponential backoff algorithm is one possibility to allow the design of several classes of data traffic flows. We present a study of modifications to the backoff algorithm to support three classes of flows: sold, silver, and bronze. For example, the gold c]ass flows are the highest priority and should satisfy their required target bandwidth, whereas the silver class flows should receive reasonably high bandwidth compared to the bronze class flows. The mixture of the two different transport protocols, UDP and TCP, in ad hoc networks raises significant challenges when defining backoff algorithm modifications. Due to the different characteristics of UDP and TCP, different backoff algorithm modifications are applied to each class of packets from the two transport protocols. Nevertheless, we show by means of simulation that our approach of backoff algorithm modification clearly differentiates service between different flows of classes regardless of the type of transport protocol.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.10 s.352
• /
• pp.79-89
• /
• 2006

TCP is the most widely used transport protocol in Internet applications that guarantees a reliable data transfer. But, in the wireless multi-hop networks, TCP performance is degraded because it is designed for wired networks. The main reasons of TCP performance degradation are contention for wireless medium at the MAC layer, hidden terminal problem, exposed terminal problem, packet losses in the link layer, unfairness problem, reordering problem caused by path disconnection, bandwidth waste caused by exponential backoff of retransmission timer due to node's mobility and so on. Specially, in the mobile ad-hoc networks, discrepancy between a station's transmission range and interference range produces hidden terminal problem that decreases TCP performance greatly by limiting simultaneous transmission at a time. In this paper, we propose a new MAC algorithm for mobile ad-hoc networks to solve the problem that a node can not transmit and just increase CW by hidden terminal. In the IEEE 802.11 MAC DCF, a node increases CW exponentially when it fails to transmit, but the proposed algorithm, changes CW adaptively according to the reason of failure so we get a TCP performance enhancement. We show by ns-2 simulation that the proposed algorithm enhances the TCP performance by fairly distributing the transmission opportunity to the failed nodes by hidden terminal problems.