Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2020 ( 12 )

2019 ( 697 )

2018 ( 818 )

2017 ( 752 )

Custom range...

Search Results: 1 - 10 of 461902 matches for " A. Nakassis "
All listed articles are free for downloading (OA Articles)
Page 1 /461902
Display every page Item
The combinational structure of non-homogeneous Markov chains with countable states
A. Mukherjea,A. Nakassis
International Journal of Mathematics and Mathematical Sciences , 1983, DOI: 10.1155/s0161171283000320
Abstract: Let P(s,t) denote a non-homogeneous continuous parameter Markov chain with countable state space E and parameter space [a,b], ¢ ’ ¢ 0}. It is shown in this paper that R(s,t) is reflexive, transitive, and independent of (s,t), s Keywords non-homogeneous Markov chains --- reflexive and transitive relations --- homogeneity condition.
Vulnerability of Selfish Routing to Attacks: Game-theoretic Models and Initial Results
D. Genin,V. Marbukh,A. Nakassis
Lecture Notes in Engineering and Computer Science , 2010,
Recent results in hyperring and hyperfield theory
Anastase Nakassis
International Journal of Mathematics and Mathematical Sciences , 1988, DOI: 10.1155/s0161171288000250
Abstract: This survey article presents some recent results in the theory of hyperfields and hyperrings, algebraic structures for which the “sum ” of two elements is a subset of the structure. The results in this paper show that these structures cannot always be embedded in the decomposition of an ordinary structure (ring or field) in equivalence classes and that the structural results for hyperfields and hyperrings cannot be derived from the corresponding results in field and ring theory.
A topological property of 2(N)
Anastase Nakassis
International Journal of Mathematics and Mathematical Sciences , 1980, DOI: 10.1155/s0161171280000518
Abstract: In this paper we prove that the Stone-Cech-compactification of the natural numbers does not admit a countable infinite decomposition into subsets homeomorphic to each other and to the said compactification.
LDPC for QKD Reconciliation
Alan Mink,Anastase Nakassis
Computer Science , 2012,
Abstract: We present the Low Density Parity Check (LDPC) forward error correction algorithm adapted for the Quantum Key Distribution (QKD) protocol in a form readily applied by developers. A sparse parity check matrix is required for the LDPC algorithm and we suggest using some that have been defined by the IEEE and ETSI standards organizations for use in various communication protocols. We evaluate the QKD performance of these various parity check matrices as a function of the quantum bit error rate. We also discuss the computational precision required for this LPDC algorithm. As QKD evolves towards deployment, complete algorithm descriptions and performance analysis, as we present, will be required.
Modeling queuing dynamics of TCP: a simple model and its empirical validation
Daniel Genin,Tassos Nakassis
Computer Science , 2011,
Abstract: Understanding queuing dynamics of TCP is important for correct router buffer sizing as well as for optimizing the performance of the TCP protocol itself. However, modeling of buffer content dynamics under TCP has received relatively little attention given its importance. Commonly used queuing models are based on overly simplistic assumptions about the packet arrival process. As a consequence, there are no quantitatively accurate closed loop TCP models capable of predicting performance even for a single link shared by multiple flows. Our present paper aims to close this gap by proposing a simple TCP queuing model, which is based on experimental observations and validated by extensive packet level simulations.
Quantum key distribution with 1.25 Gbps clock synchronization
J. C. Bienfang,A. J. Gross,A. Mink,B. J. Hershman,A. Nakassis,X. Tang,R. Lu,D. H. Su,Charles W Clark,Carl J. Williams,E. W. Hagley,Jesse Wen
Physics , 2004, DOI: 10.1364/OPEX.12.002011
Abstract: We have demonstrated the exchange of sifted quantum cryptographic key over a 730 meter free-space link at rates of up to 1.0 Mbps, two orders of magnitude faster than previously reported results. A classical channel at 1550 nm operates in parallel with a quantum channel at 845 nm. Clock recovery techniques on the classical channel at 1.25 Gbps enable quantum transmission at up to the clock rate. System performance is currently limited by the timing resolution of our silicon avalanche photodiode detectors. With improved detector resolution, our technique will yield another order of magnitude increase in performance, with existing technology.
Detector dead-time effects and paralyzability in high-speed quantum key distribution
Daniel J. Rogers,Joshua C. Bienfang,Anastase Nakassis,Hai Xu,Charles W. Clark
Physics , 2007, DOI: 10.1088/1367-2630/9/9/319
Abstract: Recent advances in quantum key distribution (QKD) have given rise to systems that operate at transmission periods significantly shorter than the dead times of their component single-photon detectors. As systems continue to increase in transmission rate, security concerns associated with detector dead times can limit the production rate of sifted bits. We present a model of high-speed QKD in this limit that identifies an optimum transmission rate for a system with given link loss and detector response characteristics.
The Spread of Infectious Disease on Network Using Neutrosophic Algebraic Structure  [PDF]
A. Zubairu, A. A. Ibrahim
Open Journal of Discrete Mathematics (OJDM) , 2017, DOI: 10.4236/ojdm.2017.72009
Abstract: Network theory and its associated techniques has tremendous impact in various discipline and research, from computer, engineering, architecture, humanities, social science to system biology. However in recent years epidemiology can be said to utilizes these potentials of network theory more than any other discipline. Graph which has been considered as the processor in network theory has a close relationship with epidemiology that dated as far back as early 1900 [1]. This is because the earliest models of infectious disease transfer were in a form of compartment which defines a graph even though adequate knowledge of mathematical computation and mechanistic behavior is scarce. This paper introduces a new type of disease propagation on network utilizing the potentials of neutrosophic algebraic group structures and graph theory.
A Comparative Investigation of Lead Sulfate and Lead Oxide Sulfate Study of Morphology and Thermal Decomposition  [PDF]
S. A. A. Sajadi
American Journal of Analytical Chemistry (AJAC) , 2011, DOI: 10.4236/ajac.2011.22024
Abstract: The compound lead oxide sulfate PbSO4.PbO was prepared in our laboratory. The Thermal behavior of PbSO4 was studied using techniques of Thermogravimetry under air atmosphere from 25 to 1200°C. The identity of both compounds was confirmed by XRD technique. Results obtained using both techniques support same decomposition stages for this compound. The electron microscopic investigations are made by SEM and TEM. The compound is characterized by XRD and the purity was determined by analytical Methods. Also a series of thermogravimetric analysis is made and the ideal condition is determined to convert this compound to pure lead oxide.
Page 1 /461902
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.