首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 46 毫秒
1.
In [P. Hancock, A. Setzer, Interactive programs in dependent type theory, in: P. Clote, H. Schwichtenberg (Eds.), Proc. 14th Annu. Conf. of EACSL, CSL’00, Fischbau, Germany, 21–26 August 2000, Vol. 1862, Springer, Berlin, 2000, pp. 317–331, URL citeseer.ist.psu.edu/article/hancock00interactive.html; P. Hancock, A. Setzer, Interactive programs and weakly final coalgebras in dependent type theory, in: L. Crosilla, P. Schuster (Eds.), From Sets and Types to Topology and Analysis. Towards Practicable Foundations for Constructive Mathematics, Oxford Logic Guides, Clarendon Press, 2005, URL www.cs.swan.ac.uk/csetzer/] Hancock and Setzer introduced rules to extend Martin-Löf's type theory in order to represent interactive programming. The rules essentially reflect the existence of weakly final coalgebras for a general form of polynomial functor. The standard rules of dependent type theory allow the definition of inductive types, which correspond to initial algebras. Coalgebraic types are not represented in a direct way. In this article we show the existence of final coalgebras in intensional type theory for these kind of functors, where we require uniqueness of identity proofs () for the set of states and the set of commands which determine the functor. We obtain the result by identifying programs which have essentially the same behaviour, viz. are bisimular. This proves the rules of Setzer and Hancock admissible in ordinary type theory, if we replace definitional equality by bisimulation. All proofs [M. Michelbrink, Verifications of final coalgebra theorem in: Interfaces as Functors, Programs as Coalgebras—A Final Coalgebra Theorem in Intensional Type Theory, 2005, URL www.cs.swan.ac.uk/csmichel/] are verified in the theorem prover agda [C. Coquand, Agda, Internet, URL www.cs.chalmers.se/catarina/agda/; K. Peterson, A programming system for type theory, Technical Report, S-412 96, Chalmers University of Technology, Göteborg, 1982], which is based on intensional Martin-Löf type theory.  相似文献   

2.
ZnO nanomaterial with multi-microstructures is synthesized by using normal pressure thermal evaporation and then doped with different Al2O3 contents by grinding in an agate mortar. The as-prepared Al-doped ZnO nanomaterials are characterized by X-ray diffraction and scanning electron microscopy. The characterization results show that all the compounds are wurtzite with hexagonal structure and are well crystallized. Channels/connecting holes arising from many kinds of ZnO microstructures are abundant. Both annealing and Al2O3-doping contributes to an increase in the quasi-one-dimensional and tri-dimensional microstructures. The as-prepared Al-doped ZnO nanomaterials show excellent gas responses to ethanol. The sensing mechanism of the ZnO-based nanomaterials with multi-microstructures is further analyzed by using the Effective Specific Surface Model. Excellent sensitivity (200) companied with short response time (8 s) and recovery time (10 s) to 3000 ppm ethanol is obtained with a ZnO-based sensor with 2 at.% Al2O3 at the operating temperature of 290 °C after the sensor is annealed at 500 °C.  相似文献   

3.
Capacitive relative humidity (RH) sensors were fabricated by coating countersunk interdigitated electrode substrates with nanostructured TiO2 films produced using glancing angle deposition. Areal capacitance increased from 1 nF cm−2 to 800 nF cm−2 as relative humidity was increased from 2% RH and 95% RH. For films deposited at 81° and with a thickness below 4 m, response time was (162±4) ms m−1. Response times increased from 64 ms to 1440 ms as film thickness increased from 280 nm to 8.5 m. The linear dependence of response time with film thickness indicates that device response time is dominated by surface adsorption. Response time decreased with increasing deposition angle, with a slope of (−15.2±1.6) ms degree−1 for the adsorption data, and (−17.3±2.5) ms degree−1 for the desorption data. The optimum operating range of the sensors depends on deposition angle, and can be tuned to different ranges to match application needs.  相似文献   

