Evolutionary psychiatry suggests that mental disorders can be explained in evolutionary terms (a) as failures of psychological mechanisms to produce the adaptive effects for which they were naturally selected, (b) as mismatches between naturally selected psychological mechanisms and contemporary environmental pressures, or (c) as naturally selected psychological mechanisms whose effects continue to be adaptive. In this paper, I present a philosophical critique of evolutionary psychiatry that draws on Subrena Smith’s matching problem for evolutionary psychology. For evolutionary psychiatry hypotheses (...) to be empirically supported, proponents of evolutionary psychiatry must demonstrate (1) that the contemporary psychological mechanisms involved in mental disorders resemble the psychological mechanisms of our evolutionary ancestors, (2) that the contemporary psychological mechanisms are phylogenetically descended from the ancestral psychological mechanisms, and (3) that the ancestral psychological mechanisms were naturally selected because their effects had adaptive benefits. However, for many mental disorders, evolutionary psychiatry lacks the methodological resources to demonstrate these conditions. Therefore, many evolutionary psychiatry hypotheses are empirically untestable and remain indefinitely underdetermined by data. (shrink)

Given two strings, text t of length n, and pattern p = p1…pk of length k, and given a natural number w, the subsequence matching problem consists in finding the number of size w windows of text t which contain pattern p as a subsequence, i.e. the letters p1,…,pk occur in the window, in the same order as in p, but not necessarily consecutively . Subsequence matching is used for finding frequent patterns and association rules in databases. (...) We generalize the Knuth–Morris–Pratt pattern matching algorithm; we define a non-conventional kind of RAM, the MP-RAMs which model more closely the microprocessor operations; we design an O on-line algorithm for solving the subsequence matching problem on MP-RAMs. (shrink)

In this paper we consider one-to-many matching problems where the preferences of the agents involved are represented by monetary reward functions. We characterize Pareto optimal matchings by means of contractual exchange stability and matchings of maximum total reward by means of compensational exchange stability. To conclude, we show that in going from an initial matching to a matching of maximum total reward, one can always provide a compensation schedule that will be ex-post stable in the sense that (...) there will be no subset of agents who can all by deviation obtain a higher reward. The proof of this result uses the fact that the core of an associated compensation matching game with constraints is nonempty. (shrink)

We define two versions of stability and efficiency of partitions and analyze their relationships for some matching rules. The stability and efficiency of a partition depends on the matching rule φ. The results are stated under various membership property rights axioms. It is shown that in a world where agents can freely exit from and enter coalitions, whenever the matching rule is individually rational and Pareto optimal, the set of φ-stable and φ-efficient partitions coincide and it is (...) unique: the grand coalition. Then we define a weaker version of stability and efficiency, namely specific to a given preference profile and find some negative results for stable matching rules. (shrink)

Özkal-Sanver (Theory Decis 59:193–205, 2005) studies stability and efficiency of partitions of agents in two-sided matching markets in which agents can form partitions by individual moves only, and a matching rule determines the matching in each coalition in a partition. In this study, we present the relationship between stability and efficiency of partitions that is analyzed for several matching rules and under various membership property rights codes, now allowing coalitional moves.

Assisted reproduction using donor gametes is a procedure that allows those who are unable to produce their own gametes to achieve gestational parenthood. Where conception is achieved using donor sperm, the child lacks a genetic link to the intended father. Where it is achieved using a donor egg, the child lacks a genetic link to the intended mother. To address this lack of genetic kinship, some fertility clinics engage in the practice of matching the ethnicity of the gamete donor (...) to that of the recipient parent. The intended result is for the child to have the phenotypic characteristics of the recipient parents. This paper examines the philosophical and ethical problems raised by the policy of ethnic matching in gamete donation. I consider arguments for the provision of ethnic matching based on maximising physical resemblance and fostering ethnic identity development. I then consider an argument against ethnic matching based on the charge of racialism. I conclude that while the practice of ethnic matching in gamete donation could promote positive ethnic identity development in donor-conceived children from historically subjugated ethnic minorities, it also risks endorsing the problematic societal attitudes and assumptions regarding ethnicity that enabled such subjugation in the first place. (shrink)

