Mathematics / Matematik
Permanent URI for this collectionhttps://hdl.handle.net/11147/8
Browse
15 results
Search Results
Conference Object Measure on Time Scales With Mathematica(Springer Verlag, 2006) Ufuktepe, Ünal; Yantır, AhmetIn this paper we study the Lebesgue Delta-measure on time scales. We refer to [3, 4] for the main notions and facts from the general measure and Lebesgue Delta integral theory. The objective of this paper is to show how the main concepts of Mathematica can be applied to fundamentals of Lebesgue Delta- and Lebesgue Delta- measure on an arbitrary time scale and also on a discrete time scale whose rule is given by the reader. As the time scale theory is investigated in two parts, by means of alpha and rho operators, we named the measures on time scales by the set function DMeasure and NMeasure respectively for arbitrary time scales.Article Citation - WoS: 35Citation - Scopus: 93Search for Resonant and Nonresonant Higgs Boson Pair Production in the B B ¯final State in Proton-Proton Collisions at ?s=13 Tev(Springer Verlag, 2018) CMS Collaboration; Karapınar, GülerSearches for resonant and nonresonant pair-produced Higgs bosons (HH) decaying respectively into , through either W or Z bosons, and b b ¯ are presented. The analyses are based on a sample of proton-proton collisions at s=13 TeV, collected by the CMS experiment at the LHC, corresponding to an integrated luminosity of 35.9 fb −1 . Data and predictions from the standard model are in agreement within uncertainties. For the standard model HH hypothesis, the data exclude at 95% confidence level a product of the production cross section and branching fraction larger than 72 fb, corresponding to 79 times the standard model prediction. Constraints are placed on different scenarios considering anomalous couplings, which could affect the rate and kinematics of HH production. Upper limits at 95% confidence level are set on the production cross section of narrow-width spin-0 and spin-2 particles decaying to Higgs boson pairs, the latter produced with minimal gravity-like coupling.Article Citation - WoS: 24Citation - Scopus: 26Pseudorapidity Distributions of Charged Hadrons in Proton-Lead Collisions at ?snn=5.02 and 8.16 Tev(Springer Verlag, 2018) CMS Collaboration; Karapınar, GülerThe pseudorapidity distributions of charged hadrons in proton-lead collisions at nucleon-nucleon center-of-mass energies sNN=5.02 and 8.16 TeV are presented. The measurements are based on data samples collected by the CMS experiment at the LHC. The number of primary charged hadrons produced in non-single-diffractive proton-lead collisions is determined in the pseudorapidity range |η lab | < 2.4. The charged-hadron multiplicity distributions are compared to the predictions from theoretical calculations and Monte Carlo event generators. In the center-of-mass pseudorapidity range |η cm | < 0.5, the average charged-hadron multiplicity densities 〈dN ch /dη cm 〉 |ηcm| < 0.5 are 17.31 ± 0.01 (stat) ± 0.59 (syst) and 20.10 ± 0.01 (stat) ± 0.85(syst) at sNN=5.02 and 8.16 TeV, respectively. The particle densities per participant nucleon are compared to similar measurements in proton-proton, proton-nucleus, and nucleus-nucleus collisions.Article An Application With Webmathematica(Springer Verlag, 2003) Ufuktepe, ÜnalThere have been many technological dawns in the last 30 years, during which the desktop computer and the Internet have been developed. The importance of Internet in education, particularly using its Web is a well-recognized fact. A wealth of resources and techniques now exist which serve as a source both for exciting examples of new teaching practices, as well as easily accessible methods for adoption into various formats of teaching and learning. Internet technology allow teachers and students keep up with their minds. It let them try their ideas as soon as they come up with them. Generally, students appreciate the convenience, choice, and flexibility that an online courses offers. Instructional designers value the standardized framework and flexibility. WebMathematica is a web-based technology developed by Wolfram Research that allows the generation of dynamic web content with Mathematica. With this technology, the distance education students should be able to explore and experiment with the mathematical concepts. In this paper we will elucidate the pedagogical issues in the application of Hamiltonian systems in the webMathematica for the distance learning environment and the shape of the future "classroom" as well as relevant educational strategies towards improving mathematics education.Article Citation - WoS: 2Citation - Scopus: 1Basic Calculus on Time Scale With Mathematica(Springer Verlag, 2003) Yantır, Ahmet; Ufuktepe, ÜnalMathematical modeling of time dependent systems are always interesting for applied mathematicians. First continuous and then discrete mathematical modeling are built during the mathematical development from ancient to the modern times. By the discovery of the time scales, the problem of irregular controlling of time dependent systems is solved in 1990's. In this paper, we explain the derivative of functions on time scales and the solutions of some basic calculus problems by using Mathematica. © Springer-Verlag Berlin Heidelberg 2003.Conference Object Citation - WoS: 34On the Importance of Public-Key Validation in the Mqv and Hmqv Key Agreement Protocols(Springer Verlag, 2006) Menezes, Alfred; Ustaoğlu, BerkantHMQV is a hashed variant of the MQV key agreement protocol proposed by Krawczyk at CRYPTO 2005. In this paper, we present some attacks on HMQV and MQV that are successful if public keys are not properly validated. In particular, we present an attack on the two-pass HMQV protocol that does not require knowledge of the victim's ephemeral private keys. The attacks illustrate the importance of performing some form of public-key validation in Diffie-Hellman key agreement protocols, and furthermore highlight the dangers of relying on security proofs for discrete-logarithm protocols where a concrete representation for the underlying group is not specified.Article Citation - Scopus: 9Sufficient Condition for Ephemeral Key-Leakage Resilient Tripartite Key Exchange(Springer Verlag, 2012) Fujioka, Atsushi; Manulis, Mark; Suzuki, Koutarou; Ustaoğlu, BerkantTripartite (Diffie-Hellman) Key Exchange (3KE), introduced by Joux (ANTS-IV 2000), represents today the only known class of group key exchange protocols, in which computation of unauthenticated session keys requires one round and proceeds with minimal computation and communication overhead. The first one-round authenticated 3KE version that preserved the unique efficiency properties of the original protocol and strengthened its security towards resilience against leakage of ephemeral (session-dependent) secrets was proposed recently by Manulis, Suzuki, and Ustaoglu (ICISC 2009). In this work we explore sufficient conditions for building such protocols. We define a set of admissible polynomials and show how their construction generically implies 3KE protocols with the desired security and efficiency properties. Our result generalizes the previous 3KE protocol and gives rise to many new authenticated constructions, all of which enjoy forward secrecy and resilience to ephemeral key-leakage under the gap Bilinear Diffie-Hellman assumption in the random oracle model. © 2012 Springer-Verlag.Conference Object Citation - WoS: 4Reusing Static Keys in Key Agreement Protocols(Springer Verlag, 2009) Chatterjee, Sanjit; Menezes, Alfred; Ustaoğlu, BerkantContrary to conventional cryptographic wisdom, the NIST SP 800-56A standard explicitly allows the use of a static key pair in more than one of the key establishment protocols described in the standard. In this paper, we give examples of key establishment protocols that are individually secure, but which are insecure when static key pairs are reused in two of the protocols. We also propose an enhancement of the extended Canetti-Krawczyk security model and definition for the situation where static public keys are reused in two or more key agreement protocols. © 2009 Springer-Verlag.Conference Object Citation - WoS: 28Strongly Secure Authenticated Key Exchange Without Naxos' Approach(Springer Verlag, 2009) Kim, Minkyu; Fujioka, Atsushi; Ustaoğlu, BerkantLaMacchia, Lauter and Mityagin [15] proposed the extended Canetti-Krawczyk (eCK) model and an AKE protocol, called NAXOS. Unlike previous security models, the adversary in the eCK model is allowed to obtain ephemeral secret information related to the test session, which makes the security proof difficult. To overcome this NAXOS combines an ephemeral private key x with a static private key a to generate an ephemeral public key X; more precisely X∈=∈g H(x,a). As a result, no one is able to query the discrete logarithm of X without knowing both the ephemeral and static private keys. In other words, the discrete logarithm of an ephemeral public key, which is typically the ephemeral secret, is hidden via an additional random oracle. In this paper, we show that it is possible to construct eCK-secure protocol without the NAXOS' approach by proposing two eCK-secure protocols. One is secure under the GDH assumption and the other under the CDH assumption; their efficiency and security assurances are comparable to the well-known HMQV [12] protocol. Furthermore, they are at least as secure as protocols that use the NAXOS' approach but unlike them and HMQV, the use of the random oracle is minimized and restricted to the key derivation function. © 2009 Springer-Verlag Berlin Heidelberg.Conference Object Citation - WoS: 9Towards Denial-Of Key Agreement Protocols(Springer Verlag, 2009) Stebila, Douglas; Ustaoğlu, BerkantDenial of service resilience is an important practical consideration for key agreement protocols in any hostile environment such as the Internet. There are well-known models that consider the security of key agreement protocols, but denial of service resilience is not considered as part of these models. Many protocols have been argued to be denial-of-service-resilient, only to be subsequently broken or shown ineffective. In this work we propose a formal definition of denial of service resilience, a model for secure authenticated key agreement, and show how security and denial of service resilience can be considered in a common framework, with a particular focus on client puzzles. The model accommodates a variety of techniques for achieving denial of service resilience, and we describe one such technique by exhibiting a denial-of-service-resilient secure authenticated key agreement protocol. Our approach addresses the correct integration of denial of service countermeasures with the key agreement protocol to prevent hijacking attacks that would otherwise render the countermeasures irrelevant. © 2009 Springer Berlin Heidelberg.