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

Privacy-Aware and AI Techniques for Healthcare Based on K-Anonymity Model in Internet of Things

IEEE Transactions on Engineering Management 2024年 71卷 12448-12462页

作者： Sangaiah, Arun Kumar Javadpour, Amir Ja'fari, Forough Pinto, Pedro Chuang, Huan-Ming National Yunlin University of Science and Technology International Graduate Institute of Artificial Intelligence Douliou64002 Taiwan Lebanese American University Department of Electrical and Computer Engineering Byblos1102 2801 Lebanon Harbin Institute of Technology Department of Computer Science and Technology Shenzhen150001 China Instituto Politécnico de Viana Do Castelo ADiT-Lab Electrotechnics and Telecommunications Department Porto4900-347 Portugal Sharif University of Technology Department of Computer Engineering Tehran11155-9161 Iran National Yunlin University of Science and Technology Department of Information Management Yunlin640 Taiwan

The government and industry have given the recent development of the Internet of Things in the healthcare sector significant respect. Health service providers retain data gathered from many sources and are useful for patient diagnostics and research for pivotal analysis. However, sensitive personal information about a person is contained in healthcare data, which must be protected. Individual privacy protection is a crucial concern for both people and organizations, particularly when those firms must send user data to data centers due to data mining. This article investigated two general states of increasing entropy by changing the entropy of the class set of characteristics based on artificial intelligence and the k-anonymity model in privacy in context, and also three different strategies have been investigated, i.e., the strategy of 'selecting the feature with the lowest number of distinct values,' 'selecting the feature with the lowest entropy,' and 'selecting the feature with the highest entropy.' For future tasks, we can find an optimal strategy that can help us to achieve optimal entropy in the least possible repetition. The results of our work have been compared by lightweight and MH-Internet of Things, FRUIT methods and shown that the proposed method has high efficiency in entropy criteria. © 1988-2012 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

ID based signcryption scheme in standard model

ID based signcryption scheme in standard model

引用

6th International Conference on Provable Security, ProvSec 2012

作者： Selvi, S. Sharmila Deva Vivek, S. Sree Vinayagamurthy, Dhinakaran Rangan, C. Pandu Theoretical Computer Science Lab. Department of Computer Science and Engineering Indian Institute of Technology Madras India Department of Computer Science and Engineering College of Engineering Guindy Anna University Chennai India

ISBN: (纸本)9783642332715

Designing an ID based signcryption scheme in the standard model is among the most interesting and important problems in cryptography. However, all the existing systems in the ID based setting, in the standard model, do not have either the unforgeability property or the indistinguishability property or both of them. In this paper, we present the first provably secure ID based signcryption scheme in the standard model with both these properties. The unforgeability property of this scheme is based on the hardness of Computational Diffie-Hellman problem and the indistinguishability property of this scheme is based on the hardness of Decisional Bilinear Diffie-Hellman problem. Our scheme is strongly unforgeable in the strong attack mode called insider security. Moreover, our scheme possess an interesting property called public verifiability of the ciphertext. Our scheme integrates cleverly, a modified version of Waters' IBE and a suitably modified version of the ID based signature scheme in the standard model proposed by Paterson et al. However, our security reductions are more efficient. Specifically, while the security reductions for indistinguishability is similar to the bounds of Waters' scheme, the unforgeability reductions are way better than the bounds for Paterson et al.'s scheme. © 2012 Springer-Verlag.

关键词： Hardness

来源：评论

学校读者我要写书评

暂无评论

A Closer Look at Anonymous Proxy Re-Encryption Schemes 12th

A Closer Look at Anonymous Proxy Re-Encryption Schemes

引用

12th International Conference on Security, Privacy, and Anonymity in Computation, Communication, and Storage, SpaCCS 2019

作者： Selvi, S. Sharmila Deva Harish, S. Dhanabal, Swethashree Rangan, C. Pandu Theoretical Computer Science Lab Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai600036 India PSG College of Technology Coimbatore641004 India

ISBN: (纸本)9783030249069

Anonymity is one of the most desired properties of a Proxy Re-encryption scheme. Any user communicating over the public channel, availing cloud for proxy re-encryption services requires that any entity (an attacker or cloud administrator) must not infer either the contents of the ciphertexts (confidentiality) or the identities of the participants (anonymity). It is clear that a proxy re-encryption scheme must be collusion-resistant to satisfy the anonymity notion. There are no CCA-secure collusion-resistant proxy re-encryption schemes in the literature which satisfy the anonymity property. In ASIA CCS ’14, an anonymous proxy re-encryption scheme was presented [14] and we present a weakness in the CCA-security proof of their scheme. We present the first proxy re-encryption scheme which is anonymous, collusion-resistant and prove its CCA-security in the random oracle model. We also design a simple, efficient, collusion-resistant CCA-secure proxy re-encryption scheme which is interesting in its own right. In fact, our anonymous scheme is an extension of our novel collusion-resistant scheme. © Springer Nature Switzerland AG 2019.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Same same, but different: Compositionality of paraphrase granularity levels 11

