2,364 research outputs found
PassInfinity: A software prototype system
No full textThis is a software research prototype system implemented to demonstrate a new "all-in-one" and backward compatible user authentication framework, which can generate passwords from all authentication factors. It was originally developed at the University of Surrey when Shujun Li was still working there, but the IPRs were transferred to the University of Kent in 2018
Lost in the Digital Wild: Hiding Information in Digital Activities
No full textThis paper presents a new general framework of information hiding, in which the hidden information is embedded into a collection of activities conducted by selected human and computer entities (e.g., a number of online accounts of one or more online social networks) in a selected digital world. Different from other traditional schemes, where the hidden information is embedded into one or more selected or generated cover objects, in the new framework the hidden information is embedded in the fact that some particular digital activities with some particular attributes took place in some particular ways in the receiver-observable digital world.
In the new framework the concept of "cover" almost disappears, or one can say that now the whole digital world selected becomes the cover. The new framework can find applications in both security (e.g., steganography) and non-security domains (e.g., gaming). For security applications we expect that the new framework calls for completely new steganalysis techniques, which are likely more complicated, less effective and less efficient than existing ones due to the need to monitor and analyze the whole digital world constantly and in real time. A proof-of-concept system was developed as a mobile app based on Twitter activities to demonstrate the information hiding framework works. We are developing a more hybrid system involving several online social networks
Guo jia ren zheng neng li yan jiu.
No full text歐樹軍.Thesis (Ph.D.)--Chinese University of Hong Kong, 2009.Includes bibliographical references (leaves 238-253)Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.Abstracts in Chinese and English.Ou Shujun
Agricultural Mechanization Promotion in China - Current Situation and Future
No full textRosana G. Moreira, Editor-in-Chief; Texas A&M UniversityThis is a paper from International Commission of Agricultural Engineering (CIGR, Commission Internationale du Genie Rural) E-Journal Volume 7 (2005): Agricultural Mechanization Promotion in China - Current Situation and Future by Prof. Shujun L
Data Flow Control for Network Load Balancing in IEEE Time-Sensitive Networks for Automation
No full textIEEE time-sensitive networks (TSN) offer redundant paths for automation networks that are essential preconditions for network load balancing (NLB) or distribution. They also provide several traffic shapers and schedulers with different impacts on the data flow control. The selection of the right traffic shaper or scheduler for an automation network is challenging. Their influence depends on various network parameters such as network extension, network cycles, application cycles, and the amount of data per traffic class and network cycle. In this study, the data flow control for network load balancing in an automation TSN using different traffic shapers and schedulers was investigated. The effects of the network parameters on the shapers and schedulers were derived and imported into the data flow control model of the automation network. The sample networks were simulated, and performance comparisons were performed. The results show that enhancements for scheduled traffic (EST), strict priority queuing (SPQ), and the combination of SPQ with frame preemption are better scheduler selections in connection with larger networks, fast network cycles, and fast application cycles. The cyclic queuing and forwarding (CQF) shaper and asynchronous traffic shaper (ATS) are only alternatives for data load control in small networks or in conjunction with slow applications.</p
Taxonomic status of Rana nigromaculata mongolia and the validity of Pelophylax tenggerensis (Anura, Ranidae)
No full textZhou, Shengbo, He, Li, Ma, Siyu, Xu, Shujun, Zhai, Qiang, Guan, Ping, Wang, Hui, Shi, Jingsong (2022): Taxonomic status of Rana nigromaculata mongolia and the validity of Pelophylax tenggerensis (Anura, Ranidae). Zootaxa 5165 (4): 486-500, DOI: https://doi.org/10.11646/zootaxa.5165.4.
Repetitive, Oblivious, and Unlinkable SkNN Over Encrypted-and-Updated Data on Cloud
No full textLocation-Based Services (LBSs) depend on a Service Provider (SP) to store data owners’ geospatial data and to process data users’ queries. For example, a Yelp user queries the SP to retrieve the k nearest Starbucks by submitting her/his current location. It is well-acknowledged that location privacy is vital to users and several prominent Secure k Nearest Neighbor (SkNN) query processing schemes are proposed. We observe that no prior work addresses the requirement of repetitive query after index update and its privacy issue, i.e., how to match a data item from the cloud repetitively in an oblivious and unlinkable manner. Meanwhile, a malicious SP may skip some data items and recommend others due to unfair competition. In this work, we formally define the repetitive query and its privacy objectives and present an Repetitive, Oblivious, and Unlinkable SkNN scheme ROU. Specifically, we design a multi-level structure to organize locations to further improve search efficiency. Second, we integrate data item identity into the framework of existing SkNN query processing. Data owners encrypt their data item identity and location information into a secure index, and data users encrypt a customized identity range of a previously retrieved data item and location information into a token. Next, the SP uses the token to query the secure index to find the specific data item via privacy-preserving range querying. We formally prove the privacy of ROU in the random oracle model. We build a prototype based on a server to evaluate the performance with a real-world dataset. Experimental results show that ROU is efficient and practical in terms of computational cost, communication overhead, and result verification.Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Cyber Securit
Novel asymmetric anode-supported hollow fiber solid oxide fuel cell
No full textAbstract not availableDixiong Zhou, Shujun Peng, Yanying Wei, Zhong Li, Haihui Wan
Curvature estimates for the level sets of solutions of the Monge-Amp\`{e}re equation
No full textFor the Monge-Amp\`{e}re equation , we find new auxiliary
curvature functions which attain respective maximum on the boundary. Moreover,
we obtain the upper bounded estimates for the Gauss curvature and mean
curvature of the level sets for the solution to this equation.Comment: This paper is part of the PhD thesis of the Third author Shujun Shi,
and is submitted in Jan. 201
sj-pdf-3-imr-10.1177_03000605231161204 - Supplemental material for A nomogram based on metabolic profiling to discriminate lung cancer among patients with lung nodules
No full textSupplemental material, sj-pdf-3-imr-10.1177_03000605231161204 for A nomogram based on metabolic profiling to discriminate lung cancer among patients with lung nodules by Chenwei Li, Zhuo Chen, Hui Zhao, Cuicui Wang, Shujun Yu, Hengde Ma, Qi Wang and Xiaohui Du in Journal of International Medical Research</p
- …
