It has been argued that the Duhem problem is renewed with computational models since model assumptions having a representational aim and computational assumptions cannot be tested in isolation. In particular, while the Verification and Validation methodology is supposed to prevent such holism, Winsberg argues that verification and validation cannot be separated in practice. Morrison replies that Winsberg overstates the entanglement between the steps. The paper aims at arbitrating these two positions, by stressing their respective validity in (...) relation to domains of application. It importantly argues for an increasing use of formal methods in verification, that makes disentanglement possible. (shrink)

Verification and validation of computer codes and models used in simulation are two aspects of the scientific practice of high importance and have recently been discussed by philosophers of science. While verification is predominantly associated with the correctness of the way a model is represented by a computer code or algorithm, validation more often refers to model’s relation to the real world and its intended use. It has been argued that because complex simulations are generally not (...) transparent to a practitioner, the Duhem problem can arise for verification and validation due to their entanglement; such an entanglement makes it impossible to distinguish whether a coding error or model’s general inadequacy to its target should be blamed in the case of the model failure. I argue that in order to disentangle verification and validation, a clear distinction between computer modeling and simulation needs to be made. Holding on to that distinction, I propose to relate verification to modeling and validation, which shares the common epistemology with experimentation, to simulation. To explain reasons of their intermittent entanglement I propose a weberian ideal-typical model of modeling and simulation as roles in practice. I suggest an approach to alleviate the Duhem problem for verification and validation generally applicable in practice and based on differences in epistemic strategies and scopes. (shrink)

Verification and validation of computer codes and models used in simulations are two aspects of the scientific practice of high importance that recently have been discussed widely by philosophers of science. While verification is predominantly associated with the correctness of the way a model is represented by a computer code or algorithm, validation more often refers to the model’s relation to the real world and its intended use. Because complex simulations are generally opaque to a practitioner, (...) the Duhem problem can arise with verification and validation due to their entanglement; such an entanglement makes it impossible to distinguish whether a coding error or the model’s general inadequacy to its target should be blamed in the case of a failure. I argue that a clear distinction between computer modeling and simulation has to be made to disentangle verification and validation. Drawing on that distinction, I suggest to associate modeling with verification and simulation, which shares common epistemic strategies with experimentation, with validation. To explain the reasons for their entanglement in practice, I propose a Weberian ideal–typical model of modeling and simulation as roles in practice. I examine an approach to mitigate the Duhem problem for verification and validation that is generally applicable in practice and is based on differences in epistemic strategies and scopes. Based on this analysis, I suggest two strategies to increase the reliability of simulation results, namely, avoiding alterations of verified models at the validation stage as well as performing simulations of the same target system using two or more different models. In response to Winsberg’s claim that verification and validation are entangled I argue that deploying the methodology proposed in this work it is possible to mitigate inseparability of V&V in many if not all domains where modeling and simulation are used. (shrink)

Verification and validation of numerical models of natural systems is impossible. This is because natural systems are never closed and because model results are always nonunique. Models can be confirmed by the demonstration of agreement between observation and prediction, but confirmation is inherently partial. Complete confirmation is logically precluded by the fallacy of affirming the consequent and by incomplete access to natural phenomena. Models can only be evaluated in relative terms, and their predictive value is always open to (...) question. The primary value of models is heuristic. (shrink)

Verification and validation are methods with which computer simulations are tested. While many practitioners draw a clear line between verification and validation and demand that the former precedes the latter, some philosophers have suggested that the distinction has been over-exaggerated. This chapter clarifies the relationship between verification and validation. Regarding the latter, validation of the conceptual and of the computational modelComputational model are distinguished. I argue that, as a method, verification is clearly (...) different from validation of either of the models. However, the methods are related to each other as follows: If we allow that the validation of the computational model need not include the comparisonComparison between simulation output and measured data, then the computational model may be validated by validating the conceptual model independently and by verifying the simulation with respect to it. This is often not realistic, however, because, in most cases, the conceptual modelConceptual model cannot be validated independently from the simulation. In such cases, the computational modelComputational model is verified with the aim to use it as an appropriate substitute for the conceptual model. Then simulation output is compared to measured data to validate both the computational and the conceptual model. I analyze the underlying inferences and argue that they require some prior confidence in the conceptual model and in verification. This suggests that verification precede validation that proceeds via a comparisonComparison between simulation outputOutput and measured data. Recent arguments to the effect that the distinction between verification and validation is not clear-cut do not refute these results, or so I argue against philosopher E. Winsberg. (shrink)

In this paper I will present a visual method that I have created to demonstrate the validity of propositional arguments and predicates, based on the traditional Venn diagrams. This idea was born after becoming aware of how useful visual methods are in other scientific fields, such as geometrical representations of arithmetic and algebraic concepts. This method illustrates the relationship between propositional logic, predicate logic and set theory, and it can be used to explain linguistic semantic concepts such as synonymy, antonymy, (...) hyponymy, entailment, and lexical substitution. (shrink)

