Types Of Rules Research Articles

Stabilisation Policy Options in a ‘Lower and Longer’ Interest Rates Environment

During episodes of severe depression, interest rates can approach the zero lower bound (ZLB) and stay there for a fairly long time. Mainstream macroeconomic theory (the so-called New Consensus Economics) then fails to provide adequate guidance under a Taylor type rule to conventional monetary policy. Various alternatives have been suggested to revitalise monetary policy in such a situation. The major alternatives can be divided into three categories, namely, (a) those that do not recognise the ZLB as an effective floor, (b) those based on the Keynesian liquidity trap and (c) those based (implicitly) on Hawtrey’s credit deadlock. We discuss these alternatives with a special focus on quantitative easing (QE). In particular, we draw attention to the largely ignored fact that QE had been suggested by the British economist Hawtrey at least as early as 1931 in the policy debates on ways to emerge from the Great Depression. JEL Codes: E4, E5, N1

Growth functions of periodic space tessellations.

This work analyzes the rules governing the growth of the numbers of vertices, edges and faces in all possible periodic tessellations of the 2D Euclidean space, and encodes those rules in several types of polynomial growth functions. These encodings map the geometric, combinatorial and topological properties of the tessellations into sets of integer coefficients. Several general statements about these encodings are given with rigorous mathematical proof. The variation of the growth functions is represented graphically and analyzed in orphic diagrams, so named because of their similarity to orphic art. Several examples of 3D space groups are included, to emphasize the complexity of the growth functions in higher dimensions. A freely available Python library is presented to facilitate the discovery of the growth functions and the generation of orphic diagrams.

The Connections Between Attribute-Induced and Object-Induced Decision Rules in Incomplete Formal Contexts

For a given incomplete context, object-induced approximate concepts have been defined, and this type of approximate concept can induce a type of decision rule. Based on the duality principle, another set of approximate concepts can be defined from the perspective of attributes, i.e., attribute-induced approximate concepts. Although object induced approximate concepts and attribute induced approximate concepts are symmetrical by duality principle, their induced decision rules exhibit different properties and the connections between attribute induced decision rules and object induced decision rules in incomplete formal contexts are not clear. To this end, a type of attribute-induced approximate concept and a method of extracting attribute-induced decision rules are presented. More importantly, it is revealed that given a type of decision rules, there must be corresponding decision rules of the other type, and both of them can provide some useful information, but they are not equivalent to each other. In other words, each type of decision rule can provide some unique and irreplaceable information.

Imperative Compositional Programming: Type Sound Distributive Intersection Subtyping with References via Bidirectional Typing

Compositional programming is a programming paradigm that emphasizes modularity and is implemented in the CP programming language. The foundations for compositional programming are based on a purely functional variant of System F with intersection types, called Fi+, which includes distributivity rules for subtyping. This paper shows how to extend compositional programming and CP with mutable references, enabling a modular, imperative compositional programming style. A technical obstacle solved in our work is the interaction between distributive intersection subtyping and mutable references. Davies and Pfenning [2000] studied this problem in standard formulations of intersection type systems and argued that, when combined with references, distributive subtyping rules lead to type unsoundness. To recover type soundness, they proposed dropping distributivity rules in subtyping. CP cannot adopt this solution, since it fundamentally relies on distributivity for modularity. Therefore, we revisit the problem and show that, by adopting bidirectional typing, a more lightweight and type sound restriction is possible: we can simply restrict the typing rule for references. This solution retains distributivity and an unrestricted intersection introduction rule. We present a first calculus, based on Davies and Pfenning's work, which illustrates the generality of our solution. Then we present an extension of Fi+ with references, which adopts our restriction and enables imperative compositional programming. We implement an extension of CP with references and show how to model a modular live-variable analysis in CP. Both calculi and their proofs are formalized in the Coq proof assistant.

CoolerSpace: A Language for Physically Correct and Computationally Efficient Color Programming

