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

IEEE Annual Conference on Pervasive Computing and Communications Workshops (PerCom)

作者： C.L. Barrett G. Istrate V.S.A. Kumar M.V. Marathe S. Thite S. Thulasidasan Virginia Bio-Informatics Institute and Department of Computer Science Virginia Polytechnic Institute and State University USA Basic and Applied Simulation Science (CCS-5) Los Alamos National Laboratory USA Department of Math & Computer Science Technische Universiteit Eindhoven Netherlands

We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to computing a conflict-free assignment of channels ... 详细信息

关键词： Intelligent networks Radio networks Transceivers Interference Radio network Approximation algorithms Frequency computer science Media Access Protocol Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Combinatorial algorithms enabling computational science: tales from the front

引用

Journal of Physics: Conference Series 2006年第1期46卷

作者： Sanjukta Bhowmick Erik G Boman Karen Devine Assefaw Gebremedhin Bruce Hendrickson Paul Hovland Todd Munson Alex Pothen Mathematics and Computer Science Division Argonne National Laboratory USA Department of Applied Physics and Applied Mathematics Columbia University USA Discrete Algorithms and Math Department Sandia National Laboratories USA Computer Science Department Old Dominion University USA

Combinatorial algorithms have long played a crucial enabling role in scientific and engineering computations. The importance of discrete algorithms continues to grow with the demands of new applications and advanced architectures. This paper surveys some recent developments in this rapidly changing and highly interdisciplinary field.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A new family of windows——convolution windows and their applications

引用

science China(Technological sciences) 2005年第4期48卷 468-480页

作者： ZHANG Jieqiu1,2, LIANG Changhong1 & CHEN Yanpu3 1. Department of applied math. & Phys., College of science, Airforce Engineering University, Xi’an 710051, China 2. National Key laboratory of Antennas and Microwave Technology, Xidian University, Xi’an 710071, China 3. computer Center, Xi’an Communication College, Xi’an 710106, China 1. Department of Applied Math. & Phys. College of Science Airforce Engineering University 710051 Xi’an China 2. National Key Laboratory of Antennas and Microwave Technology Xidian University 710071 Xi’an China 3. Computer Center Xi’an Communication College 710106 Xi’an China

A new family of windows is constructed by convolutions via a few rectangular windows with same time width and is thus referred to as convolution windows. The expressions of the second-order up to the eighth-order convolution windows in both the time and frequency domains are derived. Their applications in high accuracy harmonic analysis of periodic signals are investigated. Comparisons between the proposed windows and some known windows with the same width shows that, when the synchronous deviation of data sampling is slight, the proposed ones have the least effect of spectral leakage. Therefore, the new windows are well suited for high accuracy harmonic analysis and parameter estimation for periodic signals. The error analysis and computer simulations show that the estimation errors, corresponding to frequency, amplitude and phase of every harmonic component of a signal, are proportional to the pth power of the relative frequency deviation in case of the pth-order convolution window is applied to windowing signal of approximately p cycles. By introducing real time adjustment in sampling interval, the proposed algorithm can adaptively trace signal frequency and lead to less sampling synchronous deviation. The proposed approach has the advantages of easy implementation and high measure precision and can be used in harmonic analysis of quasi-periodic signals whose fundamental frequency drifts slowly with time.

关键词： signal processing harmonic analysis window function convolution window synchronous error spoctral leakage

来源：评论

学校读者我要写书评

暂无评论

Constant-round oblivious transfer in the bounded storage model

引用

1st Theory of Cryptography Conference, TCC 2004

作者： Ding, Yan Zong Harnik, Danny Rosen, Alon Shaltiel, Ronen College of Computing Georgia Institute of Technology 801 Atlantic Drive AtlantaGA30332-0280 United States Dept. of Computer Science and Applied Math Weizmann Institute of Science Rehovot76100 Israel Laboratory for Computer Science Massachusetts Institute of Technology 200 Technology Square CambridgeMA02139 United States

ISBN: (纸本)3540210008

We present a constant round protocol for Oblivious Transfer in Maurer's bounded storage model. In this model, a long random string R is initially transmitted and each of the parties interacts based on a small portion of R. Even though the portions stored by the honest parties are small, security is guaranteed against any malicious party that remembers almost all of the string R. Previous constructions for Oblivious Transfer in the bounded storage model required polynomially many rounds of interaction. Our protocol has only 5 messages. We also improve other parameters, such as the number of bits transferred and the probability of immaturely aborting the protocol due to failure. Our techniques utilize explicit constructions from the theory of derandomization. In particular, we use constructions of almost t-wise independent permutations, randomness extractors and averaging samplers. © Springer-Verlag Berlin Heidelberg 2004.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

Randomness-efficient low degree tests and short PCPs via epsilon-biased sets

Randomness-efficient low degree tests and short PCPs via eps...

引用

35th Annual ACM Symposium on Theory of Computing

作者： Ben-Sasson, Eli Vadhan, Salil Sudan, Madhu Wigderson, Avi LCS MIT Harvard University Cambridge MA United States Harvard University Div. of Eng. Sci./Applied Sciences Maxwell Dworkin 337 33 Oxford St. Cambridge MA 02138 United States Laboratory for Computer Science Massachussettes Inst. of Technology Cambridge MA United States Institute for Advanced Study School of Math. Einstein Drive Princeton NJ 08540 United States Hebrew University Jerusalem Israel

