Search results for: emergy algebra

Authors: Jean-Marie Vilaire, Ricardo Abreu-Blaya, Juan Bory-Reyes

Abstract:

The classical Beltrami system of elliptic equations generalizes the Cauchy Riemann equation in the complex plane and offers the possibility to consider homogeneous system with no terms of zero order. The theory of Douglis-valued functions, called Hyper-analytic functions, is special case of the above situation. In this note, we prove an analogue of the N. Davydov theorem in the framework of the theory of hyperanalytic functions. The used methodology contemplates characteristic methods of the hypercomplex analysis as well as the singular integral operators and elliptic systems of the partial differential equations theories.

Keywords: Beltrami equation, Douglis algebra-valued function, Hypercomplex Cauchy type integral, Sokhotski-Plemelj formulae

Procedia PDF Downloads 248

Authors: Abigail Gragg

Abstract:

The goal of this research study was to adjudicate if implementing Howard Gardner’s multiple levels of intelligence would enhance student achievement levels in an Algebra 1 College Preparatory class. This was conducted within every class by incorporating one level of the eight levels of intelligence into small group work in stations. Every class was conducted utilizing small-group instruction. Achievement levels were measured through various forms of collected data that expressed student understandings in class through formative assessments versus student understandings on summative assessments. The data samples included: assessments (i.e. summative and formative assessments), observable data, video recordings, a daily log book, student surveys, and checklists kept during the observation periods. Formative assessments were analyzed during each class period to measure in-class understanding. Summative assessments were dissected per question per accuracy to review the effects of each intelligence implemented. The data was collated into a coding workbook for further analysis to conclude the resulting themes of the research. These themes include 1) there was no correlation to multiple levels of intelligence enhancing student achievement, 2) bodily-kinesthetic intelligence showed to be the intelligence that had the most improvement on test questions and 3) out of all of the bits of intelligence, interpersonal intelligence enhanced student understanding in class.

Keywords: stations, small group instruction, multiple levels of intelligence, Mathematics, Algebra 1, student achievement, secondary school, instructional Pedagogies

Procedia PDF Downloads 110

Authors: Natália Maria Rego

Abstract:

ALeibnizn-algebraGis aK-vector space endowed whit a n-linearbracket operation [-,…-] : GG … G→ Gsatisfying the fundamental identity, which can be expressed saying that the right multiplication map Ry2, …, ᵧₙ: Gn→ G, Rᵧ₂, …, ᵧₙn(ˣ¹, …, ₓₙ) = [[ˣ¹, …, ₓₙ], ᵧ₂, …, ᵧₙ], is a derivation. This structure, together with its skew-symmetric version, named as Lie n-algebra or Filippov algebra, arose in the setting of Nambumechanics, an n-ary generalization of the Hamiltonian mechanics. Thefirst goal of this work is to provide a characterization of various classes of central extensions of Leibniz n-algebras in terms of homological properties. Namely, Commutator extension, Quasi-commutator extension, Stem extension, and Stem cover. These kind of central extensions are characterized by means of the character of the map *(E): nHL1(G) → M provided by the five-term exact sequence in homology with trivial coefficients of Leibniz n-algebras associated to an extension E : 0 → M → K → G → 0. For a free presentation 0 →R→ F →G→ 0of a Leibniz n-algebra G,the term M(G) = (R[F,…n.., F])/[R, F,..n-1..,F] is called the Schur multiplier of G, which is a Baer invariant, i.e., it does not depend on the chosen free presentation, and it is isomorphic to the first Leibniz n-algebras homology with trivial coefficients of G. A central extension of Leibniz n-algebras is a short exact sequenceE : 0 →M→K→G→ 0such that [M, K,.. ⁿ⁻¹.., K]=0. It is said to be a stem extension if M⊆[G, .. n.., G]. Additionally, if the induced map M(K) → M(G) is the zero map, then the stem extension Eis said to be a stem cover. The second aim of this work is to analyze the interplay between stem covers of Leibniz n-algebras and the Schur multiplier. Concretely, in the case of finite-dimensional Leibniz n-algebras, we show the existence of coverings, and we prove that all stem covers with finite-dimensional Schur multiplier are isoclinic. Additionally, we characterize stem covers of perfect Leibniz n-algebras.

