作者机构：
[Hsu, Ching-Fang; Xu, Hang] Cent China Normal Univ, Comp Sch, Wuhan 430079, Peoples R China.;[Harn, Lein] Univ Missouri, Dept Comp Sci Elect Engn, Kansas City, MO 64110 USA.;[Xia, Zhe] Wuhan Univ Technol, Dept Comp Sci, Wuhan 430071, Peoples R China.
通讯机构：
[Zhe Xia; Lein Harn] D;[Ching-Fang Hsu; Hang Xu] C;Department of Computer Science Electrical Engineering,University of Missouri,Kansas,USA<&wdkj&>Computer School,Central China Normal University,Wuhan 430079,China<&wdkj&>Department of Computer Science,Wuhan University of Technology,Wuhan 430071,China
关键词：
Introduction;Materials and Methods;Results;Discussion;Conclusion;Abstract;Data Availability;Additional Points;Ethical Approval;Consent;Disclosure;Conflicts of Interests;Authors’ Contributions;Funding Statement;Acknowledgements;Acknowledgments;Supplementary Materials;Reference;Dataset Description;Dataset Files;Abstract;Introduction;Introduction and Materials;Introduction and Methods;Materials;Materials and Methods;Methods;Results;Discussion;Results and Discussion;Discussion and Conclusion;Results and Conclusion;Conclusion;Conclusions;Data Availability;Additional Points;Ethical Approval;Consent;Disclosure;Conflicts of Interest;Authors’ Contributions;Funding Statement;Acknowledgements;Supplementary Materials;References;Appendix;Abbreviations;Preliminaries;Introduction and Preliminaries;Notation;Proof of Theorem;Proofs;Analysis of Results;Examples;Numerical Example;Applications;Numerical Simulation;Model;Model Formulation;Systematic Palaeontology;Nomenclatural Acts;Taxonomic Implications;Experimental;Synthesis;Overview;Characterization;Background;Experimental;Theories;Calculations;Model Verification;Model Implementation;Geographic location;Study Area;Geological setting;Data Collection;Field Testing;Data and Sampling;Dataset;Literature Review;Related Works;Related Work;System Model;Methods and Data;Experimental Results;Results and Analysis;Evaluation;Implementation;Case Presentation;Case Report;Search Terms;Case Description;Case Series;Background;Limitations;Additional Points;Case;Case 1;Case 2 etc.;Concern Details;Retraction Details;Copyright;Related Articles
摘要：
The next generation of mobile networks and communications (5G networks) has a very strong ability to compute, store, and so on. Group-oriented applications demonstrate their potential ability in resource-constrained information systems (RISs) towards 5G. The security issues in RIS towards 5G have attracted great attention. For example, how to conduct fair and orderly multiparty communication in an intelligent transportation system (ITS). One of the main challenges for secure group-oriented applications in RIS towards 5G is how to manage RIS communications fairly in multiparty applications. In other words, when the users cannot transmit their messages simultaneously, the order of their communication can cause security concerns in multiparty applications. A feasible solution to the problem is for the group of users to follow a specific order to transmit their messages. Otherwise, some users may take advantage over other users if there has no agreeable order to be followed. In this paper, we propose a novel cryptographic primitive, called multiparty drawing-straw (MDS) protocol, which can be used by a group of users to determine the order of the group to participate in the multiparty applications. Our scheme is based on Pedersen's verifiable secret sharing (VSS), which is a well-known scheme. Our proposed protocol is fair since the output is uniformly distributed, and this is an attractive feature for secure multiparty applications in RIS towards 5G.
期刊：
AMERICAN JOURNAL OF TRANSLATIONAL RESEARCH,2022年14(4):2461-2468 ISSN：1943-8141
通讯作者：
Zhang, CL;Zhu, X
作者机构：
[Tai, Qirui; Song, Qiuyan] Kunming Med Univ, Affiliated Hosp 6, Dept Pharm, Yuxi 653100, Yunnan, Peoples R China.;[Cai, Yuanxuan; Zhang, Chengliang; Zhao, Yuhang] Huazhong Univ Sci & Technol, Tongji Med Coll, Sch Pharm, 1095 Jiefang Ave, Wuhan 430030, Hubei, Peoples R China.;[Guo, Kangyuan] Huazhong Univ Sci & Technol, Tongji Med Coll, Sch Med & Hlth Management, Wuhan 430030, Hubei, Peoples R China.;[Li, Min; Zhang, Chengliang; Yu, Zaoqin] Univ Sci & Technol, Tongji Med Coll, Tongji Hosp, Wuhan 430030, Hubei, Peoples R China.;[Zhu, Xuan; Zhu, X] Cent China Normal Univ, Sch Comp, 152 Luoyu Rd, Wuhan 430079, Hubei, Peoples R China.
通讯机构：
[Zhang, CL ] H;[Zhu, X ] C;Huazhong Univ Sci & Technol, Tongji Med Coll, Sch Pharm, 1095 Jiefang Ave, Wuhan 430030, Hubei, Peoples R China.;Cent China Normal Univ, Sch Comp, 152 Luoyu Rd, Wuhan 430079, Hubei, Peoples R China.
关键词：
Chinese population;multivariate analysis;allergic history;OXA-free interval
摘要：
Objective: Hypersensitivity reactions with oxaliplatin (OXA) have attracted much attention. This study aimed to analyze the risk factors for OXA-induced hypersensitivity reaction in Chinese colorectal cancer patients through a single center retrospective investigation. Methods: The information from 459 colorectal cancer patients treated with OXA in a hospital was collected retrospectively to explore the risk factors for OXA-induced hypersensitivity reaction. Results: Among the 459 patients, 47 (10.24% incidence) cases developed hypersensitivity reactions, with a 3.70% incidence of grade III/IV reaction. The main symptoms included itching, flushing, dyspnea, and rash, which mainly involved skin and adnexa, respiratory system, and nervous system. Dexamethasone pretreatment presented no significant effects on the hypersensitivity reaction (P = 0.282). Multivariate analysis indicated that the previous allergic history (odds ratio (OR) 2.553, 95% confidence interval (CI) 1.139-5.721, P = 0.023) and OXA-free interval (OR 3.605, 95% CI 1.909-6.809, P = 0.000) were independent risk factors for OXA-induced hypersensitivity reaction. Conclusions: The incidence of OXA-induced hypersensitivity reaction in colorectal cancer patients was similar to those reported in other countries. Clinical medical staff should pay close attention to high risk factors, such as allergic history and patients having OXA-free intervals in order to avoid or alleviate hypersensitivity reactions.
摘要：
The increasing prevalence of antibiotic resistance has become a global health crisis. For the purpose of safety regulation, it is of high importance to identify antibiotic resistance genes (ARGs) in bacteria. Although culture-based methods can identify ARGs relatively more accurately, the identifying process is time-consuming and specialized knowledge is required. With the rapid development of whole genome sequencing technology, researchers attempt to identify ARGs by computing sequence similarity from public databases. However, these computational methods might fail to detect ARGs due to the low sequence identity to known ARGs. Moreover, existing methods cannot effectively address the issue of multidrug resistance prediction for ARGs, which is a great challenge to clinical treatments. To address the challenges, we propose an end-to-end multi-label learning framework for predicting ARGs. More specifically, the task of ARGs prediction is modeled as a problem of multi-label learning, and a deep neural network-based end-to-end framework is proposed, in which a specific loss function is introduced to employ the advantage of multi-label learning for ARGs prediction. In addition, a dual-view modeling mechanism is employed to make full use of the semantic associations among two views of ARGs, i.e. sequence-based information and structure-based information. Extensive experiments are conducted on publicly available data, and experimental results demonstrate the effectiveness of the proposed framework on the task of ARGs prediction.
作者：
Wang, Tong;Cui, Jianqun;Chang, Yanan;Huang, Feng;Yang, Yi
作者机构：
[Huang, Feng; Wang, Tong] Cent China Normal Univ, Coll Phys Sci & Technol, Wuhan, Peoples R China.;[Cui, Jianqun; Chang, Yanan] Cent China Normal Univ, Sch Comp Sci, Wuhan, Peoples R China.;[Yang, Yi] NE Illinois Univ, Dept Comp Sci, Chicago, IL USA.
会议名称：
18th IEEE International Conference on Mobility, Sensing and Networking (MSN)
会议时间：
DEC 14-16, 2022
会议地点：
ELECTR NETWORK
会议主办单位：
[Wang, Tong;Huang, Feng] Cent China Normal Univ, Coll Phys Sci & Technol, Wuhan, Peoples R China.^[Cui, Jianqun;Chang, Yanan] Cent China Normal Univ, Sch Comp Sci, Wuhan, Peoples R China.^[Yang, Yi] NE Illinois Univ, Dept Comp Sci, Chicago, IL USA.
关键词：
DTNs;traffic light;probability of encountering;node state
摘要：
Delay-Tolerant Networks (DTNs), a supplementary means of communication network in extreme situations, have aroused wide attention from scholars. However, it is challenging to efficiently utilize DTNs since they have intermittent and high-latency characteristics. In the design of DTNs routing scheme, the selection of relay nodes takes on a great significance in efficient communication. However, existing research has either considered only one of the node features, or simply fused node attributes without fully using their potential correlations. If the above problems are not effectively solved, the propagation of messages between nodes will become blind, and a considerable number of caches will be occupied and wasted by invalid copies. To solve the above challenges, a novel routing, "Traffic Light Routing Based on Node State Awareness (TLRNSA)", is proposed for efficient communication. To be specific, the node's own state, the environmental state, and the historical encounter state are synthesized. The traffic value of the node is obtained based on the adaptive weight adjustment mechanism. The node is divided into three traffic light states, including red, green, and yellow, in accordance with the traffic value. Different routing strategies are developed for the above three states to enhance their performance. The results of the comprehensive experiments suggested that TLRNSA outperforms other state-of-theart algorithms in delivery rate and latency. Compared with the two classic algorithms and the two optimized algorithms, the proposed method increases the delivery rate by 109.1%, 84.12%, 5.09%, and 1.09%, respectively, it reduces the delay by 32.16%, 36.46%, 32.77%, and 6.77%, respectively.
摘要：
延迟容忍网络（DTN）区别于传统Internet网络，无法提供稳定端到端的连接，因此采用“存储-携带-转发”路由机制进行数据传输，而这使得消息需要长时间驻留在节点的缓存中。由于节点的缓存空间和处理能力受价格、体积和功耗的限制，因此如何对缓存进行管理成为影响路由性能的重要因素。本文根据Spray and Wait路由算法的特点，提出一种基于消息综合属性的缓存管理策略（Buffer Management Strategy Based on Message Comprehensive Attributes， MCA-BMS）。该策略综合考虑消息大小、消息生存时间和消息副本数三种消息属性，确定消息的优先级，并根据优先级对消息进行转发和丢弃，同时增加了ACK确认机制，删除冗余消息，提升网络资源利用率。仿真结果表明，MCA-BMS缓存管理策略能够在消息投递率、网络开销和消息传输时延方面有明显的提升。
作者：
Hu, Yue;Yang, Haitong;Zhou, Guangyou;Huang, Jimmy Xiangji
期刊：
ACM Transactions on Asian and Low-Resource Language Information Processing,2022年21(2) ISSN：2375-4699
通讯作者：
Zhou, GY
作者机构：
[Yang, Haitong; Zhou, Guangyou; Zhou, GY; Hu, Yue] Cent China Normal Univ, Sch Comp, Wuhan 430079, Peoples R China.;[Huang, Jimmy Xiangji] York Univ, Sch Informat Technol, 4700 Keele St, Toronto, ON, Canada.
通讯机构：
[Zhou, GY ] C;Cent China Normal Univ, Sch Comp, Wuhan 430079, Peoples R China.
作者机构：
[Hong, Y; Hao, Sheng; Hong, Yong] Cent China Normal Univ, Sch Comp Sci, Wuhan 430079, Peoples R China.;[Hao, Sheng] Cent China Normal Univ, Natl Language Resources Monitoring & Res Ctr Netw, Wuhan 430079, Peoples R China.;[He, Yu] Huanghuai Univ, Coll Informat Engn, Zhumadian 463000, Peoples R China.
通讯机构：
[Hong, Y ] C;[He, Y ] H;Cent China Normal Univ, Sch Comp Sci, Wuhan 430079, Peoples R China.;Huanghuai Univ, Coll Informat Engn, Zhumadian 463000, Peoples R China.
关键词：
energy harvesting;wireless sensor network;greedy strategy;energy efficiency;reception state adjustment mechanism;routing protocol
摘要：
Energy harvesting wireless sensor network (EH-WSN) is considered to be one of the key enabling technologies for the internet of things (IoT) construction. Although the introduced EH technology can alleviate the energy limitation problem that occurs in the traditional wireless sensor network (WSN), most of the current studies on EH-WSN fail to adequately consider the relationship between energy state and data buffer constraint, and thereby they do not address well the issues of energy efficiency and long end-to-end delay. In view of the above problems, a brand new greedy strategy-based energy-efficient routing protocol is proposed in this paper. Firstly, in the system modeling process, we construct an energy evaluation model, which comprehensively considers the energy harvesting, energy consumption and energy classification factors, to identify the energy state of node. Then, we establish a channel feature-based communication range judgment model to determine the transmission area of nodes. Combining these two models, a reception state adjustment mechanism is designed. It takes the buffer occupancy and the MAC layer protocol into account to adjust the data reception state of nodes. On this basis, we propose a greedy strategy-based routing algorithm. In addition, we also analyze the correctness and computational complexity of the proposed algorithm. Finally, we conduct extensive simulation experiments to show that our algorithm achieves optimum performance in energy consumption, packet delivery ratio, average hop count and end-to-end delay and acceptable performance in energy variance.
作者机构：
Department of Computer Science Electrical Engineering,University of Missouri-Kansas City,Kansas City,MO 64110,USA;Computer School,Central China Normal University,Wuhan 430079,China;[Zhe XIA] Department of Computer Science,Wuhan University of Technology,Wuhan 430071,China;[Lein BARN] 密苏里大学;[Chingfang HSU] 华中师范大学
摘要：
A (t,n) threshold secret sharing scheme is a funda-mental tool in many security applications such as cloud com-puting and multiparty computing.In conventional threshold se-cret sharing schemes,like Shamir's scheme based on a univari-ate polynomial,additional communication key share scheme is needed for shareholders to protect the secrecy of their shares if secret reconstruction is performed over a network.In the secret reconstruction,the threshold changeable secret sharing(TCSS) allows the threshold to be a dynamic value so that if some shares have been compromised in a given time,it needs more shares to reconstruct the secret.Recently,a new secret sharing scheme based on a bivariate polynomial is proposed in which shares generated initially by a dealer can be used not only to reconstruct the secret but also to protect the secrecy of shares when the secret reconstruction is performed over a net-work.In this paper,we further extend this scheme to enable it to be a TCSS without any modification.Our proposed TCSS is dealer-free and non-interactive.Shares generated by a dealer in our scheme can serve for three purposes,(a) to reconstruct a se-cret;(b) to protect the secrecy of shares if secret reconstruction is performed over a network;and (c) to enable the threshold changeable property.
