• Title/Summary/Keyword: S-N Diagram

Search Result 132, Processing Time 0.025 seconds

Improved Social Network Analysis Method in SNS (SNS에서의 개선된 소셜 네트워크 분석 방법)

  • Sohn, Jong-Soo;Cho, Soo-Whan;Kwon, Kyung-Lag;Chung, In-Jeong
    • 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.

A Critical Path Search and The Project Activities Scheduling (임계경로 탐색과 프로젝트 활동 일정 수립)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.1
    • /
    • pp.141-150
    • /
    • 2012
  • This paper suggests a critical path search algorithm that can easily draw PERT/GANTT chart which manages and plans a project schedule. In order to evaluate a critical path that determines the project schedule, Critical Path Method (CPM) is generally utilized. However, CPM undergoes 5 stages to calculate the critical path for a network diagram that is previously designed according to correlative relationship and execution period of project execution activities. And it may not correctly evaluate $T_E$ (The Earliest Time), since it does not suggest the way how to determine the sequence of the nodes activities that calculate the $T_E$. Also, the sequence of the network diagram activities obtained from CPM cannot be visually represented, and hence Lucko suggested an algorithm which undergoes 9 stages. On the other hand, the suggested algorithm, first of all, decides the sequence in advance, by reallocating the nodes into levels after Breadth-First Search of the network diagram that is previously designed. Next, it randomly chooses nodes of each level and immediately determines the critical path only after calculation of $T_E$. Finally, it enables the representation of the execution sequence of the project activity to be seen precisely visual by means of a small movement of $T_E$ of the nodes that are not belonging to the critical path, on basis of the $T_E$ of the nodes which belong to the critical path. The suggested algorithm has been proved its applicability to 10 real project data. It is able to get the critical path from all the projects, and precisely and visually represented the execution sequence of the activities. Also, this has advantages of, firstly, reducing 5 stages of CPM into 1, simplifying Lucko's 9 stages into 2 stages that are used to clearly express the execution sequence of the activities, and directly converting the representation into PERT/GANTT chart.

Design of a 2.5V 10-bit 300MSPS CMOS D/A Converter (2.5V 10-bit 300MSPS 고성능 CMOS D/A 변환기의 설계)

  • Kwon, Dae-Hoon;Song, Min-Kyu
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.39 no.7
    • /
    • pp.57-65
    • /
    • 2002
  • In this paper, a 2.5V 10-bit 300MSPS CMOS D/A Converter is described. The architecture of the D/A Converter is based on a current steering 8+2 segmented type, which reduces non-linearity error and other secondary effects. In order to achieve a high performance D/A Converter, a novel current cell with a low spurious deglitchnig circuit and a novel inverse thermomeer decoder are proposed. To verify the performance, it is integrated with $0.25{\mu}m$ CMOS 1-poly 5-metal technology. The effective chip area is $1.56mm^2$ and power consumption is about 84mW at 2.5V power supply. The simulation and experimental results show that the glitch energy is 0.9pVsec at fs=100MHz, 15pVsec at fs=300MHz in worst case, respectively. Further, both of INL and DNL are within ${\pm}$1.5LSB, and the SFDR is about 45dB when sampling, frequency, is 300MHz and output frequency is 1MHz.