4.
LetRbe a Hilbertian domain and letKbe its fraction field. Letψ(x1, …, xny) be a quantifier free arithmetical formula overR. We may also takeψ(x1, …, xny) to be an arithmetical formula overK[x1, …, xn] and write it asψ(y). In this paper we show that ifRhas enough non-units and x1xn y ψ(x1, …, xny), called an n  sentence, is true inR, then y ψ(y) is true inK[x1, …, xn]. Also, ifR=K[T], whereKis an infinite integral domain andx1xn y ψ(x1, …, xn, y)is true inR, then y ψ(y) is true inR[x1, …, xn]. These results are applied to find the upper and lower bounds of the time complexities of various decision problems on diophantine equations with parameters and arithmetical sentences. Some of the results are: 1. The decision problem of sentences and diophantine equations with parameters over the ring of integers of a global field are co-NP-complete. 2. The decision problem of sentences over the ring of integers of a global field is NP-complete. 3. LetKbe an infinite domain, the time complexities of the decision problems of equations with parameters and sentences over the polynomial ringK[t] are polynomial time reducible to factoring polynomials overK. 4. The decision problem of sentences over all algebraic integer rings is in P. 5. The decision problem of sentences over all integral domains with characteristic 0 is in P. 6. The time complexity of the decision problem of sentences over all integral domains is polynomial time reducible to factoring integers overZand factoring polynomials over finite fields.  相似文献   

5.
By reduction from the halting problem for Minsky's two-register machines we prove that there is no algorithm capable of deciding the -theory of one step rewriting of an arbitrary finite linear confluent finitely terminating term rewriting system (weak undecidability). We also present a fixed such system with undecidable *-theory of one step rewriting (strong undecidability). This improves over all previously known results of the same kind.  相似文献   

6.
We propose predicate abstraction as a means for verifying a rich class of safety and liveness properties for dense real-time systems. First, we define a restricted semantics of timed systems which is observationally equivalent to the standard semantics in that it validates the same set of μ-calculus formulas without a next-step operator. Then, we recast the model checking problem S for a timed automaton S and a μ-calculus formula in terms of predicate abstraction. Whenever a set of abstraction predicates forms a so-called basis, the resulting abstraction is strongly preserving in the sense that S validates iff the corresponding finite abstraction validates this formula . Now, the abstracted system can be checked using familiar μ-calculus model checking. Like the region graph construction for timed automata, the predicate abstraction algorithm for timed automata usually is prohibitively expensive. In many cases it suffices to compute an approximation of a finite bisimulation by using only a subset of the basis of abstraction predicates. Starting with some coarse abstraction, we define a finite sequence of refined abstractions that converges to a strongly preserving abstraction. In each step, new abstraction predicates are selected nondeterministically from a finite basis. Counterexamples from failed μ-calculus model checking attempts can be used to heuristically choose a small set of new abstraction predicates for refining the abstraction.  相似文献   

7.
This paper presents an extension of a proof system for encoding generic judgments, the logic FOλΔ of Miller and Tiu, with an induction principle. The logic FOλΔ is itself an extension of intuitionistic logic with fixed points and a “generic quantifier”, , which is used to reason about the dynamics of bindings in object systems encoded in the logic. A previous attempt to extend FOλΔ with an induction principle has been unsuccessful in modeling some behaviours of bindings in inductive specifications. It turns out that this problem can be solved by relaxing some restrictions on , in particular by adding the axiom Bx.B, where x is not free in B. We show that by adopting the equivariance principle, the presentation of the extended logic can be much simplified. Cut-elimination for the extended logic is stated, and some applications in reasoning about an object logic and a simply typed λ-calculus are illustrated.  相似文献   

