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

Secure multiparty computation of approximations

28th International Colloquium on Automata, Languages and Programming, ICALP 2001

作者： Feigenbaum, Joan Ishai, Yuval Malkin, Tal Nissim, Kobbi Strauss, Martin J. Wright, Rebecca N. Yale University Computer Science Department New HavenCT06520-8285 United States DIMACS Center PiscatawayNJ United States AT & T Labs—Research 180 Park Avenue Florham ParkNJ07932 United States Weizmann Institute Dept. of Computer Science and Applied Math Rehovot Israel

ISBN: (纸本)3540422870

Approximation algorithms can sometimes provide effcient solutions when no efficient exact computation is known. In particular, approximations are often useful in a distributed setting where the inputs are held by different parties and are extremely large. Furthermore, for some applications, the parties want to cooperate to compute a function of their inputs without revealing more information than necessary. If f is an approximation to f, secure multiparty computation of f allows the parties to compute f without revealing unnecessary information. However, secure computation of f may not be as private as secure computation of f, because the output of f may itself reveal more information than the output of f. In this paper, we present definitions of secure multiparty approximate computations that retain the privacy of a secure computation of f. We present an efficient, sublinear-communication, private approximate computation for the Hamming distance and an efficient private approximation of the permanent. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Hamming distance

来源：评论

学校读者我要写书评

暂无评论

Error reduction by parallel repetition-a negative result

Error reduction by parallel repetition-a negative result

引用

Annual IEEE Conference on Computational Complexity

作者： U. Feige O. Verbitsky Department of Applied Math and Computer Science Weizmann Institute of Science Rehovot Israel Department of Mechanics and Mathematics Lviv University Lviv Ukraine

We show that no fixed number of parallel repetitions suffices in order to reduce the error in two-prover one-round proof systems from one constant to another. Our results imply that the recent bounds proven by Ran Raz (1995), showing that the number of rounds that suffice is inversely proportional to the answer length, are nearly best possible.

关键词： Leg mathematics

来源：评论

学校读者我要写书评

暂无评论

KLF2 maintains lineage fidelity and suppresses CD8 T cell exhaustion during acute LCMV infection

引用

science (New York, N.Y.) 2025年第6735期387卷 eadn2337页

作者： Fagerberg, Eric Attanasio, John Dien, Christine Singh, Jaiveer Kessler, Emily A. Abdullah, Leena Shen, Jian Hunt, Brian G. Connolly, Kelli A. De Brouwer, Edward He, Jiaming Iyer, Nivedita R. Buck, Jessica Borr, Emily R. Damo, Martina Foster, Gena G. Giles, Josephine R. Huang, Yina H. Tsang, John S. Krishnaswamy, Smita Cui, Weiguo Joshi, Nikhil S. Department of Immunobiology Yale University School of Medicine New Haven CT United States Program in Computational Biology & Bioinformatics Yale University New Haven CT United States Department of Microbiology and Immunology Geisel School of Medicine at Dartmouth NH United States Department of Pathology Feinberg School of Medicine at Northwestern University Chicago IL United States Department of Genetics and Computer Science Yale University School of Medicine New Haven CT United States Department of Medicine University of Chicago Chicago IL United States Section of Hematology Department of Internal Medicine Yale University School of Medicine New Haven CT United States Department of Systems Pharmacology and Translational Therapeutics University of Pennsylvania Philadelphia PA United States Institute for Immunology Perelman School of Medicine University of Pennsylvania Philadelphia PA United States Parker Institute for Cancer Immunotherapy Perelman School of Medicine University of Pennsylvania Philadelphia PA United States Yale Center for Systems and Engineering Immunology Yale University School of Medicine New Haven CT United States New Haven CT United States Department of Biomedical Engineering Yale University New Haven CT United States Computational Biology and Bioinformatics Program Yale University CT USA New Haven United States Applied Math Program Yale University New Haven CT United States

Naïve CD8 T cells have the potential to differentiate into a spectrum of functional states during an immune response. How these developmental decisions are made and what mechanisms exist to suppress differentiation toward alternative fates remains unclear. We employed in vivo CRISPR-Cas9-based perturbation sequencing to assess the role of ~40 transcription factors (TFs) and epigenetic modulators in T cell fate decisions. Unexpectedly, we found that knockout of the TF Klf2 resulted in aberrant differentiation to exhausted-like CD8 T cells during acute infection. KLF2 was required to suppress the exhaustion-promoting TF TOX and to enable the TF TBET to drive effector differentiation. KLF2 was also necessary to maintain a polyfunctional tumor-specific progenitor state. Thus, KLF2 provides effector CD8 T cell lineage fidelity and suppresses the exhaustion program.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-Robot Active SLAM with Relative Entropy Optimization

Multi-Robot Active SLAM with Relative Entropy Optimization

引用

American Control Conference

作者： Michail Kontitsis Evangelos A. Theodorou Emanuel Todorov Department of Electrical Engineering University of Denver Colorado Department of Computer Science and Engineering University of Washington Seattle Department of Computer Science and Engineering and the Applied Math Department University of Washington Seattle

