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

On Strong Secrecy for Multiple Access Channels With States and Causal CSI

IEEE Transactions on Information Theory 2025年第4期71卷 3070-3099页

作者： Chen, Yiqi Oechtering, Tobias J. Skoglund, Mikael Luo, Yuan Technical University of Munich Chair of Theoretical Information Technology Munich80333 Germany Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai200240 China KTH Royal Institute of Technology Division of Information Science and Engineering School of Electrical Engineering and Computer Science Stockholm100 44 Sweden Shanghai Key Laboratory of Trusted Data Circulation and Governance and Web3 Shanghai200240 China

Strong secrecy communication over a discrete memoryless state-dependent multiple access channel (SD-MAC) with an external eavesdropper is investigated. The channel is governed by discrete memoryless and i.i.d. channel states, and the channel state information (CSI) is revealed to the encoders in a causal manner. The main results of this paper are inner and outer bounds of the capacity region, for which we investigate coding schemes incorporating wiretap coding and secret key agreements between the sender and the legitimate receiver. Two kinds of block Markov coding schemes are proposed. The first is a new coding scheme that uses backward decoding and the Wyner-Ziv coding, and the secret key is constructed from a lossy description of the CSI. The other is an extended version of an existing coding scheme for point-to-point wiretap channels with causal CSI. A numerical example shows that the achievable region given by the first coding scheme can be strictly larger than the second one. However, these two schemes do not outperform each other in general, and there exist some numerical examples in which each coding scheme achieves some rate pairs that cannot be achieved by another scheme. Our established inner bound reduces to some best-known results in the literature as special cases. We further investigate some capacity-achieving cases for state-dependent multiple access wiretap channels (SD-MAWCs) with degraded message sets. It turns out that the two coding schemes are both optimal in these cases. © 1963-2012 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

On the intersection of human-centered computing and web science

引用

Journal of Computing science and Engineering 2013年第4期7卷 211-219页

作者： Jaimes, Alejandro Division of Web Science and Technology Korea Advanced Institute of Science and Technology Daejeon Korea Republic of

Human-centered computing (HCC) as a field was defined several years ago. Since then, the web has grown significantly, and so has its impact in society at every level, creating the grounds for a new web science. In this paper, we examine the definitions of HCC and web science, and discuss how they might be related. On the one hand, HCC can be viewed as a set of methodologies, and on the other hand, web science can be viewed as a platform or repository, from which behavioral data can be drawn. We examine the relationship between the two, and summarize three different research approaches that in many ways show this intersection. © 2013. The Korean Institute of Information Scientists and Engineers.

关键词： Human computer interaction

来源：评论

学校读者我要写书评

暂无评论

Deep web and mapreduce

引用

Journal of Computing science and Engineering 2013年第3期7卷 147-158页

作者： Tao, Yufei Division of Web Science and Technology Korea Advanced Institute of Science and Technology Daejeon Korea Republic of

This invited paper introduces results on web science and technology obtained during work with the Korea Advanced Institute of science and technology. In the first part, we discuss algorithms for exploring the deep web, which refers to the collection of web pages that cannot be reached by conventional web crawlers. In the second part, we discuss sorting algorithms on the MapReduce system, which has become a dominant paradigm for massive parallel computing. © 2013 The Korean Institute of Information Scientists and Engineers.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

A service-oriented architecture for computational creativity

引用

Journal of Computing science and Engineering 2013年第3期7卷 159-167页

作者： Veale, Tony Web Science and Technology Division Korean Advanced Institute of Science and Technology Daejeon Korea Republic of

