• The Korean Journal of Physiology and Pharmacology
• /
• v.6 no.4
• /
• pp.173-181
• /
• 2002

The sinoatrial (SA) node is a complex and inhomogeneous tissue in terms of cell morphology and electrical activity. There are two models of the cellular organisation of the sinoatrial node: the gradient and mosaic models. According to the gradient model there is a gradual transition in morphology and electrical properties of SA node cells from the centre to the periphery of the SA node. In the mosaic model, there is a variable mix of atrial and sinoatrial node cells from the centre to the periphery. This review focuses on the cellular organisation of the rabbit sinoatrial node in terms of the expression of connexin (Cx40, Cx43 and Cx45), L-type $Ca^{2+}$ channel and $Na^+-Ca^{2+}$ exchanger proteins. These immunocytochemical data, together with morphological and electrophysiological data, obtained from the intact sinoatrial node and isolated sinoatrial node cells support the gradient model of the cellular organisation of the SA node. The complex organisation of the sinoatrial node is important for the normal functioning of the sinoatrial node: (i) it allows the sinoatrial node to drive the surrounding hyperpolarized atrial muscle without being suppressed by it; (ii) it helps the pacemaker activity of the sinoatrial node continue under a wide range of physiological and pathophysiological conditions; (iii) it helps protect the sinoatrial node from reentrant arrhythmias.

• International Journal of Computer Science & Network Security
• /
• v.23 no.9
• /
• pp.134-140
• /
• 2023

The distributed system is playing a vital role in storing and processing big data and data generation is speedily increasing from various sources every second. Hadoop has a scalable, and efficient distributed system supporting commodity hardware by combining different networks in the topographical locality. Node support in the Hadoop cluster is rapidly increasing in different versions which are facing difficulty to manage clusters. Hadoop does not provide Node management, adding and deletion node futures. Node identification in a cluster completely depends on DHCP servers which managing IP addresses, hostname based on the physical address (MAC) address of each Node. There is a scope to the hacker to theft the data using IP or Hostname and creating a disturbance in a distributed system by adding a malicious node, assigning duplicate IP. This paper proposing novel node management for the distributed system using DNA hiding and generating a unique key using a unique physical address (MAC) of each node and hostname. The proposed mechanism is providing better node management for the Hadoop cluster providing adding and deletion node mechanism by using limited computations and providing better node security from hackers. The main target of this paper is to propose an algorithm to implement Node information hiding in DNA sequences to increase and provide security to the node from hackers.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.11
• /
• pp.2922-2931
• /
• 1994

We propose a modified 6-node element, where the sampling point of Gauss quadrature moved in the thickness direction. The modified 6-node element has been applied to static problems and forced motion analyses. In this study, this method is extended to the finite element analysis of the natural frequencies of two dimensional problems. We also propose a modified 16-node element for three dimensional problems, which behaves much like a 20-node element with smaller degree of freedom. The modified 6-node and 16-node elements have been applied to the modal analyses of beams and plates, respectively. The results agree well with the results of the 8-node or 20-node element models.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.12
• /
• pp.2218-2224
• /
• 2016

Opportunistic routing is designed for an environment where there is no stable end-to-end routing path between source node and destination node, and messages are forwarded via intermittent contacts between nodes and routed using a store-carry-forward mechanism. In this paper, we consider PRoPHET(Probabilistic Routing Protocol using History of Encounters and Transitivity) protocol as a base opportunistic routing protocol and propose an efficient context-aware opportunistic routing protocol by using the context information of delivery predictability and node type, e.g., pedestrian, car, and tram. In the proposed protocol, the node types of sending node and receiving node are checked. Then, if either sending node or receiving node is tram, messages are forwarded by comparing the delivery predictability of receiving node with predefined delivery predictability thresholds depending on the combination of sending node and receiving node types. Otherwise, messages are forwarded if the delivery predictability of receiving node is higher than that of sending node, as defined in PRoPHET protocol. Finally, we analyze the performance of the proposed protocol from the aspect of delivery ratio, overhead ratio, and delivery latency. Simulation results show that the proposed protocol has better delivery ratio, overhead ratio, and delivery latency than PRoPHET protocol in most of the considered simulation environments.

• Journal of Gastric Cancer
• /
• v.20 no.1
• /
• pp.19-28
• /
• 2020

Gastrectomy with lymph node dissection remains the gold standard for curative treatment of gastric cancer. Dissection of splenic hilar lymph nodes has been included as a part of D2 lymph node dissection for proximal gastric cancer. Previously, pancreatico-splenectomy has been performed for dissecting splenic hilar lymph nodes, followed by pancreas-preserving splenectomy and spleen-preserving lymphadenectomy. However, the necessity of routine splenectomy or splenic hilar lymph node dissection has been under debate due to the increased morbidity caused by splenectomy and the poor prognostic feature of splenic hilar lymph node metastasis. In contrast, the relatively high incidence of splenic hilar lymph node metastasis, survival advantage, and therapeutic value of splenic hilar lymph node dissection in some patient subgroups, as well as the effective use of novel technologies, still supports the necessity and applicability of splenic hilar lymph node dissection. In this review, we aimed to evaluate the need for splenic hilar lymph node dissection and suggest the subgroup of patients with favorable outcomes.

