京都大学 / 新制・課程博士 / 博士(理学) / 甲第22981号 / 理博第4658号 / 新制||理||1669(附属図書館) / 京都大学大学院理学研究科数学・数理解析専攻 / (主査)教授 玉川 安騎男, 教授 小野 薫, 教授 望月 新一 / 学位規則第4条第1項該当 / Doctor of Science / Kyoto University / DGAM

The diploma thesis is focused on realizing a critical analysis of the current classification level of costs and calculations in a chosen company that deals with custom production. The aim of the work is to propose a solution based on the identified shortcomings that meets the specifics and needs of the company, both for a cost breakdown and a calculations system.

This master's thesis deals with measurements of highs and gravity of points polygon located in village Tetčice, through which is crossing a eastern fault of Boskovice furrow. With repeated measurement should be proved effect to high levels of groundwater. Repeated measurements are realized in the range 2 stages. In thesis is in detail described calculation complete Bouguer gravity anomaly and their quantitative interpretation. From the gravimetric of dates is created map of complete Bouguer gravity anomaly and interpretative profile through Boskovice furrow. Interpretative profile has localized fault, whose tectonic activity belong to possible factors level movement in the village. Level measurements meets the requirement of precise levelling. The results of the measurements are compared and discussed with the previous stages of the research.

No description available.

No description available.

<p>Complete Joint Penetration (CJP) welds are commonly used in many industries such as structural steel-fabrication, pressure vessels, pipelines, nuclear industries, etc. However, CJP weld could be susceptible to defects such as lack of fusion, slag, porosity, etc. The 1994 Northridge earthquake and the 1995 Kobe earthquake revealed that there was a significant loss in the ductility of CJP welded connections due to the presence of defects. There are very limited experimental and numerical studies available to understand the overall behavior and strength of CJP welded connection in the presence of defect. This study aims to bridge this gap. The objective of this study is to understand the influence of defects on ultimate strength and ductility of the CJP welded connection. To achieve this objective, a total of twelve specimens were tested, out of which four specimens were without any defect, while eight specimens had defects in the weld. A process was developed to introduce defects in the CJP weld specimens. A simplified lower bound approach using ductile damage criteria was proposed based on benchmarked finite element models to simulate the weld fracture. Moreover, a parametric study was performed to understand the effects of various parameters such as length and depth of defect, failure criteria, etc. on behavior and ductility of the welded connections. It was found that the welded specimens having no defect were able to reach the ultimate strength and ductility of the base metal. Whereas loss in ductility and strength was observed in the specimens with defects. The loss in ductility as compared to base metal ranges from 30% to 88% for different specimens. The maximum loss in strength was observed to be 12% only for specimens with the worst defect. The study concluded that the depth of defect had significant influence over ductility as compared to length of defect. If the depth of defect (d) is greater than half of plate thickness (d > t/2), it exhibits similar behavior regardless of actual depth. However, no significant influence of defect was observed if the depth of defect was less than t/8.</p>

Let G = (V, E) be a graph and let S ⊆ V be a subset of vertices. The set S is a defensive alliance if for all x ∈ S, |N[x] ∩ S| ≥ |N[x] − S|. The concept of defensive alliances was introduced in [KHH04], primarily for the modeling of nations in times of war, where allied nations are in mutual agreement to join forces if any one of them is attacked. For a vertex x in a defensive alliance, the number of neighbors of x inside the alliance, plus the vertex x, is at least the number of neighbors of x outside the alliance. In a graph model, the vertices of a graph represent nations and the edges represent country boundaries. Thus, if the nation corresponding to a vertex x is attacked by its neighbors outside the alliance, the attack can be thwarted by x with the assistance of its neighbors in the alliance. In a different subject matter, [FLG00] applies graph theory to model the world wide web, where vertices represent websites and edges represent links between websites. A web community is a subset of vertices of the web graph, such that every vertex in the community has at least as many neighbors in the set as it has outside. So, a web community C satisfies ∀x ∈ C, |N[x] ∩ C| > |N[x] − C|. These sets are very similar to defensive alliances. They are known as strong defensive alliances in the literature of alliances in graphs. Other areas of application for alliances and related topics include classification, data clustering, ecology, business and social networks. iii Consider the application of modeling nations in times of war introduced in the first paragraph. In a defensive alliance, any attack on a single member of the alliance can be successfully defended. However, as will be demonstrated in Chapter 1, a defensive alliance may not be able to properly defend itself when multiple members are under attack at the same time. The concept of secure sets is introduced in [BDH07] for exactly this purpose. The non-empty set S is a secure set if every subset X ⊆ S, with the assistance of vertices in S, can successfully defend against simultaneous attacks coming from vertices outside of S. The exact definition of simultaneous attacks and how such attacks may be defended will be provided in Chapter 1. In [BDH07], the authors presented an interesting characterization for secure sets which resembles the definition of defensive alliances. A non-empty set S is a secure set if and only if ∀X ⊆ S, |N[X] ∩ S| ≥ |N[X] − S| ([BDH07], Theorem 11). The cardinality of a minimum secure set is the security number of G, denoted s(G). A secure set S is a global secure set if it further satisfies N[S] = V . The cardinality of a minimum global secure set of G is the global security number of G, denoted γs(G). In this work, we present results on secure sets and global secure sets. In particular, we treat the computational complexity of finding the security number of a graph, present algorithms and bounds for the global security numbers of trees, and present the exact values of the global security numbers of paths, cycles and their Cartesian products.