Many species rely on the three-dimensional surface layout of an environment to find a desired goal following disorientation. They generally do so to the exclusion of other important spatial cues. Two influential frameworks for explaining that phenomenon are provided by geometric-module theories and view-matching theories of reorientation respectively. The former posit a module that operates only on representations of the global geo- metry of three-dimensional surfaces to guide behavior. The latter place snapshots, stored representations of the subject’s two-dimensional retinal (...) stimulation at specific locations, at the heart of their accounts. In this paper, I take a fresh look at the debate between them. I begin by making a case that the empirical evidence we currently have does not clearly favor one framework over the other, and that the debate has reached something of an impasse. Then, I present a new explanatory problem—the representation selection problem—that offers the pro- spect of breaking the impasse by introducing a new type of explanatory consideration that both frameworks must address. The representation selection problem requires explaining how subjects can reliably select the relevant representation with which they initiate the reorientation process. I argue that the view-matching framework does not have the resources to address this problem, while a certain type of theory within the geometric-module framework can provide a natural response to it. In showing this, I develop a new geometric-module theory. (shrink)

How do we recognize identities between seen shapes and felt ones? Is this due to associative learning, or to intrinsic connections these sensory modalities? We can address this question by testing the capacities of newly sighted subjects to match seen and felt shapes, but only if it is shown that the subjects can see the objects well enough to form adequate visual representations of their shapes. In light of this, a recent study by R. Held and colleagues fails to demonstrate (...) that their newly sighted subjects’ inability to match seen and felt shape was due to a lack of intermodal connections rather than a purely visual deficit, as they may not have been able visually to represent 3D shape in the perspective-invariant way required for intermodal matching. However, the study could be modified in any of several ways to help avoid this problem. (shrink)

The higher order matching problem is the problem of determining whether a term is an instance of another in the simply typed [lgr]-calculus, i.e. to solve the equation a = b where a and b are simply typed [lgr]-terms and b is ground. The decidability of this problem is still open. We prove the decidability of the particular case in which the variables occuring in the problem are at most third order.

We show that the solvability of matching problems in the simply typed λ-calculus, up to β equivalence, is not decidable. This decidability question was raised by Huet [4].Note that there are two variants of the question: that concerning β equivalence, and that concerning βη equivalence.The second of these is perhaps more interesting; unfortunately the work below sheds no light on it, except perhaps to illustrate the subtlety and difficulty of the problem.

Continuous subgraph matching problem on dynamic graph has become a popular research topic in the field of graph analysis, which has a wide range of applications including information retrieval and community detection. Specifically, given a query graph q, an initial graph G 0, and a graph update stream △ G i, the problem of continuous subgraph matching is to sequentially conduct all possible isomorphic subgraphs covering △ G i of q on G i. Since knowledge graph (...) is a directed labeled multigraph having multiple edges between a pair of vertices, it brings new challenges for the problem focusing on dynamic knowledge graph. One challenge is that the multigraph characteristic of knowledge graph intensifies the complexity of candidate calculation, which is the combination of complex topological and attributed structures. Another challenge is that the isomorphic subgraphs covering a given region are conducted on a huge search space of seed candidates, which causes a lot of time consumption for searching the unpromising candidates. To address these challenges, a method of subgraph-indexed sequential subdivision is proposed to accelerating the continuous subgraph matching on dynamic knowledge graph. Firstly, a flow graph index is proposed to arrange the search space of seed candidates in topological knowledge graph and an adjacent index is designed to accelerate the identification of candidate activation states in attributed knowledge graph. Secondly, the sequential subdivision of flow graph index and the transition state model are employed to incrementally conduct subgraph matching and maintain the regional influence of changed candidates, respectively. Finally, extensive empirical studies on real and synthetic graphs demonstrate that our techniques outperform the state-of-the-art algorithms. (shrink)

