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

Annual IEEE Symposium on Foundations of computer science

作者： A. Pneuli R. Rosner Weizmann Inst. of Sci. Rehovot Israel Department of Applied Mathematics and Computer Science Weizmann Institute of Science Rehovot Israel

The problem of synthesizing a finite-state distributed reactive system is considered. Given a distributed architecture A, which comprises several processors P/sub 1/, . . ., P/sub k/ and their interconnection scheme, and a propositional temporal specification phi , a solution to the synthesis problem consists of finite-state programs Pi /sub 1/, . . ., Pi /sub k/ (one for each processor), whose joint (synchronous) behavior maintains phi against.all possible inputs from the environment. Such a solution is referred to as the realization of the specification phi over the architecture A. Specifically, it is shown that the problem of realizing a given propositional specification over a given architecture is undecidable, and it is nonelementarily decidable for the very restricted class of hierarchical architectures. An extensive characterization of architecture classes for which the realizability problem is elementarily decidable and of classes for which it is undecidable is given.< >

关键词： Logic Councils Research and development mathematics Maintenance Open systems Automata

来源：评论

学校读者我要写书评

暂无评论

Splicing ViT Features for Semantic Appearance Transfer

arXiv

引用

arXiv 2022年

作者： Tumanyan, Narek Bar-Tal, Omer Bagon, Shai Dekel, Tali Dept. of Computer Science and Applied Math The Weizmann Inst. of Science

We present a method for semantically transferring the visual appearance of one natural image to another. Specifically, our goal is to generate an image in which objects in a source structure image are "painted" with the visual appearance of their semantically related objects in a target appearance image. Our method works by training a generator given only a single structure/appearance image pair as input. To integrate semantic information into our framework-a pivotal component in tackling this task-our key idea is to leverage a pre-trained and fixed Vision Transformer (ViT) model which serves as an external semantic prior. Specifically, we derive novel representations of structure and appearance extracted from deep ViT features, untwisting them from the learned self-attention modules. We then establish an objective function that splices the desired structure and appearance representations, interweaving them together in the space of ViT features. Our framework, which we term "Splice", does not involve adversarial training, nor does it require any additional input information such as semantic segmentation or correspondences, and can generate high resolution results, e.g., work in HD. We demonstrate high quality results on a variety of in-the-wild image pairs, under significant variations in the number of objects, their pose and appearance. © 2022, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

On universal quadratic identities for minors of quantum matrices 29

On universal quadratic identities for minors of quantum matr...

引用

29th international conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2017

作者： Danilov, Vladimir I. Karzanov, Alexander V. Central Inst. of Economics and Mathematics of RAS 47 Nakhimovskii Prosp. Moscow117418 Russia Inst. for System Analysis FRC Computer Science and Control of RAS 9 Prosp. 60 Let Oktyabrya Moscow117312 Russia

We give a complete combinatorial characterization of homogeneous quadratic identities of "universal character" valid for minors of quantum matrices over a field. This is obtained as a consequence of a study of quantized minors of the so-called path matrices associated with certain planar graphs generalizing Cauchon graphs. © 29th international conference on Formal Power Series and Algebraic Combinatorics. All rights reserved.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

On Producing Join Results Early 03

On Producing Join Results Early

引用

Twenty second ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2003

作者： Dittrich, Jens-Peter Seeger, Bernhard Taylor, David Scot Widmayer, Peter Department of Mathematics University of Marburg Marburg Germany Inst. of Theor. Computer Science ETH Zürich Zürich Switzerland Department of Computer Science San José State University San Jose CA 95110 United States

ISBN: (纸本)9781581136708

Support for exploratory interaction with databases in applications such as data mining requires that the first few results of an operation be available as quickly as possible. We study the algorithmic side of what can and what cannot be achieved for processing join operations. We develop strategies that modify the strict two-phase processing of the sort-merge paradigm, intermingling join steps with selected merge phases of the sort. We propose an algorithm that produces early join results for a broad class of join problems, including many not addressed well by hash-based algorithms. Our algorithm has no significant increase in the number of I/O operations needed to complete the join compared to standard sort-merge algorithms.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