Designing an ontology that meets the needs of end-users, e.g., a medical team, is critical to support the reasoning with data. Therefore, an ontology design should be driven by the constant and efficient validation of end-users needs. However, there is not an existing standard process in knowledge engineering that guides the ontology design with the required quality. There are several ontology design processes, which range from iterative to sequential, but they fail to ensure the practical application of an ontology (...) and to quantitatively validate end-user requirements through the evolution of an ontology. In this paper, an ontology design process is proposed, which is driven by end-user requirements, defined as Competency Questions. The process is called CQ-Driven Ontology DEsign Process and it includes activities that validate and verify the incremental design of an ontology through metrics based on defined CQs. CODEP has also been applied in the design and development of an ontology in the context of a Mexican Hospital for supporting Neurologist specialists. The specialists were involved, during the application of CODEP, in collecting quality measurements and validating the ontology increments. This application can demonstrate the feasibility of CODEP to deliver ontologies with similar requirements in other contexts. (shrink)

This study developed an online career adaptability improvement program as part of the undergraduate curriculum to improve college students’ career adaptability and verify its effectiveness. This 13-week intervention program, developed using the Korea-Career Adaptability Scale, consists of three domains: knowledge and recognition of the self and work environment, self-directed coping related to career behavior, and environmental interaction for career decisions and adaptation. Two sub-studies were conducted to achieve the research objectives: Study 1 included developing and testing a pilot program and (...) Study 2 quantitatively analyzed the final program to test its effectiveness. In Study 1, preliminary program development and validity were verified, and in Study 2, the effectiveness of the final program was verified. As a strategy to achieve the research purpose, in Study 1, literature review and needs analysis, program design reflecting the results of the needs analysis, validity verification through Delphi survey, preliminary program implementation and evaluation, and the operation of the final program were performed. To test the effectiveness of the program in Study 2, a pre-posttest of career adaptability was conducted on experimental, comparison, and control groups using the non-equivalent group pretest–posttest design, followed by a program satisfaction survey. This study is meaningful in that it developed an online program to help college students improve career adaptability and identified its effectiveness. This study yielded two results. First, it successfully developed a career adaptability improvement program for undergraduate students, wherein the career development tasks, and the sub-factors of career adaptability were organically interlinked. Second, it verified the statistically significant differences in the career adaptability scores among the experimental, comparison, and control groups. The highest mean score was obtained by participants in the experimental group, followed by the comparison and the control group. (shrink)

This paper presents the development andvalidation of new measurement tools to exploreself-efficacy toward service and toward civicparticipation. We developed and administereda survey to 851 students in an AACSB-accreditedcollege of business at a comprehensive publicuniversity located in the Midwest. Traditionalscale development methodologies plusconfirmatory factor analysis and simultaneousfactor analysis in several populations wereused to analyze both a primary sample and aholdback sample. Results strongly support thevalidity and reliability of the surveyinstrument. Future use for the instrumentincludes verification of the effectiveness ofpedagogies designed (...) to increase self-efficacytoward service and motivation for civicparticipation in business students. (shrink)

This unique volume introduces and discusses the methods of validating computer simulations in scientific research. The core concepts, strategies, and techniques of validation are explained by an international team of pre-eminent authorities, drawing on expertise from various fields ranging from engineering and the physical sciences to the social sciences and history. The work also offers new and original philosophical perspectives on the validation of simulations. Topics and features: introduces the fundamental concepts and principles related to the validation (...) of computer simulations, and examines philosophical frameworks for thinking about validation; provides an overview of the various strategies and techniques available for validating simulations, as well as the preparatory steps that have to be taken prior to validation; describes commonly used reference points and mathematical frameworks applicable to simulation validation; reviews the legal prescriptions, and the administrative and procedural activities related to simulation validation; presents examples of best practice that demonstrate how methods of validation are applied in various disciplines and with different types of simulation models; covers important practical challenges faced by simulation scientists when applying validation methods and techniques; offers a selection of general philosophical reflections that explore the significance of validation from a broader perspective. This truly interdisciplinary handbook will appeal to a broad audience, from professional scientists spanning all natural and social sciences, to young scholars new to research with computer simulations. Philosophers of science, and methodologists seeking to increase their understanding of simulation validation, will also find much to benefit from in the text. (shrink)

Every person has his/her own unique signature that is used mainly for the purposes of personal identification and verification of important documents or legal transactions. There are two kinds of signature verification: static and dynamic. Static(off-line) verification is the process of verifying an electronic or document signature after it has been made, while dynamic(on-line) verification takes place as a person creates his/her signature on a digital tablet or a similar device. Offline signature verification is not (...) efficient and slow for a large number of documents. To overcome the drawbacks of offline signature verification, we have seen a growth in online biometric personal verification such as fingerprints, eye scan etc. In this paper we created CNN model using python for offline signature and after training and validating, the accuracy of testing was 99.70%. (shrink)

Compositional verification aims at managing the complexity of theverification process by exploiting compositionality of the systemarchitecture. In this paper we explore the use of a temporal epistemiclogic to formalize the process of verification of compositionalmulti-agent systems. The specification of a system, its properties andtheir proofs are of a compositional nature, and are formalized within acompositional temporal logic: Temporal Multi-Epistemic Logic. It isshown that compositional proofs are valid under certain conditions.Moreover, the possibility of incorporating default persistence ofinformation in a (...) system, is explored. A completion operation on aspecific type of temporal theories, temporal completion, is introducedto be able to use classical proof techniques in verification withrespect to non-classical semantics covering default persistence. (shrink)

