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

Distributed and Cooperative Information Retrieval on the World Wide Web

Journal of computer science & technology 2000年第6期15卷 611-618页

作者：王继成金翔宇杨晓江张福炎 State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing P. R. China

A mass of heterogeneous, distributed and dynamic information on the World Wide Web (the Web) has resulted in 'information overload'. It's an important and urgent research issue to provide users with effective information retrieval service on the Web. Web search engines attempt to solve this problem, yet their effect is far from satisfying. In this paper, a distributed and cooperative strategy for information retrieval on the Web is proposed to substitute the centralized mode adopted by the current search engines. Then a new information retrieval system model IRSM is presented, which supports the retrieval of metadata about Web documents and uses Z39.50 standard protocol to unify the heterogeneous interfaces of. different systems. Based on that, a distributed and cooperative information retrieval framework, called DCIRF, is designed to help users in fast and effective information retrieval on the Web.

关键词： Web information retrieval search engine cooperative 239.50

来源：评论

学校读者我要写书评

暂无评论

Towards context consistency by concurrent checking for Internetware applications

引用

science China(Information sciences) 2013年第8期56卷 69-88页

作者： XU Chang LIU YePang CHEUNG S.C. CAO Chun LV Jian State Key Laboratory for Novel Software Technology Nanjing University Department of Computer Science and Technology Nanjing University Department of Computer Science and Engineering The Hong Kong University of Science and Technology

Internetware applications are emerging and being widely *** can adapt their behavior based on environmental contexts and deliver smart *** contexts can be subject to various noises,which cause them to be inaccurate,incomplete,or even to conflict with each *** is known as context inconsistency *** inconsistency can trigger unexpected behavior to applications,and therefore should be *** promising approach is to check contexts against consistency constraints so as to detect the occurrences of context inconsistency at *** techniques have attempted different ways to improve the checking efficiency or effectiveness with different trade-offs in space overhead or communication ***,none of them has exploited multi-core computing capability to systematically improve the checking *** this paper,we propose a novel concurrent checking technique Con-C to efficiently detect inconsistencies in huge volumes of dynamic ***-C derives checking subtasks for each consistency constraint based on its structure and *** achieves this in a fully automated way,and at the same time can guarantee its derived checking subtasks to be persistently *** evaluated Con-C by controlled experiments through a large-scale real-world *** reported promising results that Con-C improved the checking efficiency by extra 57.0%,in addition to what had been gained by incremental checking.

关键词： concurrent checking consistency constraint context inconsistency pervasive computing Internetware

来源：评论

学校读者我要写书评

暂无评论

Detecting code reuse in android applications using component-based control flow graph

引用

IFIP Advances in Information and Communication technology 2014年 428卷 142-155页

作者： Sun, Xin Zhongyang, Yibing Xin, Zhi Mao, Bing Xie, Li State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University China

ISBN: (纸本)9783642554148

Recently smartphones and mobile devices have gained incredible popularity for their vibrant feature-rich applications (or apps). Because it is easy to repackage Android apps, software plagiarism has become a serious problem. In this paper, we present an accurate and robust system DroidSim to detect code reuse. DroidSim calculates similarity score only with component-based control flow graph (CB-CFG). CB-CFG is a graph of which nodes are Android APIs and edges represent control flow precedence order in each Android component. Our system can be applied to detect repackaged apps and malware variants. We evaluate DroidSim on 121 apps and 706 malware variants. The results show that our system has no false negative and a false positive of 0.83% for repackaged apps, and a detection ratio of 96.60% for malware variants. Besides, ADAM is used to obfuscate apps and the result reveals that ADAM has no influence on our system. © IFIP International Federation for Information Processing 2014.

关键词： Android (operating system)

来源：评论

学校读者我要写书评

暂无评论

TSGN: Transaction Subgraph Networks Assisting Phishing Detection in Ethereum

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Wang, Jinhuan Chen, Pengtao Xu, Xinyao Wu, Jiajing Shen, Meng Xuan, Qi Yang, Xiaoniu Zhejiang University of Technology Institute of Cyberspace Security College of Information Engineering Hangzhou310023 China ZJUT Binjiang Institute of Artificial Intelligence Hangzhou310056 China Fudan University Adaptive Networks and Control Lab Department of Electronic Engineering School of Information Science and Technology Shanghai200433 China Sun Yat-sen University School of Computer Science and Engineering Guangzhou510006 China Beijing Institute of Technology School of Cyberspace Science and Technology Beijing100081 China Shenzhen518066 China National Key Laboratory of Electromagnetic Space Security Jiaxing314033 China

