在线社交网络社区的启发式挖掘框架

指出基于全局优化的社区挖掘方法的不足,给出OSNs网络及其社区挖掘的形式定义,提出一个启发式社区挖掘框架,在此框架下对包括LWP,Clauset,Schaeffer,Papadopoulos,Bagrow与Chen在内的6种启发式社区挖掘算法进行分析比较.通过3个真实OSNs网络的实验比较,验证了启发式社区挖掘框架的可行性,在结果社区有效性与时间效率上对6种启发式算法进行比较,实验结论为网络社区挖掘的工程实践与理论研究提供了借鉴.     

A Brief Introduction to Usable Security

Researchers have studied usable computer security for more than 20 years, and developers have created numerous security interfaces. Here, the authors examine research in this space, starting with a historical look at papers that address two consistent problems: user authentication and email encryption. Drawing from successes and failures within these areas, they study several security systems to determine how important design is to usable security. Their discussion offers guidelines for future system design.     

Privacy-Aware Framework for Matching Online Social Identities in Multiple Social Networking Services

With various emerging Social Networking Services (SNS), it is possible for users to join multiple SNS for social relationships with other users and to collect a large amount of information (e.g., statuses on Facebook and tweets on Twitter). However, these users have been facing difficulties in managing all the data collected from the multiple SNS. It is important to match social identities from the multiple SNS. In this study, we propose a privacy-aware framework for a social identity matching (SIM) method across these multiple SNS. It means that the proposed approach can protect user privacy, because only the public information (e.g., username and the social relationships of the users) is employed to find the best matches between social identities. As a result, we have shown by evaluation that the F-measure of the proposed SIM method is about 60%.     

Online Social Networking Sites Continuance Intention: A Model Comparison Approach

Retaining existing users and letting them continue to use the current social networking sites (SNSs) have become increasingly challenging for developers. This study takes a model comparison approach to investigate this important issue. Based on technology acceptance model, self-determination theory, and net-valence model, our study develops four models that explain individuals’ continuance intention. Based on the data collected from U.S. SNS users, all four models can predict individuals’ intention reasonably well, and net-valence model with perceived benefits and risks as second-order constructs explains the largest amount of variance of SNS continuance intention. This study is among the first model comparison studies in the SNS continuance area. It is also among the first to apply self-determination theory and net-valence model to investigate SNS continuance.     

计算机联网软件的制式安全评价分析

介绍了开展计算机制式安全评价的主要目的是为了确保评价的主要目的,便于信息的收集,另外一点就是选择合适的评价方式,开展评价工作。最后一方面内容就是开展好评价工作总结等等。讨论了计算机联网软件的制式安全评价的意义,首先确保了计算机运行操作体系的安全性,其次是监测网络的安全,降低故障出现的概率。因此得出了开展计算机联网软件的制式安全评价在网络技术使用过程中有着非常重要的地位。     

杂合启发式在线POMDP 规划

许多不确定环境下的自主机器人规划任务都可以用部分可观察的马氏决策过程(partially observableMarkov decision process,简称POMDP)建模.尽管研究者们在近似求解技术的设计方面已经取得了显著的进展,开发高效的POMDP 规划算法依然是一个具有挑战性的问题.以前的研究结果表明:在线规划方法能够高效地处理大规模的POMDP 问题,因而是一类具有研究前景的近似求解方法.这归因于它们采取的是“按需”作决策而不是预前对整个状态空间作决策的方式.旨在通过设计一个新颖的杂合启发式函数来进一步加速POMDP 在线规划过程,该函数能够充分利用现有算法里一些被忽略掉的启发式信息.实现了一个新的杂合启发式在线规划(hybrid heuristiconline planning,简称HHOP)算法.在一组POMDP 基准问题上,HHOP 有明显优于现有在线启发式搜索算法的实验性能.     

Heuristic Solutions for Locating Health Resources

Of the three metaheuristic strategies tested that can help determine healthcare facility locations, scatter search performed the best and fastest. Hypoglycemia, or low blood sugar, can cause many health problems, including blurred vision, mental confusion, and speech impairment. If someone becomes severely hypoglycemic and doesn't recover quickly, he or she might lose consciousness and go into a diabetic coma. If that happens, the person must get treated within 15 to 20 minutes; otherwise, he or she almost certainly will suffer devastating physical damage - possibly neuropathy, or blindness - or might even die. Because the risk of permanent neurological deficit increases as the coma is prolonged, it's important for people with diabetes to live no further than 20 minutes (known as the critical time) from their closest health center. Facility location problems such as this involve determining where to install resources and how to assign potential customers to those resources. Most studies on location problems are framed under deterministic conditions. Our proposed solution is more realistic. We adapted, implemented, and compared three metaheuristic strategies - scatter search, tabu search. and variable neighborhood search - to find the best locations in Spain's Burgos province to place health resources for treating people in diabetic comas. To check the efficiency of SS, TS, and VNS, we used instances of the well-known OR-Library as well as real data from the Burgos area in northern Spain. Using metaheuristics is a good option when the problem's complexity prevents us from using a commercially available solver to solve it exactly. This is especially true here, because we're considering hundreds of locations.     

内容中心网络安全技术研究综述

