Sciweavers

8582 search results - page 231 / 1717
» Here or There
Sort
View
JLP
2006
155views more  JLP 2006»
15 years 6 months ago
A formally grounded software specification method
One of the goals of software engineering is to provide what is necessary to write relevant, legible, useful descriptions of the systems to be developed, which will be the basis of...
Christine Choppy, Gianna Reggio
JOC
2006
69views more  JOC 2006»
15 years 6 months ago
Characterization of Security Notions for Probabilistic Private-Key Encryption
The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptogr...
Jonathan Katz, Moti Yung
DEBU
1999
112views more  DEBU 1999»
15 years 6 months ago
Describing and Manipulating XML Data
This paper presents a brief overview of data management using the Extensible Markup Language (XML). It presents the basics of XML and the DTDs used to constrain XML data, and desc...
Sudarshan S. Chawathe
NDJFL
1998
105views more  NDJFL 1998»
15 years 6 months ago
Idempotent Full Paraconsistent Negations are not Algebraizable
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that ¬(a ∧ ¬a) is a t...
Jean-Yves Béziau
NA
2007
147views more  NA 2007»
15 years 6 months ago
An adaptive spectral least-squares scheme for the Burgers equation
A least-squares spectral collocation method for the one-dimensional inviscid Burgers equation is proposed. This model problem shows the stability and high accuracy of these scheme...
Wilhelm Heinrichs