Due to the decentralized and public nature of the blockchain ecosystem, malicious activities on the Ethereum platform impose immeasurable losses on users. At the same time, the transparency of cryptocurrency transactions provides a unique opportunity to analyze illegal activities, such as phishing scams, from a network perspective. Most existing phishing scam detection methods focus primarily on analyzing account interaction networks, which limits their ability to uncover transaction behavior patterns embedded within transaction interactions. To address this, we construct the Transaction SubGraph Network (TSGN) by using transaction subgraphs as basic elements and further propose a novel framework for Ethereum phishing account detection. Specifically, we rebuild the graph structures via three well-designed mapping mechanisms, yielding TSGN and its two variants, i.e., Directed-TSGN and Temporal-TSGN, to obtain direction-aware and time-aware transfer flow features. By further incorporating the mapping strategy into transaction multidigraphs, we develop the Multiple-TSGN, which could preserve more transaction flow features while concurrently reducing the time consumption of modeling large-scale networks. TSGN models based on transaction subgraph interactions can capture complex higher-order dependencies, which lay beyond the reach of models that exclusively capture pairwise account interactions. As a general framework, our model can incorporate various feature extraction methods to improve the performance of phishing detection. Extensive experimental results on Ethereum datasets show that our method achieves superior performance in phishing detection, yielding 3.27%∼6.71% relative improvement over previous state-of-the-art. © 2004-2012 IEEE.

关键词： Phishing

来源：评论

学校读者我要写书评

暂无评论

Analysis on the Content Features and Their Correlation of Web Pages for Spam Detection

引用

China Communications 2015年第3期12卷 84-94页

作者： JI Hua ZHANG Huaxiang Department of computer science Shandong Normal University Shandong Provincial key laboratory for novel distributed computer software technology

In the global information era,people acquire more and more information from the Internet,but the quality of the search results is degraded strongly because of the presence of web *** spam is one of the serious problems for search engines,and many methods have been proposed for spam *** exploit the content features of non-spam in contrast to those of *** content features for non-spam pages always possess lots of statistical regularities; but those for spam pages possess very few statistical regularities,because spam pages are made randomly in order to increase the page *** this paper,we summarize the regularities distributions of content features for non-spam pages,and propose the calculating probability formulae of the entropy and independent n-grams ***,we put forward the calculation formulae of multi features *** them,the notable content features may be used as auxiliary information for spam detection.

关键词： web spam content features feature correlation spam detection

来源：评论

学校读者我要写书评

暂无评论

Hypergraph Consistency Learning with Relational Distillation

引用

IEEE Transactions on Multimedia 2025年

作者： Yi, Siyu Mao, Zhengyang Wang, Yifan Gu, Yiyang Xiao, Zhiping Chen, Chong Hua, Xian-Sheng Zhang, Ming Ju, Wei Sichuan University College of Mathematics Chengdu610065 China Peking University-Anker Embodied AI Lab Peking University School of Computer Science National Key Laboratory for Multimedia Information Processing Beijing100871 China University of International Business and Economics School of Information Technology & Management Beijing100029 China University of Washington Department of Computer Science Seattle United States Terminus Group Beijing100027 China Sichuan University College of Computer Science Chengdu610065 China