We consider three accepted truths about iris biometrics, involving pupil dilation, contact lenses and template aging. We also consider a relatively ignored issue that may arise in system interoperability. Experimental results from our laboratory demonstrate that the three accepted truths are not entirely true, and also that interoperability can involve subtle performance degradation. All four of these problems affect primarily the stability of the match, or authentic, distribution of template comparison scores rather than the non-match, or imposter, distribution of scores. (...) In this sense, these results confirm the security of iris biometrics in an identity verification scenario. We consider how these problems affect the usability and security of iris biometrics in large-scale applications, and suggest possible remedies. (shrink)

The phenomenon known as matching bias consists of a tendency to see cases as relevant in logical reasoning tasks when the lexical content of a case matches that of a propositional rule, normally a conditional, which applies to that case. Matching is demonstrated by use of the negations paradigm that is by using conditionals in which the presence and absence of negative components is systematically varied. The phenomenon was first published in 1972 and the present paper reviews the (...) history of research and theorising on the problem in the subsequent 25 years. Theories of matching bias considered include those based on several broad frameworks including the heuristic-analytic theory, the mental models theory, the theory of optimal data selection, and relevance theory as well as the specific processing-negations account. The ability of these theories to account for a range of phenomena is considered, including the effects of linguistic form, realistic content, and explicit negation on the matching bias effect. Of particular importance are recent findings showing that the bias is observable on a wider range of linguistic forms than has generally been thought, and that it is almost entirely dependent on the use of implicit negation in the logical cases to which rules are applied. The reasons for the general suppression of matching when realistic content is used are, however, unclear and a need for further research is identified here. It is concluded that matching bias is a highly robust effect which is closely connected with the problem of understanding implicit negation. Most of the theories in the literature are unable to account for at least some of the major phenomena discovered in research on the bias. The accounts that fare best are those that posit local effects of negation, including the heuristic-analytic and processing negations theories. (shrink)

It is well known that Bayes’ theorem (with likelihood ratios) can be used to calculate the impact of evidence, such as a ‘match’ of some feature of a person. Typically the feature of interest is the DNA profile, but the method applies in principle to any feature of a person or object, including not just DNA, fingerprints, or footprints, but also more basic features such as skin colour, height, hair colour or even name. Notwithstanding concerns about the extensiveness of databases (...) of such features, a serious challenge to the use of Bayes in such legal contexts is that its standard formulaic representations are not readily understandable to non-statisticians. Attempts to get round this problem usually involve representations based around some variation of an event tree. While this approach works well in explaining the most trivial instance of Bayes’ theorem (involving a single hypothesis and a single piece of evidence) it does not scale up to realistic situations. In particular, even with a single piece of match evidence, if we wish to incorporate the possibility that there are potential errors (both false positives and false negatives) introduced at any stage in the investigative process, matters become very complex. As a result we have observed expert witnesses (in different areas of speciality) routinely ignore the possibility of errors when presenting their evidence. To counter this, we produce what we believe is the first full probabilistic solution of the simple case of generic match evidence incorporating both classes of testing errors. Unfortunately, the resultant event tree solution is too complex for intuitive comprehension. And, crucially, the event tree also fails to represent the causal information that underpins the argument. In contrast, we also present a simple-to-construct graphical Bayesian Network (BN) solution that automatically performs the calculations and may also be intuitively simpler to understand. Although there have been multiple previous applications of BNs for analysing forensic evidence—including very detailed models for the DNA matching problem, these models have not widely penetrated the expert witness community. Nor have they addressed the basic generic match problem incorporating the two types of testing error. Hence we believe our basic BN solution provides an important mechanism for convincing experts—and eventually the legal community—that it is possible to rigorously analyse and communicate the full impact of match evidence on a case, in the presence of possible errors. (shrink)

The problem of ‘applicability’ of mathematics to modern physical sciences has been labeled as an ‘unreasonably effective’ and unexplainable ‘miracle’ by prominent physicists such as Eugene Wigner a...