Semantic information is usually supposed to satisfy the veridicality thesis: p qualifies as semantic information only if p is true. However, what it means for semantic information to be true is often left implicit, with correspondentist interpretations representing the most popular, default option. The article develops an alternative approach, namely a correctness theory of truth (CTT) for semantic information. This is meant as a contribution not only to the philosophy of information but also to the philosophical debate on the nature (...) of truth. After the introduction, in Sect. 2, semantic information is shown to be translatable into propositional semantic information (i). In Sect. 3, i is polarised into a query (Q) and a result (R), qualified by a specific context, a level of abstraction and a purpose. This polarization is normalised in Sect. 4, where [Q + R] is transformed into a Boolean question and its relative yes/no answer [Q + A]. This completes the reduction of the truth of i to the correctness of A. In Sects. 5 and 6, it is argued that (1) A is the correct answer to Q if and only if (2) A correctly saturates Q by verifying and validating it (in the computer science’s sense of “verification” and “validation”); that (2) is the case if and only if (3) [Q + A] generates an adequate model (m) of the relevant system (s) identified by Q; that (3) is the case if and only if (4) m is a proxy of s (in the computer science’s sense of “proxy”) and (5) proximal access to m commutes with the distal access to s (in the category theory’s sense of “commutation”); and that (5) is the case if and only if (6) reading/writing (accessing, in the computer science’s technical sense of the term) m enables one to read/write (access) s. Sect. 7 provides some further clarifications about CTT, in the light of semantic paradoxes. Section 8 draws a general conclusion about the nature of CTT as a theory for systems designers not just systems users. In the course of the article all technical expressions from computer science are explained. (shrink)

Bayesian epistemologyEpistemology offers a powerful framework for characterizing scientific inference. Its basic idea is that rational belief comes in degrees that can be measured in terms of probabilities. The axioms of the probability calculus and a rule for updatingUpdating emerge as constraints on the formation of rational belief. Bayesian epistemologyEpistemology has led to useful explications of notions such asConfirmation confirmation. It thus is natural to ask whether Bayesian epistemologyEpistemology offers a useful framework for thinking about the inferences implicit in the (...) validation of computer simulations. The aim of this chapter is to answer this question. Bayesian epistemologyEpistemology is briefly summarized and then applied to validation. UpdatingUpdating is shown to form a viable method for data-driven validation. Bayesians can also express how a simulation obtains prior credibilityCredibility because the underlying conceptual modelConceptual model is credible. But the impact of this prior credibilityCredibility is indirect since simulations at best provide partial and approximate solutions to theConceptual model conceptual model. Fortunately, this gap between the simulations and the conceptual model can be addressed using what we call Bayesian verification. The final part of the chapter systematically evaluates the use of Bayesian epistemologyEpistemology in validation, e.g., by comparing it to a falsificationist approach. It is argued that Bayesian epistemologyEpistemology goes beyond mere calibrationCalibration and that it can provide the foundations for a sound evaluationEvaluation of computer simulations. (shrink)

The author, using bertrand russell's "human knowledge": "it's scope and limits", makes a point of departure where russell distinguishes between "meaning" and "significance." the author contends that in using these distinctions in a metaphysical argument, his purpose is not to show whether or not the argument is possible, but to show the problem of validity of metaphysical arguments as the remaining fundamental problem in regards to metaphysics. (staff).

Semantic information is usually supposed to satisfy the veridicality thesis: p qualifies as semantic information only if p is true. However, what it means for semantic information to be true is often left implicit, with correspondentist interpretations representing the most popular, default option. The article develops an alternative approach, namely a correctness theory of truth (CTT) for semantic information. This is meant as a contribution not only to the philosophy of information but also to the philosophical debate on the nature (...) of truth. After the introduction, in Sect. 2, semantic information is shown to be translatable into propositional semantic information (i). In Sect. 3, i is polarised into a query (Q) and a result (R), qualified by a specific context, a level of abstraction and a purpose. This polarization is normalised in Sect. 4, where [Q + R] is transformed into a Boolean question and its relative yes/no answer [Q + A]. This completes the reduction of the truth of i to the correctness of A. In Sects. 5 and 6, it is argued that (1) A is the correct answer to Q if and only if (2) A correctly saturates Q by verifying and validating it (in the computer science’s sense of verification and validation ); that (2) is the case if and only if (3) [Q + A] generates an adequate model (m) of the relevant system (s) identified by Q; that (3) is the case if and only if (4) m is a proxy of s (in the computer science’s sense of proxy ) and (5) proximal access to m commutes with the distal access to s (in the category theory’s sense of commutation ); and that (5) is the case if and only if (6) reading/writing (accessing, in the computer science’s technical sense of the term) m enables one to read/write (access) s. Sect. 7 provides some further clarifications about CTT, in the light of semantic paradoxes. Section 8 draws a general conclusion about the nature of CTT as a theory for systems designers not just systems users. In the course of the article all technical expressions from computer science are explained. (shrink)

