• Korean Journal of Bronchoesophagology
• /
• v.4 no.1
• /
• pp.127-131
• /
• 1998

Histiocytic necrotizing lymphadenitis(NHL), or Kikuchi-Fujimoto disease, is of unknown origin that causes persistently enlarged cervical lymph nodes unresponsive to antibiotic therapy, usually in young women. Symptoms of NHL include tender cervical adenopathy, fever, weight loss, and night sweats. Laboratory studies usually reveal leukopenia and increased erythrocyte sedimentation rate. Lymph node biopsy reveals areas with frank cell necrosis, karyorrhexis, and absence of plasma cells. NHL follows a benign course, but shoud be differentiated from other diseases such as inflammatory, granulmomatous and malignant lymphadenopathies. We describe . three cases of NHL with a review of the literature.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.30 no.1
• /
• pp.69-75
• /
• 1985

Field experiments were performed to obtain the basic information of flowering order and variation of yield characteristics by capsule position in sesame. Flowering order was advanced regularly about one day interval from 5th capsule-setting node to upper node. Developing order of flowers at the same nodes, the chief bud was generally flowered eariler than side buds, 3 days below 8th node, 2 days from 9th to 16th node, and 2 - 3 days above 17th node. The number of capsule per plant and total grains were 98% from 1st to 16th capsule - setting node, but the number and the weight of matured grain were 99% from 1st to 13th node. The weight of matured grain among nodes was the heaviest at 5th capsule - setting node. The variation of yield characteristics among nodes was higher than individual plants. Yield characteristics of 6th node was shown lowest variation in comparision with those of other nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9B
• /
• pp.803-810
• /
• 2006

Mobile ad hoc nodes are supposed to be equipped with a number of operation modules including a specific routing operation module in heterogeneous MANET environment. It is not possible for a mobile node to carry all the necessary operation modules due to the limited resources. This paper proposes a scheme to reconfiguring mobile ad hoc nodes using smart packets in heterogeneous routing domains. The smart packet protocol has a capability to transfer a binary execution module to a mobile node, by which a node can be equipped with any necessary routing modules in any MANET environment. The proposed smart packet agent is designed to be suitable to a light weight terminal owing to its simple architecture. The utility of the proposed scheme was demonstrated through an example of DYMO scenario in the wireless network.

• Fashion & Textile Research Journal
• /
• v.11 no.3
• /
• pp.453-459
• /
• 2009

The purpose of this study was to provide the basic knowledge to determine the proper seam finish according to the design of sewing products. Four seam finishes(no seam finishes, over-edged seam finishes, turned-and-stitched seam finishes, and bias-bound seam finishes) were constructed with seams in warp, weft and bias directions of the fabric. Using a drape measurement system involving two 18cm diameter supporting disks and a digital camera, the images of draped specimens were captured and processed. Drape behavior was evaluated in terms of drape coefficient, node number, and drape profile. Drape coefficients of the fabrics increased with seam formation and varied by the seam finishes, however no significant differences in drape coefficients by the seam finishes were observed on the heavier fabric. Node numbers of heavier fabric were more deeply affected by the seam finishes than those of lighter fabric. The specimens with turned-and-stitched seam finishes and bias-bound seam finishes showed significantly smaller node numbers compared to the specimens with no seam finishes and over-edged seam finishes on heavier fabric. The length of the seamed part showed positive correlation with the weight of the specimens and negative correlation with the number of nodes in each seam direction. The maximum length of all draped specimens was found in the same direction as the seam direction. In the case of the lighter fabric, the seam and the seam finish had a great influence on the shape of the draped profile.

• Fashion & Textile Research Journal
• /
• v.13 no.3
• /
• pp.418-424
• /
• 2011

The purpose of this study was to reveal the effects of the seam type on the fabric drape to provide the basic knowledge for proper seam type according to the design of sewing products. Seven kinds of specimens were constructed with seam (no seam, welt seam with over-edged finish, welt seam with bias bound finish, plain seam with over-edged finish, plain seam with bias bound finish, french seam, and flat fell seam) in wrap direction of the fabric. Using a drape measurement system involving two 18 cm diameter supporting disks, and a digital camera, the images of draped specimens were captured and processed. Drape behavior was evaluated in terms of drape coefficient, node number, and drape profile. Significant differences were found in drape coefficient by the seam types. The specimens with french seam and flat fell seam showed higher drape coefficients compared to those with welt seam and plain seam. Node numbers in the drape profiles showed positive correlation with the weight of the specimens, however, no significant differences were observed in node numbers by the seam types. Significant differences were found in the length of the seamed part by the seam types. The specimens with french seam and flat fell seam showed longer length of the seamed part compared to those with welt seam and plain seam. The ratio of the maximum length in the seam direction to the maximum length perpendicular to the seam direction showed significant differences by the seam types.

• Korean Journal of Environmental Agriculture
• /
• v.29 no.4
• /
• pp.374-380
• /
• 2010

