cometadata/datacite-rtg-text-other-reclassification-records huggingface dataset:
Conflict, Inclusivity, and Transformation of the Rice Value Chain in Myanmar
Creators: name: Goeb, Joseph
name: Minten, Bart
name: Aung, Nilar
name: Aung, Zin Wai
name: Zu, A Myint
name: Htar, May Thet
Publisher: name: Unknown
Year: 2024
Subjects: Agribusiness
Agricultural and Food Policy

description: In numerous low- and middle-income countries, agricultural value chains (AVC) are undergoing rapid transformation, yet scant evidence exists regarding such changes in fragile and conflict- affected settings, and little is known about inclusivity in this transformation. This study focuses on changes in Myanmar's rice value chain - using unique large-scale primary data - from 2013 to 2022, during an economic boom and subsequent political upheaval and conflict. We document remarkable shifts, including a fourfold increase in rice exports, propelling Myanmar to the world's fifth-largest rice exporter. Concurrently, domestic market conditions improved, and there was modernization in the ‘hidden middle’ of the value chain including increased investments in modern milling equipment and drying methods. At the farm level we note greater adoption of modern inputs (e.g., improved seed) and harvest/post-harvest technologies and increased reliance on modern specialized service providers. The transformation was not everywhere inclusive, and modernization in some areas decelerated due to conflict. Mills and farms in insecure and conflict-affected areas, as well as remote millers and smallholders, participated to a lesser extent, and the gaps widened during the crisis years. The rapid modernization in Myanmar’s rice value chain from 2013 to 2019 highlights the positive impacts of stable governance, infrastructure investment, and liberalization on AVC transformation while the observed variations in modernization inclusivity across different segments of the value chain underscore the complex interplay between governance, conflict, and AVC transformation.
COSTA: Covariance-Preserving Feature Augmentation for Graph Contrastive Learning
Creators: name: Zhang, Yifei
name: Zhu, Hao
name: Song, Zixing
name: Koniusz, Piotr
name: King, Irwin
Publisher: name: arXiv
Year: 2022
Subjects: subject: Machine Learning (cs.LG)
subject: Artificial Intelligence (cs.AI)
subject: FOS: Computer and information sciences

description: Graph contrastive learning (GCL) improves graph representation learning, leading to SOTA on various downstream tasks. The graph augmentation step is a vital but scarcely studied step of GCL. In this paper, we show that the node embedding obtained via the graph augmentations is highly biased, somewhat limiting contrastive models from learning discriminative features for downstream tasks. Thus, instead of investigating graph augmentation in the input space, we alternatively propose to perform augmentations on the hidden features (feature augmentation). Inspired by so-called matrix sketching, we propose COSTA, a novel COvariance-preServing feaTure space Augmentation framework for GCL, which generates augmented features by maintaining a "good sketch" of original features. To highlight the superiority of feature augmentation with COSTA, we investigate a single-view setting (in addition to multi-view one) which conserves memory and computations. We show that the feature augmentation with COSTA achieves comparable/better results than graph augmentation based models.
description: This paper is accepted by the ACM KDD 2022
Compressing (Multidimensional) Learned Bloom Filters
Creators: name: Davitkova, Angjela
name: Gjurovski, Damjan
name: Michel, Sebastian
Publisher: name: arXiv
Year: 2022
Subjects: subject: Databases (cs.DB)
subject: Machine Learning (cs.LG)
subject: FOS: Computer and information sciences

description: Bloom filters are widely used data structures that compactly represent sets of elements. Querying a Bloom filter reveals if an element is not included in the underlying set or is included with a certain error rate. This membership testing can be modeled as a binary classification problem and solved through deep learning models, leading to what is called learned Bloom filters. We have identified that the benefits of learned Bloom filters are apparent only when considering a vast amount of data, and even then, there is a possibility to further reduce their memory consumption. For that reason, we introduce a lossless input compression technique that improves the memory consumption of the learned model while preserving a comparable model accuracy. We evaluate our approach and show significant memory consumption improvements over learned Bloom filters.
description: 5 pages, 2 figures, 1 table, originally published in the Workshop on Databases and AI (DBAI) at NeurIPS 2021
Spectral maximum in the terahertz photoconductance of a quantum point contact
Creators: name: Kazantsev, D. M.
name: Alperovich, V. L.
name: Tkachenko, V. A.
name: Kvon, Z. D.
Publisher: name: arXiv
Year: 2022
Subjects: subject: Mesoscale and Nanoscale Physics (cond-mat.mes-hall)
subject: FOS: Physical sciences

description: The disappearance of the giant terahertz photoconductance of a quantum point contact under the increase in the photon energy, which was discovered experimentally (Otteneder et al., Phys. Rev. Applied 10 (2018) 014015) and studied by the numerical calculations of the photon-stimulated transport (O.A. Tkachenko et al., JETP Lett. 108 (2018) 396), is explained by the momentum conservation upon absorption of photons by tunneling electrons and on the base of perturbation theory calculations.
description: 6 pages, 6 figures. To be published in JETP Letters (2022). arXiv admin note: substantial text overlap with arXiv:2107.11143
Annex C Information Sheet 1.10 Waste Management
Creators: name: European Food Safety Authority Plant Health Panel
Publisher: name: Zenodo
Year: 2018
Subjects: subject: Pest control
subject: Pest management
subject: Quarantine
subject: Effectiveness
subject: http://id.agrisemantics.org/gacs/C587

description: Annex C Information sheet 1.10

Waste management

