• Title/Summary/Keyword: real rank

Search Result 182, Processing Time 0.025 seconds

SIMPLE RANKED SAMPLING SCHEME: MODIFICATION AND APPLICATION IN THE THEORY OF ESTIMATION OF ERLANG DISTRIBUTION

  • RAFIA GULZAR;IRSA SAJJAD;M. YOUNUS BHAT;SHAKEEL UL REHMAN
    • Journal of applied mathematics & informatics
    • /
    • v.41 no.2
    • /
    • pp.449-468
    • /
    • 2023
  • This paper deals in the study of the estimation of the parameters of Erlang distribution based on rank set sampling and some of its modifications. Here we considered Maximum Likelihood (ML) and the Bayesian technique to estimate the shape and scale parameter of Erlang distribution based on RSS and its some modifications such as ERSS, MRSS, and MRSSu. The derivation for unknown parameters of Erlang distribution is well presented using normal approximation to the asymptotic distribution of ML estimators. But due to the complexity involves in the integral, the Bayes estimator of unknown parameters is obtained using MCMC method. Further, we compared the MSE of estimation in different sampling schemes with different set sizes and cycle size. A real-life data application is also given to illustrate the efficiency of the proposed scheme.

FPGA implementation of NCC-based real-time stereo matching processor (FPGA를 이용한 NCC기반의 실시간 스테레오 매칭 프로세서 구현)

  • Kim, Byeong-Jin;Bae, Sang-Min;Koh, Kwang-Sik
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.11a
    • /
    • pp.322-325
    • /
    • 2011
  • 스테레오 비전 시스템에서 전통적인 매칭 알고리즘으로 SAD(Sum of Absolute Differences), SSD(Sum of Squared Differences), NCC(Normalized Cross Correlation) 등 다양한 알고리즘이 존재한다. 그러나 하드웨어로 실시간 처리를 위한 시스템을 구현하기 위해서는 리소스가 한정 되어있다는 제약 때문에 많은 연구에서 SAD 혹은 RT(Rank Transform), CT(Census Transform)를 많이 사용하게 된다. FPGA 내부에는 BRAM(Block RAM)과 MAC(multiply-accumulator)인 DSP슬라이스가 이미 존재한다. 본 논문에서는 BRAM과 DSP로직을 활용해서 전통적인 매칭 알고리즘 중에서 연산기 사용이 가장 많은 NCC를 FPGA로 실시간 처리 가능한 하드웨어 구조를 제안한다.

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.

Increased Argonaute 2 Expression in Gliomas and its Association with Tumor Progression and Poor Prognosis

  • Feng, Bo;Hu, Peng;Lu, Shu-Jun;Chen, Jin-Bo;Ge, Ru-Li
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.15 no.9
    • /
    • pp.4079-4083
    • /
    • 2014
  • Background: Previous studies have showed that argonaute 2 is a potential factor related to genesis of several cancers, however, there have been no reports concerning gliomas. Methods: Paraffin specimens of 129 brain glioma cases were collected from a hospital affiliated to Binzhou Medical University from January 2008 to July 2013. We examined both argonaute 2 mRNA and protein expression by real-time quantitative PCR (qRT-PCR), Western blot analysis, and immunohistochemistry (IHC). The survival curves of the patients were determined using the Kaplan-Meier method and Cox regression, and the log-rank test was used for statistical evaluations. Results: Both argonaute 2 mRNA and protein were upregulated in high-grade when compared to low-grade tumor tissues. Multivariate analysis revealed that argonaute 2 protein expression was independently associated with the overall survival (HR=4.587, 95% CI: 3.001-6.993; P=0.002), and that argonaute 2 protein expression and WHO grading were independent prognostic factors for progression-free survival (HR=4.792, 95% CI: 3.993-5.672; P<0.001, and HR=2.109, 95% CI: 1.278-8.229; P=0.039, respectively). Kaplan-Meier analysis with the log-rank test indicated that high argonaute 2 protein expression had a significant impact on overall survival (P=0.0169) and progression-free survival (P=0.0324). Conclusions: The present study showed that argonaute 2 expression is up-regulated in gliomas. Argonaute 2 might also serve as a novel prognostic marker.

