Results 1 to 10 of about 207,156 (257)
Optimal synthesis of distillation sequence is a complex problem in chemical processes engineering, which involves process structure optimization and operation parameters optimization.
Zehua Hu, Peilong Li, Yefei Liu
doaj +1 more source
Pellans sequence and its diophantine triples
We introduce a novel fourth order linear recurrence sequence {Sn} using the two periodic binary recurrence. We call it ?pellans sequence? and then we solve the system ab+1=Sx, ac+1=Sy bc+1=Sz where a < b < c are positive integers. Therefore, we extend the order of recurrence sequence for this variant diophantine equations by means of ...
Irmak, Nurettin, Alp, Murat
openaire +2 more sources
On Intuitionistic Fuzzy Metric Space and Ideal Convergence of Triple Sequence Space [PDF]
The purpose of this article is to introduce the triple sequences and its convergence over instuitionistic fuzzy metric space (\textbf{IFMS}). The article also discusses ideal convergence of triple sequences, the uniqueness of ideal limits, the ...
Shailendra Pandit, Ayaz Ahmad, Ayhan Esi
doaj +1 more source
Spreading Code Estimation of Multi-rate LC-DS-CDMA Signal Using Triple Feature Information [PDF]
Aiming at the problem of spreading code estimation of multi-rate Long Code Direct Sequence Code Division Multiple Access (LC-DS-CDMA) signal,a matching estimation method based on triple correlation feature information is proposed.Considering the ...
QIANG Fangfang,ZHAO Zhijin
doaj +1 more source
Seven-Cluster Structure of Larch Chloroplast Genome [PDF]
The paper presents a novel approach to study a nucleotide sequence structure with respect to the chloroplast genome DNA sequence analysis. A specific frequencies distribution pattern of the consecutive triple nucleotide fragments was identified in the ...
Michael G. Sadovsky +5 more
doaj +1 more source
A Note on Triple Repetition Sequence of Domination Number in Graphs
A set D subset of V(G) is a dominating set of a graph G if for all x ϵ V(G)\D, for some y ϵ D such that xy ϵ E(G). A dominating set D subset of V(G) is called a connected dominating set of a graph G if the subgraph induced by D is connected.
Leomarich F. Casinillo +2 more
doaj +1 more source
Inversion Sequences Avoiding a Triple of Patterns of 3 Letters
An inversion sequence of length $n$ is a sequence of integers $e=e_1\cdots e_n$ which satisfies for each $i\in[n]=\{1,2,\ldots,n\}$ the inequality $0\le e_i < i$. For a set of patterns $P$, we let $\mathbf{I}_n(P)$ denote the set of inversion sequences of length $n$ that avoid all the patterns from~$P$.
David Callan +2 more
openaire +2 more sources
Transforming Proof Tableaux of Hoare Logic into Inference Sequences of Rewriting Induction [PDF]
A proof tableau of Hoare logic is an annotated program with pre- and post-conditions, which corresponds to an inference tree of Hoare logic. In this paper, we show that a proof tableau for partial correctness can be transformed into an inference sequence
Shinnosuke Mizutani, Naoki Nishida
doaj +1 more source
Mismatch and G-stack modulated probe signals on SNP microarrays. [PDF]
BACKGROUND: Single nucleotide polymorphism (SNP) arrays are important tools widely used for genotyping and copy number estimation. This technology utilizes the specific affinity of fragmented DNA for binding to surface-attached oligonucleotide DNA probes.
Hans Binder, Mario Fasold, Torsten Glomb
doaj +1 more source
Bernstein operator of rough I-core of triple sequences
We introduce and study some basic properties of Bernstein-Stancu polynomials of rough I-convergent of triple sequence spaces and also study the set of all Bernstein-Stancu polynomials of rough I-limits of a triple sequence spaces and relation between ...
Ozdemir M. Kemal, Esi Ayhan, Esi Ayten
doaj +1 more source

