• Title/Summary/Keyword: Weight graph

Search Result 175, Processing Time 0.026 seconds

Reliability Analysis of Multi-functional Multi-state Standby System Using Weibull Distribution (와이블 분포를 이용한 다기능 다중상태 대기시스템의 신뢰도 분석)

  • Kim, Ji-Hye;Chung, Young-Bae
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.3
    • /
    • pp.138-147
    • /
    • 2017
  • As the functions and structure of the system are complicated and elaborated, various types of structures are emerging to increase reliability in order to cope with a system requiring higher reliability. Among these, standby systems with standby components for each major component are mainly used in aircraft or power plants requiring high reliability. In this study, we consider a standby system with a multi-functional standby component in which one standby component simultaneously performs the functions of several major components. The structure of a parallel system with multifunctional standby components can also be seen in real aircraft hydraulic pump systems and is very efficient in terms of weight, space, and cost as compared to a basic standby system. All components of the system have complete operation, complete failure, only two states, and the system has multiple states depending on the state of the component. At this time, the multi-functional standby component is assumed to be in a non-operating standby state (Cold Standby) when the main component fails. In addition, the failure rate of each part follows the Weibull distribution which can be expressed as increasing type, constant type, and decreasing type according to the shape parameter. If the Weibull distribution is used, it can be applied to various environments in a realistic manner compared to the exponential distribution that can be reflected only when the failure rate is constant. In this paper, Markov chain analysis method is applied to evaluate the reliability of multi-functional multi-state standby system. In order to verify the validity of the reliability, a graph was generated by applying arbitrary shape parameters and scale parameter values through Excel. In order to analyze the effect of multi-functional multi-state standby system using Weibull distribution, we compared the reliability based on the most basic parallel system and the standby system.

A Study on the Heuristic Search Algorithm on Graph (그라프에서의 휴리스틱 탐색에 관한 연구)

  • Kim, Myoung-Jae;Chung, Tae-Choong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.10
    • /
    • pp.2477-2484
    • /
    • 1997
  • Best-first heuristic search algorithm, such as $A^{\ast}$ algorithm, are one of the most important techniques used to solve many problems in artificial intelligence. A common feature of heuristic search is its high computational complexity, which prevents the search from being applied to problems is practical domains such as route-finding in road map with significantly many nodes. In this paper, several heuristic search algorithms are concerned. A new dynamic weighting heuristic method called the pat-sensitive heuristic is proposed. It is based on a dynamic weighting heuristic, which is used to improve search effort in practical domain such as admissible heuristic is not available or heuristic accuracy is poor. It's distinctive feature compared with other dynamic weighting heuristic algorithms is path-sensitive, which means that ${\omega}$(weight) is adjusted dynamically during search process in state-space search domain. For finding an optimal path, randomly scattered road-map is used as an application area.

  • PDF

Noise Removal of Image Signals using Inflection Points on Histogram (히스토그램의 변곡점을 이용한 영상 신호의 잡음 제거)

  • Baek, Ji-Hyeon;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.11
    • /
    • pp.1431-1436
    • /
    • 2020
  • In modern society, various video devices such as CCTV and black boxes are used for convenience. However, noise is frequently generated in the process of transmitting and receiving video images and video signals photographed at night. If such noise is not eliminated, the problem that the image is difficult to identify is generated. Accordingly, noise elimination of images in the image information is an indispensable step. Salt and Pepper noises are typical impulse noises among image noises. Previous research has been carried out as a method for eliminating noise, and CWMF, MMF and A-TMF are typical methods. In common, such a filter exhibits excellent performance in a low-density noise area, but a disadvantage is that noise elimination performance in a high-density noise area is somewhat insufficient. Accordingly, the proposed algorithm uses the inflection point of the histogram graph to separate areas and remove singular points, and proposes a weighting filter utilizing histogram distribution. PSNR was used for objective judgment.

