Abstract: The laboratory tests for measuring the effects of small strain to the shear strength and maximum stiffness development of post-cyclic degradation of hemic peat are reviewed in this paper. A series of laboratory testing has been conducted to fulfil the objective of this research to study the post-cyclic behaviour of peat soil and focuses on the small strain characteristics. For this purpose, a number of strain-controlled static, cyclic and post-cyclic triaxial tests were carried out in undrained condition on hemic peat soil. The shear strength and maximum stiffness of hemic peat are evaluated immediately after post-cyclic monotonic testing. There are two soil samples taken from West Johor and East Malaysia peat soil. Based on these laboratories and field testing data, it was found that the shear strength and maximum stiffness of peat soil decreased in post-cyclic monotonic loading than its initial shear strength and stiffness. In particular, degradation in shear strength and stiffness is more sensitive for peat soil due to fragile and uniform fibre structures. Shear strength of peat soil, τmax = 12.53 kPa (Beaufort peat, BFpt) and 36.61 kPa (Parit Nipah peat, PNpt) decreased than its initial 58.46 kPa and 91.67 kPa. The maximum stiffness, Gmax = 0.23 and 0.25 decreased markedly with post-cyclic, Gmax = 0.04 and 0.09. Simple correlations between the Gmax and the τmax effects due to small strain, ε = 0.1, the Gmax values for post-cyclic are relatively low compared to its initial Gmax. As a consequence, the reported values and patterns of both the West Johor and East Malaysia peat soil are generally the same.
Abstract: This paper proposes an efficient finite precision block floating point (BFP) treatment to the fixed coefficient finite impulse response (FIR) digital filter. The treatment includes effective implementation of all the three forms of the conventional FIR filters, namely, direct form, cascaded and par- allel, and a roundoff error analysis of them in the BFP format. An effective block formatting algorithm together with an adaptive scaling factor is pro- posed to make the realizations more simple from hardware view point. To this end, a generic relation between the tap weight vector length and the input block length is deduced. The implementation scheme also emphasises on a simple block exponent update technique to prevent overflow even during the block to block transition phase. The roundoff noise is also investigated along the analogous lines, taking into consideration these implementational issues. The simulation results show that the BFP roundoff errors depend on the sig- nal level almost in the same way as floating point roundoff noise, resulting in approximately constant signal to noise ratio over a relatively large dynamic range.
Abstract: In this paper, the babbitting of a bearing in boiler feed pump of an electromotor has been studied. These bearings have an important role in reducing the shut down times in the pumps, compressors and turbines. The most conventional method in babbitting is casting as a melting method. The comparison between thermal spray and casting methods in babbitting shows that the thermal spraying babbitt layer has better performance and tribological behavior. The metallurgical and tribological analysis such as SEM, EDS and wet chemical analysis has been made in the Babbitt alloys and worn surfaces. Two type of babbitt materials: tinbase and lead-base babbitt was used. The benefits of thermally sprayed babbitt layers are completely clear especially in large bearings.
Abstract: we propose a new normalized LMS (NLMS) algorithm, which gives satisfactory performance in certain applications in comaprison with con-ventional NLMS recursion. This new algorithm can be treated as a block based simplification of NLMS algorithm with significantly reduced number of multi¬ply and accumulate as well as division operations. It is also shown that such a recursion can be easily implemented in block floating point (BFP) arithmetic, treating the implementational issues much efficiently. In particular, the core challenges of a BFP realization to such adaptive filters are mainly considered in this regard. A global upper bound on the step size control parameter of the new algorithm due to BFP implementation is also proposed to prevent overflow in filtering as well as weight updating operations jointly.
Abstract: Generalized Center String (GCS) problem are
generalized from Common Approximate Substring problem
and Common substring problems. GCS are known to be
NP-hard allowing the problems lies in the explosion of
potential candidates. Finding longest center string without
concerning the sequence that may not contain any motifs is
not known in advance in any particular biological gene
process. GCS solved by frequent pattern-mining techniques
and known to be fixed parameter tractable based on the
fixed input sequence length and symbol set size. Efficient
method known as Bpriori algorithms can solve GCS with
reasonable time/space complexities. Bpriori 2 and Bpriori
3-2 algorithm are been proposed of any length and any
positions of all their instances in input sequences. In this
paper, we reduced the time/space complexity of Bpriori
algorithm by Constrained Based Frequent Pattern mining
(CBFP) technique which integrates the idea of Constraint
Based Mining and FP-tree mining. CBFP mining technique
solves the GCS problem works for all center string of any
length, but also for the positions of all their mutated copies
of input sequence. CBFP mining technique construct TRIE
like with FP tree to represent the mutated copies of center
string of any length, along with constraints to restraint
growth of the consensus tree. The complexity analysis for
Constrained Based FP mining technique and Bpriori
algorithm is done based on the worst case and average case
approach. Algorithm's correctness compared with the
Bpriori algorithm using artificial data is shown.