The result of forgetting some predicates in a first-order sentence may not exist in the sense that it might not be captured by any first-order sentences. This, indeed, severely restricts the usage of forgetting in applications. To address this issue, we propose a notion called k-forgetting, also called bounded forgetting in general, for any fixed number k. We present several equivalent characte...

In this study, quantitive characteristics and chemical composition of in roach (Rutilus rutilus caspicus) sperm were investigated. Sperm traits included sperm movement duration, percentage of motile spermatozoa, sperm density, spermatocrit and sperm volume. Some seminal plasma characteristics (sodium, potassium, calcium, magnesium and chloride) were investigated. In addition, some metabolites o...

Clustering of the training data using K-means method improved the generalization ability of kernel-based Fisher discriminant analysis. In this study, Gaussian type kernel function was used. The proposed method is applied to the vision-based recognition of the 41 Japanese Sign Language (JSL) static hand postures, which express part of the Japanese syllabary. The reflective near-infrared light me...

BAILEY, D. A. (I963): 'The Infected Hand'. London: H. K. Lewis. A sound and comprehensive account of sepsis in the hand, but without special reference to 'Sepsis and Salvage'. CLARKSON, P. and PELLY, A. (I962): 'Plastic and General Surgery of the Hand'. Oxford: Blackwell. A useful work of reference and practical advice. MACGREGOR, I. A. (I962): 'Fundamental Techniques of Plastic Surgery'. Londo...

Color the edges of the n-vertex complete graph red and blue, and suppose that red kcliques are fewer than blue k-cliques. We show that the number of red k-cliques is always less than ckn , where ck ∈ (0, 1) is the unique root of the equation z = (1 − z) + kz(1 − z)k−1. On the other hand, we construct a coloring in which there are at least ckn k −O(nk−1) red k-cliques and at least the same numbe...

For all integers $k,d$ such that $k \geq 3$ and $k/2\leq d \leq k-1$, let $n$ be a sufficiently large integer (which may not divisible by $k$), $s\le \lfloor n/k\rfloor-1$. We show if $H$ is $k$-uniform hypergraph on vertices with $\delta_{d}(H)>\binom{n-d}{k-d}-\binom{n-d-s+1}{k-d}$, then contains matching of size $s$. This improves recent result Lu, Yu, Yuan also answers question Kühn, Osthus...

Forming Limit Diagrams are useful tools for evaluation of formability in the sheet metals. In this paper the effects of yield criteria on predictions of the right and left-hand sides of forming limit diagrams (FLDs) are investigated. In prediction of FLD, Hosford 1979, “Karafillis-Boyce” (K-B) and BBC2000 anisotropy yield functions have been applied. Whereas the prediction of FLD is based on th...