| 31. |
|
|
| 32. |
- Anterot, Joakim, 1965-
(författare)
-
Seminarium slagverk inriktning orkester : PASIC 2020
- 2020
-
Konferensbidrag (film/video) (refereegranskat)abstract
- I det här seminariet ser vi närmare på teknik och frasering kring i första hand tamburin och triangel. Vi tar upp frågeställningar och tankar kring hur vi sätter allt i ett sammanhang och förhåller oss till olika musikaliska situationer. En vanlig fråga är hur en skall spela på en audition för att spela bäst. Vi lyfter några av dessa frågor här. Seminariet var en del av konventet PASIC 2020 som detta år hålls helt digitalt. I normala fall hålls PASIC årligen i USA och Indianapolis och är det största konventet i världen inom gebitet slagverk.
|
|
| 33. |
- Dumitrescu, Adrian, et al.
(författare)
-
Finding Small Complete Subgraphs Efficiently
- 2023
-
Ingår i: Combinatorial Algorithms - 34th International Workshop, IWOCA 2023, Proceedings. - 0302-9743 .- 1611-3349. - 9783031343469 ; 13889 LNCS, s. 185-196
-
Konferensbidrag (refereegranskat)abstract
- (I) We revisit the algorithmic problem of finding all triangles in a graph G= (V, E) with n vertices and m edges. According to a result of Chiba and Nishizeki (1985), this task can be achieved by a combinatorial algorithm running in O(mα) = O(m3 / 2) time, where α= α(G) is the graph arboricity. We provide a new very simple combinatorial algorithm for finding all triangles in a graph and show that is amenable to the same running time analysis. We derive these worst-case bounds from first principles and with very simple proofs that do not rely on classic results due to Nash-Williams from the 1960s. (II) We extend our arguments to the problem of finding all small complete subgraphs of a given fixed size. We show that the dependency on m and α in the running time O(αℓ-2· m) of the algorithm of Chiba and Nishizeki for listing all copies of Kℓ, where ℓ≥ 3, is asymptotically tight. (III) We give improved arboricity-sensitive running times for counting and/or detection of copies of Kℓ, for small ℓ≥ 4. A key ingredient in our algorithms is, once again, the algorithm of Chiba and Nishizeki. Our new algorithms are faster than all previous algorithms in certain high-range arboricity intervals for every ℓ≥ 7.
|
|
| 34. |
- Lam, V. W. Y., et al.
(författare)
-
Dealing with the effects of ocean acidification on coral reefs in the Indian Ocean and Asia
- 2019
-
Ingår i: Regional Studies in Marine Science. - : Elsevier BV. - 2352-4855. ; 28
-
Tidskriftsartikel (refereegranskat)abstract
- Shallow coral reefs provide food, income, well-being and coastal protection to countries around the Indian Ocean and Asia. These reefs are under threat due to many anthropogenic stressors including pollution, sedimentation, overfishing, sea surface warming and habitat destruction. Ocean acidification interacts with these factors to exacerbate stress on coral reefs. Effective solutions in tackling the impact of ocean acidification require a thorough understanding of the current adaptive capacity of each nation to deal with the consequences. Here, we aim to help the decision-making process for policy makers in dealing with these future challenges at the regional and national levels. We recommend that a series of evaluations be made to understand the current status of each nation in this region in dealing with ocean acidification impacts by assessing the climate policy, education, policy coherence, related research activities, adaptive capacity of reef-dependent economic sectors and local management. Indonesia and Thailand, are selected as case studies. We also highlight general recommendations on mitigation and adaptation to ocean acidification impacts on coral reefs and propose well-designed research program would be necessary for developing a more targeted policy agenda in this region. (c) 2019 Elsevier B.V. All rights reserved.
|
|
| 35. |
|
|
| 36. |
- Zechner, Niklas, et al.
(författare)
-
Efficient algorithms for subgraph listing
- 2014
-
Ingår i: Algorithms. - : MDPI. - 1999-4893. ; 7:2, s. 243-252
-
Tidskriftsartikel (refereegranskat)abstract
- Subgraph isomorphism is a fundamental problem in graph theory. In this paper we focus on listing subgraphs isomorphic to a given pattern graph. First, we look at the algorithm due to Chiba and Nishizeki for listing complete subgraphs of fixed size, and show that it cannot be extended to general subgraphs of fixed size. Then, we consider the algorithm due to Gąsieniec et al. for finding multiple witnesses of a Boolean matrix product, and use it to design a new output-sensitive algorithm for listing all triangles in a graph. As a corollary, we obtain an output-sensitive algorithm for listing subgraphs and induced subgraphs isomorphic to an arbitrary fixed pattern graph.
|
|
| 37. |
- Gallos Cronberg, Florenda, 1956, et al.
(författare)
-
The research lesson: Exploring which of the given three sets of lengths could form a triangle
- 2017
-
Ingår i: The World Association of Lesson Studies (WALS) International Conference 2017. - Nagoya, Japan : WALS. - 1068-3070.
-
Konferensbidrag (refereegranskat)abstract
- This paper discusses the lesson study conducted at the pre-service education courses where triangle inequality is the key mathematical concept for discussion. The study problematizes the patterns of variation for discussing triangle inequality in the classrooms through the research lesson.
|
|
| 38. |
- Kiselman, Christer O., 1939-
(författare)
-
How to best fold a triangle
- 2017
-
Ingår i: Mathematische Semesterberichte. - : Springer Science and Business Media LLC. - 0720-728X .- 1432-1815. ; 65:1, s. 65-89
-
Tidskriftsartikel (refereegranskat)abstract
- We fold a triangle once along a straight line and study how small the area of the folded figure can be. It can always be as small as the fraction 2 minus the square root of 2 of the area of the original triangle. This is best possible: For every positive number q less than 2 minus the square root of 2 there are triangles that cannot be folded better than the fraction q.
|
|
| 39. |
- Gallos Cronberg, Florenda, 1956, et al.
(författare)
-
Triangle inequality and its critical aspects
- 2016
-
Ingår i: EARLI Special Interest Group 9: Phenomenography and Variation Theory.
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- Triangle inequality and its critical aspects The study discusses our experiences of doing learning study at the university level where the focus is looking into the concept of triangle inequality. The study problematizes as to how critical aspects about triangle inequality could be identified in the classrooms through a mathematical task. It employs a qualitative research design that is non-emergent case study and is guided by the conceptual frameworks of learning study and variation theory. The same task was implemented to different groups of students in three different occassions. The students made use of the available materials to answer questions in the task, like matchsticks and computer applications, and tried to justify their answers mainly based on their constructions. Results showed that identifying the critical aspects on triangle inequality was not attained readily, however, during the whole class discussions the students became more aware of these critical aspects and on justifying their answers in a more generalized form. On the researchers’ perspective, this learning study has no doubt have enhanced the skills on preparing mathematical tasks as well as how the concept of triangle inequality be introduced, defined and discussed in mathematics classrooms.
|
|
| 40. |
- Krüger, Oliver, 1988-
(författare)
-
On minimal triangle-free Ramsey graphs
- 2017
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- A graph G is called a minimal Ramsey (3, k; n)-graph if it has the least amount of edges, e(3, k; n), possible given that G is triangle-free, has independence number α(G) < k an has n vertices. The numbers e(3, k; n) and the minimalRamsey graphs are directly related to the Ramsey numbers R(3, k).This licentiate thesis studies minimal Ramsey graphs, graphs that are closeto being minimal Ramsey graphs and the edge numbers e(3, k; n) from several different aspects. Lower bounds on e(3, k; n) are lower bounds on the numberof edges in triangle-free graphs. In Paper I we show the bounde(G) ≥ (1/3)(17n(G) − 35α(G) − N(C 4 ; G)),where N(C4 ; G) that is number of cycles of length four in G. We also classifyall triangle-free graphs which satisfy this bound with equality.In Paper II we study constructions of minimal Ramsey graphs, and graphsG such that e(G) − e(3, k; n) is small. We use a way to describe some of these graphs in terms of “patterns” and a recursive procedure to construct them. We also present the result of computer calculations where we have actually performed such constructions of Ramsey graphs and compare these lists to other computations of Ramsey graphs.
|
|
