检索结果-内蒙古大学图书馆

Physical Review E 2013年第3期87卷 032133-032133页

作者： Yichao Zhang Shi Zhou Zhongzhi Zhang Jihong Guan Shuigeng Zhou Department of Computer Science and Technology Tongji University 4800 Cao'an Road Shanghai 201804 China Department of Computer Science University College London Gower Street London WC1E 6BT United Kingdom School of Computer Science Fudan University Shanghai 200433 China Shanghai Key Lab of Intelligent Information Processing Fudan University Shanghai 200433 China

The social network is a main tunnel of rumor spreading. Previous studies concentrated on a static rumor spreading. The content of the rumor is invariable during the whole spreading process. Indeed, the rumor evolves constantly in its spreading process, which grows shorter, more concise, more easily grasped, and told. In an early psychological experiment, researchers found about 70% of details in a rumor were lost in the first six mouth-to-mouth transmissions. Based on these observations, we investigate rumor spreading on social networks, where the content of the rumor is modified by the individuals with a certain probability. In the scenario, they have two choices, to forward or to modify. As a forwarder, an individual disseminates the rumor directly to their neighbors. As a modifier, conversely, an individual revises the rumor before spreading it out. When the rumor spreads on the social networks, for instance, scale-free networks and small-world networks, the majority of individuals actually are infected by the multirevised version of the rumor, if the modifiers dominate the networks. The individuals with more social connections have a higher probability to receive the original rumor. Our observation indicates that the original rumor may lose its influence in the spreading process. Similarly, a true information may turn out to be a rumor as well. Our result suggests the rumor evolution should not be a negligible question, which may provide a better understanding of the generation and destruction of a rumor.

关键词： SOCIAL networks PROBABILITY theory RUMOR information theory SOCIAL groups MOUTH-to-mouth resuscitation

来源：评论

学校读者我要写书评

暂无评论

Finding Dominating Set from Verbal Contextual Graph for Personalized Search in Folksonomy

Finding Dominating Set from Verbal Contextual Graph for Pers...

引用

IEEE WIC ACM International Conference on Web Intelligence (WI)

作者： Ting Jin Haoran Xie Jingsheng Lei Qing Li Xiaodong Li Xudong Mao Yanghui Rao Shanghai Key Lab of Intelligent Information Processing Fudan University Shanghai China Department of Computer Science City University of Hong Kong China College of Computer Science & Technology Shanghai University of Electric Power Shanghai China

With the development of the Internet, user-generated data has been growing tremendously in Web 2.0 era. Facing such a big volume of resources in folksonomy, people need a method of fast exploration and indexing to find their demanded data. To achieve this goal, contextual information is indispensable and valuable to understand user preference and purpose. In sociolinguistics, context can be mainly categorized as verbal context and social context. Comparing with verbal context, social context not only requires domain knowledge to pre-define contextual attributes but also acquires additional data from users. However, there is no research of addressing irrelevant contextual factors for verbal context model so far. The dominating set from verbal context proposed in this paper is to fill this blank. We present the verbal context in folksonomy to capture the user intention, and propose a dominating set discovering method for this verbal context model to prune the irrelevant contextual factors and keep the major characteristics at the same time. Furthermore, the experiments, which are conducted on a public data set, show that the proposed method gives convincing results.

关键词： Context Context modeling Vectors Motion pictures Measurement Mood Semantics

来源：评论

学校读者我要写书评

暂无评论

Preface: WCSE 2013

Proceedings - 2013 4th World Congress on Software Engineerin...

引用

Proceedings - 2013 4th World Congress on Software Engineering, WCSE 2013 2013年 xi-xii页

作者： Xu, Li Da Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China School of Computer Science and Technology China University of Mining and Technology China

来源：评论

学校读者我要写书评

暂无评论

Using Chou’s Pseudo Amino Acid Composition for Protein Remote Homology Detection

引用

Engineering（科研） 2013年第10期5卷 149-153页

作者： Bin Liu Xiaolong Wang School of Computer Science and Technology Harbin Institute of Technology Shenzhen Graduate School Shenzhen Guangdong China Key Laboratory of Network Oriented Intelligent Computation Harbin Institute of Technology Shenzhen Graduate School Shenzhen Guangdong China Shanghai Key Laboratory of Intelligent Information Processing Shanghai China School of Computer Science and Technology Harbin Institute of Technology Shenzhen Graduate School Shenzhen Guangdong China Key Laboratory of Network Oriented Intelligent Computation Harbin Institute of Technology Shenzhen Graduate School Shenzhen Guangdong China

