Number Of Successors Research Articles

Coalgebraic Reasoning with Global Assumptions in Arithmetic Modal Logics

We establish a generic upper bound ExpTime for reasoning with global assumptions (also known as TBoxes) in coalgebraic modal logics. Unlike earlier results of this kind, our bound does not require a tractable set of tableau rules for the instance logics, so that the result applies to wider classes of logics. Examples are Presburger modal logic, which extends graded modal logic with linear inequalities over numbers of successors, and probabilistic modal logic with polynomial inequalities over probabilities. We establish the theoretical upper bound using a type elimination algorithm. We also provide a global caching algorithm that potentially avoids building the entire exponential-sized space of candidate states, and thus offers a basis for practical reasoning. This algorithm still involves frequent fixpoint computations; we show how these can be handled efficiently in a concrete algorithm modelled on Liu and Smolka’s linear-time fixpoint algorithm. Finally, we show that the upper complexity bound is preserved under adding nominals to the logic, i.e., in coalgebraic hybrid logic.

EVALUATION OF MARE FAMILIES OF ORLOV’S TROTTER OF UKRAINIAN POPULATION HORSES

It was found that the domestic population of horses of the Orlov’s Trotter breed is 465 individuals, including mares of reproductive age - only 193, which indicates a significant limitation of this breed. The most numerous uterine families by number of successors: Vorozheyka and Fatma (8.3% in the uterine composition), Rumba (7.8% in the uterine composition) and Cadetka (7.3% in the uterine composition). Only 12 mares (6.2%) belong to a small number of uterine families, numbering 1-2 mares (Aristocratka, Kaluga, Pusti, Damochka, Zib, Lelya, Levitsa, Panika, Pika). The analyzed uterine families number from 3 to 10 generations from the ancestor to the representatives of the modern uterine composition. Evaluation of mare families on a set of breeding traits found that the highest liveliness at a classical distance of 1600 m on average characterized mares belonging to the uterine families of Lena (2.11,4 ± 0,65 min), Uh-Kakaya (2.12.2±0,28 min), Dosujaya (2.13,4±0,18 min), Barvikha (2.15,3±0,41 min), Vorojeyka (2.15,7±0,15 min), Cadetka (2.15,8± 0,22 min). The quietest mares belong to the parent families of Povest, Evil, Molodytsa, Kaleria. Mares from the mare families of Lena, Vorojeyka and Molodytsa differ in terms of measurement indicators. They are characterized by high stature, elongated body shape, typical of the harness type of horses, bulky chest. In terms of wrist circumference, all assessed mares do not exceed 20.8 cm, which indicates an insufficient level of skeletal development and, accordingly, is not negatively affected by agility. By dividing into gradations by liveliness classes, it was established that mares of the Orlov’s Trotter breed of the Ukrainian population of liveliness class 2.05 min and more vigorous were not detected. Of all tested mares (76.2 %), only 12.2 % have a high liveliness class of 2.10 min or more. However, mares of low liveliness class (2.30,1 min and quieter) are few - 10.9 %. The predominant number of mares have an average liveliness class of 2.10,1-2.20 min (55.1 %) and 2.20,1-2,30 min (21.8 %). Almost a quarter of mares (23.8 %) remain untested, which negatively affects the selection process. Most mares of high vitality class belong to the parent families: Barvikha, Dan’, Dosuzhaya, Rumba, Uh-Kakaya.

Characterizing fuzzy simulations for fuzzy labeled transition systems in fuzzy propositional dynamic logic

We formulate and prove logical characterizations of fuzzy simulations for fuzzy labeled transition systems under the Gödel semantics. Apart from the usual setting, we consider also the setting that allows graded modal operators, which are used to talk about the number of successors with a certain property of the current state. Our characterizations are formulated w.r.t. the existential fragment of fuzzy propositional dynamic logic and its extension with graded modal operators. The results concern fuzzy preservation of existential modal formulas under fuzzy simulations as well as the Hennessy-Milner property of fuzzy simulations.

A max-min ant system for the finance-based scheduling problem

Construction contractors depend on bank overdrafts to finance their expenses; however, these overdrafts cannot exceed an imposed Credit Line (CL). The Finance-Based Scheduling Problem (FBSP) is about scheduling activities without exceeding the CL. In this paper, we provide a more eloquent formulation of the FBSP and list its different variants. Three Max-Min Ant System (MMAS) algorithms, which use different heuristic information when generating solutions, are then developed to solve the FBSP. To test the MMAS algorithms, we generate 60 instances that are used to tune the MMAS algorithms and then use these algorithms to solve the generated instances. The found solutions are compared with the best bounds found using a Branch and Bound (B&B) algorithm. A 0.6% improvement is achieved by the B&B algorithm when compared to the best results found by the MMAS algorithms; moreover, the comparison shows that using the number of successors as heuristic outperformed other heuristics. Furthermore, the MMAS algorithm outperformed other meta-heuristics that use repair operators or penalize infeasible solutions in terms of computation time while having comparable solution values.

Hierarchical beam search for solving most relevant explanation in Bayesian networks