Introduction: Schools have become a primary setting for providing mental health care to youths in the U.S. School-based interventions have proliferated, but their effects on mental health and academic outcomes remain understudied. In this study we will implement and evaluate the effects of a flexible multidiagnostic treatment called Modular Approach to Therapy for Children with Anxiety, Depression, Trauma, or Conduct Problems on students' mental health and academic outcomes.Methods and Analysis: This is an assessor-blind randomized controlled effectiveness trial conducted across five (...) school districts. School clinicians are randomized to either MATCH or usual care treatment conditions. The target sample includes 168 youths referred for mental health services and presenting with elevated symptoms of anxiety, depression, trauma, and/or conduct problems. Clinicians randomly assigned to MATCH or UC treat the youths who are assigned to them through normal school referral procedures. The project will evaluate the effectiveness of MATCH compared to UC on youths' mental health and school related outcomes and assess whether changes in school outcomes are mediated by changes in youth mental health.Ethics and Dissemination: This study was approved by the Harvard University Institutional Review Board. We plan to publish the findings in peer-reviewed journals and present them at academic conferences.Clinical Trial Registration:ClinicalTrials.gov ID: NCT02877875. Registered on August 24, 2016. (shrink)

In the process of children’s psychological development, various levels of psychological distress often occur, such as attention problems, emotional problems, adaptation problems, language problems, and motor coordination problems; these problems have seriously affected children’s healthy growth. Scene matching in the treatment of psychological distress can prompt children to change from a third-person perspective to a first-person perspective and shorten the distance between scene contents and child’s perceptual experience. As a part of machine learning, deep learning can perform mapping transformations (...) in huge data, process huge data with the help of complex models, and extract multilayer features of scene information. Based on the summary and analysis of previous research works, this paper expounded the research status and significance of the scene matching method for children’s psychological distress, elaborated the development background, current status, and future challenges of deep learning algorithm, introduced the methods and principles of depth spatiotemporal feature extraction algorithm and dynamic scene understanding algorithm, constructed a scene matching model for children’s psychological distress based on deep learning algorithm, analyzed the scene feature extraction and matching function construction of children’s psychological distress, proposed a scene matching method for children’s psychological distress based on deep learning algorithm, performed scene feature matching and information processing of children’s psychological distress, and finally conduced a simulation experiment and analyzed its results. The results show that the deep learning algorithm can have a deep and abstract mining on the characteristics of children’s psychological distress scenes and obtain a large amount of more representative characteristic information through training on large-scale data, thereby improving the accuracy of classification and matching of children’s psychological distress scenes. The study results of this paper provide a reference for further researches on the scene matching method for children’s psychological distress based on deep learning algorithm. (shrink)

Addictive behavior has never seemed rational because it persists in spite of drastic aversive consequences. This is a particular problem for models of addiction such as operant psychology which hold that behavior is controlled by its consequences. Inspite of claims to the contrary, Heymans target article illustrates how operant psychology resolves this contradiction. By using the matching law, Heyman suggests a mechanism that explains why delayed aversive events may not control behavior, and a conceptual framework in which we (...) can understand successful therapies. (shrink)

Jeff Nisker describes his personal experience of a diagnosis of advanced prostate cancer and the kindnesses he received from friendly doctors. He claims that this narrative account supports the promotion of Prostate Specific Antigen (PSA) screening for asymptomatic men and impugns statisticians, mistakenly thinking that their opposition to PSA screening derives from concerns about financial cost. The account inadvertently demonstrates the danger of over-reliance on a single ethical tool for critical analysis. In the first part of this response, we describe (...) the statistical evidence. The most reliable Cochrane meta-analyses have not shown that PSA screening saves lives overall. Moreover, the high false positive rate of PSA screening leads to overinvestigation which results in unnecessary anxiety and increased cases of unnecessary sepsis, urinary incontinence and sexual dysfunction. Then we describe how narrative ethics alone is an insufficient tool to make claims about policies, such as PSA screening, which have hidden harms. Although Nisker’s story-telling is compelling and evokes emotions, narrative ethics of this sort have an inherent bias against people who would be harmed by the counterfactual. Particular care must be taken to look for and consider those untellable stories. Ethicists who only consider narratives which are readily at hand risk harming those who are voiceless or protected by the status quo. PSA screening is the wrong tool to reduce prostate cancer deaths and narrative ethics is the wrong tool to appraise this policy. It is vital that the correct theoretical tools are applied to the medical and ethical questions under scrutiny. (shrink)

