• Title/Summary/Keyword: network density

Search Result 1,056, Processing Time 0.038 seconds

Image Recognition by Learning Multi-Valued Logic Neural Network

  • Kim, Doo-Ywan;Chung, Hwan-Mook
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.2 no.3
    • /
    • pp.215-220
    • /
    • 2002
  • This paper proposes a method to apply the Backpropagation(BP) algorithm of MVL(Multi-Valued Logic) Neural Network to pattern recognition. It extracts the property of an object density about an original pattern necessary for pattern processing and makes the property of the object density mapped to MVL. In addition, because it team the pattern by using multiple valued logic, it can reduce time f3r pattern and space fer memory to a minimum. There is, however, a demerit that existed MVL cannot adapt the change of circumstance. Through changing input into MVL function, not direct input of an existed Multiple pattern, and making it each variable loam by neural network after calculating each variable into liter function. Error has been reduced and convergence speed has become fast.

A Social Network Analysis of a Virtual Community of Practice

  • JO, Il-Hyun
    • Educational Technology International
    • /
    • v.9 no.2
    • /
    • pp.39-56
    • /
    • 2008
  • This paper investigates the relationship between the structural characteristics of a virtual CoP and the measures of social network analysis. Several implications were developed by the results of the study First, the study, based on reviews of both the CoP and SNA literature, identified specific structural measures of SNA; connectedness, geodesic distance, and density. Second, the formal CoP investigated in this study showed greater development that the classic, informal CoP in terms of the structural dimension of a CoP. The results show that those measures of social network analysis provide an illuminating way to better understand the structural properties of CoP's. Implications of the study with some suggestions for future research are provided.

Social Network Analysis for the Effective Adoption of Recommender Systems (추천시스템의 효과적 도입을 위한 소셜네트워크 분석)

  • Park, Jong-Hak;Cho, Yoon-Ho
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.4
    • /
    • pp.305-316
    • /
    • 2011
  • Recommender system is the system which, by using automated information filtering technology, recommends products or services to the customers who are likely to be interested in. Those systems are widely used in many different Web retailers such as Amazon.com, Netfix.com, and CDNow.com. Various recommender systems have been developed. Among them, Collaborative Filtering (CF) has been known as the most successful and commonly used approach. CF identifies customers whose tastes are similar to those of a given customer, and recommends items those customers have liked in the past. Numerous CF algorithms have been developed to increase the performance of recommender systems. However, the relative performances of CF algorithms are known to be domain and data dependent. It is very time-consuming and expensive to implement and launce a CF recommender system, and also the system unsuited for the given domain provides customers with poor quality recommendations that make them easily annoyed. Therefore, predicting in advance whether the performance of CF recommender system is acceptable or not is practically important and needed. In this study, we propose a decision making guideline which helps decide whether CF is adoptable for a given application with certain transaction data characteristics. Several previous studies reported that sparsity, gray sheep, cold-start, coverage, and serendipity could affect the performance of CF, but the theoretical and empirical justification of such factors is lacking. Recently there are many studies paying attention to Social Network Analysis (SNA) as a method to analyze social relationships among people. SNA is a method to measure and visualize the linkage structure and status focusing on interaction among objects within communication group. CF analyzes the similarity among previous ratings or purchases of each customer, finds the relationships among the customers who have similarities, and then uses the relationships for recommendations. Thus CF can be modeled as a social network in which customers are nodes and purchase relationships between customers are links. Under the assumption that SNA could facilitate an exploration of the topological properties of the network structure that are implicit in transaction data for CF recommendations, we focus on density, clustering coefficient, and centralization which are ones of the most commonly used measures to capture topological properties of the social network structure. While network density, expressed as a proportion of the maximum possible number of links, captures the density of the whole network, the clustering coefficient captures the degree to which the overall network contains localized pockets of dense connectivity. Centralization reflects the extent to which connections are concentrated in a small number of nodes rather than distributed equally among all nodes. We explore how these SNA measures affect the performance of CF performance and how they interact to each other. Our experiments used sales transaction data from H department store, one of the well?known department stores in Korea. Total 396 data set were sampled to construct various types of social networks. The dependant variable measuring process consists of three steps; analysis of customer similarities, construction of a social network, and analysis of social network patterns. We used UCINET 6.0 for SNA. The experiments conducted the 3-way ANOVA which employs three SNA measures as dependant variables, and the recommendation accuracy measured by F1-measure as an independent variable. The experiments report that 1) each of three SNA measures affects the recommendation accuracy, 2) the density's effect to the performance overrides those of clustering coefficient and centralization (i.e., CF adoption is not a good decision if the density is low), and 3) however though the density is low, the performance of CF is comparatively good when the clustering coefficient is low. We expect that these experiment results help firms decide whether CF recommender system is adoptable for their business domain with certain transaction data characteristics.