Evaluation for Rock Cleavage Using Distribution of Microcrack Spacings (I) (미세균열의 간격 분포를 이용한 결의 평가(I))

  • Park, Deok-Won
    • The Journal of the Petrological Society of Korea
    • /
    • v.25 no.1
    • /
    • pp.13-27
    • /
    • 2016
  • The characteristics of the rock cleavage inherent in Jurassic granite from Geochang were analysed. The phases of distribution of microcrack spacings were derived from the enlarged photomicrographs(${\times}6.7$) of the thin section. The evaluation for the six directions of rock cleavages was performed using nine parameters such as (1) frequency of microcrack spacing(N), (2) frequency ratio(${\leq}1mm$ and 4 mm >) to total spacing frequency(N:191), (3) spacing ratio(${\leq}1mm$) to total spacing(118.49 mm), (4) mean spacing($S_{mean}$), (5) difference value($S_{mean}-S_{median}$) between mean spacing and median spacing($S_{median}$), (6) density of spacing, (7) median spacing, (8) reduction ratio of spacing frequency to length frequency and (9) magnitude of exponent(${\lambda}$ and b) related to the distribution type of diagram. Especially the close dependence between the above spacing parameters and the parameters from the spacing-cumulative frequency diagrams was derived. The results of correlation analysis between the values of parameters for three rock cleavages and those for three planes are as follows. The values of (I) parameters(1, 2 and 3), (II) parameters(4, 5 and 6), (III) parameter(7), (IV) parameter(8) and (V) parameter(9) show the various orders of H(hardway, H1+H2) < G(grain, G1+G2) < R(rift, R1+R2), R < G < H, R < H < G, G < H < R and H < G < R, respectively. On the contrary, the values of the above four groups(I~IV) of parameters for three planes show reverse orders. This type of correlation analysis is useful for discriminating three quarrying planes. Six spacing-cumulative frequency diagrams were arranged in increasing order on the value of main parameter($S_{mean}-S_{median}$). These diagrams show an order of R2 < R1 < G2 < G1 < H2 < H1 from the related chart. In other words, the above six diagrams can be summarized in order of rift(R1+R2) < grain(G1+G2) < hardway(H1+H2). These results indicate a relative magnitude of rock cleavage related to microcrack spacing. Especially, the above main parameter could provide advanced information for prediction the order of arrangement among the diagrams.

REE and Sr-Nd Isotopic Composition of the Shelf Sediments around Jeju Island, Korea (제주도 주변 대륙붕 퇴적물의 REE와 Sr-Nd 동위원소 조성)

  • Kim, Tae-Joung;Youn, Jeungsu
    • Journal of the Korean earth science society
    • /
    • v.33 no.6
    • /
    • pp.481-496
    • /
    • 2012
  • REE, major and trace elements, and Sr-Nd isotopic ratios of surface sediments around Jeju Island were analyzed for identifying the origin of the sediments. The Chemical Index of Alteration (CIA) between 44.2 to 68.9 (av. 59.4) shows a similarity with the Huanghe sediment. The most sediments found within the study areas show a very similar chondrite-normalized REE pattern that has enriched LREE ($La_{(N)}/Sm_{(N)}$ >3) and small negative Eu anomaly, typically of average shales. The UCC-nornalized REE patterns of the southwestern offshore sediment samples show a very similar pattem with the Changjiang sediment with enriched in most REE and more convex REE pattern than those of the Huanghe and Keum rivers sediments, which indicates that the Changjiang River's suspended sediments have been transported into the western part of Jeju Island. The $^{87}Sr/^{86}Sr$ isotopic ratios vs ${\varepsilon}_{Nd}(0)$ values were thus used as a tracer to discriminate the provenance of sediments in the study area. Based on the discriminated diagram, it clearly showed that most sediments in the western and northwestern part were closely plotted with sediments of the Huanghe River. However, the sediments in the southwestern part near the Changjianf estuary were closely plotted with submerged delta sediments of the Changjiang River. In contrast, the sediment samples of the northeastern part showed discriminative figures from those of the Chinese rivers. It suggests that sediments around Jeju Island must be originated from diverse sources.