This information sheet is part of Annex C (Standardised checklist of risk reduction options) supporting document to the draft Guidance of the EFSA Plant Health Panel on quantitative pest risk assessment under public consultation (http://www.efsa.europa.eu/en/consultations/call/180212-0)

Treatment of the waste (deep burial, composting, incineration, chipping, production of bio-energy…) in authorized facilities and official restriction on the movement of waste.
description: contact email: ALPHA@efsa.europa.eu
Property Directed Reachability for Generalized Petri Nets
Creators: name: Amat, Nicolas
name: Zilio, Silvano Dal
name: Hujsa, Thomas
Publisher: name: arXiv
Year: 2022
Subjects: subject: Logic in Computer Science (cs.LO)
subject: FOS: Computer and information sciences

description: We propose a semi-decision procedure for checking generalized reachability properties, on generalized Petri nets, that is based on the Property Directed Reachability (PDR) method. We actually define three different versions, that vary depending on the method used for abstracting possible witnesses, and that are able to handle problems of increasing difficulty. We have implemented our methods in a model-checker called SMPT and give empirical evidences that our approach can handle problems that are difficult or impossible to check with current state of the art tools.
description: This is a long version of a paper published in the proceedings of TACAS 2022 under the same title
Multi-faceted Graph Attention Network for Radar Target Recognition in Heterogeneous Radar Network
Creators: name: Meng, Han
name: Peng, Yuexing
name: Xiang, Wei
name: Pang, Xu
name: Wang, Wenbo
Publisher: name: arXiv
Year: 2022
Subjects: subject: Signal Processing (eess.SP)
subject: FOS: Electrical engineering, electronic engineering, information engineering

description: Radar target recognition (RTR), as a key technology of intelligent radar systems, has been well investigated. Accurate RTR at low signal-to-noise ratios (SNRs) still remains an open challenge. Most existing methods are based on a single radar or the homogeneous radar network, which do not fully exploit frequency-dimensional information. In this paper, a two-stream semantic feature fusion model, termed Multi-faceted Graph Attention Network (MF-GAT), is proposed to greatly improve the accuracy in the low SNR region of the heterogeneous radar network. By fusing the features extracted from the source domain and transform domain via a graph attention network model, the MF-GAT model distills higher-level semantic features before classification in a unified framework. Extensive experiments are presented to demonstrate that the proposed model can greatly improve the RTR performance at low SNRs.
description: 6 pages, 4 figures
On the vacancy decay in endohedral atoms
Creators: name: Amusia, M. Ya.
name: Baltenkov, A. S.
Publisher: name: arXiv
Year: 2006
Subjects: subject: Atomic Physics (physics.atom-ph)
subject: Atomic and Molecular Clusters (physics.atm-clus)
subject: FOS: Physical sciences

description: It is demonstrated that the fullerene shell affects dramatically the radiative and Auger vacancy decay of an endohedral atom A@C60. The collectivized electrons of the C60 shell add new possibilities for radiative and non-radiative decays similar to that in ordinary atoms where initial and final state vacancies almost always belong to different subshells. It is shown that the smallness of the atomic shell radii as compared to that of the fullerenes shell provides an opportunity to derive the simple formulas for the probabilities of the electron transitions. It is shown that the radiative and Auger (or Koster-Kronig) widths of a vacancy decay due to electron transition in the atom A in A@C60 acquire an additional factors that can be expressed via the polarizability of the C60 at transition energy. It is demonstrated that due to opening of the non-radiative decay channel for vacancies in subvalent subshells the decay probability increases by five -- six orders of magnitude.
description: 14 pages, 4 figures
A Fixpoint Characterization of Three-Valued Disjunctive Hybrid MKNF Knowledge Bases
Creators: name: Killen, Spencer
name: You, Jia-Huai
Publisher: name: arXiv
Year: 2022
Subjects: subject: Artificial Intelligence (cs.AI)
subject: Logic in Computer Science (cs.LO)
subject: FOS: Computer and information sciences

description: The logic of hybrid MKNF (minimal knowledge and negation as failure) is a powerful knowledge representation language that elegantly pairs ASP (answer set programming) with ontologies. Disjunctive rules are a desirable extension to normal rule-based reasoning and typically semantic frameworks designed for normal knowledge bases need substantial restructuring to support disjunctive rules. Alternatively, one may lift characterizations of normal rules to support disjunctive rules by inducing a collection of normal knowledge bases, each with the same body and a single atom in its head. In this work, we refer to a set of such normal knowledge bases as a head-cut of a disjunctive knowledge base. The question arises as to whether the semantics of disjunctive hybrid MKNF knowledge bases can be characterized using fixpoint constructions with head-cuts. Earlier, we have shown that head-cuts can be paired with fixpoint operators to capture the two-valued MKNF models of disjunctive hybrid MKNF knowledge bases. Three-valued semantics extends two-valued semantics with the ability to express partial information. In this work, we present a fixpoint construction that leverages head-cuts using an operator that iteratively captures three-valued models of hybrid MKNF knowledge bases with disjunctive rules. This characterization also captures partial stable models of disjunctive logic programs since a program can be expressed as a disjunctive hybrid MKNF knowledge base with an empty ontology. We elaborate on a relationship between this characterization and approximators in AFT (approximation fixpoint theory) for normal hybrid MKNF knowledge bases.
description: In Proceedings ICLP 2022, arXiv:2208.02685
Jumping Evaluation of Nested Regular Path Queries
Creators: name: Niehren, Joachim
name: Salvati, Sylvain
name: Azimov, Rustam
Publisher: name: arXiv
Year: 2022
Subjects: subject: Computational Complexity (cs.CC)
subject: Databases (cs.DB)
subject: Data Structures and Algorithms (cs.DS)
subject: Logic in Computer Science (cs.LO)
subject: FOS: Computer and information sciences

description: Nested regular path queries are used for querying graph databases and RDF triple stores. We propose a new algorithm for evaluating nested regular path queries on a graph from a set of start nodes in combined linear time. We show that this complexity upper bound can be reduced by making it dependent on the size of the query's top-down needed subgraph, a notion that we introduce. For many queries in practice, the top-down needed subgraph is way smaller than the whole graph. Our algorithm is based on a novel compilation schema from nested regular path queries to monadic datalog queries. Its complexity upper bound follows from known properties of top-down datalog evaluation. As an application, we show that our algorithm permits to reformulate in simple terms a variant of a very efficient automata-based algorithm proposed by Maneth and Nguyen that evaluates navigational path queries in datatrees based on indexes and jumping. Moreover, it overcomes some limitations of Maneth and Nguyen's: it is not bound to trees and applies to graphs; it is not limited to forward navigational XPath but can treat any nested regular path query and it can be implemented efficiently without any dedicated techniques, by using any efficient datalog evaluator such as LogicBlox.
description: In Proceedings ICLP 2022, arXiv:2208.02685
Reviewer Acknowledgements-2017 For Journal Of Maize Research And Development
Creators: name: NMRP, Rampur
Publisher: name: Zenodo
Year: 2017

description: Reviewer  Acknowledgements

Editor-In-Chief, editors and the publisher would like to thank the following reviewers who generously contributed their time and efforts to review manuscripts for journal;

List of Reviewers for “Journal of Maize  Research and Development, Vol.3, No.1 (2017)

Published Online: 2017-12-31 | DOI: http://doi.org/10.5281/zenodo.1146078

Avinash Chandra Pandey

Kashinath Chiluwal

Gokul P. Paudel

Suraj Sapkota

Dinesh Panday

Mahendra Prasad Tripathi

Anoop Sindhu

Syed Baker

Krishna Prasad Timsina

Samaya Gairhe

Jiban Shrestha

Subash Subedi

Krishna H. Koirala

Papita Hiramanji Gourkhede

Senakpon Eric Haroll Kokoye

Saraswati Neupane

Vesna D. Jablanović

Shrawan K. Sah
Tree-Like Justification Systems are Consistent
Creators: name: Marynissen, Simon
name: Bogaerts, Bart
Publisher: name: arXiv
Year: 2022
Subjects: subject: Artificial Intelligence (cs.AI)
subject: Logic in Computer Science (cs.LO)
subject: FOS: Computer and information sciences

description: Justification theory is an abstract unifying formalism that captures semantics of various non-monotonic logics. One intriguing problem that has received significant attention is the consistency problem: under which conditions are justifications for a fact and justifications for its negation suitably related. Two variants of justification theory exist: one in which justifications are trees and one in which they are graphs. In this work we resolve the consistency problem once and for all for the tree-like setting by showing that all reasonable tree-like justification systems are consistent.
description: In Proceedings ICLP 2022, arXiv:2208.02685
A Preliminary Data-driven Analysis of Common Errors Encountered by Novice SPARC Programmers
Creators: name: Hansen, Zach
name: Du, Hanxiang
name: Xing, Wanli
name: Eckel, Rory
name: Lugo, Justin
name: Zhang, Yuanlin
Publisher: name: arXiv
Year: 2022
Subjects: subject: Computers and Society (cs.CY)
subject: Programming Languages (cs.PL)
subject: FOS: Computer and information sciences

description: Answer Set Programming (ASP), a modern development of Logic Programming, enables a natural integration of Computing with STEM subjects. This integration addresses a widely acknowledged challenge in K-12 education, and early empirical results on ASP-based integration are promising. Although ASP is considered a simple language when compared with imperative programming languages, programming errors can still be a significant barrier for students. This is particularly true for K-12 students who are novice users of ASP. Categorizing errors and measuring their difficulty has yielded insights into imperative languages like Java. However, little is known about the types and difficulty of errors encountered by K-12 students using ASP. To address this, we collected high school student programs submitted during a 4-session seminar teaching an ASP language known as SPARC. From error messages in this dataset, we identify a collection of error classes, and measure how frequently each class occurs and how difficult it is to resolve.
description: In Proceedings ICLP 2022, arXiv:2208.02685
On Model Reconciliation: How to Reconcile When Robot Does not Know Human's Model?
Creators: name: Dung, Ho Tuan
name: Son, Tran Cao
Publisher: name: arXiv
Year: 2022
Subjects: subject: Logic in Computer Science (cs.LO)
subject: Artificial Intelligence (cs.AI)
subject: Discrete Mathematics (cs.DM)
subject: Human-Computer Interaction (cs.HC)
subject: FOS: Computer and information sciences

description: The Model Reconciliation Problem (MRP) was introduced to address issues in explainable AI planning. A solution to a MRP is an explanation for the differences between the models of the human and the planning agent (robot). Most approaches to solving MRPs assume that the robot, who needs to provide explanations, knows the human model. This assumption is not always realistic in several situations (e.g., the human might decide to update her model and the robot is unaware of the updates). In this paper, we propose a dialog-based approach for computing explanations of MRPs under the assumptions that (i) the robot does not know the human model; (ii) the human and the robot share the set of predicates of the planning domain and their exchanges are about action descriptions and fluents' values; (iii) communication between the parties is perfect; and (iv) the parties are truthful. A solution of a MRP is computed through a dialog, defined as a sequence of rounds of exchanges, between the robot and the human. In each round, the robot sends a potential explanation, called proposal, to the human who replies with her evaluation of the proposal, called response. We develop algorithms for computing proposals by the robot and responses by the human and implement these algorithms in a system that combines imperative means with answer set programming using the multi-shot feature of clingo.
description: In Proceedings ICLP 2022, arXiv:2208.02685
An Iterative Fixpoint Semantics for MKNF Hybrid Knowledge Bases with Function Symbols
Creators: name: Alberti, Marco
name: Zese, Riccardo
name: Riguzzi, Fabrizio
name: Lamma, Evelina
Publisher: name: arXiv
Year: 2022
Subjects: subject: Logic in Computer Science (cs.LO)
subject: FOS: Computer and information sciences
subject: I.2.4

description: Hybrid Knowledge Bases based on Lifschitz's logic of Minimal Knowledge with Negation as Failure are a successful approach to combine the expressivity of Description Logics and Logic Programming in a single language. Their syntax, defined by Motik and Rosati, disallows function symbols. In order to define a well-founded semantics for MKNF HKBs, Knorr et al. define a partition of the modal atoms occurring in it, called the alternating fixpoint partition. In this paper, we propose an iterated fixpoint semantics for HKBs with function symbols. We prove that our semantics extends Knorr et al.'s, in that, for a function-free HKBs, it coincides with its alternating fixpoint partition. The proposed semantics lends itself well to a probabilistic extension with a distribution semantic approach, which is the subject of future work.
description: In Proceedings ICLP 2022, arXiv:2208.02685
A Gaze into the Internal Logic of Graph Neural Networks, with Logic
Creators: name: Tarau, Paul
Publisher: name: arXiv
Year: 2022
Subjects: subject: Logic in Computer Science (cs.LO)
subject: Artificial Intelligence (cs.AI)
subject: Programming Languages (cs.PL)
subject: FOS: Computer and information sciences

description: Graph Neural Networks share with Logic Programming several key relational inference mechanisms. The datasets on which they are trained and evaluated can be seen as database facts containing ground terms. This makes possible modeling their inference mechanisms with equivalent logic programs, to better understand not just how they propagate information between the entities involved in the machine learning process but also to infer limits on what can be learned from a given dataset and how well that might generalize to unseen test data. This leads us to the key idea of this paper: modeling with the help of a logic program the information flows involved in learning to infer from the link structure of a graph and the information content of its nodes properties of new nodes, given their known connections to nodes with possibly similar properties. The problem is known as graph node property prediction and our approach will consist in emulating with help of a Prolog program the key information propagation steps of a Graph Neural Network's training and inference stages. We test our a approach on the ogbn-arxiv node property inference benchmark. To infer class labels for nodes representing papers in a citation network, we distill the dependency trees of the text associated to each node into directed acyclic graphs that we encode as ground Prolog terms. Together with the set of their references to other papers, they become facts in a database on which we reason with help of a Prolog program that mimics the information propagation in graph neural networks predicting node properties. In the process, we invent ground term similarity relations that help infer labels in the test set by propagating node properties from similar nodes in the training set and we evaluate their effectiveness in comparison with that of the graph's link structure. Finally, we implement explanation generators that unveil performance upper bounds inherent to the dataset. As a practical outcome, we obtain a logic program, that, when seen as machine learning algorithm, performs close to the state of the art on the node property prediction benchmark.
description: In Proceedings ICLP 2022, arXiv:2208.02685
Knowledge Authoring with Factual English
Creators: name: Wang, Yuheng
name: Borca-Tasciuc, Giorgian
name: Goel, Nikhil
name: Fodor, Paul
name: Kifer, Michael
Publisher: name: arXiv
Year: 2022
Subjects: subject: Logic in Computer Science (cs.LO)
subject: Computation and Language (cs.CL)
subject: FOS: Computer and information sciences

description: Knowledge representation and reasoning (KRR) systems represent knowledge as collections of facts and rules. Like databases, KRR systems contain information about domains of human activities like industrial enterprises, science, and business. KRRs can represent complex concepts and relations, and they can query and manipulate information in sophisticated ways. Unfortunately, the KRR technology has been hindered by the fact that specifying the requisite knowledge requires skills that most domain experts do not have, and professional knowledge engineers are hard to find. One solution could be to extract knowledge from English text, and a number of works have attempted to do so (OpenSesame, Google's Sling, etc.). Unfortunately, at present, extraction of logical facts from unrestricted natural language is still too inaccurate to be used for reasoning, while restricting the grammar of the language (so-called controlled natural language, or CNL) is hard for the users to learn and use. Nevertheless, some recent CNL-based approaches, such as the Knowledge Authoring Logic Machine (KALM), have shown to have very high accuracy compared to others, and a natural question is to what extent the CNL restrictions can be lifted. In this paper, we address this issue by transplanting the KALM framework to a neural natural language parser, mStanza. Here we limit our attention to authoring facts and queries and therefore our focus is what we call factual English statements. Authoring other types of knowledge, such as rules, will be considered in our followup work. As it turns out, neural network based parsers have problems of their own and the mistakes they make range from part-of-speech tagging to lemmatization to dependency errors. We present a number of techniques for combating these problems and test the new system, KALMFL (i.e., KALM for factual language), on a number of benchmarks, which show KALMFL achieves correctness in excess of 95%.
description: In Proceedings ICLP 2022, arXiv:2208.02685
A Model-Oriented Approach for Lifting Symmetries in Answer Set Programming
Creators: name: Tarzariol, Alice
Publisher: name: arXiv
Year: 2022
Subjects: subject: Logic in Computer Science (cs.LO)
subject: Machine Learning (cs.LG)
subject: FOS: Computer and information sciences

description: When solving combinatorial problems, pruning symmetric solution candidates from the search space is essential. Most of the existing approaches are instance-specific and focus on the automatic computation of Symmetry Breaking Constraints (SBCs) for each given problem instance. However, the application of such approaches to large-scale instances or advanced problem encodings might be problematic since the computed SBCs are propositional and, therefore, can neither be meaningfully interpreted nor transferred to other instances. As a result, a time-consuming recomputation of SBCs must be done before every invocation of a solver. To overcome these limitations, we introduce a new model-oriented approach for Answer Set Programming that lifts the SBCs of small problem instances into a set of interpretable first-order constraints using a form of machine learning called Inductive Logic Programming. After targeting simple combinatorial problems, we aim to extend our method to be applied also for advanced decision and optimization problems.
description: In Proceedings ICLP 2022, arXiv:2208.02685. arXiv admin note: text overlap with arXiv:2112.11806
Tools and Methodologies for Verifying Answer Set Programs
Creators: name: Hansen, Zach
Publisher: name: arXiv
Year: 2022
Subjects: subject: Logic in Computer Science (cs.LO)
subject: Artificial Intelligence (cs.AI)
subject: Programming Languages (cs.PL)
subject: FOS: Computer and information sciences

description: Answer Set Programming (ASP) is a powerful declarative programming paradigm commonly used for solving challenging search and optimization problems. The modeling languages of ASP are supported by sophisticated solving algorithms (solvers) that make the solution search efficient while enabling the programmer to model the problem at a high level of abstraction. As an approach to Knowledge Representation and Reasoning, ASP benefits from its simplicity, conciseness and rigorously defined semantics. These characteristics make ASP a straightforward way to develop formally verifiable programs. In the context of artificial intelligence (AI), the clarity of ASP programs lends itself to the construction of explainable, trustworthy AI. In support of these goals, my research is concerned with extending the theory and tools supporting the verification of ASP progams.
description: In Proceedings ICLP 2022, arXiv:2208.02685
An ASP Framework for Efficient Urban Traffic Optimization
Creators: name: Cardellini, Matteo
Publisher: name: arXiv
Year: 2022
Subjects: subject: Artificial Intelligence (cs.AI)
subject: FOS: Computer and information sciences
subject: I.2.8

description: Avoiding congestion and controlling traffic in urban scenarios is becoming nowadays of paramount importance due to the rapid growth of our cities' population and vehicles. The effective control of urban traffic as a means to mitigate congestion can be beneficial in an economic, environmental and health way. In this paper, a framework which allows to efficiently simulate and optimize traffic flow in a large roads' network with hundreds of vehicles is presented. The framework leverages on an Answer Set Programming (ASP) encoding to formally describe the movements of vehicles inside a network. Taking advantage of the ability to specify optimization constraints in ASP and the off-the-shelf solver Clingo, it is then possible to optimize the routes of vehicles inside the network to reduce a range of relevant metrics (e.g., travel times or emissions). Finally, an analysis on real-world traffic data is performed, utilizing the state-of-the-art Urban Mobility Simulator (SUMO) to keep track of the state of the network, test the correctness of the solution and to prove the efficiency and capabilities of the presented solution.
description: In Proceedings ICLP 2022, arXiv:2208.02685
ИСТОРИЧЕСКОЕ РАЗВИТИЕ КОНЦЕПТУАЛЬНЫХ ОСНОВ ВЫСШЕЙ ШКОЛЫ.
Creators: name: Филиппов, Ольгерд
Publisher: name: Zenodo
Year: 2024

description: Понимание и концепции высшего образования претерпели значительные изменения на протяжении истории. От платоновских идей до современного акцента на критическом мышлении и технологиях, эволюция моделей высшей школы отражает широкие общественные и культурные изменения, все больше внимания уделяется таким принципиальным аспектам, как критическое мышление, междисциплинарность, непрерывное обучение, использование цифровых технологий и искусственного интеллекта.
Planning and Scheduling in Digital Health with Answer Set Programming
Creators: name: Mochi, Marco
Publisher: name: arXiv
Year: 2022
Subjects: subject: Artificial Intelligence (cs.AI)
subject: Logic in Computer Science (cs.LO)
subject: FOS: Computer and information sciences

description: In the hospital world there are several complex combinatory problems, and solving these problems is important to increase the degree of patients' satisfaction and the quality of care offered. The problems in the healthcare are complex since to solve them several constraints and different type of resources should be taken into account. Moreover, the solutions must be evaluated in a small amount of time to ensure the usability in real scenarios. We plan to propose solutions to these kind of problems both expanding already tested solutions and by modelling solutions for new problems, taking into account the literature and by using real data when available. Solving these kind of problems is important but, since the European Commission established with the General Data Protection Regulation that each person has the right to ask for explanation of the decision taken by an AI, without developing Explainability methodologies the usage of AI based solvers e.g. those based on Answer Set programming will be limited. Thus, another part of the research will be devoted to study and propose new methodologies for explaining the solutions obtained.
description: In Proceedings ICLP 2022, arXiv:2208.02685
title: Das Gefühl der Verantwortlichkeit
Creators: name: Otto, Rudolf
Publisher: name: Philipps-Universität Marburg
Year: 1931
Subjects: Christian theology
Theologie, Christentum

description: Layoutgetreues Digitalisat der Ausg.: Wien : Verl. d. Internat. Religionspsychol., 1931  Standort: Universität Marburg, Zentralbibliothek (000)  Signatur: XIV C 698 trk   Bemerkungen: In: Zeitschrift für Religionspsychologie 4 (1931), S. 49-57, 109-136
Decomposition Strategies for Solving Scheduling Problems in Industrial Applications
Creators: name: El-Kholany, Mohammed M. S.
Publisher: name: arXiv
Year: 2022
Subjects: subject: Logic in Computer Science (cs.LO)
subject: FOS: Computer and information sciences

description: This article presents an overview of a research study of a crucial optimization problem in the Computer Science/Operations research field: The Job-shop Scheduling Problem (JSP). The JSP is a challenging task in which a set of operations must be processed using a set of scarce machines to optimize a particular objective. The main purpose of the JSP is to determine the execution order of the processes assigned to each machine to optimize an objective. Our main interest in this study is to investigate developing decomposition strategies using logic programming to solve the JSP. We split our goal into two main phases. The first phase is to apply the decomposition approach and evaluate the proposed model by solving a set of known benchmark instances. The second phase is to apply the successful decomposition methods obtained from the first phase to solve a scheduling problem in the real-life application. In the current state, we finished the first phase and started the second one aiming to have a model that can provide a schedule of a factory for a short-time period.
description: In Proceedings ICLP 2022, arXiv:2208.02685
Andrena (Chrysandrena) merula Warncke 1969
Creators: name: Boustani, Mira
name: Rasmont, Pierre
name: Dathe, Holger H.
name: Ghisbain, Guillaume
name: Kasparek, Max
name: Michez, Denis
name: Müller, Andreas
name: Pauly, Alain
name: Risch, Stefan
name: Straka, Jakub
name: Terzo, Michael
name: Achter, Xavier Van
name: Wood, Thomas J.
name: Nemer, Nabil
Publisher: name: Zenodo
Year: 2021
Subjects: Biodiversity
Taxonomy
Animalia
Arthropoda
Insecta
Hymenoptera
Andrenidae
Andrena
Andrena merula

description: Andrena (Chrysandrena) merula Warncke, 1969
Distribution: EAST MEDITERRANEAN
Material examined. Mount Lebanon: Barja, 1♂; N. Lebanon: Tannourine El Tahta, 1♂, between 7.III.2017 and 25.IV.2019.
description: Published as part of Boustani, Mira, Rasmont, Pierre, Dathe, Holger H., Ghisbain, Guillaume, Kasparek, Max, Michez, Denis, Müller, Andreas, Pauly, Alain, Risch, Stefan, Straka, Jakub, Terzo, Michael, Achter, Xavier Van, Wood, Thomas J. & Nemer, Nabil, 2021, The bees of Lebanon (Hymenoptera: Apoidea: Anthophila), pp. 1-146 in Zootaxa 4976 (1) on page 22, DOI: 10.11646/zootaxa.4976.1.1, http://zenodo.org/record/4819018
Annex C Information Sheet 2.07 Delimitation Of Buffer Zones
Creators: name: European Food Safety Authority Plant Health Panel
Publisher: name: Zenodo
Year: 2018
Subjects: subject: Pest control
subject: Pest management
subject: Quarantine
subject: Effectiveness
subject: http://id.agrisemantics.org/gacs/C587

description: Annex C Information sheet 2.07

Delimitation of buffer zones

This information sheet is part of Annex C (Standardised checklist of risk reduction options) supporting document to the draft Guidance of the EFSA Plant Health Panel on quantitative pest risk assessment under public consultation (http://www.efsa.europa.eu/en/consultations/call/180212-0)

ISPM 5 defines a buffer zone as “an area surrounding or adjacent to an area officially delimited for phytosanitary purposes in order to minimize the probability of spread of the target pest into or out of the delimited area, and subject to phytosanitary or other control measures, if appropriate” (ISPM 5). The objectives for delimiting a buffer zone can be to prevent spread from the outbreak area and to maintain a pest free production place (PFPP), site (PFPS) or area (PFA).
description: contact email: ALPHA@efsa.europa.eu
Andrena (Micrandrena) minutula
Creators: name: Boustani, Mira
name: Rasmont, Pierre
name: Dathe, Holger H.
name: Ghisbain, Guillaume
name: Kasparek, Max
name: Michez, Denis
name: Müller, Andreas
name: Pauly, Alain
name: Risch, Stefan
name: Straka, Jakub
name: Terzo, Michael
name: Achter, Xavier Van
name: Wood, Thomas J.
name: Nemer, Nabil
Publisher: name: Zenodo
Year: 2021
Subjects: Biodiversity
Taxonomy
Animalia
Arthropoda
Insecta
Hymenoptera
Andrenidae
Andrena
Andrena minutula

description: Andrena (Micrandrena) minutula (Kirby, 1802)
Distribution: WEST PALAEARCTIC.
Material examined. N. Lebanon: Hadath El Jebbe, 1♀, 12.IV.2019.
description: Published as part of Boustani, Mira, Rasmont, Pierre, Dathe, Holger H., Ghisbain, Guillaume, Kasparek, Max, Michez, Denis, Müller, Andreas, Pauly, Alain, Risch, Stefan, Straka, Jakub, Terzo, Michael, Achter, Xavier Van, Wood, Thomas J. & Nemer, Nabil, 2021, The bees of Lebanon (Hymenoptera: Apoidea: Anthophila), pp. 1-146 in Zootaxa 4976 (1) on page 22, DOI: 10.11646/zootaxa.4976.1.1, http://zenodo.org/record/4819018
Explanation of Machine Learning Models of Colon Cancer Using SHAP Considering Interaction Effects
Creators: name: Nohara, Yasunobu
name: Inoguchi, Toyoshi
name: Nojiri, Chinatsu
name: Nakashima, Naoki
Publisher: name: arXiv
Year: 2022
Subjects: subject: Machine Learning (cs.LG)
subject: FOS: Computer and information sciences

description: When using machine learning techniques in decision-making processes, the interpretability of the models is important. Shapley additive explanation (SHAP) is one of the most promising interpretation methods for machine learning models. Interaction effects occur when the effect of one variable depends on the value of another variable. Even if each variable has little effect on the outcome, its combination can have an unexpectedly large impact on the outcome. Understanding interactions is important for understanding machine learning models; however, naive SHAP analysis cannot distinguish between the main effect and interaction effects. In this paper, we introduce the Shapley-Taylor index as an interpretation method for machine learning models using SHAP considering interaction effects. We apply the method to the cancer cohort data of Kyushu University Hospital (N=29,080) to analyze what combination of factors contributes to the risk of colon cancer.
Haemosiderotic Fibrohistiocytic Lipomatous Lesion â A Case Report
Creators: name: Lam, Luthan
Publisher: name: EURORAD
Year: 2018
Subjects: subject: Musculoskeletal soft tissue
subject: Digital radiography
subject: MR
subject: Ultrasound
subject: Diagnostic procedure
subject: Neoplasia

description: Clinical History Image Findings Discussion Find Diagnosis Differential Diagnosis
description: female, 72 years
description: Clinical History: Painful mass over dorsum of right ankle, first noted 4 years ago.  The patient sustained trauma 2 years later and states that the mass had been slowly enlarging. Final Diagnosis: Haemosiderotic fibrohistiocytic lipomatous lesion
A Lightweight Machine Learning Pipeline for LiDAR-simulation
Creators: name: Marcus, Richard
name: Knoop, Niklas
name: Egger, Bernhard
name: Stamminger, Marc
Publisher: name: arXiv
Year: 2022
Subjects: subject: Computer Vision and Pattern Recognition (cs.CV)
subject: Image and Video Processing (eess.IV)
subject: FOS: Computer and information sciences
subject: FOS: Electrical engineering, electronic engineering, information engineering

description: Virtual testing is a crucial task to ensure safety in autonomous driving, and sensor simulation is an important task in this domain. Most current LiDAR simulations are very simplistic and are mainly used to perform initial tests, while the majority of insights are gathered on the road. In this paper, we propose a lightweight approach for more realistic LiDAR simulation that learns a real sensor's behavior from test drive data and transforms this to the virtual domain. The central idea is to cast the simulation into an image-to-image translation problem. We train our pix2pix based architecture on two real world data sets, namely the popular KITTI data set and the Audi Autonomous Driving Dataset which provide both, RGB and LiDAR images. We apply this network on synthetic renderings and show that it generalizes sufficiently from real images to simulated images. This strategy enables to skip the sensor-specific, expensive and complex LiDAR physics simulation in our synthetic world and avoids oversimplification and a large domain-gap through the clean synthetic environment.
description: Conference: DeLTA 22; ISBN 978-989-758-584-5; ISSN 2184-9277; publisher: SciTePress, organization: INSTICC
Andrena (Micrandrena) minutuloides Perkins 1914
Creators: name: Boustani, Mira
name: Rasmont, Pierre
name: Dathe, Holger H.
name: Ghisbain, Guillaume
name: Kasparek, Max
name: Michez, Denis
name: Müller, Andreas
name: Pauly, Alain
name: Risch, Stefan
name: Straka, Jakub
name: Terzo, Michael
name: Achter, Xavier Van
name: Wood, Thomas J.
name: Nemer, Nabil
Publisher: name: Zenodo
Year: 2021
Subjects: Biodiversity
Taxonomy
Animalia
Arthropoda
Insecta
Hymenoptera
Andrenidae
Andrena
Andrena minutuloides

description: Andrena (Micrandrena) minutuloides Perkins, 1914
Distribution: WEST PALAEARCTIC.
Material examined. N. Lebanon: Ehden, 1♀, 22.V.2019.
description: Published as part of Boustani, Mira, Rasmont, Pierre, Dathe, Holger H., Ghisbain, Guillaume, Kasparek, Max, Michez, Denis, Müller, Andreas, Pauly, Alain, Risch, Stefan, Straka, Jakub, Terzo, Michael, Achter, Xavier Van, Wood, Thomas J. & Nemer, Nabil, 2021, The bees of Lebanon (Hymenoptera: Apoidea: Anthophila), pp. 1-146 in Zootaxa 4976 (1) on page 22, DOI: 10.11646/zootaxa.4976.1.1, http://zenodo.org/record/4819018
title: Das Schuldgefühl und seine Implikationen
Creators: name: Otto, Rudolf
Publisher: name: Philipps-Universität Marburg
Year: 1931
Subjects: Christian theology
Theologie, Christentum
Religionspsychologie

description: Layoutgetreues Digitalisat der Ausg.: Wien : Verl. d. Internat. Religionspsychol., 1931  Standort: Universität Marburg, Zentralbibliothek (000)  Signatur: XIV C 698 trk   Bemerkungen: In: Zeitschrift für Religionspsychologie 4 (1931), 1, S. 1-19
title: [Autonomie der Werte und Theonomie]
Creators: name: Otto, Rudolf
Publisher: name: Philipps-Universität Marburg
Year: 1940
Subjects: Religion
Religion, Religionsphilosophie
Wertethik
Ethik

description: Layoutgetreues Digitalisat der Ausg.: Tübingen : Mohr, 1940  Standort: Universität Marburg, Zentralbibliothek (000)  Signatur: XIXa C 52 yub, 187   Bemerkungen: Titel fingiert. In: Otto, Rudolf: Freiheit und Notwendigkeit. Tübingen, 1940. S. 3 - 18
Fig S2: Structural characteristics of mitochondria in contact with sarcoplasmic reticulum during postnatal heart development. from Three-dimensional remodelling of the cellular energy distribution system during postnatal heart development
Creators: name: Kim, Yuho
name: Ajayi, Peter T.
name: Bleck, Christopher K. E.
name: Glancy, Brian
Publisher: name: The Royal Society
Year: 2022
Subjects: Cell Biology

description: Fig S2: Structural characteristics of mitochondria in contact with sarcoplasmic reticulum during postnatal heart development. All mitochondrial data are further grouped depending on whether mitochondria are in contact with sarcoplasmic reticulum/t-tubules (SRT) highly (≥5% contact; High SRT contact) or less (<5% contact; Low SRT contact). A) Individual mitochondrial volume (μm3). B) Mitochondrial surface area to volume ratio (μm-1). C) Mitochondrial sphericity. D) Individual mitochondrial length (μm), E) Average of Intermitochondrial junction (IMJ) area (μm). F) Average of IMJ area (% of mitochondrial surface area). N values: P1 – 549 High SRT contact, 54 Low SRT contact, 3 datasets; P7 – 261 High SRT contact, 219 Low SRT contact, 3 datasets; P14 – 460 High SRT contact, 366 Low SRT contact, 3 datasets; P42 – 941 High SRT contact, 159 Low SRT contact. Mean values of each dataset are depicted as square (High SRT contact; colored in blue) and triangle (Low SRT contact; colored in orange). High and Low SRT from same dataset are connected with line. Each red bar indicates Mean of all 3 datasets. ns, non-significant; **P<0.01.
Fig S1: Structural characteristics of mitochondria connected with LD across heart maturation from Three-dimensional remodelling of the cellular energy distribution system during postnatal heart development
Creators: name: Kim, Yuho
name: Ajayi, Peter T.
name: Bleck, Christopher K. E.
name: Glancy, Brian
Publisher: name: The Royal Society
Year: 2022
Subjects: Cell Biology