8.
We propose a semantics for the -quantifier of Miller and Tiu. First we consider the case for classical first-order logic. In this case, the interpretation is close to standard Tarski-semantics and completeness can be shown using a standard argument. Then we put our semantics into a broader context by giving a general interpretation of in categories with binding structure. Since categories with binding structure also encompass nominal logic, we thus show that both -logic and nominal logic can be modelled using the same definition of binding. As a special case of the general semantics in categories with binding structure, we recover Gabbay & Cheney's translation of FOλ into nominal logic.  相似文献   

9.
The flow around two-dimensional cylinders at moderate Reynolds numbers has been much studied, both for cylinders perpendicular to the flow and for cylinders yawed to the flow. In contrast, yawed finite aspect ratio cylinders have received little attention. In this article we describe computer simulations of cylinders with aspect ratios 2  L/D  20 yawed at angles 0°  α  90° relative to a free stream. The simulations were carried out for Reynolds numbers in the range 1  Re  40. The simulations show that the Independence Principle [Zdravkovich MM. Flow around circular cylinders, vol. 2: applications. New York: Oxford University Press; 2003[1]] is not accurate for α  45°. We have also found that for all aspect ratios, the ratio of the lift to drag force reaches a maximum for 40° < α < 50°. Finally, we present CL and CD relationships as best curve fits to computational data.  相似文献   

10.
In order to develop the nitrate deposits found close to Lop Nur in the Xinjiang region in China, the solubilities of the system Na+,Mg2+/Cl,SO42−, NO3–H2O and its subsystems, the quaternary systems Na+,Mg2+/SO42−,NO3–H2O and Mg2+/Cl,SO42−,NO3–H2O, were studied at 298.15 K. The phase diagrams were plotted according to the solubilities achieved. In the equilibrium phase diagram of Mg2+/Cl,SO42−,NO3–H2O, there are two invariant points, five univariant curves and four regions of crystallization: Mg(NO3)26H2O,MgCl26H2O,MgSO47H2O and MgSO4(1–6)H2O. In the equilibrium phase diagram of Na+,Mg2+/SO42−, NO3–H2O, there are five invariant points, eleven univariant curves and seven regions of crystallization: Na2SO4,Na2SO410H2O,NaNO3,MgSO4Na2SO44H2O,NaNO3Na2SO42H2O,Mg(NO3)26H2O and MgSO47H2O. In the equilibrium phase diagram of the Na+, Mg2+/Cl,SO42−,NO3–H2O system, there are six invariant points, and ten regions of crystallization: NaCl, NaNO3,Na2SO4,Na2SO410H2O,MgSO4Na2SO44H2O, NaNO3Na2SO42H2O,MgCl26H2O,Mg(NO3)26H2O, MgSO4(1–6)H2O and MgSO47H2O.  相似文献   

11.
This paper proposes an inductive synthesis algorithm for a recursive process. To synthesize a process, facts, which must be satisfied by the target process, are given to the algorithm one by one since such facts are infinitely many in general. When n facts are input to the algorithm, it outputs a process which satisfies the given n facts. And this generating process is repeated infinitely many times. To represent facts of a process, we adopt a subcalculus of μ-calculus. First, we introduce a new preorder d on recursive processes based on the subcalculus to discuss its properties. pd q means that pf implies qf, for all formulae f in the subcalculus. Then, its discriminative power and relationship with other preorders are also discussed. Finally, we present the synthesis algorithm. The correctness of the algorithm can be stated that the output sequence of processes by the algorithm converges to a process, which cannot be distinguished from the intended one (if we could know it) by a given enumeration of facts, in the limit. A prototype system based on the algorithm is stated as well.  相似文献   

12.
R.N.  A.A.  D.H.  M.I.  M.  L. 《Sensors and actuators. A, Physical》2008,147(2):436-440
The microstructure and tensoresistive properties of GaSb–FeGa1.3 eutectic composites doped with 0.1% Co have been investigated. It was found that the Co impurity atoms mainly accumulate in the metallic inclusions. The length of the inclusions in GaSb–FeGa1.3Co was measured to be about half of those in undoped GaSb–FeGa1.3 eutectics. The tensometric characteristics of gauges based on GaSb–FeGa1.3Co have been found to be more thermostable than undoped samples.  相似文献   

