检索结果-内蒙古大学图书馆

AFRICON Conference

作者： T. L. Grobler E. R. Ackermann J. C. Olivier A. J. van Zyl Department of Electrical Electronic and Computer Engineering University of Pretoria Pretoria South Africa Defence Peace Safety and Security (DPSS) Council for Scientific and Industrial Research (CSIR) Pretoria South Africa Department of Mathematics and Applied Mathematics University of Pretoria Pretoria South Africa

Systematic Luby Transform (fountain) codes are investigated as a possible incremental redundancy scheme for EDGE. The convolutional incremental redundancy scheme currently used by EDGE is replaced by the fountain approach. The results of the simulations performed for each incremental redundancy scheme show that the fountain approach outperforms the convolutional approach on the second retransmission when implemented on the EDGE platform. The results also indicate that if the packet sizes used by a specific platform is large enough the fountain approach will always outperform the convolutional approach.

关键词： Decoding Redundancy Convolutional codes Encoding Iterative decoding Systematics Receivers

来源：评论

学校读者我要写书评

暂无评论

On the Privacy of Mental Health Apps: An Empirical Investigation and its Implications for Apps Development

arXiv

引用

arXiv 2022年

作者： Iwaya, Leonardo Horn Ali Babar, M. Rashid, Awais Wijayarathna, Chamila Centre for Research on Engineering Software Technologies The University of Adelaide AdelaideSA5005 Australia Australia Department of Mathematics and Computer Science Karlstad University Karlstad Sweden Bristol Cyber Security Group Department of Computer Science University of Bristol United Kingdom

An increasing number of mental health services are offered through mobile systems, a paradigm called mHealth. Although there is an unprecedented growth in the adoption of mHealth systems, partly due to the COVID-19 pandemic, concerns about data privacy risks due to security breaches are also increasing. Whilst some studies have analyzed mHealth apps from different angles, including security, there is relatively little evidence for data privacy issues that may exist in mHealth apps used for mental health services, whose recipients can be particularly vulnerable. This paper reports an empirical study aimed at systematically identifying and understanding data privacy incorporated in mental health apps. We analyzed 27 top-ranked mental health apps from Google Play Store. Our methodology enabled us to perform an in-depth privacy analysis of the apps, covering static and dynamic analysis, data sharing behaviour, server-side tests, privacy impact assessment requests, and privacy policy evaluation. Furthermore, we mapped the findings to the LINDDUN threat taxonomy, describing how threats manifest on the studied apps. The findings reveal important data privacy issues such as unnecessary permissions, insecure cryptography implementations, and leaks of personal data and credentials in logs and web requests. There is also a high risk of user profiling as the apps' development do not provide foolproof mechanisms against linkability, detectability and identifiability. Data sharing among third parties and advertisers in the current apps' ecosystem aggravates this situation. Based on the empirical findings of this study, we provide recommendations to be considered by different stakeholders of mHealth apps in general and apps developers in particular. We conclude that while developers ought to be more knowledgeable in considering and addressing privacy issues, users and health professionals can also play a role by demanding privacy-friendly apps. Copyright © 2022, The Authors. All r

关键词： Data privacy

来源：评论

学校读者我要写书评

暂无评论

Stochastic Non-convex Ordinal Embedding with Stabilized Barzilai-Borwein Step Size

arXiv

引用

arXiv 2017年

作者： Ma, Ke Zeng, Jinshan Xiong, Jiechao Xu, Qianqian Cao, Xiaochun Liu, Wei Yao, Yuan State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences School of Cyber Security University of Chinese Academy of Sciences School of Computer Information Engineering Jiangxi Normal University Department of Mathematics Hong Kong University of Science and Technology Tencent Ai Lab

Learning representation from relative similarity comparisons, often called ordinal embedding, gains rising attention in recent years. Most of the existing methods are batch methods designed mainly based on the convex optimization, say, the projected gradient descent method. However, they are generally time-consuming due to that the singular value decomposition (SVD) is commonly adopted during the update, especially when the data size is very large. To overcome this challenge, we propose a stochastic algorithm called SVRG-SBB, which has the following features: (a) SVD-free via dropping convexity, with good scalability by the use of stochastic algorithm, i.e., stochastic variance reduced gradient (SVRG), and (b) adaptive step size choice via introducing a new stabilized Barzilai-Borwein (SBB) method as the original version for convex problems might fail for the considered stochastic non-convex optimization problem. Moreover, we show that the proposed algorithm converges to a stationary point at a rate O( 1/T ) in our setting, where T is the number of total iterations. Numerous simulations and real-world data experiments are conducted to show the effectiveness of the proposed algorithm via comparing with the state-of-the-art methods, particularly, much lower computational cost with good prediction performance. MSC Codes *** Copyright © 2017, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Belief propagation for nonlinear block codes

Belief propagation for nonlinear block codes

引用

AFRICON Conference