Located in the heart of Silicon Valley, Downtown San Jose is attracting new residents, visitors, and businesses. Clearly, the mobility of these residents, visitors, and businesses cannot be accommodated by streets that focus on the single-occupancy automobile mode. To increase the potential for individuals to use non-single-occupancy modes of travel, the downtown area must have a cohesive plan to integrate multimodal use and public life. Complete streets are an integral component of the multi-modal transport system and more livable communities. Complete streets refer to roads designed to accommodate multiple modes, users, and activities including walking, cycling, transit, automobile, and nearby businesses and residents. A one-way to two-way street conversion is an example of a complete streets project. Similarly, tactical urbanism can provide cost-effective modifications (e.g., through temporary road closures for events like the farmers’ market) that enrich the public life in an urban environment. The ability to serve current and future transportation needs of residents, businesses and visitors through the creation of pleasant, efficient, and safe multimodal corridors is a guiding principle of a smart city. This research project addressed questions that guide the implementation of this overarching principle. These questions relate to travel patterns and potential network impacts of the conversion of the corridor(s) into complete streets. Towards that end, core network in downtown San Jose is simulated via a validated VISSIM model for 2015 traffic conditions (i.e., the base case or Scenario 0). Three scenarios are then modeled as variations to this model. The relevant model outputs from the base and scenario models provide easily digestible information the City can convey various impacts and trade-offs to partners and stakeholders prior to implementation of these plans. The scenarios modeled are based on stakeholder input. Microsimulation allows for detailed modeling and visualization of the transportation networks including movements of individual vehicles and pedestrians. The results based on 2040 traffic volumes provided by the city based on their long-range travel demand model clearly demonstrate that the existing network cannot support the projected level of travel demand. It indicates that the city needs an aggressive travel demand management program to curb the growth of automobile traffic. The output also includes 3-D animations of the traffic flow that can be used in public forums for community outreach. A discussion for such a campaign based on best practices around using these visualizations for public outreach is also provided. Located in the heart of Silicon Valley, Downtown San Jose is attracting new residents, visitors, and businesses. Clearly, the mobility of these residents, visitors, and businesses cannot be accommodated by streets that focus on the single-occupancy automobile mode. To increase the potential for individuals to use non-single-occupancy modes of travel, the downtown area must have a cohesive plan to integrate multimodal use and public life. Complete streets are an integral component of the multi-modal transport system and more livable communities. Complete streets refer to roads designed to accommodate multiple modes, users, and activities including walking, cycling, transit, automobile, and nearby businesses and residents. A one-way to two-way street conversion is an example of a complete streets project. Similarly, tactical urbanism can provide cost-effective modifications (e.g., through temporary road closures for events like the farmers’ market) that enrich the public life in an urban environment. The ability to serve current and future transportation needs of residents, businesses and visitors through the creation of pleasant, efficient, and safe multimodal corridors is a guiding principle of a smart city. This research project addressed questions that guide the implementation of this overarching principle. These questions relate to travel patterns and potential network impacts of the conversion of the corridor(s) into complete streets. Towards that end, core network in downtown San Jose is simulated via a validated VISSIM model for 2015 traffic conditions (i.e., the base case or Scenario 0). A number o Threef scenarios are then modeled as variations to this model. The relevant model outputs from the base and scenario models provide easily digestible information the City can convey various impacts and trade-offs to partners and stakeholders prior to implementation of these plans. The scenarios modeled are based on stakeholder input. Microsimulation allows for detailed modeling and visualization of the transportation networks including movements of individual vehicles and pedestrians. The results based on 2040 traffic volumes provided by the city based on their long-range travel demand model clearly demonstrate that the existing network cannot support the projected level of travel demand. It indicates that the city needs an aggressive travel demand management program to curb the growth of automobile traffic. The output also includes 3-D animations of the traffic flow that can be used in public forums for community outreach. A discussion for such a campaign based on best practices around using these visualizations for public outreach is also provided.

A well-known result in spectral graph theory states that if a graph has an equitable partition then the eigenvalues of the associated divisor graph are a subset of the graph's eigenvalues. A natural question question is whether it is possible to recover the remaining eigenvalues of the graph. Here we show that if a graph has a Hermitian adjacency matrix then the spectrum of the graph can be decomposed into a collection of smaller graphs whose eigenvalues are collectively the remaining eigenvalues of the graph. This we refer to as a complete equitable decomposition of the graph.

No description available.