Color programmers manipulate lights, materials, and the resulting colors from light-material interactions. Existing libraries for color programming provide only a thin layer of abstraction around matrix operations. Color programs are, thus, vulnerable to bugs arising from mathematically permissible but physically meaningless matrix computations. Correct implementations are difficult to write and optimize. We introduce CoolerSpace to facilitate physically correct and computationally efficient color programming. CoolerSpace raises the level of abstraction of color programming by allowing programmers to focus on describing the logic of color physics. Correctness and efficiency are handled by CoolerSpace. The type system in CoolerSpace assigns physical meaning and dimensions to user-defined objects. The typing rules permit only legal computations informed by color physics and perception. Along with type checking, CoolerSpace also generates performance-optimized programs using equality saturation. CoolerSpace is implemented as a Python library and compiles to ONNX, a common intermediate representation for tensor computations. CoolerSpace not only prevents common errors in color programming, but also does so without run-time overhead: even unoptimized CoolerSpace programs out-perform existing Python-based color programming systems by up to 5.7 times; our optimizations provide up to an additional 1.4 times speed-up.

Macroeconomic Analysis and General Economic Equilibrium of Kazakhstan

The paper studies general equilibrium in the economy of Kazakhstan. The purpose of the study is to estimate the equilibrium real interest rate for the economy within current frameworks. The IS-LMBP curves are plotted based on corresponding regression models of the real output measured by GDP. The exogenous variables are taken for the regressions according to the theoretical propositions. The quarterly data for 2008Q1-2022Q4 published in the datasets and bulletins of the Committee for Statistics and the National Bank of the Republic of Kazakhstan were used. Some consequences of the change in the exchange rate regime and in macroeconomic policy framework on macroeconomic relationships were revealed. Effectiveness of using interest rate as an instrument in maintaining inflation targeting policy is still ambiguous for the case of Kazakhstan. This study demonstrates the general equilibrium state of the national economy and specifications of the curves listed above. The results can be used to assign further the nominal interest rate using Taylor type rules

On Leibniz type rule for generalized fractional derivatives

In this paper, we present a new Leibniz-type rule for two variants of the most generalized fractional derivatives; the regularized ψ-Hilfer derivative and the (k,ψ)-Hilfer derivative. As a special case, we recover the Leibniz-type rule associated to some well known fractional derivatives.

Computation of random time-shift distributions for stochastic population models

Even in large systems, the effect of noise arising from when populations are initially small can persist to be measurable on the macroscale. A deterministic approximation to a stochastic model will fail to capture this effect, but it can be accurately approximated by including an additional random time-shift to the initial conditions. We present a efficient numerical method to compute this time-shift distribution for a large class of stochastic models. The method relies on differentiation of certain functional equations, which we show can be effectively automated by deriving rules for different types of model rates that arise commonly when mass-action mixing is assumed. Explicit computation of the time-shift distribution can be used to build a practical tool for the efficient generation of macroscopic trajectories of stochastic population models, without the need for costly stochastic simulations. Full code is provided to implement the calculations and we demonstrate the method on an epidemic model and a model of within-host viral dynamics.

EFFICIENCY OF ACCOUNTING CONSULTING IN IT COMPANIES AND THE CURRENT DEVELOPMENT OF INFORMATION TECHNOLOGY

The primary focus of this scientific article is to comprehensively examine the nature and potential growth of accounting consulting within the realm of IT enterprise management. Specifically, the research aims to uncover the theoretical principles and real-world implications of accounting consulting and to evaluate its influence on the financial stability and efficacy of an enterprise. The current trends, advantages and disadvantages of using information technologies in the modern world, their development and application in agriculture are substantiated. Having analyzed the data on the structure of the consulting market in Ukraine by segments, it is found that accounting consulting occupies a prominent place in the market of consulting services in Ukraine and is one of the important elements of doing business in the modern world. The article examines how actively companies use IT technologies and innovative solutions, as well as the provision of accounting advice by various consulting companies, both foreign and domestic. It is noted that the activities of IT companies are considered to be very specific compared to other types of services. This fact is confirmed by legislative acts not only in Ukraine but also in other countries of the world and Europe. The article considers the peculiarities of the taxation system, rules of profit taxation and certain types of benefits for IT companies, problems of licensing of accounting consulting companies, as well as services provided by consulting firms. The authors suggest ways of developing consulting companies in Ukraine. It is predicted that in the future, accounting consulting in the IT sector will continue to integrate modern technologies and will focus on analytics and strategic management.

Transpension: The Right Adjoint to the Pi-type