We present the first explicit construction of Probabilistically Checkable Proofs (PCPs) and Locally Testable Codes (LTCs) of fixed constant query complexity which have almost-linear (= n · 2Õ(√log n) size. Such objects were recently shown to exist (nonconstructively) by Goldreich and Sudan. Previous explicit constructions required size n1+ω(Ε) with 1/Ε queries. The key to these constructions is a nearly optimal randomness-efficient version of the low degree test. In a similar way we give a randomness-efficient version of the BLR linearity test (which is used, for instance, in locally testing the Hadamard code). The derandomizations are obtained through Ε-biased sets for vector spaces over finite fields. The analysis of the derandomized tests rely on alternative views of Ε-biased sets - as generating sets of Cayley expander graphs for the low degree test, and as defining linear error-correcting codes for the linearity test.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

Direct methods for matrix Sylvester and Lyapunov equations

引用

Journal of applied mathematics 2003年第6期2003卷 277-303页

作者： Sorensen, Danny C. Zhou, Yunkai Department of Computational and Applied Mathematics Rice University Houston TX 77005-1892 United States Department of Computational and Applied Mathematics Rice University Houston TX 77005-1892 United States Argonne National Laboratory Math and Computer Science Division Argonne IL 60439 United States

We revisit the two standard dense methods for matrix Sylvester and Lyapunov equations: The Bartels-Stewart method for A1X+XA2+D=0 and Hammarling's method for AX+XAT+BBT=0 with A stable. We construct three schemes for solving the unitarily reduced quasitriangular systems. We also construct a new rank-1 updating scheme in Hammarling's method. This new scheme is able to accommodate a B with more columns than rows as well as the usual case of a B with more rows than columns, while Hammarling's original scheme needs to separate these two cases. We compared all of our schemes with the Matlab Sylvester and Lyapunov solver lyap.m;the results show that our schemes are much more efficient. We also compare our schemes with the Lyapunov solver sllyap in the currently possibly the most efficient control library package SLICOT;numerical results show our scheme to be competitive. © 2003 Hindawi Publishing Corporation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A new class of adaptive fuzzy control systems applied in an industrial thermal vacuum process

A new class of adaptive fuzzy control systems applied in an ...

引用

International Conference on Emerging Technologies and Factory Automation (ETFA)

作者： J.E. Araujo Filho S.A. Sandri E.E.N. Macau Computer Science and Applied Math Associated Laboratory-LAC Brazilian National Space Research Institute Sao Paulo Brazil Integrating and Testing Laboratory LIT Brazil

ISBN: (纸本)0780372417

A feasible solution to the problem of controlling thermal vacuum chambers automatically to satisfy testing requirements in the space sector is considered. The design of appropriate controllers is not a trivial task due to intrinsic time delay and changing dynamics related to variable operating conditions in thermal vacuum tests. The fuzzy reference gain-scheduling control approach (FRGS) is a concept that has been under development to substitute specialists in controlling thermal vacuum systems. In this new class of adaptive fuzzy controller the parameters are adjusted on-fine by modifying the shapes of the membership functions according to different operational conditions. Its application is not limited to controlling thermal vacuum processes. It can be applied to control any industrial problems or to model dynamics of systems, and it can be used in decision-making tasks.

关键词： Adaptive systems Programmable control Adaptive control Fuzzy control Thermal variables control Automatic control Control systems Shape control Automatic testing Delay effects

来源：评论

学校读者我要写书评

暂无评论

A note on proximity spaces and connection based mereology 01

A note on proximity spaces and connection based mereology

引用

Formal Ontology in Information Systems: Collected Papers from the Second International Conference

作者： Vakarelov, Dimiter Düntsch, Ivo Bennett, Brandon Laboratory for Applied Logic Fac. of Math. and Computer Science Sofia University blvd James Bouchier 5 1126 Sofia Bulgaria Faculty of Informatics University of Ulster Newtownabbey BT 370QB United Kingdom School of Computing University of Leeds Leeds LS2 9JT United Kingdom Department of Computer Science Brock University St. Catherines Ont. L2S 3AI Canada

ISBN: (纸本)1581133774

Representation theorems for systems of regions have been of interest for some time, and various contexts have been used for this purpose: Mormann has demonstrated the fruitfulness of the methods of continuous lattices to obtain a topological representation theorem for his formalisation of Whiteheadian ontological theory of space;similar results have been obtained by Roeper. In this note, we prove a topological representation theorem for a connection based class of systems, using methods and tools from the theory of proximity spaces. The key novelty is a new proximity semantics for connection relations.

关键词： Information science

来源：评论

学校读者我要写书评

暂无评论

Property testing and its connection to learning and approximation

Property testing and its connection to learning and approxim...

引用

Annual IEEE Symposium on Foundations of computer science

作者： O. Goldreich S. Goldwasser D. Ron Department of Computer Science and Applied Math Weizmann Institute of Science Israel Laboratory for Computer Science MIT Cambridge MA USA

The authors study the question of determining whether an unknown function has a particular property or is /spl epsiv/-far from any function with that property. A property testing algorithm is given a sample of the value of the function on instances drawn according to some distribution, and possibly may query the function on instances of its choice. First, they establish some connections between property testing and problems in learning theory. Next, they focus on testing graph properties, and devise algorithms to test whether a graph has properties such as being k-colorable or having a /spl rho/-clique (clique of density /spl rho/ w.r.t. the vertex set). The graph property testing algorithms are probabilistic and make assertions which are correct with high probability utilizing only poly(1//spl epsiv/) edge-queries into the graph, where /spl epsiv/ is the distance parameter. Moreover, the property testing algorithms can be used to efficiently (i.e., in time linear in the number of vertices) construct partitions of the graph which correspond to the property being tested, if it holds for the input graph.

关键词： Testing computer science Partitioning algorithms Application software Programming profession

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：