A Minimal Substructural Logic in Temporal Database

2014 ◽  
Vol 36 (8) ◽  
pp. 1592-1601 ◽  
Author(s):  
Dong-Ning LIU ◽  
Yong TANG ◽  
Shao-Hua TENG ◽  
Zhe LIN
1994 ◽  
Vol 23 (2) ◽  
pp. 511 ◽  
Author(s):  
Babis Theodoulidis ◽  
Aziz Ait-Braham ◽  
George Andrianopoulos ◽  
Jayant Chaudhary ◽  
George Karvelis ◽  
...  

GigaScience ◽  
2017 ◽  
Vol 6 (12) ◽  
Author(s):  
Patricia A Soranno ◽  
Linda C Bacon ◽  
Michael Beauchene ◽  
Karen E Bednar ◽  
Edward G Bissell ◽  
...  

2017 ◽  
Vol 21 (4) ◽  
pp. 667-668
Author(s):  
Christophe Claramunt ◽  
Markus Schneider ◽  
Raymond Chi-Wing Wong

Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1478
Author(s):  
Penugonda Ravikumar ◽  
Palla Likhitha ◽  
Bathala Venus Vikranth Raj ◽  
Rage Uday Kiran ◽  
Yutaka Watanobe ◽  
...  

Discovering periodic-frequent patterns in temporal databases is a challenging problem of great importance in many real-world applications. Though several algorithms were described in the literature to tackle the problem of periodic-frequent pattern mining, most of these algorithms use the traditional horizontal (or row) database layout, that is, either they need to scan the database several times or do not allow asynchronous computation of periodic-frequent patterns. As a result, this kind of database layout makes the algorithms for discovering periodic-frequent patterns both time and memory inefficient. One cannot ignore the importance of mining the data stored in a vertical (or columnar) database layout. It is because real-world big data is widely stored in columnar database layout. With this motivation, this paper proposes an efficient algorithm, Periodic Frequent-Equivalence CLass Transformation (PF-ECLAT), to find periodic-frequent patterns in a columnar temporal database. Experimental results on sparse and dense real-world and synthetic databases demonstrate that PF-ECLAT is memory and runtime efficient and highly scalable. Finally, we demonstrate the usefulness of PF-ECLAT with two case studies. In the first case study, we have employed our algorithm to identify the geographical areas in which people were periodically exposed to harmful levels of air pollution in Japan. In the second case study, we have utilized our algorithm to discover the set of road segments in which congestion was regularly observed in a transportation network.


2021 ◽  
Author(s):  
Amanda MY Chu ◽  
Jacky NL Chan ◽  
Jenny TY Tsang ◽  
Agnes Tiwari ◽  
Mike KP So

UNSTRUCTURED Communicable diseases including COVID-19 pose a major threat to public health worldwide. To curb the spread of communicable diseases effectively, timely surveillance and prediction of the risk of pandemics are essential. The aim of this study is to analyze free and publicly available data to construct useful travel data records for network statistics other than common descriptive statistics. This study describes analytical findings of time-series plots and spatial-temporal maps to illustrate or visualize pandemic connectedness. We analyzed data retrieved from the web-based Collaborative Arrangement for the Prevention and Management of Public Health Events in Civil Aviation dashboard, which contains up-to-date and comprehensive meta-information on civil flights from 193 national governments in accordance with the airport, country, city, latitude, and the longitude of flight origin and the destination. We used the database to visualize pandemic connectedness through the workflow of travel data collection, network construction, data aggregation, travel statistics calculation, and visualization with time-series plots and spatial-temporal maps. We observed similar patterns in the time-series plots of worldwide daily flights from January to early-March of 2019 and 2020. A sharp reduction in the number of daily flights recorded in mid-March 2020 was likely related to large-scale air travel restrictions owing to the COVID-19 pandemic. The levels of connectedness between places are strong indicators of the risk of a pandemic. Since the initial reports of COVID-19 cases worldwide, a high network density and reciprocity in early-March 2020 served as early signals of the COVID-19 pandemic and were associated with the rapid increase in COVID-19 cases in mid-March 2020. The spatial-temporal map of connectedness in Europe on March 13, 2020, shows the highest level of connectedness among European countries, which reflected severe outbreaks of COVID-19 in late March and early April of 2020. As a quality control measure, we used the aggregated numbers of international flights from April to October 2020 to compare the number of international flights officially reported by the International Civil Aviation Organization with the data collected from the Collaborative Arrangement for the Prevention and Management of Public Health Events in Civil Aviation dashboard, and we observed high consistency between the 2 data sets. The flexible design of the database provides users access to network connectedness at different periods, places, and spatial levels through various network statistics calculation methods in accordance with their needs. The analysis can facilitate early recognition of the risk of a current communicable disease pandemic and newly emerging communicable diseases in the future.


10.29007/hgbj ◽  
2018 ◽  
Author(s):  
Nick Bezhanishvili

The method of canonical formulas is a powerful tool for investigating intuitionistic and modal logics. In this talk I will discuss an algebraic approach to this method. I will mostly concentrate on the case of intuitionistic logic. But I will also review the case of modal logic and possible generalizations to substructural logic.


2014 ◽  
Vol 7 (3) ◽  
pp. 455-483 ◽  
Author(s):  
MAJID ALIZADEH ◽  
FARZANEH DERAKHSHAN ◽  
HIROAKIRA ONO

AbstractUniform interpolation property of a given logic is a stronger form of Craig’s interpolation property where both pre-interpolant and post-interpolant always exist uniformly for any provable implication in the logic. It is known that there exist logics, e.g., modal propositional logic S4, which have Craig’s interpolation property but do not have uniform interpolation property. The situation is even worse for predicate logics, as classical predicate logic does not have uniform interpolation property as pointed out by L. Henkin.In this paper, uniform interpolation property of basic substructural logics is studied by applying the proof-theoretic method introduced by A. Pitts (Pitts, 1992). It is shown that uniform interpolation property holds even for their predicate extensions, as long as they can be formalized by sequent calculi without contraction rules. For instance, uniform interpolation property of full Lambek predicate calculus, i.e., the substructural logic without any structural rule, and of both linear and affine predicate logics without exponentials are proved.


Sign in / Sign up

Export Citation Format

Share Document