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

Cryptographers' Track at the RSA Conference 2013, CT-RSA 2013

作者： Liu, Shengli Weng, Jian Zhao, Yunlei Dept. of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China Department of Computer Science Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security Jinan University China Software School Fudan University Shanghai 201203 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai China

ISBN: (纸本)9783642360947

Leakage-resilient public key encryption (PKE) schemes are designed to resist "memory attacks", i.e., the adversary recovers the cryptographic key in the memory adaptively, but subject to constraint that the total amount of leaked information about the key is bounded by some parameter λ. Among all the IND-CCA2 leakage-resilient PKE proposals, the leakage-resilient version of the Cramer-Shoup cryptosystem (CS-PKE), referred to as the KL-CS-PKE scheme proposed by Naor and Segev in Crypto09, is the most practical one. But, the key leakage parameter λ and plaintext length m of KL-CS-PKE are subject to λ + m ≤ log q - ω(log κ), where κ is security parameter and q is the prime order of the group on which the scheme is based. Such a dependence between λ and m is undesirable. For example, when λ (resp., m) approaches to log q, m (resp., λ) approaches to 0. In this paper, we designed a new variant of CS-PKE that is resilient to key leakage chosen ciphertext attacks. Our proposal is λ ≤ log q - ω(log κ) leakage-resilient, and the leakage parameter λ is independent of the plaintext space that has the constant size q (exactly the same as that in CS-PKE). The performance of our proposal is almost as efficient as the original CS-PKE. As far as we know, this is the first leakage-resilient CS-type cryptosystem whose plaintext length is independent of the key leakage parameter, and is also the most efficient IND-CCA2 PKE scheme resilient to up to log q - ω(log κ) leakage. © 2013 Springer-Verlag.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

FrameAxis: Characterizing microframe bias and intensity with word embedding

arXiv

引用

arXiv 2020年

作者： Kwak, Haewoon An, Jisun Jing, Elise Ahn, Yong-Yeol School of Computing and Information Systems Singapore Management University Singapore Center for Complex Networks and Systems Research Luddy School of Informatics Computing and Engineering Indiana University BloomingtonIN United States Indiana University Network Science Institute Indiana University BloomingtonIN United States Connection Science Massachusetts Institute of Technology CambridgeMA United States

Framing is a process of emphasizing a certain aspect of an issue over the others, nudging readers or listeners towards different positions on the issue even without making a biased argument. Here, we propose FrameAxis, a method for characterizing documents by identifying the most relevant semantic axes ("microframes") that are overrepresented in the text using word embedding. Our unsupervised approach can be readily applied to large datasets because it does not require manual annotations. It can also provide nuanced insights by considering a rich set of semantic axes. FrameAxis is designed to quantitatively tease out two important dimensions of how microframes are used in the text. Microframe bias captures how biased the text is on a certain microframe, and microframe intensity shows how actively a certain microframe is used. Together, they offer a detailed characterization of the text. We demonstrate that microframes with the highest bias and intensity well align with sentiment, topic, and partisan spectrum by applying FrameAxis to multiple datasets from restaurant reviews to political news. The existing domain knowledge can be incorporated into FrameAxis by using custom microframes and by using FrameAxis as an iterative exploratory analysis instrument. Additionally, we propose methods for explaining the results of FrameAxis at the level of individual words and documents. Our method may accelerate scalable and sophisticated computational analyses of framing across disciplines. Copyright © 2020, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2011年 6872 LNCS卷 V-VI页

作者： Chang, Maiga Chen, Ming-Puu Hwang, Wu-Yuin Mueller, Wolfgang Athabasca University School of Computing and Information Systems Edmonton AB Canada National Taiwan Normal University Graduate Institute of Information and Computer Education Taipei Taiwan National Central University Graduate Institute of Network Learning Technology Jhongli City Taiwan University of Education Weingarten Germany

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Consensus on QoS in Web Services Discovery

Fuzzy Consensus on QoS in Web Services Discovery

引用

International Conference on Advanced information networking and Applications (AINA)

作者： Wei-Li Lin Chi-Chun Lo Kuo-Ming Chao M. Younas Institute of Information Management National Chiao Tung University Hsinchu Taiwan DSM Research Group Department of Computer and Network Systems Coventry University Coventry UK Department of Computing Oxford Brookes University Oxford UK

Ensuring consensus on QoS attributes is imperative for the discovery of Web services. Inconsistent views of service providers and consumers on QoS attributes could be problematic, even though they have consensus on characteristics. For instance, they may have distinct views of the QoS attribute of service reliability, wherein a consumer considers that a service is reliable if its success rate is 99.9% or 100%, while providers may consider its service as reliable if its success rate is higher than 90% Different expectations in service discovery could hinder prevailing of the Web services. This paper proposes a QoS consensus moderation approach (QCMA) in order to perform QoS consensus and to alleviate the differences on QoS requirements in the Web services discovery. The proposed approach is implemented and evaluated through an example of hotel booking Web service