Oceanographic Features Around Aquaculture Areas of the Eastern Coast of Korea (동해안 연안양식장 주변해역의 해양학적 특성)

  • Jeong, Hee-Dong;Kim, Sang-Woo;Kwon, Kee-Young;Lim, Jin-Wook;Kwoun, Chul-Hui
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.19 no.4
    • /
    • pp.334-344
    • /
    • 2013
  • In order to understand the characteristics of oceanic environment in the coastal aquaculture waters of the East Sea, the observation of the CTD (temperature and salinity), dissolved oxygen, chlorophyll a and N/P (DIN ($NO_2$-N, $NO_3$-N, $NH_4$-N) : DIP($PO_4$-P)) ratio was carried out at Sokcho, Jukbyon and Gampo in February, April, June, August, October, December 2013. Based on T(temperature)-S(salinity) diagram analysis, the water masses in the study area were divided into 3 groups; Tsushima Surface Water (TSW: $20-28.3^{\circ}C$ temperatures and 31.04-33.75 salinities), Tsushima Middle Water (TMW: $8.1-16.3^{\circ}C$ and 33.00-34.49), and North Korean Cold Water (NKCW: $1.8-9.4^{\circ}C$ and 33.78-34.42). In winter, DO concentrations in the northern part were higher than those in southern part. In spring and fall, they were low in the surface layer, and increased in summer. Chl-a concentrations < $0.4{\mu}g/L$ dominated in February, April, October and December. Chl-a concentrations were higher in June and August. In particular, the highest Chl-a concentration > $2{\mu}g/L$ was observed in the middle layer of Gampo in August. In February, April, June and December, the N/P ratio in the most of the water masses was less than the Redfield ratio (16), indicating that nitrate did act as a limiting factor in phytoplankton growth. On the contrary, in August and October, the N/P ratio in surface and sub-surface layer was greater than the Redfield ratio, suggesting that phosphate was a limiting factor.

Oxygen-18 and Nutrients in the Surface Waters of the Bransfield Strait, Antarctica during Austral Summer 1990/91 (1990/91년 남극하계 브렌스필드 해협 표층해수의 $\delta$/SUP 18/O와 영양염 분포)

  • KANG, DONG-JIN;CHUNG, CHANG SOO;COOPER, LEE W.;KANG, CHEONG YOON;KIM, YEA DONG;HONG, GI HOON
    • 한국해양학회지
    • /
    • v.27 no.3
    • /
    • pp.250-258
    • /
    • 1992
  • The oxygen isotope composition of surface waters in the Bransfield Strait was determined as one extra state variable in order to characterize water masses in the region, since salinity is significantly modified due to the freezing and ice-melting in the polar region. The salinity, temperature, and $\delta$/SUP 18/O values vary from 34.0 to 34.5$\textperthousand$, -.05 to 2.1$^{\circ}C$ and -0.50 t -0.26$\textperthousand$, respectively. The combined effects of evaporation, precipitation, freezing, ice-melting are reflected in the widely scattered data. Although it is small, the distribution of $\delta$/SUP 18/O of the Bransfield Strait is strongly affected by the freezing-ice melting rather than the evaporation-precipitation. The ice melted fresh water which has higher temperature, depleted salinity and nutrients may be injected to the Bransfield Strait from the north. The concentrations of nutrients are decreasing gradually from the north to the south. The waters were characterized by two groups of higher (about 19.4) and lower N/P ratio (about 16.7). The lower N/P ratio is found in the northern part where ice-melted fresh water is injected. and the higher N/P ratio is found in the southern part of the Bransfield Strait. Although more precise work is needed, the deference of N/P ratio can be an evidence of the ice melted water injection to the Bransfield Strait. Chlorophyll a concentrations, in general, increase from northwest (Waddell Sea) to the southeast (Smith and Hosseason Islands). Probably the injection of nutrient depleted fresh water from the ice melting reduce the chlorophyll a concentration.

  • PDF