Presheaf models of dependent type theory have been successfully applied to model HoTT, parametricity, and directed, guarded and nominal type theory. There has been considerable interest in internalizing aspects of these presheaf models, either to make the resulting language more expressive, or in order to carry out further reasoning internally, allowing greater abstraction and sometimes automated verification. While the constructions of presheaf models largely follow a common pattern, approaches towards internalization do not. Throughout the literature, various internal presheaf operators ($\surd$, $\Phi/\mathsf{extent}$, $\Psi/\mathsf{Gel}$, $\mathsf{Glue}$, $\mathsf{Weld}$, $\mathsf{mill}$, the strictness axiom and locally fresh names) can be found and little is known about their relative expressivenes. Moreover, some of these require that variables whose type is a shape (representable presheaf, e.g. an interval) be used affinely. We propose a novel type former, the transpension type, which is right adjoint to universal quantification over a shape. Its structure resembles a dependent version of the suspension type in HoTT. We give general typing rules and a presheaf semantics in terms of base category functors dubbed multipliers. Structural rules for shape variables and certain aspects of the transpension type depend on characteristics of the multiplier. We demonstrate how the transpension type and the strictness axiom can be combined to implement all and improve some of the aforementioned internalization operators (without formal claim in the case of locally fresh names).

Static liquefaction as a form of material instability in element test simulations of granular soil

Static liquefaction is a form of unstable behaviour of granular soil. It is most common in saturated loose sands under monotonically loaded undrained conditions. Predicting static liquefaction using an elastic-plastic model that incorporates the non-associated plastic flow rule and strain hardening is possible. The article briefly describes the unstable behaviour of saturated sand in undrained conditions under a monotonic load. A simple elastic-plastic model with deviatoric hardening and a Drucker–Prager load surface is presented. The constitutive relationships were programmed in a Python script. Simulations of triaxial tests under mixed stress-strain control demonstrated the model’s ability to predict various undrained sand responses, including fully stable responses (no liquefaction) and partial and complete liquefaction under triaxial compression and tension. Predicting static liquefaction is possible by properly selecting the proportions of the parameters involved in plastic potential and loading functions and the parameter A used in the deviatoric hardening rule of hyperbolic type.

Entropy-based syntactic tree analysis for text classification: a novel approach to distinguishing between original and translated Chinese texts

Abstract This research focuses on classifying translated and non-translated Chinese texts by analyzing syntactic rule features, using an integrated approach of machine learning and entropy analysis. The methodology employs information entropy to gauge the complexity of syntactic rules in both text types. The methodology is based on the concept of information entropy, which serves as a quantitative measure for the complexity inherent in syntactic rules as manifested from tree-based annotations. The goal of the study is to explore whether translated Chinese texts demonstrate syntactic characteristics that are significantly different from those of non-translated texts, thereby permitting a reliable classification between the two. To do this, the research calculates information entropy values for syntactic rules in two comparable corpora, one of translated and the other of non-translated Chinese texts. Then, various machine learning models are applied to these entropy metrics to identify any significant differences between the two groups. The results show significant differences in the syntactic structures. Translated texts have a higher degree of entropy, indicating more complex syntactic constructs compared to non-translated texts. These findings contribute to our understanding of the effect of translation on language syntax, with implications for text classification and translation studies.

Cascadic failure and preferential decay via pruning mediated percolation on interdependent networks: implications for schizophrenia

IntroductionDuring adolescence the brain is dynamically changing. Destabilization and acceleration of the normal adolescent synaptic pruning process is likely a contributing factor to the neuropathology of schizophrenia. Details on whether normal pruning effects weaker synapses more or uniformly all synapses with different strengths, needs to be further evaluated. Widespread impairment in structural connectivity in schizophrenic patients involving several cortical and subcortical areas, has been previously described. In this computational study, we investigated a stochastic percolation process in interdependent networks, motivated by pathological synaptic pruning. We examined preferential decay in the connectivity decremental process, as well as differential pruning in interconnected subnetworks. Finally, the speed of the percolation process, as well as the potential for pharmacological interventions of percolation in random networks was explored. Statistical structural properties of decaying networks pinpointed several network attributes which the disintegration and phase transitions qualitatively depended on.ObjectivesThe following objectives were explored: 1.) Apart from a random percolation process, we investigated preferential decay of the connections. We introduced different percolation rules for various connection types. 2.) Based on previous experimental results, we assumed that different interconnected neural subpopulations prune differently, therefore we explored differential pruning process in the subnetworks. 3.) The speed of the percolation was studied and the pharmacological synaptic connectivity change was also analyzed.MethodsWe considered two inter-connected randomly connected networks, where the connections were removed during the percolation process. Simulations were partially performed using Octave on a Lenovo Thinkpad running the Linux operating system and partially performed on a supercomputer at UPPMAX (NAISS Small Compute 2023 Dnr: NAISS 2023/22-102).ResultsWe found that the coupled network system shows rich percolation behaviors with phase transitions for various coupling strength and coupling patterns. The phase transitions of both layers are altered qualitatively between discontinuous, mixed and continuous. Recursively developing percolation in interdependent networks can cause complete fragmentation of these networks, resulting in cascadic failure which might be related to schizophrenia symptoms.Conclusions This computational study analyzes the pruning-mediated percolation in interdependent neural networks. Consequences of the pathological overpruning were related to the attributes of the interdependent network properties. Implications for schizophrenia development and predictions for compensatorial iatrogenic percolation was also pinpointed and discussed.Disclosure of InterestNone Declared