The scalar approach to negative polarity item (NPI) licensing assumes that NPIs are allowable in contexts in which the introduction of the NPI leads to proposition strengthening (e.g., Kadmon & Landman 1993, Krifka 1995, Lahiri 1997, Chierchia 2006). A straightforward processing prediction from such a theory is that NPI’s facilitate inference verification from sets to subsets. Three experiments are reported that test this proposal. In each experiment, participants evaluated whether inferences from sets to subsets were valid. Crucially, we manipulated (...) whether the premises contained an NPI. In Experiment 1, participants completed a metalinguistic reasoning task, and Experiments 2 and 3 tested reading times using a self-paced reading task. Contrary to expectations, no facilitation was observed when the NPI was present in the premise compared to when it was absent. In fact, the NPI significantly slowed down reading times in the inference region. Our results therefore favor those scalar theories that predict that the NPI is costly to process (Chierchia 2006), or other, nonscalar theories (Giannakidou 1998, Ladusaw 1992, Postal 2005, Szabolcsi 2004) that likewise predict NPI processing cost but, unlike Chierchia (2006), expect the magnitude of the processing cost to vary with the actual pragmatics of the NPI. (shrink)

Many research fields concerned with the processing of information contained in human faces would benefit from face stimulus sets in which specific facial characteristics are systematically varied while other important picture characteristics are kept constant. Specifically, a face database in which displayed expressions, gaze direction, and head orientation are parametrically varied in a complete factorial design would be highly useful in many research domains. Furthermore, these stimuli should be standardised in several important, technical aspects. The present article presents the freely (...) available Radboud Faces Database offering such a stimulus set, containing both Caucasian adult and children images. This face database is described both procedurally and in terms of content, and a validation study concerning its most important characteristics is presented. In the validation study, all frontal images were rated with respect to the shown facial expression, intensity of expression, clarity of expression, genuineness of expression, attractiveness, and valence. The results show very high recognition of the intended facial expressions. (shrink)

Several philosophical issues in connection with computer simulations rely on the assumption that results of simulations are trustworthy. Examples of these include the debate on the experimental role of computer simulations :483–496, 2009; Morrison in Philos Stud 143:33–57, 2009), the nature of computer data Computer simulations and the changing face of scientific experimentation, Cambridge Scholars Publishing, Barcelona, 2013; Humphreys, in: Durán, Arnold Computer simulations and the changing face of scientific experimentation, Cambridge Scholars Publishing, Barcelona, 2013), and the explanatory power of (...) computer simulations :277–292, 2008; Durán in Int Stud Philos Sci 31:27–45, 2017). The aim of this article is to show that these authors are right in assuming that results of computer simulations are to be trusted when computer simulations are reliable processes. After a short reconstruction of the problem of epistemic opacity, the article elaborates extensively on computational reliabilism, a specified form of process reliabilism with computer simulations located at the center. The article ends with a discussion of four sources for computational reliabilism, namely, verification and validation, robustness analysis for computer simulations, a history of successful implementations, and the role of expert knowledge in simulations. (shrink)

From the Philosophies journal program, one of the main aims of the journal is to help establish a new unity in diversity in human knowledge, which would include both “Wissen” (i.e., “Wissenschaft”) and “sc¯ıre” (i.e., “science”). As is known, “Wissenshaft” (the pursuit of knowledge, learning, and scholarship) is a broader concept of knowledge than “science”, as it involves all kinds of knowledge,including philosophy, and not exclusively knowledge in the form of directly testable explanations and predictions. The broader notion of scholarship (...) incorporates an understanding and articulation of the role of the learner and the process of the growth of knowledge and its development, rather than only the final product and its verification and validation. In other words, it is a form of knowledge that is inclusive of both short-term and long-term perspectives; it is local and global, critical and hypothetical (speculative), breaking new ground. This new synthesis or rather re-connection of knowledge is expected to resonate with basic human value systems, including cultural values. Since knowledge tends to spontaneously fragment while it grows, we take existing diversity as a resource and a starting point for a new synthesis. The idea of broad, inclusive knowledge is in fact not so new. From the beginning, natural philosophy included all contemporary knowledge about nature. Newton was a natural philosopher, as were Bohr, Einstein, Prigogine, Weizsäcker, and Wheeler—to name but a few. Today, the unifying picture of the natural/physical world is sorely missing among the isolated silos of particular scientific domains, each with its own specific ontologies, methodologies, and epistemologies. From the profound need for connected and common knowledge, new trends towards synthesis have emerged in the last decades. One major theme is complexity, especially when applied to biology or medicine, which helps us to grasp the importance of connectedness between present-day disparate pieces of knowledge—frameworks, theories, approaches, etc. Related to this is the emergence of network science, which studies structures of nodes (actors) and edges as connections between them. This book is connecting work on contemporary natural philosophy and its connections with existing philosophies, sciences and other knowledge fields. (shrink)

Designing and building complex artifacts like simulation models often rely on the strategy of modularity. My main claim is that the validation of simulation models faces a challenge of holismHolism because modularityModularity tends to erode over the process of building a simulation model. Two different reasons that fuel the tendency to erosion are analyzed. Both are based on the methodologyMethodology of simulation, but on different levels. The first has to do with the way parameter adjustment works in simulation; the (...) second comes from how different groups of software programmers work together. The chapter will conclude by drawing lessons about how holism challenges the validation of simulation and by discussing a corollary to conformational holism: the boundary between validation and verification tends to become blurred, thus undermining a strategy that insists on keeping them separate. (shrink)

