• Journal of Gastric Cancer
• /
• v.11 no.1
• /
• pp.23-30
• /
• 2011

Purpose: ${\alpha}$-fetoprotein (AFP)-producing gastric cancer is a rare tumor with high rates of liver metastasis and a poor prognosis. Many studies have been performed but there have been no comprehensive investigations of the clinicopathological and prognosis. Materials and Methods: Six hundred ninety four patients with gastric cancer who underwent a curative gastric resection in Hanyang University Hospital from February 2001 to December 2008 were evaluated retrospectively after excluding active or chronic hepatits, liver cirrhosis and preoperative distant metastasis. Among them, thirty five patients had an elevated serum level of AFP (>7 ng/ml) preoperatively. The clinicopathological features of AFP-producing gastric cancer were analyzed. Results: There was poorer differentiation, a higher incidence of lymph node metastasis, more marked lymphatic and vascular invasion in the AFP-positive group than in the AFP-negative group. The 5-year survival rate of the AFP-positive group was significantly poorer than that in the AFP-negative group (66% vs. 80%, P=0.002). A significantly higher incidence of liver metastasis was observed in the AFP-positive group than in the AFP-negative group (14.3% vs. 3.6%, P=0.002) with a shorter median time period from the operation to the metachronous liver metastasis (3.7 months vs. 14.1 months, P=0.043). Multivariate survival analysis revealed the depth of invasion, degree of lymph node metastasis and AFP-positivity to be the independent prognostic factors. Conclusions: AFP-producing gastric cancers have an aggressive behavior with a high metastatic potential to the liver. In addition, their clinicopathological features are quite different from the more common AFP-negative gastric cancer.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3494-3510
• /
• 2019

Wireless sensor networks encounter energy saving as a major issue as the sensor nodes having no rechargeable batteries and also the resources are limited. Clustering of sensors play a pivotal role in energy saving of the deployed sensor nodes. However, in the cluster based wireless sensor network, the cluster heads tend to consume more energy for additional functions such as reception of data, aggregation and transmission of the received data to the base station. So, careful selection of cluster head and formation of cluster plays vital role in energy conservation and enhancement of lifetime of the wireless sensor networks. This study proposes a new mutation chemical reaction optimization (MCRO) which is an algorithm based energy efficient clustering protocol termed as MCRO-ECP, for wireless sensor networks. The proposed protocol is extensively developed with effective methods such as potential energy function and molecular structure encoding for cluster head selection and cluster formation. While developing potential functions for energy conservation, the following parameters are taken into account: neighbor node distance, base station distance, ratio of energy, intra-cluster distance, and CH node degree to make the MCRO-ECP protocol to be potential energy conserver. The proposed protocol is studied extensively and tested elaborately on NS2.35 Simulator under various senarios like varying the number of sensor nodes and CHs. A comparative study between the simulation results derived from the proposed MCRO-ECP protocol and the results of the already existing protocol, shows that MCRO-ECP protocol produces significantly better results in energy conservation, increase network life time, packets received by the BS and the convergence rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.2972-2991
• /
• 2016

WLAN is the best choice in the place where complex network is hard to set up. Intelligent terminals are more and more assembled in some areas now. However, according to IEEE 802.11n/802.11ac, the access-point (AP) can only serve one user at a single frequency channel. The spectrum efficiency urgently needs to be improved. In theory, AP with multi-antenna can serve multiple users if these users do not interfere with each other. In this paper, we propose a user clustering scheme that could achieve multi-user selection through the mutual cooperation among users. We focus on two points, one is to achieve multi-user communication with multiple antennas technique at a single frequency channel, and the other one is to use a way of distributed users' collaboration to determine the multi-user selection for user clustering. Firstly, we use the CSMA/CA protocol to select the first user, and then we set this user as a source node using users' cooperation to search other proper users. With the help of the users' broadcast cooperation, we can search and select other appropriate user (while the number of access users is limited by the number of antennas in AP) to access AP with the first user simultaneously. In the network node searching, we propose a maximum degree energy routing searching algorithm, which uses the shortest time and traverses as many users as possible. We carried out the necessary analysis and simulation to prove the feasibility of the scheme. We hope this work may provide a new idea for the solution of the multiple access problem.

• Journal of Korea Multimedia Society
• /
• v.14 no.10
• /
• pp.1287-1302
• /
• 2011

Clustering protocol that is used in wireless sensor network is an efficient method that extends the lifetime of the network. However, when this method is applied to an environment in which collected data of the sensor node easily overlap, sensor nodes unnecessarily consumes energy. In the case of clustering technique that uses a threshold, the lifetime of the network is extended but the degree of accuracy of collected data is low. Therefore it is hard to trust the data and improvement is needed. In addition, it is hard for the clustering protocol that uses multi-hop transmission to normally collect data because the selection of a cluster head node occurs at random and therefore the link of nodes is often disconnected. Accordingly this paper suggested a cluster-formation algorithm that reduces unnecessary energy consumption and that works with an alleviated link disconnection. According to the result of performance analysis, the suggested method lets the nodes consume less energy than the existing clustering method and the transmission efficiency is increased and the entire lifetime is prolonged by about 30%.