A Study on the Application Method for the Enclosed Effect in the Space of Cities (도시공간에 있어서 둘러싸인감의 적용방법에 대한 연구)

  • Hyoung, Sung-Eun
    • Science of Emotion and Sensibility
    • /
    • v.9 no.spc3
    • /
    • pp.277-286
    • /
    • 2006
  • This study evaluates how much D/H and enclosed effects are closely related with each other centering around the spaces of cities in Japan. The partial ranks of the degree of angle in D/H and of the enclosure of the real spaces which the experimenter feels are measured through the method of partial rank correlation analysis on the sane objects. The result shows that all 42 samples(0.49), 25 interior space samples(0.63), and 17 exterior samples(0.59) are analysed to be less correlated. Seen above, there is limit to explaining modern spaces with the degree of angle in D/H. The result reveals that the space structure of modem cities consists of a lot more complex elements, so it is not suitable to evaluate the spaces of cities with the past theories of D/H and enclosed effect. Therefore, to evaluate the enclosed effect, a new evaluation model and a study of influential elements of city spaces and enclosed effect should be developed.

  • PDF

Reproducibility and Sample Size in High-Dimensional Data (고차원 자료의 재현성과 표본 수)

  • Seo, Won-Seok;Choi, Jee-A;Jeong, Hyeong-Chul;Cho, Hyung-Jun
    • The Korean Journal of Applied Statistics
    • /
    • v.23 no.6
    • /
    • pp.1067-1080
    • /
    • 2010
  • A number of methods have been developed to determine sample sizes in clinical trial, and most clinical trial organizations determine sample sizes based on the methods. In contrast, determining sufficient sample sizes needed for experiments using microarray chips is unsatisfactory and not widely in use. In this paper, our objective is to provide a guideline in determining sample sizes, utilizing reproducibility of real microarray data. In the reproducibility comparison, five methods for discovering differential expression are used: Fold change, Two-sample t-test, Wilcoxon rank-sum test, SAM, and LPE. In order to standardize gene expression values, both MAS5 and RMA methods are considered. According to the number of repetitions, the upper 20 and 100 gene accordances are also compared. In determining sample sizes, more realistic information can be added to the existing method because of our proposed approach.

Comprehensive Analysis of Vascular Endothelial Growth Factor-C Related Factors in Stomach Cancer

  • Liu, Yong-Chao;Zhao, Jing;Hu, Cheng-En;Gan, Jun;Zhang, Wen-Hong;Huang, Guang-Jian
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.15 no.5
    • /
    • pp.1925-1929
    • /
    • 2014
  • Background: Vascular endothelial growth factor-C (VEGF-C), which contributes to lymphatic metastasis (LM) in malignant disease, is one of the most important factors involved in physical and pathological lymphangiogenesis. Some VEGF-C related factors such as sine oculis homeobox homolog (SIX) 1, contactin (CNTN) 1 and dual specificity phosphatase (DUSP) 6 have been extensively studied in malignancies, but their expression levels and associations have still to be elucidated in stomach cancer. Methods: We detected their expression levels in 30 paired stomach cancer tissues using quantitative real-time reverse transcription-PCR (qRT-PCR). The expression and clinical significance of each factor was analyzed using Wilcoxon signed rank sum test. The correlation among all the factors was performed by Spearman rank correlation analysis. Results: The results suggest that VEGF-C and CNTN1 are significantly correlated with tumor size, SIX1 with the age and CNTN1 also with the cTNM stage. There are significant correlations of expression levels among VEGF-C, SIX1, CNTN1 and DUSP6. Conclusions: There exists an important regulatory crosstalk involving SIX1, VEGF-C, CNTN1 and DUSP6 in stomach cancer.

