• Journal of Korean Society of Transportation
• /
• v.28 no.4
• /
• pp.129-139
• /
• 2010

This study proposes a model for measuring the connectivity of nodes in road networks. The connectivity index between two nodes is characterized by the number of routes, degree of circuitousness, design speed, and route capacity between the nodes. The connectivity index of a node is then defined as the weighted average of the connectivity indexes between the node and other nodes under consideration. The weighting factor between two nodes is determined by the travel demand and distance between them. The application of the model to a toy network shows that it reasonably well quantifies the level of connectivity of nodes in the network. If flow of rail networks can be measured in the same scale as that of road networks and the capacity of rail links can be estimated, the model proposed in this paper could be applied to intermodal transportation networks as well.

• Journal of the Economic Geographical Society of Korea
• /
• v.17 no.4
• /
• pp.718-742
• /
• 2014

The capitalist economic process of glocalization and development of transportation and communication technology have led us to the significance of network city as well as concepts of global city, megacity region, etc. Network city theory pursues development of both individual cities and of the region of those cities through strengthening of mutual connectivity among them with specialized industries. On the basis of network city theory, this paper is to analyze specialized industries of cities and connectivity among them in the Youngnam region in S. Korea. It uses the methods of locational quotient, locational Gini coefficient, and shift-share method to analyze specialized industries of cities, and correspondence analysis, global and local Moran's I to examine connectivity among cities. As results, it can be identified that each city in the Youngnam region has its own specialized industries different from each others, but it seems not easy to grasp the overall extent of connectivity among them, partly because of the limitations of applied analysis methods and partly because of a lack of connectivity among cities themselves.

• Science of Emotion and Sensibility
• /
• v.21 no.3
• /
• pp.83-102
• /
• 2018

The process model of emotion regulation suggests that cognitive reappraisal and expressive suppression engage at different time points in the regulation process. Although multiple brain regions and networks have been identified for each strategy, no articles have explored changes in network characteristics or network connectivity over time. The present study examined (a) the whole-brain network and six other resting-state networks, (b) their modularity and global efficiency, which is an index of the efficiency of information exchange across the network, (c) the degree and betweenness centrality for 160 brain regions to identify the hub nodes with the most control over the entire network, and (d) the intra-network and inter-network functional connectivity (FC). Such investigations were performed using a traditional large-scale FC analysis and a relatively recent sliding window correlation analysis. The results showed that the right inferior orbitofrontal cortex was the hub region of the whole-brain network for both strategies. The present findings of temporally altering functional activity of the networks revealed that the default mode network (DMN) activated at the early stage of reappraisal, followed by the task-positive networks (cingulo-opercular network and fronto-parietal network), emotion-processing networks (the cerebellar network and DMN), and sensorimotor network (SMN) that activated at the early stage of suppression, followed by the greater recruitment of task-positive networks and their functional connection with the emotional response-related networks (SMN and occipital network). This is the first study that provides neuroimaging evidence supporting the process model of emotion regulation by revealing the temporally varying network efficiency and intra- and inter-network functional connections of reappraisal and suppression.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12B
• /
• pp.1670-1679
• /
• 2011

In the area of wireless sensor networks, sensor coverage and network connectivity problems are caused by a limited detection range and the communication distance of the nodes. To solve the coverage and connectivity problems, many studies are suggested, but most research is restricted to apply into the real environment because they didn't consider various environmental factors on wireless sensor network deployment. So in this paper, we propose a node deployment strategy considering environmental factors and the number of nodes in surveillance and reconnaissance sensor networks(SRSN). The proposed node deployment method divides the installation of the surveillance and reconnaissance sensor networks system into four steps such as identification of influences factors for node placement through IPB process, sensor node deployment based on sensing range, selection of monitoring site, and relay node deployment based on RF communication range. And it deploys the sensor nodes and relay nodes considered the features of the surveillance and reconnaissance sensor network system and environmental factors. The result of simulation indicates that the proposed node deployment method improves sensor coverage and network connectivity.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.227-237
• /
• 2014

Throughput scaling laws for two coexisting ad hoc networks with m primary users (PUs) and n secondary users (SUs) randomly distributed in an unit area have been widely studied. Early work showed that the secondary network performs as well as stand-alone networks, namely, the per-node throughput of the secondary networks is ${\Theta}(1/\sqrt{n{\log}n})$. In this paper, we show that by exploiting directional spectrum opportunities in secondary network, the throughput of secondary network can be improved. If the beamwidth of secondary transmitter (TX)'s main lobe is ${\delta}=o(1/{\log}n)$, SUs can achieve a per-node throughput of ${\Theta}(1/\sqrt{n{\log}n})$ for directional transmission and omni reception (DTOR), which is ${\Theta}({\log}n)$ times higher than the throughput with-out directional transmission. On the contrary, if ${\delta}={\omega}(1/{\log}n)$, the throughput gain of SUs is $2{\pi}/{\delta}$ for DTOR compared with the throughput without directional antennas. Similarly, we have derived the throughput for other cases of directional transmission. The connectivity is another critical metric to evaluate the performance of random ad hoc networks. The relation between the number of SUs n and the number of PUs m is assumed to be $n=m^{\beta}$. We show that with the HDP-VDP routing scheme, which is widely employed in the analysis of throughput scaling laws of ad hoc networks, the connectivity of a single SU can be guaranteed when ${\beta}$ > 1, and the connectivity of a single secondary path can be guaranteed when ${\beta}$ > 2. While circumventing routing can improve the connectivity of cognitive radio ad hoc network, we verify that the connectivity of a single SU as well as a single secondary path can be guaranteed when ${\beta}$ > 1. Thus, to achieve the connectivity of secondary networks, the density of SUs should be (asymptotically) bigger than that of PUs.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.6
• /
• pp.25-32
• /
• 2017