Keywords: leibniz n-algebras, central extensions, Schur multiplier, stem cover

Procedia PDF Downloads 157

Authors: Yasaman Azarmjoo

Abstract:

Since ancient times, it has been said that mathematics is the mother of all sciences and the foundation of basic concepts in every field and profession. It would be great if, after learning this subject, we could enable students to create games and activities based on the same mathematical concepts. This article explores the design of various mathematical activities in the form of games, utilizing different mathematical topics such as algebra, equations, binary systems, and one-to-one correspondence. The theoretical significance of this article lies in uncovering alternative approaches to teaching and learning mathematics. By employing creative and interactive methods such as game design, it challenges the traditional perception of mathematics as a difficult and laborious subject. The theoretical significance of this article lies in demonstrating that mathematics can be made more accessible and enjoyable, which can result in heightened interest and engagement in the subject. In general, this article reveals another aspect of mathematics.

Keywords: playing with mathematics, algebra and equations, binary systems, one-to-one correspondence

Procedia PDF Downloads 92

Authors: Pascal Roubides

Abstract:

The presentation proposed herein describes a research case study of a hybrid application of the competency-based education model best exemplified by Western Governor’s University, within the general temporal confines of an accelerated (8-week) term of a College Algebra course at the author’s institution. A competency-based model was applied to an accelerated online College Algebra course, built as an Open Educational Resources (OER) course, seeking quantifiable evidence of any differences in the academic achievement of students enrolled in the competency-based course and the academic achievement of the current delivery of the same course. Competency-based learning has been gaining in support in recent times and the author’s institution has also been involved in its own efforts to design and develop courses based on this approach. However, it is unknown whether there had been any research conducted to quantify evidence of the effect of this approach against traditional approaches prior to the author’s case study. The research question sought to answer in this experimental quantitative study was whether the online College Algebra curriculum at the author’s institution delivered via an OER-based competency-based model can produce statistically significant improvement in retention and success rates against the current delivery of the same course. Results obtained in this study showed that there is no statistical difference in the retention rate of the two groups. However, there was a statistically significant difference found between the rates of successful completion of students in the experimental group versus those in the control group.

Keywords: competency-based learning, online mathematics, online math education, online courses

Procedia PDF Downloads 128

Authors: Kailash Ghimire, Manoj Thapa

Abstract:

This study focuses on early identification of deficiencies in pre-required areas of students who are enrolled in College Algebra and Calculus I classes. The students were given pre-diagnostic tests on the first day of the class before they are provided with the syllabus. The tests consist of prerequisite, uniform and advanced content outlined by the University System of Georgia (USG). The results show that 48% of students in College Algebra are lacking prerequisite skills while 52% of Calculus I students are lacking prerequisite skills but, interestingly these students are prior exposed to uniform content and advanced content. The study is still in progress and this paper contains the outcome from Fall 2017 and Spring 2018. In this paper, early intervention used in these classes: two days vs three days meeting a week and students’ self-assessment using exam wrappers and their effectiveness on students’ learning will also be discussed. A result of this study shows that there is an improvement on Drop, Fail and Withdraw (DFW) rates by 7%-10% compared to those in previous semesters.

Keywords: student at risk, diagnostic tests, identification, intervention, normalization gain, validity of tests

Procedia PDF Downloads 208

Authors: Shouji Yujiro, Memei Dukovic, Mist Yakubu

Abstract:

