Results 181 to 190 of about 1,136 (216)
Some of the next articles are maybe not open access.
Journal of Symbolic Logic, 1969
Since Cohen [1] showed the independence of the axiom of choice from the other axioms of ZF, a number of people have used his forcing technique to show how badly choice can fail while certain vestiges of it remain. Many of these arguments involve the introduction of a generic sequence or generic set of generic sets of ordinals into a countable standard ...
openaire +1 more source
Since Cohen [1] showed the independence of the axiom of choice from the other axioms of ZF, a number of people have used his forcing technique to show how badly choice can fail while certain vestiges of it remain. Many of these arguments involve the introduction of a generic sequence or generic set of generic sets of ordinals into a countable standard ...
openaire +1 more source
2001
Model checking would answer all finite-state verification problems, if it were not for the notorious state-space explosion problem. A problem of practical importance, which attracted less attention, is to close open systems. Standard model checkers cannot handle open systems directly and closing is commonly done by adding an environment process, which ...
Natalia Sidorova, Martin Steffen
openaire +1 more source
Model checking would answer all finite-state verification problems, if it were not for the notorious state-space explosion problem. A problem of practical importance, which attracted less attention, is to close open systems. Standard model checkers cannot handle open systems directly and closing is commonly done by adding an environment process, which ...
Natalia Sidorova, Martin Steffen
openaire +1 more source
From Embedded Test to Embedded Diagnosis
European Test Symposium (ETS'05), 2005Testing integrated circuits with millions of transistors puts strong requirements on test volume, test application time, test speed, and test resolution. To overcome these challenges, it is widely accepted to partition test resources between the automatic test equipment (ATE) and the circuit under test (CUT). These strategies may reach from simple test
openaire +1 more source
2016 29th International Conference on VLSI Design and 2016 15th International Conference on Embedded Systems (VLSID), 2016
Implementing cryptographic algorithms into embedded systems has to take into account area, throughput, power and energy, similar to other VLSI designs. Of top of these constraints, the designer also has to make the design resistant to physical attacks, the more famous ones being side-channel and fault attacks.
Ingrid Verbauwhede +2 more
openaire +1 more source
Implementing cryptographic algorithms into embedded systems has to take into account area, throughput, power and energy, similar to other VLSI designs. Of top of these constraints, the designer also has to make the design resistant to physical attacks, the more famous ones being side-channel and fault attacks.
Ingrid Verbauwhede +2 more
openaire +1 more source
Journal of Functional Programming, 2005
This is a tutorial on using type-indexed embedding/projection pairs when writing interpreters in statically-typed functional languages. The method allows (higher-order) values in the interpreting language to be embedded in the interpreted language and values from the interpreted language may be projected back into the interpreting ...
openaire +1 more source
This is a tutorial on using type-indexed embedding/projection pairs when writing interpreters in statically-typed functional languages. The method allows (higher-order) values in the interpreting language to be embedded in the interpreted language and values from the interpreted language may be projected back into the interpreting ...
openaire +1 more source
Journal of Mathematical Sciences, 2002
Let \(n\) be an odd integer. Then the splitting fields \(K\) of \(f(x)= x^4- 2nx-1\) over \(\mathbb{Q}\) has Galois group \(S_4\). The author proves that the nonsplit embedding problem of \(K/\mathbb{Q}\) with kernel of order 2 has a solution if in the prime decomposition of \(16+ 27n^4\) the primes of odd multiplicity are of the form \(8m+ 1\), \(8m ...
openaire +2 more sources
Let \(n\) be an odd integer. Then the splitting fields \(K\) of \(f(x)= x^4- 2nx-1\) over \(\mathbb{Q}\) has Galois group \(S_4\). The author proves that the nonsplit embedding problem of \(K/\mathbb{Q}\) with kernel of order 2 has a solution if in the prime decomposition of \(16+ 27n^4\) the primes of odd multiplicity are of the form \(8m+ 1\), \(8m ...
openaire +2 more sources
Proceedings of the 10th SIGPLAN symposium on New ideas, new paradigms, and reflections on programming and software, 2011
Using code examples in professional software development is like teenage sex. Those who say they do it all the time are probably lying. Although it is natural, those who do it feel guilty. Finally, once they start doing it, they are often not too concerned with safety, they discover that it is going to take a while to get really good at it, and they ...
openaire +1 more source
Using code examples in professional software development is like teenage sex. Those who say they do it all the time are probably lying. Although it is natural, those who do it feel guilty. Finally, once they start doing it, they are often not too concerned with safety, they discover that it is going to take a while to get really good at it, and they ...
openaire +1 more source
Proceedings of the 8th ACM SIGPLAN workshop on Generic programming, 2012
This millennium has seen a great deal of research into embedded domain-specific languages. Primarily, such languages are simply-typed. Focusing on System F, we demonstrate how to embed polymorphic domain specific languages in Haskell and OCaml. We exploit recent language extensions including kind polymorphism and first-class modules.
openaire +1 more source
This millennium has seen a great deal of research into embedded domain-specific languages. Primarily, such languages are simply-typed. Focusing on System F, we demonstrate how to embed polymorphic domain specific languages in Haskell and OCaml. We exploit recent language extensions including kind polymorphism and first-class modules.
openaire +1 more source
2013
A number of nonlinear dimensionality reduction, or graph embedding, techniques have been proposed recently. These embedding techniques aim to provide a low-dimensional depiction of graphs while preserving certain properties of the data. In this manuscript we propose a novel graph embedding method which tries to optimize the "modularity" of graphs ...
openaire +1 more source
A number of nonlinear dimensionality reduction, or graph embedding, techniques have been proposed recently. These embedding techniques aim to provide a low-dimensional depiction of graphs while preserving certain properties of the data. In this manuscript we propose a novel graph embedding method which tries to optimize the "modularity" of graphs ...
openaire +1 more source
Canadian Mathematical Bulletin, 1969
Let Qt = [0, 1] be equipped with the topology consisting of Qt, the empty set and all subsets of Qt of the form [0, x), 0 < x ≦ 1. R. Nielsen and C. Sloyer [1, p. 514] proved that every T0-space can be embedded in for a suitable F. The purpose of this note is to generalize this result.
openaire +1 more source
Let Qt = [0, 1] be equipped with the topology consisting of Qt, the empty set and all subsets of Qt of the form [0, x), 0 < x ≦ 1. R. Nielsen and C. Sloyer [1, p. 514] proved that every T0-space can be embedded in for a suitable F. The purpose of this note is to generalize this result.
openaire +1 more source