We are living in networks which are regarded as a society. However, it is difficult to designate a specific position or the impact over sociological relationships and virtual links. In this paper, we conceptualize two themes of the network as Physical Network and Virtual Network, and observe their cross-network effects. New concept called Networked Community (NC) is then introduced to walk through both PN and VN by using the element of connections say connectivity feature. Through modeling NC by the theme of network transposition and egocentric network, we try to comprehend all possible networks for detecting the problems and solutions by using both sides' idea. Experimental results show that we can model real-world problems and then analyze them through NC by measurable and structural manner.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.21 no.2
• /
• pp.53-64
• /
• 2018

This study aims to quantitatively evaluate the conservation priorities of unexecuted urban parks in Seoul both from an ecological and public perspective. To this end, two methodologies, ecological network analysis based on graph and circuit theory and accessibility analysis, were employed in order to assess ecological connectivity of and public accessibility to unexecuted parks, respectively. This study applied linkage-mapping methods (shortest path and current flow betweenness centrality) of connectivity analysis to an integrated map of landscape permeability. The population-weighted accessibility to unexecuted parks was measured based on a negative exponential distance decay function. As a result, for both ecological connectivity and accessibility, Gwanaksan, Suraksan, and Bulamsan urban natural parks are found to be the most important (rank 1-3) to be conserved. For these sites, inner park areas with conservation priorities for connectivity and accessibility were identified. The findings of the study can be used for giving conservation priority to the unexecuted urban parks in terms of long-term sustainable urban planning.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4372-4388
• /
• 2014

Robotic sensor network (RSN) contains mobile sensors and robots providing feasible solution for many multi-agent applications. One of the most critical issues in RSN and its application is how to effectively assign tasks. This paper presents a novel connectivity preserving hybrid task allocation strategy to answer the question particularly for RSN. Firstly, we model the task allocation in RSN to distinguish the discovering and allocating processes. Secondly, a fully distributed simple Task-oriented Unoccupied Neighbor Algorithm, named TUNA, is developed to allocate tasks with only partial view of the network topology. A connectivity controller is finally developed and integrated into the strategy to guarantee the global connectivity of entire RSN, which is critical to most RSN applications. The correctness, efficiency and scalability of TUNA are proved with both theoretical analysis and experimental simulations. The evaluation results show that TUNA can effectively assign tasks to mobile robots with the requirements of only a few messages and small movements of mobile agents.

• Journal of The Korean Association For Science Education
• /
• v.29 no.7
• /
• pp.751-758
• /
• 2009

The purpose of this study was to investigate brain activation pattern and functional connectivity network during classification on the biological phenomena. Twenty six right-handed healthy science teachers volunteered to be in the present study. To investigate participants' brain activities during the tasks, 3.0T fMRI system with the block experimental-design was used to measure BOLD signals of their brain. According to the analyzed data, superior, middle and inferior frontal gyrus, superior and inferior parietal lobule, fusiform gyrus, lingual gyrus, and bilateral cerebellum were significantly activated during participants' carrying-out classification. The network model was consisting of six nodes (ROIs) and its fourteen connections. These results suggested the notion that the activation and connections of these regions mean that classification is consist of two sub-network systems (top-down and bottom-up related) and it functioning reciprocally. These results enable the examination of the scientific classification process from the cognitive neuroscience perspective, and may be used as basic materials for developing a teaching-learning program for scientific classification such as brain-based science education curriculum in the science classrooms.

• Journal of information and communication convergence engineering
• /
• v.9 no.6
• /
• pp.625-628
• /
• 2011

Dynamic sensor network(DSN) technology which is based on swarming flight type air node offers analyzed and acquired information on target data gathered by air nodes in rotation flight or 3 dimension array flight. Efficient operation of dynamic sensor network based on air node is possible when problems of processing time, data transmission reliability, power consumption and intermittent connectivity are solved. Delay tolerant network (DTN) can be a desirable alternative to solve those problems. DTN using store-and-forward message switching technology is a solution to intermittent network connectivity, long and variable delay time, asymmetric data rates, and high error rates. However, all processes are performed at the bundle layer, so high power consumption, long processing time, and repeated reliability technique occur. DSN based on swarming flight type air node need to adopt store-and-forward message switching technique of DTN, the cancelation scheme of repeated reliability technique, fast processing time with simplified layer composition.