基于MF-R和AWS密钥管理机制的物联网健康监测大数据分析系统

带有传感器的可穿戴式医疗设备不断生成大量数据，由于数据的复杂性，难以通过处理和分析大数据来找到有价值的决策信息。为了解决这个问题，提出了一种新的物联网体系结构，用于存储和处理医疗应用的可扩展传感器数据（大数据）。所提出的架构主要由两个子架构组成：Meta Fog重定向（MF-R）架构和AWS密钥管理机制。MF-R架构使用Apache Pig和Apache HBase等大数据技术来收集和存储不同传感器设备生成的传感器数据，并利用卡尔曼滤波消除噪声。AWS密钥管理机制使用密钥管理方案，目的是保护云中的数据，防止未经授权的访问。当数据存储在云中时，所提出的系统能够使用随机梯度下降算法和逻辑回归来开发心脏病的预测模型。仿真实验表明，和其他几种算法相比，提出的算法具有更小的误差，且在吞吐量、准确度等方面具有一定的优越性。     

On Cost Aware Cloudlet Placement for Mobile Edge Computing

As accessing computing resources from the remote cloud inherently incurs high end-to-end (E2E) delay for mobile users, cloudlets, which are deployed at the edge of a network, can potentially mitigate this problem. Although some research works focus on allocating workloads among cloudlets, the cloudlet placement aiming to minimize the deployment cost (i.e., consisting of both the cloudlet cost and average E2E delay cost) has not been addressed effectively so far. The locations and number of cloudlets have a crucial impact on both the cloudlet cost in the network and average E2E delay of users. Therefore, in this paper, we propose the Cost Aware cloudlet PlAcement in moBiLe Edge computing (CAPABLE) strategy, where both the cloudlet cost and average E2E delay are considered in the cloudlet placement. To solve this problem, a Lagrangian heuristic algorithm is developed to achieve the suboptimal solution. After cloudlets are placed in the network, we also design a workload allocation scheme to minimize the E2E delay between users and their cloudlets by considering the user mobility. The performance of CAPABLE has been validated by extensive simulations.      

Visualizing for the Non‐Visual: Enabling the Visually Impaired to Use Visualization

The majority of visualizations on the web are still stored as raster images, making them inaccessible to visually impaired users. We propose a deep‐neural‐network‐based approach that automatically recognizes key elements in a visualization, including a visualization type, graphical elements, labels, legends, and most importantly, the original data conveyed in the visualization. We leverage such extracted information to provide visually impaired people with the reading of the extracted information. Based on interviews with visually impaired users, we built a Google Chrome extension designed to work with screen reader software to automatically decode charts on a webpage using our pipeline. We compared the performance of the back‐end algorithm with existing methods and evaluated the utility using qualitative feedback from visually impaired users.     

移动智能平台的可信计算体系结构与应用研究

在分析移动智能平台安全需求基础上,从逻辑原理、硬件组成、软件系统三个层面提出了移动智能平台的可信计算体系结构,之后提出了包含十种可信计算应用功能的全景图。     

基于Internet的远程教育系统模型研究

随着计算机网络技术的发展，远程教学系统的结构发生了重大的变化，逐步由原来的客户机／服务器(C／S)结构转变为基于Internet的浏览器／服务器(B／S)结构。本文提出了基于CORBA技术的B／S结构系统模型。分析了其运行过程，并与传统的结构进行了比较，指明了其优越性。在本文的结尾。指出了使用这种技术的一个具体例子。     

汽车计算平台工程国外相关标准概述

结合我国汽车计算平台工程,分析了国外相关的标准现状和基本框架,并为今后工作的开展提出了建议.     

Efficient multicast search under delay and bandwidth constraints

The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard. We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior to the implementation of an optimal single user search on a group of users. Amotz Bar-Noy received the B.Sc. degree in 1981 in Mathematics and Computer Science and the Ph.D. degree in 1987 in Computer Science, both from the Hebrew University, Israel. From October 1987 to September 1989 he was a post-doc fellow in Stanford University, California. From October 1989 to August 1996 he was a Research Staff Member with IBM T. J. Watson Research Center, New York. From February 1995 to September 2001 he was an associate Professor with the Electrical Engineering-Systems department of Tel Aviv University, Israel. From September 1999 to December 2001 he was with AT research labs in New Jersey. Since February 2002 he is a Professor with the Computer and Information Science Department of Brooklyn College - CUNY, Brooklyn New York. Zohar Naor received the Ph.D. degree in Computer Science from Tel Aviv University, Tel Aviv, Israel, in 2000. Since 2003 he is with the University of Haifa, Israel. His areas of interests include wireless networks, resource management of computer networks, mobility, search strategies, and multiple access protocols.     

网格资源管理系统模型研究

网格资源管理系统是网格计算系统的重要组成部分。文章分析了网格资源管理系统的功能需求，具体论述了该模型的原型系统，最后介绍了相关研究工作。     

可信计算与可信网络

论文对主流的可信计算技术——TCPA和NGSCB进行了分析,并对可信计算平台(TCP)进行了研究,对基于可信计算的可信网络的三个基本属性进行了分析和研究,最后介绍了可信网络的发展现状。     

用Delphi实现快速删除TList的批连续结点算法的探讨

在编制遥测数据处理软件的过程中，面对大量的测试数据，经常需要编写高效率的数据过滤器。本文讨论了一种通过采用跨单元、跨类访问Delphi类的私有域的方法实现快速删除TList批连续结点的新算法，并通过测试结果得到验证。