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

Workshop on the Theory and Application of Cryptographic Techniques, AUSCRYPT 1992

作者： Sakurai, Kouichi Itoh, Toshiya Computer and Information Systems Laboratory Mitsubishi Electric Corporation 5-1-1 Ofuna Kamakura247 Japan Dept. Of Information Processing Tokyo Institute of Technology 4259 Nagatsuta Midori-ku Yokohama227 Japan

ISBN: (纸本)9783540572206

In this paper, we consider the subliminal channel, hidden in an identification scheme, for signature transfer. We point out that the direct parallelization of the Fiat-Shamir identification scheme has a subliminal channel for the transmission of the digital signature, which does not exist in the serial (zero-knowledge) version. We apply this subliminal channel to a multi-verifier interactive protocol and propose a distributed verification signature that cannot be verified without all verifiers' corporation. Our proposed protocol is the first implementation of the distributed verification signature without secure channels, and the basic idea of our construction suggests the novel primitive with which a signature transfer secure against adversary can be constructed using only one-way function (without trapdoor). © Springer-Verlag Berlin Heidelberg 1993.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

4 move perfect ZKIP of knowledge with no assumption 1st

4 move perfect ZKIP of knowledge with no assumption

引用

1st International Conference on the Theory and Application of Cryptology, ASIACRYPT 1991

作者： Saito, Takeshi Kurosawa, Kaoru Sakurai, Kouichi Dept. of Electrical and Electronic Eng. Tokyo Institute of Technology Tokyo152 Japan Computer & Information Systems Laboratory Mitsubishi Electric Corporation 5-1-1 Ofuna Kamakura247 Japan

ISBN: (纸本)9783540573326

This paper presents a 4-move perfect ZKIP of knowledge with no cryptographic assumption for the random self reducible problems [TW87] whose domain is NP∩BPP. The certified discrete log problem is such an example. (Finding a witness is more difficult than the language membership problem.) A largely simplified 4-move ZKIP for the Hamilton Circuit problem is also shown. In our ZKIP, a trapdoor coin flipping protocol is introduced to generate a challenge bit. P and V cooperatively generate a random bit in a coin flipping protocol. In a trapdoor coin flipping protocol, V who knows the trapdoor can create the view which he can later reveal in two possible ways: both as head and as tail. © 1993, Springer Verlag. All rights reserved.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

A robust numerical approach for array calibration

A robust numerical approach for array calibration

引用

1993 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1993

作者： Talwar, Shilpa Paulraj, Arogyaswami Golub, Gene H. Scientific Computing Stanford University StanfordCA94305 United States Information Systems Lab Stanford University StanfordCA94305 United States Dept. of Computer Science Stanford University StanfordCA94305 United States

ISBN: (纸本)0780309464

In this paper, we focus on the problem of sensor array calibration in the presence of noise field uncertainties. The objective is to compute a reliable estimate of the array response vector given finite sample estimates of the signal plus noise and noise only array covariances. These covariances are computed from data collected at the sensor array with a calibration signal turned on and off. Numerical difficulties are encountered in applying the usual generalized eigenvalue technique when the noise field is near singular or has changed significantly over the two covariance measurements. We present a robust numerical approach for determining the response vector in these situations. Results of computer simulations to verify the proposed technique are also presented. © 1993 IEEE

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Languages and compilers for parallel computing: 5th international workshop New Haven, Connecticut, USA august 3-5, 1992 proceedings

Languages and compilers for parallel computing: 5th internat...

引用

IFIP WG 5.7 International Conference on Advances in Production Management systems, APMS 2017

作者： Banerjee, Utpal Gelernter, David Nicolau, Alex Padua, David Intel Corporation 2200 Mission College Blvd. P. O. Box 58119 RN6-18 Santa ClaraCA95052 United States Dept. of Computer Science Yale University 51 Prospect St. New HavenCT06520 United States Dept. of Information & Computer Science University of California 444 Computer Science Bldg. IrvineCA92717 United States Center for Supercomputing Research and Development 465 Computer and Systems Research Laboratory 1308 West Main St. UrbanaIL61801 United States

来源：评论

学校读者我要写书评

暂无评论

Symmetric generalized logistic distribution: Distribution: Some’ momentl properties and approximation to the normall distribution

引用

Statistics 1993年第1期25卷 79-87页

作者： El-Saidi, Mohammed A. Singh, Karan P. Bartolucci, Alfred A. Dept. of Computer Information Systems Ferris State University Michigan 49307 Big Rapids United States The University of Alabama Birmingham United States

In this paper we discuss some moment properties of a symmetric generalized logistic distribution indexed by a shape parameter X and denoted by GL(X X), and show that it is asymptotically normal as X -*• oo, and asymptotically double exponential as X 0. We also show that GL(A, X) can be used to approximate the normal distribution. The proposed approximation is illustrated for specific values of X. AMS 1980 subject classification: Primary 62H10;secondary 65D20. © 1993, Taylor & Francis Group, LLC. All rights reserved.

关键词： approximation binomial probabilities incomplete beta function Logistic distribution normal distribution shape parameter cumulants

来源：评论

学校读者我要写书评

暂无评论

Half-QWERTY. A one-handed keyboard facilitating skill transfer from QWERTY 93

