]>
2014
11
2
79
Using Fourier Series for Solving Optimal Control Problem of an Hiv Infection Treatment Control Model
Using Fourier Series for Solving Optimal Control Problem of an Hiv Infection Treatment Control Model
en
en
In this paper we introduce a numerical technique based on Fourier series for solving of nonlinear optimal control problems, where this approach is used for solving optimal control problem of an HIV infection treatment control model. In this paper, first by using healthy cells \(CD4^+T (T)\), infected cells \(CD4^+T (I)\), viral load (V) and also by using a drug inhibitor of reverse polygraph as a control function, a control model is presented for treatment of HIV infection. A cost function to minimize the cost of drug during the treatment is defined as well. To find the pair of trajectory and control of such nonlinear optimal control problem, we used Fourier series to approximate optimal pair of trajectory and control.
86
92
S. Mosarreza
Nouri
Mohammad
Alizadehjamal
Fourier Series
approximation theory
HIV infection
optimal control.
Article.1.pdf
[
[1]
M. Ebrahimi, M. A. Samavat, M. A. Vali, A. A. Gharavisi, Application of Fourier series direct method of the optimal control of singular system, ICGST-ACSE Jornal, Vol. 7, Issue 2 (2007)
##[2]
S. M. Nouri, M. H. Farhi, Optimal control of nonlinear systems via Fourier series, in Proc. 5th Iranian Con. on Applied Mathematics, (2013), 736-739
##[3]
W. L. Chen, Y. P. Shih, Parameter estimation of bilinear systems via Walsh functions, Journal of the Franklin Institute, 305 (1978), 249-257
##[4]
M. Gulsu, M. Sezer, A Taylor polynomial approach for solving differential-difference equations, Journal of Computational and Applied Mathematics, 186 (2006), 349-364
##[5]
M. Alizadehjamal, M. H. Farahi, S. A. Mahdipour, Using shifted Legendre polynomials for solving optimal control problem of an HIV infection treatment control model, The Journal of Mathematics and Computer Science (JMCS), 8 (2014), 251-257
##[6]
H. Jaddu, E. Shimomura, Solution of nonlinear optimal control problem using Chebyshev polynomials, Proceeding of 2nd Asian Control Conference, (1997), 417-420
##[7]
K. Maleknejad, M. Shahrezaee, H. Khatami, Numerical solution of integral equations system of the second kind by block-pulse functions, Applied Mathematics and Computation, 166 (2005), 15-24
##[8]
M. Razzaghi, Optimal control of linear Time-Varying systems via Fourier series, Journal of Optimization Theory and Applications, Vol 65, No. 2 (1990)
##[9]
S. P. Banks, Mathematical theories of nonlinear systems, Prentice Hall, Hertfordshire (1988)
##[10]
M. Shirazian, M. H. Farahi, Optimal control strategy for a fully determined HIV model, Intelligent control and automation, (2010), 15-19
]
An Ontology-based Approach for Software Architectural Knowledge Management
An Ontology-based Approach for Software Architectural Knowledge Management
en
en
Over the past few years, a large number of models, ontologies and tools have been proposed to capture, share and the management of architectural knowledge (AK) and particularly architectural design decisions (ADD) as an important part of AK of a software-intensive system. However, the growing tendency in Globalization of Software Development sets the stage for new challenges in the management of AK in a geographically distributed context in which it seems the existing AK models and tools are no longer sufficient for such setting. In this paper we develop an ontology-based approach to manage AK in order to partly mitigate the deficiencies of existing AK approaches in a distributed software devotement.
93
104
Narges
Choobdaran
Sayed Mehran
Sharafi
Mohamad Reza
Khayyambashi
Software Architecture
Architectural Knowledge Management
Architectural Design Decision
Ontology
Article.2.pdf
[
[1]
L. Bass, P. Clements, R. Kazman, Software Architecture in Practice, 2nd edition, SEI Series in Software Engineering, Addison-Wesley Pearson Education (2003)
##[2]
P. Kruchten, P. Lago, H. van Vliet, Building up and Reasoning about Architectural Knowledge , In Second International Conference on the Quality of Software Architectures (QoSA 2006), Lecture Notes in Computer Science, Västerås, Sweden, Springer Berlin / Heidelberg. Cited on page. , 4214 (2006), 43-58
##[3]
D. Falessi, G. Cantone, M. Becker, Documenting design decision rationale to improve individual and team design decision making: an experimental evaluation, In Proceedings of the 2006 ACM/IEEE international symposium on International symposium on empirical software engineering (ISESE ’06), New York,NY, USA, ACM Press., (2006), 134-143
##[4]
H. Holmström, E. ÓConchúir, P. J. Ågerfalk, B. Fitzgerald, Global Software Development Challenges: A Case Study on Temporal,, Geographical, and Socio-Cultural Distance. In IEEE International Conference on Global Software Engineering (ICGSE’06), Florianopolis, Brazil, IEEE Computer Society. Cited on pages. , (2006), 3-11
##[5]
V. Clerc, P. Lago, H. van Vliet, Assessing a Multi-Site Development Organization for Architectural Compliance, In 6th Working IEEE/IFIP Conference on Software Architecture (WICSA 2007), Mumbai, India, 2007a. IEEE Computer Society, Cited (2007)
##[6]
B. Decker, E. Ras, J. Rech, P. Jaubert, M. Rieth, Wiki- Based Stakeholder Participation in Requirements Engineering, IEEE Software, 24(2) (2007), 28-35
##[7]
C. Silveira, J. Faria, A. Aguiar, R. Vidal, Wiki Based Requirements Documentation of Generic Software Products, In Proceedings of the 10th Australian Workshop on Requirements Engineering (AWRE), (2005), 42-51
##[8]
S. Schaffert, F. Bry, J. Baumeister, M. Kiesel, Semantic Wikis, IEEE Software, 25(4) (200), 8-11
##[9]
P. Kruchten, An Ontology of Architectural Design Decisions in Software-Intensive Systems, Proceedings 2nd Groningen Workshop on Software Variability Management, Groningen, (2004), 109-119
##[10]
R. Capilla, F. Naval, J. C. Dueñas, Modeling and Documenting the Evolution of Architectural Design Decisions, Proceedings of the 2nd Workshop on SHAring and Reusing architectural Knowledge Architecture, Rationale, and Design Intent (SHARK/ADI) (2007)
##[11]
M. A. Babar, I. Gorton, B. Kitchenham, A Framework for Supporting Architecture Knowledge and Rationale Management , In Rationale Management in Software Engineering, A.H. Dutoit, et al., eds, Springer, (2006), 237-254
##[12]
I. S. 1471-2000, IEEE Recommended Practice for Architectural Description of Software- Intensive Systems, , (2000)
##[13]
, , http://diqa-pm.com/en/DataWiki , ()
##[14]
P. Kruchten, An Ontology of Architectural Design Decisions in Software-Intensive Systems, Proceedings 2nd Groningen Workshop on Software Variability Management, Groningen, (2004), 109-119
##[15]
Bilal Saeed Raja, M. Ali Iqbal, Imran Ihsan, Moving From Problem Space to Solution Space , World Academy of Science, Engineering and Technology (2007)
##[16]
Antony Tang, Paris Avgeriou, Anton Jansen, Rafael Capilla, Muhammad Ali Babar, A Comparative Study of Architecture Knowledge Management Tools, Journal of Systems and Software, 83(3) (2010), 352-370
##[17]
P. J. Agerfalk, B. Fitzgerald, H. Holmström, B. Lings, B. Lundell, E. ÓConchúir, A Framework for Considering Opportunities and Threats in Distributed Software Development, In International Workshop on Distributed Software Development, Paris, Austrian Computer Society, (2005), 47-61
##[18]
NF. Noy , McGuinness DL (2001) Ontology development 101: A guide to creating your first ontology, Tech. rep., Stanford University (2001)
##[19]
He Zhang, Juan Li, Liming Zhu, Ross Je, Yan Liu, Qing Wang, Mingshu Li, Investigating Dependencies in Software Requirements for Change Propagation Analysis, Information and Software Technology, 40-53 (2014)
##[20]
J.Tyree, A. Akerman, Architecture Decisions: Demystifying Architecture, IEEE Software, 22(2) (2005), 19-27
##[21]
N. B. Harrison, P. Avgeriou, U. Zdun, Using Patterns to Capture Architectural Decisions, IEEE Software, 24( 4) (2007), 38-45
##[22]
Mojtaba Shahin, Peng Liang, Mohammad-Reza Khayyambashi, Architectural design decision: Existing models and tools, WICSA/ECSA , (2009), 293-296
]
A Meshless Method for Solving Delay Differential Equation Using Radial Basis Functions with Error Analysis
A Meshless Method for Solving Delay Differential Equation Using Radial Basis Functions with Error Analysis
en
en
In this paper, we present a numerical method for solving delay differential equations (DDEs). The method utilizes radial basis functions (RBFs). Error analysis is presented for this method. Finally, numerical examples are included to show the validity and efficiency of the new technique for solving DDEs.
105
110
F.
Ghomanjani
F. Akhavan
Ghassabzade
Radial basis functions (RBFs)
Delay differential equations
time delay systems.
Article.3.pdf
[
[1]
J. V. Beltran, J. Monterde, Bezier solutions of the wave equation, Lecture notes in Computational Sciences, Computational Science and its Applications-ICCSA (A. Laganà, M. L. Gavrilova, V. Kumar, Y. Mun, C. J. K.Tan & O. Gervasi eds). Lecture Notes in Computer Science, Berlin: Springer, 3044 (2004), 631-640
##[2]
A. Bemporad, A. Giua, C. Seatzu, Synthesis of state-feedback optimal controllers for continuous-time switched linear systems, In Proc. 41st IEEE conference on decision and control, Las Vegas, Nevada USA (2002)
##[3]
R. Cholewa, A. J. Nowak, R. A. Bialecki, L. C. Wrobel, Cubic Bezier splines for BEM heat transfer analysis of the 2-D continuous casting problems, Computational Mechanics, 28 (2002), 282-290
##[4]
C. H. Chu, C. C. L. Wang, C. R. Tsai, Computer aided geometric design of strip using developable Bezier patches, Computers in Industry, 59 (2008), 601-611
##[5]
M. Egerstedt, Y. Wardi, F. Delmotte, Optimal control of switching times in switched dynamical systems, In Proc. IEEE conference on decision and control, 3 (2003), 2138-2143
##[6]
M. Evrenosoglu, S. Somali, Least squares methods for solving singularity perturbed two-points boundary value problems using Bezier control point, Applied Mathematics Letters, 21 (2008), 1029-1032
##[7]
G. E. Farin, Curve and surfaces for computer aided geometric design, First ed, Academic Press, New York (1988)
##[8]
B. Farhadinia, K. L. Teo, R. C. Loxton, A computational method for a class of non-standard time optimal control problems involving multiple time horizons, Mathematical Computer Modelling, 49 (2009), 1682-1691
##[9]
M. Gachpazan, Solving of time varying quadratic optimal control problems by using Bezier control points, Computational and Applied Mathematics, 30 (2011), 367-379
##[10]
J. Geromela, P. Colaneri, P. Bolzern, Passivity of switched linear systems: Analysis and control design, Systems and Control Letters, 61 (2012), 549-554
##[11]
F. Ghomanjani, M. H. Farahi, The Bezier control points method for solving delay differential equation, Intelligent Control and Automation, 3 (2012), 188-196
##[12]
F. Ghomanjani, M. H. Farahi, M. Gachpazan, Bezier control points method to solve constrained quadratic optimal control of time varying linear systems, Computational and Applied Mathematics, 31 (2012), 433-456
##[13]
A. Giua, C. Seatzu, C. Van Der Me, Optimal conrol of switched autonomous linear systems, In Proc. IEEE conference on decision and control, (2001), 2472-2477
##[14]
K. Harada, E. Nakamae, Application of the Bezier curve to data interpolation, Computer-Aided Design, International Journal of Computer Mathematics, 14 (1982), 55-59
##[15]
M. Heinkenschloss, A time-domain decomposition iterative method for the solution of distributed linear quadratic optimal control problems, Applied Mathematics and Computation, 173 (2005), 169-198
##[16]
I. Hwang, J. Li, D. Du, A numerical algorithm for optimal control of a class of hybrid systems: differential transformation based approach, International Journal of Control, 81 (2008), 277-293
##[17]
H. Juddu, Spectral method for constrained linear-quadratic optimal control, Mathematics Computers In simulation, 58 (2002), 159-169
##[18]
B. Lang, The synthesis of wave forms using Bezier curves with control point modulation, In: The Second CEMS Research Student Conference, 1st edn. Morgan kaufamann, San Francisco (2004)
##[19]
A. T. Layton, M. Van de Panne, A numerically evident and stable algorithm for animating water waves, The visual Computer, 18 (2002), 41-53
##[20]
M. Kamgarpour, C. Tomlin, On optimal control of non-autonomous switched systems with a fixed mode sequence, Automatica, Doi:10.1016/j.automatica, 1177-1181 (2012)
##[21]
M. Margaliot, Stability analysis of switched systems using variational principles: An introduction, Automatica, 42 (2006), 2059-2077
##[22]
B. Niua, J. Zhaoa, Stabilization and \(L_2\)-gain analysis for a class of cascade switched nonlinear systems: An average dwell-time method, Nonlinear Analysis: Hybrid Systems, 5 (2001), 671-680
##[23]
G. Nürnberger, F. Zeilfelder, Developments in bivariate spline interpolation, Journal of Computational and Applied Mathematics, Computers and Mathematics with Applications, 121 (2000), 125-152
##[24]
H. Prautzsch, W. Boehm, M. Paluszny , Bezier and B-Spline Techniques, Springer, (2001)
##[25]
Y. Q. Shi, H. Sun, Image and video compression for multimedia engineering, CRC Press LLc, (2000)
##[26]
R. Winkel, Generalized Bernstein Polynomials and Bezier Curves: An Application of Umbral Calculus to Computer Aided Geometric Design, Advances in Applied Mathematics, 27 (2001), 51-81
##[27]
C. Wu, K. L. Teo, R. Li, Y. Zhao, Optimal control of switched systems with time delay, Appl, Math. Letters, 19 (2006), 1062-1067
##[28]
X. Xu, G. Zhai, S. He, Some results on practical stabilizability of discrete-time switched affine systems, Nonlinear Analysis: Hybrid Systems, 4 (2010), 113-121
##[29]
X. Xu, P. J. Antsakalis, Optimal control of switched systems based on parameterization of the switching instants, IEEE Transactions on Automatic Control, 49 (2004), 2-16
##[30]
J. Zheng, T. W. Sederberg, R. W. Johnson, Least squares methods for solving differential equations using Bezier control points, Applied Numerical Mathematics, 48 (2004), 237-252
]
Human Detection Using Surf and Sift Feature Extraction Methods in Different Color Spaces
Human Detection Using Surf and Sift Feature Extraction Methods in Different Color Spaces
en
en
Local feature matching has become a commonly used method to compare images. For tracking
and human detection, a reliable method for comparing images can constitute a key component for
localization and loop closing tasks. two different types of image feature algorithms, Scale -
Invariant Feature Transform (SIFT) and the more recent Speeded Up Robust Features (SURF),
have been used to compare the images. In this paper, we propose the use of a rich set of feature
descriptors based on SIFT and SURF in the different color spaces.
111
122
Osameh
Biglari
Reza
Ahsan
Majid
Rahi
human detection
SIFT
SURF
Color Spaces
grayscale
Article.4.pdf
[
[1]
N. Dalal, B. Triggs, Histograms of Oriented Gradients for Human Detection, In CVPR 2005, (2005)
##[2]
A. Mohan, C. Papageorgiou, T. Poggio. , Examplebased object detection in images by components, PAMI, 23(4) (2001), 349-361
##[3]
Y. Ke, R. Sukthankar, PCA-SIFT: A More Distinctive Representation for Local Image Descriptors, In CVPR 2004, 2 (2004), 506-513
##[4]
S. Belongie, J. Malik, J. Puzicha, Matching Shapes, In ICCV 2001, 1 (2001), 454-461
##[5]
Q. Zhu, M.-C.Yeh, K.-T.Cheng, S. Avidan, Fast human detection using a cascade of histograms of oriented gradients, In CVPR 2006, (2006), 1491-1498
##[6]
W. Zhang, G. Zelinsky, D. Samaras, Real-time accurate object detection using multiple resolutions, In ICCV, (2007)
##[7]
J. Begard, N. Allezard, P. Sayd, Real-time human detection in urban scenes: Local descriptors and classifiers selection with adaboost-like algorithms, In CVPR Workshops, (2008)
##[8]
O. Tuzel, F. Porikli, P. Meer, Human detection via classification on riemannian manifolds, In CVPR, (2007)
##[9]
Y. Mu, S. Yan, Y. Liu, T. Huang, B. Zhou, Discriminative local binary patterns for human detection in personal album, In CVPR 2008, (2008), 1-8
##[10]
Y.-T. Chen, C.-S. Chen, Fast human detection using a novel boosted cascading structure with Meta stages, Image Processing, IEEE Trans, 17(8) (2008), 1452-1464
##[11]
B. Wu, R. Nevatia, Detection of multiple, partially occluded humans in a single image by bayesiancombination of edgelet part detectors, In ICCV, (2005), 90-97
##[12]
B. Wu, R. Nevatia, Optimizing discrimination-efficiency tradeoff in integrating heterogeneous local features for object detection, In CVPR 2008, (2008), 1-8
##[13]
P. Dollar, B. Babenko, S. Belongie, P. Perona, Z. Tu, Multiple Component Learning for Object Detection, In ECCV 2008, (2008), 211-224
##[14]
S. Maji, A. Berg, J. Malik, Classification using intersection kernel support vector machines is efficient , In CVPR, (2008)
##[15]
S. Lazebnik, C. Schmid, J. Ponce, Beyond bags of features: Spatial pyramid matching for recognizing natural scene categories, In CVPR 2006, (2006), 2169-2178
##[16]
K. Mikolajczyk, C. Schmid, A. Zisserman, Human detection based on a probabilistic assembly of robust part detectors, In ECCV 2004, 1 (2004), 69-81
##[17]
V. Shet, J. Neuman, V. Ramesh, L. Davis , Bilattice-based logical reasoning for human detection, In CVPR, (2007)
##[18]
P. Felzenszwalb, D. McAllester, D. Ramanan, A discriminatively trained, multiscale, deformable part model, CVPR, (2008), 1-8
##[19]
D. Tran, D. Forsyth, Configuration estimates improve pedestrian finding, In NIPS 2007, MIT Press, Cambridge, MA, (2008), 1529-1536
##[20]
Z. Lin, L. S. Davis, A pose-invariant descriptor for human detection and segmentation, In ECCV, (2008)
##[21]
David G. Lowe , Distinctive image features from scale-invariant keypoints, International Journal of Computer Vision, 2 (2004), 91-110
##[22]
Y. Ke, R. Sukthankar , PCA-SIFT: A more distinctive representation for local image descriptors, In IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), 2 (2004), 506-513
##[23]
H. Bay, T. Tuytelaars, L. Van Gool , SURF: Speeded Up Robust Features, In Ninth European Conference on Computer Vision, (2006)
##[24]
H. Bay, B. Fasel, L. Van Gool, Interactive museum guide: Fast and robust recognition of museum objects, In Proc. Int, Workshop on Mobile Vision (2006)
##[25]
W. Zhang, J. Kosecka, Image based localization in urban environments, In International Symposium on 3D Data Processing, Visualization and Transmission, (2006), 33-40
##[26]
J. Beis, D. Lowe, Shape indexing using approximate nearest neighbor search in high dimensional spaces, In Proc. IEEE Conf. Comp. Vision Patt.Recog, (1997), 1000-1006
##[27]
A. Ess, B. Leibe, L. V. Gool, Depth and Appearance for Mobile Scene Analysis, In ICCV, (2007)
]
Further Results on Harmonic Index and Some New Relations Between Harmonic Index and Other Topological Indices
Further Results on Harmonic Index and Some New Relations Between Harmonic Index and Other Topological Indices
en
en
The harmonic index \(H(G)\) of a graph \(G\) is defined as the sum of the weights
\(\frac{2}{d_u+d_v}\)
of all edges \(uv\)
of \(G\) , where \(d_u\) denotes the degree of a vertex \(u\) in \(G\) . In this paper, we obtained some new relationships
between harmonic index and first geometric-arithmetic index, sum connectivity index that this indices are
important than another topological index. In addition, we determine the lower and upper bond for
molecular graphs and unicyclic molecular graph. Also we give a characterization of the minimum
harmonic index of graphs with maximum degree \(\Delta\).
123
136
Khosro
Sayehvand
Mohammadreza
Rostami
harmonic index
first geometric-arithmetic index
sum connectivity index
molecular graph
minimum degree
maximum degree.
Article.5.pdf
[
[1]
S. Fajtlowicz, on conjectures of Graffiti-II, Congr. Numer, 60 (1987), 189-197
##[2]
O. Favaron, M. Maho, J. F. Sacl, Some eigenvalue properties in graphs (conjectures of Graffiti-II) , Discrete Math, 111 (1993), 197-220
##[3]
L. Zhong, The harmonic index for graphs, Appl. Math. Let. , 25 (2012), 561-566
##[4]
R. Wua, Z. Tanga, H. Deng, A lower bound for the harmonic index of a graph with minimum degree at least two, Published by Faculty of Sciences and Mathematics, University of Nis, Serbia , 27 (2013), 51-55
##[5]
X. Xu , Relationships between harmonic index and other topological indices, App. Math. Sciences , 6 (2012), 2013-2018
##[6]
H. Deng, S. Balachandran, S. K. Ayyaswamy, Y. B. Venkatakrishnan, on the harmonic index and thechromatic number of a graph, Discrete Appl. Math, 161 (2013), 2740-2744
##[7]
L. HongboHua, The Harmonic index of general graphs, nanocones and triangular benzenoid graphs, Optoelectronics Adv. Materials Communi, 6 (2012), 660-663
##[8]
R. Chang, Y. Zhu, on the harmonic index and the minimum degree of a graph, Rom. J. Information Scie. Tech., 15 (2012), 335-343
##[9]
D. Vukicevic, B. Furtula, Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges, J. Math. Chem., 46 (2009), 1369-1376
##[10]
Y. Yuan, B. Zhou, N. Trinajstic, on geometric-arithmetic index, J. Math. Chem, 47 (2010), 833-841
##[11]
B. Zhou, N. Trinajstic, on a novel connectivity index, J. Math. Chem, 46 (2009), 1252-1270
##[12]
Z. Du, B. Zhou, N. Trinajstic, Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number, J. Math. Chem, 47 (2010), 842-855
##[13]
R. Xing, B. Zhou, N. Trinajstic, Sum-connectivity index of molecular trees, J. Math. Chem, 48 (2010), 583-591
##[14]
J. A. Bondy, U. S. R. Murty, Graph theory with application, New York, North Holland (1976)
##[15]
N. Trinajstic, Chemical graph theory, 2nd revised ed (CRC Press, Boca Raton), FL (1992)
##[16]
I. Gutman, O. Miljkovic, Molecules with smallest connectivity indices, Match Commun. Math. Comput. Chem, 41 (2000), 57-70
]
Application of Unsharp Mask in Augmenting the Quality of Extracted Watermark in Spatial Domain Watermarking
Application of Unsharp Mask in Augmenting the Quality of Extracted Watermark in Spatial Domain Watermarking
en
en
It is generally believed that spatial domain watermarking methods are not robust against common image processing attacks. In this paper, a novel application of an unsharp mask is proposed to increase the performance of watermark recovery in correlation based watermarking. Commonly, unsharp mask is used to improve quality of the image by emphasizing its high frequency contents to enhance the edge and details information in it. Dissimilarity between different parts of image is increased by this filter. Thus, the watermark could recover more correctly from the watermarked image. This filter is applied before running watermark recovery procedure. To show efficiency of proposed filter on the spatial domain watermarking, it is applied on a typical correlation based method. Several experiments are done to evaluate the performance of proposed method is improved by applying this filter before watermark extraction procedure.
137
146
Saeed
Amirgholipour
Ahmad Reza
Naghsh-Nilchi
Aboosaleh Mohammad
Sharifi
Mehdi
Alirezanejad
Moien
Arab
Unsharp Mask
Digital Image Watermarking
Correlation Based Watermarking
Spatial
Domain Watermarking
Article.6.pdf
[
[1]
S. K. Amirgholipour, A. R. Naghsh-Nilchi, Robust Digital Image Watermarking Based on Joint DWT-DCT, JDCTA, 3(2) (2009), 42-54
##[2]
S. A. Kasmani, A. Naghsh-Nilchi, A new robust digital image watermarking technique based on joint DWT-DCT transformation, In Convergence and Hybrid Information Technology, ICCIT (2008)
##[3]
S. A. Kasmani, M. Mahfouzi, M. Asfia, A New Pre-processing Approach to Improve DCT-Based Watermarkings Extraction, In Computer Science and Information Technology-Spring Conference, IACSITSC (2009)
##[4]
V. M. Potdar, S. Han, E. Chang, A survey of digital image watermarking techniques, In Industrial Informatics, INDIN (2005)
##[5]
Saeed Amirgholipour Kasmani, Aboosaleh Mohammad Sharifi, A Pre-Filtering Method to Improve Watermark Detection Rate in DCT based Watermarking, International Arab Journal of Information Technology (IAJIT), March, 11 (2014), 178-185
##[6]
G. Depovere, T. Kalker, J. P. Linnartz, Improved watermark detection reliability using filtering before correlation, In Image Processing, (1998). ICIP 98. Proceedings. International Conference . IEEE. , 1 (1998 ), 430-434
##[7]
W. C. Chu, DCT-based image watermarking using subsampling, Multimedia, IEEE Transactions on, 5(1) (2003), 34-38
##[8]
S. D. Lin, C. F. Chen, A robust DCT-based watermarking for copyright protection, Consumer Electronics, IEEE Transactions on, 46(3) (2000), 415-421
##[9]
M. S. Hsieh, D. C.Tseng, Y. H. Huang, Hiding digital watermarks using multiresolution wavelet transform, Industrial Electronics, IEEE Transactions , 48(5) (2001), 875-882
##[10]
A. A. Reddy, B. N. Chatterji, A new wavelet based logo-watermarking scheme, Pattern Recognition Letters, 26(7) (2005), 1019-1027
##[11]
V. Fotopoulos, A. N. Skodras, Improved watermark detection based on similarity diagrams, Signal Processing: Image Communication, 17(4) (2002), 337-345
##[12]
G. W. Braudaway, F. C. Mintzer, Application of blurring filters to improve detection of invisible image watermarks, In Proceedings of SPIE , 5020 (2003), 269-277
##[13]
H. Malik, A. Khokhar, R. Ansari, Improved watermark detection for spread-spectrum based watermarking using independent component analysis, In Proceedings of the 5th ACM workshop on Digital rights management, (2005), 102-111
##[14]
Z. Pan, L. Li, M. Zhang, D. Zhang, Watermark extraction by magnifying noise and applying global minimum decoder, In Image and Graphics, Proceedings. Third International Conference . IEEE. , (2004), 349-352
##[15]
R. C. Gonzalez, R. E. Woods, Digital Image Processing: Introduction, , (2004), 187-191
##[16]
Andrea Polesel, Giovanni Ramponi, V. John Mathews, Adaptive unsharp masking for contrast enhancement, In Image Processing, Proceedings., International Conference , 1 (1997), 267-270
]
An Application of the Crystography
An Application of the Crystography
en
en
A combination of cryptography and steganography is very important to information safety. Because
together, they will not only hide but also encrypt the information at the same time. In the most
crystographic studies, they hide the cipher text (encrypted) into the image, video or audio files to transfer.
In this paper, we will give a simple and more convenient example for Crystography. We can also say that
this method is applicable for most of the cryptographic algorithms to transfer them to the crystographic
algorithm. As a simple example, it can be applicable for ATM card passwords etc. And then we have
created and applied our method by using C# program language.
147
158
Haci
Akta
Mehmet
Kalkan
Cryptography
Steganography
Pi
Crystography.
Article.7.pdf
[
[1]
A. R. Aparajita, STEGNOGRAPHY---The Art of Hiding Information, A Comparison from Cryptography, International Journal of Innovative Research in Science, Engineering and Technology, Copyright to IJIRSET www.ijirset.com, 1308, Vol. 2, Issue 5 (2013)
##[2]
D. Bhattacharyya, Poulami Das, Samir Kumar Bandyopadhyay, Tai-hoon Kim, Text Steganography: A Novel Approach, International Journal of Advanced Science and Technology, Vol. 3 (2009)
##[3]
F. Borges, R. Portugal, J. Oliveira , Steganography with Public-Key Cryptography for Video conference, National Laboratory of Scientific Computing - LNCC, 25651-075, Petrópolis, RJ. (2007)
##[4]
A. M. A. Brifcani, Stego-Based-Crypto Technique for High Security Applications, Stego-Based-Crypto Technique for High Security Applications , 2 (2010), 1793-8201
##[5]
K. Challita, H. Farhat , Combining Steganography and Cryptography: New Directions, IJNCAA, SDIWC, (ISSN 2220-9085), 1(1) (2011), 199-208
##[6]
S. Channalli, A. Jadhav, Steganography An Art of Hiding Data, International Journal on Computer Science and Engineering, 1(3) (2009), 137-141
##[7]
N. N. El-Emam, Hiding a large amount of data with high security using steganography algorithm, Journal of Computer Science, 3 (4) (2007), 223-232
##[8]
S. Gorla , Combination of cryptography and teganography for secure communication in video file, Master Thesis, California State University, Sacremento (2009)
##[9]
N. Hamid et al, Image Steganography Techniques: An Overview, IJCSS, Volume (6) : Issue (3) (2012)
##[10]
S. A. Laskar, K. Hemachandran, Secure Data Transmission Using Steganography and Encryption Technique, International Journal on Cryptography and Information Security (IJCIS), Vol.2, No.3 (2012)
##[11]
A. B. Mansoor, Z. Khan, S. A. Khan, CRYPTO-STEG: A Hybrid Cryptology - Steganography Approach for Improved Data Security, Mehran University Research Journal of Engineering & Technology, Volume 31, No. 2 (2012)
##[12]
Maria Akhtar Mufti, Aihab Khan, Malik Sikandar Hayat Khiyal, Asim Munir, Transmitting Cryptographic data through Steganography, IJCSI International Journal of Computer Science Issues, 9 (2012), 1694-0814
##[13]
Ochin Evgeny, Larisa Dobryakova, Zbigniew Pietrzykowski, Piotr Borkowsk, The application of cryptography and steganography in the integration of seaport security subsystems Zastosowanie kryptografii i steganografii w integracji podsystemów bezpieczeństwa informacyjnego portów morskich, Zeszyty Naukowe Akademia Morska w Szczecinie, 26(98) (2011), 80-87
##[14]
M. H. Rajyaguru, CRYSTOGRAPHY-Combination of Cryptography and Steganography With Rapidly Changing Keys, IJETAE, Volume 2, Issue 10 (2012)
##[15]
Amir Ehsani, An Application of Co-Medial Algebras with Quasigroup Operations on Cryptology, TJMCS , 10 (2014), 113-118
##[16]
A. J. Raphael, Dr. V. Sundaram, Cryptography and Steganography -- A Survey, ISSN:2229-6093, IA.Joseph Raphael,Dr.V Sundaram, Int. J. Comp. Tech. Appl., 2 (3) (), 626-630
##[17]
N. Saran, Kriptografideki Güncel Çalışmalar, Mühendislik ve Teknoloji Sempozyumu, Çankaya Üniversitesi , Ankara (2009)
##[18]
, , http://tr.wikipedia.org, (2013)
##[19]
H. Zbinden, H. Bechmann-Pasquinucci, N. Gisin, G. Ribordy, Quantum cryptography, Appl. Phys. B, 67 (1998), 743-748
##[20]
S. H. Kamali, M. Hedayati, R. Shakerian, S. Ghasempour, Using Identity-Based Secret Public Keys Cryptography for Heuristic Security Analyses in Grid Computing, TJMCS, 3(4) (2011), 357-375
]
Ergodicity of Fuzzy Markov Chains Based on Simulation Using Sequences
Ergodicity of Fuzzy Markov Chains Based on Simulation Using Sequences
en
en
As shown in [1], we reduce periodicity of fuzzy Markov chains using the Halton quasi-random generator. In this paper, we employ two different quasi-random sequences namely Faure and Kronecker to generate the membership values of fuzzy Markov chain. Using simulation it is revealed that the number of ergodic fuzzy Markov chain simulated by Kronecker sequences is more than the one obtained by Faure sequences.
159
165
Behrouz Fathi
Vajargah
Maryam
Gharehdaghi
Ergodic Fuzzy Markov Chains
Faure Sequence
Kronecker Sequence
Quasi-Random Sequences.
Article.8.pdf
[
[1]
B. Fathi, M. Gharehdaghi, Reducing periodicity of fuzzy Markov chains based on simulation using Halton sequences, accepted , (2013)
##[2]
H. Niederreiter, Quasi-Monte Carlo methods and pseudo-random numbers, Bulletin of the American Mathematical Society 84(6) , (1978)
##[3]
J. E. Gentle, Random Number Generation and Monte Carlo Methods, Springer, (2005)
##[4]
J. J. Buckley, Fuzzy Probability and Statistics, F. Verlag, Ed. Springer-Verlag (2004)
##[5]
K. E. Avrachenkov, E. Sanchez, Fuzzy Markov chains, IPMU, (2000), 1851-1856
##[6]
M. Gavalec , Computing orbit period in max-min algebra, Discrete Applied Mathematics, 100 (2000), 49-65
##[7]
M. Thomason, Convergence of powers of a fuzzy matrix, Journal of mathematical analysis and applications , 57 (1977), 476-480
]