Same same, but different: Compositionality of paraphrase gra...

引用

11th International Conference on Recent Advances in Natural Language Processing, RANLP 2017

作者： Benikova, Darina Zesch, Torsten Language Technology Lab. Department of Computer Science and Applied Cognitive Science University of Duisburg Essen Germany

ISBN: (纸本)9789544520489

Paraphrases exist on different granularity levels, the most frequently used one being the sentential level. However, we argue that working on the sentential level is not optimal for both machines and humans, and that it would be easier and more efficient to work on sub-sentential levels. To prove this, we quantify and analyze the difference between paraphrases on both sentence and sub-sentence level in order to show the significance of the problem. First results on a preliminary dataset seem to confirm our hypotheses. © 2018 Association for Computational Linguistics (ACL). All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Assigning Fine-grained PoS tags based on high-precision coarse-grained tagging 26

Assigning Fine-grained PoS tags based on high-precision coar...

引用

26th International Conference on Computational Linguistics, COLING 2016

作者： Horsmann, Tobias Zesch, Torsten Language Technology Lab. Department of Computer Science and Applied Cognitive Science University of Duisburg-Essen Germany

ISBN: (纸本)9784879747020

We propose a new approach to PoS tagging where in a first step, we assign a coarse-grained tag corresponding to the main syntactic category. Based on this high-precision decision, in the second step we utilize specially trained fine-grained models with heavily reduced decision complexity. By analyzing the system under oracle conditions, we show that there is a quite large potential for significantly outperforming a competitive baseline. When we take error-propagation from the coarse-grained tagging into account, our approach is on par with the state of the art. Our approach also allows tailoring the tagger towards recognizing single word classes which are of interest e.g. for researchers searching for specific phenomena in large corpora. In a case study, we significantly outperform a standard model that also makes use of the same optimizations. © 1963-2018 ACL.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

An Approximation for Routing Planning, Mobile Charging, and Energy Sharing for Sensing Devices

An Approximation for Routing Planning, Mobile Charging, and ...

引用

2023 IEEE International Conference on Web Services, ICWS 2023

作者： Liu, Zifeng Kong, Dejun Gao, Yucen Dai, Haipeng Gao, Xiaofeng He, Tian Shanghai Jiao Tong University MoE Key Lab of Artificial Intelligence Department of Computer Science and Engineering Shanghai China Nanjing University Department of Computer Science and Technology Nanjing China University of Minnesota Department of Computer Science and Technology MN United States

ISBN: (纸本)9798350304855

Wireless Charging Vehicles (WCVs) have been widely explored as a means of enabling continuous operation of sensors that are powered by batteries. However, the energy consumption of WCVs can be inefficient, leading to insufficient energy supply for sensors that are located in challenging-to-access areas. Consequently, there is a need to design an effective charging and energy sharing scheme for sensors to improve the quality of service in this setup. This paper focuses on the Joint optimization of Mobile charging and Energy sharing of sensors (JOIN-ME) problem, which is known to be NP-hard. To address this challenge, we first transform JOIN-ME into a submodular maximization problem with general constraints. Subsequently, we propose the Routing planning, Mobile charging, and Energy sharing for Sensing devices (RMES) algorithm, which has an approximation ratio of 1/8(1-1/e). Finally, we conduct experiments to showcase the superior performance of RMES compared to existing baselines, under varying scales and constraints. Our work on the design of an efficient charging and energy sharing scheme for sensors can significantly improve the reliability and longevity of wireless sensor networks, enabling the deployment of these networks in critical applications such as environmental monitoring, crowd sensing, and security surveillance. © 2023 IEEE.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Weakly-supervised Salient Instance Detection 31

Weakly-supervised Salient Instance Detection

引用

31st British Machine Vision Conference, BMVC 2020

作者： Tian, Xin Xu, Ke Yang, Xin Yin, Baocai Lau, Rynson W.H. Computer Science Department Dalian University of Technology Dalian China Computer Science Department City University of Hongkong Hong Kong Pengcheng Lab Shenzhen China