A vehicle-commodity matching problem is presented for service providers to reduce the cost of the logistics system. The vehicle classification model is built as a Gaussian mixture model, and the expectation-maximization algorithm is designed to solve the parameter estimation of GMM. A nonlinear mixed-integer programming model is constructed to minimize the total cost of VCMP. The matching process between vehicle and commodity is realized by GMM-EM, as a preprocessing of the solution. The design of the vehicle-commodity (...) class='Hi'>matching platform for VCMP is designed to reduce and eliminate the information asymmetry between supply and demand so that the order allocation can work at the right time and the right place and use the optimal solution of vehicle-commodity matching. Furthermore, the numerical experiment of an e-commerce supply chain proves that a hybrid evolutionary algorithm is superior to the traditional method, which provides a decision-making reference for e-commerce VCMP. (shrink)

The meta-problem of consciousness is to explain why we think that there is a hard problem of consciousness. On Chalmers' view of the meta-problem, our judgments about the hard problem of consciousness arise non-inferentially as a result of introspection. I raise two problems for such a non-inferentialist view of the metaproblem. It does not seem to match the psychological facts about how we come to the realization of the hard problem, and it is unclear how (...) the view can bridge the gap between the content of introspection and the content involved in formulations of the hard problem. The inferentialist view of the meta-problem, on which the hard problem results from inference, explains both the psychology and content introduction. We should therefore prefer an inferentialist view of the meta-problem. (shrink)

The paper defines a measure on the set of stable matchings in the marriage problem. This measure is based on the minimization of the envy difference between the sets of men and women, while preserving stability and selects stable matchings with the least conflict of interest between both groups of agents. The solution concept proposed is called Sex-equal Matching (SEM) and the paper also provides an algorithm to compute the set of SEM.

An axiomatic treatment of the relation part of is shown to lead naturally to an account of the ways in which parts of things are matched. The determination of matchings by the properties of parts and by the relations between parts is discussed and shown to be relevant to certain classificatory problems in science. The connexions between matchings and symmetries of parts are explored, and a general account is given of the ways in which ambiguities in the matching of (...) parts may be resolved. (shrink)

In his seminal 1960 paper, the physicist Eugene Wigner formulated the question of the applicability of mathematics in physics in a way nobody had before. This formulation has been entirely overlooked due to an exclusive concern with solving Wigner’s problem and explaining the effectiveness of mathematics in the natural sciences, in one way or another. Many have attempted to attribute Wigner’s unjustified conclusion—that mathematics is unreasonably effective in the natural sciences—to his formalist views on mathematics. My goal is to (...) show that this reading misses out on Wigner’s highly original formulation of the problem which is presented throughout his body of work in physics as well as in philosophy. This formulation, as I will show, leads us in a new direction in solving the applicability problem. (shrink)

Algorithmically driven online dating platforms today promise the ability to sort through relevant data and identify one’s ideal amorous matches effectively. Yet the appeal of technological and scientific solutions to the messy problem of finding partners is hardly new. This introduction to the Focus section “It’s a Match!” argues that the history of amorous matching has long been part and parcel of the history of science, in particular the social sciences. Taking matching as an “applied science of (...) social harmony,” the authors argue that concern over more reliable techniques for determining the suitability of partners has formed an essential part of both the maintenance of social order and the shaping of subjectivities, enabling discourses of informed choice and the rational management of the passions, while also reinforcing and subverting structures of age, gender, race, and sexuality. (shrink)