Analysis of Characteristics of the Dynamic Flow-Density Relation and its Application to Traffic Flow Models (동적 교통량-밀도 관계의 특성 분석과 교통류 모형으로의 응용)

  • Kim, Young-Ho;Lee, Si-Bok
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.3 s.74
    • /
    • pp.179-201
    • /
    • 2004
  • Online traffic flow modeling is attracting more attention due to intelligent transport systems and technologies. The flow-density relation plays an important role in traffic flow modeling and provides a basic way to illustrate traffic flow behavior under different traffic flow and traffic density conditions. Until now the research effort has focused mainly on the shape of the relation. The time series of the relation has not been identified clearly, even though the time series of the relation reflects the upstream/downstream traffic conditions and should be considered in the traffic flow modeling. In this paper the flow-density relation is analyzed dynamically and interpreted as a states diagram. The dynamic flow-density relation is quantified by applying fuzzy logic. The quantified dynamic flow-density relation builds the basis for online application of a macroscopic traffic flow model. The new approach to online modeling of traffic flow applying the dynamic flow-density relation alleviates parameter calibration problems stemming from the static flow-density relation.

A Delay Tolerant Vehicular Routing Protocol for Low Vehicle Densities in VANETs (차량 밀도가 낮은 VANET 환경을 위한 지연 허용 차량 라우팅 프로토콜)

  • Cha, Si-Ho;Ryu, Min-Woo;Cho, Kuk-Hyun
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.49 no.4
    • /
    • pp.82-88
    • /
    • 2012
  • A VANET (Vehicular Ad Hoc Network), a subclass of MANET (Mobile Ad Hoc Network), is an ad hoc network using wireless communication between vehicles without fixed infrastructure such as base station. VANET suffers a frequent link breakage and network topology change because of the rapid movement of vehicles and the density change of vehicles. From these characteristics of VANET, geographical routing protocols such as GPSR (Greedy Perimeter Stateless Routing) using only the information of neighbor nodes are more suitable rather than AODV and DSR that are used in existing MANETs. However, GPSR may have a transmission delay and packet loss by frequent link disconnection and continual local maxima under the low vehicle density conditions. Therefore, in this paper, we propose a DTVR (Delay Tolerant Vehicular Routing) algorithm that perform a DTN-based routing scheme if there is no 2-hop neighbor nodes for efficient routing under the low vehicle densities in VANETs. Simulation results using ns-2 reveal that the proposed DTVR protocol performs much better performance than the existing routing protocols.

The Effect of Problem Based Learning on Nursing Students' Interaction and Self-directed Learning: A Social Network Analysis (문제중심학습방법이 대학생들의 학습자 상호작용 및 자기주도학습능력에 미치는 영향: 사회연결망 분석을 중심으로)

  • Piao, Mei Hua;Kim, Jeong Eun
    • Perspectives in Nursing Science
    • /
    • v.13 no.1
    • /
    • pp.29-35
    • /
    • 2016
  • Purpose: This study aimed to explore the underlying structures of students' interaction networks to monitor network changes during the year, to verify the relationship with self-directed learning, and to identify the effect of problem-based learning on interaction and self-directed learning. Methods: A longitudinal study was designed which included 3 parts (A=25, B=27, C=26) with a total of 78 second-year nursing students from 2013 to 2014. Interaction indicators used group network centralization and density, and individual in-degree centrality. Results: Group network centralization showed mean reversion patterns, however, centralization and density showed a slight increase from 2013 to 2014 (Centralization of A part from 52.78 to 36.96, B part from 20.56 to 32.20, C part from 34.40 to 37.24; Density of A part from 0.122 to 0.123, B part from 0.111 to 0.121, C part from 0.109 to 0.121). The individual in-degree centrality is significantly correlated with self-directed learning and the correlation coefficient increased during the year (r=.274 in 2013, r=.356 in 2014, p<.001). Conclusion: Students share information more interactively during the year and the more they share the higher the scores of self-directed learning.

