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

8th ACM SIGCHI Symposium on Engineering Interactive Computing Systems (EICS)

作者： Bouzit, Sara Calvary, Gaelle Chene, Denis Vanderdonckt, Jean Orange Labs 28 Chemin Vieux Chene F-38240 Meylan France Univ Grenoble Alpes LIG DNRS F-38000 Grenoble France Catholic Univ Louvain Louvain Sch Management Louvain Interact Lab B-1348 Louvain La Neuve Belgium

ISBN: (纸本)9781450343220

This paper presents a design space for exploring design options of adaptive graphical menus based on Bertin's eight visual variables: position, size, shape, value, color, orientation, texture, and motion. In order to transfoun a traditional (static) menu into an adaptive one, at least one visual variable should be exploited to convey which menu items have been promoted or demoted depending on five characteristics: select, associative, quantitative, order, and length. The paper reviews selected adaptive menu interaction techniques belonging to each of these variables, classifies them according to the variables and characteristics and suggests not yet explored adaptive menu designs. It then defines four stability properties depending on which variables remain constant after adaptivity. A supporting software for prototyping the rendering of graphical adaptive menus is then introduced.

关键词： Adaptation adaptive menu coding scheme prediction window stability property visual variable

来源：评论

学校读者我要写书评

暂无评论

On a capacity achieving scheme for the colored Gaussian channel with feedback

On a capacity achieving scheme for the colored Gaussian chan...

引用

IEEE International Symposium on Information Theory

作者： Shahar-Doron, A Feder, M Tel Aviv Univ Dept Elect Engn Syst IL-69978 Tel Aviv Israel

ISBN: (纸本)0780382803

A coding scheme with feedback for the colored Gaussian noise channel, extending the earlier schemes of Schalkijk and Butman is discussed. By showing a relation between the scheme parameters and the capacity formula we show that this scheme can achieve the channel capacity in its optimal configuration. Using suboptimal configurations, a series of lower bounds for the feedback channel capacity can be constructed.

关键词： Gaussian noise feedback Gaussian channels channel capacity channel coding colored Gaussian noise channel capacity feedback channel coding scheme channel configuration

来源：评论

学校读者我要写书评

暂无评论

Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate

Codes for Computationally Simple Channels: Explicit Construc...

引用

IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS)

作者： Guruswami, Venkatesan Smith, Adam Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA Penn State Univ Comp Sci & Engn Dept University Pk PA 16802 USA

ISBN: (纸本)9780769542447

In this paper, we consider coding schemes for computationally bounded channels, which can introduce an arbitrary set of errors as long as (a) the fraction of errors is bounded with high probability by a parameter p and (b) the process which adds the errors can be described by a sufficiently "simple" circuit. Codes for such channel models are attractive since, like codes for standard adversarial errors, they can handle channels whose true behavior is unknown or varying over time. For three classes of channels, we provide explicit, efficiently encodable/decodable codes of optimal rate where only inefficiently decodable codes were previously known. In each case, we provide one encoder/decoder that works for every channel in the class. Unique decoding for additive errors: We give the first construction of a poly-time encodable/decodable code for additive (a.k.a. oblivious) channels that achieve the Shannon capacity 1 - H(p). List-decoding for online log-space channels: We give an efficient code with optimal rate (arbitrarily close to 1 H( p)) that recovers a short list containing the correct message with high probability for channels which read and modify the transmitted codeword as a stream, using at most O(log N) bits of workspace on transmissions of N bits. List-decoding for poly-time channels: For any constant c we give a similar list-decoding result for channels describable by circuits of size at most N-c, assuming the existence of pseudorandom generators.

关键词： Shannon capacity adversarial errors channel coding coding scheme coding theory communication complexity computationally bounded channel computationally bounded channels decoding error correction codes explicit constructions information theory list decoding message passing online logspace channel polytime encodable code pseudorandom generator pseudorandomness unique decoding

来源：评论

学校读者我要写书评

暂无评论

Fundamental Limits of Caching: Symmetry Structure and Coded Placement schemes

Fundamental Limits of Caching: Symmetry Structure and Coded ...

引用

作者： Zhang, Kai Texas A&M University

学位级别：Ph.D., Doctor of Philosophy