Creativity is a long cherished and widely studied aspect of human behavior that allows us to re-invent the familiar, and to imagine the new. Computational creativity (CC) is a newly burgeoning area of creativity research that brings together academics and practitioners from diverse disciplines, genres and modalities, to explore the potential of computers to be autonomously creative, or to collaborate as co-creators with people. We describe here an architecture for creative web services that will act as a force magnifier for CC, both for academic research, and for the effective deployment of real CC applications in industry. For researchers, this service-oriented architecture supports the pooling of technologies in a robust interoperable framework, in which CC models are conceived, developed and migrated from lab settings to an industrial strength platform. Industry developers, for their part, will be able to exploit novel results of CC research in a robust, low-risk form, without having to re-implement algorithms from a quickly moving field. We illustrate the architecture with the first of a growing set of creative web services that provide robust figurative language processing on demand. © 2013 The Korean Institute of Information Scientists and Engineers.

关键词： web services

来源：评论

学校读者我要写书评

暂无评论

Detecting and generating ironic comparisons: An application of creative information retrieval

Detecting and generating ironic comparisons: An application ...

引用

2012 AAAI Fall Symposium

作者： Veale, Tony Web Science and Technology Division KAIST Daejeon Korea Republic of

ISBN: (纸本)9781577355915

Ironic utterances promise an expected meaning that never arrives, and deliver instead a meaning that exposes the failure of our expectations. Though they can appear contextually inappropriate, ironic statements succeed when they subvert their context of use, so it is the context rather than the utterance that is shown to be incongruous. Every ironic statement thus poses two related questions: the first, "what is unexpected about my meaning?" helps us answer the second, "what is unexpected about my context of use?". Like metaphor, irony is not overtly marked, and relies instead on a listener's understanding of stereotypical norms to unpack its true meaning. In this paper we consider how irony relies upon and subverts our stereotypical knowledge of a domain, and show how this knowledge can be exploited to both recognize and generate ironic similes for a topic. Copyright © 2012, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Technical presentations

来源：评论

学校读者我要写书评

暂无评论

A context-sensitive, multi-faceted model of lexico-conceptual affect

A context-sensitive, multi-faceted model of lexico-conceptua...

引用

50th Annual Meeting of the Association for Computational Linguistics, ACL 2012

作者： Veale, Tony Web Science and Technology Division KAIST Daejeon Korea Republic of

ISBN: (纸本)9781937284251

Since we can 'spin' words and concepts to suit our affective needs, context is a major determinant of the perceived affect of a word or concept. We view this re-profiling as a selective emphasis or de-emphasis of the qualities that underpin our shared stereotype of a concept or a word meaning, and construct our model of the affective lexicon accordingly. We show how a large body of affective stereotypes can be acquired from the web, and also show how these are used to create and interpret affective metaphors. © 2012 Association for Computational Linguistics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automatic organization of human task goals for web-scale problem solving knowledge 13

Automatic organization of human task goals for web-scale pro...

引用

7th International Conference on Knowledge Capture: "Knowledge Capture in the Age of Massive web Data", K-CAP 2013

作者： Ryu, Jihee Ihm, Hwon Myaeng, Sung-Hyon Division of Web Science and Technology KAIST Daejeon Korea Republic of

ISBN: (纸本)9781450321020

Problem solving knowledge is omnipresent and scattered on the web. While extracting and gathering such knowledge has been a focus of attention, it is equally important to devise a way to organize such knowledge for both human and machine consumption with respect to task goals. As a way to provide an extensive knowledge structure for human task goals, with which human problem solving knowledge extracted from web resources can be organized, we devised a method for automatically grouping and organizing the goal statements in a web 2.0 site that contains over two millions how-to instruction articles covering almost all task domains. In the proposed method, task goals having semantically and task-categorically similar action types and object types are grouped together by analyzing predicate-argument association patterns across all the goal statements through bipartite EM-like modeling. The result obtained with the unsupervised machine learning algorithm was evaluated by means of a human-annotated data set in a sample domain. Copyright © 2013 ACM.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Creativity as a web service: A vision of human and computer creativity in the web era

Creativity as a web service: A vision of human and computer ...

引用

2013 AAAI Spring Symposium

