Results 261 to 270 of about 102,869 (305)
Some of the next articles are maybe not open access.
Embedding security in wireless embedded systems
16th International Conference on VLSI Design, 2003. Proceedings., 2003We present an overview of how the need for security will impact the design of embedded systems and the ICs they contain. After a brief introduction to security, we discuss the challenges security processing poses to embedded system architects, integrators, HW designers, and SW engineers.
Srivaths Ravi 0001 +2 more
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 +2 more sources
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 +2 more sources
Evolutionary Computation, 2002
In this paper we introduce embedded landscapes as an extension of NK landscapes and MAXSAT problems. This extension is valid for problems where the representation can be expressed as a simple sum of subfunctions over subsets of the representation domain.
openaire +3 more sources
In this paper we introduce embedded landscapes as an extension of NK landscapes and MAXSAT problems. This extension is valid for problems where the representation can be expressed as a simple sum of subfunctions over subsets of the representation domain.
openaire +3 more sources
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
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
From Node Embeddings to Triple Embeddings.
2021An extended version of this paper has been published at the the 34th AAAI Conference on Artificial Intelligence (AAAI) with the title “Learning Triple Embeddings from Knowledge Graphs”. Graph embedding techniques allow to learn high-quality low-dimensional graph representations useful in various tasks, from node classification to clustering.
Fionda Valeria, Pirro' Giuseppe
openaire +3 more sources
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
Sbornik: Mathematics, 2005
The famous \textit{Borsuk Ulam theorem} asserts that every continuous \(f: S^n \to \mathbb R^n\) has an antipodal coincidence point, i.e., there exists an \(x \in S^n\) such that \(f(x)=f(-x)\). The main objective of the present paper is to solve the following question by H.
Volovikov, A. Yu., Shchepin, E. V.
openaire +1 more source
The famous \textit{Borsuk Ulam theorem} asserts that every continuous \(f: S^n \to \mathbb R^n\) has an antipodal coincidence point, i.e., there exists an \(x \in S^n\) such that \(f(x)=f(-x)\). The main objective of the present paper is to solve the following question by H.
Volovikov, A. Yu., Shchepin, E. V.
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 +2 more sources
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 +2 more sources