Existing salient instance detection (SID) methods typically learn from pixel-level annotated datasets. In this paper, we present the first weakly-supervised approach to the SID problem. Although weak supervision has been considered in general saliency detection, it is mainly based on using class labels for object localization. However, it is non-trivial to use only class labels to learn instance-aware saliency information, as salient instances with high semantic affinities may not be easily separated by the labels. We note that subitizing information provides an instant judgement on the number of salient items, which naturally relates to detecting salient instances and may help separate instances of the same class while grouping different parts of the same instance. Inspired by this insight, we propose to use class and subitizing labels as weak supervision for the SID problem. We propose a novel weakly-supervised network with three branches: a Saliency Detection Branch leveraging class consistency information to locate candidate objects;a Boundary Detection Branch exploiting class discrepancy information to delineate object boundaries;and a Centroid Detection Branch using subitizing information to detect salient instance centroids. This complementary information is further fused to produce salient instance maps. We conduct extensive experiments to demonstrate that the proposed method plays favorably against carefully designed baseline methods adapted from related tasks. © 2020. The copyright of this document resides with its authors. It may be distributed unchanged freely in print or electronic forms.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Efficient, pairing-free, authenticated identity based key agreement in a single round 1

引用

7th International Conference on Provable Security, ProvSec 2013

作者： Sree Vivek, S. Sharmila Deva Selvi, S. Renganathan Venkatesan, Layamrudhaa Pandu Rangan, C. Theoretical Computer Science Lab. Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai India National Institute of Technology Tiruchi Tiruchirapalli India

ISBN: (数字)9783642412271

ISBN: (纸本)9783642412264

Ever since Shamir introduced identity based cryptography in 1984, there has been a tremendous interest in designing efficient key agreement protocols in this paradigm. Since pairing is a costly operation and the composite order groups must be very large to ensure security, we focus on pairing free protocols in prime order groups. We propose a new protocol that is pairing free, working in prime order group and having tight reduction to Strong Diffie Hellman (SDH) problem under the CK model. Thus, the first major advantage is that smaller key sizes are sufficient to achieve comparable security. Our scheme has several other advantages. The major one being the capability to handle active adversaries. All the previous protocols can offer security only under passive adversaries. Our protocol recognizes the corruption by an active adversary and aborts the process. Achieving this in single round is significantly challenging. Ours is the first scheme achieving this property. In addition to this significant property, our scheme satisfies other security properties that are not covered by CK model such as forward secrecy, resistance to reflection, key compromise impersonation attacks and ephemeral key compromise impersonation attacks. © 2013 Springer-Verlag.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Optics in computer architectures: Basis of WDM, technologies and potentials

Optics in computer architectures: Basis of WDM, technologies...

引用

2nd International Conference on Systems, ICONS 2007

作者： Wang, Y. Kusserrow, T. Irmer, S. Hasse, A. Bartels, M. Dharmarasu, N. Hillmer, H. Börcsök, J. Mikami, O. University of Kassel Kassel Germany Department of Computer Architecture and System Programming University of Kassel Germany Department of Information Telecommunication and Electronics School of Information Science and Technology Tokai University Hiratsuka-shi Japan

ISBN: (纸本)0769528074

We present novel concepts, technologies and potentials of optical data communication, especially for future computer architectures. The WDM (wavelength division multiplexing) and the optical wiring technologies are explained in detail. Experimental results of tunable optical filters, which play a major role in WDM systems, are reported. New concepts for novel optical interconnectors and novel miniaturized lasers for direct generation of green light are proposed as examples for possible next generation components to improve the performance of optical communication based computer architecture. © 2007 IEEE.

关键词： computer architecture

来源：评论

学校读者我要写书评

暂无评论

Computational models of narrative: Review of the workshop

引用

AI Magazine 2010年第2期31卷 97-100页

作者： Finlayson, Mark A. Richards, Whitman Winston, Patrick H. Electrical Engineering and Computer Science Massachusetts Institute of Technology United States Department of Brain and Cognitive Sciences Massachusetts Institute of Technology United States Department of Cognitive Science Media Arts and Sciences MIT Media Lab United States Department of Artificial Intelligence and Computer Science MIT United States MIT Artificial Intelligence Laboratory United States

On October 8-10,2009, an interdisciplinary group met in Beverley, Massachusetts, to evaluate the state of the art in the computational modeling of narrative. Three important findings emerged: (1) current work in computational modeling is described by three different levels of representation;(2) there is a paucity of studies at the highest, most abstract level aimed at inferring the meaning or message of the narrative;and (3) there is a need to establish a standard data bank of annotated narratives, analogous to the Penn Treebank. Copyright © 2010, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：