401 research outputs found
LIPIcs, Volume 251, ITCS 2023, Complete Volume
LIPIcs, Volume 251, ITCS 2023, Complete Volum
Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters
We investigate the parameterized complexity of Binary CSP parameterized by the vertex cover number and the treedepth of the constraint graph, as well as by a selection of related modulator-based parameters. The main findings are as follows:
- Binary CSP parameterized by the vertex cover number is W[3]-complete. More generally, for every positive integer d, Binary CSP parameterized by the size of a modulator to a treedepth-d graph is W[2d+1]-complete. This provides a new family of natural problems that are complete for odd levels of the W-hierarchy.
- We introduce a new complexity class XSLP, defined so that Binary CSP parameterized by treedepth is complete for this class. We provide two equivalent characterizations of XSLP: the first one relates XSLP to a model of an alternating Turing machine with certain restrictions on conondeterminism and space complexity, while the second one links XSLP to the problem of model-checking first-order logic with suitably restricted universal quantification. Interestingly, the proof of the machine characterization of XSLP uses the concept of universal trees, which are prominently featured in the recent work on parity games.
- We describe a new complexity hierarchy sandwiched between the W-hierarchy and the A-hierarchy: For every odd t, we introduce a parameterized complexity class S[t] with W[t] ? S[t] ? A[t], defined using a parameter that interpolates between the vertex cover number and the treedepth. We expect that many of the studied classes will be useful in the future for pinpointing the complexity of various structural parameterizations of graph problems
Advances and Applications of DSmT for Information Fusion. Collected Works, Volume 5
This fifth volume on Advances and Applications of DSmT for Information Fusion collects theoretical and applied contributions of researchers working in different fields of applications and in mathematics, and is available in open-access. The collected contributions of this volume have either been published or presented after disseminating the fourth volume in 2015 in international conferences, seminars, workshops and journals, or they are new. The contributions of each part of this volume are chronologically ordered.
First Part of this book presents some theoretical advances on DSmT, dealing mainly with modified Proportional Conflict Redistribution Rules (PCR) of combination with degree of intersection, coarsening techniques, interval calculus for PCR thanks to set inversion via interval analysis (SIVIA), rough set classifiers, canonical decomposition of dichotomous belief functions, fast PCR fusion, fast inter-criteria analysis with PCR, and improved PCR5 and PCR6 rules preserving the (quasi-)neutrality of (quasi-)vacuous belief assignment in the fusion of sources of evidence with their Matlab codes.
Because more applications of DSmT have emerged in the past years since the apparition of the fourth book of DSmT in 2015, the second part of this volume is about selected applications of DSmT mainly in building change detection, object recognition, quality of data association in tracking, perception in robotics, risk assessment for torrent protection and multi-criteria decision-making, multi-modal image fusion, coarsening techniques, recommender system, levee characterization and assessment, human heading perception, trust assessment, robotics, biometrics, failure detection, GPS systems, inter-criteria analysis, group decision, human activity recognition, storm prediction, data association for autonomous vehicles, identification of maritime vessels, fusion of support vector machines (SVM), Silx-Furtif RUST code library for information fusion including PCR rules, and network for ship classification.
Finally, the third part presents interesting contributions related to belief functions in general published or presented along the years since 2015. These contributions are related with decision-making under uncertainty, belief approximations, probability transformations, new distances between belief functions, non-classical multi-criteria decision-making problems with belief functions, generalization of Bayes theorem, image processing, data association, entropy and cross-entropy measures, fuzzy evidence numbers, negator of belief mass, human activity recognition, information fusion for breast cancer therapy, imbalanced data classification, and hybrid techniques mixing deep learning with belief functions as well
Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters
We investigate the parameterized complexity of Binary CSP parameterized by the vertex cover number and the treedepth of the constraint graph, as well as by a selection of related modulator-based parameters. The main findings are as follows: Binary CSP parameterized by the vertex cover number is W[3]-complete. More generally, for every positive integer d, Binary CSP parameterized by the size of a modulator to a treedepth-d graph is W[2d + 1]-complete. This provides a new family of natural problems that are complete for odd levels of the W-hierarchy. We introduce a new complexity class XSLP, defined so that Binary CSP parameterized by treedepth is complete for this class. We provide two equivalent characterizations of XSLP: the first one relates XSLP to a model of an alternating Turing machine with certain restrictions on conondeterminism and space complexity, while the second one links XSLP to the problem of model-checking first-order logic with suitably restricted universal quantification. Interestingly, the proof of the machine characterization of XSLP uses the concept of universal trees, which are prominently featured in the recent work on parity games. We describe a new complexity hierarchy sandwiched between the W-hierarchy and the A-hierarchy: For every odd t, we introduce a parameterized complexity class S[t] with W[t] ⊆ S[t] ⊆ A[t], defined using a parameter that interpolates between the vertex cover number and the treedepth. We expect that many of the studied classes will be useful in the future for pinpointing the complexity of various structural parameterizations of graph problems
LIPIcs, Volume 261, ICALP 2023, Complete Volume
LIPIcs, Volume 261, ICALP 2023, Complete Volum
Synthesis, magnetism and reactivity of graphene nanoribbons
294 p.En esta tesis profundizaremos se enfoca desde un ángulo fundamental la ciencia de las cintas de grafenoPrimero se definirán sus propiedades basándose en ideas bien fundamentadas como la aromaticidad yla topología. Una vez entrados en materia nos centraremos en los 5-armchair y las 3,1-quirales. Se mues-tra un estudio sobre el crecimiento de los primeros que dio lugar al descubrimiento de un nuevo meca-mismo de polimerización. A continuación se estudian sus propiedades para demostrar cómo los 5-aGNR(por sus siglas en inglés) son materiales topológicos que presentan electrones desapareados con actividadMagnética en sus extremos. Este magnetismo está relacionado con una alta reactividad que también se halló en los 3,1-quirales, a pesar de que estos últimos no presentan magnetismo. Se observó una reactividadextrema frente al agua y el oxígeno. La degradación frente a estos elementos generó radicales magnéticoscon capacidad para acoplarse, lo cual presentó una oportunidad de cuantificar y modelizar este acopla-miento en diferentes configuraciones. Por último, se desarrollaron dos estrategias exitosas a la hora deproteger las cintas del ataque ambiental, las cuales pueden ser extrapoladas a otros derivados del grafenoque muestren la recién descubierta reactividad, lo cual facilitaría su transferencia a la industria
Advancing large-scale analysis of human settlements and their dynamics
Due to the importance for a range of sustainability challenges, it is important to understand the spatial dynamics of human settlements. The rapid expansion of built-up land is among the most extensive global land changes, even though built-up land occupies only a small fraction of the terrestrial biosphere. Moreover, the different ways in which human settlements are manifested are crucially important for their environmental and socioeconomic impacts. Yet, current analysis of human settlements heavily relies on land cover datasets, which typically have only one class to represent human settlements. Consequently, the analysis of human settlements does often not account for the heterogeneity within urban environment or their subtle changes. This simplistic representation severely limits our understanding of change processes in human settlements, as well as our capacity to assess socioeconomic and environmental impacts. This thesis aims to advance large-scale analysis of human settlements and their dynamics through the lens of land systems, with a specific focus on the role of land-use intensity. Chapter 2 explores the use of human settlement systems as an approach to understanding their variation in space and changes over time. Results show that settlement systems exist along a density gradient, and their change trajectories are typically gradual and incremental. In addition, results indicate that the total increase in built-up land in village landscapes outweighs that of dense urban regions. This chapter suggests that we should characterize human settlements more comprehensively to advance the analysis of human settlements, going beyond the emergence of new built-up land in a few mega-cities only. In Chapter 3, urban land-use intensity is operationalized by the horizontal and vertical spatial patterns of buildings. Particularly, I trained three random forest models to estimate building footprint, height, and volume, respectively, at a 1-km resolution for Europe, the US, and China. The models yield R2 values of 0.90, 0.81, and 0.88 for building footprint, height, and volume, respectively. The correlation between building footprint and building height at a pixel level was 0.66, illustrating the relevance of mapping these properties independently. Chapter 4 builds on the methodological approach presented in chapter 3. Specifically, it presents an improved approach to mapping 3D built-up patterns (i.e., 3D building structure), and applies this to map building footprint, height, and volume at a global scale. The methodological improvement includes an optimized model structure, additional explanatory variables, and updated input data. I find distance decay functions from the centre of the city to its outskirts for all three properties for major cities in all continents. Yet, again, the height, footprint (density), and volume differ drastically across these cities. Chapter 5 uses built-up land per person as an operationalization for urban land-use intensity, in order to investigate its temporal dynamics at a global scale. Results suggest that the decrease of urban land-use intensity relates to 38.3%, 49.6%, and 37.5% of the built-up land expansion in the three periods during 1975-2015, but with large local variations. In the Global South, densification often happens in regions where human settlements are already used intensively, suggesting potential trade-offs with other living standards. These chapters represent the recent advancements in large-scale analysis of human settlements by revealing a large variation in urban fabric. Urban densification is widely acknowledged as one of the tangible solutions to satisfy the increased land demand for human settlement while conserving other land, suggesting the relevance of these findings to inform sustainable development. Nevertheless, local settlement trajectories towards intensive forms should also be guided in a large-scale context with broad considerations, including the quality of life for inhabitants, because these trade-offs and synergies remain largely unexplored in this analysis
LIPIcs, Volume 274, ESA 2023, Complete Volume
LIPIcs, Volume 274, ESA 2023, Complete Volum
- …