Penerapan Fuzzy Mamdani Dalam Menentukan Pencapaian Keberhasilan Mengajar Guru MI Mambaul Ulum Al-Amin Sampit

Current problems often do not have certain answers. The use of fuzzy mamdani logic to determine a level of achievement of the success of the teacher in teaching students at MI Mambaul Ulum Al Amin Sampit is the content of this paper. The problem will be solved by determining the level of achievement of the teacher's success in teaching students, if only two input variables are used, namely the teacher and also the value. So the first thing to solve the problem of the level of achievement of teacher success in teaching through the fuzzy mamdani method is to determine the input and output variables of a firm set. The second thing is changing the input variables into fuzzy sets through fuzzyfication. The third thing is processing data from fuzzy sets using the maximum system. The last or fourth thing is changing the results issued into a firm set through defuzzyfication with the centroid method, so the results are as desired in the output variable. The calculation of fuzzy mamdani results in an achievement level of success for MI teachers with a teacher variable value of 55 and a variable value of 80

About the imperial constitutions issued in Serdica. The imperial constitutions for the Orient and the Occident

Imperial constitutions make the basic source of Roman law in the period of the Principate or the Dominate. They present the Roman manner of unifying multicultural law of the Empire, consisting of various legislative practices and organization of the judiciary, in which it was necessary to solve different problems resulting from managing the state. Following the division of the Empire into the eastern and the western parts, there arose the problem of securing legal power of constitutions implemented by one of the rulers to be binding on the whole territory of the Empire still treated as one whole body. The analysis of the imperial constitutions introduced in the Serdica of old provides certain answers in this respect.The city appears to have been one of the temporal capitals of the Empire in the East, while awaiting Constantine who would confirm its key position by uttering the words: “Serdica mea Roma est”. In the years 2011-2012, in the University of Sofia there was a scientific project run, whose goal was to present the palingenesis of the imperial legislation enacted in Serdica as well as the position of the city in the period of late Empire. Apart from this, it was attempted to prove that the imperial law remained ‘alive’ in the uneasy period between the end to the 3rd century and the beginning of the 4th century. The analysis of the kinds of constitutions and their content allows us to discover the first stages of deep transformations of the Emperor’s power, which occurred at that time, as well as to get to know about the realization of the reforms launched by Diocletian and implemented until the rule of Constantine. First of all, we can see the picture of Emperor Constantine the Great – legislator, administrator, judge, who would promote abiding by the Emperor’s cult in the time when Christianity was winning more and more stable position in the Empire. The Edict of Tolerance, which was issued by Galerius in Serdica on 30 April 311 CE, should be regarded as the one laying the foundations of legislature favourable to Christians and, at the same time, opening the door to passing the Edict of Milan in 313 CE.

Knowledge-Preserving Certain Answers for SQL-like Queries

Answering queries over incomplete data is based on finding answers that are certainly true, independently of how missing values are interpreted. This informal description has given rise to several different mathematical definitions of certainty. To unify them, a framework based on "explanations", or extra information about incomplete data, was recently proposed. It partly succeeded in justifying query answering methods for relational databases under set semantics, but had two major limitations. First, it was firmly tied to the set data model, and a fixed way of comparing incomplete databases with respect to their information content. These assumptions fail for real-life database queries in languages such as SQL that use bag semantics instead. Second, it was restricted to queries that only manipulate data, while in practice most analytical SQL queries invent new values, typically via arithmetic operations and aggregation. To leverage our understanding of the notion of certainty for queries in SQL-like languages, we consider incomplete databases whose information content may be enriched by additional knowledge. The knowledge order among them is derived from their semantics, rather than being fixed a priori. The resulting framework allows us to capture and justify existing notions of certainty, and extend these concepts to other data models and query languages. As natural applications, we provide for the first time a well-founded definition of certain answers for the relational bag data model and for value-inventing queries on incomplete databases, addressing the key shortcomings of previous approaches.

Conceptual Ethics and the Methodology of Normative Inquiry

This chapter explores two central questions in the conceptual ethics of normative inquiry. The first is whether to orient one’s normative inquiry around folk normative concepts (like KNOWLEDGE or IMMORAL) or around theoretical normative concepts (like ADEQUATE EPISTEMIC JUSTIFICATION or PRO TANTO PRACTICAL REASON). The second is whether to orient one’s normative inquiry around concepts whose normative authority is especially accessible to us (such as OUGHT ALL THINGS CONSIDERED), or around concepts whose extension is especially accessible to us (such as BETRAYAL). The chapter aims to make vivid and plausible a range of possible answers to these questions, and important forms of argument that can be used to favor certain answers over others.

Experience and Teaching at Polytechnic University of Tirana

This paper is based on treating several issues related to observing proficiency of English Language for Specific Purposes at Polytechnic University. It presents the findings and analysis on how English for Engineering and Technology Students can be taught so that to develop not only language proficiency, but also technical skills and competences. The research provides certain answers to some of the relevant questions: How can they acquire their knowledge and skills for their future work? Do students have the required professional competences for the market? Do the programmes and content of the curricula meet the standards and requirements of the development for the new on-going technology? The research aims to differentiate between these potential determinants by asking respondents on their needs in order to link the findings to technological specifics and impact within ESP education. The research concludes, into some recommendations linked with implementation of the principles on ESP competence and skills at the Polytechnic University for further improving teaching methods, materials and techniques in order to develop the professional competences in parallel with linguistic and technical skills.

Best Answers over Incomplete Data : Complexity and First-Order Rewritings

Answering queries over incomplete data is ubiquitous in data management and in many AI applications that use query rewriting to take advantage of relational database technology. In these scenarios one lacks full information on the data but queries still need to be answered with certainty. The certainty aspect often makes query answering unfeasible except for restricted classes, such as unions of conjunctive queries. In addition often there are no, or very few certain answers, thus expensive computation is in vain. Therefore we study a relaxation of certain answers called best answers. They are defined as those answers for which there is no better one (that is, no answer true in more possible worlds). When certain answers exist the two notions coincide. We compare different ways of casting query answering as a decision problem and characterise its complexity for first-order queries, showing significant differences in the behavior of best and certain answers.We then restrict attention to best answers for unions of conjunctive queries and produce a practical algorithm for finding them based on query rewriting techniques.