13.
In this paper we consider factorizing codes C over A, i.e., codes verifying the factorization conjecture by Schützenberger. Let n be the positive integer such that anC, we show how we can construct C starting with factorizing codes C′ with anC′ and n′ < n, under the hypothesis that all words aizaj in C, with z(A\a)A*(A\a) (A\a), satisfy i, j, > n. The operation involved, already introduced by Anselmo, is also used to show that all maximal codes C=P(A−1)S+1 with P, SZA and P or S in Za can be constructed by means of this operation starting with prefix and suffix codes. Old conjectures by Schützenberger have been revised.  相似文献   

14.
B.G.  Y.  B.Z.  J.P.   《Sensors and actuators. A, Physical》2008,147(2):536-543
A wireless stress/strain measurement system is developed by integrating with pressure-sensitive sensors for health monitoring of concrete structures. The pressure-sensitive stress/strain sensors are fabricated by using nickel powder-filled cement-based composite. The wireless stress/strain measurement system integrated with these sensors is tested with compressive stress/strain in the range from 0 MPa/0 μ to 2.5 MPa/311.5 μ for performance evaluation. Experimental results indicate that the electrical resistivity of pressure-sensitive nickel powder-filled cement-based stress/strain sensors changes linearly and reversibly with the compressive stress/strain, and its fractional change goes up to 42.719% under uniaxial compression. The relationship between input (compressive stress/strain) and output (the fractional change in electrical resistivity) of the wireless stress/strain measurement system integrated with pressure-sensitive sensors is Δρ = −0.16894σρ = −1336.5. The wireless stress/strain measurement system can be used to achieve a sensitivity to stress/strain of 16.894% MPa−1/0.13365%μ−1 (a gauge factor of 1336.5) and a stress/strain resolution of 150 Pa/0.02 μ. The newly developed wireless stress/strain measurement system integrated with pressure-sensitive nickel powder-filled cement-based sensors has such advantages as high sensitivity to stress/strain, high stress/strain resolution, simple circuit and low energy consumption.  相似文献   

15.
This paper proposed a method of microfabrication for the formation of hemispherical refractive microlenses by depositing a colloid evaporative droplet onto hydrophobic surfaces. The microdroplets made of polyurethane (PU) were self-driven by surface tension to evolve their three-dimensional (3D) shapes on the surface-treated substrate. The substrates were coated with low surface energy material (Teflon) to de-pin the fluids obeying classic Young–Laplace equation until drying. Array and size-variation experiments, corresponding to different placement and droplet volume, were performed for the shaping process in which the polymers of the drops were self-assembled to be hemispherical utilizing general principle of minimal surface energy. Using the hydrophobic surfaces, plano-convex shapes with spherical curvature were fabricated with micrometer dimensions (base radius between 70 and 1016 μm). The formed structures were observed to form themselves hemispherically by the de-wetting (de-pinning) process during most of evaporation. Moreover, the gravity flatting effect was further found for the larger drop (radius = 1016 μm) when compared to that of smaller one (radius = 118 μm). In the cases, both the modeling calculations and experimental results were performed and compared to illustrate the similar geometries with the contact angle (70°) using dimensionless analysis. In addition, one interesting and significant finding, based on close morphological inspection of the SEM picture, showed that the resulting elongational polymer chains (width 200 nm) stretched (extension 5 μm) on the surface nearby the corner of the contact area, indicating a shear stress occurrence. Compared to those previous methods operated on (soft-) photolithographic techniques, this present one could rapidly predict and microfabricate the hemispherical formation in terms of the radius, height, and contact angle. It is also potentially appropriate for smaller and complex placement by using drop-on-demand (DOD) nozzle arrays for mass-production process.  相似文献   