ISBN: (纸本)9781479901777

This paper presents a new approach for Active Simultaneous Localization and Mapping that uses the Relative Entropy (RE) optimization method to select trajectories which minimize both the localization error and the corresponding uncertainty bounds. To that end we construct a planning cost function which includes, besides the state and control cost, a term that encapsulates the uncertainty of the state. This term is the trace of the state covariance matrix produced by the estimator, in this case an Extended Kalman Filter. The role of the RE method is to iteratively guide the selection of the trajectories towards the ones minimizing the aforementioned cost. Once the method has converged, the result is a near-optimal path in terms of achieving the pre-defined goal in the state space while also improving the localization error and the total uncertainty. In essence the method integrates motion planning with robot localization. To evaluate the approach we consider scenarios with single and multiple robots navigating in presence of obstacles and various conditions of landmark densities. The results show a behavior consistent with our expectations.

关键词： Relative Entropy Optimization SLAM RE

来源：评论

学校读者我要写书评

暂无评论

Characterizing the stiffness of a multi-segment flexible arm during motion

Characterizing the stiffness of a multi-segment flexible arm...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： David Held Yoram Yekutieli Tamar Flash Computer Science Department University of Stanford Stanford CA USA Weizmann Institute of Science Rehovot Israel Computer Science Department Hadassah College Jerusalem Israel Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

A number of robotic studies have recently turned to biological inspiration in designing control schemes for flexible robots. Examples of such robots include continuous manipulators inspired by the octopus arm. However, the control strategies used by an octopus in moving its arms are still not fully understood. Starting from a dynamic model of an octopus arm and a given set of muscle activations, we develop a simulation technique to characterize the stiffness throughout a motion and at multiple points along the arm. By applying this technique to reaching and bending motions, we gain a number of insights that can help a control engineer design a biologically inspired impedance control scheme for a flexible robot arm. The framework developed is a general one that can be applied to any motion for any dynamic model. We also propose a theoretical analysis to efficiently estimate the stiffness analytically given a set of muscle activations. This analysis can be used to quickly evaluate the stiffness for new static configurations and dynamic movements.

关键词： Muscles Force Computational modeling Trajectory Shape Motion segmentation

来源：评论

学校读者我要写书评

暂无评论

Free energy based policy gradients

Free energy based policy gradients

引用

IEEE Symposium on Adaptive Dynamic Programming and Reinforcement Learning, (ADPRL)

作者： Evangelos A. Theodorou Jiri Najemnik Emo Todorov Department of Computer Science and Engineering University of Washington Seattle University of Washington Seattle Departments of Computer Science and Engineering and Applied Math University of Washington Seattle

Despite the plethora of reinforcement learning algorithms in machine learning and control, the majority of the work in this area relies on discrete time formulations of stochastic dynamics. In this work we present a new policy gradient algorithm for reinforcement learning in continuous state action spaces and continuous time for free energy-like cost functions. The derivation is based on successive application of Girsanov's theorem and the use of the Radon Nikodým derivative as formulated for Markov diffusion processes. The resulting policy gradient is reward weighted. The use of Radon Nikodým extends analysis and results to more general models of stochasticity in which jump diffusions processes are considered. We apply the resulting algorithm in two simple examples for learning attractor landscapes in rhythmic and discrete movements.

关键词： Learning (artificial intelligence) Diffusion processes Markov processes Cost function Equations Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Parallel Repetition Theorem for Entangled Projection Games

A Parallel Repetition Theorem for Entangled Projection Games

引用

Annual IEEE Conference on Computational Complexity

作者： Irit Dinur David Steurer Thomas Vidick Department of Computer Science and Applied Math The Weizmann Institute Israel Departement of Computer Science Cornell University USA Centre for Quantum Technologies NUS Singapore

We study the behavior of the entangled value of two-player one-round projection games under parallel repetition. We show that for any projection game G of entangled value 1 - ε c) k ), for some universal constant c ≥ 1. Previously parallel repetition with an exponential decay in k was only known for the case of XOR and unique games. To prove the theorem we extend an analytical framework recently introduced by Dinur and Steurer for the study of the classical value of projection games under parallel repetition. Our proof, as theirs, relies on the introduction of a simple relaxation of the entangled value that is perfectly multiplicative. The main technical component of the proof consists in showing that the relaxed value remains tightly connected to the entangled value, thereby establishing the parallel repetition theorem. More generally, we obtain results on the behavior of the entangled value under products of arbitrary (not necessarily identical) projection games. Relating our relaxed value to the entangled value is done by giving an algorithm for converting a relaxed variant of quantum strategies that we call “vector quantum strategy” to a quantum strategy. The algorithm is considerably simpler in case the bipartite distribution of questions in the game has good expansion properties. When this is not the case, rounding relies on a quantum analogue of Holenstein's correlated sampling lemma which may be of independent interest. Our “quantum correlated sampling lemma” generalizes results of van Dam and Hayden on universal embezzlement to the following approximate scenario: two isolated parties, given classical descriptions of arbitrary bipartite states |ψ〉, |φ〉 respectively such that |ψ〉 ≈ |φ〉, are able to locally generate a joint entangled state|Ψ〉 ≈ |ψ〉 ≈ |φ〉 using an initial entangled state that is independent of their inputs.

