Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 32

# Search results for: Golomb-Welch conjecture

##### 32 A Method for solving Legendre's Conjecture

Authors: Hashem Sazegar

Abstract:

Legendre’s conjecture states that there is a prime number between n^2 and (n + 1)^2 for every positive integer n. In this paper we prove that every composite number between n2 and (n + 1)2 can be written u^2 − v^2 or u^2 − v^2 + u − v that u > 0 and v ≥ 0. Using these result as well as induction and residues (modq) we prove Legendre’s conjecture. Downloads 283
##### 31 A Proof for Goldbach's Conjecture

Authors: Hashem Sazegar

Abstract:

In 1937, Vinograd of Russian Mathematician proved that each odd large number can be shown by three primes. In 1973, Chen Jingrun proved that each odd number can be shown by one prime plus a number that has maximum two primes. In this article, we state one proof for Goldbach’conjecture. Introduction: Bertrand’s postulate state for every positive integer n, there is always at least one prime p, such that n < p < 2n. This was first proved by Chebyshev in 1850, which is why postulate is also called the Bertrand-Chebyshev theorem. Legendre’s conjecture states that there is a prime between n2 and (n+1)2 for every positive integer n, which is one of the four Landau’s problems. The rest of these four basic problems are; (i) Twin prime conjecture: There are infinitely many primes p such that p+2 is a prime. (ii) Goldbach’s conjecture: Every even integer n > 2 can be written asthe sum of two primes. (iii) Are there infinitely many primes p such that p−1 is a perfect square? Problems (i), (ii), and (iii) are open till date. Downloads 322
##### 30 On Chvátal’s Conjecture for the Hamiltonicity of 1-Tough Graphs and Their Complements

Authors: Shin-Shin Kao, Yuan-Kang Shih, Hsun Su

Abstract:

In this paper, we show that the conjecture of Chv tal, which states that any 1-tough graph is either a Hamiltonian graph or its complement contains a specific graph denoted by F, does not hold in general. More precisely, it is true only for graphs with six or seven vertices, and is false for graphs with eight or more vertices. A theorem is derived as a correction for the conjecture.

Keywords: complement, degree sum, hamiltonian, tough

##### 29 The Role of Piaget's Theory in Conjecture via Analogical Reasoning

Authors: Supratman Ahman Maedi

Abstract:

The construction of knowledge is the goal of learning. The purpose of this research is to know how the role of Piaget theory in allegation via analogy reasoning. This study uses Think out loads when troubleshooting. To explore conjecturing via analogical reasoning is given the question of open analogy. The result: conjecture via analogical reasoning has been done by students in the construction of knowledge, in conjecture there are differences in thinking flow depending on the basic knowledge of the students, in the construction of knowledge occurs assimilation and accommodation problems, strategies and relationships. Downloads 241
##### 28 Topological Quantum Diffeomorphisms in Field Theory and the Spectrum of the Space-Time

Authors: Francisco Bulnes

Abstract:

Through the Fukaya conjecture and the wrapped Floer cohomology, the correspondences between paths in a loop space and states of a wrapping space of states in a Hamiltonian space (the ramification of field in this case is the connection to the operator that goes from TM to T*M) are demonstrated where these last states are corresponding to bosonic extensions of a spectrum of the space-time or direct image of the functor Spec, on space-time. This establishes a distinguished diffeomorphism defined by the mapping from the corresponding loops space to wrapping category of the Floer cohomology complex which furthermore relates in certain proportion D-branes (certain D-modules) with strings. This also gives to place to certain conjecture that establishes equivalences between moduli spaces that can be consigned in a moduli identity taking as space-time the Hitchin moduli space on G, whose dual can be expressed by a factor of a bosonic moduli spaces. Downloads 237
##### 27 Positive Bias and Length Bias in Deep Neural Networks for Premises Selection

Authors: Jiaqi Huang, Yuheng Wang

Abstract:

Premises selection, the task of selecting a set of axioms for proving a given conjecture, is a major bottleneck in automated theorem proving. An array of deep-learning-based methods has been established for premises selection, but a perfect performance remains challenging. Our study examines the inaccuracy of deep neural networks in premises selection. Through training network models using encoded conjecture and axiom pairs from the Mizar Mathematical Library, two potential biases are found: the network models classify more premises as necessary than unnecessary, referred to as the ‘positive bias’, and the network models perform better in proving conjectures that paired with more axioms, referred to as ‘length bias’. The ‘positive bias’ and ‘length bias’ discovered could inform the limitation of existing deep neural networks. Downloads 74
##### 26 On Modules over Dedekind Prime Rings

Abstract:

