The primary aim of this paper is to critically evaluate the deductive model of ethical applications, which is based on normative ethical theories like deontology and consequentialism, and to show why a number of models have failed to furnish appropriate resolutions to practical moral problems. Here, for the deductive model, I want to call it a “Linear Mechanical Model” because the basic assumption of this model is that if a normative theory is sacrosanct, then the case is as it is. (...) The conclusion derived from the case will also be correct, true and acceptable. However, traditional ethicists used to apply their ethical theories, but they did not know which moral theory was effective on the ground level of reality. The study will show readers how ethical theories are in conflict with each other in the case of euthanasia. In more precise words, “which ethical theories are said to be applied, meta-ethical or normative, or both for the resolution of ethical problems? If normative theories are said to be applied, how the application can take place when it is contrary to our experience, that (then) in a situation of moral crises, no one really applies a theory?” For that, my argument is the linear model has failed because it is rigid, often ignores the agents’ intrinsic values, and has no space to amend it, no matter how bizarre the consequence is. Its alternative is the Inductive model. For that, the paper will take three moral principles (autonomy, beneficence including maleficence, and justice) of Beauchamp & Childress. This suggests us for resolving value-laden moral problems, we should consider some steps such as a) recognising moral issues to start with; b) developing the moral imagination; c) sharpening analytical/critical skills; d) testing out disagreements; e) effecting decisions and behavior; and f) implementation, closure, and process are of vital importance, in other words, it starts with the free and informed consensus of all interested parties, but this model also has been failed because the model could not give a systematic organization to their way of resolution. Here, my argument is that the inductive model provides resolution of the practical problem but ignores what is ethically obligatory, permissible, or wrong in that situation, and there are no appropriate suggestions in the case of a moral crisis. (shrink)

Bipolar soft set is formulated by two soft sets; one of them provides us the positive information and the other provides us the negative information. The philosophy of bipolarity is that human judgment is based on two sides, positive and negative, and we choose the one which is stronger. In this paper, we introduce novel belong and nonbelong relations between a bipolar soft set and an ordinary point. These relations are considered as one of the unique characteristics of bipolar soft (...) sets which are somewhat expression of the degrees of membership and nonmembership of an element. We discuss essential properties and derive the sufficient conditions of some equivalence of these relations. We also define the concept of soft mappings between two classes of bipolar soft sets and study the behaviors of an ordinary point under these soft mappings with respect to all relations introduced herein. Then, we apply bipolar soft sets to build an optimal choice application. We give an algorithm of this application and show the method for implementing this algorithm by an illustrative example. In conclusion, it can be noted that the relations defined herein give another viewpoint to explore the concepts of bipolar soft topology, in particular, soft separation axioms and soft covers. (shrink)

Although not a professional historian, the author raises several issues pertinent to the state of history today.Qualifying the "non-historian" as an "able" interventionist in historical studies, the author explores the relationship between ...

Product Dimensions: 8.6 x 5.6 x 1.1 inches Description: Very little is known about the author of this book apart from the facts that he is a retired Government of India officer, now in his late nineties, apparently hoary, but healthy. When requested for more bio-data, he wrote back…The Real author of the Original Yoga is the Lord Siva. In the mundane world, Patanjali is the prime propagator of yoga. Any other claim to authorship, therefore, cannot but be spurious. …It (...) is Truth that matters, not the utterer of the Truth. No Truth ever becomes a bit truer even when repeated by the most distinguished person. …Hence all genuine aspirants of yoga should be content to remain unknown and unnoticed by others. His other published work is Hindu Concept of Life and Death. (shrink)

In a simple theory with elimination of finitary hyperimaginaries if tp(a) is real and analysable over a definable set Q, then there exists a finite sequence ( $a_{i}|i \leq n^{*}$ ) $\subseteq dcl^{eq}$ (a) with $a_{n}*$ = a such that for every $i \leq n*$ , if $p_{i} = tp(a_{i}/{a_{i}|j < i}$ ) then $Aut(p_{i}/Q)$ is type-definable with its action on $p_{i}^{c}$ . A unidimensional simple theory eliminates the quantifier $\exists^{\infty}$ and either interprets (in $C^{eq}$ ) an infinite type-definable group (...) or has the property that ACL(Q) = C for every infinite definable set Q. (shrink)