Protein remote homology detection is a key problem in bioinformatics. Currently, the discriminative methods, such as Support Vector Machine (SVM), can achieve the best performance. The most efficient approach to improve the performance of the SVM-based methods is to find a general protein representation method that is able to convert proteins with different lengths into fixed length vectors and captures the different properties of the proteins for the discrimination. The bottleneck of designing the protein representation method is that native proteins have different lengths. Motivated by the success of the pseudo amino acid composition (PseAAC) proposed by Chou, we applied this approach for protein remote homology detection. Some new indices derived from the amino acid index (AAIndex) database are incorporated into the PseAAC to improve the generalization ability of this method. Our experiments on a well-known benchmark show this method achieves superior or comparable performance with current state-of-the-art methods.

关键词： Protein Remote Homology Support Vector Machine Pseudo Amino Acid Composition Protein Representation

来源：评论

学校读者我要写书评

暂无评论

Screening of potential pseudo att sites of Streptomyces phage ΦC31 integrase in the human genome

引用

中国药理学报（英文版） 2013年第4期34卷 561-569页

作者： Zhi-peng HU Lu-sheng CHEN Cai-yan JIA Huan-zhang ZHU Wei WANG Jiang ZHONG Department of Microbiology and Microbial Engineering School of Life Sciences Fudan University Shanghai 200433 China Intelligent Information Processing Lab Department of Computer Science Fudan University Shanghai 200433 China State Key Laboratory of Genetic Engineering Institute of Genetics School of Life Science Fudan University Shanghai 200433 China Molecular & Cellular Biology Baylor College of Medicine Houston TX USA

Aim:φC31 integrase mediates site-specific recombination between two short sequences, attP and attB, in phage and bacterial genomes, which is a promising tool in gene regulation-based therapy since the zinc finger structure is probably the DNA recognizing domain that can further be engineered. The aim of this study was to screen potential pseudo att sites of (I)C31 integrase in the human genome, and evaluate the risks of its application in human gene therapy. Methods: TFBS (transcription factor binding sites) were found on the basis of reported pseudo att sites using multiple motif-finding tools, including AlignACE, BioProspector, Consensus, MEME, and Weeder. The human genome with the proposed motif was scanned to find the potential pseudo att sites ofφC31 integrase. Results: The possible recognition motif ofφC31 integrase was identified, which was composed of two co-occurrence conserved elements that were reverse complement to each other flanking the core sequence TTG. In the human genome, a total of 27924 potential pseudo att sites ofφC31 integrase were found, which were distributed in each human chromosome with high-risk specificity values in the chromosomes 16, 17, and 19. When the risks of the sites were evaluate more rigorously, 53hits were discovered, and some of them were just the vital functional genes or regulatory regions, such as ACYP2, AKR1B1, DUSP4, etc. Conclusion: The results provide clues for more comprehensive evaluation of the risks of usingφC31 integrase in human gene therapy and for drug discovery.

关键词： gene therapy ΦC31 integrase pseudo attP human genome motif finding drug discovery

来源：评论

学校读者我要写书评

暂无评论

Converting continuous-space language models into N-gram language models for statistical machine translation

Converting continuous-space language models into N-gram lang...

引用

2013 Conference on Empirical Methods in Natural Language processing, EMNLP 2013

作者： Wang, Rui Utiyama, Masao Goto, Isao Sumita, Eiichro Zhao, Hai Lu, Bao-Liang Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering Shanghai Jiao Tong Unviersity Shanghai200240 China Multilingual Translation Laboratory MASTAR Project National Institute of Information and Communications Technology 3-5 Hikaridai Keihanna Science City Kyoto619-0289 Japan MOE-Microsoft Key Lab. for Intelligent Computing and Intelligent Systems Shanghai Jiao Tong Unviersity Shanghai200240 China

ISBN: (纸本)9781937284978

Neural network language models, or continuous-space language models (CSLMs), have been shown to improve the performance of statistical machine translation (SMT) when they are used for reranking n-best translations. However, CSLMs have not been used in the first pass decoding of SMT, because using CSLMs in decoding takes a lot of time. In contrast, we propose a method for converting CSLMs into back-off n-gram language models (BNLMs) so that we can use converted CSLMs in decoding. We show that they outperform the original BNLMs and are comparable with the traditional use of CSLMs in reranking. © 2013 Association for Computational Linguistics.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

