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
Comparative Study of the Effect of Different Collocation Points on Legendre-C...IOSR Journals
We seek to explore the effects of three basic types of Collocation points namely points at zeros of Legendre polynomials, equally-spaced points with boundary points inclusive and equally-spaced points with boundary point non-inclusive. Established in literature is the fact that type of collocation point influences to a large extent the results produced via collocation method (using orthogonal polynomials as basis function). We
analyse the effect of these points on the accuracy of collocation method of solving second order BVP. For equally-spaced points we further consider the effect of including the boundary points as collocation points. Numerical results are presented to depict the effect of these points and the nature of problem that is best handled by each.
Numerical Solutions of Second Order Boundary Value Problems by Galerkin Resid...iosrjce
IOSR Journal of Mathematics(IOSR-JM) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of mathemetics and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in mathematics. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Exact Matrix Completion via Convex Optimization Slide (PPT)Joonyoung Yi
Slide of the paper "Exact Matrix Completion via Convex Optimization" of Emmanuel J. Candès and Benjamin Recht. We presented this slide in KAIST CS592 Class, April 2018.
- Code: https://github.com/JoonyoungYi/MCCO-numpy
- Abstract of the paper: We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen? We show that one can perfectly recover most low-rank matrices from what appears to be an incomplete set of entries. We prove that if the number m of sampled entries obeys
𝑚≥𝐶𝑛1.2𝑟log𝑛
for some positive numerical constant C, then with very high probability, most n×n matrices of rank r can be perfectly recovered by solving a simple convex optimization program. This program finds the matrix with minimum nuclear norm that fits the data. The condition above assumes that the rank is not too large. However, if one replaces the 1.2 exponent with 1.25, then the result holds for all values of the rank. Similar results hold for arbitrary rectangular matrices as well. Our results are connected with the recent literature on compressed sensing, and show that objects other than signals and images can be perfectly reconstructed from very limited information.
Conformable Chebyshev differential equation of first kindIJECEIAES
In this paper, the Chebyshev-I conformable differential equation is considered. A proper power series is examined; there are two solutions, the even solution and the odd solution. The Rodrigues’ type formula is also allocated for the conformable Chebyshev-I polynomials.
Comparative Study of the Effect of Different Collocation Points on Legendre-C...IOSR Journals
We seek to explore the effects of three basic types of Collocation points namely points at zeros of Legendre polynomials, equally-spaced points with boundary points inclusive and equally-spaced points with boundary point non-inclusive. Established in literature is the fact that type of collocation point influences to a large extent the results produced via collocation method (using orthogonal polynomials as basis function). We
analyse the effect of these points on the accuracy of collocation method of solving second order BVP. For equally-spaced points we further consider the effect of including the boundary points as collocation points. Numerical results are presented to depict the effect of these points and the nature of problem that is best handled by each.
Numerical Solutions of Second Order Boundary Value Problems by Galerkin Resid...iosrjce
IOSR Journal of Mathematics(IOSR-JM) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of mathemetics and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in mathematics. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Exact Matrix Completion via Convex Optimization Slide (PPT)Joonyoung Yi
Slide of the paper "Exact Matrix Completion via Convex Optimization" of Emmanuel J. Candès and Benjamin Recht. We presented this slide in KAIST CS592 Class, April 2018.
- Code: https://github.com/JoonyoungYi/MCCO-numpy
- Abstract of the paper: We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen? We show that one can perfectly recover most low-rank matrices from what appears to be an incomplete set of entries. We prove that if the number m of sampled entries obeys
𝑚≥𝐶𝑛1.2𝑟log𝑛
for some positive numerical constant C, then with very high probability, most n×n matrices of rank r can be perfectly recovered by solving a simple convex optimization program. This program finds the matrix with minimum nuclear norm that fits the data. The condition above assumes that the rank is not too large. However, if one replaces the 1.2 exponent with 1.25, then the result holds for all values of the rank. Similar results hold for arbitrary rectangular matrices as well. Our results are connected with the recent literature on compressed sensing, and show that objects other than signals and images can be perfectly reconstructed from very limited information.
Conformable Chebyshev differential equation of first kindIJECEIAES
In this paper, the Chebyshev-I conformable differential equation is considered. A proper power series is examined; there are two solutions, the even solution and the odd solution. The Rodrigues’ type formula is also allocated for the conformable Chebyshev-I polynomials.
The numerical solution of Huxley equation by the use of two finite difference methods is done. The first one is the explicit scheme and the second one is the Crank-Nicholson scheme. The comparison between the two methods showed that the explicit scheme is easier and has faster convergence while the Crank-Nicholson scheme is more accurate. In addition, the stability analysis using Fourier (von Neumann) method of two schemes is investigated. The resulting analysis showed that the first scheme
is conditionally stable if, r ≤ 2 − aβ∆t , ∆t ≤ 2(∆x)2 and the second
scheme is unconditionally stable.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
A method for solving quadratic programming problems having linearly factoriz...IJMER
A new method namely, objective separable method based on simplex method is proposed for
finding an optimal solution to a quadratic programming problem in which the objective function can be
factorized into two linear functions. The solution procedure of the proposed method is illustrated with the
numerical example.
Derivation and Application of Multistep Methods to a Class of First-order Ord...AI Publications
Of concern in this work is the derivation and implementation of the multistep methods through Taylor’s expansion and numerical integration. For the Taylor’s expansion method, the series is truncated after some terms to give the needed approximations which allows for the necessary substitutions for the derivatives to be evaluated on the differential equations. For the numerical integration technique, an interpolating polynomial that is determined by some data points replaces the differential equation function and it is integrated over a specified interval. The methods show that they are only convergent if and only if they are consistent and stable. In our numerical examples, the methods are applied on non-stiff initial value problems of first-order ordinary differential equations, where it is established that the multistep methods show superiority over the single-step methods in terms of robustness, efficiency, stability and accuracy, the only setback being that the multi-step methods require more computational effort than the single-step methods.
Quadratic Programming : KKT conditions with inequality constraintsMrinmoy Majumder
In the case of Quadratic Programming for optimization, the objective function is a quadratic function. One of the techniques for solving quadratic optimization problems is KKT Conditions which is explained with an example in this tutorial.
In this chapter, the authors extend the theory of
the generalized difference Operator ∆L to the generalized
difference operator of the 풏
풕풉kind denoted by ∆L Where L
=푳 = {풍ퟏ,풍ퟐ,….풍풏} of positive reals풍ퟏ,풍ퟐ,….풍풏and obtain some
interesting results on the relation between the generalized
polynomial factorial of the first kind, 풏
풕풉kind and algebraic
polynomials. Also formulae for the sum of the general
partial sums of products of several powers of consecutive
terms of an Arithmetic progression in number theory are
derived.
EXACT SOLUTIONS OF A FAMILY OF HIGHER-DIMENSIONAL SPACE-TIME FRACTIONAL KDV-T...cscpconf
In this paper, based on the definition of conformable fractional derivative, the functional
variable method (FVM) is proposed to seek the exact traveling wave solutions of two higherdimensional
space-time fractional KdV-type equations in mathematical physics, namely the
(3+1)-dimensional space–time fractional Zakharov-Kuznetsov (ZK) equation and the (2+1)-
dimensional space–time fractional Generalized Zakharov-Kuznetsov-Benjamin-Bona-Mahony
(GZK-BBM) equation. Some new solutions are procured and depicted. These solutions, which
contain kink-shaped, singular kink, bell-shaped soliton, singular soliton and periodic wave
solutions, have many potential applications in mathematical physics and engineering. The
simplicity and reliability of the proposed method is verified.
AN EFFICIENT PARALLEL ALGORITHM FOR COMPUTING DETERMINANT OF NON-SQUARE MATRI...ijdpsjournal
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).
Optimum Solution of Quadratic Programming Problem: By Wolfe’s Modified Simple...IJLT EMAS
In this paper, an alternative approach to the Wolfe’s
method for Quadratic Programming is suggested. Here we
proposed a new approach based on the iterative procedure for
the solution of a Quadratic Programming Problem by Wolfe’s
modified simplex method. The method sometimes involves less or
at the most an equal number of iteration as compared to
computational procedure for solving NLPP. We observed that
the rule of selecting pivot vector at initial stage and thereby for
some NLPP it takes more number of iteration to achieve
optimality. Here at the initial step we choose the pivot vector on
the basis of new rules described below. This powerful technique
is better understood by resolving a cycling problem.
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.
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.
CHN and Swap Heuristic to Solve the Maximum Independent Set ProblemIJECEIAES
We describe a new approach to solve the problem to find the maximum independent set in a given Graph, known also as Max-Stable set problem (MSSP). In this paper, we show how Max-Stable problem can be reformulated into a linear problem under quadratic constraints, and then we resolve the QP result by a hybrid approach based Continuous Hopfeild Neural Network (CHN) and Local Search. In a manner that the solution given by the CHN will be the starting point of the local search. The new approach showed a good performance than the original one which executes a suite of CHN runs, at each execution a new leaner constraint is added into the resolved model. To prove the efficiency of our approach, we present some computational experiments of solving random generated problem and typical MSSP instances of real life problem.
The numerical solution of Huxley equation by the use of two finite difference methods is done. The first one is the explicit scheme and the second one is the Crank-Nicholson scheme. The comparison between the two methods showed that the explicit scheme is easier and has faster convergence while the Crank-Nicholson scheme is more accurate. In addition, the stability analysis using Fourier (von Neumann) method of two schemes is investigated. The resulting analysis showed that the first scheme
is conditionally stable if, r ≤ 2 − aβ∆t , ∆t ≤ 2(∆x)2 and the second
scheme is unconditionally stable.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
A method for solving quadratic programming problems having linearly factoriz...IJMER
A new method namely, objective separable method based on simplex method is proposed for
finding an optimal solution to a quadratic programming problem in which the objective function can be
factorized into two linear functions. The solution procedure of the proposed method is illustrated with the
numerical example.
Derivation and Application of Multistep Methods to a Class of First-order Ord...AI Publications
Of concern in this work is the derivation and implementation of the multistep methods through Taylor’s expansion and numerical integration. For the Taylor’s expansion method, the series is truncated after some terms to give the needed approximations which allows for the necessary substitutions for the derivatives to be evaluated on the differential equations. For the numerical integration technique, an interpolating polynomial that is determined by some data points replaces the differential equation function and it is integrated over a specified interval. The methods show that they are only convergent if and only if they are consistent and stable. In our numerical examples, the methods are applied on non-stiff initial value problems of first-order ordinary differential equations, where it is established that the multistep methods show superiority over the single-step methods in terms of robustness, efficiency, stability and accuracy, the only setback being that the multi-step methods require more computational effort than the single-step methods.
Quadratic Programming : KKT conditions with inequality constraintsMrinmoy Majumder
In the case of Quadratic Programming for optimization, the objective function is a quadratic function. One of the techniques for solving quadratic optimization problems is KKT Conditions which is explained with an example in this tutorial.
In this chapter, the authors extend the theory of
the generalized difference Operator ∆L to the generalized
difference operator of the 풏
풕풉kind denoted by ∆L Where L
=푳 = {풍ퟏ,풍ퟐ,….풍풏} of positive reals풍ퟏ,풍ퟐ,….풍풏and obtain some
interesting results on the relation between the generalized
polynomial factorial of the first kind, 풏
풕풉kind and algebraic
polynomials. Also formulae for the sum of the general
partial sums of products of several powers of consecutive
terms of an Arithmetic progression in number theory are
derived.
EXACT SOLUTIONS OF A FAMILY OF HIGHER-DIMENSIONAL SPACE-TIME FRACTIONAL KDV-T...cscpconf
In this paper, based on the definition of conformable fractional derivative, the functional
variable method (FVM) is proposed to seek the exact traveling wave solutions of two higherdimensional
space-time fractional KdV-type equations in mathematical physics, namely the
(3+1)-dimensional space–time fractional Zakharov-Kuznetsov (ZK) equation and the (2+1)-
dimensional space–time fractional Generalized Zakharov-Kuznetsov-Benjamin-Bona-Mahony
(GZK-BBM) equation. Some new solutions are procured and depicted. These solutions, which
contain kink-shaped, singular kink, bell-shaped soliton, singular soliton and periodic wave
solutions, have many potential applications in mathematical physics and engineering. The
simplicity and reliability of the proposed method is verified.
AN EFFICIENT PARALLEL ALGORITHM FOR COMPUTING DETERMINANT OF NON-SQUARE MATRI...ijdpsjournal
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).
Optimum Solution of Quadratic Programming Problem: By Wolfe’s Modified Simple...IJLT EMAS
In this paper, an alternative approach to the Wolfe’s
method for Quadratic Programming is suggested. Here we
proposed a new approach based on the iterative procedure for
the solution of a Quadratic Programming Problem by Wolfe’s
modified simplex method. The method sometimes involves less or
at the most an equal number of iteration as compared to
computational procedure for solving NLPP. We observed that
the rule of selecting pivot vector at initial stage and thereby for
some NLPP it takes more number of iteration to achieve
optimality. Here at the initial step we choose the pivot vector on
the basis of new rules described below. This powerful technique
is better understood by resolving a cycling problem.
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.
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.
CHN and Swap Heuristic to Solve the Maximum Independent Set ProblemIJECEIAES
We describe a new approach to solve the problem to find the maximum independent set in a given Graph, known also as Max-Stable set problem (MSSP). In this paper, we show how Max-Stable problem can be reformulated into a linear problem under quadratic constraints, and then we resolve the QP result by a hybrid approach based Continuous Hopfeild Neural Network (CHN) and Local Search. In a manner that the solution given by the CHN will be the starting point of the local search. The new approach showed a good performance than the original one which executes a suite of CHN runs, at each execution a new leaner constraint is added into the resolved model. To prove the efficiency of our approach, we present some computational experiments of solving random generated problem and typical MSSP instances of real life problem.
RSC-CCP5 Workshop: Transport diffusion of confined fluids from equilibrium an...frentrup
Presentation given at the Joint RSC-CCP5 Workshop on Advances in Theory and Simulation of Non-Equilibrium Systems on 26 June 2011 in London, UK.
The talk shows how transport diffusion coefficients are mainly influenced by the mobility of a fluid as well as by the thermodynamic factor, which is related to the fluid's compressibility.
Robust Image Denoising in RKHS via Orthogonal Matching PursuitPantelis Bouboulis
We present a robust method for the image denoising task based on kernel ridge regression and sparse modeling. Added noise is assumed to consist of two parts. One part is impulse noise assumed to be sparse (outliers), while the other part is bounded noise. The noisy image is divided into small regions of interest, whose pixels are regarded as points of a two-dimensional surface. A kernel based ridge regression method, whose parameters are selected adaptively, is employed to fit the data, whereas the outliers are detected via the use of the increasingly popular orthogonal matching pursuit (OMP) algorithm. To this end, a new variant of the OMP rationale is employed that has the additional advantage to automatically terminate, when all outliers have been selected.
Existence results for fractional q-differential equations with integral and m...IJRTEMJOURNAL
This paper concerns a new kind of fractional q-differential equation of arbitrary order by
combining a multi-point boundary condition with an integral boundary condition. By solving the equation which
is equivalent to the problem we are going to investigate, the Green’s functions are obtained. By defining a
continuous operator on a Banach space and taking advantage of the cone theory and some fixed-point theorems,
the existence of multiple positive solutions for the BVPs is proved based on some properties of Green’s functions
and under the circumstance that the continuous functions f satisfy certain hypothesis. Finally, examples are
provided to illustrate the results.
Existence results for fractional q-differential equations with integral and m...journal ijrtem
This paper concerns a new kind of fractional q-differential equation of arbitrary order by
combining a multi-point boundary condition with an integral boundary condition. By solving the equation which
is equivalent to the problem we are going to investigate, the Green’s functions are obtained. By defining a
continuous operator on a Banach space and taking advantage of the cone theory and some fixed-point theorems,
the existence of multiple positive solutions for the BVPs is proved based on some properties of Green’s functions
and under the circumstance that the continuous functions f satisfy certain hypothesis. Finally, examples are
provided to illustrate the results.
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...ieijjournal
In this paper, we study the numerical solution of singularly perturbed parabolic convection-diffusion type
with boundary layers at the right side. To solve this problem, the backward-Euler with Richardson
extrapolation method is applied on the time direction and the fitted operator finite difference method on the
spatial direction is used, on the uniform grids. The stability and consistency of the method were established
very well to guarantee the convergence of the method. Numerical experimentation is carried out on model
examples, and the results are presented both in tables and graphs. Further, the present method gives a more
accurate solution than some existing methods reported in the literature.
FITTED OPERATOR FINITE DIFFERENCE METHOD FOR SINGULARLY PERTURBED PARABOLIC C...ieijjournal
In this paper, we study the numerical solution of singularly perturbed parabolic convection-diffusion type
with boundary layers at the right side. To solve this problem, the backward-Euler with Richardson
extrapolation method is applied on the time direction and the fitted operator finite difference method on the
spatial direction is used, on the uniform grids. The stability and consistency of the method were established
very well to guarantee the convergence of the method. Numerical experimentation is carried out on model
examples, and the results are presented both in tables and graphs. Further, the present method gives a more
accurate solution than some existing methods reported in the literature.
SUCCESSIVE LINEARIZATION SOLUTION OF A BOUNDARY LAYER CONVECTIVE HEAT TRANSFE...ijcsa
The purpose of this paper is to discuss the flow of forced convection over a flat plate. The governing partial
differential equations are transformed into ordinary differential equations using suitable transformations.
The resulting equations were solved using a recent semi-numerical scheme known as the successive
linearization method (SLM). A comparison between the obtained results with homotopy perturbation method and numerical method (NM) has been included to test the accuracy and convergence of the method.
This poster was created in LaTeX on a Dell Inspiron laptop with a Linux Fedora Core 4 operating system. The background image and the animation snapshots are dxf meshes of elastic waveform solutions, rendered on a Windows machine using 3D Studio Max.
AN EFFICIENT PARALLEL ALGORITHM FOR COMPUTING DETERMINANT OF NON-SQUARE MATRI...ijdpsjournal
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
).
Similar to Modeling the dynamics of molecular concentration during the diffusion procedure (20)
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Assuring Contact Center Experiences for Your Customers With ThousandEyes
Modeling the dynamics of molecular concentration during the diffusion procedure
1. International Journal of Engineering Inventions
e-ISSN: 2278-7461, p-ISSN: 2319-6491
Volume 3, Issue 5 (December 2013) PP: 21-23
Modeling the dynamics of molecular concentration during the
diffusion procedure
LingZhen Cao1, JiHong Yu2
College of life science, Jiangxi Normal University, Nanchang, P.R. China
Abstract: In this paper, a numerical method is proposed to solving a reaction-diffusion system. The systems
describe the solid state reaction mechanism of all the reaction components at the preparatory stage of yttrium
aluminum garnet (YAG) in one dimension. Kansa’s method and forward Euler method are employed to discrete
the spatial variable and time respectively.
Keywords: Kansa’s method, reaction-diffusion system, molecular concentration
I.
INTRODUCTION
In this paper, we employ the Kansa’s method to solve the nonlinear partial differential equation system
defined on the space x ∈ I ⊂ R1 as following.
∂c 1
∂t
∂c 2
∂t
∂c 3
∂t
= D1
= D2
= D3
∂2 c1
∂x 2
∂2c2
∂x 2
∂2c3
∂x 2
− 3κc1 c2 (1)
− 5κc1 c2 (2)
+ 2κc1 c2 (3)
with initial conditions ci x, 0 = ci0 (x), x ∈ I = (a, b) and with zero Neumann boundary conditions on the
∂c
boundary x = a and x = b, that is, i
= 0, i = 1,2,3,when t > 0.
∂x x=a
x=b
The mathematical model above is a reaction-diffusion system, which describes the solid state reaction
mechanism of all the reaction components at the preparatory stage of yttrium aluminium garnet (YAG ). Where
ci = ci (x,t) (i=1,2,3) are the concentrations of the i-th reactant respectively, i.e., Al2 O3 , Y2 O3 and Y3 Al5 O12 in
the reaction
3Al2 O3 +5Y2 O3 →2Y3 Al5 O12 ,
of the synthesis at a point x ∈ a, b at time t. D are the diffusion coefficients, that is, we
consider all the diffusion coefficients coincide. This assumption is general when this sizes of molecules are
nearly the same. For details, we refer the references [1–7].
It is well known that the system (1)-(3) in common three-dimensional case is complicated and so it is
difficult to implement the numerical modeling. In [2], the authors carried out the solution of the system (1)-(3)
numerically by using finite difference techniques in one-dimensional case and in two-dimensional case.
Sysmmetric implicit scheme and alternating direction scheme are employed in the former case and in the latter
case respectively. Both schemes were solved using stream sweeping method [8]. However, to guarantee the
convergence of the method of finite difference, it is necessary that the Courant-Friedrichs-Lewy (CFL)
condition, which says that the
time step should be less than a certain time in many explicit time-marching computer simulations, must be
satisfied[9].
This work is partially supported by the Natural Fund of JiangXi Province (No20122BAB204017) and
the Youth Fund of Department of Education of JiangXi Province (N0.GJJ13486). The authors would like to
thank Vice Prof. DaMing Yuan and JianJie YU (NanChang Hangkong University, P. R. China) for their helpful
discussions
In this paper, a meshless method is employed to compute the concentrations of the reactant of Al2 O3 , Y2 O3 and
Y3 Al5 O12 in the reaction
3Al2 O3 +5Y2 O3 →2Y3 Al5 O12 .
Generally, numerical methods, such as the finite element method (FEM), finite differences (FD) and
finite volumes (FV), transform a partial differential equation over continuum into a finite set of algebra
equations. In order to accomplish this tast, it is needed to discretize the domain into a grid, mesh or set of points
with a fixed connection among them. However, the generation of a well-behaved mesh is not a trivial question
except in very regular geometries. To compensate the difficulties in traditional mesh-based numerical methods,
meshless methods are emerged. Moreover, meshless methods are very fit for solving the problems in three
dimension space or when the domain is complicated, because there are no fixed connectivities among the nodes.
www.ijeijournal.com
Page | 21
2. Modeling the dynamics of molecular concentration during the diffusion procedure
Meshless methods have gained much attention in recent years, not only in the mathematics but also in the
engineering community. Much of the work concerning meshless approximation methods is the interdisciplinary
between mathematics and engineering. Many traditional numerical methods can either not handle such problems
at all, or are limited to very special situations. Meshless method is often better suited to cope with the changes in
the geometry of the domain of interest than classical discretization techniques such as finite difference, finite
elements or finite volumes. Another obvious advantage of meshless discretizations is their independence from a
mesh. Mesh generation is still the most time consuming part of any mesh-based numerical simulation. Since
meshless discretization techniques are based only on a set of independent points, these costs of mesh generation
are eliminated. Meshless approximation methods can be seen to provide a new generation of numerical tools.
There are many kind of meshless method, here we make a brief introduction of Kansa’s method, for more
details, we refer to the references [10].
A function Φ: Rs → R is called radial provided there exists an univariate function ϕ: 0, +∞ → R such that
Φ x = φ r , where r = x .
. usually is the Euclidean norm on Rs . It is obvious that for a radial function Φ,Φ x1 = Φ(x2 ) holds for all
x1 = x2 (x1 ,x2 ∈ Rs ). In standard Gaussian radial basis function (RBFs) approximant, the approximate
form of function is written as
c x ≈ N αi ϕ( x − xi ), x ∈ V. (4)
i=1
where αi (i = 1,2, … , N) ∈ R are the unknown coefficients to be determined.
N
i=1 αi ϕ( x − x i ) = c x k , k = 1,2, … , N. (5)
It is to be noted that there is a large class of RBF available and one have to choose appropriate one according
to his need. The most studied RBF including the multiquadric (MQ) ϕ r = r 2 + c 2 , inverse MQ ϕ r =
r 2
(r 2 + c 2 )−s , thin plate splines ϕ r = r 2 log
(r)and Gaussian exp
[−
]. For more details about RBF, we
c
refer the famous review of 29 interpolation method over scattered data [11].
In early 1990s, Kansa made the first attempt to extent RBF interpolation with multiquadrics to the solution of
PDEs in the strong form collocation formulation [12, 13]. The method, named the Kansa’s method, is a domain
type numerical technique in the sense that the problem is discretized not only on the boundary to satisfy
boundary conditions but also inside domain to satisfy the governing equation.
II.
NUMERICAL METHOD FOR SOLVING THE PROBLEM
To solve the systems (1)-(3) with the given initial and boundary conditions when I ⊂ R1 ,we make
assumption that all particles are of the same shape of cube shape and its volume is small enough. These are the
same as in the papers [2, 3] and readers can find more details in them.
In light of Kansa’s method, we write the concentrations cl , (l = 1,2,3) as
cl x, t = N αli (t)ϕ(x − xi ). (6)
i=1
Here, the set xi , i = 1,2,3, … , N is consisted by Halton points [14] in I and is chosen as the central set. x ∈
I (a, b) are known as the test points.
For simplicity, we introduce some other notations
ϕi = ϕ( x − xi ),
ϕi k = ϕ( x − xi x=x k ,
(1)
ϕi
=
(1)
ϕik =
(2)
ϕi
(2)
=
ϕik =
∂ ϕ( x−x i )
,
∂x
∂ ϕ( x−x i )
∂x
x=x k
∂ 2 ϕ( x−x i )
∂x 2
∂ 2 ϕ( x−x i )
∂x 2
,
,
x=x k
,
αl,m = αli (x,t m ),
i
ωτ = t m : t m = mτ, m = 0,1, … , M ,Mτ = T.
To solve the non-linear system (3), we propose an alternative iteration algorithm. The scheme is given as
c l x,t m +1 −c l (x,t m )
τ
=D
l,m+1
N
i=1 αi
(2)
ϕi
+ Dl κ
1,m
N
i=1 αi
ϕi
2,m
N
i=1 αi
ϕi ,
or equivalently,
(2)
l,m+1
N
ϕi = τ[D N αl,m ϕi + Dl κ N α1,m ϕi ( N α2,m ϕi )]+ N αl,m ϕi .
i=1 αi
i=1 i
i=1 i
i=1 i
i=1 i
Where Dl equals to−3,−5,2 whenl = 1,2,3, respectively. In the form of system, it can be written as follows,
www.ijeijournal.com
Page | 22
3. Modeling the dynamics of molecular concentration during the diffusion procedure
N
N
α1,m +1 ϕi
i
N
α1,m
i
= τ[D
i=1
N
(2)
ϕi
− 3κ
i=1
N
(2)
α2,m ϕi
i
i=1
N
i=1
N
αi,m ϕi 2 + 2κ
α3,m+1 ϕi = τ[D
i
i=1
i=1
i=1
N
α2,m ϕi )] +
i
i=1
N
α1,m ϕi (
i
i=1
α1,m ϕi
i
ϕi )] +
i=1
N
α1,m ϕi (
i
− 5κ
N
α2,m
i
ϕi (
i=1
N
α2,m +1 ϕi = τ[D
i
i=1
N
N
α1,m
i
α2,m ϕi
i
i=1
N
α2,m ϕi )] +
i
i=1
α3,m ϕi
i
i=1
(7)
When considering the boundary conditions, we denote
∂ϕ( a − xi )
ϕi 1 a =
∂x
∂ϕ( b − xi )
1
ϕi b =
∂x
Then we can obtain the following linear systems.
Al X l = F l , (8)
where Al ∈ R N+2 ×(N+2) with its entry Alki = ϕik when k = 1,2, … , N,Alki = ϕi 1 a and Alki = ϕi 1 b when
k = N + 1 and k = N + 2 respectively.
l
Fk = τ[D
l,m
N
i=1 αi
2
3
j=1 ϕjk
l
+ Dl κ
1,m
N
i=1 αi
ϕik (
2,m
N
i=1 αi
ϕik )]+
l,m
N
i=1 αi ϕik
when k = 1,2, … , N and F = 0 k = N + 1 and k = N + 2.
Acknowlege This work is partially supported by the Natural Fund of JiangXi Province (No20122BAB204017) and the
Youth Fund of Department of Education of JiangXi Province (N0.GJJ13486). The authors would like to thank Vice Prof.
DaMing Yuan and JianJie YU (NanChang Hangkong University, P. R. China) for their helpful discussions.
*Corresponding Author E_mail: clzclz1011@126.com
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
B.N. Arzamasov, V.N. Simonov, Circulation method for depositing diffusion coatings. Met. Sci. Heat Treat. 52(9-10), 403-407
(2011)
M. Mackeviˇcius, F. Ivanauskas, A. Kareiva, D. Jasaitis, A closer look at the computer modeling and sintering optimization in the
preparation of YAG, J. Math. Chem., 50(8), 2291-2302 (2012)
F. Ivanauskas, A. Kareiva, B. Lapcun, On the modelling of solid state reactions Synthesis of YAG, J. Math. Chem., 37(4), 365-376
(2005)
F. Ivanauskas, A. Kareiva, B. Lapcun, Diffusion and reaction rates of the yttrium aluminum garnet synthesis using different
techniques. J. Math. Chem. 42(2), 191C199 (2007)
F. Ivanauskas, A. Kareiva, B. Lapcun, Computational modeling of the YAG synthesis. J. Math. Chem. 46(2), 427C442 (2009)
J. H. Halton, On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals, Numer. Math.
2, 84-90 (1960)
T. T. Wong, W. S. Liu, P. A. Heng, Sampling with Hammersley and Halton points, J. Graphics Tools, 2, 9-24 (1997)
A.A. Samarskij, Theory of Finite Difference Schemes. Nauka, Moscow(1983).
R. Courant, K. Friedrichs and H. Lewy, On the partial difference equations of mathematical physics, V+76, New York Universty,
New York (1956)
G. R. Liu, Mesh Free Method-Moving beyond the finite element method. CRC Press, Boca Raton(2003).
R. Franke, Scattered data interpolation: tests of some methods, Math. Comput., 38,181-200 (1982).
E.J. Kansa, Multiquadrics-a scattered data approximation scheme with applications to computational fluid-dynamics. I. Surface
approximations and partial derivative estimates, Comput. Math. Appls., 19, 127-145 (1990)
E.J. Kansa, Multiquadrics-a scattered data approximation scheme with applications to computational fluid-dynamics. II. Surface
approximations and partial derivative estimates, Comput. Math. Appls., 19, 147-161 (1990)
G. E. Fasshauer, Meshfree approximation methods with Matlab. World Scientific Press, Hackensack (2007).
www.ijeijournal.com
Page | 23