A Methodology for Rain Gauge Network Evaluation Considering the Altitude of Rain Gauge (강우관측소의 설치고도를 고려한 강우관측망 평가방안)

  • Lee, Ji Ho;Jun, Hwan Don
    • Journal of Wetlands Research
    • /
    • v.16 no.1
    • /
    • pp.113-124
    • /
    • 2014
  • The observed rainfall may be different along with the altitude of rain gauge, resulting in the fact that the characteristics of rainfall events occurred in urban or mountainous areas are different. Due to the mountainous effects, in higher altitude, the uncertainty involved in the rainfall observation gets higher so that the density of rain gauges should be more dense. Basically, a methodology for the rain gauge network evaluation, considering this altitude effect of rain gauges can account for the mountainous effects and becomes an important step for forecasting flash flood and calibrating of the radar rainfall. For this reason, in this study, we suggest a methodology for rain gauge network evaluation with consideration of the rain gauge's altitude. To explore the density of rain gauges at each level of altitude, the Equal-Altitude-Ratio of the density of rain gauges, which is based on the fixed amount of elevation and the Equal-Area-Ratio of the density of rain gauges, which is based on the fixed amount of basin area are designed. After these two methods are applied to a real watershed, it is found that the Equal-Area-Ratio generates better results for evaluation of a rain gauge network with consideration of rain gauge's altitude than the Equal-Altitude-Ratio does. In addition, for comparison between the soundness of rain gauge networks in other watersheds, the Coefficient of Variation (CV) of the rain gauge density by the Equal-Area-Ratio is served as the index for the evenness of the distribution of the rain gauge's altitude. The suggested method is applied to the five large watersheds in Korea and it is found that rain gauges installed in a watershed having less value of the CV shows more evenly distributed than the ones in a watershed having higher value of the CV.

Non-parametric Density Estimation with Application to Face Tracking on Mobile Robot

  • Feng, Xiongfeng;Kubik, K.Bogunia
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.49.1-49
    • /
    • 2001
  • The skin color model is a very important concept in face detection, face recognition and face tracking. Usually, this model is obtained by estimating a probability density function of skin color distribution. In many cases, it is assumed that the underlying density function follows a Gaussian distribution. In this paper, a new method for non-parametric estimation of the probability density function, by using feed-forward neural network, is used to estimate the underlying skin color model. By using this method, the resulting skin color model is better than the Gaussian estimation and substantially approaches the real distribution. Applications to face detection and face ...

  • PDF

The Effects of Team Network Characteristics and Boundary Spanning Activities on Knowledge Management Performances: The Mediating Role of Trust (팀 네트워크 특성과 경계관리 활동이 지식경영 성과에 미치는 영향: 팀 신뢰의 매개역할)

  • Goh, Yumi;Kim, Jee-Young;Chung, Myung-Ho
    • Knowledge Management Research
    • /
    • v.14 no.5
    • /
    • pp.101-120
    • /
    • 2013
  • The effective management of knowledge has become one of the critical success factors in current organizations. In spite of the extensive use of Knowledge Management System (KMS), useful information and knowledge resources are still transmitted through personal networks among people in organizations. Thus, social network theory which focuses on social relationships in organization can be a fruitful theoretical resource for enhancing Knowledge Management (KM) performances. In this study, we investigate the effects of intra-team network characteristics (i.e., group density and degree of centralization) and external boundary spanning activities on knowledge management performances of a team. We also acknowledge that all group members do not necessarily agree on the team goal and actively disseminate useful information and knowledge. Drawing on the political perspective on KM which emphasizes the role of trust among group members, we examine the mediating effects of team trust between internal/external network characteristics and KM performances. From the data of 220 teams in financial companies in Korea, we found that: (1) group density had positive effects on KM performances (i.e., knowledge creation, sharing, and use). (2) However, centralization was not significantly associated with KM performances. (3) Team trust was found to be an important factor mediating the relationship between intra-team network characteristics, boundary spanning activities, and KM performances. Based on these results, we discuss and suggest possible implications of the findings when designing and implementing KM practices.

  • PDF

Adaptive Wireless Network Coding for Infrastructure Wireless Mesh Networks

  • Carrillo, Ernesto;Ramos, Victor
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.7
    • /
    • pp.3470-3493
    • /
    • 2019
  • IEEE 802.11s-based infrastructure Wireless Mesh Networks (iWMNs) are envisaged as a promising solution to provide ubiquitous wireless Internet access. The limited network capacity is a problem mainly caused by the medium contention between mesh users and the mesh access points (MAPs), which gets worst when the mesh clients employ the Transmission Control Protocol (TCP). To mitigate this problem, we use wireless network coding (WNC) in the MAPs. The aim of this proposal is to take advantage of the network topology around the MAPs, to alleviate the contention and maximize the use of the network capacity. We evaluate WNC when is used in MAPs. We model the formation of coding opportunities and, using computer simulations, we evaluate the formation of such coding opportunities. The results show that as the users density grows, the coding opportunities increase up to 70%; however, at the same time, the coding delay increments significantly. In order to reduce such delay, we propose to adaptively adjust the time that a packet can wait to catch a coding opportunity in an MAP. We assess the performance of moving-average estimation methods to forecast this adaptive sojourn time. We show that using moving-average estimation methods can significantly decrease the coding delay since they consider the traffic density conditions.