$$\mathrm{G}_2$$-Instantons on Noncompact $$\mathrm{G}_2$$-Manifolds: Results and Open Problems

2020 ◽  
pp. 287-317
Author(s):  
Jason D. Lotay ◽  
Goncalo Oliveira
Keyword(s):  
Open Problems

Topics in Quaternion Linear Algebra

2014 ◽  
Author(s):  
Leiba Rodman
Keyword(s):  
Linear Algebra ◽  
Complex Analysis ◽  
Dimensional Space ◽  
Applied Mathematics ◽  
Three Dimensional ◽  
Number System ◽  
Graduate Course ◽  
Open Problems ◽  
Unpublished Research ◽  
Reference Tool

Quaternions are a number system that has become increasingly useful for representing the rotations of objects in three-dimensional space and has important applications in theoretical and applied mathematics, physics, computer science, and engineering. This is the first book to provide a systematic, accessible, and self-contained exposition of quaternion linear algebra. It features previously unpublished research results with complete proofs and many open problems at various levels, as well as more than 200 exercises to facilitate use by students and instructors. Applications presented in the book include numerical ranges, invariant semidefinite subspaces, differential equations with symmetries, and matrix equations. Designed for researchers and students across a variety of disciplines, the book can be read by anyone with a background in linear algebra, rudimentary complex analysis, and some multivariable calculus. Instructors will find it useful as a complementary text for undergraduate linear algebra courses or as a basis for a graduate course in linear algebra. The open problems can serve as research projects for undergraduates, topics for graduate students, or problems to be tackled by professional research mathematicians. The book is also an invaluable reference tool for researchers in fields where techniques based on quaternion analysis are used.

Continuous Glucose Monitoring Time Series and Hypo/Hyperglycemia Prevention: Requirements, Methods, Open Problems

2008 ◽  
Vol 4 (3) ◽  
pp. 181-192 ◽  
Author(s):  
Giovanni Sparacino ◽  
Andrea Facchinetti ◽  
Alberto Maran ◽  
Claudio Cobelli
Keyword(s):  
Time Series ◽  
Continuous Glucose Monitoring ◽  
Glucose Monitoring ◽  
Open Problems ◽  
Monitoring Time

Secure Cloud Quantum Computing with Verification Based on Quantum Interactive Proof

Impact ◽  
2019 ◽  
Vol 2019 (10) ◽  
pp. 30-32
Author(s):  
Tomoyuki Morimae
Keyword(s):  
Quantum Computing ◽  
Quantum Information ◽  
Theoretical Physics ◽  
View Point ◽  
Research Subjects ◽  
Interactive Proof ◽  
Open Problems ◽  
Main Research ◽  
Proof Systems ◽  
Information Group

In cloud quantum computing, a classical client delegate quantum computing to a remote quantum server. An important property of cloud quantum computing is the verifiability: the client can check the integrity of the server. Whether such a classical verification of quantum computing is possible or not is one of the most important open problems in quantum computing. We tackle this problem from the view point of quantum interactive proof systems. Dr Tomoyuki Morimae is part of the Quantum Information Group at the Yukawa Institute for Theoretical Physics at Kyoto University, Japan. He leads a team which is concerned with two main research subjects: quantum supremacy and the verification of quantum computing.

Classification of Cloud Systems Cyber-security Threats and Solutions Directives

2017 ◽  
Vol 2 (3) ◽  
pp. 1
Author(s):  
Hanane Bennasar ◽  
Mohammad Essaaidi ◽  
Ahmed Bendahmane ◽  
Jalel Benothmane
Keyword(s):  
Cloud Computing ◽  
Cyber Security ◽  
Data Security ◽  
Denial Of Service ◽  
Security Threats ◽  
Huge Number ◽  
Open Problems ◽  
Long Period ◽  
Near Future

Cloud computing cyber security is a subject that has been in top flight for a long period and even in near future. However, cloud computing permit to stock up a huge number of data in the cloud stockage, and allow the user to pay per utilization from anywhere via any terminal equipment. Among the major issues related to Cloud Computing security, we can mention data security, denial of service attacks, confidentiality, availability, and data integrity. This paper is dedicated to a taxonomic classification study of cloud computing cyber-security. With the main objective to identify the main challenges and issues in this field, the different approaches and solutions proposed to address them and the open problems that need to be addressed.