On active interval scheduling in static sensor networks

On active interval scheduling in static sensor networks

引用

Proceedings of the Fourth IASTED International Multi-Conference on Wireless and Optical Communications

作者： Jin, Ming-Hui Huang, Yu-Cheng Hsu, D. Frank Kao, Cheng-Yan Wu, You-Rui Lee, Chih-Kung Department of Computer Science National Taiwan University Taipei Taiwan Department of Computer Science Fordham University LL813 New York NY 10023 United States Inst. of Applied Mechanics National Taiwan University Taipei Taiwan

ISBN: (纸本)088986411X

Most wireless sensor networks base their design on an ad hoc (multi-hop) network technology that focus on organizing and maintaining a network formed by a group of moving objects with a communication device in an area with no fixed base stations or access points. Although ad hoc network technologies are capable of constructing a sensor network, the design and implementation of sensor networks for monitoring stationary nodes such as construction sites and nature-disaster-prone areas can be furthered simplified to reduce power consumption and overhead. Based on the nature of immobile nodes, a hierarchical sensor network architecture (hierarchical SNA) and its associated communication protocols are proposed in this paper. In this proposed architecture, most elements in the sensor network are designed to be equipped with no functions for message forwarding or channel scheduling. The local control center (LLC) uses a centralized communication protocol to communicate with all the sensor nodes of the same cluster and forward the detection results from the sensor nodes to the global control center (GCC). To avoid the communication interference between adjacent clusters, a new scheduling scheme called the active interval scheduling scheme is proposed in this paper. In addition, two greedy algorithms are proposed to improve the report sensitivity for the networks maintenance. The experimental results show that the proposed greedy algorithms can both generate sensitive enough schedules.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

On coalgebra based on classes

On coalgebra based on classes

引用

作者： Adámek, Jiří Milius, Stefan Velebil, Jiří Inst. of Theor. Computer Science Technical University Braunschweig Germany Department of Mathematics Faculty of Electrical Engineering Czech Technical University 166 27 Prague Czech Republic

The category Class of classes and functions is proved to have a number of properties suitable for algebra and coalgebra: every endofunctor is set-based, it has an initial algebra and a terminal coalgebra, the categories of algebras and coalgebras are complete and cocomplete, and every endofunctor generates a free completely iterative monad. A description of a terminal coalgebra for the power-set functor is provided. © 2004 Elsevier B.V. All rights reserved.

关键词： computer science

来源：评论

学校读者我要写书评

暂无评论

Order statistic filters: Minimal collection of minimum weight vectors

Order statistic filters: Minimal collection of minimum weigh...

引用

Proceedings: 2003 International Conference on Image Processing, ICIP-2003

作者： Hirata, Nina S.T. Department of Computer Science Inst. of Mathematics and Statistics University of São Paulo Rua do Matão 1010 São Paulo SP 05508-090 Brazil

Weighted order statistic (WOS) filters are a generalization of the standard order statistic filters. Usually, they are characterized by a weight vector and a threshold value. Rather than considering individual filters, it is possible to consider the whole set of filters related to a given weight vector as a class of filters by allowing the threshold values vary from 0 to the sum of the weights. A major question is to find out if two weight vectors are equivalent or not as classes of filters. Some equivalent weight vectors as well as discussions on minimal collections of weight vectors are presented in this paper.

关键词： Signal filtering and prediction

来源：评论

学校读者我要写书评

暂无评论

Reverse-free codes and permutations

引用

Electronic Notes in Discrete mathematics 2011年 38卷 383-387页