The field of synthetic biology is looking forward engineering framework for safely designing reliable de-novo biological functions. In this undertaking, Computer-Aided-Design environments should play a central role for facilitating the design. Although, CAD environment is widely used to engineer artificial systems the application in synthetic biology is still in its infancy. In this article we address the problem of the design of a high level language which at the core of CAD environment. More specifically the Gubs language is a (...) specification language used to describe the observations of the expected behaviour. The compiler appropriately selects components such that the observation of the synthetic biological function resulting to their assembly complies to the programmed behaviour. (shrink)

In a thought experiment we want to test how the emergence of adult neural stem cells could constitute an example for a scientific revolution in the sense of Thomas Kuhn. In his major work, The structure of scientific revolutions, 3rd edn, University of Chicago Press, Chicago (Kuhn 1996), the philosopher of science, Thomas Kuhn, states that scientific progress is not a cumulative process, but new theories appear by a rather revolutionary sequence of events. Kuhn built his theory on landmark events (...) taken from chemistry and physics, lacking examples from biology. Beginning with Ramon y Cajal’s famous quote, no new neurons after birth , from the early years of the twentieth century, and Reynolds and Weiss’s conflicting finding in 1992 of adult neural stem cells giving rise to new neurons, we will test how the finding of neural stem cells in the adult brain matches with Kuhn’s theory. The pivotal problem of defining a paradigm will be our main focus, since the emergence of adult neural stem cells has been acclaimed by the scientific community as the rebuttal of Ramon y Cajal’s paradigm. (shrink)

Extreme learning machine is a recent scheme for single hidden layer feed forward networks. It has attracted much interest in the machine intelligence and pattern recognition fields with numerous real-world applications. The ELM structure has several advantages, such as its adaptability to various problems with a rapid learning rate and low computational cost. However, it has shortcomings in the following aspects. First, it suffers from the irrelevant variables in the input data set. Second, choosing the optimal number of neurons in (...) the hidden layer is not well defined. In case the hidden nodes are greater than the training data, the ELM may encounter the singularity problem, and its solution may become unstable. To overcome these limitations, several methods have been proposed within the regularization framework. In this article, we considered a greedy method for sparse approximation of the output weight vector of the ELM network. More specifically, the orthogonal matching pursuit algorithm is embedded to the ELM. This new technique is named OMP-ELM. OMP-ELM has several advantages over regularized ELM methods, such as lower complexity and immunity to the singularity problem. Experimental works on nine commonly used regression problems indicate that the investigated OMP-ELM method confirms these advantages. Moreover, OMP-ELM is compared with the ELM method, the regularized ELM scheme, and artificial neural networks. (shrink)

This paper presents a concept for pattern matching based on a parameter optimization system for approximative numerical calculation of some parameter combination under soft and hard constraints. The concept uses a non-linear parameter optimization method with an iterative variation of parameters. The paper focuses on the information modeling process to migrate problem-domain specific criteria into optimization-compatible objects suitable for a standardized parameter optimization procedure. A step-by-step transformation process is presented and implemented in object-oriented programming: classes and interfaces. The (...) method is applicable to a wide range of pattern-matching problems due to its flexibility and extensibility. (shrink)

When incorporating the environment into mental processing (cf., cognitive offloading), one creates novel cognitive strategies that have the potential to improve task performance. Improved performance can, for example, mean faster problem solving, more accurate solutions, or even higher grades at university.1 Although cognitive offloading has frequently been associated with improved performance, it is yet unclear how flexible problem solvers are at matching their offloading habits with their current performance goals (can people improve goal‐related instead of generic performance, (...) e.g., when being in a hurry and aiming for a “quick and dirty” solution?). Here, we asked participants to solve a cognitive task, provided them with different goals—maximizing speed (SPD) or accuracy (ACC), respectively—and measured how frequently (Experiment 1) and how proficiently (Experiment 2) they made use of a novel external resource to support their cognitive processing. Experiment 1 showed that offloading behavior varied with goals: Participants offloaded less in the SPD than in the ACC condition. Experiment 2 showed that this differential offloading behavior was associated with high goal‐related performance: fast answers in the SPD, accurate answers in the ACC condition. Simultaneously, goal‐unrelated performance was sacrificed: inaccurate answers in the SPD, slow answers in the ACC condition. The findings support the notion of humans as canny offloaders who are able to successfully incorporate their environment in pursuit of their current cognitive goals. Future efforts should be focused on the finding's generalizability, for example, to settings without feedback or with high mental workload. (shrink)