We show that a Kueker simple theory eliminates Ǝ∞ and densely interprets weakly minimal formulas. As part of the proof we generalize Hrushovski's dichotomy for almost complete formulas to simple theories. We conclude that in a unidimensional simple theory an almost-complete formula is either weakly minimal or trivially-almost-complete. We also observe that a small unidimensional simple theory is supersimple of finite SU-rank.

Since the conceptualization of unethical pro-organizational behavior ten years ago, scholarly interest in exploring this phenomenon has multiplied. Given a burgeoning body of empirical research, a review of unethical pro-organizational behavior literature is warranted. This study, therefore, systematically reviews the extant literature on unethical pro-organizational behavior and presents a comprehensive theory-based review of the past developments in this field. We classify previous studies based on their underlying theoretical perspectives and discuss the antecedents and consequences of unethical pro-organizational behavior in work (...) context. We also explicate the boundary conditions under which the influence of these antecedents gets accentuated or alleviated. Overall, this study synthesizes past knowledge to elucidate why, how, and when unethical pro-organizational behavior unfolds in the workplace. Finally, the gaps in the extant theorization are identified and an agenda for future research is proposed. (shrink)

BackgroundBurnout is a syndrome that results from stressors in the work environment that have not been successfully managed. The prevalence of burnout among schoolteachers was always controversial. COVID-19 pandemic added more stressors to teachers since they had to change their working styles in response to the pandemic lockdowns or curfews. In Saudi Arabia, the prevalence and determinants of burnout among school teachers were not measured by any other group during the COVID-19 pandemic stressors.MethodsA cross-sectional survey was conducted among 879 teachers (...) in the Jazan region, Saudi Arabia, using the Maslach Burnout Inventory, during April 2021. Multistage cluster random sampling was used.ResultsThe mean age of the participants was 41.4 years. Male teachers represented 52.6% of the participants while females represented 47.4%. Most teachers showed burnout symptoms. Consequences of burnout were observed, such as using psychotropic medications, absenteeism, lack of job satisfaction, and changing schools. Using the MBI scale, most teachers showed medium or high emotional exhaustion, low depersonalization, and low personal accomplishment.ConclusionMost teachers showed symptoms of burnout during the COVID-19 pandemic. Being an expert and ability to adapt to technology during the COVID-19 pandemic proved to effectively reduce burnout symptoms. Increasing incentives, early detection, and improving the work environment is recommended to diminish burnout consequences. (shrink)

Let T be a simple L-theory and let \ be a reduct of T to a sublanguage \ of L. For variables x, we call an \-invariant set \\) in \ a universal transducer if for every formula \\in L^-\) and every a, $$\begin{aligned} \phi ^-\ L^-\text{-forks } \text{ over }\ \emptyset \ \text{ iff } \Gamma \wedge \phi ^-\ L\text{-forks } \text{ over }\ \emptyset. \end{aligned}$$We show that there is a greatest universal transducer \ and it is type-definable. In (...) particular, the forking topology on \\) refines the forking topology on \\) for all y. Moreover, we describe the set of universal transducers in terms of certain topology on the Stone space and show that \ is the unique universal transducer that is \-type-definable with parameters. If \ is a theory with the wnfcp and T is the theory of its lovely pairs of models we show that \\) and give a more precise description of the set of universal transducers for the special case where \ has the nfcp. (shrink)

