Search results for "SOFC"
showing 10 items of 660 documents
Exploitation of cryptocurrencies as a tool for tax evasion: technological and regulatory issues
2020
Tax evasion is a crime that harms the national economies, society and indirectly affects all the residents of each state. Now that after a long time of international efforts the traditional tax evasion tools have eventually been put under a reasonable control, a new technology has emerged able to facilitate efficient tax evasion. The main objectives of this research are to identify the regulatory challenges of the non-precedent technology, to analyse the applicability of the current EU legislation aimed at tax evasion prevention to the exploitation of cryptocurrencies, and to assess the recommendations of academics and international organizations for a possible future regulation. This resea…
Excited States Calculations of MoS2@ZnO and WS2@ZnO Two-Dimensional Nanocomposites for Water-Splitting Applications
2021
This research was funded by the Latvian Scientific Council grant LZP-2018/2-0083. Institute of Solid State Physics, University of Latvia, as the Center of Excellence, has received funding from the European Union's Horizon 2020 Framework Program H2020-WIDESPREAD-01-2016-2017-TeamingPhase2 under Grant Agreement No. 739508, project CAMART2.
Expression of the genetic suppressor element 24.2 (GSE24.2) decreases DNA damage and oxidative stress in X-linked dyskeratosis congenita cells.
2014
This is an open-access article distributed under the terms of the Creative Commons Attribution License.-- et al.
Thermal Analysis of the Solar Orbiter PHI Electronics Unit
2020
“© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.”
Underlying Simple Graphs
2019
Summary In this article the notion of the underlying simple graph of a graph (as defined in [8]) is formalized in the Mizar system [5], along with some convenient variants. The property of a graph to be without decorators (as introduced in [7]) is formalized as well to serve as the base of graph enumerations in the future.
Robust Synchronization-Based Graph Clustering
2013
Complex graph data now arises in various fields like social networks, protein-protein interaction networks, ecosystems, etc. To reveal the underlying patterns in graphs, an important task is to partition them into several meaningful clusters. The question is: how can we find the natural partitions of a complex graph which truly reflect the intrinsic patterns? In this paper, we propose RSGC, a novel approach to graph clustering. The key philosophy of RSGC is to consider graph clustering as a dynamic process towards synchronization. For each vertex, it is viewed as an oscillator and interacts with other vertices according to the graph connection information. During the process towards synchro…
Rough Sets and Vague Sets
2007
The subject-matter of the consideration touches the problem of vagueness. The notion of the rough set, originated by Zdzislaw Pawlak, was constructed under the influence of vague information and methods of shaping systems of notions leading to conceptualization and representation of vague knowledge, so also systems of their scopes as some vague sets. This paper outlines some direction of searching for a solution to this problem. In the paper, in connection to the notion of the rough set, the notion of a vague set is introduced. Some operations on these sets and their properties are discussed. The considerations intend to take into account a classical approach to reasoning, based on vague pr…
Invisible Graffiti on Your Buildings: Blind and Squaring-Proof Watermarking of Geographical Databases
2007
Due to the ease of digital copy, watermarking is crucial to protect the intellectual property of rights owners. We propose an effective watermarking method for vectorial geographical databases, with the focus on the buildings layer. Embedded watermarks survive common geographical filters, including the essential squaring and simplification transformations, as well as deliberate removal attempts, e.g. by noise addition, cropping or over-watermarking. Robustness against the squaring transformation is not adressed by existing approaches. The impact on the quality of the datasets, defined as a composition of point accuracy and angular quality, is assessed through an extensive series of experime…
Heuristics for the Constrained Incremental Graph Drawing Problem
2019
Abstract Visualization of information is a relevant topic in Computer Science, where graphs have become a standard representation model, and graph drawing is now a well-established area. Within this context, edge crossing minimization is a widely studied problem given its importance in obtaining readable representations of graphs. In this paper, we focus on the so-called incremental graph drawing problem, in which we try to preserve the user’s mental map when obtaining successive drawings of the same graph. In particular, we minimize the number of edge crossings while satisfying some constraints required to preserve the position of vertices with respect to previous drawings. We propose heur…
A grid ant colony algorithm for the orienteering problem
2005
In this paper we propose a distributed ant colony algorithm to solve large scale orienteering problem instances. Our approach is based on a multi-colony strategy where each colony works in an independent portion (cluster) in the original graph. This results in no need for communicating pheromones information among colonies and in increasing speedup. We have implemented our algorithm as a .NET Web services infrastructure following a grid computing philosophy and we provide some promising experimental results to show the feasibility and effectiveness of our approach