description: Fig S1: Structural characteristics of mitochondria connected with LD across heart maturation. All mitochondrial data are further grouped depending on whether mitochondria are connected with LD (LD connected) or not connected with LD (No LD). A) Individual mitochondrial volume (μm3). B) Mitochondrial surface area to volume ratio (μm-1). C) Mitochondrial sphericity. D) Average of Intermitochondrial junction (IMJ) area (μm). N values: P1 – 116 LD, 487 No LD, 3 datasets; P7 – 124 LD, 356 No LD, 3 datasets; P14 – 222 LD, 595 No LD, 3 datasets; P42 – 422 LD, 678 No LD, 3 datasets. Mean values of each dataset are depicted as square (LD; colored in green) and upside-down triangle (No LD; colored in orange). LD and No LD from same dataset are connected with line. Each red bar indicates Mean of all 3 datasets. **P<0.01; ****P<0.0001.
Andrena (Cryptandrena) monacha Warncke 1965
Creators: name: Boustani, Mira
name: Rasmont, Pierre
name: Dathe, Holger H.
name: Ghisbain, Guillaume
name: Kasparek, Max
name: Michez, Denis
name: Müller, Andreas
name: Pauly, Alain
name: Risch, Stefan
name: Straka, Jakub
name: Terzo, Michael
name: Achter, Xavier Van
name: Wood, Thomas J.
name: Nemer, Nabil
Publisher: name: Zenodo
Year: 2021
Subjects: Biodiversity
Taxonomy
Animalia
Arthropoda
Insecta
Hymenoptera
Andrenidae
Andrena
Andrena monacha