In the domain of legal information retrieval, an important challenge is to compute similarity between two legal documents. Precedents play an important role in The Common Law system, where lawyers need to frequently refer to relevant prior cases. Measuring document similarity is one of the most crucial aspects of any document retrieval system which decides the speed, scalability and accuracy of the system. Text-based and network-based methods for computing similarity among case reports have already been proposed in prior works but (...) not without a few pitfalls. Since legal citation networks are generally highly disconnected, network based metrics are not suited for them. Till date, only a few text-based and predominant embedding based methods have been employed, for instance, TF-IDF based approaches, Word2Vec and Doc2Vec based approaches. We investigate the performance of 56 different methodologies for computing textual similarity across court case statements when applied on a dataset of Indian Supreme Court Cases. Among the 56 different methods, thirty are adaptations of existing methods and twenty-six are our proposed methods. The methods studied include models such as BERT and Law2Vec. It is observed that the more traditional methods that rely on a bag-of-words representation performs better than the more advanced context-aware methods for computing document-level similarity. Finally we nominate, via empirical validation, five of our best performing methods as appropriate for measuring similarity between case reports. Among these five, two are adaptations of existing methods and the other three are our proposed methods. (shrink)

We show that in a simple theory T in which the τf-topologies are closed under projections every type analyzable in a supersimple τf-open set has ordinal SU-rank. In particular, if in addition T is unidimensional, the existence of a supersimple unbounded τf-open set implies T is supersimple. We also introduce the notion of a standard τ-metric and show that for simple theories its completeness is equivalent to the compactness of the τ-topology.

The binding group theorem for stable theories is partially extended to the simple context. Some results concerning internality are proved. We also introduce a ‘small’ normal subgroup G0+ of the automorphism group and show that if p is Q-internal then it has a finite exponent and G/G0+ is interpretable.

Clinical equipoise links ethically appropriate medical research with medical research that has the reasonable chance of resolving debates. We argue against this principle on the ground that most debates in medicine cannot be resolved by the outcomes of any particular empirical study. In fact, a deep understanding of the methodology of scientific research leads to the conclusion that adopting clinical equipoise as an ethical standard for medical research would deprive medical researchers of the ability to confirm clinical hypotheses.

Let T be simple, work in Ceq over a boundedly closed set. Let p ∈ S(θ) be internal in a quasi-stably-embedded type-definable set Q (e.g., Q is definable or stably-embedded) and suppose (p, Q) is ACL-embedded in Q (see definitions below). Then Aut(p/Q) with its action on pC is type-definable in Ceq over θ. In particular, if p ∈ S(θ) is internal in a stably-embedded type-definable set Q, and pC υ Q is stably-embedded, then Aut(p/Q) is type-definable with its action (...) on pC. (shrink)

We point out some connections between existence of homogenous sets for certain edge colorings and existence of branches in certain trees. As a consequence, we get that any locally additive coloring (a notion introduced in the paper) of a cardinal κ has a homogeneous set of size κ provided that the number of colors μ satisfies. Another result is that an uncountable cardinal κ is weakly compact if and only if κ is regular, has the tree property, and for each (...) there exists such that every tree of height μ with λ nodes has less than branches. (shrink)

We discuss a simple logic to describe one of our favourite games from childhood, hide and seek, and show how a simple addition of an equality constant to describe the winning condition of the seeker makes our logic undecidable. There are certain decidable fragments of first-order logic which behave in a similar fashion and we add a new modal variant to that class of logics. We also discuss the relative expressive power of the proposed logic in comparison to the standard (...) modal counterparts. (shrink)

When agents know a protocol, this leads them to have expectations about future observations. Agents can update their knowledge by matching their actual observations with the expected ones. They eliminate states where they do not match. In this paper, we study how agents perceive protocols that are not commonly known, and propose a semantics-driven logical framework to reason about knowledge in such scenarios. In particular, we introduce the notion of epistemic expectation models and a propositional dynamic logic-style epistemic logic for (...) reasoning about knowledge via matching agentsÊ expectations to their observations. It is shown how epistemic expectation models can be obtained from epistemic protocols. Furthermore, a characterization is presented of the effective equivalence of epistemic protocols. We introduce a new logic that incorporates updates of protocols and that can model reasoning about knowledge and observations. Finally, the framework is extended to incorporate fact-changing actions, and a worked-out example is given. © 2013 Elsevier B.V. (shrink)