Caching is a technique to reduce the communication load in peak hours by prefetching contents during off-peak hours. In 2014, Maddah-Ali and Niesen introduced a framework for coded caching, and showed that significant improvement can be obtained compared to uncoded caching. Considerable efforts have been devoted to identify the precise information theoretic fundamental limit of such systems, however the difficulty of this task has also become clear. One of the reasons for this difficulty is that the original coded caching setting allows multiple demand types during delivery, which in fact introduces tension in the coding strategy to accommodate all of them. We seek to develop a better understanding of the fundamental limit of coded caching. In order to characterize the fundamental limit of the tradeoff between the amount of cache memory and the delivery transmission rate of multiuser caching systems, various coding schemes have been proposed in the literature. These schemes can largely be categorized into two classes, namely uncoded prefetching schemes and coded prefetching schemes. While uncoded prefetching schemes in general over order-wise optimal performance, coded prefetching schemes often have better performance at the low cache memory regime. At first sight it seems impossible to connect these two different types of coding schemes, yet finding a unified coding scheme that achieves the optimal memory-rate tradeoff is an important and interesting problem. We take the first step on this direction and provide a connection between the uncoded prefetching scheme proposed by Maddah Ali and Niesen (and its improved version by Yu et al.) and the coded prefetching scheme proposed by Tian and Chen. The intermediate operating points of this general scheme can in fact provide new memory-rate tradeoff points previously not known to be achievable in the literature. This new general coding scheme is then presented and analyzed rigorously, which yields a new inner bound to th

关键词： Caching network Linear Programming Symmetry structure coding scheme Fundamental limit Uncoded prefetching

来源：评论

学校读者我要写书评

暂无评论

Socially shared regulation in the workplace and the manifestation of the subphases

Socially shared regulation in the workplace and the manifest...

引用

作者： F. V. Roorda University of Twente

学位级别：硕士

The performance of teams, the cornerstones of an organisation, can be enhanced by socially shared regulation. However, the definition of socially shared regulation and underlying subphases are broad and differ between studies. Also, most studies have been performed within a school context which differs from the workplace, mainly in that it is often less structured.. Thus the results from studies that took place within a school context may not apply in the workplace. The aim of this study is to clarify and sharpen the definition of socially shared regulation and underlying subphases within a workplace setting. Data was collected of three multidisciplinary and self-managing IT teams that work with an agile method. The results show that the teams spend most of their time planning and the least evaluating. Which can imply that teams within these settings can be helped with tools, that reduce time spend on planning and prompts for more evaluation regulation. It also shows that some subphases are context and objective dependent. With the results new definitions of the main phases of socially shared regulation have been developed. During the coding process a new coding scheme has been established that can be used in further research of socially shared regulation in the workplace. In addition scientific and practical implications and suggestions for further research are discussed.

关键词： Socially shared regulation multi-disciplinary and self-managing teams workplace coding scheme

来源：评论

学校读者我要写书评

暂无评论

Dec :: Tech Reports :: Src-RR-124

引用

2016年

[Auto Generated] 1 Introduction 1 2 The reversible transformation 2 3 Why the transformed string compresses well 5 4 An ef cient implementation 8 4.1 Compression :: :::: :::: ::::: :::: ::::: :::: 8 4.2 Decompression: :::: :::: ::::: :::: ::::: :::: 12 5 Algorithm variants 13 6 Performance of implementation 15 7 Conclusions 16 The most widely used data compression algorithms are based on the sequential data compressors of Lempel and Ziv [1, 2]. Statistical modelling techniques may produce superi

关键词： algorithm block size calgary compression character characters coding scheme compression compression algorithm data compression input original string reports reversible transformation rotations src-rr-124 step string suffix suffix starting suffix tree suffixes suffixes starting

来源：评论

学校读者我要写书评

暂无评论

Utilizing dependence among variables in evolutionary algorithms for mixed-integer programming: A case study on multi-objective constrained portfolio optimization

引用

SWARM AND EVOLUTIONARY COMPUTATION 2021年 66卷 100928-100928页

作者： Chen, Yi Zhou, Aimin Das, Swagatam East China Normal Univ Shanghai Key Lab Multidimens Informat Proc 3663 North Zhongshan Rd Shanghai 200062 Peoples R China East China Normal Univ Dept Comp Sci & Technol 3663 North Zhongshan Rd Shanghai 200062 Peoples R China Indian Stat Inst Elect & Commun Sci Unit 203 BT Rd Kolkata 700108 India

