• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.12-21
• /
• 2000

Arrangement graph has desirable properties for design requirements of a multihop lightwave network, such as node and edge symmetry, low diameter, simple routing, etc. In this paper, arrangement lightwave network based on arrangement graph model is proposed as new logical topology of multihop lightwave network. In the proposed scheme, multistar and grouping of network are used for improving reusability of wavelength and scalability. Also, this paper shows that the proposed scheme is an alternative logical topology for application requiring more nodes with limited wavelengths by evaluating performance with related works.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.527-530
• /
• 2010

WSN is composed of a lot of small sensors with the limited hardware resources. In WSN, at the initial stage, sensor nodes are randomly deployed over the region of interest, and self-configure the clustered networks by grouping a bunch of sensor nodes and selecting a cluster header among them. Specially, in WSN environment, in which the administrator's intervention is restricted, the self-configuration capability is essential to establish a power-conservative WSN which provides broad sensing coverage and communication coverage. In this paper, we propose a communication coverage-aware cluster head election algorithm for Herearchical WSNs which consists of communication coverage-aware of the Base station is the cluster head node is elected and a clustering.

• Journal of Digestive Cancer Reports
• /
• v.7 no.1
• /
• pp.13-17
• /
• 2019

Stomach cancer is the fifth most common malignancy in the world. The incidence of stomach cancer is declining worldwide, however, gastric cancer still remains the third most common cause of cancer death. The tumor, node, and metastasis (TNM) staging system has been frequently used as a method for cancer staging system and the most important reference in cancer treatment. In 2016, the classification of gastric cancer TNM staging was revised in the 8^th American Joint Committee on Cancer (AJCC) edition. There are several modifications in stomach cancer staging in this edition compared to the 7^th edition. First, the anatomical boundary between esophagus and stomach has been revised, therefore the definition of stomach cancer and esophageal cancer has refined. Second, N3 is separated into N3a and N3b in pathological classification. Patients with N3a and N3b revealed distinct prognosis in stomach cancer, and these results brought changes in pathological staging. Several large retrospective studies were conducted to compare staging between the 7^th and 8^th AJCC editions including prognostic value, stage grouping homogeneity, discriminatory ability, and monotonicity of gradients globally. The main objective of this review is to evaluate the clinical and pathological implications of AJCC 8^th staging classification in the stomach cancer.

• Journal of Korea Multimedia Society
• /
• v.12 no.9
• /
• pp.1191-1200
• /
• 2009

The replicas in the Grid database is utilized for a lot of application services. And for deferent services or for deferent information depends on location, the access frequency of each replica is dissimilar. When one replica is stored in many nodes, each replicas applies the week-consistency in the grid computing environment. Especially, when a node work load or operation capacity is varied from others, the replica management would cost expansive. Therefore, this paper proposed the Update Method based on Dynamic Access-Frequency Tree. The dynamic access-frequency tree is pre-constructed by grouping nodes based on each nodes access frequency to manage the replica efficiently and avoid unbalance replica tree. The performance evaluation shows the proposed methods support more quick update than current methods.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.6
• /
• pp.322-329
• /
• 2000

BIST(Built-in Self Test) has been considered as the most promising DFT(design-for-test) scheme for the present and future test strategy. The most serious problem in applying BIST(Built-in Self Test) into a large circuit is the excessive increase in test time. This paper is focused on this problem. We proposed a new BIST construction scheme which uses a parallel divide-and-conquer method. The circuit division is performed with respect to some internal nodes called test points. The test points are selected by considering the nodal connectivity of the circuit rather than the testability of each node. The test patterns are generated by only one linear feedback shift register(LFSR) and they are shared by all the divided circuits. Thus, the test for each divided circuit is performed in parallel. Test responses are collected from the test point as well as the primary outputs. Even though the divide-and-conquer scheme is used and test patterns are generated in one LFSR, the proposed scheme does not lose its pseudo-exhaustive property. We proposed a selection procedure to find the test points and it was implemented with C/C++ language. Several example circuits were applied to this procedure and the results showed that test time was reduced upto 1/2151 but the increase in the hardware overhead or the delay increase was not much high. Because the proposed scheme showed a tendency that the increasing rates in hardware overhead and delay overhead were less than that in test time reduction as the size of circuit increases, it is expected to be used efficiently for large circuits as VLSI and ULSI.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.6
• /
• pp.23-35
• /
• 2009

This study proposes a methodology for estimating representative section travel times using individual vehicle travel information under the ubiquitous transportation environment (UTE). A novel approach is to substantialize a concept of dynamic node-links in processing trajectory data. Also, grouping vehicles was conducted to obtain more reliable travel times representing characteristics of individual vehicle travels. Since the UTE allows us to obtain higher accuracy of vehicle positions, travel times for each lane can be estimated based on the proposed methodology. Evaluation results show that less than 10% of mean absolute percentage error was achievable with 20% of probe vehicle rate. It is expected that outcome of this study is useful for providing more accurate and reliable traffic information services.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.62 no.3
• /
• pp.203-213
• /
• 2017

