text1
stringlengths
4
124k
text2
stringlengths
3
149k
same
int64
0
1
The purpose of a wireless sensor network (WSN) is to provide the users with access to the information of interest from data gathered by spatially distributed sensors. Generally the users require only certain aggregate functions of this distributed data. Computation of this aggregate data under the end-to-end informatio...
Intrusion detection in wireless ad hoc networks is a challenging task because these networks change their topologies dynamically, lack concentration points where aggregated traffic can be analyzed, utilize infrastructure protocols that are susceptible to manipulation, and rely on noisy, intermittent wireless communicat...
1
Cryptography and PERSON are CARDINAL techniques commonly used to secure and safely transmit digital data. Nevertheless, they do differ in important ways. In fact, cryptography scrambles data so that they become unreadable by eavesdroppers; while, steganography hides the very existence of data so that they can be transf...
The classical methods used by recursion theory and formal logic to block paradoxes do not work in ORG information theory. Since ORG information can exist as a coherent superposition of the classical ``yes'' and ``no'' states, certain tasks which are not conceivable in the classical setting can be performed in the quant...
0
The purpose of this paper is to examine the possible existence or construction of traversable wormholes supported by generalized ORG gas (ORG) by starting with a general line element and the PERSON tensor, together with the equation of state, thereby continuing an earlier study by the author of wormholes supported by p...
A recent study by PERSON et GPE has shown that the galactic halo possesses the necessary properties for supporting traversable wormholes, based on CARDINAL observational results, the density profile due to NORP et al. and the observed flat rotation curves of galaxies. Using a method for calculating the deflection angle...
1
We prove that the mean curvature $\tau$ of the slices given by a constant mean curvature foliation can be used as a time function, i.e. $PERSON is smooth with non-vanishing gradient.
The existence of closed hypersurfaces of prescribed scalar curvature in globally hyperbolic NORP manifolds is proved provided there are barriers.
1
This paper describes a novel approach to grammar induction that has been developed within a framework designed to integrate learning with other aspects of computing, ORG, mathematics and logic. This framework, called "information compression by multiple alignment, unification and search" (ICMAUS), is founded on princip...
We establish an axiomatization for ORG processes, which is a quantum generalization of process algebra ORG (Algebra of Communicating Processes). We use the framework of a quantum process configuration $MONEY p, \varrho\rangle$, but we treat it as CARDINAL relative independent part: the structural part $p$ and the quant...
0
ORG algorithms require less operations than classical algorithms. The exact reason of this has not been pinpointed until now. Our explanation is that ORG algorithms know in advance PERCENT of the solution of the problem they will find in the future. In fact they can be represented as the sum of all the possible histori...
Parametric density estimation, for example as NORP distribution, is the base of the field of statistics. Machine learning requires inexpensive estimation of much more complex densities, and the basic approach is relatively costly maximum likelihood estimation (ORG). There will be discussed inexpensive density estimatio...
0
Experimentally observed violations of ORG inequalities rule out local realistic theories. Consequently, the ORG vector becomes a strong candidate for providing an objective picture of reality. However, such an ontological view of quantum theory faces difficulties when spacelike measurements on entangled states have to ...
The agenda of quantum algorithmic information theory, ordered `top-down,' is the ORG halting amplitude, followed by the quantum algorithmic information content, which in turn requires the theory of quantum computation. The fundamental atoms processed by ORG computation are the quantum bits which are dealt with in ORG i...
0
The detection of some tiny gravitomagnetic effects in the field of the LOC by means of artificial satellites is a very demanding task because of the various other perturbing forces of gravitational and non-gravitational origin acting upon them. Among the gravitational perturbations a relevant role is played by the LOC ...
The discovery that the ORG is undergoing an accelerated expansion has suggested the existence of an evolving equation of state. This paper discusses various wormhole solutions in a spherically symmetric spacetime with an equation of state that is both space and time dependent. The solutions obtained are exact and gener...
0
These informal notes deal with some topics related to analysis on metric spaces.
These informal notes are concerned with sums and averages in various situations in analysis.
1
We present a concrete design for PERSON's incremental machine learning system suitable for desktop computers. We use R5RS Scheme and its standard library with a few omissions as the reference machine. We introduce a PERSON variant based on a stochastic PERSON together with new update algorithms that use the same gramma...
The theory introduced, presented and developed in this paper, is concerned with an enriched extension of the theory of ORG pioneered by ORG. The enrichment discussed here is in the sense of valuated categories as developed by ORG. This paper relates ORG to an abstraction of the theory of ORG pioneered by PERSON, and pr...
0
Let $PERSON be real-valued compactly supported sufficiently smooth function. It is proved that the scattering data MONEY MONEY S^2$, $\forall k>0,$ determine $q$ uniquely. Here $ORG S^2$ is a fixed direction of the incident plane wave.
This paper investigates the randomness properties of a function of the divisor pairs of a natural number. This function, the antecedents of which go to very ancient times, has randomness properties that can find applications in cryptography, key distribution, and other problems of computer science. It is shown that the...
0
A universal ORG computer can be constructed using NORP anyons. CARDINAL qubit quantum logic gates such as controlled-NOT operations are performed using topological effects. Single-anyon operations such as hopping from site to site on a lattice suffice to perform all quantum logic operations. ORG computation using NORP ...
Before PERSON made his crucial contributions to the theory of computation, he studied the question of whether ORG mechanics could throw light on the nature of free will. This article investigates the roles of quantum mechanics and computation in free will. Although quantum mechanics implies that events are intrinsicall...
1
A path information is defined in connection with different possible paths of irregular dynamic systems moving in its phase space between CARDINAL points. On the basis of the assumption that the paths are physically differentiated by their actions, we show that the maximum path information leads to a path probability di...
I study the class of problems efficiently solvable by a ORG computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coincides with a classical complexity class called ORG, or ORG. Using this result, I show that several simple changes to the axioms of quantum mechanics would ...
0
In this paper, we give a frequency interpretation of negative probability, as well as of extended probability, demonstrating that to a great extent, these new types of probabilities, behave as conventional probabilities. Extended probability comprises both conventional probability and negative probability. The frequenc...
Supervised artificial neural networks with the rapidity-mass matrix (ORG) inputs were studied using several PERSON event samples for various pp collision processes. The study shows the usability of this approach for general event classification problems. The proposed standardization of the ORG feature space can simplif...
0
We treat secret key extraction when the eavesdropper has correlated quantum states. We propose quantum privacy amplification theorems different from ORG's, which are based on quantum conditional R\'{e}nyi entropy of order 1+s. Using those theorems, we derive an exponential decreasing rate for leaked information and the...
We consider branes $MONEY in a NORP bulk, where the stress energy tensor is dominated by the energy density of a scalar fields map $WORK_OF_ARTPERSON with potential $MONEY, where $\mc S$ is a semi-NORP moduli space. By transforming the field equation appropriately, we get an equivalent field equation that is smooth acr...
0
A partial wave analysis of FAC data for ORG Lambda-bar NORP is presented. A CARDINAL cusp is identified in the inverse process NORP-bar NORP to pbar-p at threshold using detailed balance. Partial wave amplitudes for pbar-p CARDINAL, DATE, DATE and ORDINAL exhibit a behaviour very similar to resonances observed in LOC d...
We discuss how to generate singled peaked votes uniformly from the Impartial Culture model.
0
The education system for students in physics suffers (worldwide) from the absence of a deep course in probability and randomness. This is the real problem for students interested in ORG theory, ORG, and quantum foundations. Here the primitive treatment of probability and randomness may lead to deep misunderstandings of...
The information that mobiles can access becomes very wide nowadays, and the user is faced with a dilemma: there is an unlimited pool of information available to him but he is unable to find the exact information he is looking for. This is why the current research aims to design ORG (ORG) able to continually send inform...
0
Rational decision making in its linguistic description means making logical decisions. In essence, a rational agent optimally processes all relevant information to achieve its goal. Rationality has CARDINAL elements and these are the use of relevant information and the efficient processing of such information. In reali...
This paper proposes the use of particle swarm optimization method (PSO) for finite element (FE) model updating. The PSO method is compared to the existing methods that use simulated annealing (ORG) or genetic algorithms (GA) for ORG model for model updating. The proposed method is tested on an unsymmetrical H-shaped st...
1
The oracle chooses a function out of a known set of functions and gives to the player a black box that, given an argument, evaluates the function. The player should find out a certain character of the function through function evaluation. This is the typical problem addressed by the ORG algorithms. In former theoretica...
We show that CARDINAL of heat dissipation per qubit occurs in measurement-based ORG computation according to ORG's principle. This result is derived by using only the fundamental fact that ORG physics respects the no-signaling principle.
0
The debate about which similarity measure one should use for the normalization in the case of ORG (ORG) is further complicated when one distinguishes between the symmetrical co-citation--or, more generally, co-occurrence--matrix and the underlying asymmetrical citation--occurrence--matrix. In the Web environment, the a...
In this paper the theory of flexibly-bounded rationality which is an extension to the theory of bounded rationality is revisited. Rational decision making involves using information which is almost always imperfect and incomplete together with some intelligent machine which if it is a human being is inconsistent to mak...
0
This paper examines how black holes might compute in light of recent models of the black-hole final state. These models suggest that ORG information can escape from the black hole by a process akin to teleportation. They require a specific final state and restrictions on the interaction between the collapsing matter an...
This article explores the ideas that went into PERSON development of an algebra for logical inference in his book WORK_OF_ART. We explore in particular his wife PERSON's claim that he was deeply influenced by NORP logic and argue that his work was more than a framework for processing propositions. By exploring parallel...
0
CARDINAL aspects of the physical side of ORG thesis are discussed. The ORDINAL issue is a variant of the LOC argument against motion, dealing with PERSON squeezed time cycles of computers. The ORDINAL argument reviews the issue of CARDINAL-to-CARDINAL computation, that is, the bijective (unique and reversible) evolutio...
In this highly speculative Letter it is argued that, under certain physical conditions, ORG's demon might be capable of breaking the ORDINAL law of thermodynamics, thereby allowing a perpetual motion machine of the ORDINAL kind, by accessing single particle capabilities.
1
Recurrent neural networks (ORG) are capable of learning to encode and exploit activation history over an arbitrary timescale. However, in practice, state of the art gradient descent based training methods are known to suffer from difficulties in learning long term dependencies. Here, we describe a novel training method...
I argue that data becomes temporarily interesting by itself to some self-improving, but computationally limited, subjective observer once he learns to predict or compress the data in a better way, thus making it subjectively simpler and more beautiful. Curiosity is the desire to create or discover more non-random, non-...
0
PERSON's inequality plays an important role in linear elasticity theory. This inequality bounds the norm of the derivatives of the displacement vector by the norm of the linearized strain tensor. The kernel of the linearized strain tensor are the infinitesimal rigid-body translations and rotations (Killing vectors). We...
In this paper we try to suggest a possible novel method to determine some selected even zonal harmonics J_l of the LOC's geopotential. Time series many DATE long of suitably linearly combined residuals of some NORP orbital elements of certain existing geodetic SLR satellites would be examined. A ORG/GRACE-only backgrou...
0
We introduce a new class of graphical models that generalizes ORG chain graphs by relaxing the semi-directed acyclity constraint so that only directed cycles are forbidden. Moreover, up to CARDINAL edges are allowed between any pair of nodes. Specifically, we present local, pairwise and global PERSON properties for the...
Recently, ORG and PERSON suggested representing uncertainty by a weighted set of probability measures, and suggested a way of making decisions based on this representation of uncertainty: maximizing weighted regret. Their paper does not answer an apparently simpler question: what it means, according to this representat...
0
We consider sets of ORG observables corresponding to eutactic stars. Eutactic stars are systems of vectors which are the lower dimensional ``shadow'' image, the orthogonal view, of higher dimensional orthonormal bases. Although these vector systems are not comeasurable, they represent redundant coordinate bases with re...
In view of the sobering findings of science, theology and to a lesser degree metaphysics is confronted with a humiliating loss, and a need for reinterpretation, of allegories and narratives which have served as guidance to the perplexed for millennia. Future revolutions of world perception might include the emergence o...
1
Error correction, in the standard meaning of the term, implies the ability to correct all small analog errors and some large errors. Examining assumptions at the basis of the recently proposed quantum error-correcting codes, it is pointed out that these codes can correct only a subset of errors, and are unable to corre...
In this article, we study the mass spectrum of the scalar and axial-vector heavy diquark states with the ORG sum rules in a systematic way. Once the reasonable values are obtained, we can take them as basic parameters and study the new charmonium-like states as the tetraquark states.
0
Optimization problems are considered in the framework of tropical algebra to minimize and maximize a nonlinear objective function defined on vectors over an idempotent semifield, and calculated using multiplicative conjugate transposition. To find the minimum of the function, we ORDINAL obtain a partial solution, which...
ORG decision systems are being increasingly considered for use in artificial intelligence applications. Classical and quantum nodes can be distinguished based on certain correlations in their states. This paper investigates some properties of the states obtained in a decision tree structure. How these correlations may ...
0
Although deep neural networks (DNN) are able to scale with direct advances in computational power (e.g., memory and processing speed), they are not well suited to exploit the recent trends for parallel architectures. In particular, gradient descent is a sequential process and the resulting serial dependencies mean that...
Model-based coding, described by PERSON in DATE, has great potential to reduce the volume of information that needs to be transmitted in moving big data, without loss of information, from CARDINAL place to another, or in lossless communications via the internet. Compared with ordinary compression methods, this potentia...
0
We present a unified logical framework for representing and reasoning about both probability quantitative and qualitative preferences in probability answer set programming, called probability answer set optimization programs. The proposed framework is vital to allow defining probability quantitative preferences over th...
We present a unified logical framework for representing and reasoning about both quantitative and qualitative preferences in fuzzy answer set programming, called fuzzy answer set optimization programs. The proposed framework is vital to allow defining quantitative preferences over the possible outcomes of qualitative p...
1
Dynamics of arbitrary communication system is analysed as unreduced interaction process. The applied generalised, universally nonperturbative method of effective potential reveals the phenomenon of dynamic multivaluedness of competing system configurations forced to permanently replace each other in a causally random o...
In this article we study a problem within ORG theory where CARDINAL - CARDINAL pieces of evidence are clustered by a neural structure into n clusters. The clustering is done by minimizing a metaconflict function. Previously we developed a method based on iterative optimization. However, for large scale problems we need...
0
This paper proposes a new algorithm for recovery of belief network structure from data handling hidden variables. It consists essentially in an extension of the ORG algorithm of Spirtes et al. by restricting the number of conditional dependencies checked up to k variables and in an extension of the original PERSON by a...
There have been several efforts to extend distributional semantics beyond individual words, to measure the similarity of word pairs, phrases, and sentences (briefly, tuples; ordered sets of words, contiguous or noncontiguous). CARDINAL way to extend beyond words is to compare CARDINAL tuples using a function that combi...
0
We address ORG gate response in a mesoscopic ring threaded by a magnetic flux $MONEY The ring, composed of identical quantum dots, is symmetrically attached to CARDINAL semi-infinite CARDINAL-dimensional metallic electrodes and CARDINAL gate voltages, viz, $V_a$ and $PERSON, are applied, respectively, in each arm of th...
In this paper we present a short history of logics: from particular cases of CARDINAL-symbol or numerical valued logic to the general case of n-symbol or numerical valued logic. We show generalizations of CARDINAL-valued NORP logic to fuzzy logic, also from the PERSON and Lukasiewicz CARDINAL-symbol valued logics or FA...
0
I'll outline the latest version of my limits of math course. The purpose of this course is to illustrate the proofs of the key information-theoretic incompleteness theorems of algorithmic information theory by means of algorithms written in a specially designed version of ORG. The course is now written in HTML with PER...
We describe a new wavelet transform, for use on hierarchies or binary rooted trees. The theoretical framework of this approach to data analysis is described. Case studies are used to further exemplify this approach. A ORDINAL set of application studies deals with data array smoothing, or filtering. A ORDINAL set of app...
0
Machine Consciousness and Machine Intelligence are not simply new buzzwords that occupy our imagination. Over DATE, we witness an unprecedented rise in attempts to create machines with human-like features and capabilities. However, despite widespread sympathy and abundant funding, progress in these enterprises is far f...
Computational Intelligence is a dead-end attempt to recreate human-like intelligence in a computing machine. The goal is unattainable because the means chosen for its accomplishment are mutually inconsistent and contradictory: "Computational" implies data processing ability while "Intelligence" implies the ability to p...
1
CARDINAL of the crown jewels of complexity theory is PERSON's DATE theorem that computing the permanent of an n*n matrix is #P-hard. Here we show that, by using the model of linear-optical ORG computing---and in particular, a universality theorem due to PERSON, PERSON, and GPE---one can give a different and arguably mo...
This paper describes a tentative model for how discrete memories transform into an interconnected conceptual network, or worldview, wherein relationships between memories are forged by way of abstractions. The model draws on PERSON's theory of how an information-evolving system could emerge through the formation and cl...
0
Symmetry can be used to help solve many problems. For instance, PERSON's famous DATE paper ("WORK_OF_ART") uses symmetry to help derive the laws of special relativity. In artificial intelligence, symmetry has played an important role in both problem representation and reasoning. I describe recent work on using symmetry...
Sometime in the future we will have to deal with the impact of ORG's being mistaken for humans. For this reason, I propose that any autonomous system should be designed so that it is unlikely to be mistaken for anything besides an autonomous sysem, and should identify itself at the start of any interaction with another...
1
The evolution equation of ORG cosmic density perturbations in the realm of FAC theory of gravity is obtained.The de Sitter metric fluctuation is computed in terms of the spin-torsion background density.
Fluctuations on de Sitter solution of FAC field equations are obtained in terms of the matter density primordial density fluctuations and spin-torsion density and matter density fluctuations obtained from ORG data. Einstein-de Sitter solution is shown to be unstable even in the absence of torsion.The spin-torsion densi...
1
ORDINAL we describe briefly an information-action method for the study of stochastic dynamics of hamiltonian systems perturbed by thermal noise and chaotic instability. It is shown that, for the ensemble of possible paths between CARDINAL configuration points, the action principle acquires a statistical form $<\delta A...
We discuss the power and limitation of various "advice," when it is given particularly to weak computational models of CARDINAL-tape linear-time Turing machines and CARDINAL-way finite (state) automata. Of various advice types, we consider deterministically-chosen advice (not necessarily algorithmically determined) and...
0
This article reviews the history of digital computation, and investigates just how far the concept of computation can be taken. In particular, I address the question of whether the universe itself is in fact a giant computer, and if so, just what kind of computer it is. I will show that the universe can be regarded as ...
ORG can be naturally modelled as an exploration/exploitation trade-off (exr/exp) problem, where the system has to choose between maximizing its expected rewards dealing with its current knowledge (exploitation) and learning more about the unknown user's preferences to improve its knowledge (exploration). This problem h...
0
It is possible to rely on current corporate law to grant legal personhood to ORG (AI) agents. In this paper, after introducing pathways to ORG personhood, we analyze consequences of such AI empowerment on human dignity, human safety and ORG rights. We emphasize possibility of creating selfish memes and legal system hac...
The young field of ORG is still in the process of identifying its challenges and limitations. In this paper, we formally describe CARDINAL such impossibility result, namely ORG. We prove that it is impossible to precisely and consistently predict what specific actions a smarter-than-human intelligent system will take t...
1
The wide development of mobile applications provides a considerable amount of data of all types (images, texts, sounds, videos, etc.). Thus, CARDINAL main issues have to be considered: assist users in finding information and reduce search and navigation time. In this sense, context-based recommender systems (ORG) propo...
Motivated by earlier results on universal randomized guessing, we consider an individual-sequence approach to the guessing problem: in this setting, the goal is to guess a secret, individual (deterministic) vector $PERSON,PERSON, by using a finite-state machine that sequentially generates randomized guesses from a stre...
0
We extend ORG chain graphs by (i) relaxing the semidirected acyclity constraint so that only directed cycles are forbidden, and (ii) allowing up to CARDINAL edges between any pair of nodes. We introduce global, and ordered local and pairwise PERSON properties for the new models. We show the equivalence of these propert...
We present a new family of models that is based on graphs that may have undirected, directed and bidirected edges. We name these new models marginal ORG (MAMP) chain graphs because each of them is PERSON equivalent to some ORG chain graph under marginalization of some of its nodes. However, MAMP chain graphs do not onl...
1
The inequality $\sqrt{J}\leq m$ is proved for vacuum, asymptotically flat, maximal and axisymmetric data close to extreme ORG data. The physical significance of this inequality and its relation to the standard picture of the gravitational collapse are discussed.
This paper considers M-estimation of a nonlinear regression model with multiple change-points occuring at unknown times. The multi-phase random design regression model, discontinuous in each change-point, have an arbitrary error $\epsilon$. In the case when the number of jumps is known, the M-estimator of locations of ...
0
This essay explores the limits of Turing machines concerning the modeling of minds and suggests alternatives to go beyond those limits.
An inverse problem for the wave equation outside an obstacle with a {ORG dissipative boundary condition} is considered. The observed data are given by a single solution of the wave equation generated by an initial data supported on an open ball. An explicit analytical formula for the computation of the coefficient at a...
0
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depends on the number of observations. This is usually done through the penalization of predictor functions by PERSON or NORP norms. In this pape...
While tree methods have been popular in practice, researchers and practitioners are also looking for simple algorithms which can reach similar accuracy of trees. In DATE, (PERSON) developed the method of "ORG-robust-logitboost" and compared it with other supervised learning methods on datasets used by the deep learning...
0
In this article, we study the axialvector-diquark-axialvector-antidiquark type scalar, axialvector, tensor and vector $ss\bar{s}\bar{s}$ tetraquark states with the ORG sum rules. The predicted mass $m_{X}=2.08\pm0.12\,\rm{GeV}$ for the axialvector tetraquark state is in excellent agreement with the experimental value $...
This paper shows that, if we could examine the entire history of a hidden variable, then we could efficiently solve problems that are believed to be intractable even for ORG computers. In particular, under any hidden-variable theory satisfying a reasonable axiom called "indifference to the identity," we could solve the...
0
The folksonomy is the result of free personal information or assignment of tags to an object (determined by the URI) in order to find them. The practice of tagging is done in a collective environment. Folksonomies are self constructed, based on co-occurrence of definitions, rather than a hierarchical structure of the d...
In this paper we present FAC (ORG) built on GPE and on NORP technologies. Cloud computing has emerged in DATE as the new paradigm for the provision of on-demand distributed computing resources. ORG can be used for relationship between different data and descriptions of services to annotate provenance of repositories on...
1
Slime mould P. polycephalum is a single cells visible by unaided eye. The cells shows a wide spectrum of intelligent behaviour. By interpreting the behaviour in terms of computation one can make a slime mould based computing device. The ORG computers are capable to solve a range of tasks of computational geometry, opti...
We introduce CARDINAL notions of effective reducibility for set-theoretical statements, based on computability with ORG (OTMs), CARDINAL of which resembles Turing reducibility while the other is modelled after Weihrauch reducibility. We give sample applications by showing that certain (algebraic) constructions are not ...
0
Computability logic (ORG) (see ORG) is a recently introduced semantical platform and ambitious program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic has more traditionally been. Its expressions represent interactive computational tasks seen as games play...
Computability logic (see http://www.csc.villanova.edu/~japaridz/CL/) is a long-term project for redeveloping logic on the basis of a constructive game semantics, with games seen as abstract models of interactive computational problems. Among the fragments of this logic successfully axiomatized so far is CL12 --- a cons...
1
We study the ensemble performance of biometric authentication systems, based on secret key generation, which work as follows. In the enrollment stage, an individual provides a biometric signal that is mapped into a secret key and a helper message, the former being prepared to become available to the system at a later t...
BES II data for J/Psi->K*(890)Kpi reveal a strong kappa peak in FAC-wave near threshold. Both magnitude and phase are determined in slices of PERSON mass by interferences with strong PRODUCT), K1(1270) and K1(1400) signals. The phase variation with mass agrees within errors with LASS data for PERSON elastic scattering....
0
In a complete metric space that is equipped with a doubling measure and supports a Poincar\'e inequality, we prove a new GPE-type property for the fine topology in the case $p=1$. Then we use this property to prove the existence of $MONEY open \emph{strict subsets} and \emph{strict quasicoverings} of $MONEY open sets. ...
In the setting of a metric space $MONEY equipped with a doubling measure that supports a Poincar\'e inequality, we show that if $PERSON u$ strictly in $MONEY, i.e. if $MONEY u$ in $PERSON and $PERSON ORG, then for a subsequence (not relabeled) we have MONEY for $\mathcal H$-almost every $PERSON S_u$.
1
Both self-organization and organization are important for the further development of the sciences: the CARDINAL dynamics condition and enable each other. Commercial and public considerations can interact and "interpenetrate" in historical organization; different codes of communication are then "recombined." However, se...
This note deals with a class of variables that, if conditioned on, tends to amplify confounding bias in the analysis of causal effects. This class, independently discovered by Bhattacharya and Vogt (DATE) and ORG (DATE), includes instrumental variables and variables that have greater influence on treatment selection th...
0
It is proved that spherically symmetric compact reflecting objects cannot support static bound-state configurations made of scalar fields whose self-interaction potential $PERSON is a monotonically increasing function of its argument. Our theorem rules out, in particular, the existence of massive scalar hair outside th...
Can change in citation patterns among journals be used as an indicator of structural change in the organization of the sciences? Aggregated journal-journal citations for DATE are compared with similar data in the ORG Citation Reports DATE of the Science Citation Index. In addition to indicating local change, probabilis...
0
In this paper we critically analyze the so far performed and proposed tests for measuring the general relativistic PERSON effect in the gravitational field of the LOC with some of the existing accurately tracked artificial satellites. The impact of the ORDINAL generation GRACE-only ORG-GRACE02S LOC gravity model and of...
This paper reviews the DATE proof that the spectral gap of NORP quantum systems capable of universal computation is uncomputable.
0
We discuss quark-antiquark leptoproduction within a ORG CARDINAL-gluon exchange model at small $x$. The double spin asymmetries for longitudinally polarized leptons and transversely polarized protons in diffractive $Q \bar Q$ production are analysed at eRHIC energies. The predicted $A_{lT}$ asymmetry is large and can b...
We analyze light meson electroproduction within the handbag model, where the amplitude factorizes into ORG (GPDs) and a hard scattering part. The cross sections and spin asymmetries for various vector and pseudoscalar mesons are analyzed. We discuss what information on hadron structure can be obtained from GPDs.
1
Cosmological limits on PERSON invariance breaking in ORG $(CARDINAL+1)-dimensional$ electrodynamics are used to place limits on torsion. PERSON phenomena is discussed by using extending the propagation equation to ORG spacetimes instead of treating it in purely NORP spaces. The parameter of PERSON violation is shown to...
PERSON models used in physics and other areas of mathematics applications become discrete when they are computerized, e.g., utilized for computations. Besides, computers are controlling processes in discrete spaces, such as films and television programs. At the same time, continuous models that are in the background of...
0
Fuzzy answer set programming is a declarative framework for representing and reasoning about knowledge in fuzzy environments. However, the unavailability of fuzzy aggregates in disjunctive fuzzy logic programs, ORG, with fuzzy answer set semantics prohibits the natural and concise representation of many interesting pro...
This paper shows that, even at the most basic level, the parallel, countable branching and uncountable branching recurrences of ORG (see ORG) validate different principles.
0
ORG (ORG) is a descriptive category metatheory currently under development, which is being offered as the structural aspect of ORG (SUO). The architecture of the ORG is composed of metalevels, namespaces and meta-ontologies. The main application of the ORG is institutional: the notion of institutions and their morphism...
The theory introduced, presented and developed in this paper, is concerned with ORG. This theory is a synthesis of the theory of ORG pioneered by PERSON with the theory of ORG pioneered by PERSON. The central notion in this paper of a rough formal concept combines in a natural fashion the notion of a rough set with the...
1
Psychological and social systems provide us with a natural domain for the study of anticipations because these systems are based on and operate in terms of intentionality. Psychological systems can be expected to contain a model of themselves and their environments social systems can be strongly anticipatory and theref...
Positional and relational perspectives on network data have led to CARDINAL different research traditions in textual analysis and social network analysis, respectively. ORG (ORG) focuses on the latent dimensions in textual data; social network analysis (ORG) on the observable networks. The CARDINAL coupled topographies...
1
In this paper, a mathematical schema theory is developed. This theory has CARDINAL roots: brain theory schemas, grid automata, and block-shemas. In Section CARDINAL of this paper, elements of the theory of grid automata necessary for the mathematical schema theory are presented. In LAW, elements of brain theory necessa...
People solve different problems and know that some of them are simple, some are complex and some insoluble. The main goal of this work is to develop a mathematical theory of algorithmic complexity for problems. This theory is aimed at determination of computer abilities in solving different problems and estimation of r...
1
We draw a certain analogy between the classical information-theoretic problem of lossy data compression (source coding) of memoryless information sources and the statistical mechanical behavior of a certain model of a chain of connected particles (e.g., a polymer) that is subjected to a contracting force. The free ener...
Biometric authentication systems, based on secret key generation, work as follows. In the enrollment stage, an individual provides a biometric signal that is mapped into a secret key and a helper message, the former being prepared to become available to the system at a later time (for authentication), and the latter is...
1
Here is discussed application of the Weyl pair to construction of universal set of ORG gates for high-dimensional quantum system. An application of Lie algebras (NORP) for construction of universal gates is revisited ORDINAL. It is shown next, how for quantum computation with qubits can be used CARDINAL-dimensional ana...
This note reviews prospects for ORG computing. It argues that gates need to be tested for a wide range of probability amplitudes.
0
We prove the existence of a family of initial data for the Einstein vacuum equation which can be interpreted as the data for CARDINAL ORG-like black holes in arbitrary location and with spin in arbitrary direction. This family of initial data has the following properties: (i) When the mass parameter of CARDINAL of them...
The assumptions needed to prove Cox's Theorem are discussed and examined. Various sets of assumptions under which a Cox-style theorem can be proved are provided, although all are rather strong and, arguably, not natural.
0
Unsupervised deep learning is one of the most powerful representation learning techniques. ORG Boltzman machine, sparse coding, regularized auto-encoders, and convolutional neural networks are pioneering building blocks of deep learning. In this paper, we propose a new building block -- distributed random models. The p...
Recently, multilayer bootstrap network (ORG) has demonstrated promising performance in unsupervised dimensionality reduction. It can learn compact representations in standard data sets, i.e. MNIST and RCV1. However, as a bootstrap method, the prediction complexity of ORG is high. In this paper, we propose an unsupervis...
1
PERSON (lightweight internet-based communication for autonomic services) is a distributed framework for building service-based systems. The framework provides a p2p server and more intelligent processing of information through its ORG algorithms. Distributed communication includes ORG-RPC, ORG, ORG and Web Services. It...
We propose a ORG measure for quantum channels in a straightforward analogy to the corresponding mixed-state fidelity of PERSON. We describe properties of this ORG measure and discuss some applications of it to quantum information science.
0
Classical simulation is important because it sets a benchmark for quantum computer performance. Classical simulation is currently the only way to exercise larger numbers of qubits. To achieve larger simulations, sparse matrix processing is emphasized below while trading memory for processing. It performed well within O...
ORG computer versus ORG algorithm processor in ORG are compared to find (in parallel) all NORP cycles in a graph with m edges and n vertices, each represented by k bits. A ORG computer uses quantum states analogous to CMOS registers. With efficient initialization, number of ORG registers is proportional to (n-1)! Numbe...
1
ORG of university-industry-government relations is elaborated into a systemic model that accounts for interactions among CARDINAL dimensions. By distinguishing between the respective micro-operations, this model enables us to recombine the "Mode CARDINAL" thesis of a new production of scientific knowledge and the study...
Via the Internet, information scientists can obtain cost-free access to large databases in the hidden or deep web. These databases are often structured far more than the Internet domains themselves. The patent database of the GPE ORG is used in this study to examine the science base of patents in terms of the literatur...
1
The min-max kernel is a generalization of the popular resemblance kernel (which is designed for binary data). In this paper, we demonstrate, through an extensive classification study using kernel machines, that the min-max kernel often provides an effective measure of similarity for nonnegative data. As the min-max ker...
This article addresses the question of when physical laws and their consequences can be computed. If a physical system is capable of universal computation, then its energy gap can't be computed. At an even more fundamental level, the most concise, simply applicable formulation of the underlying laws of physics is uncom...
0
On the basis of an analysis of previous research, we present a generalized approach for measuring the difference of plans with an exemplary application to machine scheduling. Our work is motivated by the need for such measures, which are used in dynamic scheduling and planning situations. In this context, quantitative ...
Previously a model of only vector fields with a local U(2) symmetry was introduced for which one finds a massless U(1) photon and a massive SU(2) PERSON in the lattice regularization. Here it is shown that quantization of its classical continuum action leads to perturbative renormalization difficulties. But, non-pertur...
0
An analysis of light vector PERSON at small GPE $x \leq MONEY is done on the basis of the generalized parton distributions (GPDs). Our results on the cross section and spin density matrix elements (SDME) are in good agreement with experiments.
The purpose of a wireless sensor network (WSN) is to provide the users with access to the information of interest from data gathered by spatially distributed sensors. Generally the users require only certain aggregate functions of this distributed data. Computation of this aggregate data under the end-to-end informatio...
0
Data analysis and data mining are concerned with unsupervised pattern finding and structure determination in data sets. The data sets themselves are explicitly linked as a form of representation to an observational or otherwise empirical domain of interest. "Structure" has long been understood as symmetry which can tak...
We consider a large number of text data sets. These are cooking recipes. Term distribution and other distributional properties of the data are investigated. Our aim is to look at various analytical approaches which allow for mining of information on both high and low detail scales. Metric space embedding is fundamental...
1
The aim of this paper is twofold: ORDINAL, to extend the area of applications of tropical optimization by solving new constrained location problems, and ORDINAL, to offer new closed-form solutions to general problems that are of interest to location analysis. We consider a constrained minimax single-facility location p...
Configurational information is generated when CARDINAL or more sources of variance interact. The variations not only disturb each other relationally, but by selecting upon each other, they are also positioned in a configuration. A configuration can be stabilized and/or globalized. Different stabilizations can be consid...
0
Similarly to the modelling of entanglement in the algebra of ORG computing, we also model entanglement as a synchronization among an event and its shadows in reversible ORG computing. We give the semantics and axioms of shadow constant for reversible ORG computing.
We provide here a proof theoretic account of constraint programming that attempts to capture the essential ingredients of this programming style. We exemplify it by presenting proof rules for ORG constraints over interval domains, and illustrate their use by analyzing the constraint propagation process for the {ORG SEN...
0
In former work, we showed that a quantum algorithm requires the number of operations (oracle's queries) of a classical algorithm that knows in advance PERCENT of the information that specifies the solution of the problem. We gave a preliminary theoretical justification of this "PERCENT rule" and checked that the rule h...
Military is CARDINAL of many industries that is more computer-dependent than ever before, from soldiers with computerized weapons, and tactical wireless devices, to commanders with advanced battle management, command and control systems. PERSON, command and control is the process of planning, monitoring, and commanding...
0
The direct effect of CARDINAL eventon another can be defined and measured byholding constant all intermediate variables between the CARDINAL.Indirect effects present conceptual andpractical difficulties (in nonlinear models), because they cannot be isolated by holding certain variablesconstant. This paper shows a way o...
This paper extends the applications of belief-networks to include the revision of belief commitments, i.e., the categorical acceptance of a subset of hypotheses which, together, constitute the most satisfactory explanation of the evidence at hand. A coherent model of non-monotonic reasoning is established and distribut...
1
In this paper we present an unconventional image segmentation approach which is devised to meet the requirements of image understanding and pattern recognition tasks. Generally image understanding assumes interplay of CARDINAL sub-processes: image information content discovery and image information content interpretati...
Traditionally, semantics has been seen as a feature of human language. The advent of the information era has led to its widespread redefinition as an information feature. Contrary to this praxis, I define semantics as a special kind of information. Revitalizing the ideas of LOC and Carnap I have recreated and re-establ...
1
We consider the problem $PRODUCT=f(\nu)$ for strictly convex, closed hypersurfaces in hyperbolic space and solve it for curvature functions $MONEY the inverses of which are of class $(K^*)$.
We consider branes $N=I\times\so$, where $\so$ is an $MONEY dimensional space form, not necessarily compact, in a ORG)} bulk $MONEY CARDINAL The branes have a big crunch singularity. If a brane is an ORG space, then, under certain conditions, there exists a smooth natural transition flow through the singularity to a re...
1
An interactive stochastics, evaluated by an entropy functional (EF) of a random field and informational process' path functional (ORG), allows us modeling the evolutionary information processes and revealing regularities of evolution dynamics. Conventional ORG's information measure evaluates a sequence of the process' ...
What is information originating in observation? Until now it has no scientifically conclusive definition. Information is memorized entropy cutting in random observations which processing interactions. Randomness of various interactive observations is source of entropy as uncertainty. Observation under random CARDINAL-0...
1
There are versions of "calculus" in many settings, with various mixtures of algebra and analysis. In these informal notes we consider a few examples that suggest a lot of interesting questions.
DATE ORG discovered CARDINAL mathematical methods for the purpose of extracting information about the location and shape of unknown discontinuity embedded in a known background medium from observation data. The methods are called the probe and enclosure methods. This paper presents their past and recent applications to...
0
The ongoing discussion whether modern vision systems have to be viewed as visually-enabled cognitive systems or cognitively-enabled vision systems is groundless, because perceptual and cognitive faculties of vision are separate components of human (and consequently, artificial) information processing system modeling.
Pattern recognition is generally assumed as an interaction of CARDINAL inversely directed image-processing streams: the bottom-up information details gathering and localization (segmentation) stream, and the top-down information features aggregation, association and interpretation (recognition) stream. Inspired by rece...
1
Not only did Turing help found CARDINAL of the most exciting areas of modern science (computer science), but it may be that his contribution to our understanding of our physical reality is greater than we had hitherto supposed. Here I explore the path that PERSON would have certainly liked to follow, that of complexity...
Models of computation operating over the real numbers and computing a larger class of functions compared to the class of general recursive functions invariably introduce a non-finite element of infinite information encoded in an arbitrary non-computable number or non-recursive function. In this paper we show that Turin...
1
The name of PERSON is common both in ORG and computer science. Are they really CARDINAL absolutely unconnected areas? Many works devoted to quantum computations and communications are serious argument to suggest about existence of such a relation, but it is impossible to touch the new and active theme in a short review...
Clifford algebras are used for definition of spinors. Because of using spin-1/2 systems as an adequate model of quantum bit, a relation of the algebras with quantum information science has physical reasons. But there are simple mathematical properties of the algebras those also justifies such applications. ORDINAL, a...
1
We study here the well-known propagation rules for NORP constraints. ORDINAL we propose a simple notion of completeness for sets of such rules and establish a completeness result. Then we show an equivalence in an appropriate sense between NORP constraint propagation and unit propagation, a form of resolution for propo...
This is a tutorial on logic programming and PERSON appropriate for a course on programming languages for students familiar with imperative programming.
1
For many voting rules, it is ORG-hard to compute a successful manipulation. However, ORG-hardness only bounds the worst-case complexity. Recent theoretical results suggest that manipulation may often be easy in practice. We study empirically the cost of manipulating the single transferable vote (NORP) rule. This was on...
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision variables (which we can set) and stochastic variables (which follow a probability distribution). They combine together the best features of...
1
We study the problem of estimating time-varying coefficients in ordinary differential equations. Current theory only applies to the case when the associated state variables are observed without measurement errors as presented in \cite{chenwu08b,CARDINAL}. The difficulty arises from the quadratic functional of observati...
Functional linear regression is a useful extension of simple linear regression and has been investigated by many researchers. However, functional variable selection problems when multiple functional observations exist, which is the counterpart in the functional context of multiple linear regression, is seldom studied. ...
1
PERSON (DATE) defined society as a communication system which is structurally coupled to, but not an aggregate of, human action systems. The communication system is then considered as self-organizing ("autopoietic"), as are human actors. Communication systems can be studied by using FAC's (DATE) mathematical theory of ...
A concept of randomness for infinite time register machines (ITRMs) is defined and studied. In particular, we show that for this notion of randomness, computability from mutually random reals implies computability and that an analogue of PERSON theorem holds. This is then applied to obtain results on the structure of I...
0
The standard approach to logic in the literature in philosophy and mathematics, which has also been adopted in computer science, is to define a language (the syntax), an appropriate class of models together with an interpretation of formulas in the language (the semantics), a collection of axioms and rules of inference...
I consider issues in distributed computation that should be of relevance to game theory. In particular, I focus on (a) representing knowledge and uncertainty, (b) dealing with failures, and (c) specification of mechanisms.
1
We discuss quantum non-locality and contextuality, emphasising logical and structural aspects. We also show how the same mathematical structures arise in various areas of classical computation.
This paper describes a new method for classifying a dataset that partitions elements into their categories. It has relations with neural networks but a slightly different structure, requiring only a single pass through the classifier to generate the weight sets. A grid-like structure is required as part of a novel idea...
0
Molecular variants of vitamin ORG, siderophores and glycans occur. To take up variant forms, bacteria may express an array of receptors. The gut microbe Bacteroides thetaiotaomicron has CARDINAL different receptors to take up variants of vitamin ORG and CARDINAL receptors to take up various glycans. The design of recep...
Computability logic is a formal theory of (interactive) computability in the same sense as classical logic is a formal theory of truth. This approach was initiated very recently in "Introduction to computability logic" (Annals of PRODUCT and ORG (DATE), ORG). The present paper reintroduces computability logic in a more...
0
In this article, we perform a systematic study of the mass spectrum of the vector hidden charmed and bottomed tetraquark states using the ORG sum rules.
In this article, we construct the $ORG \gamma_\mu C$ and $MONEY ORG type currents to interpolate the vector tetraquark states, then carry out the operator product expansion up to the vacuum condensates of dimension-10 in a consistent way, and CARDINAL ORG sum rules. In calculations, we use the formula $\mu=\sqrt{M^2_{Y...
1
This paper considers an inverse problem for the classical wave equation in an exterior domain. It is a mathematical interpretation of an inverse obstacle problem which employs the dynamical scattering data of NORP wave over a finite time interval. It is assumed that the wave satisfies a PERSON type boundary condition w...
A mathematical method for through-wall imaging via wave phenomena in the time domain is introduced. The method makes use of a single reflected wave over a finite time interval and gives us a criterion whether a penetrable obstacle exists or not in a general rough background medium. Moreover, if the obstacle exists, the...
1
We propose that operator induction serves as an adequate model of perception. We explain how to reduce universal agent models to operator induction. We propose a universal measure of operator induction fitness, and show how it can be used in a reinforcement learning model and a homeostasis (self-preserving) agent based...
The advantages of mixed approach with using different kinds of programming techniques for symbolic manipulation are discussed. The main purpose of approach offered is merge the methods of object oriented programming that convenient for presentation data and algorithms for user with advantages of functional languages fo...
0
We show that several constraint propagation algorithms (also called (local) consistency, consistency enforcing, PERSON, filtering or narrowing algorithms) are instances of algorithms that deal with chaotic iteration. To this end we propose a simple abstract framework that allows us to classify and compare these algorit...
The covariance graph (PERSON graph) of a probability distribution $p$ is the undirected graph $MONEY where CARDINAL nodes are adjacent iff their corresponding random variables are marginally dependent in $p$. In this paper, we present a graphical criterion for reading dependencies from $MONEY, under the assumption that...
0
Urban mobility systems are composed multiple elements with strong interactions, i.e. their future is co-determined by the state of other elements. Thus, studying components in isolation, i.e. using a reductionist approach, is inappropriate. I propose CARDINAL recommendations to improve urban mobility based on insights ...
It is found that in the SM the Ward-Takahashi(WT) identities of the axial-vector currents and the charged vector currents of fermions are invalid after spontaneous symmetry breaking. The spin-0 components of ORG and PERSON fields are revealed from the invalidity of these GPE identities. The masses of these spin-0 compo...
0
This chapter presents a theoretical framework for evaluating next generation search engines. We focus on search engines whose results presentation is enriched with additional information and does not merely present the usual list of CARDINAL blue links, that is, of CARDINAL links to results, accompanied by a short desc...
Given a compatible vector field on a compact connected almost-complex manifold, we show in this article that the multiplicities of eigenvalues among the CARDINAL point set of this vector field have intimate relations. We highlight a special case of our result and reinterpret it as a vanishing-type result in the framewo...
0
We give formulae that yield an information about the location of an unknown polygonal inclusion having unknown constant conductivity inside a known conductive material having known constant conductivity from a partial knowledge of the Neumann -to-Dirichlet operator.
This encyclopedic article gives a mini-introduction into the theory of universal learning, founded by PERSON in DATE and significantly developed and extended in DATE. It explains the spirit of universal learning, but necessarily glosses over technical subtleties.
0
This article is a brief personal account of the past, present, and future of algorithmic randomness, emphasizing its role in inductive inference and artificial intelligence. It is written for a general audience interested in science and philosophy. Intuitively, randomness is a lack of order or predictability. If random...
In this paper, for an even dimensional compact manifold with boundary which has the non-product metric near the boundary, we use the noncommutative residue to define a conformal invariant pair. For a CARDINAL-dimensional manifold, we compute this conformal invariant pair under some conditions and point out the way of c...
0
Machine learning often needs to model density from a multidimensional data sample, including correlations between coordinates. Additionally, we often have missing data case: that data points can miss values for some of coordinates. This article adapts rapid parametric density estimation approach for this purpose: model...
We provide a simple physical interpretation, in the context of the ORDINAL law of thermodynamics, to the information inequality (a.k.a. the GPE' inequality, which is also equivalent to the log-sum inequality), asserting that the relative entropy between CARDINAL probability distributions cannot be negative. Since this ...
0
A nonlinear model with response variable missing at random is studied. In order to improve the coverage accuracy, the empirical likelihood ratio (ORG) method is considered. The asymptotic distribution of EL statistic and also of its approximation is MONEY if the parameters are estimated using least squares(LS) or least...
ORG black holes in NORP effective spacetime of moving vortical plasmas described by moving magnetohydrodynamic (ORG) flows. This example is an extension of acoustic torsion recently introduced in the literature (PERSON,PRD(2004),7,64004), where now the presence of artificial black holes in moving plasmas is obtained by...
0