The formal and empirical-generative perspectives of computation are demonstrated to be inadequate to secure the goals of simulation in the social sciences. Simulation does not resemble formal demonstrations or generative mechanisms that deductively explain how certain models are sufficient to generate emergent macrostructures of interest. The description of scientific practice implies additional epistemic conceptions of scientific knowledge. Three kinds of knowledge that account for a comprehensive description of the discipline were identified: formal, empirical and intentional knowledge. The use of formal (...) conceptions of computation for describing simulation is refuted; the roles of programming languages according to intentional accounts of computation are identified; and the roles of iconographic programming languages and aesthetic machines in simulation are characterized. The roles that simulation and intentional decision making may be able to play in a participative information society are also discussed. (shrink)

Papers presented at the IVR 11th World Congress, Helsinki, 1983.

Revised version of chapter in J. N. Mohanty and W. McKenna (eds.), Husserl’s Phenomenology: A Textbook, Lanham: University Press of America, 1989, 29–67. -/- Logic for Husserl is a science of science, a science of what all sciences have in common in their modes of validation. Thus logic deals with universal laws relating to truth, to deduction, to verification and falsification, and with laws relating to theory as such, and to what makes for theoretical unity, both on the (...) side of the propositions of a theory and on the side of the domain of objects to which these propositions refer. This essay presents a systematic overview of Husserl’s views on these matters as put forward in his Logical Investigations. It shows how Husserl’s theory of linguistic meanings as species of mental acts, his formal ontology of part, whole and dependence, his theory of meaning categories, and his theory of categorial intuition combine with his theory of science to form a single whole. Finally, it explores the ways in which Husserl’s ideas on these matters can be put to use in solving problems in the philosophy of language, logic and mathematics in a way which does justice to the role of mental activity in each of these domains while at the same time avoiding the pitfalls of psychologism. (shrink)

Computer science advocates institutional frameworks as an effective tool for modelling policies and reasoning about their interplay. In practice, the rules or policies, of which the institutional framework consists, are often specified using a formal language, which allows for the full verification and validation of the framework (e.g. the consistency of policies) and the interplay between the policies and actors (e.g. violations). However, when modelling large-scale realistic systems, with numerous decision-making entities, scalability and complexity issues arise making it (...) possible only to verify certain portions of the problem without reducing the scale. In the social sciences, agent-based modelling is a popular tool for analysing how entities interact within a system and react to the system properties. Agent-based modelling allows the specification of complex decision-making entities and experimentation with large numbers of different parameter sets for these entities in order to explore their effects on overall system performance. In this paper we describe how to achieve the best of both worlds, namely verification of a formal specification combined with the testing of large-scale systems with numerous different actor configurations. Hence, we offer an approach that allows for reasoning about policies, policy making and their consequences on a more comprehensive level than has been possible to date. We present the institutional agent-based model methodology to combine institutional frameworks with agent-based simulations). We furthermore present J-InstAL, a prototypical implementation of this methodology using the InstAL institutional framework whose specifications can be translated into a computational model under the answer set semantics, and an agent-based simulation based on the jason tool. Using a simplified contract enforcement example, we demonstrate the functionalities of this prototype and show how it can help to assess an appropriate fine level in case of contract violations. (shrink)

While mass spectrometry (MS)‐based quantification of small molecules has been successfully used for decades, targeted MS has only recently been used by the proteomics community to investigate clinical questions such as biomarker verification and validation. Targeted MS holds the promise of a paradigm shift in the quantitative determination of proteins. Nevertheless, targeted quantitative proteomics requires improvisation in making sample processing, instruments, and data analysis more accessible. In the backdrop of the genomic era reaching its zenith, certain questions arise: (...) is the proteomic era about to come? If we are at the beginning of a new future for protein quantification, are we prepared to incorporate targeted proteomics at the benchside for basic research and at the bedside for the good of patients? Here, an overview of the knowledge required to perform targeted proteomics as well as its applications is provided. A special emphasis is placed on upcoming areas such as peptidomics, proteoform research, and mass spectrometry imaging, where the utilization of targeted proteomics is expected to bring forth new avenues. The limitations associated with the acceptance of this technique for mainstream usage are also highlighted. (shrink)

Unmanned aerial vehicles, particularly quadcopters, have several medical, agriculture, surveillance, and security applications. However, the use of this innovative technology for civilian applications is still very limited in low-income countries due to the high cost, whereas low-cost controllers available in the market are often tuned using the hit and trial approach and are limited for specific applications. This paper addresses this issue and presents a novel proof of concept low-cost quadcopter UAV design approach using a systematic Model-Based Design method for (...) mathematical modeling, simulation, real-time testing, and prototyping. The quadcopter dynamic model is developed, and controllers are designed using Proportional Integral, and Derivative, Pole Placement, and Linear Quadratic Regulator control strategies. The stability of the controllers is also checked using Lyapunov stability analysis. For verification and validation of the design, Software-in-the-Loop, Processor-in-the-Loop, Hardware-in-the-loop testing, and Rapid Control Prototyping have been performed. The V&V methods of the MBD approach showed practically valid results with a stable flight of the quadcopter prototype. The proposed low-cost POC quadcopter design approach can be easily modified to have enhanced features, and quadcopters with different design parameters can be assembled using this approach for a diverse range of applications. (shrink)