We extend the dichotomy between 1-basedness and supersimplicity proved in Shami :309–332, 2011). The generalization we get is to arbitrary language, with no restrictions on the topology [we do not demand type-definabilty of the open set in the definition of essential 1-basedness from Shami :309–332, 2011)]. We conclude that every hypersimple unidimensional theory that is not s-essentially 1-based by means of the forking topology is supersimple. We also obtain a strong version of the above dichotomy in the case (...) where the language is countable. (shrink)

This paper analyzes the treatment of nature and technology in the writings of two prominent early Zionist thinkers, A. D. Gordon and Theodor Herzl. At the heart of Herzl’s vision, we find technocrats applying industrial systems to dominate the naked nature that Gordon is committed to preserve. Gordon, in contrast, describes Jewish national revival as triggered by farmers utilizing Eretz Israel’s natural world to extract Jews from industrial society, underwriting Herzl’s Zionist vision. Expanding the analysis to the domains of nature (...) and technology reveals the two thinkers’ creeds to be rival Zionist ideologies in which nature and technology serve as catalysts for competing visions of national revival. (shrink)

We make a proposal for formalizing simultaneous games at the abstraction level of player’s powers, combining ideas from dynamic logic of sequential games and concurrent dynamic logic. We prove completeness for a new system of ‘concurrent game logic’ CDGL with respect to finite non-determined games. We also show how this system raises new mathematical issues, and throws light on branching quantifiers and independence-friendly evaluation games for first-order logic.

In a Common Law system, legal practitioners need frequent access to prior case documents that discuss relevant legal issues. Case documents are generally very lengthy, containing complex sentence structures, and reading them fully is a strenuous task even for legal practitioners. Having a concise overview of these documents can relieve legal practitioners from the task of reading the complete case statements. Legal catchphrases are (multi-word) phrases that provide a concise overview of the contents of a case document, and automated generation (...) of catchphrases is a challenging problem in legal analytics. In this paper, we propose a novel supervised neural sequence tagging model for the extraction of catchphrases from legal case documents. Specifically, we show that incorporating document-specific information along with a sequence tagging model can enhance the performance of catchphrase extraction. We perform experiments over a set of Indian Supreme Court case documents, for which the gold-standard catchphrases (annotated by legal practitioners) are obtained from a popular legal information system. The performance of our proposed method is compared with that of several existing supervised and unsupervised methods, and our proposed method is empirically shown to be superior to all baselines. (shrink)

The non‐forking‐instances topology (NFI topology) is a topology on the Stone space of a theory T that depends on a reduct of T. This topology has been used in [6] to describe the set of universal transducers for (invariants sets that translate forking‐open sets in to forking‐open sets in T). In this paper we show that in contrast to the stable case, the NFI topology need not be invariant over parameters in but a weak version of this holds for any (...) simple T. We also note that for the lovely pair expansions, of theories with the weak non‐finite cover property (wnfcp), the topology is invariant over in. (shrink)

BackgroundPalliative sedation and analgesia are employed in patients with refractory and intractable symptoms at the end of life to reduce their suffering by lowering their level of consciousness. The doctrine of double effect, a philosophical principle that justifies doing a “good action” with a potentially “bad effect,” is frequently employed to provide an ethical justification for this practice. Main textWe argue that palliative sedation and analgesia do not fulfill the conditions required to apply the doctrine of double effect, and therefore (...) its use in this domain is inappropriate. Furthermore, we argue that the frequent application of the doctrine of double effect to palliative sedation and analgesia reflects physicians’ discomfort with the complex moral, intentional, and causal aspects of end-of-life care. ConclusionsWe are concerned that this misapplication of the doctrine of double effect can consequently impair physicians’ ethical reasoning and relationships with patients at the end of life. (shrink)

We show that if p is a real type which is almost internal in a formula φ in a simple theory, then there is a type p' interalgebraic with a finite tuple of realizations of p, which is generated over φ. Moreover, the group of elementary permutations of p' over all realizations of φ is type-definable.

