Perencanaan Perbaikan Mutu Berkelanjutan Madrasah Terakreditasi A

Berdasarkan kajian Programme for International Student Assessment (PISA) tahun 2018 Indonesia merosot pada peringkat 74 untuk kategori membaca, 73 untuk kategori matematika, 71 untuk kategori sains dari 79 negara peserta, hal ini menunjukkan mutu pendidikan di Indonesia masih rendah, dengan demikian penting bagi Indonesia melakukan perbaikan mutu pendidikan secara berkelanjutan dengan berbagai upaya. Artikel ini mendeskripsikan perencanaan perbaikan mutu berkelanjutan (Continuous Quality Improvement) pada Madrasah Terakreditasi A. Kajian  ini menggunakan metode  “Literature Review” yang berisikan ulasan (Compare, Contrast and Synthesize), rangkuman (Summarize),  dan  pemikiran  penulis (Criticize) dari beberapa  sumber  pustaka terkait Perencanaan Perbaikan Mutu Berkelanjutan Madrasah Terakreditasi A. Madrasah Terakreditasi A dapat melakukan perencanaan perbaikan mutu berkelanjutan dengan merencanakan program inovatif  dan unggulan yang khas dan unik untuk meningkatkan mutu proses dan mutu lulusan pendidikan, yaitu: dengan melakukan pengelompokan kelas bahasa, kelas olimpiade, kelas riset, kelas akselerasi, peningkatan mutu sarana prasarana, lingkungan yang kondusip dan pengembangan kurikulum ektrakurikuler keagamaan, pidato 3 bahasa, seni dan budaya serta kegiatan olahraga yang kesemuanya ini mengarah pada perbaikan mutu lulusan sebagai output dari proses Pendidikan yang dilakukan di Madrasah Terakreditasi

Temporal landmark graphs for solving overconstrained planning problems

This paper presents TempLM, a novel approach for handling temporal planning problems with deadlines. The proposal revolves around the concept of temporal landmark, a proposition that must be necessarily true in all solution plans to achieve the problem goals within their deadlines. The temporal landmarks extracted from the problem form a landmarks graph where nodes are landmarks and edges represent temporal as well as causal relationships between landmarks. The graph comprises information about which propositions and when these propositions must be achieved in a solution plan, information that is later used to guide the search process as well as reduce the search space. Thus, the partial plans of the search tree that are not compliant with the information comprised in this graph are pruned. We present an exhaustive experimentation evaluation in overconstrained and unsolvable problems and we compare the performance of TempLM with other state-of-the-art planners. The results will show the efficiency of TempLM in the detection of unsolvable problems. (C) 2016 Elsevier B.V. All rights reserved:We thank Derek Long for solving our doubts about the modal operators in PDDL3 and Erez Karpas for supplying the compiled domain and problem files with their temporal landmarks. This work has been partially supported by Spanish Government Project MINECO TIN2014-55637-C2-2-R.Marzal Calatayud, EJ.; Sebastiá Tarín, L.; Onaindia De La Rivaherrera, E. (2016). Temporal landmark graphs for solving overconstrained planning problems. Knowledge-Based Systems. 106:14-25. https://doi.org/10.1016/j.knosys.2016.05.029S142510

Etat de droit et valeurs du droit de l’Union européenne dans le débat sur l’indépendance de la Catalogne

No abstract available

The three-dimensional art gallery problem and its solutions

This thesis addressed the three-dimensional Art Gallery Problem (3D-AGP), a version of the art gallery problem, which aims to determine the number of guards required to cover the interior of a pseudo-polyhedron as well as the placement of these guards. This study exclusively focused on the version of the 3D-AGP in which the art gallery is modelled by an orthogonal pseudo-polyhedron, instead of a pseudo-polyhedron. An orthogonal pseudopolyhedron provides a simple yet effective model for an art gallery because of the fact that most real-life buildings and art galleries are largely orthogonal in shape. Thus far, the existing solutions to the 3D-AGP employ mobile guards, in which each mobile guard is allowed to roam over an entire interior face or edge of a simple orthogonal polyhedron. In many realword applications including the monitoring an art gallery, mobile guards are not always adequate. For instance, surveillance cameras are usually installed at fixed locations. The guard placement method proposed in this thesis addresses such limitations. It uses fixedpoint guards inside an orthogonal pseudo-polyhedron. This formulation of the art gallery problem is closer to that of the classical art gallery problem. The use of fixed-point guards also makes our method applicable to wider application areas. Furthermore, unlike the existing solutions which are only applicable to simple orthogonal polyhedra, our solution applies to orthogonal pseudo-polyhedra, which is a super-class of simple orthogonal polyhedron. In this thesis, a general solution to the guard placement problem for 3D-AGP on any orthogonal pseudo-polyhedron has been presented. This method is the first solution known so far to fixed-point guard placement for orthogonal pseudo-polyhedron. Furthermore, it has been shown that the upper bound for the number of fixed-point guards required for covering any orthogonal polyhedron having n vertices is (n3/2), which is the lowest upper bound known so far for the number of fixed-point guards for any orthogonal polyhedron. This thesis also provides a new way to characterise the type of a vertex in any orthogonal pseudo-polyhedron and has conjectured a quantitative relationship between the numbers of vertices with different vertex configurations in any orthogonal pseudo-polyhedron. This conjecture, if proved to be true, will be useful for gaining insight into the structure of any orthogonal pseudo-polyhedron involved in many 3-dimensional computational geometrical problems. Finally the thesis has also described a new method for splitting orthogonal polygon iv using a polyline and a new method for splitting an orthogonal polyhedron using a polyplane. These algorithms are useful in applications such as metal fabrication