Abstract: Petroleum refineries discharged large amount of
wastewater -during the refining process- that contains hazardous
constituents that is hard to degrade. Anaerobic treatment process is
well known as an efficient method to degrade high strength
wastewaters. Up-flow Anaerobic Sludge Blanker (UASB) is a
common process used for various wastewater treatments. Two UASB
reactors were set up and operated in parallel to evaluate the treatment
efficiency of petroleum refinery wastewater. In this study four
organic volumetric loading rates were applied (i.e. 0.58, 0.89, 1.21
and 2.34 kg/m3·d), two loads to each reactor. Each load was applied
for a period of 60 days for the reactor to acclimatize and reach steady
state, and then the second load applied. The chemical oxygen demand
(COD) removals were satisfactory with the removal efficiencies at the
loadings applied were 78, 82, 83 and 81 % respectively.
Abstract: This paper proposed a stiffness analysis method for a
3-PRS mechanism for welding thick aluminum plate using FSW
technology. In the molding process, elastic deformation of lead-screws
and links are taken into account. This method is based on the virtual
work principle. Through a survey of the commonly used stiffness
performance indices, the minimum and maximum eigenvalues of the
stiffness matrix are used to evaluate the stiffness of the 3-PRS
mechanism. Furthermore, A FEA model has been constructed to verify
the method. Finally, we redefined the workspace using the stiffness
analysis method.
Abstract: We report on the development of a model to
understand why the range of experience with respect to HIV
infection is so diverse, especially with respect to the latency period.
To investigate this, an agent-based approach is used to extract highlevel
behaviour which cannot be described analytically from the set
of interaction rules at the cellular level. A network of independent
matrices mimics the chain of lymph nodes. Dealing with massively
multi-agent systems requires major computational effort. However,
parallelisation methods are a natural consequence and advantage of
the multi-agent approach and, using the MPI library, are here
implemented, tested and optimized. Our current focus is on the
various implementations of the data transfer across the network.
Three communications strategies are proposed and tested, showing
that the most efficient approach is communication based on the
natural lymph-network connectivity.
Abstract: The paper proposes a way of parallel processing of
SURF and Optical Flow for moving object recognition and tracking.
The object recognition and tracking is one of the most important task
in computer vision, however disadvantage are many operations cause
processing speed slower so that it can-t do real-time object recognition
and tracking. The proposed method uses a typical way of feature
extraction SURF and moving object Optical Flow for reduce
disadvantage and real-time moving object recognition and tracking,
and parallel processing techniques for speed improvement. First
analyse that an image from DB and acquired through the camera using
SURF for compared to the same object recognition then set ROI
(Region of Interest) for tracking movement of feature points using
Optical Flow. Secondly, using Multi-Thread is for improved
processing speed and recognition by parallel processing. Finally,
performance is evaluated and verified efficiency of algorithm
throughout the experiment.
Abstract: This paper proposes a low-cost reconfigurable
architecture for AES algorithm. The proposed architecture separates
SubBytes and MixColumns into two parallel data path, and supports
different bit-width operation for this two data path. As a result, different number of S-box can be supported in this architecture. The
throughput and power consumption can be adjusted by changing the
number of S-box running in this design. Using the TSMC 0.18μm CMOS standard cell library, a very low-cost implementation of 7K
Gates is obtained under 182MHz frequency. The maximum throughput is 360Mbps while using 4 S-Box simultaneously, and the
minimum throughput is 114Mbps while only using 1 S-Box
Abstract: The term Enterprise 2.0 (E2.0) describes a collection of organizational and IT practices that help organizations establish flexible work models, visible knowledge-sharing practices, and higher levels of community participation. E2.0 parallels and builds on another term commonly being used in the industry – Web 2.0. E2.0 represents also new packaging for strategic collaboration and Knowledge Management (KM). Organizations rely on collaboration and KM initiatives to attain innovation, growth, productivity, and performance goals.
Abstract: In this paper, a new technique for fast painting with
different colors is presented. The idea of painting relies on applying
masks with different colors to the background. Fast painting is
achieved by applying these masks in the frequency domain instead of
spatial (time) domain. New colors can be generated automatically as a
result from the cross correlation operation. This idea was applied
successfully for faster specific data (face, object, pattern, and code)
detection using neural algorithms. Here, instead of performing cross
correlation between the input input data (e.g., image, or a stream of
sequential data) and the weights of neural networks, the cross
correlation is performed between the colored masks and the
background. Furthermore, this approach is developed to reduce the
computation steps required by the painting operation. The principle of
divide and conquer strategy is applied through background
decomposition. Each background is divided into small in size subbackgrounds
and then each sub-background is processed separately by
using a single faster painting algorithm. Moreover, the fastest painting
is achieved by using parallel processing techniques to paint the
resulting sub-backgrounds using the same number of faster painting
algorithms. In contrast to using only faster painting algorithm, the
speed up ratio is increased with the size of the background when using
faster painting algorithm and background decomposition. Simulation
results show that painting in the frequency domain is faster than that in
the spatial domain.
Abstract: Fair share objective has been included into the goaloriented
parallel computer job scheduling policy recently. However,
the previous work only presented the overall scheduling performance.
Thus, the per-user performance of the policy is still lacking. In this
work, the details of per-user fair share performance under the
Tradeoff-fs(Tx:avgX) policy will be further evaluated. A basic fair
share priority backfill policy namely RelShare(1d) is also studied.
The performance of all policies is collected using an event-driven
simulator with three real job traces as input. The experimental results
show that the high demand users are usually benefited under most
policies because their jobs are large or they have a lot of jobs. In the
large job case, one job executed may result in over-share during that
period. In the other case, the jobs may be backfilled for
performances. However, the users with a mixture of jobs may suffer
because if the smaller jobs are executing the priority of the remaining
jobs from the same user will be lower. Further analysis does not show
any significant impact of users with a lot of jobs or users with a large
runtime approximation error.