One of the most significant challenges in Computing Determinant of Rectangular Matrices is high time
complexity of its algorithm. Among all definitions of determinant of rectangular matrices, Radic’s
definition has special features which make it more notable. But in this definition, C(N
M
) sub matrices of the
order m×m needed to be generated that put this problem in np-hard class. On the other hand, any row or
column reduction operation may hardly lead to diminish the volume of calculation. Therefore, in this paper
we try to present the parallel algorithm which can decrease the time complexity of computing the
determinant of non-square matrices to O(N).
Contradictory of the Laplacian Smoothing Transform and Linear Discriminant An...TELKOMNIKA JOURNAL
Laplacian smoothing transform uses the negative diagonal element to generate the new space. The negative diagonal elements will deliver the negative new spaces. The negative new spaces will cause decreasing of the dominant characteristics. Laplacian smoothing transform usually singular matrix, such that the matrix cannot be solved to obtain the ordered-eigenvalues and corresponding eigenvectors. In this research, we propose a modeling to generate the positive diagonal elements to obtain the positive new spaces. The secondly, we propose approach to overcome singularity matrix to found eigenvalues and eigenvectors. Firstly, the method is started to calculate contradictory of the laplacian smoothing matrix. Secondly, we calculate the new space modeling on the contradictory of the laplacian smoothing. Moreover, we calculate eigenvectors of the discriminant analysis. Fourth, we calculate the new space modeling on the discriminant analysis, select and merge features. The proposed method has been tested by using four databases, i.e. ORL, YALE, UoB, and local database (CAI-UTM). Overall, the results indicate that the proposed method can overcome two problems and deliver higher accuracy than similar methods.
Computer Science
Active and Programmable Networks
Active safety systems
Ad Hoc & Sensor Network
Ad hoc networks for pervasive communications
Adaptive, autonomic and context-aware computing
Advance Computing technology and their application
Advanced Computing Architectures and New Programming Models
Advanced control and measurement
Aeronautical Engineering,
Agent-based middleware
Alert applications
Automotive, marine and aero-space control and all other control applications
Autonomic and self-managing middleware
Autonomous vehicle
Biochemistry
Bioinformatics
BioTechnology(Chemistry, Mathematics, Statistics, Geology)
Broadband and intelligent networks
Broadband wireless technologies
CAD/CAM/CAT/CIM
Call admission and flow/congestion control
Capacity planning and dimensioning
Changing Access to Patient Information
Channel capacity modelling and analysis
Civil Engineering,
Cloud Computing and Applications
Collaborative applications
Communication application
Communication architectures for pervasive computing
Communication systems
Computational intelligence
Computer and microprocessor-based control
Computer Architecture and Embedded Systems
Computer Business
Computer Sciences and Applications
Computer Vision
Computer-based information systems in health care
Computing Ethics
Computing Practices & Applications
Congestion and/or Flow Control
Content Distribution
Context-awareness and middleware
Creativity in Internet management and retailing
Cross-layer design and Physical layer based issue
Cryptography
Data Base Management
Data fusion
Data Mining
Data retrieval
Data Storage Management
Decision analysis methods
Decision making
Digital Economy and Digital Divide
Digital signal processing theory
Distributed Sensor Networks
Drives automation
Drug Design,
Drug Development
DSP implementation
E-Business
E-Commerce
E-Government
Electronic transceiver device for Retail Marketing Industries
Electronics Engineering,
Embeded Computer System
Emerging advances in business and its applications
Emerging signal processing areas
Enabling technologies for pervasive systems
Energy-efficient and green pervasive computing
Environmental Engineering,
Estimation and identification techniques
Evaluation techniques for middleware solutions
Event-based, publish/subscribe, and message-oriented middleware
Evolutionary computing and intelligent systems
Expert approaches
Facilities planning and management
Flexible manufacturing systems
Formal methods and tools for designing
Fuzzy algorithms
Fuzzy logics
GPS and location-based app
Scilab Finite element solver for stationary and incompressible navier-stokes ...Scilab
In this paper we show how Scilab can be used to solve Navier-stokes equations, for the incompressible and stationary planar flow. Three examples have been presented and some comparisons with reference solutions are provided.
In this paper generation of binary sequences derived from chaotic sequences defined over Z4 is proposed.
The six chaotic map equations considered in this paper are Logistic map, Tent Map, Cubic Map, Quadratic
Map and Bernoulli Map. Using these chaotic map equations, sequences over Z4 are generated which are
converted to binary sequences using polynomial mapping. Segments of sequences of different lengths are
tested for cross correlation and linear complexity properties. It is found that some segments of different
length of these sequences have good cross correlation and linear complexity properties. The Bit Error Rate
performance in DS-CDMA communication systems using these binary sequences is found to be better than
Gold sequences and Kasami sequences.
Contradictory of the Laplacian Smoothing Transform and Linear Discriminant An...TELKOMNIKA JOURNAL
Laplacian smoothing transform uses the negative diagonal element to generate the new space. The negative diagonal elements will deliver the negative new spaces. The negative new spaces will cause decreasing of the dominant characteristics. Laplacian smoothing transform usually singular matrix, such that the matrix cannot be solved to obtain the ordered-eigenvalues and corresponding eigenvectors. In this research, we propose a modeling to generate the positive diagonal elements to obtain the positive new spaces. The secondly, we propose approach to overcome singularity matrix to found eigenvalues and eigenvectors. Firstly, the method is started to calculate contradictory of the laplacian smoothing matrix. Secondly, we calculate the new space modeling on the contradictory of the laplacian smoothing. Moreover, we calculate eigenvectors of the discriminant analysis. Fourth, we calculate the new space modeling on the discriminant analysis, select and merge features. The proposed method has been tested by using four databases, i.e. ORL, YALE, UoB, and local database (CAI-UTM). Overall, the results indicate that the proposed method can overcome two problems and deliver higher accuracy than similar methods.
Computer Science
Active and Programmable Networks
Active safety systems
Ad Hoc & Sensor Network
Ad hoc networks for pervasive communications
Adaptive, autonomic and context-aware computing
Advance Computing technology and their application
Advanced Computing Architectures and New Programming Models
Advanced control and measurement
Aeronautical Engineering,
Agent-based middleware
Alert applications
Automotive, marine and aero-space control and all other control applications
Autonomic and self-managing middleware
Autonomous vehicle
Biochemistry
Bioinformatics
BioTechnology(Chemistry, Mathematics, Statistics, Geology)
Broadband and intelligent networks
Broadband wireless technologies
CAD/CAM/CAT/CIM
Call admission and flow/congestion control
Capacity planning and dimensioning
Changing Access to Patient Information
Channel capacity modelling and analysis
Civil Engineering,
Cloud Computing and Applications
Collaborative applications
Communication application
Communication architectures for pervasive computing
Communication systems
Computational intelligence
Computer and microprocessor-based control
Computer Architecture and Embedded Systems
Computer Business
Computer Sciences and Applications
Computer Vision
Computer-based information systems in health care
Computing Ethics
Computing Practices & Applications
Congestion and/or Flow Control
Content Distribution
Context-awareness and middleware
Creativity in Internet management and retailing
Cross-layer design and Physical layer based issue
Cryptography
Data Base Management
Data fusion
Data Mining
Data retrieval
Data Storage Management
Decision analysis methods
Decision making
Digital Economy and Digital Divide
Digital signal processing theory
Distributed Sensor Networks
Drives automation
Drug Design,
Drug Development
DSP implementation
E-Business
E-Commerce
E-Government
Electronic transceiver device for Retail Marketing Industries
Electronics Engineering,
Embeded Computer System
Emerging advances in business and its applications
Emerging signal processing areas
Enabling technologies for pervasive systems
Energy-efficient and green pervasive computing
Environmental Engineering,
Estimation and identification techniques
Evaluation techniques for middleware solutions
Event-based, publish/subscribe, and message-oriented middleware
Evolutionary computing and intelligent systems
Expert approaches
Facilities planning and management
Flexible manufacturing systems
Formal methods and tools for designing
Fuzzy algorithms
Fuzzy logics
GPS and location-based app
Scilab Finite element solver for stationary and incompressible navier-stokes ...Scilab
In this paper we show how Scilab can be used to solve Navier-stokes equations, for the incompressible and stationary planar flow. Three examples have been presented and some comparisons with reference solutions are provided.
In this paper generation of binary sequences derived from chaotic sequences defined over Z4 is proposed.
The six chaotic map equations considered in this paper are Logistic map, Tent Map, Cubic Map, Quadratic
Map and Bernoulli Map. Using these chaotic map equations, sequences over Z4 are generated which are
converted to binary sequences using polynomial mapping. Segments of sequences of different lengths are
tested for cross correlation and linear complexity properties. It is found that some segments of different
length of these sequences have good cross correlation and linear complexity properties. The Bit Error Rate
performance in DS-CDMA communication systems using these binary sequences is found to be better than
Gold sequences and Kasami sequences.
Second or fourth-order finite difference operators, which one is most effective?Premier Publishers
This paper presents higher-order finite difference (FD) formulas for the spatial approximation of the time-dependent reaction-diffusion problems with a clear justification through examples, “why fourth-order FD formula is preferred to its second-order counterpart” that has been widely used in literature. As a consequence, methods for the solution of initial and boundary value PDEs, such as the method of lines (MOL), is of broad interest in science and engineering. This procedure begins with discretizing the spatial derivatives in the PDE with algebraic approximations. The key idea of MOL is to replace the spatial derivatives in the PDE with the algebraic approximations. Once this procedure is done, the spatial derivatives are no longer stated explicitly in terms of the spatial independent variables. In other words, only one independent variable is remaining, the resulting semi-discrete problem has now become a system of coupled ordinary differential equations (ODEs) in time. Thus, we can apply any integration algorithm for the initial value ODEs to compute an approximate numerical solution to the PDE. Analysis of the basic properties of these schemes such as the order of accuracy, convergence, consistency, stability and symmetry are well examined.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Analytical and Exact solutions of a certain class of coupled nonlinear PDEs u...IJERA Editor
The purpose of this study is to introduce a modification of the Adomian decomposition method using Pad´e approximation and Laplace transform to obtain a closed form of the solutions of nonlinear partial differential equations. Several test examples are given; illustrative examples and the coupled nonlinear system of Burger’s equations. The obtained results ensure that this modification is capable for solving the nonlinear PDEs that have wide application in physics and engineering.
THE LEFT AND RIGHT BLOCK POLE PLACEMENT COMPARISON STUDY: APPLICATION TO FLIG...ieijjournal
It is known that if a linear-time-invariant MIMO system described by a state space equation has a number of states divisible by the number of inputs and it can be transformed to block controller form, we can design a state feedback controller using block pole placement technique by assigning a set of desired Block poles. These may be left or right block poles. The idea is to compare both in terms of system’s response.
A landing gear assembly consists of various components viz. Lower side stay, Upperside stay, Locking actuators, Extension actuators, Tyres, and Locking pins to name a few. Each unit having a specific operation to deal with, in this project the main unit being studied is the lower brace. The primary objective is to analyse stresses in the element of the lower brace unit using strength of materials or RDM method and Finite Element Method (FEM) and compare both. Using the obtained data a suitable material is proposed for the component. The approach used here is to study the overall behaviour of the element by taking up each aspect, finally summing up the total effect of all the aspects in the functioning of the element.
Optimising Data Using K-Means Clustering AlgorithmIJERA Editor
K-means is one of the simplest unsupervised learning algorithms that solve the well known clustering problem. The procedure follows a simple and easy way to classify a given data set through a certain number of clusters (assume k clusters) fixed a priori. The main idea is to define k centroids, one for each cluster. These centroids should be placed in a cunning way because of different location causes different result. So, the better choice is to place them as much as possible far away from each other.
vFORTRAN is used as a numerical and scientific computing language. The main objective of the lab work is to understand FORTRAN language using which we solve simple numerical problems and compare different methodologies. Through this project we make use of various functions of FORTRAN and solve a simple projectile problem and also LAPACK library to solve a tridiagonal matrix problem. We use DGESV and DGTSV functions to make it possible. The given problems are built and compiled using a free integrated development environment called CODE::BLOCKS [1] which is an open source platform for FORTRAN and C.
Numerical approach of riemann-liouville fractional derivative operatorIJECEIAES
This article introduces some new straightforward and yet powerful formulas in the form of series solutions together with their residual errors for approximating the Riemann-Liouville fractional derivative operator. These formulas are derived by utilizing some of forthright computations, and by utilizing the so-called weighted mean value theorem (WMVT). Undoubtedly, such formulas will be extremely useful in establishing new approaches for several solutions of both linear and nonlinear fractionalorder differential equations. This assertion is confirmed by addressing several linear and nonlinear problems that illustrate the effectiveness and the practicability of the gained findings.
KALMAN FILTER BASED CONGESTION CONTROLLERijdpsjournal
Facing burst traffic, TCP congestion control algorithms severely decrease window size neglecting the fact
that such burst traffics are temporal. In the increase phase sending window experiences a linear rise which
may lead to waste in hefty proportion of available bandwidth. If congestion control mechanisms be able to
estimate future state of network traffic they can cope with different circumstances and efficiently use
bandwidth. Since data traffic which is running on networks is mostly self-similar, algorithms can take
advantage of self-similarity property and repetitive traffic patterns to have accurate estimations and
predictions in large time scales.
In this research a two-stage controller is presented. In fact the first part is a RED congestion controller
which acts in short time scales (200 milliseconds) and the second is a Kalman filter estimator which do
RTT and window size estimations in large time scales (every two seconds). If the RED mechanism decides
to increase the window size, the magnitude of this increase is controlled by Kalman filter. To be more
precise, if the Kalman filter indicates a non-congested situation in the next large time scale, a magnitude
factor is calculated and given to RED algorithm to strengthen the amount of increase.
A secure service provisioning framework for cyber physical cloud computing sy...ijdpsjournal
Cyber physical systems (CPS) are mission critical systems engineered by combination of cyber and
physical systems respectively. These systems are tightly coupled, resource constrained systems and have
dynamic real time applications. Due to the limitation of resources, and in order to improve the efficiency of
the CPS systems, they are combined with cloud computing architecture, and are called as Cyber Physical
Cloud Computing Systems (CPCCS). These CPCCS have critical care applications where security of the
systems is a major concern. Therefore, we propose a Secure Service provisioning architecture for Cyber
Physical Cloud Computing Systems (CPCCS), which includes the combination of technologies such as
CPS, Cloud Computing and Wireless Sensor Networks. In addition to this, we also highlight various
threats/attacks; security requirements and mechanisms that are applicable to CPCCS at different layers
and propose two security models that can be adapted in a layered architectural format.
Permission based group mutual exclusionijdpsjournal
Due to the growing application of peer to peer computing, distributed applications are continuously spreading over an extensive number of nodes. To cope with this large number of participants, various hierarchical cluster based solutions have been proposed. Cluster or group based solutions are scalable for a large number of participants. As far as group mutual exclusion solutions are concerned, some of them have good complexity but do not take into account the growing number of participants. Others take into account the previous aspect but do not have good complexity. In this paper we present two group mutual exclusion algorithms namely; TBGMEACα and TBGMEACβ to deal both with the growing number of nodes and the matter of having a good complexity. The proposed logical structure is a cluster tree. The first solution uses the partial flooding method, which is the partial propagation of informations available at root level. In the second solution, informations available at root level are propagated only towards the processes which issued a request for a session. Both algorithms have complexities of O(p) and O(log p) respectively (p is the number of clusters in the system).
Second or fourth-order finite difference operators, which one is most effective?Premier Publishers
This paper presents higher-order finite difference (FD) formulas for the spatial approximation of the time-dependent reaction-diffusion problems with a clear justification through examples, “why fourth-order FD formula is preferred to its second-order counterpart” that has been widely used in literature. As a consequence, methods for the solution of initial and boundary value PDEs, such as the method of lines (MOL), is of broad interest in science and engineering. This procedure begins with discretizing the spatial derivatives in the PDE with algebraic approximations. The key idea of MOL is to replace the spatial derivatives in the PDE with the algebraic approximations. Once this procedure is done, the spatial derivatives are no longer stated explicitly in terms of the spatial independent variables. In other words, only one independent variable is remaining, the resulting semi-discrete problem has now become a system of coupled ordinary differential equations (ODEs) in time. Thus, we can apply any integration algorithm for the initial value ODEs to compute an approximate numerical solution to the PDE. Analysis of the basic properties of these schemes such as the order of accuracy, convergence, consistency, stability and symmetry are well examined.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Analytical and Exact solutions of a certain class of coupled nonlinear PDEs u...IJERA Editor
The purpose of this study is to introduce a modification of the Adomian decomposition method using Pad´e approximation and Laplace transform to obtain a closed form of the solutions of nonlinear partial differential equations. Several test examples are given; illustrative examples and the coupled nonlinear system of Burger’s equations. The obtained results ensure that this modification is capable for solving the nonlinear PDEs that have wide application in physics and engineering.
THE LEFT AND RIGHT BLOCK POLE PLACEMENT COMPARISON STUDY: APPLICATION TO FLIG...ieijjournal
It is known that if a linear-time-invariant MIMO system described by a state space equation has a number of states divisible by the number of inputs and it can be transformed to block controller form, we can design a state feedback controller using block pole placement technique by assigning a set of desired Block poles. These may be left or right block poles. The idea is to compare both in terms of system’s response.
A landing gear assembly consists of various components viz. Lower side stay, Upperside stay, Locking actuators, Extension actuators, Tyres, and Locking pins to name a few. Each unit having a specific operation to deal with, in this project the main unit being studied is the lower brace. The primary objective is to analyse stresses in the element of the lower brace unit using strength of materials or RDM method and Finite Element Method (FEM) and compare both. Using the obtained data a suitable material is proposed for the component. The approach used here is to study the overall behaviour of the element by taking up each aspect, finally summing up the total effect of all the aspects in the functioning of the element.
Optimising Data Using K-Means Clustering AlgorithmIJERA Editor
K-means is one of the simplest unsupervised learning algorithms that solve the well known clustering problem. The procedure follows a simple and easy way to classify a given data set through a certain number of clusters (assume k clusters) fixed a priori. The main idea is to define k centroids, one for each cluster. These centroids should be placed in a cunning way because of different location causes different result. So, the better choice is to place them as much as possible far away from each other.
vFORTRAN is used as a numerical and scientific computing language. The main objective of the lab work is to understand FORTRAN language using which we solve simple numerical problems and compare different methodologies. Through this project we make use of various functions of FORTRAN and solve a simple projectile problem and also LAPACK library to solve a tridiagonal matrix problem. We use DGESV and DGTSV functions to make it possible. The given problems are built and compiled using a free integrated development environment called CODE::BLOCKS [1] which is an open source platform for FORTRAN and C.
Numerical approach of riemann-liouville fractional derivative operatorIJECEIAES
This article introduces some new straightforward and yet powerful formulas in the form of series solutions together with their residual errors for approximating the Riemann-Liouville fractional derivative operator. These formulas are derived by utilizing some of forthright computations, and by utilizing the so-called weighted mean value theorem (WMVT). Undoubtedly, such formulas will be extremely useful in establishing new approaches for several solutions of both linear and nonlinear fractionalorder differential equations. This assertion is confirmed by addressing several linear and nonlinear problems that illustrate the effectiveness and the practicability of the gained findings.
KALMAN FILTER BASED CONGESTION CONTROLLERijdpsjournal
Facing burst traffic, TCP congestion control algorithms severely decrease window size neglecting the fact
that such burst traffics are temporal. In the increase phase sending window experiences a linear rise which
may lead to waste in hefty proportion of available bandwidth. If congestion control mechanisms be able to
estimate future state of network traffic they can cope with different circumstances and efficiently use
bandwidth. Since data traffic which is running on networks is mostly self-similar, algorithms can take
advantage of self-similarity property and repetitive traffic patterns to have accurate estimations and
predictions in large time scales.
In this research a two-stage controller is presented. In fact the first part is a RED congestion controller
which acts in short time scales (200 milliseconds) and the second is a Kalman filter estimator which do
RTT and window size estimations in large time scales (every two seconds). If the RED mechanism decides
to increase the window size, the magnitude of this increase is controlled by Kalman filter. To be more
precise, if the Kalman filter indicates a non-congested situation in the next large time scale, a magnitude
factor is calculated and given to RED algorithm to strengthen the amount of increase.
A secure service provisioning framework for cyber physical cloud computing sy...ijdpsjournal
Cyber physical systems (CPS) are mission critical systems engineered by combination of cyber and
physical systems respectively. These systems are tightly coupled, resource constrained systems and have
dynamic real time applications. Due to the limitation of resources, and in order to improve the efficiency of
the CPS systems, they are combined with cloud computing architecture, and are called as Cyber Physical
Cloud Computing Systems (CPCCS). These CPCCS have critical care applications where security of the
systems is a major concern. Therefore, we propose a Secure Service provisioning architecture for Cyber
Physical Cloud Computing Systems (CPCCS), which includes the combination of technologies such as
CPS, Cloud Computing and Wireless Sensor Networks. In addition to this, we also highlight various
threats/attacks; security requirements and mechanisms that are applicable to CPCCS at different layers
and propose two security models that can be adapted in a layered architectural format.
Permission based group mutual exclusionijdpsjournal
Due to the growing application of peer to peer computing, distributed applications are continuously spreading over an extensive number of nodes. To cope with this large number of participants, various hierarchical cluster based solutions have been proposed. Cluster or group based solutions are scalable for a large number of participants. As far as group mutual exclusion solutions are concerned, some of them have good complexity but do not take into account the growing number of participants. Others take into account the previous aspect but do not have good complexity. In this paper we present two group mutual exclusion algorithms namely; TBGMEACα and TBGMEACβ to deal both with the growing number of nodes and the matter of having a good complexity. The proposed logical structure is a cluster tree. The first solution uses the partial flooding method, which is the partial propagation of informations available at root level. In the second solution, informations available at root level are propagated only towards the processes which issued a request for a session. Both algorithms have complexities of O(p) and O(log p) respectively (p is the number of clusters in the system).
Scalable frequent itemset mining using heterogeneous computing par apriori a...ijdpsjournal
Association Rule mining is one of the dominant tasks of data mining, which concerns in finding frequent
itemsets in large volumes of data in order to produce summarized models of mined rules. These models are
extended to generate association rules in various applications such as e-commerce, bio-informatics,
associations between image contents and non image features, analysis of effectiveness of sales and retail
industry, etc. In the vast increasing databases, the major challenge is the frequent itemsets mining in a
very short period of time. In the case of increasing data, the time taken to process the data should be
almost constant. Since high performance computing has many processors, and many cores, consistent runtime
performance for such very large databases on association rules mining is achieved. We, therefore,
must rely on high performance parallel and/or distributed computing. In literature survey, we have studied
the sequential Apriori algorithms and identified the fundamental problems in sequential environment and
parallel environment. In our proposed ParApriori, we have proposed parallel algorithm for GPGPU, and
we have also done the results analysis of our GPU parallel algorithm. We find that proposed algorithm
improved the computing time, consistency in performance over the increasing load. The empirical analysis
of the algorithm also shows that efficiency and scalability is verified over the series of datasets
experimented on many core GPU platform.
BARRIERS TO CALL PRACTICES IN AN EFL CONTEXT: A CASE STUDY OF PREPARATORY YEA...ijdpsjournal
The present study attempts to find out the practical barriers to technology integration in an Arab EFL
scenario, particularly in the context of Preparatory Year English courses. The practical barriers to CALL
practices are multifaceted and vary according to contexts. In this mixed method study, 50 ESL teachers
were surveyed using a 5-point Likert-scale questionnaire. The questionnaire focused on the pedagogical,
technological, personal and administrative barriers to CALL integration in an EFL context. In addition, 21
teachers participated in the focus group discussion. Overall, the survey results found that the barriers
influencing CALL integration in the study context were moderate. However, lack of administrative support,
inadequate training, and absence of suitable materials were found as significant barriers to CALL
integration. The focus group discussion reiterated the issues and suggested practical solutions for
maximization of CALL practices. The study suggests a holistic administrative approach to solve the
barriers to CALL integration.
Review on mobile threats and detection techniquesijdpsjournal
Since last-decade, smart-phones have gained widespread usage. Mobile devices store personal details
such as contacts and text messages. Due to this extensive growth, smart-phones are attracted towards
cyber-criminals. In this research work, we have done a systematic review of the terms related to malware
detection algorithms and have also summarized behavioral description of some known mobile malwares
in tabular form. After careful solicitation of all the possible methods and algorithms for detection of
mobile-based malwares, we give some recommendations for designing future malware detection algorithm
by considering computational complexity and detection ration of mobile malwares.
An effective search on web log from most popular downloaded contentijdpsjournal
A Web page recommender system effectively predicts the best related web page to search. While search
ing
a word from search engine it may display some unnecessary links and unrelated data’s to user so to a
void
this problem, the con
ceptual prediction model combines both the web usage and domain knowledge. The
proposed conceptual prediction model automatically generates a semantic network of the semantic Web
usage knowledge, which is the integration of domain knowledge and web usage i
nformation. Web usage
mining aims to discover interesting and frequent user access patterns from web browsing data. The
discovered knowledge can then be used for many practical web applications such as web
recommendations, adaptive web sites, and personali
zed web search and surfing
PERFORMANCE AND ENERGY-EFFICIENCY ASPECTS OF CLUSTERS OF SINGLE BOARD COMPUTERSijdpsjournal
When a high performance cluster is demanded and the cost for purchase and operation of servers,
workstations or personal computers as nodes is a challenge, single board computers may be an option to
build inexpensive cluster systems. This paper describes the construction of such clusters and analyzes their
performance and energy-efficiency with the High Performance Linpack (HPL) benchmark.
Before we shake hands: representation and the global future of education kioglobal
A lot passes between people before they ever shake hands and meet properly. In the digital age, we have the ability to find out about a thing before we ever encounter it. Many people we ‘know’ about, we will never shake hands with. So, representation becomes very important: how things are represented in the media and in our education.
Contact chimaechi@kioglobal.com if you'd like a copy of the full speech and this PowerPoint.
(First delivered at the African Resources and Technology in Education Show, Nigeria, March 2013.)
Risky Reading: images and the vision of African educationkioglobal
Kio Global presentation delivered at the International Private Schools and Education Forum, Africa conference, London, 2013.
In early years as in digital culture, pictures (and few words) are the currency. In the African classroom, what are we looking at?
Risky Reading: images and the vision of African educationkioglobal
Kio Global presentation delivered at the International Private Schools and Education Forum, Africa conference, London, 2013.
In early years as in digital culture, pictures (and few words) are the currency. In the African classroom, what are we looking at?
A novel way of integrating voice recognition and one time passwords to preven...ijdpsjournal
Phishing is a threat to all users of the internet who intend to use the web for secure transactions. In the
recent years the number of phishing attacks have increased drastically especially since the advent of ecommerce,
net banking and other services that have an emphasis on security. Phishing is characterized as
any malicious attack aided by a spoofed webpage to encourage users to input their security details.
Phishing is largely done to retrieve passwords and security details of unsuspecting users. This paper
details a new and more secure way to counteract the method of phishing
MODELLING TRAFFIC IN IMS NETWORK NODESijdpsjournal
IMS is well integrated with existing voice and data networks, while adopting many of their key characteristics.
The Call Session Control Functions (CSCFs) servers are the key part of the IMS structure. They are the main components responsible for processing and routing signalling messages.
When CSCFs servers (P-CSCF, I-CSCF, S-CSCF) are running on the same host, the SIP message can be internally passed between SIP servers using a single operating system mechanism like a queue. It increases
the reliability of the network [5], [6]. We have proposed in a last work for each type of service (between ICSCF and S-CSCF (call, data, multimedia.))[23], to use less than two servers well dimensioned and running on the same operating system.
Instead dimensioning servers, in order to increase performance, we try to model traffic on IMS nodes, particularly on entries nodes; it will provide results on separation of incoming flows, and then offer more satisfactory service.
Tomography is important for network design and routing optimization. Prior approaches require either
precise time synchronization or complex cooperation. Furthermore, active tomography consumes explicit
probing resulting in limited scalability. To address the first issue we propose a novel Delay Correlation
Estimation methodology named DCE with no need of synchronization and special cooperation. For the
second issue we develop a passive realization mechanism merely using regular data flow without explicit
bandwidth consumption. Extensive simulations in OMNeT++ are made to evaluate its accuracy where we
show that DCE measurement is highly identical with the true value. Also from test result we find that
mechanism of passive realization is able to achieve both regular data transmission and purpose of
tomography with excellent robustness versus different background traffic and package size.
A PROGRESSIVE MESH METHOD FOR PHYSICAL SIMULATIONS USING LATTICE BOLTZMANN ME...ijdpsjournal
In this paper, a new progressive mesh algorithm is introduced in order to perform fast physical simulations by the use of a lattice Boltzmann method (LBM) on a single-node multi-GPU architecture. This algorithm is able to mesh automatically the simulation domain according to the propagation of fluids. This method can also be useful in order to perform several types of physical simulations. In this paper, we associate this
algorithm with a multiphase and multicomponent lattice Boltzmann model (MPMC–LBM) because it is
able to perform various types of simulations on complex geometries. The use of this algorithm combined
with the massive parallelism of GPUs[5] allows to obtain very good performance in comparison with the
staticmesh method used in literature. Several simulations are shown in order to evaluate the algorithm.
In a simultaneous multithreaded system, a core’s pipeline resources are sometimes partitioned and otherwise shared amongst numerous active threads. One mutual resource is the write buffer, which acts as an intermediary between a store instruction’s retirement from the pipeline and the store value being written to cache. The write buffer takes a completed store instruction from the load/store queue and eventually writes the value to the level-one data cache. Once a store is buffered with a write-allocate cache policy, the store must remain in the write buffer until its cache block is in level-one data cache. This latency may vary from as little as a single clock cycle (in the case of a level-one cache hit) to several hundred clock cycles (in the case of a cache miss). This paper shows that cache misses routinely dominate the write buffer’s resources and deny cache hits from being written to memory, thereby degrading performance of simultaneous multithreaded systems. This paper proposes a technique to reduce denial of resources to cache hits by limiting the number of cache misses that may concurrently reside in the write buffer and shows that system performance can be improved by using this technique.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A New Method Based on MDA to Enhance the Face Recognition PerformanceCSCJournals
A novel tensor based method is prepared to solve the supervised dimensionality reduction problem. In this paper a multilinear principal component analysis(MPCA) is utilized to reduce the tensor object dimension then a multilinear discriminant analysis(MDA), is applied to find the best subspaces. Because the number of possible subspace dimensions for any kind of tensor objects is extremely high, so testing all of them for finding the best one is not feasible. So this paper also presented a method to solve that problem, The main criterion of algorithm is not similar to Sequential mode truncation(SMT) and full projection is used to initialize the iterative solution and find the best dimension for MDA. This paper is saving the extra times that we should spend to find the best dimension. So the execution time will be decreasing so much. It should be noted that both of the algorithms work with tensor objects with the same order so the structure of the objects has been never broken. Therefore the performance of this method is getting better. The advantage of these algorithms is avoiding the curse of dimensionality and having a better performance in the cases with small sample sizes. Finally, some experiments on ORL and CMPU-PIE databases is provided.
RESISTANCE DISTANCE METHOD FOR DETERMINATION OF ISOMORPHISM AMONG PLANAR KINE...IAEME Publication
The detection of isomorphism among kinematic chains and their derived mechanism has been a hot area of research for last several years. In the present communication a resistance distance based computerized method is proposed and it is tested for planar kinematic chains up to ten links. In this
method the kinematic chains are represented in the form of resistance graph and from that graph a laplacian matrix is generated which is further transformed into a resistance distance matrix.
On Selection of Periodic Kernels Parameters in Time Series Prediction cscpconf
In the paper the analysis of the periodic kernels parameters is described. Periodic kernels can
be used for the prediction task, performed as the typical regression problem. On the basis of the
Periodic Kernel Estimator (PerKE) the prediction of real time series is performed. As periodic
kernels require the setting of their parameters it is necessary to analyse their influence on the
prediction quality. This paper describes an easy methodology of finding values of parameters of
periodic kernels. It is based on grid search. Two different error measures are taken into
consideration as the prediction qualities but lead to comparable results. The methodology was
tested on benchmark and real datasets and proved to give satisfactory results.
ON SELECTION OF PERIODIC KERNELS PARAMETERS IN TIME SERIES PREDICTIONcscpconf
In the paper the analysis of the periodic kernels parameters is described. Periodic kernels can
be used for the prediction task, performed as the typical regression problem. On the basis of the
Periodic Kernel Estimator (PerKE) the prediction of real time series is performed. As periodic
kernels require the setting of their parameters it is necessary to analyse their influence on the
prediction quality. This paper describes an easy methodology of finding values of parameters of
periodic kernels. It is based on grid search. Two different error measures are taken into
consideration as the prediction qualities but lead to comparable results. The methodology was
tested on benchmark and real datasets and proved to give satisfactory results.
Backtracking based integer factorisation, primality testing and square root c...csandit
Breaking a big integer into two factors is a famous problem in the field of Mathematics and
Cryptography for years. Many crypto-systems use such a big number as their key or part of a
key with the assumption - it is too big that the fastest factorisation algorithms running on the
fastest computers would take impractically long period of time to factorise. Hence, many efforts
have been provided to break those crypto-systems by finding two factors of an integer for
decades. In this paper, a new factorisation technique is proposed which is based on the concept
of backtracking. Binary bit by bit operations are performed to find two factors of a given
integer. This proposed solution can be applied in computing square root, primality test, finding
prime factors of integer numbers etc. If the proposed solution is proven to be efficient enough, it
may break the security of many crypto-systems. Implementation and performance comparison of
the technique is kept for future research.
A COMPREHENSIVE ANALYSIS OF QUANTUM CLUSTERING : FINDING ALL THE POTENTIAL MI...IJDKP
Quantum clustering (QC), is a data clustering algorithm based on quantum mechanics which is
accomplished by substituting each point in a given dataset with a Gaussian. The width of the Gaussian is a
σ value, a hyper-parameter which can be manually defined and manipulated to suit the application.
Numerical methods are used to find all the minima of the quantum potential as they correspond to cluster
centers. Herein, we investigate the mathematical task of expressing and finding all the roots of the
exponential polynomial corresponding to the minima of a two-dimensional quantum potential. This is an
outstanding task because normally such expressions are impossible to solve analytically. However, we
prove that if the points are all included in a square region of size σ, there is only one minimum. This bound
is not only useful in the number of solutions to look for, by numerical means, it allows to to propose a new
numerical approach “per block”. This technique decreases the number of particles by approximating some
groups of particles to weighted particles. These findings are not only useful to the quantum clustering
problem but also for the exponential polynomials encountered in quantum chemistry, Solid-state Physics
and other applications.
LOGNORMAL ORDINARY KRIGING METAMODEL IN SIMULATION OPTIMIZATIONorajjournal
This paper presents a lognormal ordinary kriging (LOK) metamodel algorithm and its application to
optimize a stochastic simulation problem. Kriging models have been developed as an interpolation method
in geology. They have been successfully used for the deterministic simulation optimization (SO) problem. In
recent years, kriging metamodeling has attracted a growing interest with stochastic problems. SO
researchers have begun using ordinary kriging through global optimization in stochastic systems. The
goals of this study are to present LOK metamodel algorithm and to analyze the result of the application
step-by-step. The results show that LOK is a powerful alternative metamodel in simulation optimization
when the data are too skewed.
Riccati matrix differential equation has long been known to be so difficult to solve analytically and/or numerically. In this connection, most of the recent studies are concerned with the derivation of the necessary conditions that ensure the existence of the solution. Therefore, in this paper, He’s Variational iteration method is used to derive the general form of the iterative approximate sequence of solutions and then proved the convergence of the obtained sequence of approximate solutions to the exact solution. This proof is based on using the mathematical induction to derive a general formula for the upper bound proved to be converging to zero under certain conditions.
The International Journal of Engineering and Science (The IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
In this paper, a novel architecture of RNS based 1D Lifting Integer Wavelet Transform (IWT) has been introduced. Advantage of Residue Number System (RNS) based Lifting Scheme over RNS based Filter Bank and non-binary IWT has been discussed. The performance of traditional predicts and updates stage of binary Lifting Scheme (LS) for Discrete Wavelet Transform (DWT) generates huge carry propagation
delay, power and complexity. As a result non binary number system is becoming popular in the field of Digital Signal Processing (DSP) due to its efficient performance. In this paper also a new fixed number ROM based RNS division circuit has been proposed. The proposed architecture has been validated on Xilinx Vertex5 FPGA platform and the corresponding result and reports are shown in here.
Quantum algorithm for solving linear systems of equationsXequeMateShannon
Solving linear systems of equations is a common problem that arises both on its own and as a subroutine in more complex problems: given a matrix A and a vector b, find a vector x such that Ax=b. We consider the case where one doesn't need to know the solution x itself, but rather an approximation of the expectation value of some operator associated with x, e.g., x'Mx for some matrix M. In this case, when A is sparse, N by N and has condition number kappa, classical algorithms can find x and estimate x'Mx in O(N sqrt(kappa)) time. Here, we exhibit a quantum algorithm for this task that runs in poly(log N, kappa) time, an exponential improvement over the best classical algorithm.
A TRIANGLE-TRIANGLE INTERSECTION ALGORITHM csandit
The intersection between 3D objects plays a prominent role in spatial reasoning, geometric
modeling and computer vision. Detection of possible intersection between objects can be based
on the objects’ triangulated boundaries, leading to computing triangle-triangle intersection.
Traditionally there are separate algorithms for cross intersection and coplanar intersection.
There is no single algorithm that can intersect both types of triangles without resorting to
special cases. Herein we present a complete design and implementation of a single algorithm
independent of the type of intersection. Additionally, this algorithm first detects, then intersects
and classifies the intersections using barycentric coordinates. This work is directly applicable to
(1) Mobile Network Computing and Spatial Reasoning, and (2) CAD/CAM geometric modeling
where curves of intersection between a pair of surfaces is required for numerical control (NC)
machines. Three experiments of the algorithm implementation are presented as a proof this
feasibility.
An alternative scheme for approximating a periodic functionijscmcj
Fourier series is generally used in applied mathematics and non-linear mechanics to solve the problems containing periodic functions. The aim of this paper is to present a new scheme through involving the Taylor’s series after some process modification for all such problems. It will save the long evaluation process involve in computing the different constants of Fourier series. The result obtained by the present
method has been compared with the result from the Fourier series expansion w.r.t. the exact solution and
found to be more satisfactory.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Hierarchical Digital Twin of a Naval Power SystemKerry Sado
A hierarchical digital twin of a Naval DC power system has been developed and experimentally verified. Similar to other state-of-the-art digital twins, this technology creates a digital replica of the physical system executed in real-time or faster, which can modify hardware controls. However, its advantage stems from distributing computational efforts by utilizing a hierarchical structure composed of lower-level digital twin blocks and a higher-level system digital twin. Each digital twin block is associated with a physical subsystem of the hardware and communicates with a singular system digital twin, which creates a system-level response. By extracting information from each level of the hierarchy, power system controls of the hardware were reconfigured autonomously. This hierarchical digital twin development offers several advantages over other digital twins, particularly in the field of naval power systems. The hierarchical structure allows for greater computational efficiency and scalability while the ability to autonomously reconfigure hardware controls offers increased flexibility and responsiveness. The hierarchical decomposition and models utilized were well aligned with the physical twin, as indicated by the maximum deviations between the developed digital twin hierarchy and the hardware.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Final project report on grocery store management system..pdf
AN EFFICIENT PARALLEL ALGORITHM FOR COMPUTING DETERMINANT OF NON-SQUARE MATRICES BASED ON RADIC'S DEFINITION
1. International Journal of Distributed and Parallel Systems (IJDPS) Vol.6, No.4, July 2015
DOI:10.5121/ijdps.2015.6401 1
AN EFFICIENT PARALLEL ALGORITHM FOR
COMPUTING DETERMINANT OF NON-SQUARE
MATRICES BASED ON RADIC'S DEFINITION
Neda Abdollahi1
, Mohammad Jafari1
, Morteza Bayat2
, Ali Amiri3
, Mahmood Fathy4
1
Department of Electronic and Computer Engineering, Zanjan Branch, Islamic Azad
University, Zanjan, Iran
2
Department of Mathematics, Zanjan Branch, Islamic Azad University, Zanjan, Iran
3
Computer Engineering Group, University of Zanjan, Zanjan, Iran
4
Department of Computer Engineering, Iran University of Science and Technology,
Tehran, Iran
ABSTRACT
One of the most significant challenges in Computing Determinant of Rectangular Matrices is high time
complexity of its algorithm. Among all definitions of determinant of rectangular matrices, Radic’s
definition has special features which make it more notable. But in this definition, C(
N
M
) sub matrices of the
order m×m needed to be generated that put this problem in np-hard class. On the other hand, any row or
column reduction operation may hardly lead to diminish the volume of calculation. Therefore, in this paper
we try to present the parallel algorithm which can decrease the time complexity of computing the
determinant of non-square matrices to O(N ).
KEYWORDS
Parallel algorithm, Non-square determinant, Ascending sequence, Dictionary order.
1. INTRODUCTION
Determinant is one of the basic concepts in linear algebra and applied statistics that have major
applications in various branches of mathematics and engineering. Computing the determinant of a
matrix is a classical problem, which is addressed in normal forms of matrix studies [1-4] and
computational number theory [5].
In principle, determinant is only defined for square matrices [6]. There is usable and clear
definition for the calculation of square matrices determinant. A parallel algorithm for the
calculation of × square matrix determinant is presented with time complexity ( ) [7]. But,
extracting data from physical phenomena and real world applications generally leads to produce
non-square matrices [8-10].
So far, many definitions for determinant of non-square matrices are given. Most of the works that
has been done, focusing on the definition and calculation the determinant of non-square matrices
by dividing them into square blocks [11][12] .[13]. In reference [12] Radic proposed an efficient
definition for determinant of non-square matrices that has most of the important properties of
square matrices determinant. Also, some other properties of Radic’s determinant and its
geometrical interpretations, involving polygons in the plan R2 and polyhedral in R3 are given
in[12][14-18].
2. International Journal of Distributed and Parallel Systems (IJDPS) Vol.6, No.4, July 2015
2
In [19], non-square matrices are converted to square matrices by summarizing, that leads to miss
some part of data.
The determinant of non-square matrix is used in retrieving images with different sizes [8]. Also,
there are some works on video retrieval and video shot boundary detection and image processing
by using determinant of non-square matrix [8][20-23]. Thus providing an effective solution for
calculating the determinant of non-square matrices can be very valuable and helpful.
In paper [24] a parallel algorithm based on pointer jumping technique is proposed to calculate the
determinant of non-square matrices of order 2 × . But despite the successful work that has been
done for the definition of non-square matrices determinant, yet there isn’t any efficient algorithm
to compute this determinant.
According to Radic’s definition for the determinant of a non-square matrix m × n, it should be
calculated the determinant of C(
n
m
) square matrices from the order of m × m. The square matrices
are obtained by combination of non-square matrix columns. Hence, the calculation of non-
matrices determinant is NP-hard. Some researchers [14] have tried decrease rows or columns of a
non-square matrix to convert it into a square matrix. But normally any change in rows or columns
of non-square matrices increase computation and column operations.
According to above explanation and proven theorems [12] currently, the only effective solution to
compute the determinant of non-square matrices by acceptable time complexity is parallel
algorithms.
To paralyze the algorithm, at first, the dependency between each Radic’s sub-square matrices
should be omitted. Secondly, each of these determinants also needs to be computed in parallel.
In this paper, we proposed a parallel algorithm to calculate the determinant of non-square
matrices based on Radic’s definition with O(n ) time complexity.
Problems and motivations are considered in Section 2. In Section 3 the Radic’s definition are
analyzed in details. Section 4 includes the proposed method to compute each arbitrary elements of
Dictionary order independently and in Section 5 a parallel algorithm for computing Raidc’s
determinant is presented. The complexity of proposed algorithm is perused due to the hardware
architecture In Section 6. Section 7 clarifies our conclusions.
2. PROBLEMS AND MOTIVATIONS
Radic's definition [12] for calculating the determinant of non-square matrices has numerous
significant properties and advantages in comparing to other definitions. Specially, it has almost all
the properties of determinant of square matrices [12].
According to Radic’s definition, it is evident that the determinant of a non-square matrix can be
computed as sum of specially signed square sub matrices. These sub matrices is obtained by
calculating specific permutation of columns of non-square matrix. Although this definition is easy
to compute and understand, it has exponential time complexity. In other words, computing the
det( ) requires to compute determinants of square sub matrices of order × , which
lead to exponential time complexity. Regarding to the previous works, it is obvious that applying
column and row operations for computing the determinant of non-square matrices is inefficient
[25]. In addition, due to the dependency between determining square sub matrices, it is
impossible to design an efficient parallel algorithm based on this definition.
3. International Journal of Distributed and Parallel Systems (IJDPS) Vol.6, No.4, July 2015
3
In this paper we propose a novel approach for parallel production of square sub matrices which
reduces the time complexity to O(m × (n − m)).
3. DETAILED ANALYSIS OF RADIC’S DEFINITION
At first, we will clarify some preliminary concepts and then assess Radic’s definition due to these
concepts.
Definition 1: ascending sequence
A sequence of elements of a partially ordered set such that each member of the sequence is less
than the following one. So, for set = {1,2,3, … , }, each sub set = {a!, a , … , a"} is an
ascending sequence if condition ∀(a!, a , … , a") ∈ A and (m < ) ' ( ('! < a < ⋯ < a")
is satisfied.
Definition 2: dictionary order
Suppose { !, , … , *} is an n-tuple of sets, with respective total orderings {<!, < , … , <*}. The
dictionary ordering <+
of ! × × … × * is then
('!, ' , … , '*) <+ (,!, , , … , ,*) ⟺ (∃ > 0)(∀1 ≤ )('3 = ,3)⋀('5 <5 ,5). That is, if
one of the terms '5 <5 ,5 and all the preceding terms are equal.
Theorem 1:
Regarding to def.1, the maximum number of m-tuple sub sequences of ascendant set A =
{a!, a , … , a6} where m < , is equal to
n
m
.
Proof:
Putting the minimum element in the first place (as a! in set A), we would have n − 1 choice for
the remaining m − 1 places. In the same way, by selecting a , there will be n − 2 selection for
the last m − 1 places, and finally by putting '67"8! in the first place, there will be remained
m − 1 choices for m − 1 places. In other word, all the possible selections can be shown as
follow.
1:
p!:
;<
, = , … , =5>??@??A
67!
57!
A={a!, a , … , a67"8!, … , a6BCCCDCCCE
"
}2:
p!:
;F
, = , … , =5>??@??A
67
57!
… …
n-m+1:
p!:
;GHIJ<
, = , … , =5>??@??A
"7!
57!
In this case, all ascending sequences that can be produced is equal
n − 1
m − 1
+
n − 2
m − 1
+ ⋯ +
m
m − 1
+
m − 1
m − 1
=
n
m
.
4. International Journal of Distributed and Parallel Systems (IJDPS) Vol.6, No.4, July 2015
4
According to the dictionary order and ascending sequences definition, it’s obvious that, for
m < , the first element of A = {1,2, … , n} is [1,2, … , m], which we entitled First Member. Also,
the last element in this sequence will be [n − m + 1, n − m + 2, … , n] and the remaining sub
ascending sequences will be in this interval.
[1,2, … , m] < [1,2, … , m + 1] < ⋯ < [n − m + 1, n − m + 2, … , n]
Now, according to Theorem 1, the sequences can be numbered from 0 to
n
m
− 1. Also,
according to the latest member of ascending sequences the maximum value of each place is
determined. For example, the maximum value which the mth
place can be obtained, is n, But due
to the need to establish the condition a"7! < a", the value of (m-1)th
place cannot exceed n-1.
In the following, we present Radic's definition for determinant of non-square matrices.
Definition 3. Let = ['3,N] be an × matrix with ≤ . The determinant of , is defined as:
det( ) = ∑ (−1)P8Q
(RS T
'!N<
⋯ '!NU
⋮ ⋱ ⋮
'5N<
⋯ '5NU
X!YN<Z⋯ZNUY* , (1)
where [!, [ , … , [5 ∈ ℕ, ] = 1 + 2 + ⋯ + and ^ = [! + ⋯ + [5. If > , then we define
det( ) = 0.
Now, according to Definition 3 is observed that the following sub square matrices produced in
Radic’s definition is in accordance with the dictionary order. So, if an efficient algorithm can be
represented for the computation of dictionary order elements, therefore Radic’s determinant can
also be calculated with greater efficiency.
4. COMPUTATION OF DICTIONARY SEQUENCE ELEMENTS
In this section, we attempt to compute each arbitrary elements of Dictionary order independently.
In other word, by giving a q where 0 ≤ q <
n
m
, we try to calculate the qth
element in the
sequence. Due to this purpose, a novel definition entitled combinatorial addition is presented and
table 1 is formed by the elements of Pascal's triangle.
[ 1 1 = 1 1 = 2 … 1 = − − 1 1 = −
[ = 0
1
0
2
0
…
− − 1
0
−
0
[ = 1
2
1
3
1
…
− − 2
1
− − 1
1
… … … … … …
[ = − 2
− 1
− 2 − 2
…
− 3
− 2
− 2
− 2
[ = − 1
− 1
+ 1
− 1
…
− 2
− 1
− 1
− 1
Table1 : Pascal's triangle
As you can see in Table 1, each (j, i)th
entries in the table is obtained from `
1 + [
[
a.
According to Table 1and as it mentioned in theorem 1, the weight of each element in the
Ascending sequence is equal the last column of the table.
5. International Journal of Distributed and Parallel Systems (IJDPS) Vol.6, No.4, July 2015
5
n − 1
− 1
1
,
n − 2
− 2
2
,
n − 3
− 3
,
3
…
,
n − k + 1
− c + 1
,
k − 1
n − k
− c
,
k
… ,
n − m
0
m
Now, if
− c
− c
< d ≤
− c + 1
− c + 1
, m − k + 1 element of the First Member will change. We
use Table 1 to calculate the amount of the change. To this, according Table 1, we must go to left
in the jth
row where
− c
− c
is located. As can be seen in Table 1, the first element at the left
side of the start point is
− c − 1
− c − 1
.
Until condition d ≥
− c
− c
+ ⋯ +
− c − =
− c
is satisfied, we continue the steps to the left.
Then the numbers of steps, which is moved to the left side in jth
row, will be added to the value of
last m-k locations in the First Member. The new value of d is calculated from the following
equation.
d ← d − ∑ − c − 1
− c
g
3hi .
Then until d = 0, the algorithm is continued from ( − − =)th
column by the new value of d.
Example 1: for set = {1, 2, … , 8}, the five-member ascending sequences in dictionary order is
shown in table 2.
Table 2: all five-member subsets
For m = 5 and n = 8, we have table 3.
6. International Journal of Distributed and Parallel Systems (IJDPS) Vol.6, No.4, July 2015
6
1 1 1 1
1 2 3 4
1 3 6 10
1 4 10 20
1 5 15 35
≈
1 = 0 1 = 1 1 = 2 1 = 3
`
m + n
n
a
[ = 0
0
0
1
0
2
0
3
0
[ = 1
1
1
2
1
3
1
4
1
[ = 2
2
2
3
2
4
2
5
2
[ = 3
3
3
4
3
5
3
6
3
[ = 4
4
4
5
4
6
4
7
4
Table 3a table 3b
We assume q = 49. In this case, according to table 3, the weight of each place in the First Member
would be as follows.
7
4
1
6
3
2
5
2
3
4
1
4
3
0
5
Since
7
4
< d <
8
5
, in the fifth row (j = 4) we will proceed to the left, but because
6
4
+
7
4
> 49 is not acceptable, so we stopped at p = 1. Therefore, p = 1 and the new q is equal to
q = 49 −
7
4
= 14 and a unit will be added to the fifth last places.
65432
11111+
65432
Till this step, ascending sequence is [2, 3, 4, 5, 6].
Because we went one step ahead in the previous stage, we continue the algorithm from
column − − = = 8 − 5 − 1 = 2. According to Table 3, for q = 14 we have
5
3
< d <
6
4
.
Since we start moving from the fourth row and third column, which equals to
5
3
. Then, we
have q ≥
5
3
+
4
3
and p=2. So, two units are added to the last four places.
65432
2222+
87652
Since, the new value of q is q = 14 − r
5
3
+
4
3
s = 0, the algorithm has finished and 49th
element in the sequence of dictionary order is generated.
tu = [2,5,6,7,8]
7. International Journal of Distributed and Parallel Systems (IJDPS) Vol.6, No.4, July 2015
7
It is proven for any arbitrary d, using combinatorial addition the whole dictionary ordered
elements are produced.
Theorem 2: Using combinatorial addition, by adding arbitrary d to First Member of the
dictionary order, exactly dvw
element in the dictionary order for < will be generated.
Proof: We will show this theorem using mathematical induction
First step k = 1:
To produce the second ascending sequence from the First Member, regarding to Combinatorial
Addition, just it needs to add a unit to the first place.
i = [1,2,3, … , − 1, ]
! = x1,2,3, … , − 1, + 1BDE
yh!
z
This is the second element in dictionary order. In other words, only one location was changed.
Inductive assumption:
Suppose using combinatorial addition to add d units to First Member. Thus, the ascending
sequence 1,2,3, … , '57y8!, '57y, '57y7!, … , '5BCCCCCDCCCCCE
y
is produced, which is exactly the dvw
element in dictionary order. This sequence is obtained by changing at most c places of First
Member.
Inductive rule:
It should be shown that adding d + 1 units to First Member, the ( d + 1)vw
element in the
dictionary order will be generated.
First case: Suppose by adding d + 1 to First Member, just c places have changed. Regarding the
inductive assumption, since only c places were changed, therefore, it is exactly the ( d +
1)vw
element in the dictionary order.
1,2,3, … , '57y8!, '57y, '57y7!, … , '5BCCCCCCDCCCCCCE
y
Second case: by adding q to First Member, if the ascending sequence
1,2,3, … , − c, − c + 1, … ,BCCCCCCDCCCCCCE
y
is generated, it will be impossible to increase any of the last c
places. Because, all places achieve to their highest possible value. According to the dictionary
order, it’s clear the ( d + 1)vw
element is 1,2,3, … , − c + 1, − c + 2, … , + 1BCCCCCCCCCDCCCCCCCCCE
y8!
.
We will show Combinatorial Addition exactly generated the same sequence. According to Table
1, the value is equal to
d = |y8*7(58!)
y7!
} + |y8*7(58 )
y7!
} + ⋯ + | y
y7!
}BCCCCCCCCCCCCDCCCCCCCCCCCCE
*75
If we add one unit to both sides then we will have
8. International Journal of Distributed and Parallel Systems (IJDPS) Vol.6, No.4, July 2015
8
d + 1 = |y8*7(58!)
y7!
} + |y8*7(58 )
y7!
} + ⋯ + | y
y7!
}BCCCCCCCCCCCCDCCCCCCCCCCCCE
*75
+ 1
In this equation, the right side is equal to
|y8*7(58!)
y7!
} + |y8*7(58 )
y7!
} + ⋯ + | y
y7!
} + 1 = |y8*75
y
}
According to the above equation we have
d + 1 = |y8*75
y
}
Defined as Combinatorial Addition, the (c + 1)vw
place has increased a unit and other elements
subsequently increased. So, the following ascending sequence is obtained.
1,2,3, … , − c + 1, − c + 2, … , + 1BCCCCCCCCCDCCCCCCCCCE
y8!
This sequence is exactly ( d + 1)vw
element in the dictionary order
5. PARALLEL ALGORITHM FOR COMPUTING RAIDC’S DETERMINANT
In this section, we present an efficient algorithm to produce the square sub matrices of definition
(3) in parallel.
The algorithm is able to receive the value of d and for arbitrary and produce the dvw
sequence in the dictionary order. Pseudo code for this algorithm is shown in Figure 1.
9. International Journal of Distributed and Parallel Systems (IJDPS) Vol.6, No.4, July 2015
9
For i = 1 To (n - m+ 1)
A(1, i) = i
For i = 1 To m
A(i, 1) = 1
k = n - m+ 1
For i = 2 To m
For j = 2 To k
A(i, j) = A(i, j - 1) + A(i - 1, j)
j = 1
For i = 1 To m
B(i) = i
Sum = 0, p = 0, i = k
While A(j, k) <= q
j = j + 1
j = j - 1
i = k
While Sum <= q
Sum = A(j, i) + Sum
p = p + 1
i = i - 1
Sum = Sum - A(j, i + 1)
p = p - 1
B(m - j) = B(m - j) + p
For h = m - j To m - 1
B(h+ 1) = B(h) + p
q= q - Sum
j = 1
k = k - p
p = 0
Sum = 0
Wend
B(m) = B(m) + q
Fig 1: Pseudo code of generating arbitrary sequence
This algorithm can be implemented in various granularities. This means whatever the number of
processors is further, the granularities can be smaller. And we will have larger granularities if the
number of processors is less. In other words, if the number of processors is k, the number of
granularities will be
*
5
y
. It means the first processor starts from i to ~
U
•
7!
and the next portion
form ~
U
•
to
×
~
U
•
7!
is for the second processor. In the same way, the last processor calculates
(y7!)×
~
U
•
to *
5
7!
. Pseudo-code for producing ascending sequence from a specific element
has been shown in figure 1.
€•] ‚ = 1 S•
*
5
y
− 1
(1) = (1) + 1
ƒ€ (1) > „ℎR
(1 − c) = (1 − c) + 1
†ℎ1‡R (1 − c) > − c
c = c + 1
(1 − c) = (1 − c) + 1
†R (
ƒ€ (c < ) „ℎR
10. International Journal of Distributed and Parallel Systems (IJDPS) Vol.6, No.4, July 2015
10
ˆ•] ‡ = 1 − c „• − 1
(‡ + 1) = (‡) + 1
c = 1
‰ ( ƒ€
‰ ( ƒ€
R (
Figure 1: dictionary sequence
6. ALGORITHM ANALYSIS DUE TO THE HARDWARE ARCHITECTURE
The proposed algorithm has the ability to run on different architectures. Parallel Random Access
Machine (PRAM) is a shared memory abstract machine. In this architecture shared memory plays
an important role.
On Concurrent Read Concurrent Write (CRCW) memory, the highest performance of the
algorithm can be achieved. In this case, if we have processors, each processor is only run the
algorithm, which is shown in Figure 1, once to obtain the corresponding square matrix with
Š| ( − )} time complexity.
According to the algorithm presented in [7], if we have processors, the determinant of each
× square matrix is calculated with Š( ). Therefore, if we have × processors with
a CRCW memory, this algorithm can calculate the determinant of × non-square matrix
in Š( ( − ) + ) ∈ Š| ( − )}.
If the memory is Concurrent Read Exclusive Write (CREW), the time required to sum the results
of all processors in tree structure will be equal to ‡•‹ . we know that ‡•‹ ! ∈ ( ‡•‹ ).
Thus the determinant of the non-square matrix will be calculated at Š( ( − ) + ‡•‹ ) ∈
Š| ( − )}.
In Exclusive Read Exclusive Write (EREW) memories, there is a burden to read matrices. If
enough memory is available, the matrix can be copied in a tree structure in ‡•‹ time
complexity. Then, it will be accessible for all processors. In this case, the algorithm complexity is
Š( ( − ) + 2 ‡•‹ ) ∈ Š| ( − )}. Given the above description it has been shown that
the time complexity of the proposed algorithm is Š( ).
It’s obvious the proposed algorithm in cloud computing architecture and other architectures in
which processors are connected through the network tolerates the overhead of network too. So it’s
time complexity will be Š( + RS••]c_••R]ℎR'().
7. CONCLUSION
Using Parallel algorithms is an effective method for reducing the time complexity. However, in
most cases, increasing the number of processors does not increase productivity and just reduces
the required time. But given that the cost of producing complex hardware with many processors is
declining sharply, therefore the parallel algorithm can have appropriate efficiency.
On the other hand, time is an important factor in reducing the response time of real-time systems,
and it plays a key role in the success of such systems. Note that, also in the machine vision, time
is one of the important factors; the proposed algorithm can be very efficient and effective.
11. International Journal of Distributed and Parallel Systems (IJDPS) Vol.6, No.4, July 2015
11
8. FUTURE WORK
In recent years, researchers interest in Cloud computing and distributed processing. Since the
proposed algorithm can be implemented in distributed systems, implementation and computing
network overhead in these systems can be considered as future researches.
With regard to applications of the determinant of matrix in image and video processing, making a
proper hardware and implementing the proposed algorithm can be a suitable solution in computer
vision.
There are other definition for determinant of non-square matrices, these definition can be
investigated whether they can be parallelize or not and be compared with proposed algorithm in
this paper.
REFERENCES
[1] Domich, P.D. & Kannan, R. & Trotter Jr. Hermite, L.E, (1987) "normal Form Computation Using
Modulo Determinant Arithmetic", Mathematics of Operations Research, vol. 12, No. 1, pp:50–59.
[2] Frumkin, M.A, (1977) "Time Algorithms In The Theory Of Linear Diophantine Equations", In
Fundamentals of Computation Theory, LNCS 56, Springer-Verlag, pp:386–392.
[3] Newman, M, (1972) "Integral Matrices. Academic Press,".
[4] Storjohann, A, (2000) "Algorithms for Matrix Canonical Forms", PhD thesis, Institut f¨ur
Wissenschaftliches Rechnen, ETH-Zentrum, Zurich, Switzerland.
[5] Cohen, H, (1996) "A course in computational number theory", Springer-Verlag.
[6] Kaltofen, E. & Villard, G, (2001) "Computing The Sign Or The Value Of The Determinant Of An
Integer Matrix, A Complexity Survey", Preprint submitted to ALA’2001 JCAM Special issue.
[7] Teimoori, H & Bayat, M. & Amiri, A. & Sarijloo, E, (2005) "A New Parallel Algorithm for
Evaluating the Determinant of a Matrix of Order n", Euro Combinatory, pp: 123-134.
[8] Abdollahi, N. & Jafari, M. & Amiri, A, (2012) “Retrieving Images in different sizes using
Determinant kernel for non-square matrices,” National Conference on Artificial Intelligent in
Electrical and Computer Engineering (NCAI).
[9] Amiri, A. & Abdollahi, N. & Jafari, M. & Fathy, M, (2011) "Hierarchical Key-Frame Based Video
Shot Clustering Using Generalized Trace", Journal of Innovative Computing Technology, Springer-
Verlag Berlin Heidlberg, pp: 251-257.
[10] Abdollahi, N. & Jafari, M. & Amiri, A. & Fathy, M, (2011) "Generalization of the Trace Kernel on
Non-Square Matrices and its applications in video retrieval," the 7th Iranian Machine Vision and
Image Processing Conference (MVIP), IUST.
[11] Joshi, V.N, (1980) “A Determinant for Rectangular matrices”, Bull. Austral. Math. Soc., vol. 21,
pp:137-146.
[12] Radic, M, (1969) “A Definition of the Determinant of A Rectangular Matrix,” Glasnik Matemaicki,
vol. 1, No. 21, pp: 17-22.
[13] Arunkumar, M. & Murthy, S. & Ganapathy, G, (2011) "Determinant For Non-Square Matrices",
International J. of Math. Sci. & Engg. Appls. (IJMSEA), ISSN 0973-9424, vol. 5, No. V, pp: 389-401.
[14] Radi´c, M. & Suˇsanj, R, (1992) “An Application of the Determinant of A Rectangular Matrix in
Discovering Some Properties of the Pentagon,” Glas. Mat. Ser. III 27, pp: 217-226.
[15] Radi´c, M, (2008) "Areas of Certain Polygons in Connection with Determinants of Rectangular
Matrices", Beitrage zur Algebra und Geometrie Contributions to Algebra and Geometry, vol. 49,
pp:71-96.
[16] Radi´c, M, (1991) “A Generalization of the Determinant of a Square Matrix and Some of Its
Applications in Geometry,” Serbo-Croatian Matematika (Zagreb), vol. 20, pp:19-36.
[17] Radi´c, M, (2005) "About A Determinant of Rectangular 2 × n Matrix and It’s Geometric
Interpretation", Beitrage Zur Algbera und Geometric Contributions to Algebra and Geometry, vol. 46,
pp:321-349.
[18] Susanj, R. & Radi´c, M, (1994) "Geometrical Meaning of One Generalization of the Determinant of A
Square Matrix", Glasnik Matematicki, vol. 29, pp:217-234.
12. International Journal of Distributed and Parallel Systems (IJDPS) Vol.6, No.4, July 2015
12
[19] Amiri, A. & Fathy, M. & Bayat, M, (2010) "Generalization of Some Determinantal Identities for
Non-Square Matrices Based on Radic’s Definition", TWMS J. Pure Appl. Math, vol. 1, No. 2, pp:
163-175.
[20] Amiri, A. & Fathy, M, (2011) “Generalization of Eigenvalue and Eigenvector for Non-Square
matrices based on Radic´s Determinant and its application to video retrieval,” to appear in Journal of
Applied and Computational Mathematics (A&CM).
[21] Amiri, A. & Fathy, M, (2009) “A Novel Video Retrieval System Using GED-based Similarity
Measure,” International Journal of Signal Processing, Image Processing and Pattern Recognition,
vol. 2, No. 3, pp:99-108.
[22] Amiri, A. & Fathy, M, (2009) “Video Shot Boundary Detection Using Generalized Eigenvalue
Decomposition,” Lecture Notes In Computer Science, vol. 5593, pp:780-790.
[23] Zhou, S.K, (2004) “Trace and determinant kernels between matrices,” SCR Technical Report.
[24] Abdollahi, N. & Jafari, M. & Amiri, A. & Fathy, M, (2011) “A New Parallel Algorithm for
calculating the Determinant of a non-square Matrix of Order 2×n ,“ 1st National Conference on Soft
Computing and Information Technology.
[25] Amiri, A. & Bayat, M. & Fath, M. & Tiemoori, H, (2005) “Determinant Identities for Non-Square
Matrices Based on Radic’s Definition: Dodgson,Cauchy-Binet and Trahan,” Euro Combinatory,
pp:123-134.
Authors
Neda Abdollahi was born in Zanjan, Iran, in 1985. She received the B.S. and M.Sc.
Islamic Azad University, Zanjan, Iran, in 2008 and 2011. In 2009, she joined Bina
Software Co., as a technical expert and science then she has been with Department of
Electronic and Computer Engineering, Islamic Azad University of Zanjan and Payame
Noor University and from 2012, she has been a Faculty member of Saeb University,
Abhar, Iran. Her research interests include Multimedia Retrieval, Software Modeling,
Machine Learning Methods, Object-Oriented Analysis and Design, Mobile Ad-Hoc
Networks, Distributed Systems, Micro Programming and Web Design.
Mohammad Jafari was born in Zanjan, Iran, in 1977. She received the B.S. and
M.Sc. Islamic Azad University, Zanjan, Iran, in 2003 and 2011. In 2001, he has started
his work as CEO of Bina Software Co., Zanjan, Iran. From 2006 to 2011, he was a
computer technical expert of information and planning unit of the Zanjan Broadcasting
Center. And science 2009, he has been with Department of Electronic and Computer
Engineering, Islamic Azad University of Zanjan and University of Applied Science
and Technology and Sufi University, Zanjan, Iran. his research interests include
Software Modeling, Data Base, Object-Oriented Design, Computer Networking,
Mobile Distributed Systems, Programming and Web Design.
Morteza Bayat received M.S. degree in 2002 from Institute for Advance Studies in
Basic Sciences (IASBS), Zanjan, Iran, in Applied Mathematics, and the Ph.D. degree
in Differential Equations in 2008 from IASBS. Since 2008, he has worked in the
Computer Engineering Department of Zanjan University as an Professor Assistant.
His research interests include Matrix Computations and Differential Equations.
Ali Amiri was born in Zanjan, Iran, in 1982. He received the M.S. degree in
Computer Engineering from Iran University of Science and Technology (IUST), in
2006, where he is currently pursuing Ph.D. degree in the IUST. His research interests
include video segmentation, video retrieval and summarization, Matrix Computation
and moving object detection and tracking.
13. International Journal of Distributed and Parallel Systems (IJDPS) Vol.6, No.4, July 2015
13
Mahmood Fathy, was born in Tehran, Iran, in 1959. He received the B.S. degree in
Electronic Engineering from Iran University of Science and Technology (IUST), in
1985, M.Sc. degree in Microprocessor Engineering from Bradford, UK, 1988 and
Ph.D. degree in Image Processing and Processor Design from UMIST, UK in 1991.
Since 1992, he has been with the IUST, where he is currently Associate Professor at
the Department of Computer Engineering. His research interests include Computer
networks, QOS , internet Engineering, Application of image processing in Traffic,
Computer Architecture for image processing, video processing applications,
Panorama, Supper resolution, video classification, video retrieval and summarization.