This research studies an interconnection between finitely generated uniform modules and Dedekind prime rings. The characterization of modules over Dedekind prime rings that will be investigated is an adoption of Noetherian and hereditary concept. Dedekind prime rings are Noetherian and hereditary rings. This property of Dedekind prime rings is a background of the idea of adopting arises. In Noetherian area, it was known that a ring R is Noetherian ring if and only if every finitely generated R-module is a Noetherian module. Similar to that result, a characterization of the hereditary ring is related to its projective modules. That is, a ring R is hereditary ring if and only if every projective R-module is a hereditary module. Due to the above two results, we suppose that characterization of a Dedekind prime ring can be analyzed from finitely generated modules over it. We propose a conjecture: a ring R is a Dedekind prime ring if and only if every finitely generated uniform R-module is a Dedekind module. In this article, we will generalize a concept of the Dedekind module for non-commutative ring case and present a part of the above conjecture. Downloads 356
##### 25 AI Peer Review Challenge: Standard Model of Physics vs 4D GEM EOS

Authors: David A. Harness

Abstract:

Natural evolution of ATP cognitive systems is to meet AI peer review standards. ATP process of axiom selection from Mizar to prove a conjecture would be further refined, as in all human and machine learning, by solving the real world problem of the proposed AI peer review challenge: Determine which conjecture forms the higher confidence level constructive proof between Standard Model of Physics SU(n) lattice gauge group operation vs. present non-standard 4D GEM EOS SU(n) lattice gauge group spatially extended operation in which the photon and electron are the first two trace angular momentum invariants of a gravitoelectromagnetic (GEM) energy momentum density tensor wavetrain integration spin-stress pressure-volume equation of state (EOS), initiated via 32 lines of Mathematica code. Resulting gravitoelectromagnetic spectrum ranges from compressive through rarefactive of the central cosmological constant vacuum energy density in units of pascals. Said self-adjoint group operation exclusively operates on the stress energy momentum tensor of the Einstein field equations, introducing quantization directly on the 4D spacetime level, essentially reformulating the Yang-Mills virtual superpositioned particle compounded lattice gauge groups quantization of the vacuum—into a single hyper-complex multi-valued GEM U(1) × SU(1,3) lattice gauge group Planck spacetime mesh quantization of the vacuum. Thus the Mizar corpus already contains all of the axioms required for relevant DeepMath premise selection and unambiguous formal natural language parsing in context deep learning. Downloads 109
##### 24 Upper Bounds on the Paired Domination Number of Cubic Graphs

Authors: Bin Sheng, Changhong Lu

Abstract:

Let G be a simple undirected graph with no isolated vertex. A paired dominating set of G is a dominating set which induces a subgraph that has a perfect matching. The paired domination number of G, denoted by γₚᵣ(G), is the size of its smallest paired dominating set. Goddard and Henning conjectured that γₚᵣ(G) ≤ 4n/7 holds for every graph G with δ(G) ≥ 3, except the Petersen Graph. In this paper, we prove this conjecture for cubic graphs. Downloads 75
##### 23 Generating Links That Are Both Quasi-Alternating and Almost Alternating

Authors: Hamid Abchir, Mohammed Sabak2

Abstract:

We construct an infinite family of links which are both almost alternating and quasi-alternating from a given either almost alternating diagram representing a quasi-alternating link, or connected and reduced alternating tangle diagram. To do that we use what we call a dealternator extension which consists in replacing the dealternator by a rational tangle extending it. We note that all non-alternating and quasi-alternating Montesinos links can be obtained in that way. We check that all the obtained quasi-alternating links satisfy Conjecture 3.1 of Qazaqzeh et al. (JKTR 22 (6), 2013), that is the crossing number of a quasi-alternating link is less than or equal to its determinant. We also prove that the converse of Theorem 3.3 of Qazaqzeh et al. (JKTR 24 (1), 2015) is false. Downloads 72
##### 22 Union-Primes and Immediate Neighbors

Authors: Shai Sarussi

Abstract:

The union of a nonempty chain of prime ideals in a noncommutative ring is not necessarily a prime ideal. An ideal is called union-prime if it is a union of a nonempty chain of prime ideals but is not a prime. In this paper, some relations between chains of prime ideals and the induced chains of union-prime ideals are shown; in particular, the cardinality of such chains and the cardinality of the sets of cuts of such chains are discussed. For a ring R and a nonempty full chain of prime ideals C of R, several characterizations for the property of immediate neighbors in C are given. Downloads 64
##### 21 A Further Study on the 4-Ordered Property of Some Chordal Ring Networks