Half-QWERTY. A one-handed keyboard facilitating skill transf...

引用

Proceedings of the INTERCHI '93 Conference on Human Factors in Computing systems

作者： Matias, Edgar MacKenzie, I. Scott Buxton, William The Matias Corporation 178 Thistledown Boulevard Rexdale Ontario Canada M9V 1K1 Dept. of Computing and Information Science University of Guelph Guelph Ontario Canada N1G 2W1 University of Toronto & Xerox PARC c/o Computer Systems Research Institute University of Toronto Toronto Ontario Canada M5S 1A4

来源：评论

学校读者我要写书评

暂无评论

A comparative modeling approach to a large decision support system

引用

Knowledge and Policy 1992年第3期5卷 50-66页

作者： Poh, Hean Lee Dept. of Information Systems and Computer Science National University of Singapore Kent Ridge 0511 Singapore

A comparative modeling approach is proposed for a decision support framework enabling users to have access to different modeling techniques within a single system (depending on the problem and the resources available). Three modeling techniques were selected to illustrate a marketing strategic decision support system: analytic, heuristic, and data-driven. The preimplementation choice and the trade-offs of each technique are explained qualitatively. Subsequently, the unification of the three techniques is discussed, and the benefits and problems associated with the comparative modeling approach are evaluated. © 1993 Transaction Publishers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Parallel reduction of a chain query in distributed databases 4

Parallel reduction of a chain query in distributed databases

引用

4th International Conference on Computing and information, ICCI 1992

作者： Zhang, Yanchun Orlowska, Maria E. Centre of Expertise in Distributed Information Systems Dept. of Computer Science Univ. of Queensland Queensland4072 Australia

ISBN: (纸本)081862812X

This paper extends the results of Bernstein and Chiu [2], Bernstein and Goodman [3], and Ullman [12], by constructing a parallel algorithm for a subset of tree queries, called chain queries. An efficient parallel algorithm for a construction of full reducers for chain queries is presented and analyzed. We claim that the full reduction of a chain query can be done in parallel by executing only 2n-2 semijoins in the time required for an n-1 semijoins evaluation. © 1992 IEEE.

关键词： Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Lattice filter interpretations of the Chandrasekhar recursions for estimation and spectral factorization

Lattice filter interpretations of the Chandrasekhar recursio...

引用

1992 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 1992

作者： Sayed, Ali H. Lev-Ari, Hanoch Kailath, Thomas Information Systems Laboratory Stanford University StanfordCA94305 United States Dept. of Electrical and Computer Eng. Northeastern University BostonMA02115 United States

ISBN: (纸本)0780305329

The authors use the classical Schur reduction procedure to give a lattice filter implementation of the Chandrasekhar recursions. The derivation is based on the observation that the covariance matrix of a process with a time-invariant state-space model is structured. This allows one to easily derive the connection between the Schur algorithm and spectral factorization and to extend the Chandrasekhar recursions to the case of nonsymmetric Riccati equations. The Chandrasekhar recursions can be implemented in scalar steps using a sequence of well-defined elementary (hyperbolic and Givens) rotations. © 1992 IEEE.

关键词： Riccati equations

来源：评论

学校读者我要写书评

暂无评论

STRUCTURAL STABILITY ASPECTS OF ALTERNATE ROUTING IN NON-HIERARCHICAL NETWORKS UNDER RESERVATION

STRUCTURAL STABILITY ASPECTS OF ALTERNATE ROUTING IN NON-HIE...

引用

GLOBAL TELECOMMUNICATIONS CONF ( GLOBECOM 92 ) , INCLUDING COMMUNICA TIONS THEORY MINI-CONF

作者： KANIYIL, J HAGIYA, N SHIMAMOTO, S ONOZATO, Y NOGUCHI, S Dept. of Communications and Systems University of Electro-Communications Tokyo 182 Japan Dept. of Computer Science Gunma University 1-5-1 Tenjin-cho Kiryu-shi Gunma 376 Japan Research Center for Applied Information Sciences Tohoku University Sendai 980 Japan

ISBN: (纸本)0780306082

This paper presents a behavioral characterization of non-hierarchical alternate routing schemes in which a certain number of trunks are reserved for direct routed traffic. It is found that the fundamental behavioral characteristic of the alternate routing schemes with trunk reservation control remains the same as that of the schemes without reservation. With no reservation, the system has two equilibrium states separated wide apart [10]. Under the trunk reservation, the spatial distance between the equilibrium states of the system is considerably reduced. Even for a small number of trunks under reservation, the spatial distribution of the two equilibrium states is so close to each other that both the equilibrium states can be considered to coincide. The approach of this paper can explain why the conventional numerical analysis, under the assumption that the arrival rate of both the direct and the alternate routed traffic are Poisson processes, does not indicate instability of reservation schemes, and, why the empirical results indicate that the optimal number of trunks under reservation is not unique. A sufficient condition, which can be utilized to find the minimum number of trunks to be reserved for direct routed traffic so as to avoid the instability, is obtained. Though the sufficient condition ensures absolute stability of the system from the point of view of the catastrophe theory, the designer may select a lower number of trunks to be reserved, provided that the stable equilibrium states remain close to each other. A performance index to compare various levels of reservations among themselves, is proposed. © 1992 IEEE.

关键词： System stability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：