Classification of athletes with disorders of mental and physical development

The article reveals the problematic issues of selecting athletes with mental and physical disabilities to participate in official all-Ukrainian and international Paralympic sports competitions. It has been established that the solution to this problem prompts the study of the peculiarities of the classification of athletes with mental and physical disabilities in order to allow them to compete. It has been proven that one of the best means of strengthening mental and physical health is physical education. For people with disabilities, this is an adaptive sport, which is aimed at the formation of athletic skills in people with mental disabilities and their achievement of high results in various types of sports. The purpose of the article is to substantiate the classification of athletes with mental and physical disabilities according to the existing international rules for specific types of sports. The minimum classification standard for admission to competitions in athletics, table tennis and swimming for athletes with mental and physical disabilities has been developed, intended for national application level during the all-Ukrainian qualifying and final competitions, All-Ukrainian Spartakiade among children with disabilities “Believe in yourself”, Ukrainian table tennis championships and cups in accordance with the Virtus guidelines. The minimum classification standard takes into account the specifics of the procedure of psychological classification of athletes with mental and physical disabilities which is carried out on the basis of current documents and Virtus recommendations. The minimum classification standard allows to algorithmize the classification procedure of athletes with mental and physical disabilities taking into account its crucial importance for determining the right to participate in competitions.

An approach to investigate fairness using Dominance-based Rough Sets Analysis—How fair were the COVID-19 restriction decisions in the UK?

Fairness is a crucial aspect to consider within decision support systems, to seek to strive for equitable decision outcomes. Therefore, in this work, we introduce an approach to investigate fairness in data-driven decisions. The Dominance-based Rough Sets Approach (DRSA) has been widely used to extract a single set of if-then types of rules from data. Conversely, our approach investigates fairness by extracting multiple separate if-then rule sets for separate groups. The proposed approach facilitates fairness analysis to be performed amongst groups represented by these rule-sets.During the COVID-19 pandemic, several countries have taken the approach of tiered restrictions, which has remained a point of debate due to a lack of transparency. Using our proposed approach, we explore fairness analysis with regards to the UK government’s COVID-19 tiered restrictions allocation system. These insights from the analysis are translated into “if-then” type rules, which can easily be interpreted by policy makers. The differences in the rules extracted from different geographical areas suggest inconsistencies in the allocations of tiers in these areas. We found that the differences delineated an overall north south divide in England, however, this divide was driven mostly by London. Such analysis could provide a more transparent approach to localised public health restrictions, which can help ensure greater conformity to the public safety rules. Our analysis demonstrates the usefulness of our approach, to explore fairness analysis in terms of equal-treatment within data-driven decisions, which could be applied in numerous other domains, for investigating the fairness and explainabilty of decisions.

Investigating local and global control mechanisms in bilingual grammatical processing.

Bilinguals employ both global and local control mechanisms to manage coactivated languages that compete for selection, yet little is known about how they operate on morphosyntactic information. The current study investigated bilingual language control mechanisms for a morphosyntactic production task. Across two experiments, 48 early Spanish-English bilinguals completed rapid instructed task learning paradigms with priming-in-item-recognition manipulations that investigated the extent to which parallel activation was observed across languages and across rules of the same type within a language. The results from the current experiments showed that it was more difficult to reject incorrect responses in the correct target language than to reject incorrect responses that contained the correct grammatical manipulation executed in the nondesired language. These results suggest that global control at the level of target language selection is more effective than local control processes during a bilingual morphosyntactic manipulation. (PsycInfo Database Record (c) 2023 APA, all rights reserved).

