2006 IEEE International Conference on Granular Computing最新文献_第2页

Privacy homomorphisms for e-gambling and mental poker 电子赌博和心理扑克的隐私同态

2006 IEEE International Conference on Granular Computing Pub Date : 2006-05-10 DOI: 10.1109/GRC.2006.1635918

Jordi Castellà-Roca, Vanesa Daza, J. Domingo-Ferrer, F. Sebé

{"title":"Privacy homomorphisms for e-gambling and mental poker","authors":"Jordi Castellà-Roca, Vanesa Daza, J. Domingo-Ferrer, F. Sebé","doi":"10.1109/GRC.2006.1635918","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635918","url":null,"abstract":"Abstract —With the development of computer networks, situ-ations where a set of players remotely play a game ( e-gaming )have become usual. Often players play for money ( e-gambling ),which requires standards of security similar to those in physicalgambling. Cryptographic tools have been commonly used so farto provide security to e-gambling. Homomorphic encryption isan example of such tools.In this paper we review the mental poker protocols, whereplayers are assumed to remotely play poker. We focus on the keyadvantage of using cryptosystems with homomorphic properties( privacy homomorphisms ) because they offer the possibility ofmanipulating cards in encrypted form. Index Terms —Cryptography, privacy homomorphism, mentalpoker I. I NTRODUCTION The growth of computer networks has allowed many activ-ities that used to require physical presence to become doableover the network. One example is e-gambling. In this paper wefocus on mental poker, i.e. a poker game played among playersthat are not physically together but communicate throughcomputer networks.A mental poker system needs to provide protocols togenerate a deck of cards, shufﬂe it and conﬁdentially dealthe cards to players. Naive approaches assume the existenceof a trusted third party (TTP), who performs some or all ofthe aforementioned operations [1].Since the assumption on all players trusting this central nodeis not always realistic, research on solutions not requiringa trusted party has become a hot topic [2]–[5]. To ensurethe players a fair play, standards of security similar to thosein physical gambling must be guaranteed. For instance, it isgood for trust generation that all players participate in thecomputation of the shufﬂed deck of cards. Current proposalsin the literature are based on a paradigm consisting of thefollowing steps:1) The players generate the deck of 52 face-up cards","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128470104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

A new method for classifying and searching software components by using a self-organizing neural network architecture 提出了一种基于自组织神经网络的软件构件分类搜索新方法

2006 IEEE International Conference on Granular Computing Pub Date : 2006-05-10 DOI: 10.1109/GRC.2006.1635772

Claudia A. S. Mello, R. Mello, M. T. P. Santos, Luciano José Senger, L. Yang

引用次数: 1

Stochastic processes and temporal rules 随机过程和时间规则

2006 IEEE International Conference on Granular Computing Pub Date : 2006-05-10 DOI: 10.1109/GRC.2006.1635834

Paul Cotofrei, K. Stoffel

引用次数: 0

On discovering "potentially useful" patterns from databases 从数据库中发现“潜在有用的”模式

2006 IEEE International Conference on Granular Computing Pub Date : 2006-05-10 DOI: 10.1109/GRC.2006.1635848

Ying Xie, T. Johnsten, Vijay V. Raghavan, Karthik Ramachandran

引用次数: 4

Modeling hierarchical and modular complex networks based on FCM 基于FCM的分层模块化复杂网络建模

2006 IEEE International Conference on Granular Computing Pub Date : 2006-05-10 DOI: 10.1109/GRC.2006.1635776

Jianyu Li, Rui Lv, Shuzhong Yang, Xianglin Huang, Zhanxin Yang, Yingjian Qi

引用次数: 0

A new aggregation operator of linguistic information and its properties 一种新的语言信息聚合算子及其性质

2006 IEEE International Conference on Granular Computing Pub Date : 2006-05-10 DOI: 10.1109/GRC.2006.1635846

Zheng Pei, Liangzhong Yi

引用次数: 6

Using 2-additive measures in nonlinear multiregressions 非线性多元回归中2加性测度的应用

2006 IEEE International Conference on Granular Computing Pub Date : 2006-05-10 DOI: 10.1109/GRC.2006.1635883

L. Bock, Zhenyuan Wang

引用次数: 4

Using UMLS-based Re-Weighting Terms as a Query Expansion Strategy 使用基于uml的重加权词作为查询扩展策略

2006 IEEE International Conference on Granular Computing Pub Date : 2006-05-10 DOI: 10.1109/GRC.2006.1635786

Weizhong Zhu, X. Xu, Xiaohua Hu, I. Song, R. Allen

{"title":"Using UMLS-based Re-Weighting Terms as a Query Expansion Strategy","authors":"Weizhong Zhu, X. Xu, Xiaohua Hu, I. Song, R. Allen","doi":"10.1109/GRC.2006.1635786","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635786","url":null,"abstract":"Search engines have significantly improved the efficiency of bio-medical literature searching. These search engines, however, still return many results that are irrelevant to the intention of a user's query. To improve precision and recall, various query expansion strategies are widely used. In this paper, we explore the three widely used query expansion strategies - local analysis, global analysis, and ontology-based term re- weighting across various search engines. Through experiments, we show that ontology-based term re-weighting works best. Term re-weighting reformulates queries with selection of key original query terms and re-weights these key terms and their associated synonyms from UMLS. The results of experiments show that with LUCENE and LEMUR, the average precision is enhanced by up to 20.3% and 12.1%, respectively, compared to baseline runs. We believe the principles of this term re-weighting strategy may be extended and utilized in other bio-medical domains. users and suggest the user to refine the original query. In this research, three query expansion strategies - local analysis, global analysis, and ontology-based term re-weighting - integrated with the UMLS (Unified Medical Language System) are compared. These methods are applied to the Ad Hoc Retrieval task of the TREC 2004 Genomics task.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134160120","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 22

Inducing decision rules: a granular computing approach 诱导决策规则:一种颗粒计算方法

2006 IEEE International Conference on Granular Computing Pub Date : 2006-05-10 DOI: 10.1109/GRC.2006.1635843

Xiaosheng Wang

引用次数: 2

Transductive Support Vector Classification for RNA Related Biological Abstracts RNA相关生物学摘要的转导支持载体分类

2006 IEEE International Conference on Granular Computing Pub Date : 2006-05-10 DOI: 10.1109/GRC.2006.1635836

B. Adams, Muhammad Asadur Rahman

{"title":"Transductive Support Vector Classification for RNA Related Biological Abstracts","authors":"B. Adams, Muhammad Asadur Rahman","doi":"10.1109/GRC.2006.1635836","DOIUrl":"https://doi.org/10.1109/GRC.2006.1635836","url":null,"abstract":"Support Vector Machines use a set of related supervised learning methods for classification and regression. When used for classification, the SVM algorithm creates a hyper plane that separates the data into two classes with the maximum- margin. Given positive and negative training examples a maximum-margin hyper plane is identified where it splits the positive from the negative examples, while maximizing the margin. Transductive Inference enhances the learning process by attempting to achieve the lowest error rate possible given a small sample of training examples. In this research we developed a set of software tools to convert scientific abstracts into support vectors that could be used with an implementation of Support Vector Machine called SVM-Light to classify the abstracts. Three distinct classification experiments were conducted: First, to classify abstracts about RNA research out of a set of randomly selected Abstracts. Second, to classify abstracts about specific types of RNA research out of a set of abstracts that all contain the expression \"RNA.\" Third, to classify tRNA, mRNA, snRNA, and rRNA abstracts individually out of a set of abstracts pertaining to the four categories of RNA.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128952786","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0