Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Stability (21)
- Convex functions (19)
- Genetic algorithm (18)
- Fixed point (16)
- Classification (13)
-
- Optimization (13)
- Clustering (11)
- Convergence (11)
- Data mining (11)
- Simulation (11)
- Authentication (10)
- Cloud computing (10)
- Magnetic field (10)
- Maximum likelihood estimation (10)
- Optimal control (10)
- Cloud Computing (9)
- Prediction (9)
- Soft set (9)
- Chaos (8)
- Fractional calculus (8)
- Genetic Algorithm (8)
- Initial value problems (8)
- Moments (8)
- Multistep (8)
- Particle swarm optimization (8)
- Security (8)
- Symmetric (8)
- Time delay (8)
- Variational inequalities (8)
- Wireless sensor networks (8)
Articles 1801 - 1830 of 2320
Full-Text Articles in Entire DC Network
Efficient Chosen-Ciphtertext Secure Public Key Encryption Scheme From Lattice Assumption, Fenghe Wang, Chunxiao Wang, Yupu Hu
Efficient Chosen-Ciphtertext Secure Public Key Encryption Scheme From Lattice Assumption, Fenghe Wang, Chunxiao Wang, Yupu Hu
Applied Mathematics & Information Sciences
Using the Bonsai trees primitive and Gentry’s CPA-secure (chosen-plaintext attack) public-key encryption (PKE) scheme, we propose an efficient chosen-ciphtertext secure PKE scheme over lattice. If the decision variant of the learning with errors (LWE) problem is hard and the one-time signature used in this scheme is strong unforgeable, the proposed PKE scheme is indistinguishable against the adaptive chosen-ciphtertext attack (IND-CCA2). One of the characters for this scheme is that, before any encryption operation, the encryption algorithm uses a new choice rule to fix the public parameter matrixes used in the encryption operation. With the help of this new choice rule, …
First-Level Transitivity Rule Method For Filling In Incomplete Pair-Wise Comparison Matrices In The Analytic Hierarchy Process, Bojan Srdjevic, Zorica Srdjevic, Bosko Blagojevic
First-Level Transitivity Rule Method For Filling In Incomplete Pair-Wise Comparison Matrices In The Analytic Hierarchy Process, Bojan Srdjevic, Zorica Srdjevic, Bosko Blagojevic
Applied Mathematics & Information Sciences
The paper discusses the problem of performing the prioritization of decision elements within the multicriteria optimization method, analytic hierarchy process (AHP), with incomplete information. An approach is proposed on how to fill in the gap in the pair-wise comparison matrix generated within an AHP standard procedure; that is, to reproduce one missing judgment of the decision maker while assuring the reproduced judgment belongs to the same ratio scale used while other judgments are elicited. The first-level transitivity rule (FLTR) approach is proposed based on screening matrix entries in the neighborhood of a missing one. Scaling (where necessary) and geometric averaging …
A Thermostatted Kinetic Framework With Particle Refuge For The Modeling Of Tumors Hiding, Carlo Bianca, Christian Dogbe, Luca Guerrini
A Thermostatted Kinetic Framework With Particle Refuge For The Modeling Of Tumors Hiding, Carlo Bianca, Christian Dogbe, Luca Guerrini
Applied Mathematics & Information Sciences
Recently, thermostatted kinetic models have been proposed for the modeling of complex systems subjected to external force fields. This paper deals with the derivation of a generalized thermostatted kinetic framework, which incorporates particles refuge. From the qualitative viewpoint, the global in time existence and uniqueness of the solution to the relative Cauchy problem, the time evolution of the moments of the solution, and the existence of stationary solutions are discussed. Applications refer to biological systems and especially to tumor-escape from immune system surveillance, indeed within this framework an mathematical model for the tumorimmune system competition is derived. Further research directions …
On Global Attractors For A Class Of Parabolic Problems, Rodiak Figueroa-L?Pez, German Lozada-Cruz
On Global Attractors For A Class Of Parabolic Problems, Rodiak Figueroa-L?Pez, German Lozada-Cruz
Applied Mathematics & Information Sciences
This paper is devoted to study the existence of global attractor in H1 0 (W) and uniform bounds of it in L¥(W) for a class of parabolic problems with homogeneous boundary conditions wich involves a uniform strongly elliptic operator of second order in the domain W ⊂ Rn. The main tools used to prove the existence of global attractor are the techniques used in Hale [8] and Cholewa [5], and for the uniform bound of the attractor we use the Alikakos-Moser iteration procedure [1].
Half Inverse Problem For The Sturm-Liouville Operator With Coulomb Potential, Murat Sat
Half Inverse Problem For The Sturm-Liouville Operator With Coulomb Potential, Murat Sat
Applied Mathematics & Information Sciences
In this paper, we discuss a half inverse problem for the Sturm-Liouville operator with Coulomb potential and show that if q(x) is prescribed on [ p 2 ,p] then only one spectrum is sufficient to determine potential function q(x) on the whole interval (0,p].
Hill Cipher Modification Based On Pseudo-Random Eigenvalues, Ahmed Mahmoud, Alexander Chefranov
Hill Cipher Modification Based On Pseudo-Random Eigenvalues, Ahmed Mahmoud, Alexander Chefranov
Applied Mathematics & Information Sciences
The Hill cipher is resistant to brute-force and statistical attacks, but it can be broken with a known plaintext-ciphertext attack (KPCA). In this paper, we propose a modification of the Hill cipher, HCM-PRE, which is still resistant to brute-force and statistical attacks, and is resistant also to KPCA due to dynamic encryption key matrix generating. With the modification, the new HCM-PRE can be applied widely in the systems which need high security (e.g., image encryption). Experimental results show that the proposed modification is significantly more effective in the encryption quality of images than original Hill cipher and its known modifications …
Point Multiplication Using Integer Sub-Decomposition For Elliptic Curve Cryptography, Ruma Kareem K. Ajeena, Hailiza Kamarulhaili
Point Multiplication Using Integer Sub-Decomposition For Elliptic Curve Cryptography, Ruma Kareem K. Ajeena, Hailiza Kamarulhaili
Applied Mathematics & Information Sciences
In this work, we proposed a new approach called integer sub-decomposition (ISD) based on the GLV idea to compute any multiple kP of a point P of order n lying on an elliptic curve E. This approach uses two fast endomorphisms y1 and y2 of E over prime field Fp to calculate kP. The basic idea of ISD method is to sub-decompose the returned values k1 and k2 lying outside the range √n from the GLV decomposition of a multiplier k into integers k11, k12, k21 and k22 with −√n < k11, k12, k21, k22 < √n. These integers are computed by solving a closest vector problem in lattice. The new proposed algorithms and implementation results are shown and discussed in this study.
Some Classes Of K-Uniformly Functions With Bounded Radius Rotation, Khalida Inayat Noor, Rabia Fayyaz, Muhammad Aslam Noor
Some Classes Of K-Uniformly Functions With Bounded Radius Rotation, Khalida Inayat Noor, Rabia Fayyaz, Muhammad Aslam Noor
Applied Mathematics & Information Sciences
We use Ruscheweyh derivative to define certain new classes of analytic functions with bounded radius rotation and related to conic domains. Some interesting and significant results such as inclusion results, growth rate of coefficients and radius problems for these new classes of k-uniformly functions. Several special cases are discussed. Results obtained in this paper may stimulate further research activities in this field.
A Chebyshev-Gauss-Radau Scheme For Nonlinear Hyperbolic System Of First Order, E. H. Doha, A. H. Bhrawy, R. M. Hafez, M. A. Abdelkawy
A Chebyshev-Gauss-Radau Scheme For Nonlinear Hyperbolic System Of First Order, E. H. Doha, A. H. Bhrawy, R. M. Hafez, M. A. Abdelkawy
Applied Mathematics & Information Sciences
A numerical approximation of the initial-boundary system of nonlinear hyperbolic equations based on spectral collocation method is presented in this article. A Chebyshev-Gauss-Radau collocation (C-GR-C) method in combination with the implicit Runge- Kutta scheme are employed to obtain highly accurate approximations to the mentioned problem. The collocation points are the Chebyshev interpolation nodes. This approach reduces this problem to solve system of nonlinear ordinary differential equations which are far easier to be solved. Indeed, by selecting a limited number of collocation nodes, we obtain an accurate results. The numerical examples demonstrate the accuracy, efficiency, and versatility of the method.
A Graph-Theoretic Method To Representing A Concept Lattice, Hua Mao
A Graph-Theoretic Method To Representing A Concept Lattice, Hua Mao
Applied Mathematics & Information Sciences
Concept lattices are indeed lattices. In this paper, we present a new relationship between lattices and graphs: given a binary relation I, we define an underlying graph DI , and find out the constitution in the set of cover elements of the minimum element of the concept lattice of I using the properties of DI . The following is to provide a way to establish a one-to-one correspondence between the set of covers of an element in the concept lattice and the set of covers of the minimum in a sublattice of the concept lattice. We apply the one-to-one correspondence …
Improved Approach To Global Localization Based On Odometry Error Modeling For Mobile Robots, Jingdong Yang, Jinghui Yang
Improved Approach To Global Localization Based On Odometry Error Modeling For Mobile Robots, Jingdong Yang, Jinghui Yang
Applied Mathematics & Information Sciences
It is often the odometry accumulative error without bound after long-range movement that decreases the precision of global localization for wheeled mobile robots. Therefore, an efficient approach to odometry error modeling is proposed regarding gentle drive type mobile robots. The approximate functional expressions, between process input of odometry and non-systematic error as well as systematic error, are derived based on odometry error propagation law. Further, the odometry error model is applied to the global localization to compensate the accumulative error during long-time navigation. In addition, Because a lot of candidate poses of robots are generated in the process of monocular …
Sensor Node Deployment In Wireless Sensor Networks Based On Ionic Bond-Directed Particle Swarm Optimization, Haiping Huang
Sensor Node Deployment In Wireless Sensor Networks Based On Ionic Bond-Directed Particle Swarm Optimization, Haiping Huang
Applied Mathematics & Information Sciences
Sensor node deployment is one of the critical topics addressed in wireless sensor networks (WSNs) research, which determines coverage efficiency of WSNs. This paper proposes a self-organizing algorithm for enhancing the coverage for WSNs, which is so-called Ionic bond-directed particle swarm optimization (IBPSO). The proposed algorithm combines the ionic bond method with particle swarm optimization (PSO), where ionic bond method uses a judicious ionic bond between two sensor nodes to determine which node needs to move and also the path and direction of the movement and PSO is suitable for solving multi-dimension function optimization in continuous space. Simulation results demonstrate …
Geometrically Relative Convex Functions, Muhammad Aslam Noor, Khalida Inayat Noor, Muhammad Uzair Awan
Geometrically Relative Convex Functions, Muhammad Aslam Noor, Khalida Inayat Noor, Muhammad Uzair Awan
Applied Mathematics & Information Sciences
In this paper, some new concepts of geometrically relative convex sets and relative convex functions are defined. These new classes of geometrically relative convex functions unify several known and new classes of relative convex functions such as exponential convex functions. New Hermite-Hadamard type integral inequalities are derived for these new classes of geometrically relative convex functions and their variant forms. Some special cases, which can be obtained from our results, are discussed. Results proved in this paper represent significant improvements of the previously known results. We would like to emphasize that the results obtained and discussed in this paper may …
Eemd-Based Speaker Automatic Emotional Recognition In Chinese Mandarin, Yuqiang Qin, Yudong Qi
Eemd-Based Speaker Automatic Emotional Recognition In Chinese Mandarin, Yuqiang Qin, Yudong Qi
Applied Mathematics & Information Sciences
Emotion feature extraction is the key to speech emotional recognition. And ensemble empirical mode decomposition(EEMD) is a newly developed method aimed at eliminating emotion mode mixing present in the original empirical mode decomposition(EMD). To evaluate the performance of this new method, this paper investigates the effect of a parameters pertinent to EEMD: speech emotional envelope. Firstly, a speaker emotional envelope features extraction based on EEMD is proposed in the paper. Using the piecewise power function in speech emotional envelope has a better effect in emotional identification. At the same time, the proposed technique has been utilized for classification of four …
Enhancing Mlp Performance In Intrusion Detection Using Optimal Feature Subset Selection Based On Genetic Principal Components, Iftikhar Ahmad
Enhancing Mlp Performance In Intrusion Detection Using Optimal Feature Subset Selection Based On Genetic Principal Components, Iftikhar Ahmad
Applied Mathematics & Information Sciences
Computer and network systems nowadays are facing many security issues, one of which considered important is intrusion. To prevent such intrusion, a mechanism for optimal intrusion detection is deemed necessary. A number of tools and techniques are available, yet most of them still face a main problem that is on performance. The performance, in essence, can be increased by reducing false positives and increasing accurate detection rate. What has made the performance terrible in the existing intrusion detection approaches is due to the use of a raw dataset that includes redundancy and leads the classifier to be confused. To overcome …
An Expansion Method Dealing With Spatial Incompleteness Of Measured Mode Shapes Of Beam Structures, Liu Fushun, Chen Wenwen, Wang Weiying
An Expansion Method Dealing With Spatial Incompleteness Of Measured Mode Shapes Of Beam Structures, Liu Fushun, Chen Wenwen, Wang Weiying
Applied Mathematics & Information Sciences
Obtaining mode shape values at rotational degrees of freedom (dofs) is a challenge from dynamic test of beam structures, for the reason that rotational dofs are usually difficult to be measured. This article proposes an expansion method to deal with spatial incompleteness of measured mode shapes of beam structures. One improvement is that the constrained linear least squares is combined into traditional expansion procedure proposed by Liu (2011), to estimate modeling errors in a physical meaning interval; and the initial guesses on mode-correction coefficients could be obtained using a non-iterative technique for improving the convergence of the approach. A cantilever …
A Novel Approach To Generate The Property For Web Service Verification From Threat-Driven Model, Yonghua Zhu, Honghao Gao
A Novel Approach To Generate The Property For Web Service Verification From Threat-Driven Model, Yonghua Zhu, Honghao Gao
Applied Mathematics & Information Sciences
Web service is considered as one of the most promising computing paradigms, which works as plugin mode to provide the value-added applications in Service-Oriented Computing (SOC) and Service-Oriented Architecture (SOA). The general Web service verification focuses on functionality and its termination, such as deadlock or livelock. However, it might not be able to help in accurately understanding service behaviours because it lacks interaction verifications, especially temporal behaviours. To this point, automatically generating proper temporal logic formulae of verification property is a primary and important task since the manual property generation is time-consuming and error-prone. Thus, this paper proposes an approach …
A New Optimized Symmetric Embedded Predictor- Corrector Method (Epcm) For Initial-Value Problems With Oscillatory Solutions, G. A. Panopoulos, T. E. Simos
A New Optimized Symmetric Embedded Predictor- Corrector Method (Epcm) For Initial-Value Problems With Oscillatory Solutions, G. A. Panopoulos, T. E. Simos
Applied Mathematics & Information Sciences
In this work a new optimized symmetric eight-step embedded predictor-corrector method (EPCM) with minimal phase-lag and algebraic order ten is presented. The method is based on the symmetric multistep method of Quinlan-Tremaine [1], with eight steps and eighth algebraic order and is constructed to solve numerically IVPs with oscillatory solutions. We compare the new method to some recently constructed optimized methods and other methods from the literature. We measure the efficiency of the methods and conclude that the new optimized method with minimal phase-lag is noticeably most efficient of all the compared methods and for all the problems solved including …
Characterizations Of Regular Semigroups, Bingxue Yao
Characterizations Of Regular Semigroups, Bingxue Yao
Applied Mathematics & Information Sciences
The concepts of (l ,m)−fuzzy subsemigroup and various (l ,m)−fuzzy ideals of a semigroup were introduced by generalizing (∈,∈∨q)−fuzzy subsemigroup and (∈,∈∨q)−fuzzy ideal. The regular semigroup was characterized by the properties of the middle parts of various (l ,m)−fuzzy ideals, and several equivalence conditions of regular semigroups were obtained.
Feature Of Statistical Projection Algorithm-Based Image Retrieval, Xiaofei Zheng, Zhe Gao, Wei Luo
Feature Of Statistical Projection Algorithm-Based Image Retrieval, Xiaofei Zheng, Zhe Gao, Wei Luo
Applied Mathematics & Information Sciences
In this paper, image retrieval method based on statistics and projection is presented. At first, images are transferred from the RGB color model to the HSI color model, then images are segmented into sub-images (or blocks) and extract the main hue and main intensity in these sub-images. Images’ main hue and main intensity are projected onto the horizontal and vertical directions, respectively, and four projective histograms were obtained. Finally, the first three central moments are taken as feature as to compute the similarity between images.
Enhancement Of Atom-Field Transfer Of Coherence In A Two-Photon Micromaser Assisted By A Classical Field, A. F. Gomes, A. Vidiella-Barranco
Enhancement Of Atom-Field Transfer Of Coherence In A Two-Photon Micromaser Assisted By A Classical Field, A. F. Gomes, A. Vidiella-Barranco
Applied Mathematics & Information Sciences
We investigate the transfer of coherence from atoms to a cavity field initially in a statistical mixture within a two-photon micromaser arrangement. The field is progressively modified from a maximum entropy state (thermal state) towards an almost pure state (entropy close to zero) due to its interaction with atoms sent across the cavity. We trace over the atomic variables, i.e., the atomic states are not measured and recorded by a detector after they leave the cavity. We show that by applying an external classical driving field it is possible to substantially increase the field purity without the need of previously …
Towards A Uml Profile To Relational Database Modeling, Chih-Min Lo, Hsiu-Yen Hung
Towards A Uml Profile To Relational Database Modeling, Chih-Min Lo, Hsiu-Yen Hung
Applied Mathematics & Information Sciences
Database management systems provide a mechanism that enables software application systems to manipulate data from a database. Although object-oriented technology is widely used in the development of software systems, relational database management systems remain the dominant database technology. Database modeling enables software developers to design the database during the system analysis and design phase; however, most approaches focus only on designing database schemas, without considering models for the retrieval of data. A comprehensive database model would provide a solid base on which software developers could organize data for storage and retrieval. Unified modeling language (UML) is a general purpose modeling …
Image Retrieval Based On The Multiwavelets Texture-Spatial Features, An Zhiyong, Li Jinjiang, Zhao Feng, Guo Jie
Image Retrieval Based On The Multiwavelets Texture-Spatial Features, An Zhiyong, Li Jinjiang, Zhao Feng, Guo Jie
Applied Mathematics & Information Sciences
A new retrieval algorithm based on the texture-spatial texture using the GHMmultiwavelets is presented. In order to describe the important visual information of image, we design the improved multiwavelets quantization map that can depict the important visual information for the multiwavelets sub-bands. Furthermore, the visual spatial histogram of multiwavelets quantization map is used as the texture-spatial features that denote the global texture information of image. At the same time, the local binary pattern is used to describe the local texture-spatial feature for the low frequency multiwavelets sub-band. Finally, the similarity of visual spatial histogram is computed by the spatial-weighted distance. …
Artificial Immune Algorithm For Solving Fixed Charge Transportation Problem, Khalid M. Altassan, Mahmoud M. El-Sherbiny, Ahmed D. Abid
Artificial Immune Algorithm For Solving Fixed Charge Transportation Problem, Khalid M. Altassan, Mahmoud M. El-Sherbiny, Ahmed D. Abid
Applied Mathematics & Information Sciences
Fixed Charge Transportation Problem (FCTP) is considered to be an NP-hard problem. Several genetic algorithms based on spanning tree and Prfer number were presented.Most of such methods do not guarantee the feasibility of all the generated chromosomes and need a repairing procedure for feasibility. Contrary to the findings in previous works, this paper introduces an Artificial Immune System for solving Fixed Charge Transportation Problems (AISFCTP). AISFCTP solves both balanced and unbalanced FCTP without introducing a dummy supplier or a dummy customer. In AISFCTP a coding schema is designed and algorithms are developed for decoding such schema and allocating the transported …
The Effect Evaluation Of Density Estimation Through Non-Gaussian Measurement, Feng Zhao, Zhiyong An, Hailan Jiang
The Effect Evaluation Of Density Estimation Through Non-Gaussian Measurement, Feng Zhao, Zhiyong An, Hailan Jiang
Applied Mathematics & Information Sciences
How to test the effect of density estimation methods is the key problem in the statistics. This paper presents a new criterion for assessing the effect of density estimation to select the suitable density estimation method, using the maximum-entropy non-Gaussian measurement. Comparing withc2-test and Dn-test, the method avoids the problem of the data interval division, and it is suitable for any type probability distribution. Simulation results show that the proposed method can accurately discriminate the pros and cons of different density estimation methods..
Image Sand Style Painting Algorithm, Fan Hui, Chen Zheng, Li Jinjiang
Image Sand Style Painting Algorithm, Fan Hui, Chen Zheng, Li Jinjiang
Applied Mathematics & Information Sciences
With the development of computer technology and the improvement of people’s living level, the use of computers to deal with the photos is more and more popular. How to combine the computer and image perfectly will directly affect the quality of our image. Research of this article is how to manage the image by computer to desertification, that processing the image into desertification style. The result of traditional desertification method is not ideal, this article based on the matrix low-rank decomposition to processing image that decompose the matrix corresponding from the image, deal with the high order matrix into low …
Analysis Of Stakeholders’ Behaviour Depending On Time In Virtual Learning Environment, Michal Munk, Martin Drl?K
Analysis Of Stakeholders’ Behaviour Depending On Time In Virtual Learning Environment, Michal Munk, Martin Drl?K
Applied Mathematics & Information Sciences
The aim of the paper is the probability modelling of accesses to the different parts of e-learning course in interactive learning environment depending on time. This problem belongs to the open questions of the contemporary emerging discipline Educational Data Mining.We are concerned with the access probabilities to the individual parts of e-learning course content. For the purpose of modelling of the stakeholders’ behaviour dependence on time, we use multinominal logit model which is a special case of Generalized Linear Model. We pay attention to data preparation issues. Data about using e-learning courses are stored in databases. We assume that these …
Applied Study On Image Retrievals Based On Statistics Projection Algorithm And Robert Algorithm, Xiaofei Zheng, Zhe Gao, Enping Liu
Applied Study On Image Retrievals Based On Statistics Projection Algorithm And Robert Algorithm, Xiaofei Zheng, Zhe Gao, Enping Liu
Applied Mathematics & Information Sciences
In this paper, image retrieval method based on statistics and projection is presented. At first, images are transferred from the RGB color model to the HSI color model, and then images are segmented into sub-images (or blocks) and extract the mainhue and mainintensity in these sub-images. Images’s mainhue and mainintensity are projected onto the horizontal and vertical directions, respectively, and four projectiv
Weight Analysis Based On Anp And Qfd In Software Quality Evaluation, Kewen Li, Yu Zhang, Wenying Liu
Weight Analysis Based On Anp And Qfd In Software Quality Evaluation, Kewen Li, Yu Zhang, Wenying Liu
Applied Mathematics & Information Sciences
Over the past two decades, considerable efforts focused on improving software quality to satisfy the customers needs in software industry, but it is hard to deal with the customers needs for its vague and inexact characteristic. In order to evaluate software quality accurately and comprehensively, the weights of customers needs and the weights of technical attributes of the software are determined by ANP and QFD in the paper. An illustrated example is presented to show the application of the proposed model, and the results show that the weights of product characteristics and the customers needs in HoQ (House of Quality) …
Mcr-Miner: Maximal Confident Association Rules Miner Algorithm For Up/Down-Expressed Genes, Wael Zakaria, Yasser Kotb, Fayed Ghaleb
Mcr-Miner: Maximal Confident Association Rules Miner Algorithm For Up/Down-Expressed Genes, Wael Zakaria, Yasser Kotb, Fayed Ghaleb
Applied Mathematics & Information Sciences
DNA microarrays allow simultaneous measurements of expression levels for a large number of genes across a number of different experimental conditions (samples). The algorithms for mining association rules are used to reveal biologically relevant associations between different genes under different experimental samples. This paper presents a new column-enumeration based method algorithm (abbreviated by MCR-Miner) for mining maximal high confidence association rules for up/down-expressed genes. MCR-Miner algorithm uses an efficient maximal association rules tree data structure (abbreviated by MAR-Tree). MAR-tree enumerates (lists) all genes with their binary representations, the binary representation of a gene saves the status (normal, up, and downexpressed) …