Fields are important objects of study in algebra since they provide a useful generalization of many number systems, such as the rational numbers, real numbers, and complex numbers. In particular, the usual rules of associativity, commutativity and distributivity hold. Fields also appear in many other areas of mathematics; see the examples below. When abstract algebra was first being developed, the definition of a field usually did not include commutativity of multiplication, and what we today call a field would have been called either a commutative field or a rational domain. In contemporary usage, a field is always commutative. A structure which satisfies all the properties of a field except possibly for commutativity, is today called a division ring ordivision algebra or sometimes a skew field. Also non-commutative field is still widely used. In French, fields are called corps (literally, body), generally regardless of their commutativity. When necessary, a (commutative) field is called corps commutative and a skew field-corps gauche. The German word for body is Körper and this word is used to denote fields; hence the use of the blackboard bold to denote a field. The concept of fields was first (implicitly) used to prove that there is no general formula expressing in terms of radicals the roots of a polynomial with rational coefficients of degree 5 or higher. An extension of a field k is just a field K containing k as a subfield. One distinguishes between extensions having various qualities. For example, an extension K of a field k is called algebraic, if every element of K is a root of some polynomial with coefficients in k. Otherwise, the extension is called transcendental. The aim of Galois Theory is the study of algebraic extensions of a field. Given a field k, various kinds of closures of k may be introduced. For example, the algebraic closure, the separable closure, the cyclic closure et cetera. The idea is always the same: If P is a property of fields, then a P-closure of k is a field K containing k, having property, and which is minimal in the sense that no proper subfield of K that contains k has property P. For example if we take P (K) to be the property ‘every non-constant polynomial f in K[t] has a root in K’, then a P-closure of k is just an algebraic closure of k. In general, if P-closures exist for some property P and field k, they are all isomorphic. However, there is in general no preferable isomorphism between two closures.

Keywords: field theory, mechanic maths, supertech, rolltech

Procedia PDF Downloads 372

Authors: Verónica Díaz Quezada

Abstract:

The importance given to the development of the problem solving skill and the requirement to solve problems framed in mathematical or real life contexts, in practice, they are not evidence in relation to the teaching of proportional variations. This qualitative and descriptive study aims to (1) to improve problem solving ability of high school students in Chile, (ii) to elaborate and describe a didactic intervention strategy based on learning situations in proportional variations, focused on solving types of routine problems of various contexts and non-routine problems. For this purpose, participant observation was conducted, test of mathematics problems and an opinion questionnaire to thirty-six high school students. Through the results, the highest academic performance is evidenced in the routine problems of purely mathematical context, realistic, fantasy context, and non-routine problems, except in the routine problems of real context and compound proportionality problems. The results highlight the need to consider in the curriculum different types of problems in the teaching of mathematics that relate the discipline to everyday life situations

Keywords: algebra, high school, proportion variations, nonroutine problem solving, routine problem solving

Procedia PDF Downloads 139

Authors: David C. Ni

Abstract:

The current efforts for Grand Unification Theory (GUT) can be classified into General Relativity, Quantum Mechanics, String Theory and the related formalisms. In the geometric approaches for extending General Relativity, the efforts are establishing global and local invariance embedded into metric formalisms, thereby additional dimensions are constructed for unifying canonical formulations, such as Hamiltonian and Lagrangian formulations. The approaches of extending Quantum Mechanics adopt symmetry principle to formulate algebra-group theories, which evolved from Maxwell formulation to Yang-Mills non-abelian gauge formulation, and thereafter manifested the Standard model. This thread of efforts has been constructing super-symmetry for mapping fermion and boson as well as gluon and graviton. The efforts of String theory currently have been evolving to so-called gauge/gravity correspondence, particularly the equivalence between type IIB string theory compactified on AdS5 × S5 and N = 4 supersymmetric Yang-Mills theory. Other efforts are also adopting cross-breeding approaches of above three formalisms as well as competing formalisms, nevertheless, the related symmetries, dualities, and correspondences are outlined as principles and techniques even these terminologies are defined diversely and often generally coined as duality. In this paper, we firstly classify these dualities from the perspective of physics. Then examine the hierarchical structure of classes from mathematical perspective referring to Coleman-Mandula theorem, Hidden Local Symmetry, Groupoid-Categorization and others. Based on Fundamental Theorems of Algebra, we argue that rather imposing effective constraints on different algebras and the related extensions, which are mainly constructed by self-breeding or self-mapping methodologies for sustaining invariance, we propose a new addition, momentum-angular momentum duality at the level of electromagnetic duality, for rationalizing the duality algebras, and then characterize this duality numerically with attempt for addressing some unsolved problems in physics and astrophysics.