关键词： Web services Quality of service Computer networks Ontologies Intelligent networks Chaos information management information systems information security Cost function

来源：评论

学校读者我要写书评

暂无评论

A newborn screening system based on Service-Oriented Architecture embedded Support Vector Machine

A newborn screening system based on Service-Oriented Archite...

引用

4th IEEE International Symposium on Service-Oriented System Engineering, SOSE 2008

作者： Hsieh, Sung-Huai Hsieh, Sheau-Ling Chien, Yin-Hsiu Wang, Zhenyu Weng, Yung-Ching Lai, Feipei Information Systems Office National Taiwan University Hospital Taipei Taiwan Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan Department of Electrical Engineering National Taiwan University Taipei Taiwan Network and Computer Centre National Chiao Tung University Hsin Chu Taiwan Graduate Institute of Biomedical Electronics and Bioinformatics National Taiwan University Taiwan Department of Medical Genetics National Taiwan University Hospital Taiwan Computing Laboratory Oxford University Oxford United Kingdom

ISBN: (纸本)9780769534992

The clinical symptoms of metabolic disorders are rarely apparent during the neonatal period, and if they are not treated early, irreversible damage, such as mental retardation, or even death, may occur. Therefore, the practice of newborn screening is important to the prevention of permanent disabilities in newborns. In this paper, we propose a newborn screening system that uses Support Vector Machine (SVM) classification techniques to evaluate raw data on the concentrations of metabolic substances obtained from tandem mass spectrometry (MS/MS) to determine if a newborn has a metabolic disorder. As per the concept of Service-Oriented Architecture (SOA), we designed the system using web services techniques, which are suitable for integrating heterogeneous platforms, protocols, and applications. It can be integrated seamlessly into National Taiwan University Hospital information systems (HIS) or other related HIS. © 2008 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Web Services based newborn screening system with Support Vector Machines

Web Services based newborn screening system with Support Vec...

引用

5th International Conference on information Technology and Applications, ICITA 2008

作者： Hsieh, Sung-Huai Hsieh, Sheau-Ling Weng, Yung-Ching Chien, Yin-Hsiu Wang, Zhenyu Chen, Po-Hao Chang, Hsing-Yu Lai, Feipei Hwu, Wu-Liang Information Systems Office National Taiwan University Hospital Taipei Taiwan Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan Department of Electrical Engineering National Taiwan University Taipei Taiwan Network and Computer Centre National Chiao Tung University Hsin Chu Taiwan Graduate Institute of Biomedical Electronics and Bioinformatics National Taiwan University Taiwan Department of Information Management National Taiwan University Taipei Taiwan Department of Medical Genetics National Taiwan University Hospital Taiwan Computing Laboratory Oxford University Oxford United Kingdom

ISBN: (纸本)9780980326727

The clinical symptoms of metabolic disorders during neonatal periods are often not apparent. If not treated earlier, irreversible damages such as mental retardation or even death may occur. Therefore, practicing the newborn screening is essential to prevent newborns from these damages. In the paper, we propose a newborn screening system using Support Vector Machines (SVM) classification techniques to evaluate, interpret, and determine whether a newborn has metabolic disorder diseases. The raw data, i.e., substances concentrations, were collected from the Tandem Mass Spectrometry (MS/MS). In addition, based on the concept of Service-Oriented Architecture (SOA), we design the system under Web Services .NET environment. The system provides features including heterogeneous platforms, protocols, as well as applications. It can be integrated seamlessly into National Taiwan University Hospital information systems later.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Performance Optimization for Vehicular Cooperative Sensing: A Graph Attention Based Reinforcement Learning Approach

Performance Optimization for Vehicular Cooperative Sensing: ...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Xuefei Li Mingzhe Chen Danpu Liu Zhilong Zhang Tony Q. S. Quek Beijing Laboratory of Advanced Information Network Beijing University of Posts and Telecommunications Beijing China Department of Electrical and Computer Engineering and Institute for Data Science and Computing University of Miami Coral Gables FL USA Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

In this paper, the problem of collaborative vehicle sensing is investigated. In the considered model, a set of cooperative vehicles provide sensing information to sensing request vehicles with limited sensing and communication resources. A base station (BS) determines the subset of sensing request vehicles that each cooperative vehicle will serve and the sub-regions that each cooperative vehicle will detect. We formulate an optimization problem aiming to maximize the number of successfully detected sub-regions of sensing request vehicles while satisfying the cooperative sensing energy requirement by jointly determining the cooperative vehicle association and the sensing sub-region selection. To solve this problem, we propose a graph attention based reinforcement learning (RL) algorithm that can generate the graph information vectors based on the correlation between each cooperative vehicle and each sensing request vehicle. Using the learned graph information, the joint cooperative vehicle association and sensing sub-region selection strategy will be determined. Simulation results show that the proposed scheme can improve the number of successfully detected sub-regions of sensing request vehicles by up to 12.5% compared to the conventional RL algorithm without using graph attention networks (GANs).