Dynamics of a stochastic susceptible-infective-recovered (SIRS) epidemic model with vaccination and nonlinear incidence under regime switching and Lévy jumps

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Junna Hu ◽  
Buyu Wen ◽  
Ting Zeng ◽  
Zhidong Teng
Keyword(s):  
Epidemic Model ◽  
Regime Switching ◽  
Markov Switching ◽  
Threshold Value ◽  
Open Problems ◽  
Nonlinear Incidence ◽  
Sirs Epidemic Model ◽  
Stochastic Epidemic ◽  
Lévy Jumps ◽  
White Noises

Abstract In this paper, a stochastic susceptible-infective-recovered (SIRS) epidemic model with vaccination, nonlinear incidence and white noises under regime switching and Lévy jumps is investigated. A new threshold value is determined. Some basic assumptions with regard to nonlinear incidence, white noises, Markov switching and Lévy jumps are introduced. The threshold conditions to guarantee the extinction and permanence in the mean of the disease with probability one and the existence of unique ergodic stationary distribution for the model are established. Some new techniques to deal with the Markov switching, Lévy jumps, nonlinear incidence and vaccination for the stochastic epidemic models are proposed. Lastly, the numerical simulations not only illustrate the main results given in this paper, but also suggest some interesting open problems.

scholarly journals Climate Change Sustainability: From Bargaining to Cooperative Balanced Approach

Games ◽  
2021 ◽  
Vol 12 (2) ◽  
pp. 45
Author(s):  
Tiziana Ciano ◽  
Massimiliano Ferrara ◽  
Mariangela Gangemi ◽  
Domenica Stefania Merenda ◽  
Bruno Antonio Pansera
Keyword(s):  
Climate Change ◽  
Cooperative Game Theory ◽  
Research Field ◽  
Future Research ◽  
Open Problems ◽  
Cooperative Approach ◽  
Change Dynamics ◽  
Bargaining Solutions ◽  
Balanced Approach ◽  
Competitive Bargaining

This work aims to provide different perspectives on the relationships between cooperative game theory and the research field concerning climate change dynamics. New results are obtained in the framework of competitive bargaining solutions and related issues, moving from a cooperative approach to a competitive one. Furthermore, the dynamics of balanced and super-balanced games are exposed, with particular reference to coalitions. Some open problems are presented to aid future research in this area.

Open Problems Column

2019 ◽  
Vol 50 (4) ◽  
pp. 26-30
Author(s):  
William Gasarch
Keyword(s):  
Open Problems

INTEGRABILITY, ENTROPY AND QUANTUM COMPUTATION

1999 ◽  
Vol 10 (07) ◽  
pp. 1205-1228 ◽  
Author(s):  
E. V. KRISHNAMURTHY
Keyword(s):  
Quantum Computation ◽  
Quantum Chaos ◽  
Quantum Control ◽  
Dynamical Evolution ◽  
Open Problems ◽  
Quantum Integrability ◽  
Feynman Path Integrals ◽  
Exact Integrability ◽  
Time Arrow ◽  
Computational Systems

The important requirements are stated for the success of quantum computation. These requirements involve coherent preserving Hamiltonians as well as exact integrability of the corresponding Feynman path integrals. Also we explain the role of metric entropy in dynamical evolutionary system and outline some of the open problems in the design of quantum computational systems. Finally, we observe that unless we understand quantum nondemolition measurements, quantum integrability, quantum chaos and the direction of time arrow, the quantum control and computational paradigms will remain elusive and the design of systems based on quantum dynamical evolution may not be feasible.

SIGACT News Online Algorithms Column 37

2021 ◽  
Vol 52 (2) ◽  
pp. 71-71
Author(s):  
Rob van Stee
Keyword(s):  
Lower Bound ◽  
Online Algorithms ◽  
Packet Scheduling ◽  
Open Problems ◽  
Competitive Algorithm ◽  
Long Time ◽  
News Online

For this issue, Pavel Vesely has contributed a wonderful overview of the ideas that were used in his SODA paper on packet scheduling with Marek Chrobak, Lukasz Jez and Jiri Sgall. This is a problem for which a 2-competitive algorithm as well as a lower bound of ϕ ≈ 1:618 was known already twenty years ago, but which resisted resolution for a long time. It is great that this problem has nally been resolved and that Pavel was willing to explain more of the ideas behind it for this column. He also provides an overview of open problems in this area.

Sign in / Sign up

Export Citation Format

Share Document