作者： E. R. Ackermann T. L. Grobler A. J. van Zyl J. C. Olivier Department of Electrical Electronic and Computer Engineering University of Pretoria Pretoria South Africa Defence Peace Safety and Security (DPSS) Council for Scientific and Industrial Research (CSIR) Pretoria South Africa Department of Mathematics and Applied Mathematics University of Pretoria Pretoria South Africa

Special cases of the belief propagation algorithm are commonly used to decode various linear error correcting codes. We show that the belief propagation algorithm can also be applied to the decoding problem for nonlinear error correcting codes by considering a modified set of update rules. We demonstrate the modified belief propagation algorithm by applying it to the well-known Nordstrom-Robinson (15, 256, 5) nonlinear code. The Nordstrom-Robinson code contains many cycles, which means that belief propagation is suboptimal. Nevertheless, we observe a coding gain of about 1.2 dB with this method.

关键词： Belief propagation Block codes Equations Mathematical model Decoding Iterative decoding Schedules

来源：评论

学校读者我要写书评

暂无评论

On the design of a secure user authentication and key agreement scheme for wireless sensor networks

On the design of a secure user authentication and key agreem...

引用

作者： Kumari, Saru Das, Ashok Kumar Wazid, Mohammad Li, Xiong Wu, Fan Choo, Kim-Kwang Raymond Khan, Muhammad Khurram Department of Mathematics Chaudhary Charan Singh University MeerutUttar Pradesh250 005 India Center for Security Theory and Algorithmic Research International Institute of Information Technology Hyderabad500 032 India School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan411 201 China Nanjing University of Information Science and Technology Nanjing210044 China Department of Computer Science and Engineering Xiamen Institute of Technology Xiamen361021 China Department of Information Systems and Cyber Security The University of Texas at San Antonio San AntonioTX78249 United States School of Computer Science China University of Geosciences Wuhan China School of Information Technology & Mathematical Sciences University of South Australia AdelaideSA Australia Center of Excellence in Information Assurance King Saud University Riyadh Saudi Arabia

A wireless sensor network (WSN) typically consists of a large number of resource-constrained sensor nodes and several control or gateway nodes. Ensuring the security of the asymmetric nature of WSN is challenging, and designing secure and efficient user authentication and key agreement schemes for WSNs is an active research area. For example, in 2016, Farash et al. proposed a user authentication and key agreement scheme for WSNs. However, we reveal previously unpublished vulnerabilities in their scheme, which allow an attacker to carry out sensor node spoofing, password guessing, user/sensor node anonymity, and user impersonation attacks. We then present a scheme, which does not suffer from the identified vulnerabilities. To demonstrate the practicality of the scheme, we evaluate the scheme using NS-2 simulator. We then prove the scheme secure using Burrows–Abadi–Needham logic. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Divertible Searchable Symmetric Encryption for Secure Cloud Storage

Divertible Searchable Symmetric Encryption for Secure Cloud ...

引用

GLOBECOM 2022 - 2022 IEEE Global Communications Conference

作者： Xi Zhang Cheng Huang Ye Su Jing Qin Xuemin Shen School of Mathematics Shandong University Jinan China Department of Electrical and Computer Engineering University of Waterloo Waterloo Canada State Key Laboratory of Information Security Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781665435413

Searchable Symmetric Encryption (SSE) is a promising method for users to store data in remote clouds securely and search them using keywords over an encrypted index. In this paper, we explore a new function named “keyword diverting” and propose a variant of SSE named Divertible Searchable Symmetric Encryption (DivSSE). Specifically, the index in DivSSE is encoded into an inverted, compressed, and encrypted format, by using the super-increasing sequence, symmetric homomorphic encryption (SHE), and a secure hash function. According to the homomorphic properties of SHE, users can construct a unique keyword diverting token, which can be utilized to update the encrypted index by obliviously merging data identifiers corresponding to different keywords without searching in advance and thus achieve keyword diverting. Moreover, based on function secret sharing, DivSSE can protect users' search patterns and reduce communication costs with the assistance of two independent clouds. Detailed security proof demonstrates that DivSSE can achieve parallel privacy, forward privacy, and backward privacy. Extensive performance evaluation also shows that DivSSE is efficient in terms of computational and communication overheads.

关键词： Performance evaluation Cloud computing Privacy Data privacy Costs Heuristic algorithms Merging

来源：评论

学校读者我要写书评

暂无评论

Local voting: Optimal distributed node scheduling algorithm for multihop wireless networks

arXiv

引用

arXiv 2017年

作者： Vergados, Dimitrios J. Amelina, Natalia Jiang, Yuming Kralevska, Katina Granichin, Oleg School of Electrical and Computer Engineering National Technical University of Athens Faculty of Mathematics and Mechanics Saint-Petersburg State University Department of Information Security and Communication Technology Norwegian University of Science and Technology