Is it possible to give a justification of our own practice of deductive inference? The purpose of this paper is to explain what such a justification might consist in and what its purpose could be. On the conception that we are going to pursue, to give a justification for a deductive practice means to explain in terms of an intuitively satisfactory notion of validity why the inferences that conform to the practice coincide with the valid ones. That is, a justification (...) should provide an analysis of the notion of validity and show that the inferences that conform to the practice are just the ones that are valid. Moreover, a complete justification should also explain the purpose, or point, of our inferential practice. We are first going to discuss the objection that any justification of our deductive practice must use deduction and therefore be circular. Then we will consider a particular model of justificatory explanation, building on Georg Kreisel’s concept of informal rigour. Finally, in the main part of the paper, we will discuss three ideas for defining the notion of validity: (i) the classical conception according to which the notion of (bivalent) truth is taken as basic and validity is defined in terms of the preservation of truth; (ii) the constructivist idea of starting instead with the notion of (a canonical) proof (or verification) and define validity in terms of this notion; (iii) the idea of taking the notions of rational acceptance and rejection as given and define an argument to be valid just in case it is irrational to simultaneously accept its premises and reject its conclusion (or conclusions, if we allow for multiple conclusions). Building on work by Dana Scott, we show that the last conception may be viewed as being, in a certain sense, equivalent to the first one. Finally, we discuss the so-called paradox of inference and the informativeness of deductive arguments. (shrink)

The transformational pace of modern education, healthcare, business management systems, etc., requires new approaches for prompt and reliable personality assessment. Phenotypology is one of such theories and it claims of the discovered interconnections of a person’s psychological and psychophysical characteristics on the basis of individual features of his/her phenotype. The article aim is to present some validation results for the Phenotypology hypotheses as a possible tool for personality assessment. In order to verify connections between phenotypic treats and individual behavior, (...) we conducted the study when respondents were differentiated according to some anthropometric (facial) peculiarities and characterological features. The results were quantified and analyzed using the mathematical-statistical linear regression. The research output contains the rationale for the conclusion that there are no statistically significant correlations between some phenotypic body features and such individual psychological characteristics as aggressiveness, impetuosity, pedantry, passivity, etc. In particular, the validity of using of appropriate phenotypologic representations to predict the examined character traits was studied. The obtained results disproved the possibility to use directly the phenotypic approach for reliable characterological profiling. Though, the study outcome is tentative due to some limitations on generality. It is necessary to continue verification of the Phenotypology hypotheses with a broader experimental sample with the inclusion of various ethnic and racial groups’ representatives. However, until then, based on actual findings, the practical application of the Phenotypology statements is doubtful, at least for the purposes of character diagnosis and personality assessment. (shrink)

BackgroundThe Chinese version of the Mini-Mental State Examination and the Beijing version of the Montreal Cognitive Assessment are the most commonly used scales to screen for Alzheimer’s disease among Chinese patients; however, their consistency varies according to populations and languages. Equivalent conversion of MMSE-C and MoCA-BJ scores is important for meta-analysis.Materials and methodsMMSE-C and MoCA-BJ scoring were performed on the enrolled patients with AD. Consistency analysis of MMSE-C and MoCA-BJ scores of patients in the conversion groups was performed. The circle-arc (...) method was used to convert the MMSE-C scores of the conversion groups into MoCA-BJ scores, and the conversion formula was generated. The MMSE-C data of the verification group was converted to MoCA-BJ according to the formula, and the consistency analysis of the original MoCA-BJ of the verification group and the converted MoCA-BJ was performed to verify the conversion model.ResultsThe results of the consistency analysis of MMSE-C and MoCA-BJ in group A showed that the correlation coefficients of the total group, high education years subgroup, medium education years subgroup, and low education years subgroup were 0.905, 0.874, 0.949, and 0.874, respectively, with high consistency and statistical significance. After applying the circle-arc method for equivalent conversion, the consistency analysis results of the original and the converted MoCA-BJ of the patients in group B of the total group, high education years subgroup, medium education years subgroup, and low education years subgroup were 0.891, 0.894, 0.781, 0.909, respectively, with high consistency and statistical significance.ConclusionWe established and validated a model of MMSE-C and MoCA-BJ score conversion for Chinese patients with AD using the circle-arc method. This model could be useful for multi-centers clinical trials and meta-analysis. (shrink)

Purpose: This study aimed to develop a stroke effectiveness test in table tennis based on the temporal game structure to assess the ball speed and ball placement of the players, with a purpose to analyze its reproducibility and validity. Methods: Nineteen male table tennis players participated in this study. The test was performed twice during the first session and once during the second session to assess the intrasession and intersession reproducibility, respectively. Moreover, the test was examined on its ability to (...) discriminate between regional and local performance-level players and on the relationship between the test results and the table tennis performance to assess the discriminant and concurrent validity, respectively. In general, the test consisted of 11 simulated rallies of 2–5 balls with the effort and rest ratio of 0.5, and focused on attack with offensive strokes at defensive balls delivered by a robot randomly between the left and right positions on the table. Results: Ball speed, ball placement, and ball speed-ball placement index showed satisfactory reliability and agreement outcomes. Additionally, the Bland-Altman plots show the systematic error of the analyses closer to 0, and that most values were within the limits of agreements. Concerning validity analyses, regional players had higher scores of ball placement and ball speed-ball placement index as well as made fewer errors than local players. Moreover, ball placement, ball speed-ball placement index, and percentage error presented a strong and significant correlation with table tennis performance. However, ball speed was slightly different between the regional than local players and this variable was not related to table tennis performance. Conclusion: Our findings show evidences that the test is reproducible. Moreover, discriminant and concurrent validity are confirmed for ball placement and ball speed-ball placement index. (shrink)

