]>
2015
15
1
95
New Information Inequalities in Terms of One Parametric Generalized Divergence Measure and Application
New Information Inequalities in Terms of One Parametric Generalized Divergence Measure and Application
en
en
In this work, firstly we introduce the new information divergence measure, characterize it and get the mathematical relations with other divergences. Further, we introduce new information inequalities on the new generalized f- divergence measure in terms of the well-known one parametric generalized divergence. Further, we obtain bounds of the new divergence and the Relative J- divergence as an application of new information inequalities by using Logarithmic power mean and Identric mean, together with numerical verification by taking two discrete probability distributions: Binomial and Poisson. Approximate relations of the new divergence and Relative J- divergence with Chi- square divergence, have been obtained respectively.
1
22
K. C.
Jain
P.
Chhabra
New divergence
New information inequalities
Parametric generalized divergence
Bounds
Logarithmic power mean
Identric mean
Binomial and Poisson distributions
Asymptotic approximation.
Article.1.pdf
[
[1]
R. K. Bajaj, D. S. Hooda , Generalized measures of fuzzy directed divergence, total ambiguity and information improvement, Journal of Applied Mathematics, Statistics and Informatics, 6 (2010), 31-44
##[2]
M. B. Bassat , f- Entropies, probability of error and feature selection, Inform. Control, 39 (1978), 227-242
##[3]
P. K. Bhatia, S. Singh , On a new Csiszar’s f- divergence measure, Cybernetics and Information Technologies, 13 (2013), 43-56
##[4]
J. S. Bhullar, O. P. Vinocha, M. Gupta , Generalized measure for two utility distributions, Proceedings of the World Congress on Engineering, 3 (2010), 1-30
##[5]
L. M. Bregman , The relaxation method to find the common point of convex sets and its applications to the solution of problems in convex programming, USSR Comput. Math. Phys., 7 (1967), 200-217
##[6]
J. Burbea, C. R. Rao , On the convexity of some divergence measures based on entropy functions, IEEE Trans. on Inform. Theory, IT, 28 (1982), 489-495
##[7]
H. C. Chen , Statistical pattern recognition, Hoyderc Book Co., Rocelle Park, New York (1973)
##[8]
C. K. Chow, C. N. Lin , Approximating discrete probability distributions with dependence trees, IEEE Trans. Inform. Theory, 14 (1968), 462-467
##[9]
I. Csiszar , Information measures: A Critical survey, in Trans. – In: Seventh Prague Conf. on Information Theory, Academia, Prague, (1974), 73-86
##[10]
I. Csiszar , Information type measures of differences of probability distribution and indirect observations, Studia Math. Hungarica, 2 (1967), 299-318
##[11]
D. Dacunha- Castelle , Ecole d’Ete de Probabilites de, Saint-Flour VII-1977, Heidelberg, New York: Springer, Berlin (1978)
##[12]
S. S. Dragomir, V. Gluscevic, C. E. M. Pearce , Approximation for the Csiszar’s f- divergence via midpoint inequalities, in Inequality Theory and Applications - Y.J. Cho, J.K. Kim, and S.S. Dragomir (Eds.), Nova Science Publishers, Inc., Huntington, New York, 1 (2001), 139-154
##[13]
S. S. Dragomir, M. L. Scholz, J. Sunde , Some upper bounds for relative entropy and applications, Computers and Mathematics with Applications, 39 (2000), 91-100
##[14]
D. V. Gokhale, S. Kullback , Information in contingency Tables, New York, Marcel Dekker (1978)
##[15]
D. S. Hooda , On generalized measures of fuzzy entropy, Mathematica Slovaca, 54 (2004), 315-325
##[16]
K. C. Jain, P. Chhabra , Series of new information divergences, properties and corresponding series of metric spaces, International Journal of Innovative Research in Science, Engineering and Technology, 3 (2014), 12124-12132
##[17]
K. C. Jain, P. Chhabra , New series of information divergence measures and their properties, Appl. Math. Inf. Sci., 10 (2016), 1433-1446
##[18]
K. C. Jain, R. N. Saraswat , Some new information inequalities and its applications in information theory, International Journal of Mathematics Research, 4 (2012), 295-307
##[19]
P. Jha, V. K. Mishra , Some new trigonometric, hyperbolic and exponential measures of fuzzy entropy and fuzzy directed divergence, International Journal of Scientific and Engineering Research, 3 (2012), 1-5
##[20]
L. Jones, C. Byrne , General entropy criteria for inverse problems with applications to data compression, pattern classification and cluster analysis, IEEE Trans. Inform. Theory, 36 (1990), 23-30
##[21]
T. T. Kadota, L. A. Shepp , On the best finite set of linear observables for discriminating two Gaussian signals, IEEE Trans. Inform. Theory, 13 (1967), 278-284
##[22]
T. Kailath , The divergence and Bhattacharyya distance measures in signal selection, IEEE Trans. Comm. Technology, 15 (1967), 52-60
##[23]
D. Kazakos, T. Cotsidas , A decision theory approach to the approximation of discrete probability densities, IEEE Trans. Perform. Anal. Machine Intell, 1 (1980), 61-67
##[24]
F. Nielsen, S. Boltz , The Burbea-Rao and Bhattacharyya centroids, Arxiv, (2010), -
##[25]
K. Pearson , On the Criterion that a given system of deviations from the probable in the case of correlated system of variables is such that it can be reasonable supposed to have arisen from random sampling, Phil. Mag., 50 (1900), 157-172
##[26]
E. C. Pielou , Ecological diversity, Wiley, New York (1975)
##[27]
A. Renyi , On measures of entropy and information, Proc. 4th Berkeley Symposium on Math. Statist. and Prob., 1 (1961), 547-561
##[28]
R. Santos-Rodriguez, D. Garcia-Garcia, J. Cid-Sueiro , Cost-sensitive classification based on Bregman divergences for medical diagnosis, In M.A. Wani, editor, Proceedings of the 8th International Conference on Machine Learning and Applications (ICMLA'09), Miami Beach, Fl., USA, December 13-15, (2009), (2009), 551-556
##[29]
R. Sibson , Information radius, Z. Wahrs. Undverw. Geb., 14 (1969), 149-160
##[30]
H. C. Taneja, R. K. Tuteja , Characterization of a quantitative- qualitative measure of inaccuracy, Kybernetika, 22 (1968), 393-402
##[31]
I. J. Taneja , New developments in generalized information measures, Chapter in: Advances in Imaging and Electron Physics, Ed. P.W. Hawkes, 91 (1995), 37-135
##[32]
I. J. Taneja, P. Kumar , Generalized non-symmetric divergence measures and inequalities, The Natural Science and Engineering Research Council’s Discovery grant to Pranesh Kumar, (2000)
##[33]
B. Taskar, S. Lacoste-Julien, M. I. Jordan , Structured prediction, dual extra gradient and Bregman projections, Journal of Machine Learning Research, 7 (2006), 1627-1653
##[34]
H. Theil , Statistical decomposition analysis, North-Holland, Amsterdam (1972)
##[35]
H. Theil , Economics and information theory, North-Holland, Amsterdam (1967)
##[36]
B. Vemuri, M. Liu, S. Amari, F. Nielsen , Total Bregman divergence and its applications to DTI analysis, IEEE Transactions on Medical Imaging, (2010)
]
Linear Equations and Systems in Fuzzy Environment
Linear Equations and Systems in Fuzzy Environment
en
en
The paper discusses fuzzy real and complex linear equations and system of linear equations with coefficients as crisp and the right-hand side as generalized trapezoidal fuzzy number where fuzzy numbers have been represented with mean and semi width. We have solved each case by using the concept of Strong and Weak solution with numerical examples.
23
31
Sanhita
Banerjee
Tapan Kumar
Roy
Fuzzy Linear Equation
Fuzzy System of Linear Equations
Generalized Trapezoidal Fuzzy Number (GTrFN)
Strong and Weak solutions.
Article.2.pdf
[
[1]
Amit Kumar, Neetu, Abhinav Bansal, A new approach for solving fully fuzzy linear systems, Hindawi Publishing Corporation, Advances in Fuzzy Systems, (2011), 1-8
##[2]
Amit Kumar, Neetu, Abhinav Bansal, A new method to solve fully fuzzy linear system with trapezoidal fuzzy numbers, Canadian Journal on Science and Engineering Mathematics, vol.1 , (2010)
##[3]
Didier Dubois, Henri Prade, Systems of fuzzy linear constraints, , (1978)
##[4]
T. Allahviranloo, N. Mikaeilvand, F. Hoseinzadeh Lotfi, M. Fallah Jelodar, Fully Fuzzy Linear Systems, International Journal of Applied Operaional Research, 1 (2011), 35-48
##[5]
J. J. Buckley, Y. Qu, Solving systems of linear fuzzy equations, Fuzzy Sets and Systems, 43 (1991), 33-43
##[6]
J. J. Buckley, Fuzzy input-output analysis, European journal of operational research , 39 (1989), 54-60
##[7]
J. J. Buckley, Y. Qu, Solving linear and quadratic fuzzy equations, Fuzzy Sets and Systems , 38 (1990), 43-59
##[8]
J. J. Buckley, Y. Qu, On using ∝-cuts to evaluate fuzzy equations, Fuzzy Sets and Systems , 38 (1990), 309-312
##[9]
J. J. Buckley, Y. Qu, Solving fuzzy equations: a new solution concept, Fuzzy Sets and Systems , 39 (1991), 291-301
##[10]
L. A. Zadeh, Fuzzy sets as a basis for a theory of possibility, Fuzzy Sets and Systems, 1 (1978), 3-28
##[11]
L. A. Zadeh, The concept of a linguistic variable and its application to approximate reasoning, I Information Sciences, 8 (1975), 199-249
##[12]
M. Friedman, Ma. Ming, A. Kandel, Fuzzy linear systems, Fuzzy Sets and Systems, 96 (1998), 201-209
##[13]
Sahin Emrah Amrahov, Iman N. Askerzade, Strong Solutions of the Fuzzy Linear Systems, CMES Comput. Model. Eng. Sci., (2011)
##[14]
S. H. Nasseri, M. Gholami, Linear system of equations with trapezoidal fuzzy numbers, The Journal of Mathematics and Computer Science, 3 (2011), 71-79
##[15]
Taher Rafgooy, Hadi Sadghi Yazhi, Reza Monsefi, Fuzzy Complex System of Linear Equations Applied to Circuit Analysis, International Journal of Computer and Electrical Engineering,vol.1, no.5, (2009)
##[16]
S. H. Nasseri, F. Zahmatkesh, Huang method for solving fully fuzzy linear system of equations, The Journal of Mathematics and Computer Science, 1 (2010), 1-5
##[17]
Sukanta Nayak, S. Chakraverty, A New Approach to Solve Fuzzy System of Linear Equations, Journal of Mathematics and Computer Science, 7 (2013), 205-212
##[18]
S. H. Nasseri, M. Sohrabi, Gram-Schmidt Approach for Linear System of Equations with Fuzzy Parameters, The Journal of Mathematics and Computer Science, 1 (2010), 80-89
]
Designing a New Face Recognition System Robust to Various Poses
Designing a New Face Recognition System Robust to Various Poses
en
en
Different scholars in the world design wide varieties of systems for automatic face recognition process. The face recognition process is dependent on different variables, such as the illumination and the different poses of the image. Therefore, face recognition process is still a fundamental issue in image processing. In this paper, we have developed a new method for face recognition based on ant colony algorithm. To assess the performance and effectiveness of the designed system, face images available in ORL database are used. The results obtained indicate that the proposed method for face recognition accuracy is about 97.3 percent. Besides, comparisons indicate that the performance of the proposed method compared to other methods enjoys a remarkable accuracy.
32
39
Behzad
Ghanavati
Face detection
Face Recognition
Face poses Ant Colony Optimization Algorithm.
Article.3.pdf
[
[1]
A. Pentland, B. Moghaddam, T. Starner, View-based and modular eigenspaces for face recognition, in Proc. IEEE Computer Society Conf. Computer Vision and Pattern Recognition, (1994), 84-91
##[2]
T. Cootes, K. Walker, C. Taylor, View-based active appearance models, in Proc. IEEE Int. Conf. Automatic Face and Gesture Recognition, (2000)
##[3]
V. Blanz, S. Romdhani, T. Vetter, Face identification across different poses and illuminations with a 3D morphable model, in Proc. 5th Int. Conf. Automatic Face and Gesture Recognition, (2002), 202-207
##[4]
T. Cootes, G. Edwards, C. Taylor, Active appearance models, in Proc. Eur. Conf. Computer Vision, 2 (1998), 484-498
##[5]
V. Blanz, T. Vetter, Face recognition based on fitting a 3D morphable model, IEEE Trans. Pattern Anal. Mach. Intell., 25 (2003), 1063-1074
##[6]
I. Matthews, S. Baker, Active appearance models revisited, Int. J. Comput. Vis., 60 (2004), 135-164
##[7]
P. Kakumanu, S. Makrogiannis, N. Bourbaki, A survey of skin-color modeling and detection methods, Pattern Recognition, 40(3) (2007), 1106-1122
##[8]
R. Shakerian, S. H. Kamali, M. Hedayati, M. Alipour, Comparative Study of Ant Colony Optimization and Particle Swarm Optimization for Grid Scheduling, Journal of mathematics and computer Science (JMCS) , 3 (2011), 469-474
##[9]
Rouhollah Maghsoudi, Arash Ghorbannia Delavar, Somayye Hoseyny, Rahmatollah Asgari, Yaghub Heidari, Representing the New Model for Improving K-Means Clustering Algorithm based on Genetic Algorithm, Journal of mathematics and computer Science (JMCS), 2 (2011), 329-336
##[10]
, http://www.facedetection.com. , , (), -
##[11]
, http://www.imm.dtu.dk., , (), -
##[12]
, http://www.vision.caltech.edu., , (), -
]
Farsi Font Recognition Based on the Fonts of Text Samples Extracted by Som
Farsi Font Recognition Based on the Fonts of Text Samples Extracted by Som
en
en
A Farsi font recognition algorithm based on the fonts of some frequent text samples is proposed. Some
features are extracted from the connected components of a text image. The feature vectors are clustered
by using a Self-Organizing Map (SOM) clustering method. The clusters with more members determine
the most frequent connected components (MFCCs). A number of members of these big clusters are
extracted from the input image. This procedure is applied to both training and test images. Since the
frequent samples in different Farsi texts are very similar, it can be guaranteed that a large number of
samples of the detected MFCCs for a test image surely are in the extracted training samples set. The font
type and font style of the extracted test samples are recognized by matching between them and the
training samples. The most frequent recognized font of the extracted samples is considered as the font of
the input text. To achieve a more accurate algorithm with lower complexity, the font size is determined in
the second phase after the phase of the font type and style recognition. Using a lexicon reduction
procedure reduces the complexities and processing time. The font size estimation is carried out based on
the size of a particular MFCC in a text image. Experiments show that the proposed method outperforms
other font recognition methods.
40
56
Majid
Ziaratban
Fatemeh
Bagheri
Farsi font recognition
Most-frequent connected components
SOM.
Article.4.pdf
[
[1]
H. S. Baird, G. Nagy, A Self-Correcting 100-Font Classifier, In Proc. of SPIE, 2181 (1994), 106-115
##[2]
H. Ma, D. Doermann, Font Identification Using the Grating Cell Texture Operator, In Proc. of DRR, (2005), 148-156
##[3]
A. Zramdini, R. Ingold, Optical Font Recognition from Projection Profiles, Electronic Publishing, 6 (1993), 249-260
##[4]
A. Zramdini, R. Ingold, Optical Font Recognition Using Typographical Features, IEEE Trans. on PAMI, 20 (1998), 877-882
##[5]
M. C. Jung, Y. C. Shin, S. N. Srihari, Multifont Classification using Typographical Attributes, In Proc. of ICDAR, India, (1999), 353-356
##[6]
Y. Zhu, T. Tan, Y. Wang, Font Recognition Based on Global Texture Analysis, IEEE Trans. on PAMI, 23 (2001), 1192-1200
##[7]
S. H. Kim, Word-Level Optical Font Recognition Using Typographical Features, IJPRAI, 18 (2004), 541-561
##[8]
C. A. Cruz, R. R. Kuoppa, M. R. Ayala, A. A. Gonzalez, R. E. Perez, High-order Statistical Texture Analysis-Font Recognition Applied , Pattern Recognition Letters, 26 (2005), 135-145
##[9]
B. B. Chaudhuri, U. Garain, Extraction of Type Style-based Meta-information from Image Documents, IJDAR, 3 (2001), 138-149
##[10]
B. Allier, H. Emptoz, Font Type Extraction and Character Prototyping Using Gabor Filters, In Proc. of ICDAR, (2003), 799-803
##[11]
C. F. Lin, Y. F. Fang, Y. T. Juang, Chinese text distinction and font identification by recognizing most frequently used characters, Image and Vision Computing, 19 (2001), 329-338
##[12]
Z. Yang, L. Yang, D. Qi, C.Y. Suen, An EMD-based Recognition Method for Chinese Fonts and Styles, Pattern Recognition Letters, 27 (2006), 1692-1701
##[13]
X. Ding, L. Chen, T. Wu, Character Independent Font Recognition on a Single Chinese Character, IEEE Trans. on PAMI, 29 (2007), 197-204
##[14]
I. S. I. Abuhaiba, Arabic Font Recognition Based on Templates, Int. Arab Journal of Information Technology, 1 (2003), 33-39
##[15]
I. S. I. Abuhaiba, Arabic Font Recognition Using Decision Trees Built from Common Words, Journal of Computing and Information Technology (CIT), 13 (2005), 211-223
##[16]
B. Moussa, A. Zahour, M. A. Alimi, A. Benabdelhafid, Can Fractal Dimension Be Used in Font Classification, In Proc. of ICDAR, (2005), 146-150
##[17]
A. Borji, M. Hamidi, Support Vector Machine for Persian Font Recognition, Int. Journal of Intelligent Systems and Technologies, 2 (2007), 178-183
##[18]
H. Khosravi, E. Kabir, Farsi font recognition based on Sobel–Roberts features, Pattern Recognition Letters, 31 (2010), 75-82
##[19]
M. Ziaratban, F. Bagheri, Improving Farsi font recognition accuracy by using proposed directional elliptic Gabor filters, First Iranian Conference on Pattern Recognition and Image Analysis (PRIA), (2013), 1-5
##[20]
M. Ziaratban, K. Faez, F. Bagheri, Content-Independent Farsi Font Recognition Based on Dynamic Most-Frequent Connected Components, 21st International Conference on Pattern Recognition (ICPR 2012) Tsukuba, Japan, 11-15 (2012), 729-733
##[21]
S. M. Lajevardi, Z. M. Hussain, Feature Extraction for Facial Expression Recognition based on Hybrid Face Regions, Advances in Electrical and Computer Engineering, 9 (2009), 63-67
##[22]
R. Maghsoudi, A. Ghorbannia Delavar, S. Hoseyny, R. Asgari, Y. Heidari, Representing the New Model for Improving K-Means Clustering Algorithm based on Genetic Algorithm, The Journal of Mathematics and Computer Science , 2 (2011), 329-336
##[23]
J. Rajaie, B. Fakhar, A Novel Method for Document Clustering using Ant-Fuzzy Algorithm, The Journal of Mathematics and Computer Science , 4 (2012), 182-196
##[24]
K. Azaryuon, B. Fakhar, A Novel Document Clustering Algorithm Based on Ant Colony Optimization Algorithm, The Journal of mathematics and computer Science , 7 (2013), 171-180
##[25]
J. Vahidi, S. Mirpour, Introduce a New Algorithm for Data Clustering by Genetic Algorithm, The Journal of Mathematics and Computer Science , 10 (2014), 144-156
##[26]
Gh. H. Mohebpour, A. Ghorbannia Delavar, Some new mutation operators for genetic data clustering, The Journal of Mathematics and Computer Science , 12 (2014), 282-294
##[27]
Gh. H. Mohebpour, A. Ghorbannia Delavar, CCGDC: A new crossover operator for genetic data clustering, The Journal of Mathematics and Computer Science, 11 (2014), 191-208
##[28]
T. Kohonen, The self-organizing map, Proc. IEEE, 78(9) (1990), 1464-1480
##[29]
A. Mowlaei, K. Faez, A. T. Haghighat, Feature Extraction with Wavelet Transform for Recognition of Isolated Handwritten Farsi/Arabic Characters and Numerals , In Proc. of Int. Conf. on Digital Signal Processing, 2 (2002), 923-926
##[30]
Y. Freund, R. E. Schapire, Experiments with a new boosting algorithm, In Proc. of Int. Conf. on Machine Learning, Bari, Italy, (1996), 148-156
]
Lattice Valued Fuzzy Soft Grills
Lattice Valued Fuzzy Soft Grills
en
en
The present paper is devoted to the study of fuzzy soft grill structure. The notions of fuzzy soft grill and fuzzy soft grill base are defined and the connections between them are given. Two types of second order image and reimage of fuzzy soft grill base is defined and also some of their properties are observed.
57
69
Vildan
Cetkin
Halis
Aygun
fuzzy soft set
fuzzy soft grill
grill base.
Article.5.pdf
[
[1]
S. E. Abbas, Images and Preimages of (L,M)-grillbases, Hacettepe J. of Maths. and Statistics, 40(5) (2011), 737-747
##[2]
K. K. Azad, Fuzzy grills and a characterization of fuzzy proximity, J. Math. Anal. Appl., 79 (1981), 13-17
##[3]
B. Ahmad, A. Kharal, On fuzzy soft sets, Advances in Fuzzy Systems, Article ID 586507 (2009)
##[4]
H. Aktaş, N. Çağman, Soft sets and soft groups, Information Sciences , 177 (13) (2007), 2726-2735
##[5]
R. Ameri, H. Hedayati, E. Ghasemian, Filteristic soft BCK-algebras, Journal of Mathematics and Computer Science, 2(1) (2011), 81-87
##[6]
A. Aygünoğlu, H. Aygün, Introduction to fuzzy soft groups, Computers and Mathematics with Applications, 58 (2009), 1279-1286
##[7]
A. Aygünoğlu, V. Çetkin, H. Aygün, An introduction to fuzzy soft topological spaces, Hacettepe Journal of Mathematics and Statistics, 43(2) (2014), 197-208
##[8]
A. Bhattacharyya, M. N. Mukherjee, S. P. Sinha, Concerning fuzzy grills: Some applications, Hacettepe J. of Math. and Statistics, 34 (2005), 91-100
##[9]
K. C. Chattopadhyay, U. K. Mukherjee, S. K. Samanta, Fuzzy proximity structures and fuzzy grills, Fuzzy Sets and Systems, 79 (1996), 383-393
##[10]
G. Choquet, Sur les notions de filter et de grills, C. R. Acad. Sci. Paris, 224 (1947), 171-173
##[11]
Y. B. Jun, Soft BCK/BCI algebras, Computers and Mathematics with Applications, 56 (5) (2008), 1408-1413
##[12]
A. Kandil, O. A. E. Tantawy, S. A. El-Sheikh, A. M. Abd El-latif, Fuzzy semi open soft sets related properties in fuzzy soft topological spaces, Journal of Mathematics and Computer Science, 13(2) (2014), 94-114
##[13]
A. Kharal, B. Ahmad, Mappings on Fuzzy Soft Classes, Advances in Fuzzy Systems, Article ID 407890. , (2009), -
##[14]
P. K. Maji, R. Biswas, A. R. Roy, Fuzzy soft sets , Journal of fuzzy Mathematics, 9(3) (2001), 589-602
##[15]
P. K. Maji, A. R. Roy, R. Biswas, An application of soft sets in a decision making problem, Computers and Mathematics with Applications , 44 (8-9) (2002), 1077-1083
##[16]
D. Molodtsov, Soft set theory-First results, Computers and Mathematics with Appl., 37 (4/5) (1999), 19-31
##[17]
D. Pei, D. Miao, From soft sets to information systems, Granular Computing, 2005 IEEE International Conference on, 2 (2005), 617-621
##[18]
A. R. Roy, P. K. Maji, A fuzzy soft set theoretic approach to decision making problems, Journal of Computational and Applied Mathematics, 203 (2007), 412-418
##[19]
A. P. Sostak, On a fuzzy topological structure, Suppl. Rend. Circ. Matem. Palermo, Ser II , 11 (1985), 89-103
##[20]
P. Srivastava, R. L. Gupta, Fuzzy proximity structures and fuzzy ultrafilters, J. Math. Anal. Appl. , 94(2) (1983), 297-311
]
Software Security Modeling Based on Petri Nets
Software Security Modeling Based on Petri Nets
en
en
Nowadays, mostly security solutions are mainly focused on how to defend against various threats, including insider threats and outsider threats, instead of trying to solve security issues from their sources. This paper proposes a security modeling process and an approach to modeling and quantifying component security based on Petri Nets (PN) in the software design phase. Security prediction in the design phase provides the possibility to investigate and compare different solutions to the target system before realization. The analysis results can be used to trace back to the critical part for security enhancing.
70
77
A.
Mohsenzadeh
Software security
Petri net
Security models
Article.6.pdf
[
[1]
C. C. Center, CERT/CC Statistics 1988-2005, Pittsburgh, CERT CC,http://www.cert.org/stats/cerCstats.html, Feb. , (2006)
##[2]
B. Schneier , Secrets and Lies, John Wiley and Sons, Inc., (2000)
##[3]
T. Murata, Petri nets: properties, analysis and applications, Proceedings of the IEEE , 77 (4) (1989), 541-580
##[4]
N. Yang, H. Yu, H. Sun, Z. Qian, Modeling UML sequence diagrams using extended Petri nets, in: International Conference on Information Science and Applications, ICISA2010, IEEE Computer Society, (2010), 596-603
##[5]
A. V. Ratzer, L. Wells, H. M. Lassen, M. Laursen, J. F. Qvortrup, M. S. Stissing, M. Westergaard, S. Christensen, K. Jensen, CPN tools for editing, simulating,and analysing coloured Petri nets, in:24th International Conference on Applications and Theory of Petri Nets, ICATPN 2003, in: Lecture Notes in Computer Science, vol.2679, Springer, Berlin, Heidelberg, (2003), 450-462
##[6]
S. Baarir, M. Beccuti, D. Cerotti, M. D. Pierro, S. Donatelli, G. Franceschinis, The great SPN tool: recent enhancements, ACM SIGMETRICS Performance Evaluation Review, 36 (4) (2009), 4-9
##[7]
N. R. Mead, T. Stehney , Security Quality Requirements Engineering (SQUARE) Methodology, Proc. of the 2005 workshop on software engineering for secure systems-building trustworthy applications, Missouri, USA, (2005), 1-7
##[8]
C. B. Haley, R. Laney, J. D. Moffett, et aI., Security Requirements Engineering: A Framework for Representation and Analysis, IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 34(1) (2008), 133-153
##[9]
D. Gordon, T. Stehney, N. Wattas, E. Yu , Quality Requirements Engineering (SQUARE): Case Study on Asset Management System, Phase II (CMU/SEI-2005-SR-005). Pittsburgh, PA, Software Engineering Institute , Carnegie Mellon University (2005)
##[10]
Hui Wang, Zongpu Jia, Zihao Shen, Research on Security Requirements Engineering Process, 978-1-4244-3672-9/09/$25.00 ©IEEE , (2009), 1285-1288
]
On Some New Generalized Difference Sequence Spaces Defined by a Modulus Function
On Some New Generalized Difference Sequence Spaces Defined by a Modulus Function
en
en
In this paper we introduces the new generalized difference sequences spaces
\(\left[\hat{V}, \lambda, f, P\right]_0(\Delta^r_u,E), \left[\hat{V}, \lambda, f, P\right]_1(\Delta^r_u,E), \left[\hat{V}, \lambda, f, P\right]_{\infty}(\Delta^r_u,E), \hat{S}_\lambda(\Delta^r_u,E)\) and \(\hat{S}_{\lambda_0}(\Delta^r_u,E)\) (where \(E\) is any Banach space) which arise from the notion of generalized de la Vallée-
Poussin means and the concept of modulus function. We also give some inclusion relations between these
spaces.
78
87
Tanweer
Jalal
Difference sequence spaces
modulus function
paranorm
statistical convergence.
Article.7.pdf
[
[1]
F. M. Arani, M. E. Gordji, S. Talebi, Statistical convergence of double sequence in para normed spaces, The J. Math. and Com. Sci., 10 (2014), 47-53
##[2]
M. Et, M. Basarir, On some new generalized difference sequence spaces, Periodica Mathematica Hungarica, 35 (3 ) (1997), 169-175
##[3]
M. Et, R. Colak, On some generalized difference sequence spaces, Soochow J. of Math. , 21 (1995), 377-386
##[4]
M. Et, F. Nurry, \(\Delta^m\)- Statistical convergence, Indian J. Pure and Appld. Math, 32 (2001), 961-969
##[5]
H. Fast, Sur la convergence statistique, Colloq. Math., 2 (1951), 241-244
##[6]
J. A. Fridy, On statistical convergence, Analysis , 5 (1985), 301-313
##[7]
H. Kizmaz, On certain sequence spaces, Canad. Math. Bull., 24 (1981), 169-176
##[8]
E. Kolk, The statistical convergence in Banach spaces, Acta. Comment. Univ. Tatru, 928 (1991), 41-52
##[9]
L. Leindler, Über die la Vallee-Pousinsche Summierbarkeit Allgemeiner Orthogonal- reihen, Acta. Math. Acad. Sci. Hungar, 16 (1965), 375-387
##[10]
I. J. Maddox, Elements of Functional Analysis, Cambridge Univ. Press., (1970)
##[11]
I. J. Maddox, Sequence spaces defined by a modulus, Math. Proc. Camb. Phil. Soc., 100 (1986), 161-166
##[12]
E. Malkowsky, S. D. Parashar, Matrix transformations in spaces of bounded and convergent difference sequence spaces of order m, Analysis, 17 (1997), 87-97
##[13]
Mursaleen, λ – statistical convergence, Math. Slovaca, 50 (2000), 111-115
##[14]
W. H. Ruckle, FK spaces in which the sequence of coordinate vectors is bounded, Canad. J. Math., 25 (1973), 973-978
##[15]
E. Savas, Some sequence spaces and statistical convergence, Int. J. Math. & Math. Sci., 29(5) (2002), 303-306
##[16]
A. Wilansky, Functional Analysis, Blasdell Publishing Company, (1964)
]
A Note on Automata
A Note on Automata
en
en
In this paper, a brief description of finite automata and the class of problems that can be solved by such devices is presented. The main objective is to introduce the concept of length product, illustrate its application to finite automata, and prove some related results.
88
96
Dasharath
Singh
Ahmed Ibrahim
Isah
Formal language
Automata
Length product
Article.8.pdf
[
[1]
T. Becker, A. Joshi, O. Rambow, Long-distance scrambling and tree adjoining grammars, In Proceedings of the fifth conference on European Chapter of the Association for Computational Linguistics, Association for Computational Linguistics, (1991), 21-26
##[2]
N. Chomsky, Three Models for the Description of Languages, IRE Transactions on Information Theory, 2 (3) (1956), 113-124
##[3]
N. Chomsky, On Certain Formal Properties of Grammars, Information and Control, 2 (2) , 137–167. (1959)
##[4]
D. Grune, C. H. Jacobs, Parsing Techniques – A Practical Guide, Ellis Horwood, England (1990)
##[5]
J. E. Hopcroft, J. D. Ullman, Formal Languages and Their Relations to Automata, Addison-Wesley Publishing , (1969)
##[6]
R. Huybregts, The weak inadequacy of context-free phrase structure grammars, In Ger Jan de Haan, Mieke Trommelen, and Wim Zonneveld, editors, Van periferie naar kern, Foris, Dordrecht, (1984), 81-99
##[7]
G. Jäger, J. Rogers, Formal Language Theory: Refining the Chomsky Hierarchy, Philosophical Transactions of Royal Society of London, Series B, Biological Sciences, 1–29. (2012)
##[8]
T. Jiang, B. Ravikumar, M. Li, K. W. Regan, Formal Grammars and Languages, Lecture Notes, (2010), 1-40
##[9]
A. Joshi, How much context-sensitivity is necessary for characterizing structural descriptions — tree adjoining grammars, In David Dowty, Lauri Karttunen, and Arnold Zwicky, editors, Natural Language Processing, Theoretical, Computational and Psychological Perspectives, Cambridge University Press, Cambridge, UK (1985)
##[10]
A. K. Joshi, K. V. Shanker, D. Weir, The Convergence of Mildly Context-Sensitive Grammar Formalisms, Technical Reports (CIS), 539 (1990), 1-65
##[11]
J. Kari, Automata and Formal Languages, University of Turku, Finland, (2013), 1-150
##[12]
P. M. Postal, D. T. Langendoen, English and the Class of Context-Free Languages, Computational Linguistics, 10 (3 – 4) (1984), 177-181
##[13]
J. Rogers, G. Pullum, Aural pattern recognition experiments and the subregular hierarchy, In Marcus Kracht, editor, Proceedings of 10th Mathematics of Language Conference, University of California, Los Angeles , (2007), 1-7
##[14]
K. Ruohonen, Formal Languages, Lecture Notes, (2009), 1-94
##[15]
S. Shieber, Evidence against the context-freeness of natural language, Linguistics and Philosophy, 8 (1985), 333-343
##[16]
D. Singh, A. I. Isah, Some Algebraic Structures of Languages, the Journal of Mathematics and Computer Science, 14 (2015), 250-257
]