description: Andrena (Cryptandrena) monacha Warncke, 1965
Distribution: EAST MEDITERRANEAN.
Material examined. Mount Lebanon: Khaldah [Khalde], 1♂, 18.IV.1973.
description: Published as part of Boustani, Mira, Rasmont, Pierre, Dathe, Holger H., Ghisbain, Guillaume, Kasparek, Max, Michez, Denis, Müller, Andreas, Pauly, Alain, Risch, Stefan, Straka, Jakub, Terzo, Michael, Achter, Xavier Van, Wood, Thomas J. & Nemer, Nabil, 2021, The bees of Lebanon (Hymenoptera: Apoidea: Anthophila), pp. 1-146 in Zootaxa 4976 (1) on page 23, DOI: 10.11646/zootaxa.4976.1.1, http://zenodo.org/record/4819018
title: Ein Buch zusamen gezogen auß Von den probirten kunsten ... : Abschrift von Franz Helms "Buch von den probierten Künsten"
Creators: name: Helm, Franz
Publisher: name: Philipps-Universität Marburg
Year: 1536
Subjects: Manuscripts and rare books
Handschriften, seltene B

description: Layoutgetreues Digitalisat der Ausg.: [s.l.], 1536  Standort: Universität Marburg, Zentralbibliothek (000)  Signatur: Ms. 77  Bemerkungen: Handschrift mit mehrfarb. Ill.
Pew Research Center: The Tablet Revolution Survey 2 Wave 6
Creators: name: Pew Research Center
name: Group, The Economist
Publisher: name: Roper Center for Public Opinion Research
Year: 2020