Keywords: general relativity, quantum mechanics, string theory, duality, symmetry, correspondence, algebra, momentum-angular-momentum

Procedia PDF Downloads 396

Authors: Soofia Malik

Abstract:

The purpose of this study is to develop an instrument to measure undergraduate students’ attitudes toward mathematics (MAT) and to assess the data collected from the instrument for validity and reliability. The instrument is developed using five subscales: anxiety, enjoyment, self-confidence, value, and technology. The technology dimension is added as the fifth subscale of attitude toward mathematics because of the recent trend of incorporating online homework in mathematics courses as well as due to heavy reliance of higher education on using online learning management systems, such as Blackboard and Moodle. The sample consists of 163 (M = 82, F = 81) undergraduates enrolled in College Algebra course in the summer 2017 semester at a university in the USA. The data is analyzed to answer the research question: if and how do undergraduate students’ attitudes toward mathematics load using Principal Components Analysis (PCA)? As a result of PCA, three subscales emerged namely: anxiety/self-confidence scale, enjoyment, and value scale. After deleting the last five items or the last two subscales from the initial MAT scale, the Cronbach’s alpha was recalculated using the scores from 20 items and was found to be α = .95. It is important to note that the reliability of the initial MAT form was α = .93. This means that employing the final MAT survey form would yield consistent results in repeated uses. The final MAT form is, therefore, more reliable as compared to the initial MAT form.

Keywords: college algebra, Cronbach's alpha reliability coefficient, Principal Components Analysis, PCA, technology in mathematics

Procedia PDF Downloads 123

Authors: M. H. M. Rashid

Abstract:

Given H a Hilbert space and B(H) the algebra of bounded linear operator in H, let δAB denote the generalized derivation defined by A and B. The main objective of this article is to study Weyl type theorems for generalized derivation for (A,B) satisfying a couple of Fuglede.

Keywords: Fuglede Property, Weyl’s theorem, generalized derivation, Aluthge transform

Procedia PDF Downloads 127

Authors: Shai Sarussi

Abstract:

Suppose F is a field with valuation v and valuation domain Oᵥ, and R is an Oᵥ-algebra. It is known that there exists a filter quasi-valuation on R; the existence of a quasi-valuation yields several important connections between Oᵥ and R, in particular with respect to their prime spectra. In this paper, the notion of a module valuation is introduced. It is shown that any torsion-free module over Oᵥ has an induced module valuation. Moreover, several results connecting the filter quasi-valuation and module valuations are presented.

Keywords: valuations, quasi-valuations, prime spectrum, algebras over valuation domains

Procedia PDF Downloads 223

Authors: Kankeyanathan Kannan

Abstract:

On approximation properties of group C* algebras is everywhere; it is powerful, important, backbone of countless breakthroughs. For a discrete group G, let A(G) denote its Fourier algebra, and let M₀A(G) denote the space of completely bounded Fourier multipliers on G. An approximate identity on G is a sequence (Φn) of finitely supported functions such that (Φn) uniformly converge to constant function 1 In this paper we prove that approximation property pass to free product.

Keywords: approximation property, weakly amenable, strong invariant approximation property, invariant approximation property

Procedia PDF Downloads 675

Authors: Shai Sarussi

Abstract:

Let S be an integral domain with field of fractions F and let A be an F-algebra. An S-subalgebra R of A is called S-nice if R∩F = S and the localization of R with respect to S \{0} is A. Denoting by W the set of all S-nice subalgebras of A, and defining a notion of open sets on W, one can view W as a T0-Alexandroff space. A characterization of the property of immediate neighbors in an Alexandroff topological space is given, in terms of closed and open subsets of appropriate subspaces. Moreover, two special subspaces of W are introduced, and a way in which their closed and open subsets induce W is presented.

Keywords: integral domains, Alexandroff topology, immediate neighbors, valuation domains

Procedia PDF Downloads 176

Authors: Michael Lousis

Abstract:

Mathematical competence is the great aim of every mathematical teaching and learning endeavour. This can be defined as an idealised conceptualisation of the quality of cognition and the ability of implementation in practice of the mathematical subject matter, which is included in the curriculum, and is displayed only through performance of doing mathematics. The present study gives a clear definition of mathematical competence in the domains of Arithmetic and Algebra that stems from the explanation of the learners’ errors in these domains. The learners, whose errors are explained, were Greek and English participants of a large, international, longitudinal, comparative research program entitled the Kassel Project. The participants’ errors emerged as results of their work in dealing with mathematical questions and problems of the tests, which were presented to them. The construction of the tests was such as only the outcomes of the participants’ work was to be encompassed and not their course of thinking, which resulted in these outcomes. The intention was that the tests had to provide undeviating comparable results and simultaneously avoid any probable bias. Any bias could stem from obtaining results by involving so many markers from different countries and cultures, with so many different belief systems concerning the assessment of learners’ course of thinking. In this way the validity of the research was protected. This fact forced the implementation of specific research methods and theoretical prospects to take place in order the participants’ erroneous way of thinking to be disclosed. These were Methodological Pragmatism, Symbolic Interactionism, Philosophy of Mind and the ideas of Computationalism, which were used for deciding and establishing the grounds of the adequacy and legitimacy of the obtained kinds of knowledge through the explanations given by the error analysis. The employment of this methodology and of these theoretical prospects resulted in the definition of the learners’ mathematical competence, which is the thesis of the present study. Thus, learners’ mathematical competence is depending upon three key elements that should be developed in their minds: appropriate representations, appropriate meaning, and appropriate developed schemata. This definition then determined the development of appropriate teaching practices and interventions conducive to the achievement and finally the entailment of mathematical competence.

Keywords: representations, meaning, appropriate developed schemata, computationalism, error analysis, explanations for the probable causes of the errors, Kassel Project, mathematical competence

Procedia PDF Downloads 268

Authors: Yousuf Alkhezi

Abstract:

Since most of the literature on algebra does not make much deal with the special case of mapping cone. This paper is an alternative way to examine the special tensor product and mapping cone. Also, we show that the isomorphism that implies the mapping cone commutes with the tensor product for the ordinary tensor product no longer holds for the pinched tensor product. However, we show there is a morphism. We will introduce an alternative way of mapping cone. We are looking for more properties which is our future project. Also, we want to apply these new properties in some application. Many results and examples with classical algorithms will be provided.

Keywords: complex, tensor product, pinched tensore product, mapping cone

Procedia PDF Downloads 128

Authors: U. M. Swamy

Abstract:

A compact Hausdorff and totally disconnected topological space are known as Boolean space in view of the stone duality between Boolean algebras and such topological spaces. A sheaf over X is a triple (S, p, X) where S and X are topological spaces and p is a local homeomorphism of S onto X (that is, for each element s in S, there exist open sets U and G containing s and p(s) in S and X respectively such that the restriction of p to U is a homeomorphism of U onto G). Here we mainly concern on sheaves over Boolean spaces. From a given sheaf over a Boolean space, we obtain an algebraic structure in such a way that there is a one-to-one correspondence between these algebraic structures and sheaves over Boolean spaces.

Keywords: Boolean algebra, Boolean space, sheaf, stone duality

Procedia PDF Downloads 348

Authors: Liliana O. Martínez, Juan E González, Manuel Ramírez-Aranda, Ana Cervantes-Herrera

Abstract:

A serious game category mobile application called Math Dominoes is presented. The main objective of this applications is to strengthen the teaching-learning process of solving algebraic equations and is based on the board game "Double 6" dominoes. Math Dominoes allows the practice of solving first, second-, and third-degree algebraic equations. This application is aimed to students who seek to strengthen their skills in solving algebraic equations in a dynamic, interactive, and fun way, to reduce the risk of failure in subsequent courses that require mastery of this algebraic tool.

Keywords: algebra, equations, dominoes, serious games

Procedia PDF Downloads 129

Authors: Hiba Naccache

Abstract:

The present research investigated whether gender differences affect performance in a simple math quiz in statistics course. Participants of this study comprised a sample of 567 statistics students in two different universities in Lebanon. Data were collected through a simple math quiz. Analysis of quantitative data indicated that there wasn’t a significant difference in math performance between males and females. The results suggest that improvements in student performance may depend on improved mastery of basic algebra especially for females. The implications of these findings and further recommendations were discussed.