Development of an Electronically Controlled Knee-Type Prosthetic Leg with a 4-Bar Linkage Structure for Lower Limb Amputee (대퇴 절단 장애인을 위한 4절 링크 구조의 전자 제어식 무릎형 의족)

  • Ji-Woon Lee;Hyun-Soo Woo;Dong-Young Ahn;Min Jo;Hak Yi;Ki-Young Kim
    • The Journal of Korea Robotics Society
    • /
    • v.19 no.2
    • /
    • pp.159-168
    • /
    • 2024
  • Lower limb amputees are increasing due to various reasons. It is difficult for lower limb amputees to walk without an assistive device such as a prosthetic leg. In this paper, an electronically controlled knee-type prosthetic leg with a 4-bar linkage structure for lower limb amputees was developed. The knee-type prosthetic leg has a 4-bar linkage structure and assists walking by using an integrated drive module. The torque is 90 Nm, the rotation speed is up to 120 deg, and it weight 1.9 kg, so it is lighter than a commercial prosthetic leg, so it can be used for a long time because there is less fatigue when walking. An integrated control board was developed by applying various sensors and microprocessor. The motor drive and encoder are built into the integrated drive module. The integrated control board and integrated drive module communicate using CAN. When a lower limb amputee wears a knee-type prosthetic leg and walks, it shows a shape similar to the swing phase graph of a normal people, and it is possible to walk naturally while walking.

A Folksonomy Ranking Framework: A Semantic Graph-based Approach (폭소노미 사이트를 위한 랭킹 프레임워크 설계: 시맨틱 그래프기반 접근)

  • Park, Hyun-Jung;Rho, Sang-Kyu
    • Asia pacific journal of information systems
    • /
    • v.21 no.2
    • /
    • pp.89-116
    • /
    • 2011
  • In collaborative tagging systems such as Delicious.com and Flickr.com, users assign keywords or tags to their uploaded resources, such as bookmarks and pictures, for their future use or sharing purposes. The collection of resources and tags generated by a user is called a personomy, and the collection of all personomies constitutes the folksonomy. The most significant need of the folksonomy users Is to efficiently find useful resources or experts on specific topics. An excellent ranking algorithm would assign higher ranking to more useful resources or experts. What resources are considered useful In a folksonomic system? Does a standard superior to frequency or freshness exist? The resource recommended by more users with mere expertise should be worthy of attention. This ranking paradigm can be implemented through a graph-based ranking algorithm. Two well-known representatives of such a paradigm are Page Rank by Google and HITS(Hypertext Induced Topic Selection) by Kleinberg. Both Page Rank and HITS assign a higher evaluation score to pages linked to more higher-scored pages. HITS differs from PageRank in that it utilizes two kinds of scores: authority and hub scores. The ranking objects of these pages are limited to Web pages, whereas the ranking objects of a folksonomic system are somewhat heterogeneous(i.e., users, resources, and tags). Therefore, uniform application of the voting notion of PageRank and HITS based on the links to a folksonomy would be unreasonable, In a folksonomic system, each link corresponding to a property can have an opposite direction, depending on whether the property is an active or a passive voice. The current research stems from the Idea that a graph-based ranking algorithm could be applied to the folksonomic system using the concept of mutual Interactions between entitles, rather than the voting notion of PageRank or HITS. The concept of mutual interactions, proposed for ranking the Semantic Web resources, enables the calculation of importance scores of various resources unaffected by link directions. The weights of a property representing the mutual interaction between classes are assigned depending on the relative significance of the property to the resource importance of each class. This class-oriented approach is based on the fact that, in the Semantic Web, there are many heterogeneous classes; thus, applying a different appraisal standard for each class is more reasonable. This is similar to the evaluation method of humans, where different items are assigned specific weights, which are then summed up to determine the weighted average. We can check for missing properties more easily with this approach than with other predicate-oriented approaches. A user of a tagging system usually assigns more than one tags to the same resource, and there can be more than one tags with the same subjectivity and objectivity. In the case that many users assign similar tags to the same resource, grading the users differently depending on the assignment order becomes necessary. This idea comes from the studies in psychology wherein expertise involves the ability to select the most relevant information for achieving a goal. An expert should be someone who not only has a large collection of documents annotated with a particular tag, but also tends to add documents of high quality to his/her collections. Such documents are identified by the number, as well as the expertise, of users who have the same documents in their collections. In other words, there is a relationship of mutual reinforcement between the expertise of a user and the quality of a document. In addition, there is a need to rank entities related more closely to a certain entity. Considering the property of social media that ensures the popularity of a topic is temporary, recent data should have more weight than old data. We propose a comprehensive folksonomy ranking framework in which all these considerations are dealt with and that can be easily customized to each folksonomy site for ranking purposes. To examine the validity of our ranking algorithm and show the mechanism of adjusting property, time, and expertise weights, we first use a dataset designed for analyzing the effect of each ranking factor independently. We then show the ranking results of a real folksonomy site, with the ranking factors combined. Because the ground truth of a given dataset is not known when it comes to ranking, we inject simulated data whose ranking results can be predicted into the real dataset and compare the ranking results of our algorithm with that of a previous HITS-based algorithm. Our semantic ranking algorithm based on the concept of mutual interaction seems to be preferable to the HITS-based algorithm as a flexible folksonomy ranking framework. Some concrete points of difference are as follows. First, with the time concept applied to the property weights, our algorithm shows superior performance in lowering the scores of older data and raising the scores of newer data. Second, applying the time concept to the expertise weights, as well as to the property weights, our algorithm controls the conflicting influence of expertise weights and enhances overall consistency of time-valued ranking. The expertise weights of the previous study can act as an obstacle to the time-valued ranking because the number of followers increases as time goes on. Third, many new properties and classes can be included in our framework. The previous HITS-based algorithm, based on the voting notion, loses ground in the situation where the domain consists of more than two classes, or where other important properties, such as "sent through twitter" or "registered as a friend," are added to the domain. Forth, there is a big difference in the calculation time and memory use between the two kinds of algorithms. While the matrix multiplication of two matrices, has to be executed twice for the previous HITS-based algorithm, this is unnecessary with our algorithm. In our ranking framework, various folksonomy ranking policies can be expressed with the ranking factors combined and our approach can work, even if the folksonomy site is not implemented with Semantic Web languages. Above all, the time weight proposed in this paper will be applicable to various domains, including social media, where time value is considered important.