An optimized band selection scheme for hyperspectral imagery analysis 5

An optimized band selection scheme for hyperspectral imagery...

引用

5th Workshop on Hyperspectral Image and Signal processing: Evolution in Remote Sensing, WHISPERS 2013

作者： Su, Hongjun Du, Qian Du, Peijun School of Earth Sciences and Engineering Hohai University China Department of Electrical and Computer Engineering Mississippi State University United States Department of Geographical Information Science Nanjing University China Jiangsu Key Lab. of Spectral Imaging and Intelligent Sense Nanjing University of Science and Technology China

ISBN: (纸本)9781509011193

A particle swarm optimization (PSO)-based automatic system to determine the number of optimal band sets and corresponding bands is proposed. A simple searching criterion function, called minimum estimated abundance covariance (MEAC), requiring class signatures only, is used in this method. The experimental results show that the PSO-based algorithm outperforms the popular sequential forward selection (SFS) method. The two PSOs can achieve the balance between the two objectives, and it may provide even better accuracy than a single-objective PSO. © 2013 IEEE.

关键词： Hyperspectral imaging

来源：评论

学校读者我要写书评

暂无评论

A characterization of solvability for a class of networks

引用

science China(information sciences) 2012年第4期55卷 747-754页

作者： YUAN Chen & KAN HaiBin shanghai key lab of intelligent information processing,school of computer science,Fudan University,shanghai 200433,China 1. Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University Shanghai 200433 China

In this paper,we find that Property P can be generalized to characterize the solvability of a kind of networks with any number of sources,thus partially answering the open problem as to whether there are properties similar to Property P to characterize the solvability of some *** an application,for a given integer n,we construct such a solvable network that has no solvable solution if its alphabet size is less than n.

关键词： capacity coding capacity network coding solvability

来源：评论

学校读者我要写书评

暂无评论

On the fast algebraic immunity of even-variable rotation symmetric Boolean functions

On the fast algebraic immunity of even-variable rotation sym...

引用

14th International Conference on Advanced Communication technology, ICACT 2012

作者： Zha, Minglei Wang, Bin Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University Shanghai China

ISBN: (纸本)9788955191639

An AAR (algebraic attack resistant) Boolean function is considered having good capability against both classical and fast algebraic attacks. However, AAR is too hard to achieve. This paper studies the protection against fast algebraic attacks on rotation symmetric Boolean functions by discussing their fast algebraic immunity. The result shows that all the even n-variable rotation symmetric Boolean functions of degree (n1) are not AAR because their fast algebraic immunity is at most (n1). Furthermore, we find that some of the even n-variable rotation symmetric Boolean functions of degree n or (n2) have fast algebraic immunity at most (n1), too. © 2012 GIRI.

关键词： Boolean functions

来源：评论

学校读者我要写书评

暂无评论

Leveraging Exemplar and saliency model for image search reranking

Leveraging Exemplar and saliency model for image search rera...

引用

13th Pacific-Rim Conference on Multimedia, PCM 2012

作者： Lu, Hong Chen, Kai Jiang, Guobao Wei, Renzhong Xue, Xiangyang Shanghai Key Lab. of Intelligent Information Processing School of Computer Science Fudan University Shanghai China

ISBN: (纸本)9783642347771

In this paper, we propose to rerank the image retrieval results using a novel method which can be fitted to both objects classes and scenes classes. We first introduce the two methods: Exemplar model and Saliency Map (SM). Exemplar model is a top-down method which considers region of interest (ROI) of images from the same class containing lots of similar discriminative local features. These discriminative local features can be trained as the model of the specific class and to rerank the retrieved images by their similarities with the trained model of the query class. On the other hand, SM is a bottom-up method which uses winner-take-all and inhibition-of-return mechanisms to draw different locations in descending saliency order, and the images can be reranked by their salient scores. In experimental results, we observe that Exemplar Model performs well in object classes and SM performs well in scene classes for these two methods focus on different aspects to rerank images. Then we propose a method named ExSM which combines the advantage of Exemplar model and SM. ExSM inherits the superiority of Exemplar model in object classes and SM in scene classes and outperforms both of them in general. © 2012 Springer-Verlag.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：