“Your ride has arrived” – Exploring the nexus between subjective well-being,socio-cultural beliefs,COVID-19, and the sharing economy

This study aimed to identify and explain different facets of the sharing economy and to differentiate between micro- and macro-mobility services. We also aimed to examine the correlation between the sharing economy and subjective well-being, cultural beliefs, and COVID-19. An exploratory research technique with face-to-face semi-structured interviews was used to collect data from a sample of 22 rideshare app users in a developing country between January and May 2020 and in July 2020. The data were analyzed using the NVivo 12 application. The major findings suggest that, considering their scope and use, sharing economy technology and services can be divided into four major domains: (1) hospitality and dining, (2) retail and consumer goods, (3) media and entertainment, and (4) automotive and transportation. In ridesharing services, the well-being of users is influenced (and suppressed) by eight factors. In addition, socio-cultural beliefs are prevalent in developing markets, and the impact of COVID-19 on the sharing economy is evident. However, the pandemic has promoted the use of micro-mobility services. This study, which contributes to the existing knowledge on the theory of subjective well-being and cultural beliefs, has major theoretical and managerial implications and offers a rich future research agenda.     

Mechanisms of access to the Internet in rural areas of developing countries

Because of severe affordability and skills constraints it is especially difficult to bring the Internet to rural areas of developing countries. But a number of promising alternatives are beginning to emerge. These are mainly designed to bring the Internet to non-users, that is, persons who do not actually come into direct contact with the technology. Such persons make up the bulk of the rural population in most developing countries. Two possibilities exist: one that involves intermediation at a distance (blending) and the other that takes place at close range (via say Internet kiosks). I use numerous examples to illustrate the potential of both these categories. For the minority of those who are able to actually use the Internet, costs can be lessened by a combination of communal institutions and technical sharing devices.     

多分存彩色图像秘密共享（2，n）方案

文献[2]中提出了一种基于异或（XOR）操作的彩色图像秘密共享（2,n）方案,简单易于实现,但恢复密图的效果较差。通过分析此方案,文章提出一个多分存的彩色图像秘密共享（2,n）方案,通过给用户增加分存图像的方法改善了恢复密图的质量。实验分析表明所提方案不仅取得了很好的恢复效果,而且保持了安全性和算法的简单性。     

A Secure Distributed Authentication Scheme Based on CRT-VSS and Trusted Computing in MANET

With the rapid development of Mobile ad hoc network （MANET）, secure and practical authentica- tion is becoming increasingly important. There still ex- ist several unsolved problems. It may suffer from cheat- ing problems and Denial of services （DOS） attacks to- wards authentication service. Most existing schemes do not have satisfactory efficiency due to the exponential arithmetic complexity of Shamir＇s scheme. We explore the property of Verifiable secret sharing （VSS） schemes with Chinese remainder theorem （CRT）, then propose a se- cret key distributed storage scheme based on CRT-VSS and trusted computing techniques. We discuss the homo- morphism property of CRT-VSS and design a secure dis- tributed Elliptic curve-digital signature standard （ECC- DSS） authentication scheme. We provide formal guaran- tees towards the scheme proposed in this paper.     

Monotone Span Program vs.Linear Code

Monotone span program(MSP) and Linear code(LC) are efficient tools to construct Linear secret sharing scheme (LSSS) for a given access structure.Since the size of an MSP or the length of an LC corresponds to the communicational complexity of an LSSS,one main motivation to study MSPs or LCs is the lower bound for their sizes or lengths.Therefore,it is one of the most important open problems how to efficiently construct an MSP or LC for a given access structure Γ with the smallest sizes or shortest length.Our contributions are:We extend TANG et al.'s result,showing that,for any given access structure Γ,there exists an MSP or an LC to realizeΓ if and only ifa system of quadratic equations has solutions;We utilize the relationship between LCs and MSPs to obtain the greatest lower bound on the row size and the column size of MSPs realizing a given Γ,as well as an upper bound on the column size of MSPs;We give an algorithm to construct an MSP with the smallest sizes.     

基于距离自适应和有效共享路径感知的光疏导方法

针对灵活网格光网络中如何节约转发器与频谱资源的问题,该文研究了多点到多点组播业务的光路环路由机制,提出一种基于距离自适应和有效共享路径感知的光疏导方法。通过设计一种基于距离自适应的预处理机制,该疏导方法能根据业务成员节点的分布特点和距离自适应准则灵活地为业务构建光路环;在路由与频谱分配阶段,该疏导方法通过构造一个面向光疏导的业务决策矩阵和一个优先调度向量,将业务疏导到与当前业务具有有效共享路径最多的已路由业务上,并优先分配所需的频谱空间以提高光疏导的成功率,实现节约转发器与频谱资源的目的。仿真结果表明,该文提出的光疏导方法可以有效地减少业务消耗的转发器数目和子载波数目。     

一种完整的非对称公钥叛逆者追踪方案

利用不经意多项式估值协议,该文提出了一种新的非对称公钥叛逆者追踪方案。当参与共谋的叛逆者数量不超过预先设置的范围时,与现有的非对称公钥追踪方案相比,该方案能够以完全的黑盒子追踪方式准确地确定出全部叛逆者;借助于密钥更新,该方案具有完善的撤销性,能够撤销任意数量的叛逆者。此外,与已有方案相比该方案显著降低了追踪时的计算量并且有着更高的传输效率。     

Constructions and Properties of General (k,n) Block‐Based Progressive Visual Cryptography

Recently, Hou and others introduced a (2, n) block‐based progressive visual cryptographic scheme (BPVCS) in which image blocks can be gradually recovered step by step. In Hou and others’ (2, n)‐BPVCS, a secret image is subdivided into n non‐overlapping image blocks. When participants stack their shadow images, all the image blocks associated with these t participants will be recovered. However, Hou and others’ scheme is only a simple 2‐out‐of‐n case. In this paper, we discuss a general (k, n)‐BPVCS for any k and n. Our main contribution is to give two constructions (Construction 1 and Construction 2) of this general (k, n)‐BPVCS. Also, we theoretically prove that both constructions satisfy a threshold property and progressive recovery of the proposed (k, n)‐BPVCS. For , Construction 1 is reduced to Hou and others’ (2, n)‐BPVCS.]     

PCI接口卡硬件与驱动程序设计

介绍了一种较为通用的PCI接口卡的硬件结构,说明了硬件设计的几种可行性方案和硬件设计时需要注意的问题,同时详细地阐述了PCI设备WDM驱动程序开发的基本方法,比较了几种常用开发工具的优缺点,并对驱动程序中的PCI设备I／O端口与存储器的读写、中断处理以及应用程序与驱动程序之间多种通信方式作了详细的介绍。     

Ad hoc网络信任模型的研究

Ad hoc网络的特点使得现有固网中许多安全策略难以在其中实施，必须研究新的解决方案来实现Ad hoc网络安全通信。本文分析秘密共享解决方案，同时针对异步环境中消息传送延迟和处理器执行速度的不可预知性，采用一种新的异步网络环境下的信任模型(ASS)，解决异步网络环境下信任关系的建立问题。