The Swapping Constraint

Triviality arguments against the computational theory of mind claim that computational implementation is trivial and thus does not serve as an adequate metaphysical basis for mental states. It is common to take computational implementation to consist in a mapping from physical states to abstract computational states. In this paper, I propose a novel constraint on the kinds of physical states that can implement computational states, which helps to specify what it is for two physical states to non-trivially implement the same computational state

Probing the braneworld hypothesis with a neutron-shining-through-a-wall experiment

The possibility for our visible world to be a 3-brane embedded in a multidimensional bulk is at the heart of many theoretical edifices in high-energy physics. Probing the braneworld hypothesis is thus a major experimental challenge. Following recent theoretical works showing that matter swapping between braneworlds can occur, we propose a neutron-shining-through-a-wall experiment. We first show that an intense neutron source such as a nuclear reactor core can induce a hidden neutron flux in an adjacent hidden braneworld. We then describe how a low-background detector can detect neutrons arising from the hidden world and quantify the expected sensitivity to the swapping probability. As a proof of concept, a constraint is derived from previous experiments.Comment: 12 pages, 4 figures, final version published in Physical Review

On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum

In this paper, we consider the problem of finding a maximum cardinality subset of vectors, given a constraint on the normalized squared length of vectors sum. This problem is closely related to Problem 1 from (Eremeev, Kel'manov, Pyatkin, 2016). The main difference consists in swapping the constraint with the optimization criterion. We prove that the problem is NP-hard even in terms of finding a feasible solution. An exact algorithm for solving this problem is proposed. The algorithm has a pseudo-polynomial time complexity in the special case of the problem, where the dimension of the space is bounded from above by a constant and the input data are integer. A computational experiment is carried out, where the proposed algorithm is compared to COINBONMIN solver, applied to a mixed integer quadratic programming formulation of the problem. The results of the experiment indicate superiority of the proposed algorithm when the dimension of Euclidean space is low, while the COINBONMIN has an advantage for larger dimensions.Comment: To appear in Proceedings of the 6th International Conference on Analysis of Images, Social Networks, and Texts (AIST'2017

Experimental limits on neutron disappearance into another braneworld

Recent theoretical works have shown that matter swapping between two parallel braneworlds could occur under the influence of magnetic vector potentials. In our visible world, galactic magnetism possibly produces a huge magnetic potential. As a consequence, this paper discusses the possibility to observe neutron disappearance into another braneworld in certain circumstances. The setup under consideration involves stored ultracold neutrons - in a vessel - which should exhibit a non-zero probability p to disappear into an invisible brane at each wall collision. An upper limit of p is assessed based on available experimental results. This value is then used to constrain the parameters of the theoretical model. Possible improvements of the experiments are discussed, including enhanced stimulated swapping by artificial means.Comment: 7 pages, 2 figures, 1 table. Published in Physics Letters

Joint location and inventory models and algorithms for deployment of hybrid electric vehicle charging stations.

This thesis describes a study of a novel concept of hybrid electric vehicle charging stations in which two types of services are offered: battery swapping and fast level-3 DC charging. The battery swapping and fast-charging service are modeled by using the M/G/s/s model and the M/G/s/$\infty$ model, respectively. In particular, we focus on the operations of joint battery swapping and fast charging services, develop four joint locations and inventory models: two for the deployment of battery swapping service, two for the deployment of hybrid electric vehicle charging service. The first model for each deployment system considers a service-level constraint for battery swapping and hybrid charging service, whereas the second for each deployment system considers total sojourn time in stations. The objective of all four models is to minimize total facility setup cost plus battery and supercharger purchasing cost. The service level, which is calculated by the Erlang loss function, depends on the stockout probability for batteries with enough state of charge (SOC) for the battery swapping service and the risk of running out of superchargers for the quick charging service. The total sojourn time is defined as the sum of the service time and the waiting time in the station. Metaheuristic algorithms using a Tabu search are developed to tackle the proposed nonlinear mixed-integer optimization model. Computational results on randomly generated instances and on a real-world case comprised of 714,000 households show the efficacy of proposed models and algorithms