Authors: Shin-Shin Kao, Hsiu-Chunj Pan

Abstract:

Given a graph G. A cycle of G is a sequence of vertices of G such that the first and the last vertices are the same. A hamiltonian cycle of G is a cycle containing all vertices of G. The graph G is k-ordered (resp. k-ordered hamiltonian) if for any sequence of k distinct vertices of G, there exists a cycle (resp. hamiltonian cycle) in G containing these k vertices in the specified order. Obviously, any cycle in a graph is 1-ordered, 2-ordered and 3-ordered. Thus the study of any graph being k-ordered (resp. k-ordered hamiltonian) always starts with k = 4. Most studies about this topic work on graphs with no real applications. To our knowledge, the chordal ring families were the first one utilized as the underlying topology in interconnection networks and shown to be 4-ordered [1]. Furthermore, based on computer experimental results in [1], it was conjectured that some of them are 4-ordered hamiltonian. In this paper, we intend to give some possible directions in proving the conjecture.

Keywords: Hamiltonian cycle, 4-ordered, Chordal rings, 3-regular

##### 20 Evaluation of Quasi-Newton Strategy for Algorithmic Acceleration

Authors: T. Martini, J. M. Martínez

Abstract:

An algorithmic acceleration strategy based on quasi-Newton (or secant) methods is displayed for address the practical problem of accelerating the convergence of the Newton-Lagrange method in the case of convergence to critical multipliers. Since the Newton-Lagrange iteration converges locally at a linear rate, it is natural to conjecture that quasi-Newton methods based on the so called secant equation and some minimal variation principle, could converge superlinearly, thus restoring the convergence properties of Newton's method. This strategy can also be applied to accelerate the convergence of algorithms applied to fixed-points problems. Computational experience is reported illustrating the efficiency of this strategy to solve fixed-point problems with linear convergence rate. Downloads 423
##### 19 Individualized Emotion Recognition Through Dual-Representations and Ground-Established Ground Truth

Authors: Valentina Zhang

Abstract:

While facial expression is a complex and individualized behavior, all facial emotion recognition (FER) systems known to us rely on a single facial representation and are trained on universal data. We conjecture that: (i) different facial representations can provide different, sometimes complementing views of emotions; (ii) when employed collectively in a discussion group setting, they enable more accurate emotion reading which is highly desirable in autism care and other applications context sensitive to errors. In this paper, we first study FER using pixel-based DL vs semantics-based DL in the context of deepfake videos. Our experiment indicates that while the semantics-trained model performs better with articulated facial feature changes, the pixel-trained model outperforms on subtle or rare facial expressions. Armed with these findings, we have constructed an adaptive FER system learning from both types of models for dyadic or small interacting groups and further leveraging the synthesized group emotions as the ground truth for individualized FER training. Using a collection of group conversation videos, we demonstrate that FER accuracy and personalization can benefit from such an approach. Downloads 20
##### 18 Total Chromatic Number of Δ-Claw-Free 3-Degenerated Graphs

Authors: Wongsakorn Charoenpanitseri

Abstract:

The total chromatic number χ"(G) of a graph G is the minimum number of colors needed to color the elements (vertices and edges) of G such that no incident or adjacent pair of elements receive the same color Let G be a graph with maximum degree Δ(G). Considering a total coloring of G and focusing on a vertex with maximum degree. A vertex with maximum degree needs a color and all Δ(G) edges incident to this vertex need more Δ(G) + 1 distinct colors. To color all vertices and all edges of G, it requires at least Δ(G) + 1 colors. That is, χ"(G) is at least Δ(G) + 1. However, no one can find a graph G with the total chromatic number which is greater than Δ(G) + 2. The Total Coloring Conjecture states that for every graph G, χ"(G) is at most Δ(G) + 2. In this paper, we prove that the Total Coloring Conjectur for a Δ-claw-free 3-degenerated graph. That is, we prove that the total chromatic number of every Δ-claw-free 3-degenerated graph is at most Δ(G) + 2. Downloads 112
##### 17 Climate Policy Actions for Sustaining International Agricultural Development Projects: The Role of Non-State, Sub-National Stakeholder Engagements, and Monitoring and Evaluation

Authors: EMMANUEL DWAMENA SASU

Abstract:

