✦ LIBER ✦

A simple and efficient BEM algorithm for planar cavity flows

✍ Scribed by L. C. Wrobel

Publisher: John Wiley and Sons
Year: 1992
Tongue: English
Weight: 400 KB
Volume: 14
Category: Article
ISSN: 0271-2091
DOI: 10.1002/fld.1650140503

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Simple efficient algorithm (SEA) for sha

Simple efficient algorithm (SEA) for shallow flows with shock wave on dry and irregular beds

✍ Alireza Zia; Mohamad Ali Banihashemi 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 424 KB

A simple and efficient ABR control algor

A simple and efficient ABR control algorithm for large-scale networks

✍ Ryoichi Kawahara; Toshihisa Ozawa 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 383 KB

A simple and efficient available-bit-rate (ABR) control algorithm is described that fairly allocates bandwidth to each virtual channel (VC) in large-scale networks. In ABR control, the peak cell rate (PCR) and minimum cell rate (MCR) are specified at call set-up, and the cell-emission rate of each V

A simple and efficient algorithm for det

A simple and efficient algorithm for determining the symmetries of polyhedra

✍ X.Y Jiang; H Bunke 📂 Article 📅 1992 🏛 Elsevier Science ⚖ 547 KB

In this paper we present a simple and efficient algorithm for determining the rotational symmetries of polyhedral objects in o(m2) time using O(m) space, where m represents the number of edges of the object. Our algorithm is an extension of Weinberg's algorithm for determining isomorphisms of planar

An extended model and a column generatio

An extended model and a column generation algorithm for the planar multicommodity flow problem

✍ Filipe Alvelos; J. M. Valério de Carvalho 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB

A simple greedy algorithm for finding fu

A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis

✍ Tatsuya Akutsu; Satoru Miyano; Satoru Kuhara 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 186 KB

Inferring functional relations from relational databases is important for the discovery of scientiÿc knowledge because many experimental data are represented in the form of tables and many rules are represented in the form of functions. A simple greedy algorithm has been known as an approximation al

A simple and space-efficient fragment-ch

A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences

✍ B. Morgenstern 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 534 KB

In the segment-based approach to sequence alignment. nucleic acid, and protein sequence alignments are constructed from fragments, i.e., from pairs of ungapped segments of the input sequences. Given a set F of candidate fragments and a weighting function w : F + FL:, the score of an alignment is de