• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.97-106
• /
• 2002

In 3GPP2 standard, MIP is used and a PDSN performs the function of FA to support macro mobility. When a MS is roaming from a PDSN area to another, the mobility supported is called macro mobility, while it is called micro mobility when a MS is roaming from a RN area to another in a PDSN area. Since a PDSN performs the function of FA in 3GPP2 standard, it is possible to support mobility but its mechanism is actually for supporting macro mobility, not for micro mobility, thus it is weak in processing fast and seamless handoff to support micro mobility. In this paper, we suggest the seamless handoff algorithm barred on multicast group mechanism to support micro mobility. Depending on the moving direction and velocity of a MS, the suggested algorithm constructs a multicast group of RNs on the forecasted MS's moving path, and maximally delays RNs'joining to a multicast group to increase the network efficiency. Moreover, to resolve the buffer overhead problem of the existent multicast scheme, the algorithm suggests that each RN buffers data only after the forecasted handoff time. To prove deadlock freeness and liveness of the algorithm. we use state transition diagrams, a Petri-net modeling and its reachability tree. Then, we evaluate the performance by simulation.

• Journal of Intelligence and Information Systems
• /
• v.18 no.4
• /
• pp.117-127
• /
• 2012

Due to the recent expansion of the Web 2.0 -based services, along with the widespread of smartphones, online social network services are being popularized among users. Online social network services are the online community services which enable users to communicate each other, share information and expand human relationships. In the social network services, each relation between users is represented by a graph consisting of nodes and links. As the users of online social network services are increasing rapidly, the SNS are actively utilized in enterprise marketing, analysis of social phenomenon and so on. Social Network Analysis (SNA) is the systematic way to analyze social relationships among the members of the social network using the network theory. In general social network theory consists of nodes and arcs, and it is often depicted in a social network diagram. In a social network diagram, nodes represent individual actors within the network and arcs represent relationships between the nodes. With SNA, we can measure relationships among the people such as degree of intimacy, intensity of connection and classification of the groups. Ever since Social Networking Services (SNS) have drawn increasing attention from millions of users, numerous researches have made to analyze their user relationships and messages. There are typical representative SNA methods: degree centrality, betweenness centrality and closeness centrality. In the degree of centrality analysis, the shortest path between nodes is not considered. However, it is used as a crucial factor in betweenness centrality, closeness centrality and other SNA methods. In previous researches in SNA, the computation time was not too expensive since the size of social network was small. Unfortunately, most SNA methods require significant time to process relevant data, and it makes difficult to apply the ever increasing SNS data in social network studies. For instance, if the number of nodes in online social network is n, the maximum number of link in social network is n(n-1)/2. It means that it is too expensive to analyze the social network, for example, if the number of nodes is 10,000 the number of links is 49,995,000. Therefore, we propose a heuristic-based method for finding the shortest path among users in the SNS user graph. Through the shortest path finding method, we will show how efficient our proposed approach may be by conducting betweenness centrality analysis and closeness centrality analysis, both of which are widely used in social network studies. Moreover, we devised an enhanced method with addition of best-first-search method and preprocessing step for the reduction of computation time and rapid search of the shortest paths in a huge size of online social network. Best-first-search method finds the shortest path heuristically, which generalizes human experiences. As large number of links is shared by only a few nodes in online social networks, most nods have relatively few connections. As a result, a node with multiple connections functions as a hub node. When searching for a particular node, looking for users with numerous links instead of searching all users indiscriminately has a better chance of finding the desired node more quickly. In this paper, we employ the degree of user node vn as heuristic evaluation function in a graph G = (N, E), where N is a set of vertices, and E is a set of links between two different nodes. As the heuristic evaluation function is used, the worst case could happen when the target node is situated in the bottom of skewed tree. In order to remove such a target node, the preprocessing step is conducted. Next, we find the shortest path between two nodes in social network efficiently and then analyze the social network. For the verification of the proposed method, we crawled 160,000 people from online and then constructed social network. Then we compared with previous methods, which are best-first-search and breath-first-search, in time for searching and analyzing. The suggested method takes 240 seconds to search nodes where breath-first-search based method takes 1,781 seconds (7.4 times faster). Moreover, for social network analysis, the suggested method is 6.8 times and 1.8 times faster than betweenness centrality analysis and closeness centrality analysis, respectively. The proposed method in this paper shows the possibility to analyze a large size of social network with the better performance in time. As a result, our method would improve the efficiency of social network analysis, making it particularly useful in studying social trends or phenomena.

• Journal of Korean Society of Forest Science
• /
• v.58 no.1
• /
• pp.8-16
• /
• 1982