ABSTRACT Accurate self‐administration of antiretroviral medication therapy for HIV/aids is a significant clinical and ethical concern because of its implications for individual morbidity and mortality, the health of the public, and escalating healthcare costs. However, the traditional construction of patient medication adherence is oversimplified, myopic, and ethically problematic. Adherence relies on existing social power structures and western normative assumptions about the proper roles of patients and providers, and principally focuses on patient variables, obscuring the powerful socioeconomic and institutional influences on (...) behaviour. Some professionals advocate for alternate approaches to adherence, but many of the available alternatives remain conceptually underdeveloped. Using HIV/aids as an exemplar, this paper presents medication practice as a theoretical reconstruction and explicates its conceptual and ethical evolution. We first propose that one of these alternatives, medication practice, broadens the understanding of individuals’ medication‐taking behaviour, speaks to the inherent power inequities in the patient‐provider interaction, and addresses the ethical shortcomings in the traditional construal. We then integrate medication practice with feminist thought, further validating individuals’ situated knowledge, choices, and multiple roles; more fully recognizing the individual as a multidimensional, autonomous human being; and reducing notions of obedience and deference to authority. Blame is thus extricated from the healthcare relationship, reshaping the traditionally adversarial components of the interaction, and eliminating the view of adherence as a patient problem in need of patient‐centred interventions. (shrink)

Coalition announcement logic is one of the family of the logics of quantified announcements. It allows us to reason about what a coalition of agents can achieve by making announcements in the setting where the anti-coalition may have an announcement of their own to preclude the former from reaching its epistemic goals. In this paper, we describe a PSPACE-complete model checking algorithm for CAL that produces winning strategies for coalitions. The algorithm is implemented in a proof-of-concept model checker.

‘Trust but verify’ is a translation of a Russian proverb made famous by former US President Ronald Reagan. In their paper, Grahamet alappear to take an alternate view that might be summarised astrust or verify. The contrast highlights a general question: how do we come to trust in authorities? More specifically, Grahamet alclaim: (1) that UK Trusted Research Environments (TREs) are misnamed as future custodians for big health data because their promised verification systems actually negate the uncertainty that trust (...) requires; (2) the public is mistaken if it believes such verification enhances trust; (3) the notion of building public trust in TREs is unclear or misconceived. In response, I propose a more relational, perhaps less reductionist account. I argue (1) that verification is itself a source of uncertainty, so it can’t extinguish the uncertainty needed for trust; (2) it’s nevertheless possible for verification to enhance feelings of trust thereby reducing our needs for the same; (3) trust is also social, even political, meaning institutions like TREs may become too big to fail—and end up shielding their ‘trusted’ brand by being less candid about inevitable flaws in their verification systems. (shrink)

This paper presents five studies on the development and validation of a scale of intellectual humility. This scale captures cognitive, affective, behavioral, and motivational components of the construct that have been identified by various philosophers in their conceptual analyses of intellectual humility. We find that intellectual humility has four core dimensions: Open-mindedness (versus Arrogance), Intellectual Modesty (versus Vanity), Corrigibility (versus Fragility), and Engagement (versus Boredom). These dimensions display adequate self-informant agreement, and adequate convergent, divergent, and discriminant validity. In particular, (...) Open-mindedness adds predictive power beyond the Big Six for an objective behavioral measure of intellectual humility, and Intellectual Modesty is uniquely related to Narcissism. We find that a similar factor structure emerges in Germanophone participants, giving initial evidence for the model’s cross-cultural generalizability. (shrink)

In Kant’s Critique of Pure Reason and the Method of Metaphysics (CUP 2023), I argue that the first Critique is not only a ‘propaedeutic’ to metaphysics, but actually already establishes parts of metaphysics. These parts belong to what Kant calls transcendental philosophy. Additionally, I also provide an account of Kant’s critique of dogmatism and Wolff as its main defender. In this paper, I take up Luigi Filieri’s and Davide Dalla Rosa’s invitation to further develop my characterization of transcendental philosophy and (...) I respond to Michael Walschots’s objections against my interpretation of Kant’s critique of Wolff’s dogmatism. (shrink)

The fallibility of deduction is the thesis that a thoughtful speaker-reasoner can wrongly believe that an inference is deductively valid. The author presents an argument to the effect that the fallibility of deduction is incompatible with the widespread view that deduction is epistemically unfruitful (the conclusion is contained in the premises, and the transition from premises to conclusion never extends knowledge). If the fallibility of deduction is a fact, the argument presented is a refutation of the doctrine of the unfruitfulness (...) of deduction. But its relevance goes further, because the argument reveals a connection between two different problems: a solution to the problem of fruitfulness (how can deductive inferences increase our knowledge?) is a starting point for a solution to the problem of fallibility (how can deductive inferences be wrong?). To solve the problem of fruitfulness, Michael Dummett proposed some general ideas concerning meaning and inference. Starting from these meaning-theoretical ideas, one can develop an explanation of the fallibility of deduction. The general explanatory strategy does not depend on the choice between a theory of meaning centered on truth, verification, inferential role, or on other key notions. (shrink)