Finding Influential Users in the SNS Using Interaction Concept : Focusing on the Blogosphere with Continuous Referencing Relationships (상호작용성에 의한 SNS 영향유저 선정에 관한 연구 : 연속적인 참조관계가 있는 블로고스피어를 중심으로)

  • Park, Hyunjung;Rho, Sangkyu
    • The Journal of Society for e-Business Studies
    • /
    • v.17 no.4
    • /
    • pp.69-93
    • /
    • 2012
  • Various influence-related relationships in Social Network Services (SNS) among users, posts, and user-and-post, can be expressed using links. The current research evaluates the influence of specific users or posts by analyzing the link structure of relevant social network graphs to identify influential users. We applied the concept of mutual interactions proposed for ranking semantic web resources, rather than the voting notion of Page Rank or HITS, to blogosphere, one of the early SNS. Through many experiments with network models, where the performance and validity of each alternative approach can be analyzed, we showed the applicability and strengths of our approach. The weight tuning processes for the links of these network models enabled us to control the experiment errors form the link weight differences and compare the implementation easiness of alternatives. An additional example of how to enter the content scores of commercial or spam posts into the graph-based method is suggested on a small network model as well. This research, as a starting point of the study on identifying influential users in SNS, is distinctive from the previous researches in the following points. First, various influence-related properties that are deemed important but are disregarded, such as scraping, commenting, subscribing to RSS feeds, and trusting friends, can be considered simultaneously. Second, the framework reflects the general phenomenon where objects interacting with more influential objects increase their influence. Third, regarding the extent to which a bloggers causes other bloggers to act after him or her as the most important factor of influence, we treated sequential referencing relationships with a viewpoint from that of PageRank or HITS (Hypertext Induced Topic Selection).