This article is devoted to Plutarch’s natural-philosophical interests and aspirations, as expressed more precisely in his collection of Quaestiones Naturales, which has been generally underestimated by scholars. In order to speculate about the actual position of this collection in the Corpus Plutarcheum, I present a case study of one particular problem, viz. Q.N. 19. In the first part of the article, the scope is primarily confined to the traditional sources on which Plutarch relies, but I also take into account (...) Plutarch’s conception of scientific innovation, as it is formulated in Quaestiones convivales. In the second part, I deal with the problematic degree of moral dynamics and literary stylistics, which are, in the main, absent from Quaestiones Naturales. I analyse a cluster of parallel passages by way of contrast to Q.N. 19. This yields insight into Plutarch’s argumentative tactics and his process of writing and rewriting, with a particular focus on his use of ὑπομνήματα. On chronological grounds, I argue that at a certain point Plutarch bears the hypomnematic material of Q.N. 19 in his topical mind, but also that there are certain indications that Q.N. 19 itself is based on other ὑπομνήματα, which in turn provides new material for speculating about the true nature of Quaestiones Naturales as a “collection of notes” and about what the actual range of this label might be. (shrink)

This chapter contains sections titled: Causation and Dualism Why Not Locate Souls in Space? Property/Event Dualism or Dual Aspect Theory.

Our universe features a harmonious match between laws and states: applying its laws to its states generates other states. This is a striking fact. Matters might have been otherwise. The universe might have been stillborn in a state unengaged by its laws. The problem of nomological harmony is that of explaining the noted striking fact. After introducing and developing this problem, we canvass candidate solutions and identify some of their virtues and vices. Candidate solutions invoke the likes of (...) a designer, axiarchic meta-laws, multiverses, essential causal powers, and Humean laws. (shrink)

This paper presents an in-depth analysis of tennis match scene classification using an adaptive Gaussian mixture model parameter estimation simulation algorithm. We divided the main components of semantic analysis into type of motion, distance of motion, speed of motion, and landing area of the tennis ball. Firstly, for the problem that both people and tennis balls in the video frames of tennis matches from the surveillance viewpoint are very small, we propose an adaptive Gaussian mixture model parameter estimation algorithm, (...) which has good accuracy and speed on small targets. Secondly, in this paper, we design a sports player tracking algorithm based on role division and continuously lock the target player to be tracked and output the player region. At the same time, based on the displacement information of the key points of the player’s body and the system running time, the distance and speed of the player’s movement are obtained. Then, for the problem that tennis balls are small and difficult to capture in high-speed motion, this paper designs a prior knowledge-based algorithm for predicting tennis ball motion and landing area to derive the landing area of tennis balls. Finally, this paper implements a prototype system for semantic analysis of real-time video of tennis matches and tests and analyzes the performance indexes of the system, and the results show that the system has good performance in real-time, accuracy, and stability. (shrink)

The field of synthetic biology is looking forward engineering framework for safely designing reliable de-novo biological functions. In this undertaking, Computer-Aided-Design environments should play a central role for facilitating the design. Although, CAD environment is widely used to engineer artificial systems the application in synthetic biology is still in its infancy. In this article we address the problem of the design of a high level language which at the core of CAD environment. More specifically the Gubs language is a (...) specification language used to describe the observations of the expected behaviour. The compiler appropriately selects components such that the observation of the synthetic biological function resulting to their assembly complies to the programmed behaviour. (shrink)

