• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.1
• /
• pp.149-154
• /
• 2024

This paper proposes an algorithm that remedy Floyd's the tortoise and the hare algorithm (THA) shortcomings which is specialized in singly linked list (SLL), so this algorithm fails to detect the cycle in undirected graph, digraph, and tree with multiple inputs or outputs. The proposed algorithm simply pruning the source and sink with only one edge using cycle detection of single edge node pruning. As a result of the experimental of various list, undirected graph, digraph, and tree, the proposed algorithm can be successively detect the cycle all of them. Thus, the proposed algorithm has the simplest and fastest advantage in the field of cycle detection.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.287-295
• /
• 2010

In wireless sensor networks(WSNs), the studies that support sink mobility without global position information exploit a Backbone-based Virtual Infrastructure (BVI) which considers one-hop clusters and a backbone-based tree. Since the clusters of a sink and a source node are connected via flooding into the infrastructure, it causes high routing cost. Although the network could reduce the number of clusters via multi-level clusters, if the source nodes exist at nearest clusters from the cluster attached by the sink and they are in different branches of the tree, the data should be delivered via detour paths on the tree. Therefore, to reduce the number of clusters, we propose a novel multi-hop cluster based communication protocol supporting sink mobility without global position information. We exploit a rendezvous cluster head for sink location service and data dissemination but the proposed protocol effectively reduces data detour via comparing cluster hops from the source. Simulation shows that the proposed protocol is superior to the existing protocols in terms of the data delivery hop counts.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.3
• /
• pp.301-306
• /
• 2010

In this paper, a SIT(Source Independent Tree) method for ray tracing is proposed to enhance the efficiency of tree construction with reuse of sub tree in urban environment, As the SIT method is applied, the decrease of the number of nodes for picocell and microcell simulations is 100 times. And 88~98 % of the total nodes are reused with change of location of signal source from an analysis of node reuse efficiency. Therefore the proposed SIT method is useful in performance enhancement of ray tracing, especially, for multiple antenna simulation like as MIMO system and cell planning.

• Journal of KIISE:Information Networking
• /
• v.34 no.2
• /
• pp.120-133
• /
• 2007

A multicast tree includes several, possibly a large number of, paths connecting source-receiver pairs, and network failure may disable part of the multicast tree. Reconstruction of the entire multicast tree to recover from a component failure is highly undesirable, because some group members have to suffer service disruptions even though the communication paths to/from them are not affected by the failure. To limit reconfiguration region and to maximize the likelihood of successful reconfiguration, we propose and evaluate a pre-planned reconfiguration policy for QoS multicast sessions. Specifically, we equip a reconfiguration path (RP) with each end-to-end path that connects a source-receiver pair in the multicast tree, and reserve resources in advance along the RPs. Efficient resource-sharing techniques are applied to reduce the amount of resources reserved for RPs but not used in the absence of failures. This way, we prevent uncontrolled competition among different multicast sessions which may simultaneously try to recover from failures. We evaluate the performance of the proposed scheme using simulation on randomly-generated networks. We use the shortest-path routing for QoS multicast sessions, and simulate both source-based and shared multicast trees. The evaluation results indicates that successful pre-planned reconfiguration can be achieved for all group members with reasonable overhead. Our scheme is also shown to adapt well to dynamic changes of group membership.

• The KIPS Transactions:PartA
• /
• v.11A no.1
• /
• pp.97-108
• /
• 2004

This paper proposes to use an algorithmic debugging technique for locating logical errors in Java programs. The algorithmic debugging is a semi-automated debugging technique that builds an execution tree from a source program and locates logical errors, if any, included in the program from the execution tree with top-down method. So, it is very important to build a suitable execution tree from the various programming languages. In this paper we propose the method for building an execution tree iron Java programs and walk through an example. This approach could reduce the number of interactions between a user and a debugging system than the traditional step-wise debugging technique.

• Journal of Forest and Environmental Science
• /
• v.34 no.2
• /
• pp.180-183
• /
• 2018