内容中心网络（Content Centric Networking,CCN）属于信息中心网络的一种,是未来互联网体系架构中极具前景的架构之一,已成为下一代互联网体系的研究热点。内容中心网络中的内容路由、内嵌缓存、接收端驱动传输等新特征,一方面提高了网络中的内容分发效率,另一方面也带来了新的安全挑战。本文在分析CCN工作原理的基础上,介绍了CCN的安全威胁、安全需求以及现有的解决方案,并展望了CCN安全技术研究的方向。首先,详细介绍了CCN的原理和工作流程,对比分析了CCN与TCP/IP网络的区别,并分析了CCN面临的安全威胁及需求。其次,对CCN中隐私保护、泛洪攻击、缓存污染、拥塞控制等技术的研究现状进行归纳、分析、总结,并分析了现有方案的优缺点及不足,进而分析可能的解决方案。最后,对CCN安全技术面临的挑战进行了分析与讨论,并展望了未来的研究方向及发展趋势。通过对已有研究工作进行总结与分析,本文提出了CCN安全技术潜在研究方向与关键问题,为CCN安全后续研究提供有益参考。     

Online Social Network Security: A Comparative Review Using Machine Learning and Deep Learning

Neural Processing Letters - In the present era, Online Social Networking has become an important phenomenon in human society. However, a large section of users are not aware of the security and...     

区块链技术构筑互联网信息安全新范式

互联网信息在传播中实现了信息共享,同时,也面临信息失真的危险,如何有效辨别信息的真伪性成为需要解决的重要问题。为了保证信息安全,采用区块链技术构建安全架构,合理运用数学算法,可以保证信息数据不被篡改,发挥其基础性的作用。笔者针对区块链技术构筑互联网信息安全新范式展开研究。     

一种支持网上共享设备的安全模型

分析和比较了传统访问控制模型中客体与共享设备资源的异同,指出了设备资源具有时间依赖性、权限差异性、容量受限和进程依赖性,并根据共享设备资源的特性要求,在基于角色的访问控制模型的基础上引入了动态执行者、固定角色和设备访问控制策略等概念,提出了一种远程设备访问控制模型(RDAC),更好地实现了对设备的描述和访问控制。     

一种基于在线招投标系统保护数据安全性的方法

分析了基于网上在线招投标的过程及其安全性要求,综合应用加密和信息摘要技术,提出了一种在传输和存储过程中保护数据的保密性和完整性的设计方法,以防止在数据库的应用中数据被非法窃取和篡改。实验结果表明了该方法的有效性。     

基于WiFi技术的擦身社交平台研究

文章描述了一种在Wi Fi环境下的基于UPD通讯技术的局域网自动交友平台技术,主要用于有WIFI网络环境下、不需要接入Internet的、实时互动的手持设备上。用户只需要保持移动设备处于开启状态,便可随时自动去进行信息的交互。     

信息系统上线前安全评测方案的研究

随着国家信息化建设的飞速发展,信息系统得到广泛应用,而针对信息系统的攻击也越来越普遍,安全事件时有发生,如何确保信息系统得到足够安全保障,系统符合上线运行条件,将成为一项重要课题。本文提出一套在信息系统上线前开展安全评测的方案,内容包括四个方面:代码安全审计、安全漏洞扫描、安全配置核查和渗透性测试,并给出判别信息系统上线安全标准。此方案能有效的检测出信息系统各层面隐藏的安全漏洞,并可以根据安全标准得出是否符合上线运行的结论,有力的保障信息系统上线运行安全。     

A Heuristic Search for Identifying Required Application Libraries Supporting a Run-Time Security Policy

On a Windows platform it is possible to inject a DLL into a running process creating a new thread of execution within an authorized process. Security tools monitoring or examining DLLs loaded into the memory space of a given process rely on policies to determine the validity of the library. Two approaches to the policy specification include “all or nothing” and “per executable” rules also referred to as a run-time security policy. Developing the run-time policy requires the running of every executable for a period of time to train the system. An alternative to the training method of the run-time approach is to determine ahead of time which DLL should be loaded before execution. A tool called LibMon was developed to monitor loading of libraries by running applications. A heuristic search algorithm was created based on the analysis of the data collected with LibMon.     

一种网络话题的内容焦点迁移识别方法

随着网络信息技术的迅速发展,互联网已经成为人们获取和发布信息的最重要平台之一.在互联网的信息传播过程中,话题相关文本不断更新,而其内容焦点也随着话题发展发生着迁移.识别话题内容焦点有助于有效地挖掘与分析网络信息,是网络舆情分析领域的重要研究问题.文中针对网络流文本,提出了一种网络话题内容焦点的识别方法,首先对话题焦点特征在流文本中的分布情况进行分析,基于分析结果介绍了焦点识别方法3个主要步骤的算法模型,分别是基于时间属性的焦点特征词提取、内容焦点特征词的合并和内容焦点的表示.文本基于来自于真实网络的实际数据,对所提方法进行了实验验证,实验结果表明文中所提方法可有效获取话题发展过程中的内容焦点,并能以关键词集和语句集的形式对内容焦点进行表示.     

一种新的在线社交网络社区发现算法

针对传统的社交网络社区发现算法时间复杂度较高的问题,提出了一种新的在线社交网络社区发现MICDA算法.运用凝聚思想并引入模块度增量的概念,按照杜区划分的标准自底向上的构建一个社交网络大社区,采用微博用户数据集和karate数据集上进行社区划分,并与传统的社区发现算法GN和FN进行对比分析.仿真结果表明,提出的社区发现算法MICDA要优于传统的GN(Girvan,Newman)和FN(Fast,Newman)算法,时间复杂度大大降低,且适用于大型社交网络的社区发现.