Keywords: gender, education, math, statistics

Procedia PDF Downloads 376

Authors: Larry Wang

Abstract:

The aim of this paper is to demonstrate how an online homework system is integrated in teaching and learning mathematics and how it improves the student success rates in some gateway mathematics courses. WeBWork provided by the Mathematical Association of America is adopted as the online homework system. During the period of 2010-2015, the system was implemented in classes of precalculus, calculus, probability and statistics, discrete mathematics, linear algebra, and differential equations. As a result, the passing rates of the sections with WeBWork are well above other sections without WeBWork (about 7-10% higher). The paper also shows how the WeBWork system was used.

Keywords: gateway mathematics, online grading, pass rate, WeBWorK

Procedia PDF Downloads 298

Authors: Gete Umbrey, Saifur Rahman

Abstract:

Graphs are found to be most capable in computing, and its abstract structures have been applied in some specific computations and algorithms like in phase encoding controller, processor microcontroller, and synthesis of a CMOS switching network, etc. Being motivated by these works, we develop an independent approach to study semiring structures and various properties by defining the binary operations which in fact, seems analogous to an existing definition in some sense but with a different approach. This work emphasizes specifically on the construction of semigroup and semiring structures on the set of undirected graphs, and their properties are investigated therein. It is expected that the investigation done here may have some interesting applications in theoretical computer science, networking and decision making, and also on joining of two network systems.

Keywords: graphs, join and union of graphs, semiring, weighted graphs

Procedia PDF Downloads 148

Authors: Mitat Uysal, Aynur Uysal

Abstract:

Artificial Intelligence (AI) is fundamentally driven by mathematics, with many of its core algorithms rooted in mathematical principles such as linear algebra, probability theory, calculus, and optimization techniques. This paper explores the deep connection between AI and mathematics, highlighting the role of mathematical concepts in key AI techniques like machine learning, neural networks, and optimization. To demonstrate this connection, a case study involving the implementation of a neural network using Python is presented. This practical example illustrates the essential role that mathematics plays in training a model and solving real-world problems.

Keywords: AI, mathematics, machine learning, optimization techniques, image processing

Procedia PDF Downloads 14

Authors: Ibrahim Özbek, Erdoğan Mehmet Özkan

Abstract:

In this study, we generalize (k,n) threshold secret sharing scheme on the study Ozbek and Siap to the codes over the ring Fq+ αFq. In this way, it is mentioned that the method obtained in that article can also be used on codes over rings, and new advantages to be obtained. The method of securely sharing the key in cryptography, which Shamir first systematized and Massey carried over to codes, became usable for all error-correcting codes. The firewall of this scheme is based on the hardness of the syndrome decoding problem. Also, an open study area is left for those working for other rings and code classes. All codes that correct errors with this method have been the working area of this method.

Keywords: secret sharing scheme, linear codes, algebra, finite rings

Procedia PDF Downloads 72

Authors: Justin Fu, Thomas Mazzuchi, Shahram Sarkani

Abstract:

A key factor in technological immaturity in defense weapons acquisition is lack of understanding critical integrations at the subsystem and component level. To address this shortfall, recent research in integration readiness level (IRL) combines with technology readiness level (TRL) to form a system readiness level (SRL). SRL can be enriched with more robust quantitative methods to provide the program manager a useful tool prior to committing to major weapons acquisition programs. This research harnesses previous mathematical models based on graph theory, Petri nets, and tropical algebra and proposes a modification of the desirable SRL mathematical properties such that a tightly integrated (multitude of interfaces) subsystem can display a lower SRL than an inherently less coupled subsystem. The synthesis of these methods informs an improved decision tool for the program manager to commit to expensive technology development. This research ties the separately developed manufacturing readiness level (MRL) into the network representation of the system and addresses shortfalls in previous frameworks, including the lack of integration weighting and the over-importance of a single extremely immature component. Tropical algebra (based on the minimum of a set of TRLs or IRLs) allows one low IRL or TRL value to diminish the SRL of the entire system, which may not be reflective of actuality if that component is not critical or tightly coupled. Integration connections can be weighted according to importance and readiness levels are modified to be a cardinal scale (based on an analytic hierarchy process). Integration arcs’ importance are dependent on the connected nodes and the additional integrations arcs connected to those nodes. Lack of integration is not represented by zero, but by a perfect integration maturity value. Naturally, the importance (or weight) of such an arc would be zero. To further explore the impact of grouping subsystems, a multi-objective genetic algorithm is then used to find various clusters or communities that can be optimized for the most representative subsystem SRL. This novel calculation is then benchmarked through simulation and using past defense acquisition program data, focusing on the newly introduced Middle Tier of Acquisition (rapidly field prototypes). The model remains a relatively simple, accessible tool, but at higher fidelity and validated with past data for the program manager to decide major defense acquisition program milestones.