16.
Precise determination of the effective angle of shearing resistance (′) value is a major concern and an essential criterion in the design process of the geotechnical structures, such as foundations, embankments, roads, slopes, excavation and liner systems for the solid waste. The experimental determination of ′ is often very difficult, expensive and requires extreme cautions and labor. Therefore many statistical and numerical modeling techniques have been suggested for the ′ value. However they can only consider no more than one parameter, in a simplified manner and do not provide consistent accurate prediction of the ′ value. This study explores the potential of Genetic Expression Programming, Artificial Neural Network (ANN) and Adaptive Neuro Fuzzy (ANFIS) computing paradigm in the prediction of ′ value of soils. The data from consolidated-drained triaxial tests (CID) conducted in this study and the different project in Turkey and literature were used for training and testing of the models. Four basic physical properties of soils that cover the percentage of fine grained (FG), the percentage of coarse grained (CG), liquid limit (LL) and bulk density (BD) were presented to the models as input parameters. The performance of models was comprehensively evaluated some statistical criteria. The results revealed that GEP model is fairly promising approach for the prediction of angle of shearing resistance of soils. The statistical performance evaluations showed that the GEP model significantly outperforms the ANN and ANFIS models in the sense of training performances and prediction accuracies.  相似文献   

17.
Let R be a commutative ring with 1, let RX1,…,Xn/I be the polynomial algebra in the n≥4 noncommuting variables X1,…,Xn over R modulo the set of commutator relations I={(X1+···+Xn)*Xi=Xi*(X1+···+Xn)|1≤in}. Furthermore, let G be an arbitrary group of permutations operating on the indeterminates X1,…,Xn, and let RX1,…,Xn/IG be the R-algebra of G-invariant polynomials in RX1,…,Xn/I. The first part of this paper is about an algorithm, which computes a representation for any fRX1,…,Xn/IG as a polynomial in multilinear G-invariant polynomials, i.e., the maximal variable degree of the generators of RX1,…,Xn/IG is at most 1. The algorithm works for any ring R and for any permutation group G. In addition, we present a bound for the number of necessary generators for the representation of all G-invariant polynomials in RX1,…,Xn/IG with a total degree of at most d. The second part contains a first but promising analysis of G-invariant polynomials of solvable polynomial rings.  相似文献   

18.
We show that the ** part of the equational theory modulo an AC symbol is undecidable. This solves the open problem 25 from the RTA list. We show that this result holds also for the equational theory modulo an ACI symbol.  相似文献   

19.
In recent research, we proposed a general framework of quantum-inspired multi-objective evolutionary algorithms (QMOEA) and gave one of its sufficient convergence conditions to the Pareto optimal set. In this paper, two Q-gate operators, H gate and R&N gate, are experimentally validated as two Q-gate paradigms meeting the convergence condition. The former is a modified rotation gate, and the latter is a combination of rotation gate and NOT gate with the specified probability. To investigate their effectiveness and applicability, several experiments on the multi-objective 0/1 knapsack problems are carried out. Compared to two typical evolutionary algorithms and the QMOEA only with rotation gate, the QMOEA with H gate and R&N gate have more powerful convergence ability in high complex instances. Moreover, the QMOEA with R&N gate has the best convergence in almost all of the experimental problems. Furthermore, the appropriate ε value regions for two Q-gates are verified.  相似文献   

20.
A bipartite graph G=(U,V,E) is a chain graph [M. Yannakakis, Computing the minimum fill-in is NP-complete, SIAM J. Algebraic Discrete Methods 2 (1) (1981) 77–79] if there is a bijection such that Γ(π(1))Γ(π(2))Γ(π(|U|)), where Γ is a function that maps a node to its neighbors.We give approximation algorithms for two variants of the Minimum Chain Completion problem, where we are given a bipartite graph G(U,V,E), and the goal is find the minimum set of edges F that need to be added to G such that the bipartite graph G=(U,V,E) (E=EF) is a chain graph.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号