OPTIMIZING PLANT DISEASE PREDICTION: A NEURO-FUZZY-GENETIC ALGORITHM APPROACH

In this essay, the idea of improving plant disease prediction using a Neuro-Fuzzy-Genetic algorithm (NFGA) technique is explored. The concept of a Neuro-Fuzzy-Genetic algorithm is first described. The advantages of the NFGA technique for predicting plant disorders are next addressed. An example is then given to demonstrate how this technique has been successfully used and the advantages it offers you. A hybrid artificial intelligence technique known as a Neuro-Fuzzy-Genetic set of rules (NFGA) combines the genetic algorithms, fuzzy logic, and neural network algorithms. It entails using a method of organizing fuzzy rules for statistics type, developing a network of neurons to anticipate the level of the group of data points to positive fuzzy training, adjusting the weights of fuzzy classes using a genetic algorithm-based totally optimization method to better fit the data factors, and ultimately identifying and predicting patterns of statistics points. The main benefits of this method for predicting plant diseases are its abilities to analyze various plant characteristics, extract complex relationships between statistics points, identify correlations between various environmental factors and illnesses, choose the best combinations of fuzzy rules for accurate classification, and finally adapt to changing data over time.

Enhancing the representation of water management in global hydrological models

Abstract. This study enhances an existing global hydrological model (GHM), Xanthos, by adding a new water management module that distinguishes between the operational characteristics of irrigation, hydropower, and flood control reservoirs. We remapped reservoirs in the Global Reservoir and Dam (GRanD) database to the 0.5∘ spatial resolution in Xanthos so that a single lumped reservoir exists per grid cell, which yielded 3790 large reservoirs. We implemented unique operation rules for each reservoir type, based on their primary purposes. In particular, hydropower reservoirs have been treated as flood control reservoirs in previous GHM studies, while here, we determined the operation rules for hydropower reservoirs via optimization that maximizes long-term hydropower production. We conducted global simulations using the enhanced Xanthos and validated monthly streamflow for 91 large river basins, where high-quality observed streamflow data were available. A total of 1878 (296 hydropower, 486 irrigation, and 1096 flood control and others) out of the 3790 reservoirs are located in the 91 basins and are part of our reported results. The Kling–Gupta efficiency (KGE) value (after adding the new water management) is ≥ 0.5 and ≥ 0.0 in 39 and 81 basins, respectively. After adding the new water management module, model performance improved for 75 out of 91 basins and worsened for only 7. To measure the relative difference between explicitly representing hydropower reservoirs and representing hydropower reservoirs as flood control reservoirs (as is commonly done in other GHMs), we use the normalized root mean square error (NRMSE) and the coefficient of determination (R2). Out of the 296 hydropower reservoirs, the NRMSE is > 0.25 (i.e., considering 0.25 to represent a moderate difference) for over 44 % of the 296 reservoirs when comparing both the simulated reservoir releases and storage time series between the two simulations. We suggest that correctly representing hydropower reservoirs in GHMs could have important implications for our understanding and management of freshwater resource challenges at regional-to-global scales. This enhanced global water management modeling framework will allow the analysis of future global reservoir development and management from a coupled human–earth system perspective.

Analysis of Building Construction Jobsite Accident Scenarios Based on Big Data Association Analysis

Analysis of Building Construction Jobsite Accident Scenarios Based on Big Data Association Analysis

Radau- and Lobatto-type averaged Gauss rules

We describe numerical methods for the construction of interpolatory quadrature rules of Radau and Lobatto types. In particular, we are interested in deriving efficient algorithms for computing optimal averaged Gauss–Radau and Gauss–Lobatto type javascript:undefined;quadrature rules. These averaged rules allow us to estimate the quadrature error in Gauss–Radau and Gauss–Lobatto quadrature rules. This is important since the latter rules have higher algebraic degree of exactness than the corresponding Gauss rules, and this makes it possible to construct averaged quadrature rules of higher algebraic degree of exactness than the corresponding “standard” averaged Gauss rules available in the literature.