Perceptual tasks such as object matching, mammogram interpretation, mental rotation, and satellite imagery change detection often require the assignment of correspondences to fuse information across views. We apply techniques developed for machine translation to the gaze data recorded from a complex perceptual matching task modeled after fingerprint examinations. The gaze data provide temporal sequences that the machine translation algorithm uses to estimate the subjects' assumptions of corresponding regions. Our results show that experts and novices have similar surface behavior, (...) such as the number of fixations made or the duration of fixations. However, the approach applied to data from experts is able to identify more corresponding areas between two prints. The fixations that are associated with clusters that map with high probability to corresponding locations on the other print are likely to have greater utility in a visual matching task. These techniques address a fundamental problem in eye tracking research with perceptual matching tasks: Given that the eyes always point somewhere, which fixations are the most informative and therefore are likely to be relevant for the comparison task? (shrink)

A well-established phenomenon in reasoning research is matching bias : a tendency to select information that matches the lexical content of propositional statements, regardless of the logically critical presence of negations. Previous research suggested, however, that the effect might be restricted to reasoning with conditional statements. This paper reports two experiments in which participants were required to construct or identify true and false cases of propositional rules of several kinds, including universal statements, disjunctions, and negated conjunctions. Matching bias (...) was observed across all rule types but largely restricted to problems where participants were required to falsify rather than to verify the rules. A third experiment showed a similar generalization across linguistic forms in the Wason selection task with only if conditionals substituted for universals. The results are discussed with reference to contemporary theories of propositional reasoning. (shrink)

The emphasis on God in American psychology of religion generates the problem of explaining divine-versus-natural causality in “spiritual experiences.” Especially “theistic psychology” champions divine involvement. However, its argument exposes a methodological error: to pit popular religious opinions against technical scientific conclusions. Countering such homogenizing “postmodern agnosticism,” Bernard Lonergan explained these two as different modes of thinking: “common sense” and “theory”—which resolves the problem: When theoretical science is matched with theoretical theology, “the God-hypothesis” explains the existence of things whereas (...) science explains their natures; and, barring miracles, God is irrelevant to natural science. A review of the field shows that the problem is pervasive; attention to “miracles”—popularly so-named versus technically—focuses the claims of divine-versus-natural causality; and specifications of the meaning of spiritual, spirituality, science, worldview, and meaning itself offer further clarity. The problem is not naturalism versus theism, but commonsensical versus theoretical thinking. This solution demands “hard” social science. (shrink)

This paper deals with the origin, history and various appearances of the problem of coincidences (matches, rencontres) in the theory of probability.

This article reconsiders how to judge judicial independence by using the Japanese judicature, one of the allegedly-most dependent judiciary branches. In their influential work, Ramseyer and Rasmusen argue that judges who once belonged to a leftist group take longer to reach a under the long-term conservative rule of Japan. Their method does not, however, deal appropriately with the possibility of judges not reaching this position because the judge dies, retires early, or is still at the early stage of her career. (...) Ramseyer and Rasmusen also mistakenly assume that all judges will eventually obtain this position. This article develops a survival analysis model of judicial careers and attempts to solve the problems of censoring, left truncation, and split population. We also offer a way to utilize a matching procedure to estimate average treatment effects on censored time-to-event as well as event occurrence. We re-analyze a corrected version of Ramseyer and Rasmusen's data using their and our methods. One of the most important findings is that, contrary to what Ramseyer and Rasmusen argue, leftist judges are not discriminated against in terms of the timing of promotion. (shrink)

Presence research can tell us why we feel present in the real world and can experience presence while using virtual reality technology (and movies and games) but has strikingly less to say on why we feel present in the scenes described in a book. Just how is it that the wonderful tangible detail of the real world or the complexity of digital technology can be matched and even surpassed by a story in a paperback book? This paper identifies a range (...) of potential neurological solutions to this problem (and the “real world” and “dream” problems for good measure). We consider Jeannerod’s neural simulation of action, Grush’s emulation theory of representation and Rizzolatti’s work on mirror neurons as being candidate solutions to the “book problem”. We conclude by observing that these potential solutions further underline the “purpose” of presence is to act in the world whether it is real, virtual or solely in our imaginations. (shrink)