This paper studies the problem of semi-supervised learning on graphs, which has recently aroused widespread interest in relational data mining. The focal point of exploration in this area has been the utilization of graph neural networks (GNNs), which stand out for excellent performance. Previous methods, however, typically rely on the limited labeled data while ignoring the abundant structural information in unlabeled nodes inherently on graphs, easily resulting in overfitting, especially in scenarios where only a few label nodes are available. Even worse, GNNs, despite their success, are constrained by their ability to solely capture local neighborhood information through message-passing mechanisms, thereby falling short in modeling higher-order dependencies among nodes. To circumvent the above drawbacks, we propose a simple yet effective framework called Hypergraph COnsistency LeArning (HOLA). Specifically, we employ a collaborative distillation framework consisting of a teacher network and a student network. To achieve effective interaction, we propose momentum distillation, a self-training method that enables the student network to learn from pseudo-targets generated by a momentum teacher network. Further, a novel hypergraph structure learning network is developed to model complex high-order relations among nodes with relational consistency learning, thereby transferring the knowledge to the student network. Extensive experiments conducted on a variety of benchmark datasets demonstrate the superior performance of the HOLA over various state-of-the-art methods. © 2025 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Greylevel Difference Classification Algorithm in Fractal Image Compression

引用

Journal of computer science & technology 2002年第2期17卷 236-240页

作者：陈毅松卢坚孙正兴张福炎 State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing 210093 P.R. China

This paper proposes the notion of a greylevel difference classification algorithm in fractal image compression. Then an example of the greylevel difference classification algo rithm is given as an improvement of the quadrant greylevel and variance classification in the quadtree-based encoding algorithm. The algorithm incorporates the frequency feature in spatial analysis using the notion of average quadrant greylevel difference, leading to an enhancement in terms of encoding time, PSNR value and compression ratio.

关键词： image coding fractal classification algorithm greylevel differenceclassifica- tion

来源：评论

学校读者我要写书评

暂无评论

SMART: A Strengthened Model of Access Router Tree for Multihoming in Nested Mobile Network

引用

电子学报(英文版) 2009年第1期18卷 125-131页

作者： HUANG Songhua WU Xiaobing LU Yin HUANG Hao CHEN Guihai State Key Laboratory for Novel Software Technology Department of Computer Science Nanjing University Nanjing 210093 China

Load balance and failure tolerance are the crucial issues for multihomed mobile network. However, existing solutions are still far away from our expectation. In this paper, we first analyze the problems of multihoming in a nested mobile network and review their existing schemes in the eye of load balance and failure tolerance. Then we give a strengthened model of access router tree, where a novel and comprehensive metric for best path recognition is proposed to realize the load balance. In order to enhance the failure tolerance of the system, we further propose fast handover algorithms which can be used when burst access failure appears. We perform extensive simulations to evaluate the proposed scheme. Results indicate that comprehensive load balance and failure tolerance can be achieved. Moreover, our proposed handover algorithm achieves least latency of package transmission compared with its existing counterparts.

关键词：移动网络树模型路由器宿主嵌套负载平衡智能系统故障

来源：评论

学校读者我要写书评

暂无评论

A model for intelligent resource management in a large distributed system

引用

science China(Technological sciences) 1998年第1期41卷 13-21页

作者：谢立易鉴良 1. State Key Laboratory of Novel Software Technology Department of Computer Science and Technology Nanjing University 210093 Nanjing China

A model of intelligent resource management in a large distributed system is proposed. This model not only can efficiently solve the problem concerning the incompletion of the global states and the monotony of the management tactics, but also has the self-adapting ability in a large distributed system, so that the system can maintain high performance all the time.

关键词： distributed system resource management intelligent the mathematical theory of evidence belief network.

来源：评论

学校读者我要写书评

暂无评论

A New Algorithm for Two-Dimensional Line Clipping via Geometric Transformation

引用

Journal of computer science & technology 1998年第5期13卷 410-416页

作者：汪灏泓吴瑞迅蔡士杰 Department of Computer Science and Technology State Key Laboratory of Novel Software Technology Nanjing University Nanjing P.R. China

Line segment clipping is a basic operation of the visualization process in computer graphics. So far there exist four computational models for clipping a line segment against a window, (1) the encoding, (2) the parametric, (3) the geometric transformation, and (4) the parallel cutting. This paper presents an algorithm that is based on the third method. By making use of symmetric properties of a window and transformation operations, both endpoints of a line segment are transformed, so that the basic cases are reduced into two that can be easily handled, thus the problems in NLN and AS where there are too many sulyprocedure calls and basic cases that are difficult to deal with are tackled. Both analytical and experimental results from random input data show that the algorithm is better than other developed ones, in view of the speed and the number of operations.

关键词： Clipping line clipping geometric transformation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：