Fecal sites of the Siberian flying squirrel Pteromys volans were found in the 16 tree species, and 11 species (46.4%) of them were used as fecal sites in winter and only 3 tree species (5.6%) were used for their fecal dropping in summer. In winter and spring, 11 and 10 tree species were used as fecal sites, respectively, indicating that various species of trees are used in those seasons for food sources or resting sites of the flying squirrels. Of total 16 species, the flying squirrels' fecal sites were most frequently found in Quercus mongolica (46.4%) and then followed by Prunus sargentii (25.6%). In winter, Prunus sargentii was preferred more than Quercus mongolica, although trees of Prunus sargentii are less distributed compared with those of various trees of the genus Quercus. In summer and autumn, high productivity of trees makes the flying squirrels use only one or two species they prefer. In winter and spring, however, they should extend their food source to various tree species because of low productivity and less food sources.

• Journal of Forest and Environmental Science
• /
• v.34 no.5
• /
• pp.412-417
• /
• 2018

Agroforestry is emerged as climate smart agriculture system and known to help in maintaining soil nutrient sustainability but its rate of expansion is still not appreciable. The present paper incorporates the different species under various agroforestry practices its density, growth and growing stock. The most dominated agroforestry practices in Bilaspur district identified as boundary tree based agri- silviculture (32%) followed with inside field tree based agri-silviculture (21%). Agri-horti-silvicultural system found merely in 5% farmer's field while silvo-pastoral practice in 8% fields. The result depicts that the most prevailing agroforestry tree species in non-forest area of Bilaspur comprises Acacia nilotica 36%, Butea monosperma 22%, Albizia spp 16%, Terminalia arjuna 7%, Azadirachta indica 3.5% and other species 15.5%. More than 90% farmer allows tree species growing naturally in their fields mainly for fuel wood, timber and as source of additional income as these species need not require special attention and care, while only 5% farmer's has adopted Tectona grandis, Dalbergia sissoo etc commercially for higher future return. The paper also discusses the constraints on agroforestry for enabling development of agroforestry in future.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.258-261
• /
• 2007

Although there have been lack of studies using X-band SAR data particularly for forestry application as compared to C-, and L-band SAR data, it has a potential to distinguish tree species because most signals are backscattered on the top of canopy. This study aimed to compare signal characteristics of multi-band SAR data including X-band for classifying tree species. The data used for the study are SIR-C/X-SAR data (X-, C-, L-band) obtained on Oct. 3, 1994 over the forest area near Seoul, S. Korea. Thirty ground sample plots were collected per each tree species. Initial comparison of backscattering coefficients among three SAR bands shows that X-band data showed better separation of tree species than C- and L-band SAR data irrespective of polarization. The weak penetrating in canopy layer might be possible source of information for X-band data to be useful for the classification of forest species and cover type mapping.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2007.06a
• /
• pp.464-465
• /
• 2007

Solid insulation exposed to voltage is degraded by electrical tree process. And the degradation of the insulation is accelerated by voltage application. For this experimental, specimen of electrical tree model is made by XLPE (cross-linked polyethylene). And the size of the specimen is $7*5*7\;mm^3$. Distance of needle and plane is 2 mm. Voltages applied for acceleration test are 12 kV to 15 kV. And distribution characteristic of degraded stage is studied too. As a PD detecting and data process, discharge data acquire from PD detecting system (Biddle instrument). The system presents statistical distribution as phase resolved. Moreover the processing time of electrical tree is recorded to know the speed of degradation according to voltage.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1B
• /
• pp.27-38
• /
• 2005

IP Multicast has not been deployed because of hardware problems. So a new scheme that is called Overlay Multicast for group communication has been emerged. It supports IP Multicast functions, which is located on application level. For developing it, we have been focused on efficient overlay tree construction among group members with low stretch and stress. However, we should consider a variety of transmission or receipt condition since a real internet environment has users with various transmission/receipt rates. Thus, we make one-time source specific tree depending on required bandwidth informationof group members when a member requests data transmission. Our mechanism provides satisfied data quality limited maximum transmission rate of the source to each group members. Furthermore, we manage a large group enough as distributing control information to cores that are designated membersfor maintaining host member information. Lastly, we prove that our tree guarantees data quality to each group members, and show low tree consruction time is required. In addition, for evaluating group scalability, we analyze control information increasing rate via group size, and validate its scalability.