共查询到20条相似文献,搜索用时 125 毫秒
1.
文章研究了在渗透测试中Web站点的信息抓取的问题.针对Web渗透测试对于信息抓取的全面性、高效性的需求,本文通过对Web站点进行研究分析,提出了基于导航链接的网络爬虫策略,并通过减少迭代次数对传统的MD5去重算法进行了改进,优化了URL去重的效率.通过实验验证表明,该爬虫策略的信息抓取覆盖率和网页下载效率均有所提高. 相似文献
2.
3.
《计算机光盘软件与应用》2013,(2):4-6
通过研究搜索引擎收录网页和对搜索结果排名的基本原理,根据ASP.NET网站架构的特殊性,提出了基于ASP.NET网站进行搜索引擎优化的基本策略。 相似文献
4.
5.
大型网站是网络信息的核心,其信息规模之大,更新速度之快是中小型网站不可比拟的,对大型网站网页搜索的好坏直接影响搜索引擎的整体性能.本文在分析分类网页更新策略的基础上,根据大型网站本身的特点提出了一种增量式信息更新方法.实验分析表明,这种增量式信息更新方法很大程度上提高了大型网站搜索引擎网页的更新效率. 相似文献
6.
徐燕 《计算机工程与科学》2007,29(4):25-26
提出了一种结合页面内容和站点结构的Markov模型,该模型应用于网页预取。传统的Markov模型是基于历史的模型,将对用户以往的使用记录的统计应用于网页预取。本文通过在Markov模型之上,结合页面内容及站点结构来调整状态转移矩阵,以获得更精确的预取结果,提高Web服务的质量。性能测试结果表明,该模型具有较好的性能。 相似文献
7.
陈莉 《电脑编程技巧与维护》2021,(8):147-149
介绍了图像在网站中的作用,简单阐述了网页设计的概念和分类,说明了网站中常见的图像类别,并对其中最常见的两类图片和GIF动态图片进行了详细研究;对图片的传输和展示进行了性能优化方面的探讨;对GIF动态图片研究了其基本格式和处理技巧,在网页设计时对常见图像进行了合理处理,可以极大地提升网站的用户体验,提高用户的满意度. 相似文献
8.
从理论上分析了一种自适应网站性能优化算法.该算法以Web站点的URL为行、以用户的UserID为列,建立URL_UserID关联矩阵,对行向量进行分析获得频繁闭相关页面集,对频繁闭相关页面集进一步处理发现频繁访问路径.Web站点可根据频繁路径自动改进链接结构,提高Web站点对所有用户的整体服务性能. 相似文献
9.
随着计算机应用的网络化,不少企业都在Internet上建有自己的网站,希望通过网站树立企业形象.推销企业产品。但由于受人力和财力的限制,使他们在网站建设上不能有太多的投入。特别是一些中小企业,计算机设备比较落后.它们的网站或是建立在Internet的免费空间上,或是租用ISP的硬盘空间。这样的建网方案在技术上给设计人员带来很大的制约,使网站的开发和维护变得更为复杂。大家都知道,开发一个Web站点是一件很困难很费时的工作,尤其是进行网页制作、编写应用程序及设计界面等。而且初建网络时经验不足,不少事情还处在实验摸索阶段,更需要在网页发布到Web服务器之前进行反复测试。因此要办出一个高质量的Web站点,建立一个脱机环境下的网站开发和测试平台是十分必要的。换句话说,就是在企业还没有条件设立自己的Web服务器情况下,在PC机上配置个人Web服务器(Personal Web Server,PWS)。在其上建立网站,并测试网站,然后再发布到Internet上。这样做既经济又易于实现,而且对提高网站的质量、加快网站建设和内容更新周期,以及为条件有限的企业办好网站提供了一种经济实用的解决方案。 相似文献
10.
11.
12.
针对当前互联网网页越来越多样化、复杂化的特点,提出一种基于结构相似网页聚类的网页正文提取算法,首先,根据组成网页前端模板各“块”对模板的贡献赋以不同的权重,其次计算两个网页中对应块的相似度,将各块的相似度与权重乘积的总和作为两个网页的相似度。该算法充分考虑结构差别较大的网页对网页正文提取的影响,通过计算网页间相似度将网页聚类,使得同一簇中的网页正文提取结果更加准确。实验结果表明,该方法具有更高的准确率,各项评价指标均有所提高。 相似文献
13.
14.
Exploring Social Annotations with the Application to Web Page Recommendation 总被引:1,自引:0,他引:1 下载免费PDF全文
Hui-Qian Li 《计算机科学技术学报》2009,24(6):1028-1035
Collaborative social annotation systems allow users to record and share their original keywords or tag attachments to Web
resources such as Web pages, photos, or videos. These annotations are a method for organizing and labeling information. They
have the potential to help users navigate the Web and locate the needed resources. However, since annotations are posted by
users under no central control, there exist problems such as spam and synonymous annotations. To efficiently use annotation
information to facilitate knowledge discovery from the Web, it is advantageous if we organize social annotations from semantic
perspective and embed them into algorithms for knowledge discovery. This inspires the Web page recommendation with annotations,
in which users and Web pages are clustered so that semantically similar items can be related. In this paper we propose four
graphic models which cluster users, Web pages and annotations and recommend Web pages for given users by assigning items to
the right cluster first. The algorithms are then compared to the classical collaborative filtering recommendation method on
a real-world data set. Our result indicates that the graphic models provide better recommendation performance and are robust
to fit for the real applications. 相似文献
15.
16.
17.
Varadarajan R. Hristidis V. Tao Li 《Knowledge and Data Engineering, IEEE Transactions on》2008,20(3):411-424
Given a user keyword query, current Web search engines return a list of individual Web pages ranked by their "goodness" with respect to the query. Thus, the basic unit for search and retrieval is an individual page, even though information on a topic is often spread across multiple pages. This degrades the quality of search results, especially for long or uncorrelated (multitopic) queries (in which individual keywords rarely occur together in the same document), where a single page is unlikely to satisfy the user's information need. We propose a technique that, given a keyword query, on the fly generates new pages, called composed pages, which contain all query keywords. The composed pages are generated by extracting and stitching together relevant pieces from hyperlinked Web pages and retaining links to the original Web pages. To rank the composed pages, we consider both the hyperlink structure of the original pages and the associations between the keywords within each page. Furthermore, we present and experimentally evaluate heuristic algorithms to efficiently generate the top composed pages. The quality of our method is compared to current approaches by using user surveys. Finally, we also show how our techniques can be used to perform query-specific summarization of Web pages. 相似文献
18.
19.
This paper presents a Page rank-based prefetching technique for accesses to Web page clusters. The approach uses the link structure of a requested page to determine the “most important” linked pages and to identify the page(s) to be prefetched. The underlying premise of our approach is that in the case of cluster accesses, the next pages requested by users of the Web server are typically based on the current and previous pages requested. Furthermore, if the requested pages have a lot of links to some “important” page, that page has a higher probability of being the next one requested. An experimental evaluation of the prefetching mechanism is presented using real server logs. The results show that the Page rank-based scheme does better than random prefetching for clustered accesses, with hit rates of 90% in some cases. 相似文献
20.
运用XML和XSLT技术实现Web页面的重用 总被引:7,自引:0,他引:7
从分析页面结构特征入手,运用XML和XSLT技术实现Web页面的重用。该方法用动态XML文件定义页面的组成,用XSLT文件定义页面布局,通过XSLT转化把二者统一起来得到最终的页面。页面布局与页面组成的分离实现了页面布局和页面组成块的重用。 相似文献