description: Tablet computer ownership (5); tablet use (12); follow the news (6); news on tablet (23); magazine issues on tablets (3); easier to learn on tablet (1); enjoyment of news on tablet (1); worth of news on tablet (1); print subscription to newspaper or magazine (1); commute (3).
Andrena (Melandrena) morio Brulle 1832
Creators: name: Boustani, Mira
name: Rasmont, Pierre
name: Dathe, Holger H.
name: Ghisbain, Guillaume
name: Kasparek, Max
name: Michez, Denis
name: Müller, Andreas
name: Pauly, Alain
name: Risch, Stefan
name: Straka, Jakub
name: Terzo, Michael
name: Achter, Xavier Van
name: Wood, Thomas J.
name: Nemer, Nabil
Publisher: name: Zenodo
Year: 2021
Subjects: Biodiversity
Taxonomy
Animalia
Arthropoda
Insecta
Hymenoptera
Andrenidae
Andrena
Andrena morio

description: Andrena (Melandrena) morio Brullé, 1832
Distribution: PALAEARCTIC.
Literature. Mavromoustakis (1963): N. Lebanon, Near Becharré [Bcharre], 19.VI.1960, 1♀; Focke, 20.VI.1960, 2♀; N. Lebanon, Kadisha river, 20.VI.1960, 1♀.
description: Published as part of Boustani, Mira, Rasmont, Pierre, Dathe, Holger H., Ghisbain, Guillaume, Kasparek, Max, Michez, Denis, Müller, Andreas, Pauly, Alain, Risch, Stefan, Straka, Jakub, Terzo, Michael, Achter, Xavier Van, Wood, Thomas J. & Nemer, Nabil, 2021, The bees of Lebanon (Hymenoptera: Apoidea: Anthophila), pp. 1-146 in Zootaxa 4976 (1) on page 23, DOI: 10.11646/zootaxa.4976.1.1, http://zenodo.org/record/4819018