Fatigue CAE Analysis of a Rebar Bending Machine Roller (철근 밴딩기 롤러의 피로파괴 CAE 해석)

  • Shin, Yu-Jeong;CHoi, Chang-Hwan;Lee, Sung-gun;Kim, Jin-Ho
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.14 no.2
    • /
    • pp.75-80
    • /
    • 2015
  • The rebar factory production process involves the repetitive bending of rebars. Therefore, the fatigue failure of the rebar bending machine needs to be considered. In this paper, fatigue analysis of the rebar machine was performed using the commercial software DAFUL, which is based on MFBD (Multi Flexible Body Dynamics). The rotating roller, fixing roller and rebar were modeled by the finite element method. The rebar bending process is simulated and the mechanical stresses on the rollers are calculated. Structural analysis of the rebar bending roller was performed using the maximum bending angle of $180^{\circ}$ and maximum processing rebar diameter of ${\Phi}19mm$. Then, for fatigue analysis, the S-N curve of STD-11 was. The fatigue life of rollers is estimated by modified Goodman diagram. The fatigue life range of the rotating roller is $2.99961{\times}10^5{\sim}1{\times}10^8$ while that of the fixed roller is $2.53142{\times}10^5{\sim}1{\times}10^8$. STD-11 has an infinite life cycle after $1{\times}10^8$. Therefore, the rollers of the rebar bending machine may be expected to suffer fatigue failure. Thus, we performed a parameter study of fatigue life according to various axial radii of the fixed roller and rotating roller, and redesign of the rebar bending machine. Consequently, the axial radius of the fixed roller and rotating roller was found to be 35~37.5mm and 30~35mm, respectively, and an infinite life cycle was confirmed at these.

A Software Architecture Design Method that Matches Problem Frames and Architectural Patterns (문제틀과 아키텍처 패턴의 매칭을 이용한 소프트웨어 아키텍처 설계 방법)

  • Kim, Jungmin;Kang, Sungwon;Lee, Jihyun
    • Journal of KIISE
    • /
    • v.42 no.3
    • /
    • pp.341-360
    • /
    • 2015
  • While architectural patterns provide software development solutions by providing schemas for structural organizations of software systems based on empirical knowledge, Jackson's problem frames provide a method of analyzing software problems. Problem frames are useful to understanding the software development problem, by putting emphasis on the problem domain, rather than on the solution space. Research exists that relates problem frames and software architecture, but most of this research uses problem frames only to understand given problems. Moreover, none of the existing research derives architectural patterns by considering both problem frames and quality attributes. In this paper, we propose a software architecture design method for pattern-based architecture design, by matching problem frames and architectural patterns. To that end, our approach first develops the problem model based on the problem frames approach, and then uses it to match with candidate architectural patterns, from the perspectives of both functionality, and quality attributes. Functional matching uses the problem frame diagram to match the problem model of an architectural pattern. We conduct a case study to show that our approach can systematically decide the right architectural patterns, and provide a basis for fine-grained software architecture design.

A Study on the Out-of-Step Detection Algorithm using Time Variation of Complex Power-Part II : Out-of-Step Detection Algorithm using a trajectory of Complex power (복소전력의 변화율을 이용한 동기탈조 검출 알고리즘에 관한 연구-Part II: 복소전력의 궤적 변화를 이용한 동기탈조 검출 알고리즘)

  • Kwon, O.S.;Kim, C.H.;Park, N.O.;Chai, Y.M.
    • Proceedings of the KIEE Conference
    • /
    • 2005.07a
    • /
    • pp.313-315
    • /
    • 2005
  • In a power system, an out-of-step condition causes a variety of risk such as serious damage to system elements, tripping of loads and generators, mal-operation of relays, etc. Therefore, it is very important to detect the out-of-step condition and take a proper measure. Several out-of-step detection methods have been employed in relays until now Mo,;t common method used for an out-of-step detection is based on the transition time through the blocking impedance area in R-X diagram. Also, the R-R dot out-of- step relay, the out-of-step prediction method and the adaptive out-of-step relay using the equal area criterion (EAC) and Global Positioning Satellite (GPS) technology have been developed. This paper presents the out-of-step detection algorithm using the time variation of the complex power. The complex power is calculated and the mechanical power of the generator is estimated by using the electrical power, and then the out-of-step detection algorithm, which is based on the complex Power and the estimated mechanical power, is presented. This algorithm, may detect the instant when the generator angle passes the Unstable Equilibrium Point (UEP). The proposed out-of-step algorithm is verified and tested by using Alternative Transient Program/Electromagnetic Transient Program (ATP/EMTP) MODELS.

  • PDF