作者： Füredi, Zoltán Kantor, Ida Monti, Angelo Sinaimeri, Blerina Rényi Inst. of Mathematics of the Hungarian Academy of Sciences 1364 Budapest Pf. 127 Hungary Institute for Theoretical Computer Science Charles University 118 00 Prague Czech Republic Department of Computer Science Sapienza University of Rome Rome 00198 Italy

Two codewords (a1,..., ak) and (b1,..., bk) form a reverse-free pair if (ai, aj)≠(bj, bi) holds whenever 1≤ii≠aj. In a reverse-free code, each pair of codewords is reverse-free. The maximum size of a reverse-free c... 详细信息

Two codewords (a₁,..., a_k) and (b₁,..., b_k) form a reverse-free pair if (a_i, a_j)≠(b_j, b_i) holds whenever 1≤ii≠a_j. In a reverse-free code, each pair of codewords is reverse-free. The maximum size of a reverse-free code with codewords of length k and an n-element alphabet is denoted by F (n,k). Let F(n, k) denote the maximum size of a reverse-free code with all codewords consisting of distinct *** determine F (n,3) and F (n,3) exactly whenever n is a power of 3, and asymptotically for other values of n. We prove non-trivial bounds for F(n, k) and F (n,k) for general k and for other related functions as well. Using VC-dimension of a matrix, we determine the order of magnitude of F (n,k) for n fixed and k tending to infinity. © 2011 Elsevier B.V.

关键词： Codes Extremal combinatorics Permutations Reverse-free

来源：评论

学校读者我要写书评

暂无评论

Flexible simulation of distributed protocols for mobile computing 00

Flexible simulation of distributed protocols for mobile comp...

引用

ACM MSWiM 2000 Proceedings of the 3rd ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems

作者： Da Rocha, Ricardo C.A. Endler, Markus Departament of Computer Science Inst. of Mathematics and Statistics University of São Paulo Rua do Matão 1010 05508-900 São Paulo SP Brazil

ISBN: (纸本)1581133049

This article describes MOBICS (Mobile Computing Simulator), a distributed protocol simulator for mobile computing that facilitates the prototyping and testing of protocols based on high-level programming abstractions and simulation transparency. The main contribution of MOBICS is the implementation of a software architecture for simulators that supports interchangeable simulation modes without affecting the distributed protocols being prototyped. Through MOBICS we aim at providing a unified tool both for testing the correctness of a protocol and for evaluating its performance in a Simulated environment.

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

Speaker conditional WaveRNN: Towards universal neural vocoder for unseen speaker and recording conditions

arXiv

引用

arXiv 2020年

作者： Paul, Dipjyoti Pantazis, Yannis Stylianou, Yannis Computer Science Department University of Crete Greece Inst. of Applied and Computational Mathematics Foundation for Research and Technology Hellas Greece

Recent advancements in deep learning led to human-level performance in single-speaker speech synthesis. However, there are still limitations in terms of speech quality when generalizing those systems into multiple-speaker models especially for unseen speakers and unseen recording qualities. For inst.nce, conventional neural vocoders are adjusted to the training speaker and have poor generalization capabilities to unseen speakers. In this work, we propose a variant of WaveRNN, referred to as speaker conditional WaveRNN (SC-WaveRNN). We target towards the development of an efficient universal vocoder even for unseen speakers and recording conditions. In contrast to standard WaveRNN, SC-WaveRNN exploits additional information given in the form of speaker embeddings. Using publicly-available data for training, SC-WaveRNN achieves significantly better performance over baseline WaveRNN on both subjective and objective metrics. In MOS, SC-WaveRNN achieves an improvement of about 23% for seen speaker and seen recording condition and up to 95% for unseen speaker and unseen condition. Finally, we extend our work by implementing a multi-speaker text-to-speech (TTS) synthesis similar to zero-shot speaker adaptation. In terms of performance, our system has been preferred over the baseline TTS system by 60% over 15.5% and by 60.9% over 32.6%, for seen and unseen speakers, respectively. Copyright © 2020, The Authors. All rights reserved.

关键词： Speech synthesis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：