本地缓存和代理服务器环境下的网络日志挖掘

介绍了网络日志挖掘的基本概念，提出了一个网络日志挖掘通用系统的结构，分析了本地缓存和代理服务器对日志挖掘的影响，并给出了一种近似解决方案。这种方案通过网络拓扑结构和日志文件记录的结合，将杂乱无章的日志记录组合成具有语义信息的事务记录，从而使挖掘结果更有意义。     

基于媒体用户访问行为偏好模型的代理缓存算法

目前,代理缓存技术广泛应用于改善流媒体传输的服务质量.文章从实际用户日志文件的分析出发,利用发现的用户浏览流媒体对象时的行为分布模型,提出了一种新的视频流媒体缓存算法.仿真结果证明,该算法可以通过记录很少的用户访问信息获取较高的性能表现.     

具有不同代理群的多代理多签名方案

目前在大多数多代理多签名(multi-proxy multi-signature,MPMS)方案中,所有的原始签名人指定同一个代理群生成代理签名。然而在很多实际应用中,每个原始签名人经常需要在自己所在的组织中选择代理群,从而导致各个原始签名人需要选择不同的代理群,代表自己生成代理签名。现有的多代理多签名方案中还没有考虑这方面的需求。提出一个可以指定不同代理群的MPMS方案。在该方案中,可以指定一个多人的验证群合作验证最终签名的合法性。为证明方案的安全性,对现有的安全模型进行改进,在计算Diffie-Hellman假设的基础上,验证所提方案是安全的。与已有方案相比,本方案更加安全和有效。     

基于蓝牙技术的移动设备实现无线上网的研究及系统的实现

蓝牙技术是移动通信技术和计算机网络技术结合的产物,它的出现使蓝牙无线个人区域网成为当前发展最迅速的领域之一.在众多无线技术中,蓝牙以其功耗低、成本低廉、组网灵活等优点而成为新的研究热点,是个人局域网（PAN）的理想实现技术.在对蓝牙技术和无线个人局域网进行分析和研究的基础上,并针对一个开发实例——实现多个移动终端设备接入互联网的蓝牙局域网接入应用,分别详细地介绍了移动终端设备软件和蓝牙局域网无线接入在Windows系统上的实现过程.     

Python爬虫在导购系统中的应用

近年来,随着互联网的发展,出现了网上购物这种全新的购物方式。网上购物已经成为年轻人购物的主要方式。但网上的商品琳琅满目,如何挑选物美价廉的商品成为需要解决的问题,由此设计了一个基于Python爬虫的优惠券型导购系统。将淘宝、天猫、京东三大电商网站作为数据源,使用Python的requests、selenium等模块结合IP代理反反爬虫技术将商品信息与优惠券信息爬取下来,对信息进行数据清洗并存入mongo DB数据库中,由后台服务器程序整理数据,并在基于HTML5的安卓端APP展示出来供用户查看与选择。该系统简单高效,可以改善用户的购物体验,具有较高的实用价值。     

一个全同态代理重加密方案