The task of rhetorical role labeling is to assign labels (such as Fact, Argument, Final Judgement, etc.) to sentences of a court case document. Rhetorical role labeling is an important problem in the field of Legal Analytics, since it can aid in various downstream tasks as well as enhances the readability of lengthy case documents. The task is challenging as case documents are highly various in structure and the rhetorical labels are often subjective. Previous works for automatic rhetorical role identification (...) (i) mainly used Conditional Random Fields over manually handcrafted features, and (ii) focused on certain law domains only (e.g., Immigration cases, Rent law), and a particular jurisdiction/country (e.g., US, Canada, India). In this work, we improve upon the prior works on rhetorical role identification by proposing novel Deep Learning models for automatically identifying rhetorical roles, which substantially outperform the prior methods. Additionally, we show the effectiveness of the proposed models over documents from five different law domains, and from two different jurisdictions—the Supreme Court of India and the Supreme Court of the UK. Through extensive experiments over different variations of the Deep Learning models, including Transformer models based on BERT and LegalBERT, we show the robustness of the methods for the task. We also perform an extensive inter-annotator study and analyse the agreement of the predictions of the proposed model with the annotations by domain experts. We find that some rhetorical labels are inherently hard/subjective and both law experts and neural models frequently get confused in predicting them correctly. (shrink)

We generalize Shelah's analysis of cardinality quantifiers for a superstable theory from Chapter V of Classification Theory and the Number of Nonisomorphic Models. We start with a set of bounds for the cardinality of each formula in some general invariant family of formulas in a superstable theory (in Classification Theory, a uniform family of formulas is considered) and find a set of derived bounds for all formulas. The set of derived bounds is sharp: up to a technical restriction, every model (...) that satisfies the original bounds has a sufficiently saturated elementary extension that satisfies the original bounds and such that for each formula the set of its realizations in the extension has arbitrarily large cardinality below the corresponding derived bound of the formula. (shrink)

The Transforming growth factor beta (TGF‐β) family of secreted proteins regulates a variety of key events in normal development and physiology. In mammals, this family, represented by 33 ligands, including TGF‐β, activins, nodal, bone morphogenetic proteins (BMPs), and growth and differentiation factors (GDFs), regulate biological processes as diverse as cell proliferation, differentiation, apoptosis, metabolism, homeostasis, immune response, wound repair, and endocrine functions. In Drosophila, only 7 members of this family are present, with 4 TGF‐β/BMP and 3 TGF‐β/activin ligands. Studies in (...) the fly have illustrated the role of TGF‐β/BMP ligands during embryogenesis and organ patterning, while the TGF‐β/activin ligands have been implicated in the control of wing growth and neuronal functions. In this review, we focus on the emerging roles of Drosophila TGF‐β/activins in inter‐organ communication via long‐distance regulation, especially in systemic lipid and carbohydrate homeostasis, and discuss findings relevant to metabolic diseases in humans. -/- . (shrink)

Connected vehicle fleets have formed significant component of industrial internet of things scenarios as part of Industry 4.0 worldwide. The number of vehicles in these fleets has grown at a steady pace. The vehicles monitoring with machine learning algorithms has significantly improved maintenance activities. Predictive maintenance potential has increased where machines are controlled through networked smart devices. Here, benefits are accrued considering uptimes optimization. This has resulted in reduction of associated time and labor costs. It has also provided significant increase (...) in cost benefit ratios. Considering vehicle fault trends in this research predictive maintenance problem is addressed through hybrid deep learning-based ensemble method (HDLEM). The ensemble framework which acts as predictive analytics engine comprises of three deep learning algorithms viz modified cox proportional hazard deep learning (MCoxPHDL), modified deep learning embedded semi supervised learning (MDLeSSL) and merged LSTM (MLSTM) networks. Both sensor as well as historical maintenance data are collected and prepared using benchmarking methods for HDLEM training and testing. Here, times between failures (TBF) modeling and prediction on multi-source data are successfully achieved. The results obtained are compared with stated deep learning models. This ensemble framework offers great potential towards achieving more profitable, efficient and sustainable vehicle fleet management solutions. This helps better telematics data implementation which ensures preventative management towards desired solution. The ensemble method's superiority is highlighted through several experimental results. (shrink)

