๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Generation of threshold functions of high-order satisfying monotonicities

โœ Scribed by Yukihiro Kamada; Kiyonori Miyasaki


Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
363 KB
Volume
38
Category
Article
ISSN
0882-1666

No coin nor oath required. For personal study only.

โœฆ Synopsis


Abstract

This paper presents a generation procedure for highโ€order threshold functions, considering the highโ€order neighbor vector and the monotonic property. Specifically, it is first shown that the highโ€order neighbor vector can be derived from an input vector which is noncomparable by the highโ€order threshold function. Then, it is shown that a monotonic function of a highโ€order variable can easily be generated from the given monotonic function. Based on the generation process for the monotonic function, the generation procedure for highโ€order threshold functions is derived. It is also shown that if a given highโ€order threshold function preserves monotonicity, the generated highโ€order threshold function also preserves monotonicity, and also the highโ€order terms. ยฉ 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(9): 63โ€“73, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.20243


๐Ÿ“œ SIMILAR VOLUMES


Generating differential equations satisf
โœ K.C. Chung ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 215 KB

Based on the coefficients of two homogeneous linear differential equations, a method is proposed to construct a third homogeneous linear differential equations which is satisfied by all products of the form uv, where u and v satisfy, respectively, the first and the second given differential equation

Periodic behaviour of generalized thresh
โœ E. Goles; J. Olivos ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 218 KB

## Communicated by C. Benzaken It is shown that, for a function A from (0, 1)" to (0, 1)" whose components form PI symmetric set of threshold functions the repeated application of A, leads either to a fixed point or to a cycle of length two.

A General Upper Bound for the Satisfiabi
โœ O Dubois; Y Boufkhad ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 280 KB

Experiments on solving r-SAT random formulae have provided evidence of a satisfiability threshold phenomenon with respect to the ratio of the number of clauses to the number of variables of formulae. Presently, only the threshold of 2-SAT formulae has been proved to exist and has been computed to be