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: 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: A study was carried out to determine the effect of water quality on flotation performance. The experimental test work comprised of batch flotation tests using Denver lab cell for a period of 10 minutes. Nine different test runs were carried out in triplicates to ensure reproducibility using different water types from different thickener overflows, return and sewage effluent water (process water) and portable water. The water sources differed in pH, total dissolved solids, total suspended solids and conductivity. Process water was found to reduce the concentrate recovery and mass pull, while portable water increased the concentrate recovery and mass pull. Portable water reduced the concentrate grade while process water increased the concentrate grade. It is proposed that a combination of process water and portable water supply be used in flotation circuits to balance the different effects that the different water types have on the flotation efficiency.
Abstract: Modern spatial database management systems require a unique Spatial Access Method (SAM) in order solve complex spatial quires efficiently. In this case the spatial data structure takes a prominent place in the SAM. Inadequate data structure leads forming poor algorithmic choices and forging deficient understandings of algorithm behavior on the spatial database. A key step in developing a better semantic spatial object data structure is to quantify the performance effects of semantic and outlier detections that are not reflected in the previous tree structures (R-Tree and its variants). This paper explores a novel SSRO-Tree on SAM to the Topo-Semantic approach. The paper shows how to identify and handle the semantic spatial objects with outlier objects during page overflow/underflow, using gain/loss metrics. We introduce a new SSRO-Tree algorithm which facilitates the achievement of better performance in practice over algorithms that are superior in the R*-Tree and RO-Tree by considering selection queries.
Abstract: This paper proposes a fast tree join scheme to provide
seamless multicast handover in the mobile networks based on the Fast
Mobile IPv6 (FMIPv6). In the existing FMIPv6-based multicast
handover scheme, the bi-directional tunnelling or the remote
subscription is employed with the packet forwarding from the previous
access router (AR) to the new AR. In general, the remote subscription
approach is preferred to the bi-directional tunnelling one, since in the
remote subscription scheme we can exploit an optimized multicast
path from a multicast source to many mobile receivers. However, in
the remote subscription scheme, if the tree joining operation takes a
long time, the amount of data packets to be forwarded and buffered for
multicast handover will increase, and thus the corresponding buffer
may overflow, which results in severe packet losses. In order to reduce
these costs associated with packet forwarding and buffering, this paper
proposes the fast join to multicast tree, in which the new AR will join
the multicast tree as fast as possible, so that the new multicast data
packets can also arrive at the new AR, by which the packet forwarding
and buffering costs can be reduced. From numerical analysis, it is
shown that the proposed scheme can give better performance than the
existing FMIPv6-based multicast handover schemes in terms of the
multicast packet delivery costs.
Abstract: This paper presents design trade-off and performance impacts of
the amount of pipeline phase of control path signals in a wormhole-switched
network-on-chip (NoC). The numbers of the pipeline phase of the control
path vary between two- and one-cycle pipeline phase. The control paths
consist of the routing request paths for output selection and the arbitration
paths for input selection. Data communications between on-chip routers are
implemented synchronously and for quality of service, the inter-router data
transports are controlled by using a link-level congestion control to avoid
lose of data because of an overflow. The trade-off between the area (logic
cell area) and the performance (bandwidth gain) of two proposed NoC router
microarchitectures are presented in this paper. The performance evaluation is
made by using a traffic scenario with different number of workloads under
2D mesh NoC topology using a static routing algorithm. By using a 130-nm
CMOS standard-cell technology, our NoC routers can be clocked at 1 GHz,
resulting in a high speed network link and high router bandwidth capacity
of about 320 Gbit/s. Based on our experiments, the amount of control path
pipeline stages gives more significant impact on the NoC performance than
the impact on the logic area of the NoC router.
Abstract: This paper provides a flexible way of controlling
Variable-Bit-Rate (VBR) of compressed digital video, applicable to
the new H264 video compression standard. The entire video
sequence is assessed in advance and the quantisation level is then set
such that bit rate (and thus the frame rate) remains within
predetermined limits compatible with the bandwidth of the
transmission system and the capabilities of the remote end, while at
the same time providing constant quality similar to VBR encoding.
A process for avoiding buffer starvation by selectively eliminating
frames from the encoded output at times when the frame rate is slow
(large number of bits per frame) will be also described. Finally, the
problem of buffer overflow will be solved by selectively eliminating
frames from the received input to the decoder. The decoder detects
the omission of the frames and resynchronizes the transmission by
monitoring time stamps and repeating frames if necessary.
Abstract: The use of buffer thresholds, blocking and adequate
service strategies are well-known techniques for computer networks
traffic congestion control. This motivates the study of series queues
with blocking, feedback (service under Head of Line (HoL) priority
discipline) and finite capacity buffers with thresholds. In this paper,
the external traffic is modelled using the Poisson process and the
service times have been modelled using the exponential distribution.
We consider a three-station network with two finite buffers, for
which a set of thresholds (tm1 and tm2) is defined. This computer
network behaves as follows. A task, which finishes its service at
station B, gets sent back to station A for re-processing with
probability o. When the number of tasks in the second buffer exceeds
a threshold tm2 and the number of task in the first buffer is less than
tm1, the fed back task is served under HoL priority discipline. In
opposite case, for fed backed tasks, “no two priority services in
succession" procedure (preventing a possible overflow in the first
buffer) is applied. Using an open Markovian queuing schema with
blocking, priority feedback service and thresholds, a closed form
cost-effective analytical solution is obtained. The model of servers
linked in series is very accurate. It is derived directly from a twodimensional
state graph and a set of steady-state equations, followed
by calculations of main measures of effectiveness. Consequently,
efficient expressions of the low computational cost are determined.
Based on numerical experiments and collected results we conclude
that the proposed model with blocking, feedback and thresholds can
provide accurate performance estimates of linked in series networks.
Abstract: The paper shows that in the analysis of a queuing system with fixed-size batch arrivals, there emerges a set of polynomials which are a generalization of Chebyshev polynomials of the second kind. The paper uses these polynomials in assessing the transient behaviour of the overflow (equivalently call blocking) probability in the system. A key figure to note is the proportion of the overflow (or blocking) probability resident in the transient component, which is shown in the results to be more significant at the beginning of the transient and naturally decays to zero in the limit of large t. The results also show that the significance of transients is more pronounced in cases of lighter loads, but lasts longer for heavier loads.
Abstract: A feed-forward, back-propagation Artificial Neural
Network (ANN) model has been used to forecast the occurrences of
wastewater overflows in a combined sewerage reticulation system.
This approach was tested to evaluate its applicability as a method
alternative to the common practice of developing a complete
conceptual, mathematical hydrological-hydraulic model for the
sewerage system to enable such forecasts. The ANN approach
obviates the need for a-priori understanding and representation of the
underlying hydrological hydraulic phenomena in mathematical terms
but enables learning the characteristics of a sewer overflow from the
historical data.
The performance of the standard feed-forward, back-propagation
of error algorithm was enhanced by a modified data normalizing
technique that enabled the ANN model to extrapolate into the
territory that was unseen by the training data. The algorithm and the
data normalizing method are presented along with the ANN model
output results that indicate a good accuracy in the forecasted sewer
overflow rates. However, it was revealed that the accurate
forecasting of the overflow rates are heavily dependent on the
availability of a real-time flow monitoring at the overflow structure
to provide antecedent flow rate data. The ability of the ANN to
forecast the overflow rates without the antecedent flow rates (as is
the case with traditional conceptual reticulation models) was found to
be quite poor.
Abstract: Social media has led to paradigm shifts in ways
people work and do business, interact and socialize, learn and obtain
knowledge. So much so that social media has established itself as an
important spatial extension of this nation-s historicity and challenges.
Regardless of the enabling reputation and recommendation features
through social networks embedded in the social media system, the
overflow of broadcasted and publicized media contents turns the
table around from engendering trust to doubting the trust system.
When the trust is at doubt, the effects include deactivation of
accounts and creation of multiple profiles, which lead to the overflow
of 'ghost' contents (i.e. “the abundance of abandoned ships"). In
most literature, the study of trust can be related to culture; hence the
difference between Western-s “openness" and Eastern-s “blue-chip"
concepts in networking and relationships. From a survey on issues
and challenges among Malaysian social media users, 'authenticity'
emerges as one of the main factors that causes and is caused by other
factors. The other issue that has surfaced is credibility either in terms
of message/content and source. Another is the quality of the
knowledge that is shared. This paper explores the terrains of this
critical space which in recent years has been dominated increasingly
by, arguably, social networks embedded in the social media system,
the overflow of broadcasted and publicized media content.
Abstract: In this paper, we propose a high capacity image hiding
technology based on pixel prediction and the difference of modified histogram. This approach is used the pixel prediction and the
difference of modified histogram to calculate the best embedding point.
This approach can improve the predictive accuracy and increase the pixel difference to advance the hiding capacity. We also use the
histogram modification to prevent the overflow and underflow. Experimental results demonstrate that our proposed method within the
same average hiding capacity can still keep high quality of image and low distortion