Most Relevant Explanation (MRE) is an inference problem in Bayesian networks that finds the most relevant partial instantiation of target variables as an explanation for given evidence. It has been shown in recent literature that it addresses the overspecification problem of existing methods, such as MPE and MAP. In this paper, we propose a novel hierarchical beam search algorithm for solving MRE. The main idea is to use a second-level beam to limit the number of successors generated by the same parent so as to limit the similarity between the solutions in the first-level beam and result in a more diversified population. Three pruning criteria are also introduced to achieve further diversity. Empirical results show that the new algorithm outperforms local search and regular beam search.

Station ant colony optimization for the type 2 assembly line balancing problem

An improved ant colony optimization (ACO), namely, station ant colony optimization (SACO), is proposed to solve the type 2 assembly line balancing problem (ALBP-2). In the algorithm, ACO is employed to search different better combinations of tasks (component solutions) for each station; an iteration compress mechanism is proposed to reduce the searching space of feasible solutions of ALBP-2. Three heuristic factors [i.e., (1) task time, (2) number of successors, and (3) number of releasable successors], two pheromones, and a task assignment mechanism are proposed to search better component solutions for every station. Finally, the effectiveness and stability of SACO are confirmed through comparison with literatures in 23 instances included in nine examples.

New technologies and systems for high quality citrus fruit production, labor-saving and orchard construction in mountain areas of Japan

Novel technologies have been necessary for improving fruit quality and productivity of citrus, labor-saving and orchard conservation on steep slope lands since aging of growers and decrease in the number of successors is remarkable in mountain areas of southwestern Japan. The purpose of this paper is to introduce new technologies for improving citrus production that have been developed in recent years. A new fruit quality control system using drip irrigation and liquid fertilization technique combined with year-round plastic mulching was developed, and it enables high quality and stable citrus fruit production. Water and/or nutrient solution is automatically su:lied through drip tubes that are laid under the mulching sheets to give adequate water stress, so as to improve sugar and acid content of fruit. A new transportation system for steep sloping citrus orchards, which is a combination of the monorail system and contour narrow paths, was suggested. A small walking cultivator was developed to explain the procedure of narrow path excavation. After introducing the narrow path, working hours for fertilizer and chemical herbicide a:lication were reduced. Disaster prevention ma:ing of citrus orchards on slope lands was developed based on computer-aided seepage estimation and topographic data. The ma:ing can show zones of both ascending flow and descending flow of underground water during heavy rains in citrus orchards. The ma:ing is considered to be effective for the management of orchards and prevention of erosion on slope lands.

After Theory: From Textuality to Attunement with the World

In its heyday-the decade after 1968-theory could mean almost anything, from Deleuze and Guattari's schizoanalysis to Habermas's seemingly endless defense of communicative rationality. No matter what word might have meant at time, however, people somehow sensed its importance, and they knew, if they knew absolutely nothing else, that had to do with the text. But now, almost thirty years afterward, people somehow sense that is pass6, and they know, if they still pay attention at all, that it has been displaced by any number of successors: by New Historicism, for instance, and by studies, and by eclectic mix referred to as post-theory. While terms like cultural studies and post-theory circulate as loosely as theory did in its brief golden age, theory's successors all share among themselves at least one identifying feature-a commitment to descending from textuality into particulars of everyday life. Yet today is anything but dead, and it survives through movements that claim to have left it behind. When Judith Butler in Gender Trouble sets out to rethink logic of heterosexuality, she calls on Derrida. When Homi Bhabha, in Redrawing Boundaries, starts to map new terrain of postcolonial studies, he goes back to Barthes and Bakhtin. Although we tend to see ourselves as working in era after theory, truth may be far more complicated-and also far more troubling. We are, perhaps, trapped in theory, and trapped so inextricably that even our most careful efforts to escape keep returning us to isolation that drove us from in first place. And now, when future of our profession has begun to look uncomfortably like a rerun of our past, moment may have come for us to admit that itself brought us here. If world is not a text, then

A Heuristic Approach to General Assembly Line Balancing

A method for balancing a single‐model assembly line is described which incorporates various constraining features such as fixed position, positive and negative zoning, multiple parallel stations, etc. It can easily be extended for multiple manning of stations. First a priority list of the elements is formed. For each element, its elemental time is added to those of its total number of successors. The list is then rearranged in non‐increasing order. The method has been tested by solving a large number of randomly generated problems. A computer program has been developed for the generalised method.

A Low Complexity Stack Decoder for a Class of Binary Rate (n-1)/n Convolutional Codes

In this paper we discuss the implementation of a modified stack decoder for a class of binary rate R = (n - 1)/n convolutional codes used on a binary symmetric channel (BSC). For large values of n , the classical implementation of the stack decoder quickly becomes impractical, as each extension of an information sequence estimate gives rise to 2^{(n-1)} successor estimates. A Fano type of sequential decoder is then preferable. However, by using the structure of a class of systematic rate (n - 1)/n codes, with optimum distance profile (ODP), we are able to modify the classical stack decoder such that it is of comparable complexity. The average number Of stack reorganizations, as well as the average number of successors per extension, can be reduced considerably, without increase of decoding error probability.