关键词： Games Quantum entanglement Vectors Cryptography Complexity theory computer science

来源：评论

学校读者我要写书评

暂无评论

Knot mosaic tabulation

引用

Involve 2018年第1期11卷 13-26页

作者： Lee, Hwa Jeong Ludwig, Lewis D. Paat, Joseph Peiffer, Amanda School of Undergraduate Studies College of Transdisciplinary Studies Daegu Gyeongbuk Institute of Science and Technology Daegu 42988 South Korea Department of Mathematics and Computer Science Denison University 100 West College Granville 43023 OH United States Department of Applied Mathematics and Statistics Johns Hopkins 211-E Whitehead Hall 3400 N. Charles St. Baltimore 21218-2682 MD United States Department of Math and Computer Science Denison University Granville 43020 OH United States

In 2008, Lomonaco and Kauffman introduced a knot mosaic system to define a quantum knot system. A quantum knot is used to describe a physical quantum system such as the topology or status of vortexing that occurs in liquid helium II for example. Kuriya and Shehab proved that knot mosaic type is a complete invariant of tame knots. In this article, we consider the mosaic number of a knot, which is a natural and fundamental knot invariant defined in the knot mosaic system. We determine the mosaic number for all eight-crossing or fewer prime knots. This work is written at an introductory level to encourage other undergraduates to understand and explore this topic. No prior knowledge of knot theory is assumed or required. © 2018, mathematical sciences Publishers. All rights reserved.

关键词： crossing number knot mosaic knots mosaic number

来源：评论

学校读者我要写书评

暂无评论

On the cost of recomputing: Tight bounds on pebbling with faults

On the cost of recomputing: Tight bounds on pebbling with fa...

引用

Proceedings of the 1994 21st International Colloquium on Automata, Languages and Programming, ICALP'94

作者： Aumann, Yonatan Bar-Ilan, Judit Feige, Uriel Department of Applied Math. The Weizmann Institute Rehovot Israel MIT Laboratory of Computer Science 545 Technology Square CambridgeMA02138 United States School of Library Archive and Information Studies The Hebrew University Jerusalem91904 Israel

ISBN: (纸本)9783540582014

We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the "pebbling game" model. We extend this model to the faulty case, where the content of memory cells may be erased. The model captures notions such as "check points" (keeping multiple copies of intermediate results), and "recovery" (partial recomputing in the case of failure). Using this model, we derive tight bounds on the time and/or space overhead inflicted by faults. As a lower bound, we exhibit cases where f worst-case faults may necessitate an Ω(f) multiplicative overhead in computation resources (time, space, or their product). The lower bound holds regardless of the computing and recomputing strategy employed. A matching upper-bound algorithm establishes that an O(f) multiplicative overhead always suffices. For the special class of tree computations, we show that faults can be handled with an O(f) additive factor in memory, and only a constant multiplicative overhead in time. © 1994, Springer Verlag. All rights reserved.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

An empirical study on the knowledge management practice in software testing 21

An empirical study on the knowledge management practice in s...

引用

21st Ibero-American Conference on Software Engineering, CIbSE 2018

作者： Maciel, Claudia P.C. De Souza, Erica Ferreira Vijaykumar, Nandamudi L. De Almeida Falbo, Ricardo Meinerz, Giovani Volnei Felizardo, Katia Romero Department of Computer Federal Technological University of Paraná/UTFPR Cornelio Procópio/PR Brazil Lab. of Comp and Applied Math. National Institute for Space Research INPE Sao José dos Campos/SP Brazil Department of Computer Science Federal University of Espirito Santo UFES Vitória/ES Brazil

ISBN: (纸本)9789584837547

Context: Software testing is a knowledge intensive process, and therefore can benefit from the use of experience gained from past projects. In this context, principles of Knowledge Management (KM) can be applied to promote knowledge capture and sharing as well as the emergence of new knowledge. In spite of this, there are only few studies that present practitioners' perspective about KM initiatives in software testing. Objective: The main goal of this study is to identify the perception of professionals in software testing on the use of KM initiatives in software engineering companies, such as KM adoption, potential benefits or hindrances. Method: A survey was conducted in software development companies. In addition, the survey results were compared with another survey conducted previously in the same context, however, with different objectives and target audience. 39 software companies participated in this research. Results: Testing planning activity and the test case reuse are the aspects that have received more attention by companies. A strategic planning and reuse of existing test cases have a potential to significantly reduce software development costs and time. Conclusion: Applying KM in software companies can bring several benefits in terms of quality of results, reduction costs, time and effort. However, it is still a challenge to be faced and tackled. © 2018 Conferencia Iberoamericana de Software Engineering - CIbSE. All Rights Reserved.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：