Mixed-Integer Non-Linear Programming (MINLP) is not rare in real-world applications such as portfolio invest-ment. It has brought great challenges to optimization methods due to the complicated search space that has both continuous and discrete variables. This paper considers the multi-objective constrained portfolio optimization problems that can be formulated as MINLP problems. Since each continuous variable is dependent to a discrete variable, we propose a Compressed coding scheme (CCS), which encodes the dependent variables into a contin-uous one. In this manner, we can reuse some existing search operators and the dependence among variables will be utilized while the algorithm is optimizing the compressed variables. CCS actually bridges the gap between the portfolio optimization problems and the existing optimizers, such as Multi-Objective Evolutionary Algorithms (MOEAs). The new approach is applied to two benchmark suites, involving the number of assets from 31 to 2235. The experimental results indicate that CCS is not only efficient but also robust for dealing with the multi-objective constrained portfolio optimization problems.

关键词： Evolutionary computations Mixed-integer programming coding scheme Multi-objective constrained portfolio optimization

来源：评论

学校读者我要写书评

暂无评论

The QFT Control Design Via Genetic Algorithms and Application

引用

IFAC Proceedings Volumes 1999年第2期32卷 7220-7225页

作者： Jun Gu Jiong Shen Laijiu Chen Department of Power Engineering Southeast University Nanjing 210096 P.R. China

Quantitative Feedback Theory (QFT) is an Engineering method to devote to the practical design of feedback systems. Whether or not the design is successful mainly depends on experiences of the designer. It is a main drawback that limits the further acceptance of QFT in industry. For the implementation of auto-design in QFT controller this paper proposes genetic algorithms to search parameters of QFT controller. The simulation for superheated steam temperature control system using this method is studied. The result shows the proposed method is valid.

关键词： Genetic algorithms coding scheme Temperature control

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Sparse coding of Objects in Deep Convolutional Neural Networks

引用

FRONTIERS IN COMPUTATIONAL NEUROSCIENCE 2020年 14卷 578158页

作者： Liu, Xingyu Zhen, Zonglei Liu, Jia Beijing Normal Univ Fac Psychol Beijing Key Lab Appl Expt Psychol Beijing Peoples R China Tsinghua Univ Dept Psychol Beijing Peoples R China Tsinghua Univ Tsinghua Lab Brain & Intelligence Beijing Peoples R China

Recently, deep convolutional neural networks (DCNNs) have attained human-level performances on challenging object recognition tasks owing to their complex internal representation. However, it remains unclear how objects are represented in DCNNs with an overwhelming number of features and non-linear operations. In parallel, the same question has been extensively studied in primates' brain, and three types of coding schemes have been found: one object is coded by the entire neuronal population (distributed coding), or by one single neuron (local coding), or by a subset of neuronal population (sparse coding). Here we asked whether DCNNs adopted any of these coding schemes to represent objects. Specifically, we used the population sparseness index, which is widely-used in neurophysiological studies on primates' brain, to characterize the degree of sparseness at each layer in representative DCNNs pretrained for object categorization. We found that the sparse coding scheme was adopted at all layers of the DCNNs, and the degree of sparseness increased along the hierarchy. That is, the coding scheme shifted from distributed-like coding at lower layers to local-like coding at higher layers. Further, the degree of sparseness was positively correlated with DCNNs' performance in object categorization, suggesting that the coding scheme was related to behavioral performance. Finally, with the lesion approach, we demonstrated that both external learning experiences and built-in gating operations were necessary to construct such a hierarchical coding scheme. In sum, our study provides direct evidence that DCNNs adopted a hierarchically-evolved sparse coding scheme as the biological brain does, suggesting the possibility of an implementation-independent principle underling object recognition.

关键词： deep convolutional neural network sparse coding coding scheme object recognition object representation hierarchy

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient communications over multiple access relay channels

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2017年第18期30卷 e3368.1-e3368.1页

作者： Taghavi, Ehsan Moeen Hodtani, Ghosheh Abed Ferdowsi Univ Mashhad Dept Elect Engn Mashhad Iran

Recently, due to the importance of green communications and power-limited systems, energy efficiency in vehicular technologies has become a hot research topic. In this paper, we analyze energy-efficient coding schemes in multiple access relay channels. First, the coding scheme in the multiple access relay channel is introduced. At the desired source rates, 3 optimal sets of resource allocation (the total power consumption, the relay power consumption, and the source power consumption) are given in the closed form. The analysis shows that the proposed energy-efficient schemes achieve higher data rates and significantly outperform especially by reducing the relay energy consumption, which is useful for the shared relays. Moreover, the results allow a comprehensive description of the power consumption systems and give a detailed understanding of the desired message coding and the resource dedication for every desired sum rate.

关键词： achievable rate region coding scheme energy efficiency multiple access relay channel optimal resource allocation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：