Secure three-party computational protocols for triangle area

In this work, we have put forth two different protocols to address a concrete secure multi-party computational (MPC) problem related to a triangle, of which the coordinates of the three vertices are confidentially kept by the three participants, respectively. The three parties wish to collaboratively compute the area of this triangle while preserving their own coordinate privacy. As one of the merits, our protocols employ weaker assumptions of the existence of pseudorandom generators. In particular, unlike massive secure MPC protocols that rely a lot on oblivious transfer, ours utilize a new computing idea called “pseudorandom-then-rounding” method to avoid this burdensome obstacle. The two protocols are based on different theorems, while they both make use of the same underlying idea. At last, we provide a detailed proof for the first protocol by a series of security reductions of our newly defined games, which seems somewhat stronger than the previous simulation-based proofs and a proof sketch for the second one. Analysis and discussion about the reasons are provided as well to round off our work.     

Practical chosen-ciphertext secure Hierarchical Identity-Based Broadcast Encryption

We focus on practical Hierarchical Identity-Based Broadcast Encryption (HIBBE) with semantic security against adaptively chosen-ciphertext attacks (CCA2) in the standard model. We achieve this goal in two steps. First, we propose a new HIBBE scheme that is secure against chosen-plaintext attacks (CPA). Compared with the existing HIBBE scheme that is built from composite-order bilinear groups, our construction is based on prime-order bilinear groups. The much better efficiency of group operations in prime-order bilinear groups makes our proposed HIBBE scheme more practical. Then, we convert it into a CCA2-secure scheme at the cost of a one-time signature. Instead of extending one user hierarchy in the Canetti–Halevi–Katz approach from CPA-secure (\(l+1\))-Hierarchical Identity-Based Encryption [(\(l+1\))-HIBE] to CCA2-secure \(l\)-HIBE, our construction merely adds one on-the-fly dummy user in the basic scheme. We formally prove the security of these two schemes in the standard model. Comprehensive theoretical analyses and experimental results demonstrate that the proposed HIBBE schemes achieve desirable performance.     

SleepExplorer: a visualization tool to make sense of correlations between personal sleep data and contextual factors

Getting enough quality sleep is a key part of a healthy lifestyle. Many people are tracking their sleep through mobile and wearable technology, together with contextual information that may influence sleep quality, like exercise, diet, and stress. However, there is limited support to help people make sense of this wealth of data, i.e., to explore the relationship between sleep data and contextual data. We strive to bridge this gap between sleep-tracking and sense-making through the design of SleepExplorer, a web-based tool that helps individuals understand sleep quality through multi-dimensional sleep structure and explore correlations between sleep data and contextual information. Based on a two-week field study with 12 participants, this paper offers a rich understanding on how technology can support sense-making on personal sleep data: SleepExplorer organizes a flux of sleep data into sleep structure, guides sleep-tracking activities, highlights connections between sleep and contributing factors, and supports individuals in taking actions. We discuss challenges and opportunities to inform the work of researchers and designers creating data-driven health and well-being applications.     

Viscosity-difference-induced asymmetric selective focusing for large stroke particle separation

We developed a new approach for particle separation by introducing viscosity difference of the sheath flows to form an asymmetric focusing of sample particle flow. This approach relies on the high-velocity gradient in the asymmetric focusing of the particle flow to generate a lift force, which plays a dominated role in the particle separation. The larger particles migrate away from the original streamline to the side of the higher relative velocity, while the smaller particles remain close to the streamline. Under high-viscosity (glycerol–water solution) and low-viscosity (PBS) sheath flows, a significant large stroke separation between the smaller (1.0 μm) and larger (9.9 μm) particles was achieved in a sample microfluidic device. We demonstrate that the flow rate and the viscosity difference of the sheath flows have an impact on the interval distance of the particle separation that affects the collected purity and on the focusing distribution of the smaller particles that affects the collected concentration. The interval distance of 293 μm (relative to the channel width: 0.281) and the focusing distribution of 112 μm (relative to the channel width: 0.107) were obtained in the 1042-μm-width separation area of the device. This separation method proposed in our work can potentially be applied to biological and medical applications due to the wide interval distance and the narrow focusing distribution of the particle separation, by easy manufacturing in a simple device.     

An efficient algorithm for partially matched services in internet of services

Internet of Things (IoT) connects billions of devices in an Internet-like structure. Each device encapsulated as a real-world service which provides functionality and exchanges information with other devices. This large-scale information exchange results in new interactions between things and people. Unlike traditional web services, internet of services is highly dynamic and continuously changing due to constant degrade, vanish and possibly reappear of the devices, this opens a new challenge in the process of resource discovery and selection. In response to increasing numbers of services in the discovery and selection process, there is a corresponding increase in number of service consumers and consequent diversity of quality of service (QoS) available. Increase in both sides’ leads to the diversity in the demand and supply of services, which would result in the partial match of the requirements and offers. This paper proposed an IoT service ranking and selection algorithm by considering multiple QoS requirements and allowing partially matched services to be counted as a candidate for the selection process. One of the applications of IoT sensory data that attracts many researchers is transportation especially emergency and accident services which is used as a case study in this paper. Experimental results from real-world services showed that the proposed method achieved significant improvement in the accuracy and performance in the selection process.     

基于深度图像的人体运动姿态跟踪和识别算法

由于人体运动的复杂性,现有基于低质量深度图像的三维立体姿态跟踪和识别 方法的准确性较低、鲁棒性较差。针对低质量深度图像的人体运动姿态和识别问题,本文设 计了一种基于三步搜索算法的人体运动姿态的跟踪和识别方法。该方法首先对获取的深度信 息进行分析,从而判定人体轮廓;然后通过基于深度图像的骨骼跟踪方法跟踪特定骨骼点, 并采用三步搜索算法进行运动估计,跟踪获取人体运动轨迹;最后利用获取的骨骼点坐标实 现人体运动姿态的识别。实验结果表明,该算法克服光照影响的鲁棒性较强,且能有效地提 高人体运动姿态跟踪与识别的准确性。     

基于PBL的高职计算机基础课堂教学改革实践探索

在高职计算机基础教学中应用PBL教学法,教学中学生围绕实际问题情境开展自主学习和小组协作学习,教师从知识技能的传授者转变为学生学习的引导者、合作者,这种教学模式能够激发学生的兴趣,有助于培养学生综合分析能力和解决实际问题的能力,能培养学生独立思考和团队协作能力,与高职教育对人才培养的要求基本一致.