]>
2014
12
1
97
The Biennial Malmquist Index in the of Negative Data
The Biennial Malmquist Index in the of Negative Data
en
en
We purpose the range directional model (RDM), a particular case of the directional distance function, is used for computing efficiency in the presence of negative data. We use RDM efficiency measures to arrive at a Malmquist-type index which can reflect productivity change.
We illustrate how the biennial Malmquist index can be used, not only for comparing the performance of a unit in two time periods, but also for comparing the performance of two different units at the same or different time periods. The proposed approach is then applied to a sample of bank branches where negative data were involved. In this paper, we introduce a biennial Malmquist index of productivity change that can be used with negative data.
1
11
Narjes
Mohammadi
Alireza
Yousefpour
biennial Malmquist index
negative data
Article.1.pdf
[
[1]
DW. Caves, LR. Christensen, WE. Diewert, The economic theory of index numbers and the measurement of inputs, outputs and productivity, , (1982)
##[2]
R. G. Chambers, Y. Chung, R. Fare, Benefit and distance functions, , 407-419 (1996)
##[3]
R. G. Chambers, Y. Chung, R. Fare, Profit, directional distance functions, and Nerlovian efficiency , , (1998)
##[4]
R. Färe, S. Grosskopf, M. Norris, Z. Zhang , Productivity growth, technical progress, and efficiency change in industrialized countries, , 66-83 (1994)
##[5]
R. Fare, S. Grosskopf, F. Hernadez-Sancho , Environmental performance: An index number approach, Resource and Energy Economics , 26 (2004), 343-352
##[6]
M. Nishimizu, J. M. Page, Total factor productivity growth, technological progress and efficiency change , , 920-936 (1982)
##[7]
K. H. Park, W. L. Weber , A note on efficiency and productivity growth in the Korean banking industry, 1992–2002, Journal of Banking and Finance , 30 (2006), 2371-2386
##[8]
J. T. Pastor, C. A. K. Lovell, A global Malmquist productivity index , Economics Letters 88, 266– 271 (2005)
##[9]
J. T. Pastor, C. A. K. Lovell , the biennial Malmquist productivity change index, , 10-15 (2011)
##[10]
M. C. A. S. Portela, E. Thanassoulis, G. P. M. Simpson, Negative data in DEA: A directional distance approach applied to bank branches, Journal of the Operational Research Society , 55 (2004), 1111-1121
##[11]
M. C. A. S. Portela, E. Thanassoulis, Comparative efficiency analysis of Portuguese bank branches , European Journal of Operational Research , 177 (2007), 1275-1288
##[12]
M. C. A. S. Portela, E. Thanassoulis, A circular Malmquist-type index for measuring productivity, AstonWorking Paper RP08-02., Aston University Birmingham B4 7ET, U (2008)
]
Time-cost Tradeoff for Optimizing Contractor Npv by Cost Payment and Resource Constraints Using Nsga-ii Algorithm (case Studybandar Abbas Gas Condensate Refinery Project)
Time-cost Tradeoff for Optimizing Contractor Npv by Cost Payment and Resource Constraints Using Nsga-ii Algorithm (case Studybandar Abbas Gas Condensate Refinery Project)
en
en
In this paper, a mathematical model is presented for project scheduling with multiple purposes based on considering cost payment and resource constrains and since this this problem is considered as complex optimization in NP-Hard context, in order to solve proposed method from NSGA-II algorithm and the results are compared with GAMS software in some problems. The proposed method is a Converge to the optimum and efficient solution algorithm. Besides this algorithm is used in some parts of refinery project.
12
26
M.
Zareei
H. A.
Hassan-pour
M.
Mosadegh-khah
Project-scheduling problems
maximize the NPV
the Payments pattern
Time-cost tradeoff
NSGA-II algorithm
GAMS software
Article.2.pdf
[
[1]
A. A. Najafi, S.T. AkhavanNiaki, M. Shahsavar , A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations, Computers & Operations Research, 36 (2009), 2994-3001
##[2]
M. A. Santos, A. P. Tereso , ON THE MULTI-MODE, MULTI-SKILL RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM (MRCPSP-MS), 2nd International Conference on Engineering Optimization September, (2010), 6-9
##[3]
S. Hartmann, D. Briskorn , A survey of variants and extensions of the resource-constrained project scheduling problem, European Journal of Operational Research, 207 (2010), 1-14
##[4]
L. Liu, S. A. Burns, C.W. Feng, Construction time–cost trade-off analysis using LP/IP hybrid method, Journal of Construction Engineering and Management, 121 (1995), 446-454
##[5]
De P. James Dunne, E. Ghosh, J. B. Wells, C. E., The discrete time-cost tradeoff problem revisited , European Journal of Operational Research, 81 (1995), 225-238
##[6]
R. T. Harvey, J. H. Patterson , An implicit enumeration algorithm for the time/cost tradeoff problem in project network analysis, Foundations of Control Engineering, 4 (1979), 107-117
##[7]
E. L. Demeulemeester, W. S. Herroelen, S. E. Elmaghraby, Optimal procedures for the discrete time/cost trade-off problem in project networks, European Journal of Operational Research, 88 (1996), 50-68
##[8]
E. Eshtehardian, A. Afshar, R. Abbasnia, Fuzzy-based MOGA approach to stochastic time–cost trade-off problem , Automation in Construction, 18 (2009), 692-701
##[9]
H. R. Tareghian, S. H. Taheri, A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search , Applied Mathematics and Computation, 190 (2007), 1136-1145
##[10]
A. H. Russell, Cash Flows in Networks, Management Science, 16(5) (1970), 357-373
##[11]
M. Mika, G. Waligora, J. Wezglarz, Simulated Annealing and Tabu Search for Multi-Mode Resource-Constrained Project Scheduling with Positive Discounted Cash Flows and Different Payment Models, European Journal of Operational Research, 164 (2005), 639-668
##[12]
K. Brinkmann, K. Neumann, Heuristic Procedures for Resource-Constrained Project Scheduling with Minimal and Maximal Time Lags: The Resource Leveling and the Minimum Project-Duration Problem, Journal of Decision Systems, 5 (1996), 129-55
##[13]
R. Sonmez, Ö. H. Bettemir, A hybrid genetic algorithm for the discrete time–cost trade-off problem, Expert Systems with Applications, 39 (2012), 11428-11434
##[14]
O. Icmeli, S. S. Erenguc, The resource constrained time cost tradeoff project scheduling problem with discounted cash flows, Journal Operation. Managmente, 14 (1996), 255-275
##[15]
M. U. Homburg, Cash flow shortage as an endogenous bankruptcy reason, Journal Banking Finance, 29(6) (2005), 1509-1534
##[16]
S. S. Liu, C. J. Wang , Resource-constrained construction project scheduling model for profit maximization considering cash flow, Automation in Construction, 17 (2008), 966-974
##[17]
Z. He, Y. Xu, Multi-mode project payment scheduling problems with bonus–penalty structure, European Journal of Operational Research, 189 (2008), 1191-1207
##[18]
G. Waligora, Discrete–continuous project scheduling with discounted cash flows—A tabu search approach, Computers & Operations Research, 35 (2008), 2141-2153
##[19]
S. Hartmann, D. Briskorn, A survey of variants and extensions of the resourceconstrained project scheduling problem, European Journal of Operational Research, 207 (2010), 1-14
##[20]
A. A. Najafi, A. Niaki, A genetic algorithm for resource investment problem with discounted cash flows, Applied Mathematics and Computation, 183 (2006), 1057-1070
##[21]
Z. He, N. Wang, T. Jia, Y. Xu, Simulated annealing and tabu search for multi-mode project payment scheduling, European Journal of Operational Research , 198 (2009), 688-696
##[22]
M. Vanhoucke , A scatter search heuristic for maximizing the net present value of a resource-constrained project with fixed activity cash flows, International Journal of Production Research, 48 (2010), 1983-2001
##[23]
B. A. Nadjafi, Sh. Shadrokh, An Algorithm for the Weighted Earliness-Tardiness Unconstrained Project Scheduling Problem, Journal of Applied Sciences, 8 (2009), 1651-1659
##[24]
B. O. Odedairo, V. Oladokun, Relevance and Applicability of Multi-objective Resource Constrained Project Scheduling ProblemETASR-Engineering, Technology & Applied Science Research, 1(6) (2011), 144-150
##[25]
M. Mika, G. Waligora, J. Wezglarz , Simulated annealing and tabu search for multimode resource-constrained project scheduling with positive discounted cash flows and different payment models, European Journal of Operation Research, forthcoming, 164 (2005), 639-668
##[26]
S. P. Chen, M. J. Tsai , Time–cost trade-off analysis of project networks in fuzzy environments, European Journal of Operational Research, 212 (2011), 386-397
##[27]
G. Ulusoy, F. S. Serifoglo, S. Sahin, Four Payment Models for the Multi-Mode Resource Constrained Project Scheduling Problem with Discounted Cash Flows, Annals of Operations Research, 102 (2001), 237-261
##[28]
G. Waligora, Discrete–continuous project scheduling with discounted cash flows—A tabu search approach, Computers & Operations Research, 35 (2008), 2141-2153
##[29]
M. Mika, G. Walig, J. Wezglarz, Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models, European Journal of Operational Research, 164 (2005), 639-668
##[30]
K. Bouleimen, H. Lecocq , A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version, European Journal of Operational Research, 149 (2003), 268-281
##[31]
H. Ghiasi, D. Pasini, L. Lessar, A non-dominated sorting hybrid algorithm for multi-objective optimization of engineering problems, Engineering Optimization. , 43(1) (2011), 39-59
##[32]
S. Bechikh, N. Belgasmi, L. B. Said, Kh. Ghédira , PHC-NSGA-II: A Novel Multi-objective Memetic Algorithm for Continuous Optimization , 20th IEEE International Conference on Tools with Artificial Intelligence, (2008)
##[33]
H. Shayeghi, A. Ghasemi, Application of MOPSO for Economic load Dispatch Solution with Transmission Losses, International Journal on Technical and Physical Problems of Engineering (IJTPE), 4 (2012)
]
An Efficient Algorithm for Solving a Stochastic Location-routing Problem
An Efficient Algorithm for Solving a Stochastic Location-routing Problem
en
en
The purpose of this paper is to determine the location of facilities and routes of vehicles, in which the facilities and routes are available within probability interval (0, 1). Hence, this study is coherent the stochastic aspects of the location problem and the vehicle routing problem (VRP). The location problem is solved by optimization software. Because of the computational complexity of the stochastic vehicle routing problem (SVRP), it is solved by a meta-heuristic algorithm based on simulated annealing (SA). This hybrid algorithm uses genetic operators in order to improve the quality of the obtained solutions. Our proposed hybrid SA is more efficient than the original SA algorithm. The associated results are compared with the results obtained by SA and optimization software.
27
38
H. A.
Hassan-pour
M.
Mosadegh-khah
M.
Zareei
Location
Vehicle routing problem
Stochastic
simulated annealing
Genetic operators.
Article.3.pdf
[
[1]
H. Min, V. Jayaraman, R. Srivastava, Combined location-routing problem: A synthesis and future research directions, European Journal of Operational Research, 108 (1998), 1-15
##[2]
G. Nagy, S. Salhi, Location- routing: Issues, models and methods, European Journal of Operational Research, 176 (2007), 649-672
##[3]
S. D. Lee, W. T. Chang , On solving the discrete location problems when the facilities are prone to failure, Applied Mathematical Modeling, 31 (2007), 817-831
##[4]
H. S. Hwang, Design of supply-chain logistics system considering service level , Computers & Industrial Engineering, 43 (2002), 283-297
##[5]
H. S. Hwang, A stochastic set-covering location model for both ameliorating and deteriorating items, Computers & Industrial Engineering, 46 (2004), 313-319
##[6]
H. A. Hassan-Pour, M. Mosadegh-Khah, R. Tavakkoli-Moghaddam, Solving a multi-objective multi-depot stochastic location-routing problem by a hybrid simulated annealing , Proceeding of the institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 223 (2009), 1045-1054
##[7]
T. H. Wu, C. Low, J. W. Bai, Heuristic solution to multi-depot location-routing problems, Computers & Operations Research, 29 (2002), 1393-1415
##[8]
K. Doerner, A. Focke, W. J. Gujahr, Multicriteria tour planning for mobile healthcare facilities in a developing country, European Journal of Operational Research, 179 (2007), 1078-1096
##[9]
G. Zhou, H. Min, M. Gen , A genetic algorithm approach to the bi-criteria allocation of customers to warehouses, International Journal of production Economics, 86 (2003), 34-45
##[10]
F. Chu, N. Labadi, C. Prins, Heuristics for the periodic capacitated arc routing problem, Journal of Intelligent Manufacturing, 16(2) (2005), 243-251
##[11]
S. Alumur, B. Y. Kara , A new model for the hazardous waste location-routing problem, Computers & operations Research, 34 (2007), 1406-1423
##[12]
E. Erkut, O. Alp , Designing a road network for hazardous material shipment, Computers & Operations Research, 34 (2007), 1389-1405
##[13]
R. Caballero, M. Gonzalez, F. M. Guerrero, J. Molina, C. Paralera, Solving a multiobjective location routing problem with a metaheuristic based on tabu search: Application to a real case in Andalusia, European Journal of Operational Research, 176 (2007), 1751-1763
##[14]
S. Z. Erdogan, E. M. Esin , Routing table updating by using intelligent agents , Journal of Intelligent Manufacturing, 20(2) (2009), 187-193
##[15]
S. C. Liu, C. H. Chung, A heuristic method for the vehicle routing problem with backhauls and inventory, Journal of Intelligent Manufacturing, 20(1) (2009), 29-42
##[16]
S. C. Liu, C. H. Chung, A heuristic method for the vehicle routing problem with backhauls and inventory , Journal of Intelligent Manufacturing, 20(1) (), 29-42
##[17]
H. A. Hassan-Pour, M. Mosadegh-Khah, R. Tavakkoli-Moghaddam, An integrated location-routing problem in a stochastic environment by a hybrid simulated annealing, Proceedings of the 6th International Symposium on Intelligent & Manufacturing Systems, Sakarya University, Turkey, (2008), 552-558
##[18]
A. R. Rahimi-Vahed, M. Rabbani, R. Tavakkoli-Moghaddam, S. A. Torabi, F. Jolai, A multi-objective scatter search for mixed-model assembly line sequencing problem, Advanced Engineering Informatics, 21 (2007), 85-99
##[19]
R. Tavakkoli-Moghaddam, N. Saffaei, Y. Gholipour, A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length, Applied Mathematics and Computation, 176 (2006), 445-454
]
Improved Bounds for the Spectral Norms of \(r\)-circulant Matrices with \(k\)-fibonacci and \(k\)-lucasnumbers
Improved Bounds for the Spectral Norms of \(r\)-circulant Matrices with \(k\)-fibonacci and \(k\)-lucasnumbers
en
en
We are concerned with the spectral norms of \(r\)-circulant matrices with the \(k\)-Fibonacci and \(k\)-Lucas
numbers. By using Abel transformation and some identities, weobtain some new lower bounds for the
spectral norms of \(r\)-circulant matrices. Havingcompared some known results, the obtained bounds are
more precise.
39
50
Lele
Liu
\(k\)-Fibonacci number
\(k\)-Lucas number
\(r\)-circulant matrix
Spectral norm.
Article.4.pdf
[
[1]
S. Falcona, A. Plaza, The \(k\)-Fibonacci sequence and the Pascal 2-triangle, Chaos,Solitons and Fractals, 33 (2007), 38-49
##[2]
S. Falcon , On the \(k\)-Lucas numbers, International Journal of Contemporary Mathematical Sciences, 6 (2011), 1039-1050
##[3]
S. Falcon, A. Plaza , On \(k\)-Fibonacci numbers of arithmetic indexes, Applied Mathematics and Computation , 208 (2009), 180-185
##[4]
J. Zhou, The spectral norms of g-circulant matrices with classical Fibonacci andLucas numbers entries, Applied Mathematics and Computation, 233 (2014), 582-587
##[5]
S. Solak , On the norms of circulant matrices with the Fibonacci and Lucas numbers, Applied Mathematics and Computation, 160 (2005), 125-132
##[6]
W. Bani-Domi, F. Kittaneh, Norm equalities and inequalities for operator matrices, Linear Algebra and its Applications, 429 (2008), 57-67
##[7]
Hamed Azami, Milad Malekzadeh, Saeid Sanei, Optimization of Orthogonal PolyphaseCoding Waveform for MIMO Radar based on Evolutionary Algorithms, The Journal of mathematics and computer Science, 6 (2013), 146-153
##[8]
Abolfazl Taleshian, DordiMohamad Saghali , The Randers \(\beta\)-Change of More Generalized \(m\)-th Root Metrics, The Journal of mathematics and computer Science, 6 (2013), 305-310
##[9]
S. Shen, J. Cen , On the bounds for the norms of \(r\)-circulant matrices with the Fibonacci and Lucas numbers, Applied Mathematics and Computation , 216 (2010), 2891-2897
##[10]
S. Shen, J. Cen , On the spectral norms of \(r\)-circulant matrices with the \(k\)-Fibonacciand \(k\)-Lucas numbers, International Journal of Contemporary Mathematical Sciences , 5 (2010), 569-578
##[11]
W. Rudin , Principles of Mathematical Analysis, 3rd Edition, McGraw-Hill (1976.)
]
Efficient Implementation of Rns Montgomery Multiplication Using Balanced Rns Bases
Efficient Implementation of Rns Montgomery Multiplication Using Balanced Rns Bases
en
en
Point multiplication is the most important part of elliptic curve cryptography which consumes remarkable time of implementation. Therefore efficiency enhancement of entire system is depending on efficiency of this part. Increasing the efficiency of the modular multiplication improve overall performance of the cryptographic system as it frequency used in some application such as Elliptic Curve Cryptography. By applying Residue Number System (RNS) to Montgomery multiplication as a method for modular multiplication, delay of modular multiplication will be reduced. Appropriate RNS moduli sets replace time consuming operation of multiplication by smaller operations. In this paper two balanced moduli set with proper dynamic range is presented and the efficiency of conversion from RNS to RNS which is the most time consuming part of the Montgomery modular multiplication will be increased.
51
64
Sakineh
Sharifi
Mohammad
Esmaeildoust
Mohammad Reza
Taheri
Keivan
Navi
residue number system (RNS)
RNS Montgomery
reverse converter
elliptic curve cryptography
Article.5.pdf
[
[1]
R. L. Rivest, A. Shamir, L. M. Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Commun. ACM, 21 (1978), 120-126
##[2]
V. S. Miller, Use of elliptic curves in cryptography, in Lecture notes in computer sciences; 218 on Advances in cryptology—CRYPTO 85. New York, NY, USA: Springer-Verlag New York, Inc., (1986), 417-426
##[3]
N. Koblitz, Elliptic Curve Cryptosystem, J. Cryptology Math. Comp., 48 (1987), 203-209
##[4]
P. Montgomery, Modular Multiplication without Trial Division, Mathematics of Computation, 44 (1985), 519-521
##[5]
J. Bajard, L. Didier, P. Kornerup, An RNS Montgomery’s Modular Multiplication Algorithm, IEEE Trans. Computers, 47 (1998), 167-178
##[6]
J. Bajard, L. Didier, and P. Kornerup, Modular Multiplication and Base Extensions in Residue Number Systems, Proc. 15th IEEE Symp. Computer Arithmetic (ARITH’01), (2001), 59-65
##[7]
J. C. Bajard, M. Kaihara, T. Plantard, Selected RNS Bases for Modular Multiplication, In 19th IEEE International Symposium on Computer Arithmetic, (2009), 25-32
##[8]
M. Gerami, M. Esmaeildoust, Sh. Rezaie, K. Navi, O. Hashemipour, Four Moduli RNS Bases for Efficient Design of Modular Multiplication, Journal of Computations & Modelling, 1 (2011), 73-96
##[9]
Sh. Rezaie, M. Esmaeildoust, M. Gerami, K. Navi, O. Hashemipour, High Dynamic Range RNS Bases for Modular Multiplication, IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 4, No 1 (2011)
##[10]
A. A. Hiasat, VLSI implementation of New Arithmetic Residue to Binary decoders, IEEE Transactions on VLSI systems, 13 (2005), 153-158
##[11]
A. S. Molahosseini, K. Navi, C. Dadkhah, O. Kavehei, S. Timarchi, Efficient Reverse Converter Designs for the new 4-Moduli Set \(\{2^n-1, 2^n,2^n+1, 2^{2n+1}-1\}\) and \(\{2^n-1, 2^n+1, 2^{2n}, 2^{2n}+1\}\) Based on New CRTs, IEEE Transactions on Circuits and Systems-I, 57(4) (2010), 823-835
##[12]
B. Cao, C. Chang, T. Srikanthan, An Efficient Reverse Converter for the 4-Moduli Set \(\{2^n-1, 2^n, 2^n+1, 2^{2n}+1\}\) Based on the New Chinese Remainder Theorem, IEEE Transactions on Circuits and Systems-I: Fundamental Theory and Applications, 50(10) (2003), 1296-1303
##[13]
P. M. Matutino, R. Chaves, L. Sousa, Arithmetic units for RNS moduli \(\{2^n − 3\}\) and \(\{2^n + 3\}\) operations, in 13th EUROMICRO Conference on Digital System Design: Architectures, Methods and Tools (2010)
##[14]
R. Zimmermann, Efficient vlsi implementation of modulo (2n ± 1) addition and multiplication, in 14th IEEE Symposium on Computer Arithmetic, (1999)
##[15]
S. B. R. A. Patel, M. Benaissa, N. Powell, Power-delay-area efficient modulo \(2^n + 1\) adder architecture for rns, Electronics Letters, 231 - 232 (2005)
##[16]
R. Zimmermann, Binary adder architectures for cell-based VLSI and their synthesis, Ph.D. dissertation, Swiss Federal Institute of Technology (ETH) Zurich, Hartung-Gorre Verlag (1998)
##[17]
R. Chaves, L. Sousa, Improved \(2n + 1\) multipliers, Technical Report RT/14/2003, INESC-ID (2003)
##[18]
R. Chaves, L. Sousa, \(2^n + 1, 2^n+k, 2^n − 1\): A new RNS moduli set extension, in EUROMICRO Systems on Digital System Design, (2004)
##[19]
P. M. Matutino, R. Chaves, L. Sousa, Binary-to-RNS conversion units for moduli \(\{2n±3\}\), in 14th EUROMICRO Conference on Digital System Design: Architectures, Methods and Tools (2011)
##[20]
F. J. Taylor, Residue arithmetic: A tutorial with examples, Computer, 17 (1984), 50-62
##[21]
M. Esmaeildoust, A. Kaabi, High Speed Reverse Converter for the Five Moduli Set \(\{2^n, 2^n-1, 2^n+1, 2^n-3, 2^{n-1}-1\}\), TJMCS, (2009), 438-450
##[22]
K. Navi, A. S. Molahosseini, M. Esmaeildoust, How to teach residue number system to computer scientists and engineers?, IEEETrans. Edu., 54 (2011), 156-163
##[23]
B. Parhami, Computer Arithmetic: Algorithms and Hardware Design, Oxford, U.K.: Oxford Univ, Press (2000)
##[24]
B. Cao, C. H. Chang, T. Srikanthan, Adder based residue to binary converters for a new balanced 4-moduli set, in Proc. 3rd IEEE Symp.Image, Signal Process. Anal., 2 (2003), 820-825
##[25]
N. Keivan, M. Esmaeildoust, AS. Molahosseini, A General Reverse Converter Architecture with Low Complexity and High Performance, IEICE TRANSACTIONS on Information and Systems, 94 (2) (2011), 264-273
##[26]
B. Cao, T. Srikanthan, C. H. Chang, Efficient reverse converters for the four-moduli sets \(\{2n–1, 2n, 2n+1, 2n+1–1\}\) and \(\{2n–1, 2n, 2n+1, 2n–1–1\}\), IEE Proc. Comput. Digit.Tech., 152 (2005), 687-696
##[27]
K. Hwang, Computer Arithmetic: Principle, Architecture and Design, Wiley, New York (1979)
##[28]
S. J. Piestrak, Design of residue generators and multioperand modular adders using carry-save adders, IEEE Trans. Comput., 423 (1994), 68-77
##[29]
S. J. Piestrak, A high speed realization of a residue to binary converter, IEEE Trans. Circuits Syst. II, Analog.Digit. Signal Process, 42 (1995), 661-663
##[30]
D. Younes, P. Steffan, Novel Modulo \(2^n+1\) Subtractor and Multiplier , ICONS: The Sixth International Conference on Systems, (2011), 36-38
##[31]
Reto Zimmermann, Lecture notes on Computer Arithmetic: Principles, Architectures and VLSI Design, Integrated System Laboratory , Swiss Federal Institute of Technology (ETH) Zurich (1999)
##[32]
D. M. Schinianakis, A. P. Fournaris, H. E. Michail, A. P. Kakarountas, T. Stouraitis, An RNS Implementation of an Fp Elliptic Curve Point Multiplier, IEEE Transactions on Circuits and Systems—I, VOL. 56, NO. 6 (2009)
]
Comparison of Fuzzy Numbers with Ranking Fuzzy and Real Number
Comparison of Fuzzy Numbers with Ranking Fuzzy and Real Number
en
en
Ranking fuzzy numbers play as a key tool in many applied models in the world and in particular decision-making procedures. We are going to present a new method based on the ranking the fuzzy number and real number. The problem of ranking the fuzzy number and real number is proposed with ranking function and then this approach to extend the ranking of two fuzzy numbers with ranking function. The proposed method is illustrated by some numerical examples and in particular the results of ranking by the proposed method and some common and existing methods for ranking fuzzy sets is compared to verify the advantage of the new approach. We will see that against of most existing ranking approaches where for two fuzzy sets are the exact ranking, the above men sioned method can give a ranking fuzzy numbers with acceptance rate smaller as fuzzy.
65
72
M.
Yaghobi
M.
Rabbani
M. Adabitabar
Firozja
J.
Vahidi
Fuzzy numbers
Ranking.
Article.6.pdf
[
[1]
A. Esi, On some new paranormed sequence spaces of fuzzy numbers defined by Orlicz functions and statistical convergence, Math. Modelling Analysis, 4 (2006), 379-388
##[2]
A. Mahmodi Nejad, M. Mashinchi , Ranking fuzzy numbers based on the areas on the left and the right sides of fuzzy number, Computers and Mathematics with Applications , 61 (2011), 431-442
##[3]
B. Asady, The revised method of ranking LR fuzzy number based on deviation degree, Expert Systems with Application, 37 (2010), 5056-5060
##[4]
B. C. Tripathy, A. Baruah, Lacunary statistically convergent and lacunary strongly convergent generalized difference sequences of fuzzy real numbers , Kyungpook Mathematical Journal, 50 (2010), 565-574
##[5]
B. C. Tripathy, A. J. Dutta , On I-acceleration convergence of sequences of fuzzy real numbers, Mathematical Modelling and Analysis, 17 (2012), 549-557
##[6]
B. C. Tripathy, B. Sarma , On I-convergent double sequences of fuzzy real numbers, Kyungpook Mathematical Journal, 52 (2012), 189-200
##[7]
C. H. Cheng, A new approach for ranking fuzzy numbers by distance method, Fuzzy sets and Systems , 95 (1998), 307-317
##[8]
D. Dubios, H. prade, Fuzzy sets and Systems: Theory and Application, Academic Press, New york (1980)
##[9]
G. Bortolan, R. Degan , A review of some method for ranking fuzzy sets, fuzzy sets and Systems , 15 (1985), 1-19
##[10]
L. Tran, L. Duckstein , Comparison of fuzzy numbers using a fuzzy distance measure, Fuzzy Sets and Systems , 130 (2002), 331-341
##[11]
M. Adabitabar Firozja, B. Agheli, M. Hosseinzadeh, Ranking function of two LR-fuzzy numbers, Journal of Intelligent and Fuzzy Systems, accepted (2013)
##[12]
M. Adabitabar Firozja, T. Houlari, Comparison of fuzzy numbers with ranking function of two LR-fuzzy numbers, , ()
##[13]
M. Ma, A. Kandel, M. Friedman, A new approach for defuzzification, Fuzzy Sets and Systems , 111 (2000), 351-356
##[14]
M. Ma, A. Kandel, M. Friedman, A new approach for defuzzification, Fuzzy Sets and Systems , 128 (2000), 133-134
##[15]
M. Modarres, S. S. Nezhad, Ranking fuzzy numbers by preference ratio, Fuzzy Sets and Systems , 118 (2001), 429-439
##[16]
O. Kaleva, S. Seikkala , On fuzzy metric spaces, Fuzzy Sets Systems, 12 (1984), 215-229
##[17]
P. Fortemps, M. Roubens, Ranking and defuzzification method based on area compensation, Fuzzy Sts and Systems , 82 (1996), 319-330
##[18]
S. Abbasbandy, B. Asady, Ranking of Fuzzy numbers by sign distance, Information Sciences , 176 (2006), 2405-2416
##[19]
S. Abbasbandy, T. Hajjari, A new approach for ranking of trapezoidal fuzzy numbers, Computing and Methematics with Application , 57 (2009), 413-419
##[20]
T. Allahviranloo, M. Adabitabar Firozja, Ranking of fuzzy numbers by a new metric, Soft Computing, 14 (2010), 773-782
##[21]
X. Wang, E. E. Kree , Reasonable Properties for the ordering of fuzzy quantities I , Fuzzy Sets Systems, 118 (2001), 375-385
##[22]
Y. M. Wang, Y. Luo , Area ranking of fuzzy numbers based on positiveand negative ideal point , Computers and Mathematics with Applications, 58 (2009), 1769-1779
##[23]
Z. X. Wang, Y. J. Liu, Z. P. Fan, B. Feng, Ranking LR fuzzy number based on deviation degree, Information Sciences , 179 (2009), 2070-2077
]
Optimal Membership Function for Creating Fuzzy Classifiers Ensemble
Optimal Membership Function for Creating Fuzzy Classifiers Ensemble
en
en
Recent researches have shown that ensembles with more diversity classifiers have more accuracy. Six methods for measuring diversity have been introduced in this paper. These methods for measuring diversity are disagreement measure, double-fault measure, Kohavi-Wolpert variance, measurement of inter-rater agreement, measure of difficulty and generalized diversity. Six methods of measuring diversity are applied to ensemble of fuzzy classifiers produced by bagging using ANFIS as the base classifier. For an ensemble of fuzzy classifiers, relationship between membership functions and diversity has been studied. Experimental results show that using triangular membership function lead to more diverse classifiers and ensemble with more accuracy.
73
84
M.
Hassanzadeh
G.
Ardeshir
Accuracy
Diversity measurement
Ensemble of Classifiers
Fuzzy Classifiers
Article.7.pdf
[
[1]
L. I. Kuncheva, C. J. Whitaker, Measures of diversity in classifier ensembles, Machine Learning, 1 (2003), 181-207
##[2]
L. Kuncheva, Combining Pattern Classifiers, Methods and Algorithms, John Wiley & Sons (2004)
##[3]
L. Hansen, P. Salamon, Neural network ensembles , IEEE Transactions on Pattern Analysis and Machine Intelligence, 12 (1990), 993-1001
##[4]
E. K. Tang, P. N. Suganthan, X. Yao, An analysis of diversity measures, Machine Learning , 65 (2006), 247-271
##[5]
L. Breiman, Bagging predictors, Machine Learning , 24 (2) (1999), 123-140
##[6]
L. Breiman, Arcing classifiers, The Annals of Statistics, 26(3) (1998), 801-849
##[7]
D. Optiz, R. Macline, Popular ensemble methods: an empirical. study, Journal of Artificial Intelligence Research, vol. 11 (1999)
##[8]
Lior Rokach, Taxonomy for characterizing ensemble methods in classification tasks: A review and annotated bibliography, Computational statistics and data analysis, 53 (2009), 4046-4072
##[9]
J. Fleiss, Statistical methods for rates and proportions, , John Wiley & Sons (1981)
##[10]
D. Patridge, W. J. Krzanowski , Software diversity: Practical statistics for its measurement and exploitation, Information & Software Technology, 39 (1997), 707-717
##[11]
R. Kohavi, D. Wolpert, Bias plus variance decomposition for zero-one loss functions, Proc. 13th Int. Conference on Machine Learning, (1996), 275-283
##[12]
G. Giacinto, F. Roli, Design of effective neural network ensembles for image classification processes, Image Vision and Computing, 19(9/10) (2001), 699-707
##[13]
J. S. R. Jang , ANFIS: Adaptive-Network-Based Fuzzy Inference System, IEEE Trans. Systems, Man, Cybernetics, 23(5/6) (1993), 665-685
##[14]
Juana Canul-Reich, Larry Shoemaker, Lawrence O. Hall, Ensembles of Fuzzy Classifiers, IEEE International Conference on Fuzzy Systems, (2007)
]
Fixed Point Resultsin Partial Metric Spaces Using Generalized Weak Contractive Conditions
Fixed Point Resultsin Partial Metric Spaces Using Generalized Weak Contractive Conditions
en
en
In this work, fixed point results using generalized weakly contractive conditions on partial metric
spaces are presented. These results generalize many previously obtained results. Some examples are also
given to show the usability of these results.
85
98
M.
Akram
W.
Shamaila
Partial Metric
Generalized Weak contractive condition
Fixed point.
Article.8.pdf
[
[1]
S. G. Matthews, Partial metric spaces , Research Report 212. Department of Computer Science, University of Warwick (1992)
##[2]
S. G. Matthews, Partial metric topology , General topology and its appl. Ann New York Acad of Sci., 728 (1994), 183-197
##[3]
E. Karapinar, Generalizations of Caristi Kirk’s theorems on partial metric spaces, Fixed Point Theory and Application , doi:10.1186/1687-1812-2011-4. (2011)
##[4]
I. Altun, A. Erduran, Fixed point theorem for monotone mappings on partial metric spaces , Fixed point theory appl, Article ID 508730, 2011 (2010), 1-10
##[5]
T. Abdeljawed, Fixed points for generalized weakly contractive mappings in partial metric spaces, Mathematical and Computer modelling, 54 (2011), 2923-2927
##[6]
E. Karapinar, U. Yuskel , Some common fixed point theorems in partial metric spaces, J. of Appl. Mathematics, Article ID 263621, 2011 (2011), 1-16
##[7]
T. Abdeljawed, E. Karapiner, K. Tas, A generalized contraction principle with control function on partial metric spaces, Computers and Mathematics with Appl. , 63 (2012), 716-719
##[8]
T. Abdeljawed, E. Karapiner, K. Tas , Existence and uniqueness of a common fixed point on partial metric spaces, Appl Math Lett., 24 (2011), 1900-1904
##[9]
B. S. Choudhury, A. Kundu , Weak contractions in partial metric spaces, Department of Mathematics Bengal engineering and Sci Uni Shibpur, P.O-B garden Howrah-711103. , India. ()
##[10]
D. W. Boyd, T. S. W. Wong, On nonlinear contractions , Proc Amer Math Soc., 69; 20 (), 458-464
##[11]
Y. I. Alber, S. Guerre-Delabriere, Principles of weakly contractive maps in Hilbert spaces, in: New results in operator theory,in: I.GoldbergYu.Lyubich(Eds), Advances and Appl. Birkhäuser, Basel, 98 (1997), 7-22
##[12]
Q. Zhang, Y. Song, Fixed point theory for generalized-weak contractions, Appl Math Lett. 2008, 22 (2009), 75-78
##[13]
B. E. Rhoades, Some theorems on weakly contractive maps, Nonlinear Anal. , 47 (2001), 2683-2693
##[14]
M. Jain, N. Gupta, S. Kumar, Coupled fixed point results for mappings involving \((\alpha, \psi)\)-weak contractions in ordered metric spaces and applications , The Journal of Mathematics and Computer Science, 10 (2012), 23-46
]