An efficient and fair node scheduling is a big challenge in multihop wireless networks. In this work, we propose a distributed node scheduling algorithm, called Local Voting. The idea comes from the finding that the shortest delivery time or delay is obtained when the load is equalized throughout the network. Simulation results demonstrate that Local Voting achieves better performance in terms of average delay, maximum delay, and fairness compared to several representative scheduling algorithms from the literature. Despite being distributed, Local Voting has a very close performance to a centralized algorithm that is considered to have the optimal performance. Copyright © 2017, The Authors. All rights reserved.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Recognition of altered gene-gene interaction using BiLSTM in different stages of lung adenocarcinoma 2

Recognition of altered gene-gene interaction using BiLSTM in...

引用

2nd International Conference on Machine Learning and Data engineering, ICMLDE 2023

作者： Mallick, Partho Sinha, Mourani Poray, Jayanta Banerjee, Aiswaryya Sarkar, Souvik Ghosh, Anupam Department of Computer Application Techno India University EM4 Sector-V Saltlake West Bengal Kolkata700091 India Department of Mathematics Techno India University EM4 Sector-V Saltlake West Bengal Kolkata700091 India Department of Computer Science & Engineering Sister Nivedita University DG Block Action Area I 1/2 Newtown Kolkata700156 India Cyber Security Solution Architect Vokshith Enclave Road No. 3 Gajularamaram Telangana Hyderabad500055 India Department of ComputerScience&Engineering NetajiSubhasEngineering College Techno CityPanchpota Garia Kolkata700152 India

Cancer which is caused by abnormal growth or tumour snatches away millions of lives each year. Depending on the organ affected, we find various cancer types like blood, skin, lung, kidney, breast, prostrate, liver etc. Some of these are curable if diagnosis of the disease can be made early. Others like pancreatic cancer are very difficult to cure. Hence early detection is one of most important aspects of treatment. Cancer affected patient goes through several stages of the disease. There are usually four stages of cancer. The Stage 1 of cancer being the preliminary stage and stage 4 being the last stage of the disease. It has been observed that the deadliness of the disease aggravates with each stage. There is no fixed or well defined time limit for the change in the stages. It may depend on the type of cancer, the physical attributes of the patient and on external factors and life-style habits. It is usually observed that symptoms change with change in stages of the disease. We intend to find out whether there is any change in the overall relationship between the genes amongst the various stages of lung cancer patients. Long Short Term Memory (LSTM), Bidirectional Long Short Term Memory (BiLSTM) and Feed Forward Neural Network (FNN) are used for analyzing the gene dependencies. The comparative analysis of the results obtained is done using various statistical methods of correlation and regression. Analysis of the results reveal significant variance in correlation among the various stages of lung cancer, showing Stage 2 and Stage 3 to be the most strongly correlated and Stage 1 and Stage 2 being the most weakly correlated indicating the inconsistency of genetic relationship between the various stages of lung cancer. © 2024 Elsevier B.V.. All rights reserved.

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

Computational Science and Its Applications – ICCSA 2012 1

引用

丛书名： Lecture Notes in computer Science

1000年

作者： Beniamino Murgante Osvaldo Gervasi Sanjay Misra Nadia Nedjah Ana Maria A. C. Rocha David Taniar Bernady O. Apduhan

ISBN: (数字)9783642311284

ISBN: (纸本)9783642311277

The four-volume set LNCS 7333-7336 constitutes the refereed proceedings of the 12th International Conference on Computational Science and Its Applications, ICCSA 2012, held in Salvador de Bahia, Brazil, in June 2012. The four volumes contain papers presented in the following workshops: 7333 - advances in high performance algorithms and applications (AHPAA); bioinspired computing and applications (BIOCA); computational geometry and applicatons (CGA); chemistry and materials sciences and technologies (CMST); cities, technologies and planning (CTP); 7334 - econometrics and multidimensional evaluation in the urban environment (EMEUE); geographical analysis, urban modeling, spatial statistics (Geo-An-Mod); 7335 - optimization techniques and applications (OTA); mobile communications (MC); mobile-computing, sensind and actuation for cyber physical systems (MSA4CPS); remote sensing (RS); 7336 - software engineering processes and applications (SEPA); software quality (SQ); security and privacy in computational sciences (SPCS); soft computing and data engineering (SCDE). The topics of the fully refereed papers are structured according to the four major conference themes: 7333 - computational methods, algorithms and scientific application; 7334 - geometric modelling, graphics and visualization; 7335 - information systems and technologies; 7336 - high performance computing and networks.

关键词： computer Communication Networks Algorithm Analysis and Problem Complexity Software engineering Simulation and Modeling Information Systems Applications (incl. Internet) Data Mining and Knowledge Discovery

来源：评论

学校读者我要写书评

暂无评论

Computational Science and Its Applications – ICCSA 2012 1

引用

丛书名： Lecture Notes in computer Science

1000年

作者： Beniamino Murgante Osvaldo Gervasi Sanjay Misra Nadia Nedjah Ana Maria A. C. Rocha David Taniar Bernady O. Apduhan

ISBN: (数字)9783642311253

ISBN: (纸本)9783642311246

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：