A New Approach to the Parameter Calibration of Two-Fluid Model (Two-Fluid 모형 파라미터 정산의 새로운 접근방안)

  • Kwon, Yeong-Beom;Lee, Jaehyeon;Kim, Sunho;Lee, Chungwon
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.39 no.1
    • /
    • pp.63-71
    • /
    • 2019
  • The two-fluid model proposed by Herman and Prigogine is useful for analyzing macroscopic traffic flow in a network. The two-fluid model is used for analyzing a network through the relationship between the ratio of stopped vehicles and the average moving speed of the network, and the two-fluid model has also been applied in the urban transportation network where many signalized or unsignalized intersections existed. In general, the average travel speed and moving speed of a network decrease, and the ratio of stopped vehicles and low speed vehicles in network increase as the traffic demand increases. This study proposed the two-fluid model considering congested and uncongested traffic situations. The critical velocity and the weight factor for congested situation are calibrated by minimizing the root mean square error (RMSE). The critical speed of the Seoul network was about 34 kph, and the weight factor of the congestion on the network was about 0.61. In the proposed model, $R^2$ increased from 0.78 to 0.99 when compared to the existing model, suggesting that the proposed model can be applied in evaluating network performances or traffic signal operations.

Regional irrigation control modeling and regional climate characteristics Research on the correlation (지역별 관수제어 모델링 및 지역별 기후 특성과의 연관성에 관한 연구)

  • Jeong, Jin-Hyoung;Jo, Jae-Hyun;Kim, Seung-Hun;Choi, Ahnryul;Lee, Sang-Sik
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.14 no.3
    • /
    • pp.184-192
    • /
    • 2021
  • Domestic agriculture is facing real problems, such as a decrease in the population in rural areas, a shortage of labor due to an aging population, and increased risks due to the deepening of climate change. Smart farming technology is being developed to solve these problems. In the development of smart agricultural technology, irrigation control plays an important role in creating an optimal growth environment and is an important issue in terms of environmental protection. This paper is about the study of collecting and analyzing the rhizosphere environmental data of domestic paprika farms for the purpose of improving the quality of crops, reducing production costs, and increasing production. Irrigation control modeling presented in this paper Control modeling is to graphically present changes in a medium weight, feed, and drainage due to regional climatic features. To derive the graph, the parameters were determined through data collection and analysis, and the suggested irrigation control modeling method was applied to the collected rhizosphere environmental data to control irrigation in 6 regions (Gangwon-do, Chungnam, Jeonbuk, Jeonnam, Gyeongbuk, and Gyeongnam). The parameters were obtained and graphs were derived from them. After that, a study was conducted to analyze the derived parameters to verify the validity of the irrigation control modeling method and to correlate them with climatic features (average temperature and precipitation).

Studies on Genetic Analysis by the Diallel Crosses in $F_2$ Generation of Cowpea(Vigna sinensis savi.) (동부 Diallel Cross$ F_2$세대의 유전분석에 관한 연구)

  • Kim, J.H.;Ko, M.S.;Chang, K.Y.
    • KOREAN JOURNAL OF CROP SCIENCE
    • /
    • v.28 no.2
    • /
    • pp.216-226
    • /
    • 1983
  • Genetic studies on the $F_2$ generation of a set of half diallel crosses involving six cowpea varieties were conducted. by the randomized block design with three replications to determine combining ability, gene action and the relationships between parents and their $F_2$ hybrids. The 12 agronomic characters namely, days to flowering, days from flowering to maturity, days to maturity, diameter of stem, length of internode, number of branches per plant, length of pod, number of pods per plant, number of grains per pod, number of grains per plant, 100 grain weight and grain weight per plot were observed, and the $F_2$ generation of this diallel set of crosses was analysed for each character according to the method by Jinks and Hayman. The results obtained are summarized as follows: 1. Vr-Wr graphical analyses; The following seven characters, days to flowering, number of branches per plant, length of pod, number of pods per plant, number of grains per plant, 100 grain weight and grain weight per plot appeared to be partially dominant, and over dominance was found for days from flowering to maturity, days to maturity, length of internode and number of grains per pod. But diameter of stem indicated partial dominance near complete dominance. 2. Estimates of genetic variance components; In the degree of dominance,. eight characters, that is, days to flowering, days from flowering to maturity, days to maturity, length of internode, number of pods per plant, number of grains per pod, number of grains per plant and grain weight per plot were expressed larger than 1. And the characters, days from flowering to maturity, number of branches per plant and number of grains per plant as the degree of mean dominance ($H_1$/D) were found to be negative value over other characters. On the other hand, apprent asymmetry of dominance-recessive allele ($H_2$ /$4H_1$) produced comparatively estimates with lower value on days from flowering to maturity, length of internode, number of branches per plant and number of grains per pod. 3. Analyses of combining ability; Mean square value of GCA(general combining ability) appeared to be more important than those of SCA (specific combining ability) for most characters, and among them, grain weight per plot showed the highest mean square value in GCA and SCA. 4. Effect of combining ability; Variety 178 was expressed as the highest GCA effects in five characters (days to flowering days to maturity, number of pods per plant, number of grains per plant and grain weight per plot). SCA effects were differed from parents, characters and crosses, but crosses between TVu 1857 $\times$ TVu 2885 and TVu 2702 $\times$ J78 were shown to be highly with SCA effects on yield.

  • PDF

