期刊文献+
共找到6篇文章
< 1 >
每页显示 20 50 100
社区居委会“开证明”的尴尬与矛盾 被引量:1
1
作者 朱晓彦 《社会》 北大核心 2003年第6期25-26,共2页
我国的城市居委会体制建立于50年代初,自它成立之日起,就在城市人的社会生活中扮演着重要角色.尽管在单位体制下,居委会一直处于边缘状态,但它仍然与城市居民的社会生活息息相关.其中,一个很重要的纽带就是"开证明"--居民办... 我国的城市居委会体制建立于50年代初,自它成立之日起,就在城市人的社会生活中扮演着重要角色.尽管在单位体制下,居委会一直处于边缘状态,但它仍然与城市居民的社会生活息息相关.其中,一个很重要的纽带就是"开证明"--居民办理某些事务时,很多部门都要求由居委会来出具相关证明,比如居住证明、户口证明、婚姻状况证明等等.特别是无具体单位的居民,更是离不开居委会的证明. 展开更多
关键词 社区 建设 自治 居委会 权力 工作 “开证明” 证明合理性
下载PDF
An Analytic and Combinatorial-Geometric Proof of a Knopp-Type Identity for Multiple Dedekind Sums
2
作者 Kazuhito Kozuka 《Journal of Mathematics and System Science》 2015年第10期391-398,共8页
In this paper, we define multiple Dedekind sums by products of Bernoulli functions. From the Fourie expansions of Bernoulli functions, we express the Dedekind sums as series representatios. Then by a combinatorial-geo... In this paper, we define multiple Dedekind sums by products of Bernoulli functions. From the Fourie expansions of Bernoulli functions, we express the Dedekind sums as series representatios. Then by a combinatorial-geometric method, we give a new proof of a Knopp-type identity for the Dedekind sums. 展开更多
关键词 Dedekind sums Knopp's formula combinatorial
下载PDF
A Hierarchy of Resolution Systems with Restricted Substitution Rules
3
《Computer Technology and Application》 2012年第4期330-336,共7页
The proof system, based on resolution method, has become quite popular in automatic theorem proving, because this method is simple to implement. At present many kinds of extensions for resolution method are known: Re... The proof system, based on resolution method, has become quite popular in automatic theorem proving, because this method is simple to implement. At present many kinds of extensions for resolution method are known: Resolution with restricted number of variables in disjuncts, resolution over Linear Equations, Cutting planes, etc. For Classical, Intuitionistic and Minimal (Johansson's) propositional logics, the authors introduce the family of resolution systems with full substitution rule (SRC, SRI and SRM) and with e-restricted substitution rule (SeRC, SeRf and SeRM), where the number of substituted formula connectives is bounded by . The authors show that for each of mentioned logic the SR-type system (in tree form) is polynomially equivalent to Frege systems by size, but for every ~' 〉 0, Se+lR-type has exponential speed-up over the SeR-type (in tree form). 展开更多
关键词 Resolution system sequent system restricted substitution rule proof complexity polynomial simulation exponentialspeed-up ~o-determinative conjunct.
下载PDF
On Ws-Regular Spaces
4
作者 Halgwrd Mohammed Darwesh Adil Kadir Jabbar 《Journal of Mathematics and System Science》 2012年第2期67-71,共5页
In the present, the authors investigate a new type of separation axioms, which they call it w s-regular. The authors obtained some of its basic properties and its characterizations. Also, the authors notice that the a... In the present, the authors investigate a new type of separation axioms, which they call it w s-regular. The authors obtained some of its basic properties and its characterizations. Also, the authors notice that the axiom of tO s-regularity is weaker than the regularity, stronger than s-regularity and it is independent of w -regularity. However, the authors showed that the w s-regularity and regularity are identical on the class of all locally countable spaces, while the concepts ofw s-regularity and s-regularity are same on the class of anti-locally countable spaces:; furthermore, they proved that the three concepts w s-regularity, s-regularity and w s-regularity are same on the class of extremally disconnected spaces. The authors characterized w s-regular Trspaces by g-open sets, and they proved that the w s-regularity is an open hereditary property and it is also a topologizal property. The w s-closure of subsets of topological spaces are investigated and characterized. The authors used the concepts w s-closure to obtain some characterizations of the w s-regular spaces. Behind those, the authors obtained some properties and characterizations of w -semi open sets. 展开更多
关键词 Semi-open set w -semi open set regular space s-regular space w s-regular space locally and anti locally countable space extremally disconnected space.
下载PDF
Broadband Analytical Solution to the Scattering of Plane SV Waves by Circular Cylindrical Canyons
5
作者 Zhong Hui Zhang Yushan 《Earthquake Research in China》 2011年第1期13-27,共15页
Based on Fourier-Bessel series expansion of wave functions,an analytical solution to 2-D scattering ofincident plane SV waves by circular cylindrical canyons with variable depthto-width ratios is deduced in this paper... Based on Fourier-Bessel series expansion of wave functions,an analytical solution to 2-D scattering ofincident plane SV waves by circular cylindrical canyons with variable depthto-width ratios is deduced in this paper. Unlike other analytical solutions,this paper uses the asymptotic behavior of the cylindrical function to directly define the undetermined coefficients of scattered waves,thus,avoiding solving linear equation systems and the related numerical computation problems under high-frequency incident waves,thereby broadening the applicable frequency range of analytical solutions. Through comparison with existing analytical solutions,the correctness of this solution is demonstrated. Finally, the incident plane SV wave scattering effect under circular cylindrical canyons in wider frequency bands is explored. 展开更多
关键词 Plane SV waves CANYON SCATTERING Analytical solution Site effect
下载PDF
SEVERAL CRYPTOGRAPHIC APPLICATIONS OF ∑-PROTOCOL
6
作者 Chunming TANG Zheng-an YAO 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2009年第2期260-279,共20页
∑-protocol has been proved to be a very powerful cryptographic tool and widely used in nnmerous important cryptographic applications. In this paper, the authors make use of ∑-protocol as a main tool to resolve the f... ∑-protocol has been proved to be a very powerful cryptographic tool and widely used in nnmerous important cryptographic applications. In this paper, the authors make use of ∑-protocol as a main tool to resolve the following difficult problems 1-3 and to construct three ettlcient cryptographic protocols 4 6:1) How to construct a protocol for proving a secret integer to be a Blum integer with form PQ, where P, Q are two different primes and both -- 3(mod 4);2) How to construct a protocol for proving a secret polynomial with exact degree t - 1 iil a (t, n)- threshold secret sharing scheme:3) How to construct witness indistinguishable and witness hiding protocol not from zero-knowledge proof;4) A publicly verifiable secret sharing scheme with information-theoretic security;5) A delegateable signature scheme under the existence of one-way permutations;6) Non-interactive universal designated verifier signature schemes. 展开更多
关键词 ∑-protocol Blum integer delegateable signature secret sharing witness hiding protocol witness indistinguishable protocol universal designated verifier signature.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部