To study the comparison of aboveground biomass of paulownia coreana Uyeki of 6-year-old, located in Seongju of non-attacked forest and Ulsan of damaged forest by the air pollution were selected. Ten sample trees in Seongju district and seven trees in Ulsan selected taking account of DBH were measured for 16 trees in total within a $10{\times}10m$ experimental plot. The diagram of oven-dry weight distribution of stem, branch and needle for each 1m segment was constructed. The logarithmic regression equations between dry weight of each component and the two-variables, DBH and tree height, combined term were presented. IF the estimations are extended to a hectare area stand, it contains 47.49 tons of aboveground biomass in Seongju district and 19.05 tons of it in Ulsan. The annual net productions were 11.64 tons of above 2.29 kg/kg/yr in Ulsan and the efficiency of leaf to produce stem was 2.99kg/kg/yr in Seongju and 0.83kg/kg/yr in Ulsan.

• Journal of Korean Society of Forest Science
• /
• v.112 no.4
• /
• pp.472-489
• /
• 2023

This study was conducted to derive the optimal estimation equations for deriving the green and dry weights of Larix kaempferi (Japanese larch) and Pinus rigida (Rigida pine), which are major coniferous tree species in South Korea. The equations were then used to develop weight tables. Table development began with the sampling of 150 L. kaempferi and 90 P. rigida trees distributed throughout the national scale, after which green weights were measured on-site. Samples from each stand were then collected, and their dry weights were measured in a laboratory. The equation used to calculate green and dry weights was divided into a one-variable formula that uses only the diameter at breast height (DBH) and a two-variable equation that employs DBH and height. The equations used to estimate the green and dry weights of logs were divided into one- and two-variable equations using DBH. Statistical data, such as the fitness index (FI), root mean square error, standard error of estimation, and residual diagram, were used to verify the suitability of the estimation equations. Applicability was examined by calculating weights using the derived optimal equations. The equation W = bD+cD² was used in measurements involving only DBH, whereas the equation W = aD^bH^c was employed in cases involving both diameter and height at breast height. The FI of W = bD+cD² was 0.91, while that of W = aD^bH^c was 0.95, both of which are high values. With these estimation formulas, weight tables for the green and dry weights of L. kaempferi and P. rigida were prepared and compared with weight tables created 20 years ago. The green and dry weight tables of both species were larger.

• Journal of the Korean Geographical Society
• /
• v.31 no.3
• /
• pp.447-468
• /
• 1996

The peat layer was deposited on the abandoned channel of incised meander of River Banbyuncheon with 7 meter thickness on Youngyang basin. The late Quaternary environmental change on the study area was discussed based on pollen anaalysis and radiocarbon-dating from this peat. The swamp which was caused to sediment the peat, was produced by which the fan debris from the adjacent slope damed the waterflow on the abandoned channel. The peat layer contains continuous vegetational history from 60,000y.B.P. to Recent. The peat deposit was divided into two layers by the organic thin sand horizon, which was sedimented at one time and made unconformity between the lower decomposed compact peat layers and the upper fresh fiberous peat layer. As the result of the pollen analysis, both peat layers from the two boring sites, Profile YY1 and Profile YY2 were divided into five Pollenzones(Pollenzone I, II, III, IV and V) and 12 Subzones which were mainly corresponded by the AP (Arboreal Pollen)-Dominance. The two profiles have some differences on the sedimentary facies and on the pollen composition as well. Therefore these were in common with the Pollenone III, however the Pollenzone I and II existed only on the Profile YY1 and the Pollenzone IV and V existed only on the Profile YY2. The lower layer containing the Pollenzone I, II and III revealed vegetational records of Pleistocene, which was characterized as tundra-like landscape and thin forested landscapes. It represented the NAP (Non-Arboreal Pollen)-period with a plenty of Artemisia sp., Sanguisorba sp., Umbelliferae, Gramineae and Cyperaceae. However a relatively high proportion of the boreal trees with Picea sp., Pinus sp. and Betula sp. as AP was observed in the lower layer. The upper layer contained the Pollenzone IVb and V and vegetational history in Holocene which was characterized by thick forested landscape with rich tree pollen. It represented AP-period with plenty of Pinus sp. and Quercus sp. as temperate trees. The temperature fluctuation supposed from the vegetational records is as follows; the Pollenzone I(Betula-Dominance, about 57,000y.B.P.) represents relatively cold period. The Pollenzone II(EMW-Domi-nance, 57,000-43,000y.B.P.)represents relatively warm period. This period is supposed to be Interstadial, the transi-tional stage from Alt- to Mittel Wurm. The Pollenzone III(Butula-, Pinus- and Picea-Dominace in turns, 43,000-15,000y.B.P.) reproesents cold period which had been built from Mittel-to Jung Wurm. Especially the Subzone IIId represents the coldest period throughout the Pollenzone III. It is corresponds to Wurm Glacial Maximu. It is supposed that the mean temperature in July of this period was coller about 10${^\circ}$C than present. The Pollenzone IV and V represent the vegetational history of Holocene. Tilia, Quercus and Pinus were dominant in turns during this period. Subzone IVb and Pollenzone I and II at east coastal plain of Korean penninsula reported by JO(1979).