Keywords: readiness, maturity, system, integration

Procedia PDF Downloads 92

Authors: Shai Sarussi

Abstract:

Let S be an integral domain with field of fractions F and let A be an F-algebra. An S-subalgebra R of A is called S-nice if R∩F = S and the localization of R with respect to S \{0} is A. Denoting by W the set of all S-nice subalgebras of A, and defining a notion of open sets on W, one can view W as a T0-Alexandroff space. Thus, the algebraic structure of W can be viewed from the point of view of topology. It is shown that every nonempty open subset of W has a maximal element in it, which is also a maximal element of W. Moreover, a supremum of an irreducible subset of W always exists. As a notable connection with valuation theory, one considers the case in which S is a valuation domain and A is an algebraic field extension of F; if S is indecomposed in A, then W is an irreducible topological space, and W contains a greatest element.

Keywords: integral domains, Alexandroff topology, prime spectrum of a ring, valuation domains

Procedia PDF Downloads 130

Authors: Sumeyra Karatas, Veysel Karatas, Reyhan Safak, Gamze Bulut-Ozturk, Ozgul Kartal

Abstract:

Productive struggle entails a student's cognitive exertion to comprehend mathematical concepts and uncover solutions not immediately apparent. The significance of productive struggle in learning mathematics is accentuated by influential educational theorists, emphasizing its necessity for learning mathematics with understanding. Consequently, supporting productive struggle in learning mathematics is recognized as a high-leverage and effective mathematics teaching practice. In this study, the investigation into the role of productive struggle in learning mathematics led to the development of a comprehensive rubric for productive struggle pedagogy through an exhaustive literature review. The rubric consists of eight primary criteria and 37 sub-criteria, providing a detailed description of teacher actions and pedagogical choices that foster students' productive struggles. These criteria encompass various pedagogical aspects, including task design, tool implementation, allowing time for struggle, posing questions, scaffolding, handling mistakes, acknowledging efforts, and facilitating discussion/feedback. Utilizing this rubric, a team of researchers and teachers designed eight 90-minute lesson plans, employing a productive struggle pedagogy, for a two-week unit on solving systems of linear equations. Simultaneously, another set of eight lesson plans on the same topic, featuring identical content and problems but employing a traditional lecture-and-practice model, was designed by the same team. The objective was to assess the impact of supporting productive struggle on students' mathematics learning, defined by the strands of mathematical proficiency. This quasi-experimental study compares the control group, which received traditional lecture- and practice instruction, with the treatment group, which experienced a productive struggle in pedagogy. Sixty-six 10th and 11th-grade students from two algebra classes, taught by the same teacher at a high school, underwent either the productive struggle pedagogy or lecture-and-practice approach over two-week eight 90-minute class sessions. To measure students' learning, an assessment was created and validated by a team of researchers and teachers. It comprised seven open-response problems assessing the strands of mathematical proficiency: procedural and conceptual understanding, strategic competence, and adaptive reasoning on the topic. The test was administered at the beginning and end of the two weeks as pre-and post-test. Students' solutions underwent scoring using an established rubric, subjected to expert validation and an inter-rater reliability process involving multiple criteria for each problem based on their steps and procedures. An analysis of covariance (ANCOVA) was conducted to examine the differences between the control group, which received traditional pedagogy, and the treatment group, exposed to the productive struggle pedagogy, on the post-test scores while controlling for the pre-test. The results indicated a significant effect of treatment on post-test scores for procedural understanding (F(2, 63) = 10.47, p < .001), strategic competence (F(2, 63) = 9.92, p < .001), adaptive reasoning (F(2, 63) = 10.69, p < .001), and conceptual understanding (F(2, 63) = 10.06, p < .001), controlling for pre-test scores. This demonstrates the positive impact of supporting productive struggle in learning mathematics. In conclusion, the results revealed the significance of the role of productive struggle in learning mathematics. The study further explored the practical application of productive struggle through the development of a comprehensive rubric describing the pedagogy of supporting productive struggle.