Summarization of legal case judgement documents is a practical and challenging problem, for which many summarization algorithms of different varieties have been tried. In this work, rather than developing yet another summarization algorithm, we investigate if intelligently ensembling (combining) the outputs of multiple (base) summarization algorithms can lead to better summaries of legal case judgements than any of the base algorithms. Using two datasets of case judgement documents from the Indian Supreme Court, one with extractive gold standard summaries and the (...) other with abstractive gold standard summaries, we apply various ensembling techniques on summaries generated by a wide variety of summarization algorithms. The ensembling methods applied range from simple voting-based methods to ranking-based and graph-based ensembling methods. We show that many of our ensembling methods yield summaries that are better than the summaries produced by any of the individual base algorithms, in terms of ROUGE and METEOR scores. (shrink)

Student support services are the cardinal features of the Open and Distance Learning System. In India, the Indira Gandhi National Open University, 13 state open universities and over 200 Distance Education Institutes attached to conventional universities and private/autonomous institutes offering programmes through the distance mode have all created adequate provisions for learner support services and the systems, rules, regulations and norms have been put in place. However, it is significant that a learner in the ODL system remains away from the (...) teacher and the peer group. Thus, the learner feels isolated and needs the empathy of all the functionaries concerned. It has been our experience at IGNOU that more often than not the functionaries fail to realize the value of a learner and the learner fails to understand the value attributed to him by the ODL system. Without such realization the rules and regulations lose their significance. Hence, inculcation of values is of paramount importance in the functioning of the ODL system. In this article we have discussed about ‘inculcation of values’ among the ‘learners’ as well as the ‘functionaries’ for developing ‘best practices’ in learner support services in the ODL system. The inputs are based primarily on direct experiences of the authors. (shrink)

We make a proposal for formalizing simultaneous games at the abstraction level of player's powers, combining ideas from dynamic logic of sequential games and concurrent dynamic logic. We prove completeness for a new system of 'concurrent game logic' CDGL with respect to finite non-determined games. We also show how this system raises new mathematical issues, and throws light on branching quantifiers and independence-friendly evaluation games for first-order logic.

We make a proposal for formalizing simultaneous games at the abstraction level of player’s powers, combining ideas from dynamic logic of sequential games and concurrent dynamic logic. We prove completeness for a new system of ‘concurrent game logic’ CDGL with respect to finite non-determined games. We also show how this system raises new mathematical issues, and throws light on branching quantifiers and independence-friendly evaluation games for first-order logic.

India’s energy demand is predicted to rise by 135% within a span of 20 years. Coping up with surging energy demands requires several reforms in both renewable and non-renewable sectors. Factors such as rising population, reduction in the cost of renewable energy technology and their effect on the nation’s GDP, can make policy making a herculean task and the justification for such policies, quite opaque to the public. Artificial Intelligence technology can help decision makers to quickly draw conclusions from voluminous (...) datasets under different heads. However, AI results need to be post-processed so that they are easily understood by the layperson. This paper focuses on using Sankey diagrams as a post-processing tool for AI systems. Policy formulation often requires an overall assessment of energy sources, production pathways, end used destinations and wastage encountered—these can be easily visualized with a Sankey diagram. For this work, a Sankey protocol was written out in a form where a prompt asks the user to supply information through a spreadsheet interfaced with a customized mobile app—a first anywhere in the subcontinent. India’s mobile sector is vibrant, and the paper presents a enabling the user to have a handle on the dynamics of energy distribution locally. The app gives an instant feel of the apportioned energy across grids, the projected changes for the next decade, the efficiency and feasibility of each sector and lastly a telling visual representation showing the main strengths and weaknesses in the energy sector. (shrink)