International climate policy actions require countries under Paris Agreement to design instruments, provide support (financial and technical), and strengthen institutional capacity with tendency to transcending policy formulation to implementation and sustainability. Changes associated with moisture depletion has been a growing phenomenon; especially in developing countries with projected global GDP drop from 7% to 2% between 2005 and 2050. These developments have potential to adversely affect food production in feeding the growing world population, with corresponding rise in global hunger. Incongruously, there is global absence of a harmonized policy direction; capable of providing the required indicators on climate policies for monitoring sustainability of international agricultural development projects. We conduct extensive review and synthesis on existing limitations on global climate policy governance, agricultural food security and sustainability of international agricultural development projects, and conjecture the role of non-state and sub-national climate stakeholder engagements, and monitoring and evaluation strategies for improved climate policy action for sustaining international agricultural development projects. Downloads 61
##### 16 The Impacts of Local Decision Making on Customisation Process Speed across Distributed Boundaries

Abstract:

Communicating and managing customers’ requirements in software development projects play a vital role in the software development process. While it is difficult to do so locally, it is even more difficult to communicate these requirements over distributed boundaries and to convey them to multiple distribution customers. This paper discusses the communication of multiple distribution customers’ requirements in the context of customised software products. The main purpose is to understand the challenges of communicating and managing customisation requirements across distributed boundaries. We propose a model for Communicating Customisation Requirements of Multi-Clients in a Distributed Domain (CCRD). Thereafter, we evaluate that model by presenting the findings of a case study conducted with a company with customisation projects for 18 distributed customers. Then, we compare the outputs of the real case process and the outputs of the CCRD model using simulation methods. Our conjecture is that the CCRD model can reduce the challenge of communication requirements over distributed organisational boundaries, and the delay in decision making and in the entire customisation process time. Downloads 332
##### 15 A Method to Compute Efficient 3D Helicopters Flight Trajectories Based On a Motion Polymorph-Primitives Algorithm

Abstract:

Finding the optimal 3D path of an aerial vehicle under flight mechanics constraints is a major challenge, especially when the algorithm has to produce real-time results in flight. Kinematics models and Pythagorian Hodograph curves have been widely used in mobile robotics to solve this problematic. The level of difficulty is mainly driven by the number of constraints to be saturated at the same time while minimizing the total length of the path. In this paper, we suggest a pragmatic algorithm capable of saturating at the same time most of dimensioning helicopter 3D trajectories’ constraints like: curvature, curvature derivative, torsion, torsion derivative, climb angle, climb angle derivative, positions. The trajectories generation algorithm is able to generate versatile complex 3D motion primitives feasible by a helicopter with parameterization of the curvature and the climb angle. An upper ”motion primitives’ concatenation” algorithm is presented based. In this article we introduce a new way of designing three-dimensional trajectories based on what we call the ”Dubins gliding symmetry conjecture”. This extremely performing algorithm will be soon integrated to a real-time decisional system dealing with inflight safety issues.

Keywords: robotics, aerial robots, motion primitives, helicopter

##### 14 Voting Behavior in an Era of Turbulent Race Relations: Revisiting Church Attendance and Turnout

Authors: JoVontae Butts

Abstract:

A central and enduring theme in the study of American politics is political participation, which indicates the health of a democracy, citizen buy-in, and fair political representation. Though voting push factors have been thoroughly researched and are becoming better understood, the effect of those same push factors often varies for marginalized people. Black voters begun to cast votes at a steadily increasing rate following the 1996 election, gradually growing to its highest level in the 2012 presidential election, even surpassing white voter participation rates. The thirty-year growth period of Black voter engagement concluded in the 2016 election, with the number of participating Black voters stumbling by approximately 7% while other demographics remained roughly the same. Theories for the shift in Black voter behavior range from vote suppression to discouragement due to Barack Obama’s concluding tenure in office. Furthermore, Black voter engagement rebounded in the 2020 election, leaving turnout and race scholars to speculate even further, predicting that disapproval of Trump energized the Black voter bloc. Though there is much conjecture regarding the changes in Black voter behavior, there is truly little empirical evidence to vet those suppositions. This study engages and quantifies speculations for the changes in Black voter engagement in recent elections using 2016 and 2020 American National Election Studies Pilot Study data. Additionally, this study expands upon McGregor’s theory of political hypervigilance by exploring differences in political engagement for church-attending Black voters and those that do not.

Keywords: race, religion, evangelicalism, political engagement

##### 13 The Non-Existence of Perfect 2-Error Correcting Lee Codes of Word Length 7 over Z

Authors: Catarina Cruz, Ana Breda

Abstract:

Tiling problems have been capturing the attention of many mathematicians due to their real-life applications. In this study, we deal with tilings of Zⁿ by Lee spheres, where n is a positive integer number, being these tilings related with error correcting codes on the transmission of information over a noisy channel. We focus our attention on the question ‘for what values of n and r does the n-dimensional Lee sphere of radius r tile Zⁿ?’. It seems that the n-dimensional Lee sphere of radius r does not tile Zⁿ for n ≥ 3 and r ≥ 2. Here, we prove that is not possible to tile Z⁷ with Lee spheres of radius 2 presenting a proof based on a combinatorial method and faithful to the geometric idea of the problem. The non-existence of such tilings has been studied by several authors being considered the most difficult cases those in which the radius of the Lee spheres is equal to 2. The relation between these tilings and error correcting codes is established considering the center of a Lee sphere as a codeword and the other elements of the sphere as words which are decoded by the central codeword. When the Lee spheres of radius r centered at elements of a set M ⊂ Zⁿ tile Zⁿ, M is a perfect r-error correcting Lee code of word length n over Z, denoted by PL(n, r). Our strategy to prove the non-existence of PL(7, 2) codes are based on the assumption of the existence of such code M. Without loss of generality, we suppose that O ∈ M, where O = (0, ..., 0). In this sense and taking into account that we are dealing with Lee spheres of radius 2, O covers all words which are distant two or fewer units from it. By the definition of PL(7, 2) code, each word which is distant three units from O must be covered by a unique codeword of M. These words have to be covered by codewords which dist five units from O. We prove the non-existence of PL(7, 2) codes showing that it is not possible to cover all the referred words without superposition of Lee spheres whose centers are distant five units from O, contradicting the definition of PL(7, 2) code. We achieve this contradiction by combining the cardinality of particular subsets of codewords which are distant five units from O. There exists an extensive literature on codes in the Lee metric. Here, we present a new approach to prove the non-existence of PL(7, 2) codes. Downloads 81
##### 12 Thomas Kuhn, the Accidental Theologian: An Argument for the Similarity of Science and Religion

Authors: Dominic McGann

Abstract:

Applying Kuhn’s model of paradigm shifts in science to cases of doctrinal change in religion has been a common area of study in recent years. Few authors, however, have sought an explanation for the ease with which this model of theory change in science can be applied to cases of religious change. In order to provide such an explanation of this analytic phenomenon, this paper aims to answer one central question: Why is it that a theory that was intended to be used in an analysis of the history of science can be applied to something as disparate as the doctrinal history of religion with little to no modification? By way of answering this question, this paper begins with an explanation of Kuhn’s model and its applications in the field of religious studies. Following this, Massa’s recently proposed explanation for this phenomenon, and its notable flaws will be explained by way of framing the central proposal of this article, that the operative parts of scientific and religious changes function on the same fundamental concept of changes in understanding. Focusing its argument on this key concept, this paper seeks to illustrate its operation in cases of religious conversion and in Kuhn’s notion of the incommensurability of different scientific paradigms. The conjecture of this paper is that just as a Pagan-turned-Christian ceases to hear Thor’s hammer when they hear a clap of thunder, so too does a Ptolemaic-turned-Copernican-astronomer cease to see the Sun orbiting the Earth when they view a sunrise. In both cases, the agent in question has undergone a similar change in universal understanding, which provides us with a fundamental connection between changes in religion and changes in science. Following an exploration of this connection, this paper will consider the implications that such a connection has for the concept of the division between religion and science. This will, in turn, lead to the conclusion that religion and science are more alike than they are opposed with regards to the fundamental notion of understanding, thereby providing an answer to our central question. The major finding of this paper is that Kuhn’s model can be applied to religious cases so easily because changes in science and changes in religion operate on the same type of change in understanding. Therefore, in summary, science and religion share a crucial similarity and are not as disparate as they first appear. Downloads 76

Abstract:

##### 10 Altering Surface Properties of Magnetic Nanoparticles with Single-Step Surface Modification with Various Surface Active Agents

Abstract:

Owing to the dominating surface forces and large-scale surface interactions, the nano-scale particles face difficulties in getting suspended in various media. Magnetic nanoparticles of iron oxide offer a great deal of promise due to their ease of preparation, reasonable magnetic properties, low cost and environmental compatibility. We intend to modify the surface of magnetic Fe₂O₃ nanoparticles with selected surface modifying agents using simple and effective single-step chemical reactions in order to enhance dispersibility of magnetic nanoparticles in non-polar media. Magnetic particles were prepared by hydrolysis of Fe²⁺/Fe³⁺ chlorides and their subsequent oxidation in aqueous medium. The dried particles were then treated with Octadecyl quaternary ammonium silane (Terrasil™), stearic acid and gallic acid ester of stearyl alcohol in ethanol separately to yield S-2 to S-4 respectively. The untreated Fe₂O₃ was designated as S-1. The surface modified nanoparticles were then analysed with Dynamic Light Scattering (DLS), Fourier Transform Infrared spectroscopy (FTIR), X-Ray Diffraction (XRD), Thermogravimetric Gravimetric Analysis (TGA) and Scanning Electron Microscopy and Energy dispersive X-Ray analysis (SEM-EDAX). Characterization reveals the particle size averaging 20-50 nm with and without modification. However, the crystallite size in all cases remained ~7.0 nm with the diffractogram matching to Fe₂O₃ crystal structure. FT-IR suggested the presence of surfactants on nanoparticles’ surface, also confirmed by SEM-EDAX where mapping of elements proved their presence. TGA indicated the weight losses in S-2 to S-4 at 300°C onwards suggesting the presence of organic moiety. Hydrophobic character of modified surfaces was confirmed with contact angle analysis, all modified nanoparticles showed super hydrophobic behaviour with average contact angles ~129° for S-2, ~139.5° for S-3 and ~151° for S-4. This indicated that surface modified particles are super hydrophobic and they are easily dispersible in non-polar media. These modified particles could be ideal candidates to be suspended in oil-based fluids, polymer matrices, etc. We are pursuing elaborate suspension/sedimentation studies of these particles in various oils to establish this conjecture. Downloads 83
##### 9 Bridging the Gap and Widening the Divide

Authors: Lerato Dixon, Thorsten Chmura

Abstract:

This paper explores whether ethnic identity in Zimbabwe leads to discriminatory behaviour and the degree to which a norm-based intervention can shift this discriminatory behaviour. Social Identity Theory suggests that group identity can lead to favouritism towards the in-group and discriminatory behaviour towards the out-group. Agents yield higher utility from maintaining positive self-esteem by confirming with group behaviour. This paper focuses on the two majority ethnic groups in Zimbabwe – the Ndebele and Shona. Racial identities are synonymous with the language spoken. Zimbabwe’s history highlights how identity formation took place. As following independence, political parties became recognised as either Ndebele or Shona-speaking. It is against this backdrop that this study investigates the degree to which norm-based nudge can alter behaviour. This paper uses experimental methods to analyse discriminatory behaviour between two naturally occurring ethnic groups in Zimbabwe. In addition, we investigate if social norm-based interventions can shift discriminatory behaviour to understand if the divide between these two identity groups can be further divided or healed. Participants are randomly assigned into three groups to receive information regarding a social norm. We compare the effect of a proscriptive social norm-based intervention, stating what shouldn't be done and prescriptive social norms as interventions, stating what should be done. Specifically, participants are either shown the socially appropriate (Heal) norm, the socially inappropriateness (Divide) norm regarding interethnic marriages or no norm-based intervention. Following the random assignment into intervention groups, participants take part in the Trust Game. We conjecture that discrimination will shift in accordance with the prevailing social norm. Instead, we find evidence of interethnic discriminatory behaviour. We also find that trust increases when interacting with Ndebele, Shona and Zimbabwean participants following the Heal intervention. However, if the participant is Shona, the Heal intervention decreases trust toward in-groups and Zimbabwean co-players. On the other hand, if the participant is Shona, the Divide treatment significantly increases trust toward Ndebele participants. In summary, we find evidence that norm-based interventions significantly change behaviour. However, the prescriptive norm-based intervention (Heal) decreases trust toward the in-group, out-group and national identity group if the participant is Shona – therefore having an adverse effect. In contrast, the proscriptive Divide treatment increases trust if the participant is Shona towards Ndebele co-players. We conclude that norm-based interventions have a ‘rebound’ effect by altering behaviour in the opposite direction. Downloads 106
##### 8 An Econometric Analysis of the Flat Tax Revolution

Authors: Wayne Tarrant, Ethan Petersen

Abstract:

##### 7 A Tutorial on Model Predictive Control for Spacecraft Maneuvering Problem with Theory, Experimentation and Applications

Abstract:

This paper discusses the recent advances and future prospects of spacecraft position and attitude control using Model Predictive Control (MPC). First, the challenges of the space missions are summarized, in particular, taking into account the errors, uncertainties, and constraints imposed by the mission, spacecraft and, onboard processing capabilities. The summary of space mission errors and uncertainties provided in categories; initial condition errors, unmodeled disturbances, sensor, and actuator errors. These previous constraints are classified into two categories: physical and geometric constraints. Last, real-time implementation capability is discussed regarding the required computation time and the impact of sensor and actuator errors based on the Hardware-In-The-Loop (HIL) experiments. The rationales behind the scenarios’ are also presented in the scope of space applications as formation flying, attitude control, rendezvous and docking, rover steering, and precision landing. The objectives of these missions are explained, and the generic constrained MPC problem formulations are summarized. Three key design elements used in MPC design: the prediction model, the constraints formulation and the objective cost function are discussed. The prediction models can be linear time invariant or time varying depending on the geometry of the orbit, whether it is circular or elliptic. The constraints can be given as linear inequalities for input or output constraints, which can be written in the same form. Moreover, the recent convexification techniques for the non-convex geometrical constraints (i.e., plume impingement, Field-of-View (FOV)) are presented in detail. Next, different objectives are provided in a mathematical framework and explained accordingly. Thirdly, because MPC implementation relies on finding in real-time the solution to constrained optimization problems, computational aspects are also examined. In particular, high-speed implementation capabilities and HIL challenges are presented towards representative space avionics. This covers an analysis of future space processors as well as the requirements of sensors and actuators on the HIL experiments outputs. The HIL tests are investigated for kinematic and dynamic tests where robotic arms and floating robots are used respectively. Eventually, the proposed algorithms and experimental setups are introduced and compared with the authors' previous work and future plans. The paper concludes with a conjecture that MPC paradigm is a promising framework at the crossroads of space applications while could be further advanced based on the challenges mentioned throughout the paper and the unaddressed gap. Downloads 46
##### 6 Interfacial Instability and Mixing Behavior between Two Liquid Layers Bounded in Finite Volumes

Authors: Lei Li, Ming M. Chai, Xiao X. Lu, Jia W. Wang

Abstract:

The mixing process of two liquid layers in a cylindrical container includes the upper liquid with higher density rushing into the lower liquid with lighter density, the lower liquid rising into the upper liquid, meanwhile the two liquid layers having interactions with each other, forming vortices, spreading or dispersing in others, entraining or mixing with others. It is a complex process constituted of flow instability, turbulent mixing and other multiscale physical phenomena and having a fast evolution velocity. In order to explore the mechanism of the process and make further investigations, some experiments about the interfacial instability and mixing behavior between two liquid layers bounded in different volumes are carried out, applying the planar laser induced fluorescence (PLIF) and the high speed camera (HSC) techniques. According to the results, the evolution of interfacial instability between immiscible liquid develops faster than theoretical rate given by the Rayleigh-Taylor Instability (RTI) theory. It is reasonable to conjecture that some mechanisms except the RTI play key roles in the mixture process of two liquid layers. From the results, it is shown that the invading velocity of the upper liquid into the lower liquid does not depend on the upper liquid's volume (height). Comparing to the cases that the upper and lower containers are of identical diameter, in the case that the lower liquid volume increases to larger geometric space, the upper liquid spreads and expands into the lower liquid more quickly during the evolution of interfacial instability, indicating that the container wall has important influence on the mixing process. In the experiments of miscible liquid layers’ mixing, the diffusion time and pattern of the liquid interfacial mixing also does not depend on the upper liquid's volumes, and when the lower liquid volume increases to larger geometric space, the action of the bounded wall on the liquid falling and rising flow will decrease, and the liquid interfacial mixing effects will also attenuate. Therefore, it is also concluded that the volume weight of upper heavier liquid is not the reason of the fast interfacial instability evolution between the two liquid layers and the bounded wall action is limited to the unstable and mixing flow. The numerical simulations of the immiscible liquid layers’ interfacial instability flow using the VOF method show the typical flow pattern agree with the experiments. However the calculated instability development is much slower than the experimental measurement. The numerical simulation of the miscible liquids’ mixing, which applying Fick’s diffusion law to the components’ transport equation, shows a much faster mixing rate than the experiments on the liquids’ interface at the initial stage. It can be presumed that the interfacial tension plays an important role in the interfacial instability between the two liquid layers bounded in finite volume. Downloads 175
##### 5 A Formal Microlectic Framework for Biological Circularchy

Authors: Ellis D. Cooper

Abstract:

“Circularchy” is supposed to be an adjustable formal framework with enough expressive power to articulate biological theory about Earthly Life in the sense of multi-scale biological autonomy constrained by non-equilibrium thermodynamics. “Formal framework” means specifically a multi-sorted first-order-theorywithequality (for each sort). Philosophically, such a theory is one kind of “microlect,” which means a “way of speaking” (or, more generally, a “way of behaving”) for overtly expressing a “mental model” of some “referent.” Other kinds of microlect include “natural microlect,” “diagrammatic microlect,” and “behavioral microlect,” with examples such as “political theory,” “Euclidean geometry,” and “dance choreography,” respectively. These are all describable in terms of a vocabulary conforming to grammar. As aspects of human culture, they are possibly reminiscent of Ernst Cassirer’s idea of “symbolic form;” as vocabularies, they are akin to Richard Rorty’s idea of “final vocabulary” for expressing a mental model of one’s life. A formal microlect is presented by stipulating sorts, variables, calculations, predicates, and postulates. Calculations (a.k.a., “terms”) may be composed to form more complicated calculations; predicates (a.k.a., “relations”) may be logically combined to form more complicated predicates; and statements (a.k.a., “sentences”) are grammatically correct expressions which are true or false. Conclusions are statements derived using logical rules of deduction from postulates, other assumed statements, or previously derived conclusions. A circularchy is a formal microlect constituted by two or more sub-microlects, each with its distinct stipulations of sorts, variables, calculations, predicates, and postulates. Within a sub-microlect some postulates or conclusions are equations which are statements that declare equality of specified calculations. An equational bond between an equation in one sub-microlect and an equation in either the same sub-microlect or in another sub-microlect is a predicate that declares equality of symbols occurring in a side of one equation with symbols occurring in a side of the other equation. Briefly, a circularchy is a network of equational bonds between sub-microlects. A circularchy is solvable if there exist solutions for all equations that satisfy all equational bonds. If a circularchy is not solvable, then a challenge would be to discover the obstruction to solvability and then conjecture what adjustments might remove the obstruction. Adjustment means changes in stipulated ingredients (sorts, etc.) of sub-microlects, or changes in equational bonds between sub-microlects, or introduction of new sub-microlects and new equational bonds. A circularchy is modular insofar as each sub-microlect is a node in a network of equation bonds. Solvability of a circularchy may be conjectured. Efforts to prove solvability may be thwarted by a counter-example or may lead to the construction of a solution. An automated theorem-proof assistant would likely be necessary for investigating a substantial circularchy, such as one purported to represent Earthly Life. Such investigations (chains of statements) would be concurrent with and no substitute for simulations (chains of numbers). Downloads 131
##### 4 Genome-Wide Homozygosity Analysis of the Longevous Phenotype in the Amish Population

Authors: Sandra Smieszek, Jonathan Haines

Abstract:

Introduction: Numerous research efforts have focused on searching for ‘longevity genes’. However, attempting to decipher the genetic component of the longevous phenotype have resulted in limited success and the mechanisms governing longevity remain to be explained. We conducted a genome-wide homozygosity analysis (GWHA) of the founder population of the Amish community in central Ohio. While genome-wide association studies using unrelated individuals have revealed many interesting longevity associated variants, these variants are typically of small effect and cannot explain the observed patterns of heritability for this complex trait. The Amish provide a large cohort of extended kinships allowing for in depth analysis via family-based approach excellent population due to its. Heritability of longevity increases with age with significant genetic contribution being seen in individuals living beyond 60 years of age. In our present analysis we show that the heritability of longevity is estimated to be increasing with age particularly on the paternal side. Methods: The present analysis integrated both phenotypic and genotypic data and led to the discovery of a series of variants, distinct for stratified populations across ages and distinct for paternal and maternal cohorts. Specifically 5437 subjects were analyzed and a subset of 893 successfully genotyped individuals was used to assess CHIP heritability. We have conducted the homozygosity analysis to examine if homozygosity is associated with increased risk of living beyond 90. We analyzed AMISH cohort genotyped for 614,957 SNPs. Results: We delineated 10 significant regions of homozygosity (ROH) specific for the age group of interest (>90). Of particular interest was ROH on chromosome 13, P < 0.0001. The lead SNPs rs7318486 and rs9645914 point to COL4A2 and our lead SNP. COL25A1 encodes one of the six subunits of type IV collagen, the C-terminal portion of the protein, known as canstatin, is an inhibitor of angiogenesis and tumor growth. COL4A2 mutations have been reported with a broader spectrum of cerebrovascular, renal, ophthalmological, cardiac, and muscular abnormalities. The second region of interest points to IRS2. Furthermore we built a classifier using the obtained SNPs from the significant ROH region with 0.945 AUC giving ability to discriminate between those living beyond to 90 years of age and beyond. Conclusion: In conclusion our results suggest that a history of longevity does indeed contribute to increasing the odds of individual longevity. Preliminary results are consistent with conjecture that heritability of longevity is substantial when we start looking at oldest fifth and smaller percentiles of survival specifically in males. We will validate all the candidate variants in independent cohorts of centenarians, to test whether they are robustly associated with human longevity. The identified regions of interest via ROH analysis could be of profound importance for the understanding of genetic underpinnings of longevity.

Keywords: regions of homozygosity, longevity, SNP, Amish