Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Hybrid Non Repudiation Protocol with Pairing Based Cryptography
Date
2015-05-11
Author
Sever, Ömer
Akyıldız, Ersan
Metadata
Show full item record
Item Usage Stats
54
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/80881
Conference Name
Hybrid Non Repudiation Protocol with Pairing Based Cryptography
Collections
Unverified, Conference / Seminar
Suggestions
OpenMETU
Core
Hybrid probabilistic timing analysis with extreme value theory and copulas
Bekdemir, Levent.; Bazlamaçcı, Cüneyt Fehmi; Department of Electrical and Electronics Engineering (2019)
The primary challenge of time-critical systems is to ensure that a task completes its execution before its deadline. In order to ensure that the underlying system comply with stringent timing requirements, designers ought to analyze the timing behavior of the software and its sub-components. Worst-Case Execution Time (WCET) represents the maximum length of time an individual software unit takes to execute and is the most essential value for schedulability analysis in safety-critical systems. Recent studies ...
Hybrid Genetic Algorithm with Simulated Annealing for Resource-Constrained Project Scheduling
BETTEMİR, ÖNDER HALİS; Sönmez, Rifat (American Society of Civil Engineers (ASCE), 2015-09-01)
Resource-constrained project scheduling problem (RCPSP) is a very important optimization problem in construction project management. Despite the importance of the RCPSP in project scheduling and management, commercial project management software provides very limited capabilities for the RCPSP. In this paper, a hybrid strategy based on genetic algorithms, and simulated annealing is presented for the RCPSP. The strategy aims to integrate parallel search ability of genetic algorithms with fine tuning capabili...
Hybrid meta-heuristic algorithms for the resource constrained multi-project scheduling problem
Uysal, Furkan; Sönmez, Rifat; Department of Civil Engineering (2014)
The general resource constrained multi-project scheduling problem (RCMPSP) consists of simultaneous scheduling of two or more projects with common resource constraints, while minimizing duration of the projects. Critical Path Method and other scheduling methods do not consider resource conflicts and practically used commercial project management software packages and heuristic methods provide very limited solutions for the solution of the RCMPSP. Considering the practical importance of multi-project schedul...
Hybrid cdn p2p architecture for multimedia streaming
Öztoprak, Kasım; Atalay, Mehmet Volkan; Department of Computer Engineering (2008)
In this thesis, the problems caused by peer behavior in peer-to-peer (P2P) video streaming is investigated. First, peer behaviors are modeled using two dimensional continuous time markov chains to investigate the reliability of P2P video streaming systems. Then a metric is proposed to evaluate the dynamic behavior and evolution of P2P overlay network. Next, a hybrid geographical location-time and interest based clustering algorithm is proposed to improve the success ratio and reduce the delivery time of req...
Hybrid metaheuristic algorithms for single and multi-objective 2d bin packing problem
Beyaz, Muhammed; Coşar, Ahmet; Dökeroğlu, Tansel; Department of Computer Engineering (2015)
2D Bin packing problem (2DBPP) is an NP-hard combinatorial optimization problem. Objects with di erent width and length sizes are packed in order to minimize the number of unit-capacity bins according to an objective function. Single or multiobjective versions of this well-known industrial engineering problem can be faced frequently in real life situations. There have been several heuristics proposed for the solution of 2DBPP until now where it is not possible to find the exact solutions for large problem i...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
Ö. Sever and E. Akyıldız, “Hybrid Non Repudiation Protocol with Pairing Based Cryptography,” Ankara, Türkiye, 2015, p. 58, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/80881.