This experiment was carried out to investigate the effect of light qualities and lighting types provided by LED Chamber System which designed by Rural Development Administration on growth and development of Chrysanthemum (Dendranthema grandiflorum L., cv. 'Cheonsu') plantlet cultured in vitro. The explants of single-node cuttings were exposed to monochromic or mixture radiation of blue, red, or green under continuous and intermittent lighting for 42 days. The intermittent lighting of 20 sec. on and off per minute significantly stimulated shoot elongation with lower number of internodes compared with continuous lighting treatments. However, continuous blue, red, or green light gave greater dry weight comparing the intermittent lighting, and the lowest weight was recorded at the continuous fluorescent lamp. Otherwise, the plantlet growth in dry weight or leaf area was inhibited by the green light controlled at 50 times intermittence but internode elongation was significantly increased. These results showed that the plantlets were successfully grown under the LED Chamber System controlled with different light qualities and lighting types. Quantitative growth of the plantlets was improved under the shorter photoperiod with a intermittent lighting cycle compared with continuous lighting using fluorescent lamps. It is concluded that the growth and development of in vitro plantlets such as single-node cuttings can be achieved by the controlling of light quality or lighting type during the photoperiod per day with a lower electric cost compared with conventional continuous lighting system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.51-61
• /
• 2012

This paper suggests an algorithm that obtains Directed Graph Minimum Spanning Tree (DMST), using Prim MST algorithm which is Minimum Spanning Tree (MST) of undirected graph. At first, I suggested the Prim DMST algorithm that chooses Minimum Weight Arc(MWA) from out-going nodes from each node, considering differences between undirected graph and directed graph. Next, I proved a disadvantage of Prim DMST algorithm and Chu-Liu/Edmonds DMST (typical representative DMST) of not being able to find DMST, applying them to 3 real graphs. Last, as an algorithm that can always find DMST, an advanced Prim DMST is suggested. The Prim DMST algorithm uses a method of choosing MWA among out-going arcs of each node. On the other hand, the advanced Prim DMST algorithm uses a method of choosing a coinciding arc from the out-going and in-going arcs of each node. And if there is no coinciding arc, it chooses MWA from the out-going arcs from each node. Applying the suggested algorithm to 17 different graphs, it succeeded in finding the same DMST as that found by Chu-Liu/Edmonds DMST algorithm. Also, it does not require such a complicated calculation as that of Chu-Liu/Edmonds DMST algorithm to delete the cycle, and it takes less time for process than Prim DMST algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.7
• /
• pp.893-900
• /
• 2007

This paper suggests an algorithm that improves the disadvantages of the Dijkstra algorithm that is commonly used in GPS navigation system, searching for the shortest path. Dijkstra algorithm, first of all, requires much memory for the performance of the algorithm. It has to carry out number of node minus 1, since it determines the shortest path from all the nodes in the graph, starting from the first node. Therefore, Dijkstra algorithm might not be able to provide the information on every second, searching for the shortest path between the roads of the congested city and the destination. In order to solve these problems, this paper chooses a method of searching a number of nodes at once by means of choosing the shortest path of all the path nodes (select of minimum weight arc in-degree and out-degree), excluding the departure and destination nodes, and of choosing all the arcs that coincide with the shortest path of the path nodes, from all the node outgoing arcs starting from the departure node. On applying the suggested algorithm to 14 various digraphs, we succeeded to search the shortest path. In addition, the result was obtained at the speed of 2 to 3 times faster than that of Dijkstra algorithm, and the memory required was less than that of Dijkstra algorithm.

• Journal of Information Processing Systems
• /
• v.15 no.6
• /
• pp.1365-1377
• /
• 2019

Summarizing the differences in Chinese-Vietnamese bilingual news plays an important supporting role in the comparative analysis of news views between China and Vietnam. Aiming at cross-language problems in the analysis of the differences between Chinese and Vietnamese bilingual news, we propose a new method of summarizing the differences based on an undirected graph model. The method extracts elements to represent the sentences, and builds a bridge between different languages based on Wikipedia's multilingual concept description page. Firstly, we calculate the similarity between Chinese and Vietnamese news sentences, and filter the bilingual sentences accordingly. Then we use the filtered sentences as nodes and the similarity grade as the weight of the edge to construct an undirected graph model. Finally, combining the random walk algorithm, the weight of the node is calculated according to the weight of the edge, and sentences with highest weight can be extracted as the difference summary. The experiment results show that our proposed approach achieved the highest score of 0.1837 on the annotated test set, which outperforms the state-of-the-art summarization models.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.22-24
• /
• 2021

This paper is a proposal for edge weight prediction using neural networks to graph configurations of nodes and edges. Brand is one of the components of society. and one of the brand's most important strategies is geographical location strategy. This paper is focus on that strategy. In This paper propose two things: 1) Graph Configuration. node consists of brand store, edge consists of store-to-store relationships and edge weight consists of actual walk and drive distance values. 2) numbering edges and training neural networks to predict next store distance values. It is expected to be useful in analyzing successful brand geographical location strategies.