This study investigated the changes in yields, antioxidant compounds, and antioxidant activities among 11 adzuki bean cultivars cultivated in a paddy field with somewhat poorly drained soil. The adzuki bean cultivars were cultivated in the paddy field from 2015 to 2016 in Milyang, Gyeongsangnam, Korea. Average soil moisture content was 16.5% in 2015 and 31.0% in 2016 at the experimental site during adzuki bean cultivation. As the soil moisture content increased, most of the adzuki bean cultivars showed deceases in stem height, first setting pod node, number of pods, 100 seed weight, and yield. Chungju-pat produced the greatest yields among the 11 cultivars in 2015 and 2016, whereas Hongeon had the smallest yields. Adzuki bean yields after paddy field cultivation was lower for all cultivars than for adzuki bean yields from the same cultivars after upland field cultivation. Chungju-pat and Chilbo-pat showed the smallest decreases in yields after paddy field cultivation, whereas Hongeon and Kumsil showed the greatest yield reductions. There were no significant differences in proximate composition. Some mineral components ($P_2O_5$, Ca, and Mg) were statistically different across cultivars. Chungju-pat had the highest Ca and Mg contents, but antioxidant components (polyphenol and flavonoids) and antioxidant activities (ABTS and DPPH) were highest in Saegil and lowest in Jungbu-pat. PCA and clustering analyses, based on the growth, yield, and antioxidant component measurements, performed to identify which variables contributed the most to separating adzuki bean cultivars or to grouping cultivars with similar characteristics. These analyses showed that the antioxidant components and antioxidant activities had the most influence on grouping cultivars together. Among the 11 cultivars, Saegil was statistically different from the other cultivars, but the other 10 cultivars were not significantly different under paddy field cultivation. Soil moisture content affected adzuki bean yield and antioxidant component contents. An increase in soil moisture led to a decrease in yield, but an increase in antioxidant components. These results provide information that will improve the selection of an appropriate adzuki bean cultivar for use in paddy fields.

• KIISE Transactions on Computing Practices
• /
• v.23 no.5
• /
• pp.275-283
• /
• 2017

A large amount of RDF data has been generated along with the increase of semantic web services. Various distributed storage and query processing schemes have been studied to efficiently use the massive amounts of RDF data. In this paper, we propose a distributed SPARQL query processing scheme that considers the data locality and query execution path of large RDF data. The proposed scheme considers the data locality and query execution path in order to reduce join and communication costs. In a distributed environment, when processing a SPARQL query, it is divided into several sub-queries according to the conditions of the WHERE clause by considering the data locality. The proposed scheme reduces data communication costs by grouping and processing the sub-queries through the index based on associated nodes. In addition, in order to reduce unnecessary joins and latency when processing the query, it creates an efficient query execution path considering data parsing cost, the amount of each node's data communication, and latency. It is shown through various performance evaluations that the proposed scheme outperforms the existing scheme.

• Journal of Information Management
• /
• v.25 no.1
• /
• pp.24-46
• /
• 1994

In this paper I will discuss definitions of hypermedia, multimedia and hypertext. Hypertext is the grouping of relevant information in the form of nodes. These nodes are then connected together through links. In the case of hypertext the nodes contain text or graphics. Multimedia is the combining of different media types for example sound, animation, text, graphics and video for the presentation of information by making use of computers. Hypermedia can be viewed as an extension of hypertext and multimedia. It is based on the concept of hypertext that uses nodes and links in the structuring of information in the system. In this case the nodes consist of an the different data types that are mentioned in the multimedia definition above. The 'node-and-link' concept is used in organisation of the information in hypermedia systems. The 'book' metaphor is an example of the way these systems are implemented. This concept is explained and a few advantages and disadvantages of making use of hypermedia systems are discussed. A new approach for the development of hypermedia systems, namely the knowledge-based approach is now looked into. Joel Peing-Ling Loo proposed this approach because he thought that it is the most effective way for handling this kind of technology. A semantic-based hypermedia model is developed in this approach to formulate solutions for the restrictions in presenting information authoring, maintenance and retrieval. The knowledge-based presentation of information includes the use of conventional data structures. These data structures make use of frames(objects), slots and the inheritance theory that is also used in expert systems. Relations develop between the different objects as these objects are included in the database. Relations can also exist between frames by means of attributes that belong to the frames.

• Journal of Gastric Cancer
• /
• v.5 no.3 s.19
• /
• pp.163-168
• /
• 2005

Purpose: We analyzed cases of advanced gastric cancer (AGC) by using two nodal stagings, UICC and Japanese systems. We also analyzed cases of UICC N3M0 by different ways to see which nodal system or group had better prognostic power. Materials and Methods: From Feb. 1990 to May 2000, 197 UICC M0 patients of AGC who had undergone curative resection were analyzed by using the nodal stagings of the UICC and the Japanese systems. Also, 58 patients with UICC N3M0 gastric cancer were analyzed by using the Japanese n-staging, metastatic ratio and the metastatic number Results: The 5-year survival rates were 62.9%, 33.0% and 21.2% for UICC N1, N2 and N3, and 61.2% and 25.3% for Japanese n1 and n2, respectively in patients of N3M0 AGC, the 5-year survival rates were 62.5% for Japanese n1, and 33.0% and 22.9% for metastatic ratios of less than 0.5 and metastatic numbers below 26, respectively significantly better than the 5-year survival rates for higher ratios and numbers (P=0.018, 0.021). Conclusion: UICC N staging of gastric cancer has better prognostic power with differentiation between stages than Japanese n staging. In patients with UICC N3M0 gastric cancer, the metastatic ratio and the metastatic number, as well as the Japanese n staging, were valuable prognostic factors.