For a flat universe presently dominated by static or dynamic vacuum energy, cosmological constant (LCDM) or quintessence (QCDM), we calculate the asymp-totic collapsed mass fraction as function of the present ratio of smooth energy to matter energy R 0 = (1 − Ω m0)/Ω m0. Identifying these collapsed fractions as anthropic probabilities, we find the observed present ratio R 0 ∼ 2 to be likely in ...

If it is true that good problems produce good science, then it will be worthwhile to identify good problems, and even more worthwhile to discover the attributes that make them good problems. This discovery process is necessarily empirical, so we examine several challenge problems, beginning with Turing’s famous test, and more than a dozen attributes that challenge problems might have. We are le...

The degree to which an individual perceives interpersonal acceptance as being contingent on successes and failures, versus relatively unconditional, is an important factor in the social construction of self-esteem. The authors used a lexical-decision task to examine people's "if. . . then" expectancies. On each trial, participants were shown a success or failure context word and then they made ...

The dependency surface-syntactic structure is proposed, within the Meaning-Text framework, for binary conjunctions of the IF–THEN type; e.g.: IF→Y, THEN←X A universal typology of conjunctions is sketched, and three examples of English binary conjunctions are given. Binary conjunctions are “discontinuous” phrasemesidioms, collocations and formulemes that have to be considered together with their...

Rabi, Rivest, and Sherman alter the standard notion of noninvertibility to a new notion they call strong noninvertibility, and show—via explicit cryptographic protocols for secret-key agreement ([RS93,RS97] attribute this to Rivest and Sherman) and digital signatures [RS93,RS97]—that strongly noninvertible functions would be very useful components in protocol design. Their definition of strong ...

This article describes the use of binary decision diagrams (BDDs) and if-then-else dags for representing and manipulating Boolean functions. Two-cuts are de ned for binary decision diagrams, and a relationship is exhibited between general if-then-else expressions and the two-cuts of a BDD for the same function. An algorithm for computing all two-cuts of a BDD in O(n 2 ) time is given. A new can...

This paper proposes ajuzzy neural expert system (FNES) with the following two functions: (1) Generalization of the information derived from the training data and embodiment of knowledge in the form of the fuzzy neural network; (2) Extraction of fuzzy If-Then rules with linguistic relative importance of each proposition in an antecedent (I f -part) from a trained neural network. This paper also ...

This paper introduces the research on possibility of global optimization elements and ε-insensitive learning techniques integration in aim of fuzzy if-then rules extraction quality increase. The new learning algorithm of neuro-fuzzy system with parameterized consequents is introduced. It consists in integration of deterministic annealing and ε iterative quadratic programming method. The propose...