Keywords: effective mathematics teaching practice, high school algebra, learning mathematics, productive struggle

Procedia PDF Downloads 51

Authors: Ilqar Ramazanli

Abstract:

The matrix completion problem has been studied broadly under many underlying conditions. The problem has been explored under adaptive or non-adaptive, exact or estimation, single-phase or multi-phase, and many other categories. In most of these cases, the observation cost of each entry is uniform and has the same cost across the columns. However, in many real-life scenarios, we could expect elements from distinct columns or distinct positions to have a different cost. In this paper, we explore this generalization under adaptive conditions. We approach the problem under two different cost models. The first one is that entries from different columns have different observation costs, but within the same column, each entry has a uniform cost. The second one is any two entry has different observation cost, despite being the same or different columns. We provide complexity analysis of our algorithms and provide tightness guarantees.

Keywords: matroid optimization, matrix completion, linear algebra, algorithms

Procedia PDF Downloads 108

Authors: Mueller Jann, Hoffmann Christian Hugo

Abstract:

Conventional quantitative risk management in banking is a risk factor of its own, because it rests on assumptions such as independence and availability of data which do not hold when rare events of extreme consequences are involved. There is a growing recognition of the need for alternative risk measures that do not make these assumptions. We propose a novel method for modeling the risk associated with investment products, in particular derivatives, by using a formal language for specifying financial contracts. Expressions in this language are interpreted in the category of values annotated with (a formal representation of) uncertainty. The choice of uncertainty formalism thus becomes a parameter of the model, so it can be adapted to the particular application and it is not constrained to classical probabilities. We demonstrate our approach using a simple logic-based uncertainty model and a case study in which we assess the risk of counter party default in a portfolio of collateralized loans.

Keywords: risk model, uncertainty monad, derivatives, contract algebra

Procedia PDF Downloads 575

Authors: Sharjeel Aslam, Vassil Vassilev, Karim Ouazzane

Abstract:

Ontologies and various semantic repositories became a convenient approach for implementing model-driven architectures of distributed systems on the Web. SPARQL is the standard query language for querying such. However, although SPARQL is well-established standard for querying semantic repositories in RDF and OWL format and there are commonly used APIs which supports it, like Jena for Java, its parallel option is not incorporated in them. This article presents a complete framework consisting of an object algebra for parallel RDF and an index-based implementation of the parallel query engine capable of dealing with the distributed RDF ontologies which share common vocabulary. It has been implemented in Java, and for validation of the algorithms has been applied to the problem of organizing virtual exhibitions on the Web.

Keywords: distributed ontologies, parallel querying, semantic indexing, shared vocabulary, SPARQL

Procedia PDF Downloads 203

Authors: Nileshkumar Vishnav, Aditya Tatu

Abstract:

A recent approach of representing graph signals and graph filters as polynomials is useful for graph signal processing. In this approach, the adjacency matrix plays pivotal role; instead of the more common approach involving graph-Laplacian. In this work, we follow the adjacency matrix based approach and corresponding algebraic signal model. We further expand the theory and introduce the concept of similarity of two graphs. The similarity of graphs is useful in that key properties (such as filter-response, algebra related to graph) get transferred from one graph to another. We demonstrate potential applications of the relation between two similar graphs, such as nonuniform filter design, DTMF detection and signal reconstruction.

Keywords: graph signal processing, algebraic signal processing, graph similarity, isospectral graphs, nonuniform signal processing

Procedia PDF Downloads 351