• Journal of Astronomy and Space Sciences
• /
• v.12 no.1
• /
• pp.112-122
• /
• 1995

We assume that the KOREASAT fails the entry of the geostationary orbit due to the error at the apogee kick motor firing. A simulation is done for the satellite that has a geosynochronous orbit with a non-zero degree inclination angle due to the failure at the apogee kick motor firing caused by the unbalance of the fuel storage and the spin of the thrust vector, etc. We analyzed the evolution of the orbit using the perturbation theory and calculated the changes of the eccentricity and the inclination. WHen a communication satellite has the figure eight trajectory, the beam point also traces the satellite. In this paper, We develope an algorithm to attack the above problem by stabilizing the beam point using the adjustment of the roll angle of the satellite. The spin action on the polarization plane that occurs when a satellite passes the ascending node and descending node affects the efficiency of the communication a lot, so we did another simulation for the better yaw angle adjustment for the KOREASAT to reduce the spin actino on the polarization plane.

• Journal of the Korean Geographical Society
• /
• v.45 no.6
• /
• pp.788-805
• /
• 2010

The present USN (Ubiquitous Sensor Networks) node deployment practices have many limitations in terms of positional connectivity. The aim of this research was to minimize a redundancy of USN route nodes, by integrating spatially weighted parameters such as visibility, proximity to cell center, road density, building density and cell overlapping ratio into a comprehensive GIS database. This spatially weighted approach made it possible to reduce the number of route nodes (11) required in the study site as compared to that of the grid network method (24). The field test for RSSI (Received Signal Strength Indicator) indicates that the spatially weighted deployment could comply with the quality assurance standard for node connectivity, and that reduced route nodes do not show a significant degree of signal fluctuation for different site conditions. This study demonstrated that the spatially weighted deployment can be used to minimize a redundancy of USN route nodes in a routine manner, and the quantitative evidence removing a redundancy of USN route nodes could be utilized as major tools to ensure the strong signal in the USN, that is frequently encountered in real applications.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.7
• /
• pp.914-924
• /
• 2020

In this study we developed artificial network generation model, which can generate on-line social network. The suggested model can represent not only scale-free and small-world properties, but also can produce networks with various values of topological characteristics through controlling two input parameters. For this purpose, two parameter K and P are introduced, K for controlling the strength of preferential attachment and P for controlling clustering coefficient. It is found out on-line social network can be generated with the combinations of K(0~10) and P(0.3~0.5) or K=0 and P=0.9. Under these combinations of P and K small-world and scale-free properties are well represented. Node degree distribution follows power-law. Clustering coefficients are between 0.130 and 0.238, and average shortest path distance between 5.641 and 5.985. It is also found that on-line social network properties are maintained as network node size increases from 5,000 to 10,000.

• Journal of Intelligence and Information Systems
• /
• v.15 no.4
• /
• pp.159-182
• /
• 2009

We construct product networks from the retail transaction dataset of an off-line department store. In the product networks, nodes are products, and an edge connecting two products represents the existence of co-purchases by a customer. We measure the quantities frequently used for characterizing network structures, such as the degree centrality, the closeness centrality, the betweenness centrality and the centralization. Using the quantities, gender, age, seasonal, and regional differences of the product networks were analyzed and network characteristics of each product category containing each product node were derived. Lastly, we analyze the correlations among the three centrality quantities and draw a marketing strategy for the cross-selling.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.733-742
• /
• 2002

It has been known that the host mobility feature has very significant impact on the QoS (Quality of Service), which is usually required to a real-time multimedia application. The existing QoS support mechanisms to provide the real-time services to fixed network environment, like as RSVP, are inadequate to accommodate the mobile hosts which can frequently change their point of attachments to the fixed network. So, MRSVP (Mobile RSVP) protocol has been proposed to reduce the impacts of host mobility on QoS guarantees, in which a mobile host needs to make advance resource reservations at multiple locations it may possibly visit during the lifetime of the connection. This paper proposes a dynamic dual anchor node (DDAN) architecture which integrates the MRSVP and RSVP tunnel, in addition to the Mobile IP Regional Registration protocol. By limiting the resource reserved in local area, it preserves the lower level of resource reservation, but provides approximately the same degree of QoS support as the existing MRSVP.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1021-1030
• /
• 2004

When any data-centric XML documents are stored and managed in RDBMS, schema extracting from XML Schema is an imminent problem. Furthermore, when they are stored in partitioned way on created table, lots of null values will be produced and/or be increased cost for join, so we need a solution to solve these problems. This paper proposes a Schema Hybrid Inlining technique to generate relational schema of XML documents. The suggested technique creates a relational schema based on the XML Schema graph. Also, the technique expands the legacy Inlining method by manual and heuristic processing table generation method of cardinality and in-degree. Then, an ancestor node, terminal node, and creating a new table on the derived relation in this technique. DTD-dependent storage method uses partitioned storing and relation path element information reformed structured-searching method to reduce joining operation cost that is a weak point of it.