Abstract: New methodologies for XOR-XNOR circuits are
proposed to improve the speed and power as these circuits are basic
building blocks of many arithmetic circuits. This paper evaluates and
compares the performance of various XOR-XNOR circuits. The
performance of the XOR-XNOR circuits based on TSMC 0.18μm
process models at all range of the supply voltage starting from 0.6V
to 3.3V is evaluated by the comparison of the simulation results
obtained from HSPICE. Simulation results reveal that the proposed
circuit exhibit lower PDP and EDP, more power efficient and faster
when compared with best available XOR-XNOR circuits in the
literature.
Abstract: In this paper, we use a one-step iteration scheme to approximate common fixed points of two quasi-asymptotically nonexpansive mappings. We prove weak and strong convergence theorems in a uniformly convex Banach space. Our results generalize the corresponding results of Yao and Chen [15] to a wider class of mappings while extend those of Khan, Abbas and Khan [4] to an improved one-step iteration scheme without any condition and improve upon many others in the literature.
Abstract: Group key management is an important functional
building block for any secure multicast architecture.
Thereby, it has been extensively studied in the literature.
In this paper we present relevant group key management
protocols. Then, we compare them against some pertinent
performance criteria.
Abstract: Research and development R&D work involves
enormous amount of work that has to do with data measurement and
collection. This process evolves as new information is fed, new
technologies are utilized, and eventually new knowledge is created
by the stakeholders i.e., researchers, clients, and end-users. When
new knowledge is created, procedures of R&D work should evolve
and produce better results within improved research skills and
improved methods of data measurements and collection. This
measurement improvement should then be benchmarked against a
metric that should be developed at the organization. In this paper, we
are suggesting a conceptual metric for R&D work performance
improvement (PI) at the Kuwait Institute for Scientific Research
(KISR). This PI is to be measured against a set of variables in the
suggested metric, which are more closely correlated to organizational
output, as opposed to organizational norms. The paper also mentions
and discusses knowledge creation and management as an addedvalue
to R&D work and measurement improvement. The research
methodology followed in this work is qualitative in nature, based on
a survey that was distributed to researchers and interviews held with
senior researchers at KISR. Research and analyses in this paper also
include looking at and analyzing KISR-s literature.
Abstract: Numerical investigation of flow around a square cylinder are presented using the multi-relaxation-time lattice Boltzmann methods at different Reynolds numbers. A detail analysis are given in terms of time-trace analysis of drag and lift coefficients, power spectra analysis of lift coefficient, vorticity contours visualizations, streamlines and phase diagrams. A number of physical quantities mean drag coefficient, drag coefficient, Strouhal number and root-mean-square values of drag and lift coefficients are calculated and compared with the well resolved experimental data and numerical results available in open literature. The Reynolds numbers affected the physical quantities.
Abstract: In this paper, the optimum weight and cost of a laminated composite plate is seeked, while it undergoes the heaviest load prior to a complete failure. Various failure criteria are defined for such structures in the literature. In this work, the Tsai-Hill theory is used as the failure criterion. The theory of analysis was based on the Classical Lamination Theory (CLT). A newly type of Genetic Algorithm (GA) as an optimization technique with a direct use of real variables was employed. Yet, since the optimization via GAs is a long process, and the major time is consumed through the analysis, Radial Basis Function Neural Networks (RBFNN) was employed in predicting the output from the analysis. Thus, the process of optimization will be carried out through a hybrid neuro-GA environment, and the procedure will be carried out until a predicted optimum solution is achieved.
Abstract: The innovation performance of nations has been
repeatedly measured in the literature. We argue that while the
literature offers many suggestions, their theoretical foundation is
often weak and the underlying assumptions are rarely discussed. In
this paper, we systematize various mechanisms by which spatial units
influence nation and firms' innovation activities. On the basis of this,
common innovation performance measures and analyses are
discussed and evaluated. It is concluded that there is no general best
way of measuring the innovation performance of spatial units. In
fact, the most interesting insights can be obtained using a multitude
of different approaches at the same time.
Abstract: Software maintenance and mainly software
comprehension pose the largest costs in the software lifecycle. In
order to assess the cost of software comprehension, various
complexity measures have been proposed in the literature. This paper
proposes new cognitive-spatial complexity measures, which combine
the impact of spatial as well as architectural aspect of the software to
compute the software complexity. The spatial aspect of the software
complexity is taken into account using the lexical distances (in
number of lines of code) between different program elements and the
architectural aspect of the software complexity is taken into
consideration using the cognitive weights of control structures
present in control flow of the program. The proposed measures are
evaluated using standard axiomatic frameworks and then, the
proposed measures are compared with the corresponding existing
cognitive complexity measures as well as the spatial complexity
measures for object-oriented software. This study establishes that the
proposed measures are better indicators of the cognitive effort
required for software comprehension than the other existing
complexity measures for object-oriented software.
Abstract: Sleep stage scoring is the process of classifying the
stage of the sleep in which the subject is in. Sleep is classified into
two states based on the constellation of physiological parameters.
The two states are the non-rapid eye movement (NREM) and the
rapid eye movement (REM). The NREM sleep is also classified into
four stages (1-4). These states and the state wakefulness are
distinguished from each other based on the brain activity. In this
work, a classification method for automated sleep stage scoring
based on a single EEG recording using wavelet packet decomposition
was implemented. Thirty two ploysomnographic recording from the
MIT-BIH database were used for training and validation of the
proposed method. A single EEG recording was extracted and
smoothed using Savitzky-Golay filter. Wavelet packets
decomposition up to the fourth level based on 20th order Daubechies
filter was used to extract features from the EEG signal. A features
vector of 54 features was formed. It was reduced to a size of 25 using
the gain ratio method and fed into a classifier of regression trees. The
regression trees were trained using 67% of the records available. The
records for training were selected based on cross validation of the
records. The remaining of the records was used for testing the
classifier. The overall correct rate of the proposed method was found
to be around 75%, which is acceptable compared to the techniques in
the literature.
Abstract: An alternative iterative computational procedure is
proposed for internal normal ball loads calculation in statically
loaded single-row, angular-contact ball bearings, subjected to a
known thrust load, which is applied in the inner ring at the geometric
bearing center line. An accurate method for curvature radii at
contacts with inner and outer raceways in the direction of the motion
is used. Numerical aspects of the iterative procedure are discussed.
Numerical examples results for a 218 angular-contact ball bearing
have been compared with those from the literature. Twenty figures
are presented showing the geometrical features, the behavior of the
convergence variables and the following parameters as functions of
the thrust load: normal ball loads, contact angle, distance between
curvature centers, and normal ball and axial deflections.
Abstract: In the last decade digital watermarking procedures have
become increasingly applied to implement the copyright protection
of multimedia digital contents distributed on the Internet. To this
end, it is worth noting that a lot of watermarking procedures
for images and videos proposed in literature are based on spread
spectrum techniques. However, some scepticism about the robustness
and security of such watermarking procedures has arisen because
of some documented attacks which claim to render the inserted
watermarks undetectable. On the other hand, web content providers
wish to exploit watermarking procedures characterized by flexible and
efficient implementations and which can be easily integrated in their
existing web services frameworks or platforms. This paper presents
how a simple spread spectrum watermarking procedure for MPEG-2
videos can be modified to be exploited in web contexts. To this end,
the proposed procedure has been made secure and robust against some
well-known and dangerous attacks. Furthermore, its basic scheme
has been optimized by making the insertion procedure adaptive with
respect to the terminals used to open the videos and the network transactions
carried out to deliver them to buyers. Finally, two different
implementations of the procedure have been developed: the former
is a high performance parallel implementation, whereas the latter is
a portable Java and XML based implementation. Thus, the paper
demonstrates that a simple spread spectrum watermarking procedure,
with limited and appropriate modifications to the embedding scheme,
can still represent a valid alternative to many other well-known and
more recent watermarking procedures proposed in literature.
Abstract: In this study Homotopy Perturbation Method (HPM) is employed to investigate free vibration of an Euler beam with variable stiffness resting on an elastic foundation. HPM is an easy-to-use and very efficient technique for the solution of linear or nonlinear problems. HPM produces analytical approximate expression which is continuous in the solution domain. This work shows that HPM is a promising method for free vibration analysis of nonuniform Euler beams on elastic foundation. Several case problems have been solved by using the technique and solutions have been compared with those available in the literature.
Abstract: Case-Based Reasoning (CBR) is one of machine
learning algorithms for problem solving and learning that caught a lot
of attention over the last few years. In general, CBR is composed of
four main phases: retrieve the most similar case or cases, reuse the
case to solve the problem, revise or adapt the proposed solution, and
retain the learned cases before returning them to the case base for
learning purpose. Unfortunately, in many cases, this retain process
causes the uncontrolled case base growth. The problem affects
competence and performance of CBR systems. This paper proposes
competence-based maintenance method based on deletion policy
strategy for CBR. There are three main steps in this method. Step 1,
formulate problems. Step 2, determine coverage and reachability set
based on coverage value. Step 3, reduce case base size. The results
obtained show that this proposed method performs better than the
existing methods currently discussed in literature.
Abstract: This paper proposes the novel model order
formulation scheme to design a discrete PID controller for higher
order linear time invariant discrete systems. Modified PSO (MPSO)
based model order formulation technique has used to obtain the
successful formulated second order system. PID controller is tuned to
meet the desired performance specification by using pole-zero
cancellation and proposed design procedures. Proposed PID
controller is attached with both higher order system and formulated
second order system. System specifications are tabulated and closed
loop response is observed for stabilization process. The proposed
method is illustrated through numerical examples from literature.
Abstract: In this work, simulation algorithms for contact drying
of agitated particulate materials under vacuum and at atmospheric
pressure were developed. The implementation of algorithms gives a
predictive estimation of drying rate curves and bulk bed temperature
during contact drying. The calculations are based on the penetration
model to describe the drying process, where all process parameters
such as heat and mass transfer coefficients, effective bed properties,
gas and liquid phase properties are estimated with proper
correlations. Simulation results were compared with experimental
data from the literature. In both cases, simulation results were in good
agreement with experimental data. Few deviations were identified
and the limitations of the predictive capabilities of the models are
discussed. The programs give a good insight of the drying behaviour
of the analysed powders.
Abstract: Covering-based rough sets is an extension of rough
sets and it is based on a covering instead of a partition of the
universe. Therefore it is more powerful in describing some practical
problems than rough sets. However, by extending the rough sets,
covering-based rough sets can increase the roughness of each model
in recognizing objects. How to obtain better approximations from
the models of a covering-based rough sets is an important issue.
In this paper, two concepts, determinate elements and indeterminate
elements in a universe, are proposed and given precise definitions
respectively. This research makes a reasonable refinement of the
covering-element from a new viewpoint. And the refinement may
generate better approximations of covering-based rough sets models.
To prove the theory above, it is applied to eight major coveringbased
rough sets models which are adapted from other literature.
The result is, in all these models, the lower approximation increases
effectively. Correspondingly, in all models, the upper approximation
decreases with exceptions of two models in some special situations.
Therefore, the roughness of recognizing objects is reduced. This
research provides a new approach to the study and application of
covering-based rough sets.
Abstract: In this paper, an innovative watermarking scheme for audio signal based on genetic algorithms (GA) in the discrete wavelet transforms is proposed. It is robust against watermarking attacks, which are commonly employed in literature. In addition, the watermarked image quality is also considered. We employ GA for the optimal localization and intensity of watermark. The watermark detection process can be performed without using the original audio signal. The experimental results demonstrate that watermark is inaudible and robust to many digital signal processing, such as cropping, low pass filter, additive noise.
Abstract: The aerodynamic noise radiation from a side view mirror (SVM) in the high-speed airflow is calculated by the combination of unsteady incompressible fluid flow analysis and acoustic analysis. The transient flow past the generic SVM is simulated with variable turbulence model, namely DES Detached Eddy Simulation and LES (Large Eddy Simulation). Detailed velocity vectors and contour plots of the time-varying velocity and pressure fields are presented along cut planes in the flow-field. Mean and transient pressure are also monitored at several points in the flow field and compared to corresponding experimentally data published in literature. The acoustic predictions made using the Ffowcs-Williams-Hawkins acoustic analogy (FW-H) and the boundary element (BEM).
Abstract: Although the World Wide Web is considered the
largest source of information there exists nowadays, due to its
inherent dynamic characteristics, the task of finding useful and
qualified information can become a very frustrating experience. This
study presents a research on the information mining systems in the
Web; and proposes an implementation of these systems by means of
components that can be built using the technology of Web services.
This implies that they can encompass features offered by a services
oriented architecture (SOA) and specific components may be used by
other tools, independent of platforms or programming languages.
Hence, the main objective of this work is to provide an architecture
to Web mining systems, divided into stages, where each step is a
component that will incorporate the characteristics of SOA. The
separation of these steps was designed based upon the existing
literature. Interesting results were obtained and are shown here.
Abstract: This paper proposes a genetic algorithm based on a
new replacement strategy to solve the quadratic assignment problems,
which are NP-hard. The new replacement strategy aims to improve the
performance of the genetic algorithm through well balancing the
convergence of the searching process and the diversity of the
population. In order to test the performance of the algorithm, the
instances in QAPLIB, a quadratic assignment problem library, are
tried and the results are compared with those reported in the literature.
The performance of the genetic algorithm is promising. The
significance is that this genetic algorithm is generic. It does not rely on
problem-specific genetic operators, and may be easily applied to
various types of combinatorial problems.