关键词： Base stations Correlation network topology Simulation Collaboration Reinforcement learning Vectors Sensors Global communication Optimization

来源：评论

学校读者我要写书评

暂无评论

Security Enhancing for IRS-Aided NOMA networks via Constructive Interference Precoding 10

Security Enhancing for IRS-Aided NOMA Networks via Construct...

引用

10th IEEE International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications, MAPE 2024

作者： Bao, Jingying Cao, Yang Qin, Xiaoqi Xu, Lexi Zhao, Nan Niyato, Dusit School of Information and Communication Engineering Dalian University of Technology Dalian116024 China Singapore University of Technology and Design Engineering Systems and Design Pillar Singapore487372 Singapore Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing100876 China Research Institute China United Network Communications Corporation Beijing100048 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore

ISBN: (纸本)9798331533922

In this paper, we propose a constructive interference precoding (CIP) enabled secure intelligent reflecting surface (IRS)-non-orthogonal multiple access (NOMA) scheme, lever-aging both the inter-user interference and artificial noise to boost the legitimate transmission of far user, while inducing the eavesdropper to decode the deceptive information. Based on this CIP-NOMA scheme, we minimize the transmit power under the perfect channel state information (CSI), subject to the CIP constraint for the far user and eavesdropper, while guaranteeing the quality of service and successive interference cancellation for the near user and the IRS unit modulus constraint. To handle this non-convex problem, an alternating optimization algorithm is proposed. Specifically, by alternately optimizing the precoding vectors at the base station and the IRS reflecting matrix via the successive convex approximation and the penalty-based algorithm, respectively, a reliable solution can be obtained. Simulation results demonstrate that the proposed scheme can achieve better security performance with less energy consumption compared to the conventional NOMA. © 2024 IEEE.

关键词： Multiple access interference

来源：评论

学校读者我要写书评

暂无评论

Conversation-linked navigation system - Provides conversation-related information during a telephone conversation

引用

NTT Technical Review 2006年第5期4卷 45-49页

作者： Mukaigaito, Takeya Takada, Shinya Yokozeki, Daigoro Sakai, Rie Sakai, Miki Murayama, Takahiko Arai, Katsuya NTT Information Sharing Platform Laboratories Musashino-shi 180-8585 Japan Network Application Platform Project NTT Information Sharing Platform Laboratories Software Architecture Project NTT Information Sharing Platform Laboratories NTT Information Sharing Platform Laboratories Graduate School of Information Systems University of Electro-Communications Japan Institute of Electronics Information and Communication Engineers of Japan Japan Society of Artificial Intelligence IEEE Computer Society Association for Computing Machinery IPSJ

This article introduces a conversation-linked navigation system that uses keywords occurring during a telephone conversation to guide users to relevant content on the Internet in a seamless manner in real time.

关键词： Navigation systems

来源：评论

学校读者我要写书评

暂无评论

An Auto-Parallel Method for Deep Learning Models Based on Genetic Algorithm 29

An Auto-Parallel Method for Deep Learning Models Based on Ge...

引用

29th IEEE International Conference on Parallel and Distributed systems, ICPADS 2023

作者： Zeng, Yan Huang, Chengchuang Ni, Yijie Zhou, Chunbao Zhang, Jilin Wang, Jue Zhou, Mingyao Xue, Meiting Zhang, Yunquan Hangzhou Dianzi University School of Computer Science and Technology Hangzhou310018 China Ministry of Education Key Laboratory for Modeling and Simulation of Complex Systems Hangzhou310018 China Data Security Governance Zhejiang Engineering Research Center Hangzhou310018 China Hangzhou Dianzi University School of ITMO Joint Institute Hangzhou310018 China Institute of Computer Network Information Center of the Chinese Academy of Sciences Beijing100086 China HuaWei China Institute of Computing Technology of the Chinese Academy of Sciences State Key Laboratory of Computer Architecture Beijing100086 China

ISBN: (纸本)9798350330717

As the size of datasets and neural network models increases, automatic parallelization methods for models have become a research hotspot in recent years. The existing auto-parallel methods based on machine learning or graph algorithms still have issues with search efficiency and applicability. This paper proposes an automatic parallel method based on a dual-population genetic algorithm, TGA, which transforms model partitioning and placement into an integer linear programming problem and constructs a cost model to evaluate the solution. The solution space is built using the neural network's dataflow graph and device cluster's topology, and the dual-population genetic algorithm is used to search for the optimal model parallel strategy. Experiments with various models show that the proposed method can improve single-step execution time by up to 42% compared to the Baechi method and up to 37.7% compared to the Hierarchical method. © 2023 IEEE.

关键词： Auto-Parallel Distributed machine learning Genetic algorithm Integer linear programming Model parallelism

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：