Cross Platform Data Analysis in Microarray Experiment (서로 다른 플랫폼의 마이크로어레이 연구 통합 분석)

  • Lee, Jangmee;Lee, Sunho
    • The Korean Journal of Applied Statistics
    • /
    • v.26 no.2
    • /
    • pp.307-319
    • /
    • 2013
  • With the rapid accumulation of microarray data, it is a significant challenge to integrate available data sets addressing the same biological questions that can provide more samples and better experimental results. Sometimes, different microarray platforms make it difficult to effectively integrate data from several studies and there is no consensus on which method is the best to produce a single and unified data set. Methods using median rank score, quantile discretization and standardization (which directly combine rescaled gene expression values) and meta-analysis (which combine the results of individual studies at the interpretative level) are reviewed. Real data examples downloaded from GEO are used to compare the performance of these methods and to evaluate if the combined data set detects more reliable information from the separated data sets or not.

Cytokine expression pattern in milk somatic cells of subclinical mastitis-affected cattle analyzed by real time PCR

  • Bhatt, Vaibhav D.;Khade, Prasad S.;Tarate, Sagar B.;Tripathi, Ajai K.;Nauriyal, Dev S.;Rank, Dharamshi N.;Kunjadia, Anju P.;Joshi, Chaitanya G.
    • Korean Journal of Veterinary Research
    • /
    • v.52 no.4
    • /
    • pp.231-238
    • /
    • 2012
  • The expression profiles of inflammatory cytokines viz. interleukins (IL)-6, IL-8, IL-12, granulocyte macrophage-colony stimulating factor, interferon-${\gamma}$ and tumor necrosis factor-${\alpha}$ in response to subclinical mastitis in indigenous cattle breed Kankrej (n = 6), Gir (Bos indicus) (n = 12) and crossbred (Bos taurus${\times}$Bos indicus) (n = 7) were investigated using quantitative real time PCR. Significant correlation (p < 0.05) was observed between total bacterial load and somatic cell count (SCC) in all three breeds of cattle. All the cytokines were observed to be up-regulated compared to cows with healthy quarters, however, level of their expression varied among three breeds of cattle. In Kankrej most cytokines were found to be transcribed to higher levels than in other two breeds; the milk had higher load of bacteria but not so high SCC, implying that Kankrej has a higher inherent resistance against mastitis. The results of present study indicated that mammary glands of crossbred cattle are more sensitive to bacterial infection than indigenous breed of cattle as they elicit immune response at lower bacterial load and result into higher SCC. Research on identification of factors responsible for differentially expressed cytokines profiles and use of cytokines as immunomodulatory tools can pave way for formulating control strategies against bovine mastitis.

A Distributed Vertex Rearrangement Algorithm for Compressing and Mining Big Graphs (대용량 그래프 압축과 마이닝을 위한 그래프 정점 재배치 분산 알고리즘)

  • Park, Namyong;Park, Chiwan;Kang, U
    • Journal of KIISE
    • /
    • v.43 no.10
    • /
    • pp.1131-1143
    • /
    • 2016
  • How can we effectively compress big graphs composed of billions of edges? By concentrating non-zeros in the adjacency matrix through vertex rearrangement, we can compress big graphs more efficiently. Also, we can boost the performance of several graph mining algorithms such as PageRank. SlashBurn is a state-of-the-art vertex rearrangement method. It processes real-world graphs effectively by utilizing the power-law characteristic of the real-world networks. However, the original SlashBurn algorithm displays a noticeable slowdown for large-scale graphs, and cannot be used at all when graphs are too large to fit in a single machine since it is designed to run on a single machine. In this paper, we propose a distributed SlashBurn algorithm to overcome these limitations. Distributed SlashBurn processes big graphs much faster than the original SlashBurn algorithm does. In addition, it scales up well by performing the large-scale vertex rearrangement process in a distributed fashion. In our experiments using real-world big graphs, the proposed distributed SlashBurn algorithm was found to run more than 45 times faster than the single machine counterpart, and process graphs that are 16 times bigger compared to the original method.