针对现有全同态加密方案仅能对用同一密钥加密的密文进行计算的局限性,在Brakerski等人构造的全同态加密方案基础上,结合密钥隐私（Key-private）代理重加密的思想,并利用私钥置换技术,把某用户的密文置换成其他用户的私钥可以解密的新密文,从而构造了密钥隐私的全同态代理重加密方案,该方案可以使拥有重加密密钥的代理者在不改变明文的情况下,把用委托方Alice的公钥加密后的密文转换为可以用受理方Bob的私钥解密,且代理者无法获知Alice和Bob的身份,同时,根据同态运算的性质,代理者可以对转换后的密文进行同态运算,即方案同时具有全同态的性质和代理重加密的性质。从而实现了对用不同密钥加密的密文进行任意计算。另外,假如用户不使用重加密的功能,本方案将自动退化为高效的全同态加密方案(BGV方案）。所以对于不同应用需求,本方案具有较为良好的适应性。最后,在标准模型下证明了方案的CPA安全性和代理重加密的密钥隐私性。     

基于可转换代理签密的SAML跨域单点登录认证协议

可转换代理签密算法具有保护用户隐私、抗重放攻击、抗抵赖性等优势,基于该算法提出一种SAML跨域单点登录协议(SSPCPS).通过用户与异构域服务器直接交互认证,简化了跨域单点登录认证过程.用户身份票据由双方公钥结合用户随机选取的参数而生成,以密文形式传输,攻击者即使窃取该令牌也无法调用服务.用户利用代理签名密钥对摘要进行签密,在减少计算量的同时也可保证用户隐私安全.SSPCPS协议基于DH算法协商会话密钥,简化了会话密钥分发过程并降低了管理成本.使用CK安全模型证明了本协议的安全性并进行了性能分析,结果表明协议具有前向保密性、消息完整性等特点,同时在生成票据计算量和计算时间方面优于SSPPS协议、Juang方案、Ker-beros机制等.     

On the energy-delay trade-off in geographic forwarding in always-on wireless sensor networks: A multi-objective optimization problem

The design and development of multi-hop wireless sensor networks are guided by the specific requirements of their corresponding sensing applications. These requirements can be associated with certain well-defined qualitative and/or quantitative performance metrics, which are application-dependent. The main function of this type of network is to monitor a field of interest using the sensing capability of the sensors, collect the corresponding sensed data, and forward it to a data gathering point, also known as sink. Thus, the longevity of wireless sensor networks requires that the load of data forwarding be balanced among all the sensor nodes so they deplete their battery power (or energy) slowly and uniformly. However, some sensing applications are time-critical in nature. Hence, they should satisfy strict delay constraints so the sink can receive the sensed data originated from the sensors within a specified time bound. Thus, to account for all of these various sensing applications, appropriate data forwarding protocols should be designed to achieve some or all of the following three major goals, namely minimum energy consumption, uniform battery power depletion, and minimum delay. To this end, it is necessary to jointly consider these three goals by formulating a multi-objective optimization problem and solving it. In this paper, we propose a data forwarding protocol that trades off these three goals via slicing the communication range of the sensors into concentric circular bands. In particular, we discuss an approach, called weighted scale-uniform-unit sum, which is used by the source sensors to solve this multi-objective optimization problem. Our proposed data forwarding protocol, called Trade-off Energy with Delay (TED), makes use of our solution to this multi-objective optimization problem in order to find a “best” trade-off of minimum energy consumption, uniform battery power depletion, and minimum delay. Then, we present and discuss several numerical results to show the effectiveness of TED. Moreover, we show how to relax several widely used assumptions in order to enhance the practicality of our TED protocol, and extend it to real-world network scenarios. Finally, we evaluate the performance of TED through extensive simulations. We find that TED is near optimal with respect to the energy × delay metric. This simulation study is an essential step to gain more insight into TED before implementing it using a sensor test-bed.     

Web proxy cache replacement scheme based on back-propagation neural network

Web proxy caches are used to reduce the strain of contemporary web traffic on web servers and network bandwidth providers. In this research, a novel approach to web proxy cache replacement which utilizes neural networks for replacement decisions is developed and analyzed. Neural networks are trained to classify cacheable objects from real world data sets using information known to be important in web proxy caching, such as frequency and recency. Correct classification ratios between 0.85 and 0.88 are obtained both for data used for training and data not used for training. Our approach is compared with Least Recently Used (LRU), Least Frequently Used (LFU) and the optimal case which always rates an object with the number of future requests. Performance is evaluated in simulation for various neural network structures and cache conditions. The final neural networks achieve hit rates that are 86.60% of the optimal in the worst case and 100% of the optimal in the best case. Byte-hit rates are 93.36% of the optimal in the worst case and 99.92% of the optimal in the best case. We examine the input-to-output mappings of individual neural networks and analyze the resulting caching strategy with respect to specific cache conditions.     

基于多级单向哈希链的网格代理证书管理

代理证书是网格安全基础设施(GSI)中关键机制之一,用户需要通过代理证书访问网格服务,但目前的GSI方案中缺乏有效的代理证书管理机制。针对代理证书的生命周期控制不灵活、证书容易受到攻击等问题,该文提出一种基于多级单向哈希链的网格代理证书管理方案。多级单向哈希链由2层或2层以上哈希链构成,每个代理证书都由一个哈希值保护,其有效时间能够得到自适应控制,增强了网格代理证书管理的安全性和任务成功率。实验表明网格环境下该方案计算和通信开销较小。