38 research outputs found

    The role of upper Gorenjska conurbation in the urban network

    Get PDF
    The thesis treats the role of the Upper Gorenjska subregion in the urban network. The first part of the thesis analyses some projects (ESPON, 1.4.1, ESPON 2.4.2, RePUS, Urban Audit, CONSPACE, MARS, SURS, …) which possess specified criteria (indicators) for determining or analysing individual settlement characteristic. Those criteria which show importance for determination of small and medium cities have been selected out of the above mentioned projects. Indicators are collected in four groups which are demographic structure, economic – socio structure, infrastructure and accessibility together with institutions. These groups are divided into subgroups. The end of the first part contains those indicators which are important for small and medium cities according to the Slovene criteria. A standard classification of territorial units is depicted in the second part of the thesis and followed by descriptions of individual units in the upper Gorenjska region. Selected indicators on the area of upper Gorenjska are tested on the basis of statistical data and some graphic bases for those settlements which have a status of urban settlement according to Statistical Office of the Republic of Slovenia. Those indicators which demonstrate the role of the upper Gorenjska conurbation in the urban network have been selected out of the analysis at the end of the thesis

    Resolution of the Linear-Bounded Automata Question

    Full text link
    This work resolve a longstanding open question in automata theory, i.e. the {\it linear-bounded automata question} ( shortly, {\it LBA question}), which can also be phrased succinctly in the language of computational complexity theory as NSPACE[n]=?DSPACE[n]NSPACE[n]\overset{?}{=}DSPACE[n]. We prove that NSPACE[n]DSPACE[n]NSPACE[n]\neq DSPACE[n]. Our proof technique is based on diagonalization against all deterministic Turing machines working in O(n)O(n) space by an universal nondeterministic Turing machine running in O(n)O(n) space. Our proof also implies the following consequences: (1) There exists no deterministic Turing machine working in O(logn)O(\log n) space deciding the stst-connectivity question (STCON); (2) LNLL\neq NL; (3) LPL\neq P.Comment: The definition of enumeration supplemented, feedbacks are welcome. arXiv admin note: text overlap with arXiv:2106.1188

    Criteria to define the border of urban area

    Get PDF
    This thesis deals with criteria defining the border of urban area and aims to define criteria for deliminitation of towns from other areas. The new Spatial Planning Law defines an urban plan for urban area; this was one of the main points of this thesis. The thesis consists of two parts. The first part examines and compares the indicators and criteria that define small and medium-sized towns from national and foreign literature. The indicators for defining the precise border of urban area are also included in the thesis. The second part analyses the suggested indicators and defines criteria for determination of urban area border. The results are shown on the examples of Pivka and Postojna. Morphological criteria for defining the border of urban area are: continuous built-up area and the type of residential house. The criteria used are the most appropriate for distinguishing between urban and rural area. Since this kind of methodological approach is still not developed in Slovenia, this thesis tries to contribute to forming of criteria and indicators for defining the border of urban area

    Innovación en el Sector de la Construcción

    Get PDF
    Este trabajo se ha realizado en la empresa Construcciones y Contratas Valle del Ebro que tiene como actividad principal el sector inmobiliario y de la construcción, para buscar líneas de innovación con las que presentarse en un futuro y ser más competitiva. En primer lugar, realicé un profundo análisis interno y externo de la empresa, que me ayudó a determinar la matriz DAFO, en la que pude ver sus puntos débiles y fuertes. Una vez realizado estos análisis y con la ayuda de la empresa, se establecieron distintas estrategias de innovación que se podían llevar a cabo en la empresa siempre teniendo como premisa principal la conservación y mejora del medioambiente y de las personas. Con estas premisas surgen tres líneas de innovación, en las cuales la empresa podrá desarrollar su estrategia de convertirse en una empresa referente a nivel nacional. Estas líneas se ajustan a la demanda real de la industria y a la capacidad de la empresa para desarrollarlas, por lo cual son objetivas y precisas. Las tres líneas son: obtener los certificados ISO 9001 e ISO 14001, la utilización de materiales Ecológicos y el lanzamiento de un nuevo producto a través de los neumáticos en desuso. Para terminar me he centrado en desarrollar la inversión de la tercera línea ya que se trata del lanzamiento de un nuevo producto, donde explicamos qué es, cómo se produce, qué controles debe llevar y por ultimo hasta cuánto ascendería dicha inversión

    A uniform approach to the complexity and analysis of succinct systems

    Get PDF
    “ This thesis provides a unifying view on the succinctness of systems: the capability of a modeling formalism to describe the behavior of a system of exponential size using a polynomial syntax. The key theoretical contribution is the introduction of sequential circuit machines as a new universal computation model that focuses on succinctness as the central aspect. The thesis demonstrates that many well-known modeling formalisms such as communicating state machines, linear-time temporal logic, or timed automata exhibit an immediate connection to this machine model. Once a (syntactic) connection is established, many complexity bounds for structurally restricted sequential circuit machines can be transferred to a certain formalism in a uniform manner. As a consequence, besides a far-reaching unification of independent lines of research, we are also able to provide matching complexity bounds for various analysis problems, whose complexities were not known so far. For example, we establish matching lower and upper bounds of the small witness problem and several variants of the bounded synthesis problem for timed automata, a particularly important succinct modeling formalism. Also for timed automata, our complexity-theoretic analysis leads to the identification of tractable fragments of the timed synthesis problem under partial observability. Specifically, we identify timed controller synthesis based on discrete or template-based controllers to be equivalent to model checking. Based on this discovery, we develop a new model checking-based algorithm to efficiently find feasible template instantiations. From a more practical perspective, this thesis also studies the preservation of succinctness in analysis algorithms using symbolic data structures. While efficient techniques exist for specific forms of succinctness considered in isolation, we present a general approach based on abstraction refinement to combine off-the-shelf symbolic data structures. In particular, for handling the combination of concurrency and quantitative timing behavior in networks of timed automata, we report on the tool Synthia which combines binary decision diagrams with difference bound matrices. In a comparison with the timed model checker Uppaal and the timed game solver Tiga running on standard benchmarks from the timed model checking and synthesis domain, respectively, the experimental results clearly demonstrate the effectiveness of our new approach.Diese Dissertation liefert eine vereinheitlichende Sicht auf die Kompaktheit von Systemen: die Fähigkeit eines Modellierungsformalismus, das Verhalten eines Systems exponentieller Größe mit polynomieller Syntax zu beschreiben. Der wesentliche theoretische Beitrag ist die Einführung von sequenziellen Schaltkreis-Maschinen als neues universelles Berechnungsmodell, das sich auf den zentralen Aspekt der Kompaktheit konzentriert. Die Dissertation demonstriert, dass viele bekannte Modellierungsformalismen, wie z.B. kommunizierende Zustandsmaschinen, linear-Zeit temporale Logik (LTL) oder gezeitete Automaten eine direkte Verbindung zu diesem Maschinenmodell aufzeigen. Sobald eine (syntaktische) Verbindung hergestellt ist, können viele Komplexitätsschranken für strukturell beschränkte sequenzielle Schaltkreis-Maschinen für einen bestimmten Formalismus einheitlich übernommen werden. Neben einer weitreichenden Vereinheitlichung unabhängiger Forschungsrichtungen können auch zahlreiche Komplexitätsschranken für Analyse-Probleme etabliert werden, deren genaue Komplexität bisher noch nicht bekannt war. Zum Beispiel werden passende untere und obere Schranken des small witness Problems und mehrere Varianten des Synthese-Problems von Controllern mit beschränkter Größe für gezeitete Automaten bewiesen. Die theoretische Analyse deckt Fragmente geringerer Komplexität des partiell informierten Syntheseproblems für gezeitete Automaten auf. Es wird im Besonderen gezeigt, dass das gezeitete Syntheseproblem für diskrete oder Vorlagen-basierte Controller äquivalent zum Model Checking-Problem ist. Basierend auf dieser Einsicht wird ein neuartiger Model Checking-basierter Algorithmus zur effizienten Synthese von gültigen Instantiierungen von Vorlagen entwickelt. Der praktische Beitrag der Dissertation untersucht die Erhaltung von Kompaktheit in Analyse-Algorithmen durch die Benutzung symbolischer Datenstrukturen. Es wird ein allgemeiner Ansatz zur Kombination von Standard-Datenstrukturen vorgestellt, die jeweils bisher nur in Isolation verwendet werden konnten. Insbesondere wird für die Analyse von Netzwerken von gezeiteten Automaten das Tool Synthia vorgestellt, welches binäre Entscheidungs-Diagramme mit Differenzen-Matrizen verbindet. In einem experimentellen Vergleich mit den Tools Uppaal und Tiga wird klar die Effektivität des neuen Ansatzes belegt

    Croatian Accession to the European Union: Facing the Challenges of Negotiations

    Get PDF
    This paper analyses the characteristics of EU regional policy and emphasizes the component of regional policy towards the Central and East European countries (CEEC) in the phases of candidacy and their full membership. Special importance was given to the possibility of Croatia to absorb funds offered by the EU. Potentials of Croatian regions are illustrated through the case of Istria, which successfully uses funds provided by the CARDS program and projects of Community Initiatives. In order to prepare Croatia (and its regions) as best as possible for use of these funds, it is necessary to set certain development documents, establish and reorganize (reassign) some institutions and improve cooperation with the EU regions.regional policy, European Union, Structural funds, Cohesion Fund, new member states, Croatia, Istria

    Proving the power of postselection

    Full text link
    It is a widely believed, though unproven, conjecture that the capability of postselection increases the language recognition power of both probabilistic and quantum polynomial-time computers. It is also unknown whether polynomial-time quantum machines with postselection are more powerful than their probabilistic counterparts with the same resource restrictions. We approach these problems by imposing additional constraints on the resources to be used by the computer, and are able to prove for the first time that postselection does augment the computational power of both classical and quantum computers, and that quantum does outperform probabilistic in this context, under simultaneous time and space bounds in a certain range. We also look at postselected versions of space-bounded classes, as well as those corresponding to error-free and one-sided error recognition, and provide classical characterizations. It is shown that NL\mathsf{NL} would equal RL\mathsf{RL} if the randomized machines had the postselection capability.Comment: 26 pages. This is a heavily improved version of arXiv:1102.066

    How prepared is Croatia to access European Union regional policy funds? The case of Istria

    Full text link
    This paper analyses the characteristics of EU regional policy and emphasizes the component of regional policy towards the Central and East European countries (CEEC) in the phases of candidacy and their full membership. Special importance was given to the possibility of Croatia to absorb funds offered by the EU. Potentials of Croatian regions are illustrated through the case of Istria, which successfully uses funds provided by the CARDS program and projects of Community Initiatives. In order to prepare Croatia (and its regions) as best as possible for use of these funds, it is necessary to set certain development documents, establish and reorganize (reassign) some institutions and improve cooperation with the EU regions
    corecore