• Journal of Korea Multimedia Society
• /
• v.17 no.4
• /
• pp.458-465
• /
• 2014

In this paper, we propose a strategy to distribute the energy consumption over the network. The proposed strategy is based on geographic routing. We use a smart base station that maintains the residual energy and location information of sensor nodes and selects a head node and an anchor node using this information. A head node gathers and aggregates data from the sensor nodes in a target region that interests the user. An anchor node then transmits the data that was forwarded from the head node back to the smart base station. The smart base station extends network lifetime by selecting an optimal head node and an optimal anchor node. We simulate the proposed protocol and compare it with the LEACH protocol in terms of energy consumption, the number of dead nodes, and a distribution map of dead node locations.

• Journal of the Korea Fashion and Costume Design Association
• /
• v.7 no.1
• /
• pp.33-40
• /
• 2005

Gathering is method used to control fullness along a seam line. The purpose of this study was to investigate the relationship between the quantitative research and qualitative method; the effect of gather and the types of gather drape. The experimental design consists of four factors: (l) three kinds of different weight and thickness of fabrics (2) three kinds of stitch densities (3) five kinds of ratio of gathers (4) three kinds of grain directions. Therefore one hundred thirty five (135) samples were made. And utilized SPSS WIN 10.0 Package in data analysis. The results of this study were as follows; First, after frequency analysis, side height, hem line width, node depth, node count, node width accorded with these result data recording. Second, after correlation analysis, side height related with front statements. Side height and entire visual was negative correlation. Hem line width, node depth, node count with section statements was negative correlation but node width at section statements was positive correlation. Third, after $k^2$ analysis, front picture parts getting excellent evaluation were 1st side height, 3rd hem line width, 4th node depth, 3rd node count, 3rd node width. And section illustration parts getting excellent evaluation were 4th side height, 1st hem line width, 2nd node depth, 3rd node count, 4th node width.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.5058-5077
• /
• 2019

Traditional regenerating codes are designed to tolerate node failures with optimal bandwidth overhead. However, there are many types of partial failures inside the node, such as latent sector failures. Recently, proposed regenerating codes can also repair intra-node failures with node-level redundancy but incur significant bandwidth and I/O overhead. In this paper, we construct a new scheme of regenerating codes, called IR-RBT codes, which employs intra-node redundancy to tolerate intra-node failures and serve as the help data for other nodes during the repair operation. We propose 2 algorithms for assigning the intra-node redundancy and RBT-Helpers according to the failure probability of each node, which can flexibly adjust the helping relationship between nodes to address changes in the actual situation. We demonstrate that the IR-RBT codes improve the bandwidth and I/O efficiency during intra-node failure repair over traditional regenerating codes but sacrifice the storage efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.7
• /
• pp.1817-1839
• /
• 2024

To solve the problem of insufficient recognition of key nodes in the existing software defect detection process, this paper proposes a key node recognition algorithm based on node expansion degree and improved K-shell position, shortened as SDD_KNR. Firstly, the calculation formula of node expansion degree is designed to improve the degree that can measure the local defect propagation capability of nodes in the software network. Secondly, the concept of improved K-shell position of node is proposed to obtain the improved K-shell position of each node. Finally, the measurement of node defect propagation capability is defined, and the key node recognition algorithm is designed to identify the key function nodes with large defect impact range in the process of software defect detection. Using real software systems such as Nano, Cflow and Tar to design three sets of experiments. The corresponding directed weighted software function invoke networks are built to simulate intentional attack and defect source infection. The proposed SDD_KNR algorithm is compared with the BC algorithm, K-shell algorithm, KNMWSG algorithm and NMNC algorithm. The changing trend of network efficiency and the strength of node propagation force are analyzed to verify the effectiveness of the proposed SDD_KNR algorithm.

• Journal of Korea Multimedia Society
• /
• v.20 no.8
• /
• pp.1357-1368
• /
• 2017

Sensor networks are used in various fields such as marine, defense, and smart home etc. Among the components of the sensor network, the sensor node collects sensor data, as one of the representative sensor network roles, and the sensor node makes a greate influence on the overall performance of the sensor network. Therefore, how to design the sensor node is an important issue in the sensor network field. However, the research on the sensor network architecture suitable for the sensor network installation environment has been made more important than the research on how to configure the sensor node. In this paper, we propose to identify elements to be considered for designing a sensor node that makes a large influence on the performance of the sensor network, and to easily implement the sensor node through the state transition model based on these elements.