作者： Veale, Tony Web Science and Technology Division KAIST Daejeon Korea Republic of

ISBN: (纸本)9781577355991

The marketplace for definitions and theories of creativity is crowded indeed. No hard consensus exists on the elements of an all-embracing theory, or on what specific sub-processes and representations are required to support creativity, either in humans or in machines. Yet commonalities do exist across theories: a search for novelty and utility is implied by most theories, as is the notion that an innovation can be considered creative only if it is not too novel, and can be adequately grounded in the familiar and the understandable. Computational creativity (CC) is the pursuit of creative behavior in machines, and seeks inspiration from both AI and from human psychology. As a practical engineering endeavor, CC can afford to adopt a cafeteria approach to theories of creativity, taking what it needs from different theories and frameworks. In this paper we present a vision for CC research in the age of the web, in which CC is provided on tap, via a suite of web services, to any third-party application that needs it. We argue that this notion of Creativity as a Service - which is already a popular business model for human organizations - will allow CC researchers and developers to build ad-hoc mash-ups of whatever processes and representations are most suited to a given application. By offering CC as a centralized service, we can collect statistics on the most useful mash-ups, and therein obtain a new empirical basis for theorizing about creativity in humans and in machines. Copyright © 2013, AAAI Press.

关键词： web services

来源：评论

学校读者我要写书评

暂无评论

Seeing the best and worst of everything on the web with a two-level, feature-rich affect lexicon

Seeing the best and worst of everything on the Web with a tw...

引用

21st Annual Conference on World Wide web, WWW'12

作者： Veale, Tony Web Science and Technology Division KAIST Daejeon Korea Republic of

ISBN: (纸本)9781450312301

Affect lexica are useful for sentiment analysis because they map words (or senses) onto sentiment ratings. However, few lexica explain their ratings, or provide sufficient feature richness to allow a selective "spin" to be placed on a word in context. Since an affect lexicon aims to capture the affect of a word or sense in its most stereotypical usage, it should be grounded in explicit stereotype representations of each word's most salient properties and behaviors. We show here how to acquire a large stereotype lexicon from web content, and further show how to determine sentiment ratings for each entry in the lexicon, both at the level of properties and behaviors and at the level of stereotypes. Finally, we show how the properties of a stereotype can be segregated on demand, to place a positive or negative spin on a word in context. Copyright is held by the author/owner(s).

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

DART: An efficient method for direction-aware bichromatic reverse k nearest neighbor queries

DART: An efficient method for direction-aware bichromatic re...

引用

13th International Symposium on Spatial and Temporal Databases, SSTD 2013

作者： Lee, Kyoung-Won Choi, Dong-Wan Chung, Chin-Wan Division of Web Science Technology Korea Advanced Institute of Science and Technology Korea Republic of Department of Computer Science Korea Advanced Institute of Science and Technology Korea Republic of

ISBN: (纸本)9783642402340

This paper presents a novel type of queries in spatial databases, called the direction-aware bichromatic reverse k nearest neighbor (DBRkNN) queries,which extend the bichromatic reverse nearest neighbor *** two disjoint sets, P and S, of spatial objects, and a query object q in S, the DBRkNN query returns a subset P′ of P such that k nearest neighbors of each object in P′ include q and each object in P′ has a direction toward q within a pre-defined *** formally define the DBRkNN query, and then propose an efficient algorithm, called DART, for processing the DBRkNN query. Our method utilizes a grid-based index to cluster the spatial objects, and the B+-tree to index the direction *** adopt a filter-refinement framework that is widely used in many algorithms for reverse nearest neighbor queries. In the filtering step,DART eliminates all the objects that are away from the query object more than the pre-defined distance, or have an invalid direction angle. In the refinement step, remaining objects are verified whether the query object is actually one of the k nearest neighbors of them. From extensive experiments, we show that DART outperforms an R-tree-based naive algorithm in both indexing time and query processing time. © 2013 Springer-Verlag.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：