The vision of machines autonomously carrying out substantive conjecture generation, theorem discovery, proof discovery, and proof verification in mathematics and the natural sciences has a long history that reaches back before the development of automatic systems designed for such processes. While there has been considerable progress in proof verification in the formal sciences, for instance the Mizar project’ and the four-color theorem, now machine verified, there has been scant such work carried out in the realm of the natural (...) sciences—until recently. The delay in the case of the natural sciences can be attributed to both a lack of formal analysis of the so-called “theories” in such sciences, and the lack of sufficient progress in automated theorem proving. While the lack of analysis is probably due to an inclination toward informality and empiricism on the part of nearly all of the relevant scientists, the lack of progress is to be expected, given the computational hardness of automated theorem proving; after all, theoremhood in even first-order logic is Turing-undecidable. We give in the present short paper a compressed report on our building upon these formal theories using logic-based AI in order to achieve, in relativity, both machine proof discovery and proof verification, for theorems previously established by humans. Our report is intended to serve as a springboard to machine-produced results in the future that have not been obtained by humans. (shrink)

To introduce this collection of research studies, which stem from the pro grams conducted by The World Phenomenology Institute, we need say a few words about our aims and work. This will bring to light the significance of the present volume. The phenomenological philosophy is an unprejudiced study of experience in its entire range: experience being understood as yielding objects. Experi ence, moreover, is approached in a specific way, such a way that it legitima tizes itself naturally in immediate evidence. (...) As such it offers a unique ground for philosophical inquiry. Its basic condition, however, is to legitimize its validity. In this way it allows a dialogue to unfold among various philosophies of different methodologies and persuasions, so that their basic assumptions and conceptions may be investigated in an objective fashion. That is, instead of comparing concepts, we may go below their differences to seek together what they are meant to grasp. We may in this way come to the things them selves, which are the common objective of all philosophy, or what the great Chinese philosopher Wang Yang Ming called "the investigation of things". It is in this spirit that the Institute's programs include a "cross-cultural" dialogue meant to bring about a profound communication among philosophers in their deepest concerns. Rising above artificial cultural confinements, such dialogues bring scholars, thinkers and human beings together toward a truly human community of minds. Our Institute unfolds one consistent academic program. (shrink)

Hainan, is the only free trade port that also exudes quintessence of the culture of China. Tourism is one of Hainan's most lucrative industries. On the one hand, the regional economy is flourishing and on the other hand, the economy is facing unprecedented impacts from the COVID-19 pandemic. In response to the affected global market environment, this study investigates Hainan residents' acceptance intentions, or tolerance, of tourists. Here, based on the theory of reasoned action, which includes “subjective norm” combined with (...) “trust,” “perceived risk,” and “perceived value.” Using “resident attitude” as a mediator, theoretical research frameworks were developed. A total of 447 valid responses were collected using online and paper-copy questionnaires distributed to Hainan residents from 15 July 2021 to 10 November 2021. The data from the questionnaires were used for three analyses namely, descriptive statistical analysis, measurement model verification, and structural equation modeling analysis. Findings show a positive effect of trust on residents' attitudes in Hainan; perceived value and subjective norm showed a positive effect on resident acceptance intentions for tourism; the perceived risk of residents showed a more negative effect on attitudes toward tourists, but the influence was small. Finally, through the results of the study, theoretical and practical implications in a post-pandemic era are discussed. (shrink)

Based on the historical case of galvanic experimentation in Germany, I identify five types of experimentation which explored and shaped the new phenomenon rather than tested theoretical predictions. Verification evaluated initial reports of Galvani's phenomenon. Simplification reduced the experimental protocol to the fewest and most basic steps. Optimization found experimental conditions that magnified the observed effect. Exploration tested a wide variety of metals, animals or configurations. Application modified the experiment to address unresolved related problems. Attempts to derive laws of (...) the phenomenon or establish its underlying causes were unsuccessful primarily due to the great variability of the experimental results. (shrink)

The book examines issues related to the way modeling and simulation enable us to reconstruct aspects of the world we are investigating. It also investigates the processes by which we extract concrete knowledge from those reconstructions and how that knowledge is legitimated.

The likelihood principle is typically understood as a constraint on any measure of evidence arising from a statistical experiment. It is not sufficiently often noted, however, that the LP assumes that the probability model giving rise to a particular concrete data set must be statistically adequate—it must “fit” the data sufficiently. In practice, though, scientists must make modeling assumptions whose adequacy can nevertheless then be verified using statistical tests. My present concern is to consider whether the LP applies to these (...) techniques of model verification. If one does view model verification as part of the inferential procedures that the LP intends to constrain, then there are certain crucial tests of model verification that no known method satisfying the LP can perform. But if one does not, the degree to which these assumptions have been verified is bracketed from the evidential evaluation under the LP. Although I conclude from this that the LP cannot be a universal constraint on any measure of evidence, proponents of the LP may hold out for a restricted version thereof, either as a kind of “ideal” or as defining one among many different forms of evidence. (shrink)

Introduction to modelling and validation -- Non-hierarchical coloured petri nets -- CPN ML programming -- Formal definition of non-hierarchical coloured petri nets -- Hierarchical coloured petri nets -- Formal defintion of hierarchical coloured petri nets -- State spaces and behavioural properties -- Advanced state space methods -- Formal definition of state spaces and behavioural properties -- Timed coloured petri nets -- Formal definition of timed coloured petri nets -- Simulation-based performance analysis -- Behavioural visualisation -- Examples of industrial applications (...) -- Teaching coloured petri nets. (shrink)