Natural fibres such as jute were the forerunners of the man-made fibres used for centuries for making ropes and formanufacturing burlaps, sacks, hessian and carpet backing. But the use of jute products in civil engineering is relativelywidespread for such purposes as sand-bags for concrete curing, soil enrichment and protection. This research is concerned with the stabilization of fine sand usi...

We study the efficiency of large file streaming in a peer-to-peer network in which a large file is cut into many pieces of equal size, and initially all pieces are known only by one source node. We analyze the number of rounds required, called the finishing time, for all nodes in the network to collect all pieces in the default order. Based on the basic PUSH-PULL protocol, we design the Constan...

This study was undertaken to determine the quality of packaged fresh cut cantaloupe subjected to transport vibration after treating with various anti-browning agents. Cantaloupe (Cucumis melo) pieces were dipped in two anti-browning solutions: Treat­ ment-A (2% ascorbic acid + 1% calcium chloride + 0.5% citric acid) and Treatment-B (3% NatureSealTM) for 2 minutes and packaged in bio-based clams...

Jigsaw puzzles [9] and edge-matching puzzles [5] are two ancient types of puzzle, going back to the 1760s and 1890s, respectively. Jigsaw puzzles involve fitting together a given set of pieces (usually via translation and rotation) into a desired shape (usually a rectangle), often revealing a known image or pattern. The pieces are typically squares with a pocket cut out of or a tab attached to ...

Graph partitioning divides a graph into several pieces by cutting edges. The graph partitioning problem is to divide so that the number of vertices in each piece is the same within some defined tolerance and the number of cut edges separating these pieces is minimised. Important examples of the problem arise in partitioning graphs known as meshes for the parallel execution of computational mech...

Graph partitioning divides a graph into several pieces by cutting edges. The graph partitioning problem is to divide so that the number of vertices in each piece is the same within some defined tolerance and the number of cut edges separating these pieces is minimised. Important examples of the problem arise in partitioning graphs known as meshes for the parallel execution of computational mech...

The Horizontal Chord Theorem states that if a continuous curve connects points A and B in the plane, then for any integer k there are points C and D on the curve such that −−→ AB = k −−→ CD. In this note, we discuss a few combinatorial-analysis problems related to this theorem and introduce a different formulation that gives way to generalizations on graphs. 1 THE NECKLACE OF PEARLS PROBLEM. Tw...

In this publication, we have developed a simple and quick isolation method of stem cells from the umbilical cord. Usually, cord is waste product during child delivery procedure, but cords contain valuable called mesenchymal stroma (also MSCs), which can be basis for different applications e.g., testing effect therapeutic compounds as well development cure degenerative diseases like bone cartila...