Comparison of Deep Learning Frameworks: About Theano, Tensorflow, and Cognitive Toolkit (딥러닝 프레임워크의 비교: 티아노, 텐서플로, CNTK를 중심으로)

  • Chung, Yeojin;Ahn, SungMahn;Yang, Jiheon;Lee, Jaejoon
    • Journal of Intelligence and Information Systems
    • /
    • v.23 no.2
    • /
    • pp.1-17
    • /
    • 2017
  • The deep learning framework is software designed to help develop deep learning models. Some of its important functions include "automatic differentiation" and "utilization of GPU". The list of popular deep learning framework includes Caffe (BVLC) and Theano (University of Montreal). And recently, Microsoft's deep learning framework, Microsoft Cognitive Toolkit, was released as open-source license, following Google's Tensorflow a year earlier. The early deep learning frameworks have been developed mainly for research at universities. Beginning with the inception of Tensorflow, however, it seems that companies such as Microsoft and Facebook have started to join the competition of framework development. Given the trend, Google and other companies are expected to continue investing in the deep learning framework to bring forward the initiative in the artificial intelligence business. From this point of view, we think it is a good time to compare some of deep learning frameworks. So we compare three deep learning frameworks which can be used as a Python library. Those are Google's Tensorflow, Microsoft's CNTK, and Theano which is sort of a predecessor of the preceding two. The most common and important function of deep learning frameworks is the ability to perform automatic differentiation. Basically all the mathematical expressions of deep learning models can be represented as computational graphs, which consist of nodes and edges. Partial derivatives on each edge of a computational graph can then be obtained. With the partial derivatives, we can let software compute differentiation of any node with respect to any variable by utilizing chain rule of Calculus. First of all, the convenience of coding is in the order of CNTK, Tensorflow, and Theano. The criterion is simply based on the lengths of the codes and the learning curve and the ease of coding are not the main concern. According to the criteria, Theano was the most difficult to implement with, and CNTK and Tensorflow were somewhat easier. With Tensorflow, we need to define weight variables and biases explicitly. The reason that CNTK and Tensorflow are easier to implement with is that those frameworks provide us with more abstraction than Theano. We, however, need to mention that low-level coding is not always bad. It gives us flexibility of coding. With the low-level coding such as in Theano, we can implement and test any new deep learning models or any new search methods that we can think of. The assessment of the execution speed of each framework is that there is not meaningful difference. According to the experiment, execution speeds of Theano and Tensorflow are very similar, although the experiment was limited to a CNN model. In the case of CNTK, the experimental environment was not maintained as the same. The code written in CNTK has to be run in PC environment without GPU where codes execute as much as 50 times slower than with GPU. But we concluded that the difference of execution speed was within the range of variation caused by the different hardware setup. In this study, we compared three types of deep learning framework: Theano, Tensorflow, and CNTK. According to Wikipedia, there are 12 available deep learning frameworks. And 15 different attributes differentiate each framework. Some of the important attributes would include interface language (Python, C ++, Java, etc.) and the availability of libraries on various deep learning models such as CNN, RNN, DBN, and etc. And if a user implements a large scale deep learning model, it will also be important to support multiple GPU or multiple servers. Also, if you are learning the deep learning model, it would also be important if there are enough examples and references.