Datasets:

swan07
/

authorship-verification

text1 stringlengths 4 124k	text2 stringlengths 3 149k	same int64 0 1
This article presents a model of general-purpose computing on a semantic network substrate. The concepts presented are applicable to any semantic network representation. However, due to the standards and technological infrastructure devoted to the NORP Web effort, this article is presented from this point of view. In t...	We review ORG's paradox (or EVENT" problem), not only arguably the oldest and crucial problem for ORG (ORG), but also a conundrum of profound scientific, philosophical and cultural importance. By a simple analysis of observation selection effects, the correct resolution of ORG's paradox is certain to tell us something ...	0
We try to perform geometrization of psychology by representing mental states, <<ideas>>, by points of a metric space, <<mental space>>. Evolution of ideas is described by dynamical systems in metric mental space. We apply the mental space approach for modeling of flows of unconscious and conscious information in the hu...	We compute the anomalous dimension of the ORDINAL and ORDINAL moments of the flavour non-singlet twist-2 ORG and transversity operators at CARDINAL loops in both the ORG and ORG' schemes. To assist with the extraction of estimates of matrix elements computed using lattice regularization, the finite parts of the PERSON'...	0
Any real interaction process produces many incompatible system versions, or realisations, giving rise to omnipresent dynamic randomness and universally defined complexity (arXiv:physics/9806002). Since ORG behaviour dynamically emerges as the lowest complexity level (arXiv:quant-ph/9902016), ORG interaction randomness ...	A quite general interaction process of a multi-component system is analysed by the extended effective potential method liberated from usual limitations of perturbation theory or integrable model. The obtained causally complete solution of the many-body problem reveals the phenomenon of dynamic multivaluedness, or redun...	1
The purpose of this paper is to obtain exact solutions of the GPE field equations describing traversable wormholes supported by phantom energy. Their relationship to exact solutions in the literature is also discussed, as well as the conditions required to determine such solutions.	We hereby consider the problem of detectability of macro-engineering projects over interstellar distances, in the context of ORG (SETI). PERSON and his imaginative precursors, like PERSON, PERSON or PERSON, suggested macro-engineering projects as focal points in the context of extrapolations about the future of humanit...	0
We study the use of "sign $\alpha$-stable random projections" (where $MONEY 2$) for building basic data processing tools in the context of large-scale machine learning applications (e.g., classification, regression, clustering, and near-neighbor search). After the processing by sign stable random projections, the inner...	Based on $\alpha$-stable random projections with small $PERSON, we develop a simple algorithm for compressed sensing (sparse signal recovery) by utilizing only the signs (i.e., CARDINAL-bit) of the measurements. Using only 1-bit information of the measurements results in substantial cost reduction in collection, storag...	1
Exploring further the properties of ITRM-recognizable reals, we provide a detailed analysis of recognizable reals and their distribution in PERSON constructible universe L. In particular, we show that, for unresetting infinite time register machines, the recognizable reals coincide with the computable reals and that, f...	We define an ordinalized version of PERSON's realizability interpretation of intuitionistic logic by replacing Turing machines with PERSON's ordinal Turing machines (OTMs), thus obtaining a notion of realizability applying to arbitrary statements in the language of set theory. We observe that every instance of the axio...	1
In this paper CARDINAL presents new similarity, cardinality and entropy measures for bipolar fuzzy set and for its particular forms like intuitionistic, paraconsistent and fuzzy set. All these are constructed in the framework of multi-valued representations and are based on a penta-valued logic that uses the following ...	The Cauchy problem for the ORG equations in GPE gauge in $n$ space dimensions (MONEY) is locally well-posed for low regularity data, in CARDINAL and CARDINAL space dimensions even for data without finite energy. The result relies on the null structure for the main bilinear terms which was shown to be not only present i...	0
In this paper, we prove that some NORP structural equation models with dependent errors having equal variances are identifiable from their corresponding NORP distributions. Specifically, we prove identifiability for the NORP structural equation models that can be represented as ORG chain graphs (Andersson et al., DATE)...	An interesting consequence of the modern cosmological paradigm is the spatial infinity of the universe. When coupled with naturalistic understanding of the origin of life and intelligence, which follows the basic tenets of astrobiology, and with some fairly incontroversial assumptions in the theory of observation selec...	0
We present a multidimensional optimization problem that is formulated and solved in the tropical mathematics setting. The problem consists of minimizing a nonlinear objective function defined on vectors over an idempotent semifield by means of a conjugate transposition operator, subject to constraints in the form of OR...	A knowledge base is redundant if it contains parts that can be inferred from the rest of it. We study the problem of checking whether a ORG formula (a set of clauses) is redundant, that is, it contains clauses that can be derived from the other ones. Any CNF formula can be made irredundant by deleting some of its claus...	0
While statistics focusses on hypothesis testing and on estimating (properties of) the true sampling distribution, in machine learning the performance of learning algorithms on future data is the primary issue. In this paper we bridge the gap with a general principle (FAC) that identifies hypotheses with best predictive...	We introduce a new principle for model selection in regression and classification. Many regression models are controlled by some smoothness or flexibility or complexity parameter c, e.g. the number of neighbors to be averaged over in k nearest neighbor (kNN) regression or the polynomial degree in regression with polyno...	1
We consider a distributed source coding problem of $MONEY correlated NORP observations $Y_i, i=1,2,...,L$. We assume that the random vector $PERSON t} (Y_1,Y_2,$ $...,PERSON is an observation of the NORP random vector $PERSON...,X_K)$, having the form $Y^L=AX^K+N^L ,$ where $MONEY is a $L\times K$ matrix and $PERSON t}...	Traditional image processing is a field of science and technology developed to facilitate human-centered image management. But DATE, when huge volumes of visual data inundate our surroundings (due to the explosive growth of image-capturing devices, proliferation of Internet communication means and video sharing service...	0
We define the notion of a well-clusterable data set combining the point of view of the objective of $k$-means clustering algorithm (minimising the centric spread of data elements) and common sense (clusters shall be separated by gaps). We identify conditions under which the optimum of $k$-means objective coincides with...	We prove in this paper that the expected value of the objective function of the $k$-means++ algorithm for samples converges to population expected value. As $k$-means++, for samples, provides with constant factor approximation for $k$-means objectives, such an approximation can be achieved for the population with incre...	1
Process modeling (PM) in software engineering involves a specific way of understanding the world. In this context, philosophical work is not merely intrinsically important; it can also stand up to some of the more established software engineering research metrics. The object-oriented methodology takes an object as the ...	The notion of events has occupied a central role in modeling and has an influence in computer science and philosophy. Recent developments in diagrammatic modeling have made it possible to examine conceptual representation of events. This paper explores some aspects of the notion of events that are produced by applying ...	1
We propose a long-term memory design for artificial general intelligence based on PERSON's incremental machine learning methods. We use R5RS Scheme and its standard library with a few omissions as the reference machine. We introduce a PERSON variant based on ORG together with CARDINAL synergistic update algorithms that...	We propose that PERSON induction is complete in the physical sense via several strong physical arguments. We also argue that PERSON induction is fully applicable to quantum mechanics. We show how to choose an objective reference machine for universal induction by defining a physical message complexity and physical mess...	1
We consider a system model of a general finite-state machine (ratchet) that simultaneously interacts with CARDINAL kinds of reservoirs: a heat reservoir, a work reservoir, and an information reservoir, the latter being taken to be a running digital tape whose symbols interact sequentially with the machine. As has been ...	We design games for truly concurrent bisimilarities, including strongly truly concurrent bisimilarities and branching truly concurrent bisimilarities, such as pomset bisimilarities, step bisimilarities, history-preserving bisimilarities and hereditary history-preserving bisimilarities.	0
The paper briefly describes a basic set of special combinatorial engineering frameworks for solving complex problems in the field of hierarchical modular systems. The frameworks consist of combinatorial problems (and corresponding models), which are interconnected/linked (e.g., by preference relation). Mainly, hierarch...	The paper described a generalized integrated glance to PERSON packing problems including a brief literature survey and some new problem formulations for the cases of multiset estimates of items. A new systemic viewpoint to PERSON packing problems is suggested: (a) basic element sets (item set, PERSON set, item subset a...	1
In this paper, we propose an extremely simple deep model for the unsupervised nonlinear dimensionality reduction -- deep distributed random samplings, which performs like a stack of unsupervised bootstrap aggregating. ORDINAL, its network structure is novel: each layer of the network is a group of mutually independent ...	Voting is a simple mechanism to combine together the preferences of multiple agents. Agents may try to manipulate the result of voting by mis-reporting their preferences. CARDINAL barrier that might exist to such manipulation is computational complexity. In particular, it has been shown that it is ORG-hard to compute h...	0
Decision theory formally solves the problem of rational agents in uncertain worlds if the true environmental probability distribution is known. PERSON's theory of universal induction formally solves the problem of sequence prediction for unknown distribution. We unify both theories and give strong arguments that the re...	PERSON sequence prediction is a scheme to predict digits of binary strings without knowing the underlying probability distribution. We call a prediction scheme informed when it knows the true probability distribution of the sequence. Several new relations between universal PERSON sequence prediction and informed predic...	1
In this article, we study the vector meson transitions among the charmonium and bottomonium states with the heavy quark effective theory in an systematic way, and make predictions for the ratios among the vector PERSON widths of a special multiplet to another multiplet. The predictions can be confronted with the experi...	In this article, we introduce a P-wave between the diquark and antidiquark explicitly to construct the vector tetraquark currents, and study the vector tetraquark states with the ORG sum rules systematically, and obtain the lowest vector tetraquark masses up to now. The present predictions support assigning the $MONEY,...	1
CARDINAL common type of symmetry is when values are symmetric. For example, if we are assigning colours (values) to nodes (variables) in a graph colouring problem then we can uniformly interchange the colours throughout a colouring. For a problem with value symmetries, all symmetric solutions can be eliminated in polyn...	Some contemporary views of the universe assume information and computation to be key in understanding and explaining the basic structure underpinning physical reality. We introduce the PERSON exploring some of the basic arguments giving foundation to these visions. We will focus on the algorithmic and ORG aspects, and ...	0
The increasing popularity of web-based applications has led to several critical services being provided over the Internet. This has made it imperative to monitor the network traffic so as to prevent malicious attackers from depleting the resources of the network and denying services to legitimate users. This paper has ...	A universal inequality that bounds the angular momentum of a body by the square of its size is presented and heuristic physical arguments are given to support it. We prove a version of this inequality, as consequence of GPE equations, for the case of rotating axially symmetric, constant density, bodies. Finally, the ph...	0
Currently, organizations are transforming their business processes into e-services and service-oriented architectures to improve coordination across sales, marketing, and partner channels, to build flexible and scalable systems, and to reduce integration-related maintenance and development costs. However, this new para...	Currently, cryptography is in wide use as it is being exploited in various domains from data confidentiality to data integrity and message authentication. Basically, cryptography shuffles data so that they become unreadable by unauthorized parties. However, clearly visible encrypted messages, no matter how unbreakable,...	1
Following a review of metric, ultrametric and generalized ultrametric, we review their application in data analysis. We show how they allow us to explore both geometry and topology of information, starting with measured data. Some themes are then developed based on the use of metric, ultrametric and generalized ultrame...	Innovation is slowing greatly in the pharmaceutical sector. It is considered here how part of the problem is due to overly limiting intellectual property relations in the sector. On the other hand, computing and software in particular are characterized by great richness of intellectual property frameworks. Could the in...	1
In this paper we investigate the opportunities offered by the new LOC gravity models from the dedicated ORG and, especially, ORG missions to the project of measuring the general relativistic PERSON effect with a new LOC's artificial satellite. It turns out that it would be possible to abandon the stringent, and expensi...	We study a general relativistic gravitomagnetic CARDINAL-body effect induced by the spin angular momentum ${\boldsymbol S}_\textrm{X}$ of a rotating mass $PERSON orbited at distance $r_\textrm{X}$ by a local gravitationally bound restricted CARDINAL-body system $\mathcal{S}$ of size CARDINALr\ll r_\textrm{X}$ consistin...	1
The relationship between Popper spaces (conditional probability spaces that satisfy some regularity conditions), lexicographic probability systems (ORG's), and nonstandard probability spaces (ORG's) is considered. If countable additivity is assumed, Popper spaces and a subclass of ORG's are equivalent; without the assu...	Despite the several successes of deep learning systems, there are concerns about their limitations, discussed most recently by PERSON. This paper discusses PERSON's concerns and some others, together with solutions to several of these problems provided by the "P theory of intelligence" and its realisation in the "SP co...	0
We present a quantum-like (PERSON) model in that contexts (complexes of e.g. mental, social, biological, economic or even political conditions) are represented by complex probability amplitudes. This approach gives the possibility to apply the mathematical quantum formalism to probabilities induced in any domain of sci...	The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fundamental to understand nature and complexity of optimization problems over permutations (e.g., ordering, scheduling, traveling salesman probl...	0
This article presents an overview of computability logic -- the game-semantically constructed logic of interactive computational tasks and resources. There is CARDINAL non-overview, technical section in it, devoted to a proof of the soundness of affine logic with respect to the semantics of computability logic. A compr...	Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semantics-based alternative to (the syntactically introduced) linear logic. With its expressive and flexible language, where formulas represent computational problems and "truth" is understoo...	1
General purpose intelligent learning agents cycle through (complex,ORG) sequences of observations, actions, and rewards. On the other hand, reinforcement learning is well-developed for small finite state PERSON Processes (MDPs). So far it is an art performed by human designers to extract the right state representation ...	The impact of the latest combined ORG/GRACE/terrestrial measurements LOC gravity model ORG-CG03C on the measurement of the Lense-Thirring effect with some ORG combinations of the nodes of some of the existing LOC's artificial satellites is presented. The CARDINAL-sigma upper bound of the systematic error in the node-no...	0
We explore a simple mathematical model of network computation, based on PERSON chains. Similar models apply to a broad range of computational phenomena, arising in networks of computers, as well as in genetic, and neural nets, in social networks, and so on. The main problem of interaction with such spontaneously evolvi...	Dialectical logic is the logic of dialectical processes. The goal of dialectical logic is to reveal the dynamical notions inherent in logical computational systems. The fundamental notions of proposition and truth-value in standard logic are subsumed by the notions of process and flow in dialectical logic. Standard log...	0
Complementary strands in DNA double helix show temporary fluctuational openings which are essential to biological functions such as transcription and replication of the genetic information. Such large amplitude fluctuations, known as the breathing of DNA, are generally localized and, microscopically, are due to the bre...	We develop ORG-logitboost, based on the prior work on ORG-boost and robust logitboost. Our extensive experiments on a variety of datasets demonstrate the considerable improvement of ORG-logitboost over logitboost and ORG.	0
More than a speculative technology, ORG computing seems to challenge our most basic intuitions about how the physical world should behave. In this thesis I show that, while some intuitions from classical computer science must be jettisoned in the light of modern physics, many others emerge nearly unscathed; and I use p...	A celebrated DATE theorem of PERSON asserts that honest, rational NORP agents with common priors will never "agree to disagree": if their opinions about any topic are common knowledge, then those opinions must be equal. Economists have written numerous papers examining the assumptions behind this theorem. But CARDINAL ...	1
This paper studies sequence prediction based on the monotone NORP complexity NORP m, i.e. based on universal deterministic/CARDINAL-part ORG. m is extremely close to PERSON's prior M, the latter being an excellent predictor in deterministic as well as probabilistic environments, where performance is measured in terms o...	I present a NORP model and a computational method suitable to evaluate structural and thermodynamic properties of helical molecules embedded in crowded environments which may confine the space available to the base pair fluctuations. It is shown that, for the specific case of a short DNA fragment in a nanochannel, the ...	0
In this article, we study the axial-vector tetraquark state and QUANTITY mixed state consist of light quarks using the ORG sum rules. The present predictions disfavor assigning the $MONEY as the axial-vector tetraquark state with $PERSON, while support assigning the $MONEY as the axial-vector MONEY mixed state.	In this article, we study the radiative transitions among the vector and scalar heavy quarkonium states with the covariant light-front quark model. In calculations, we observe that the radiative decay widths are sensitive to the constituent quark masses and the shape parameters of the wave-functions, and reproduce the ...	1
This is a chapter in a book \emph{Quantum Error Correction} edited by D. A. FAC and PERSON, and published by ORG (CARDINAL (http://www.cambridge.org/us/academic/subjects/physics/quantum-physics-quantum-information-and-quantum-computation/quantum-error-correction)\\ presenting the author's view on feasibility of fault-t...	Recent papers by DATE and NORP have emphasized that wormholes supported by arbitrarily small amounts of exotic matter will have to be incredibly fine-tuned if they are to be traversable. This paper discusses a wormhole model that strikes a balance between CARDINAL conflicting requirements, reducing the amount of exotic...	0
This letter introduces a new, substantially simplified version of the branching recurrence operation of computability logic (see ORG), and proves its equivalence to the old, "canonical" version.	The earlier paper "Introduction to clarithmetic I" constructed an axiomatic system of arithmetic based on computability logic (see ORG), and proved its soundness and extensional completeness with respect to polynomial time computability. The present paper elaborates CARDINAL additional sound and complete systems in the...	1
PERSON, who does not have any sophisticated quantum technology, delegates her ORG computing to PERSON, who has a fully-fledged ORG computer. Can she check whether the computation PERSON performs for her is correct? She cannot recalculate the result by herself, since she does not have any quantum computer. A recent expe...	PERSON is usually defined as a subfield of ORG, which is busy with information extraction from raw data sets. Despite of its common acceptance and widespread recognition, this definition is wrong and groundless. Meaningful information does not belong to the data that bear it. It belongs to the observers of the data and...	0
Purpose: To compare CARDINAL major Web search engines (ORG, ORG, ORG, ORG, and ORG) for their retrieval effectiveness, taking into account not only the results but also the results descriptions. Design/Methodology/Approach: The study uses real-life queries. Results are made anonymous and are randomised. Results are j...	The path to greater diversity, as we have seen, cannot be achieved by merely hoping for a new search engine nor will government support for a single alternative achieve this goal. What is instead required is to create the conditions that will make establishing such a search engine possible in the ORDINAL place. I descr...	1
Nowadays folksonomy is used as a system derived from user-generated electronic tags or keywords that annotate and describe online content. But it is not a classification system as an ontology. To consider it as a classification system it would be necessary to share a representation of contexts by all the users. This pa...	Information retrieval is not only the most frequent application executed on the Web but it is also the base of different types of applications. Considering collective intelligence of groups of individuals as a framework for evaluating and incorporating new experiences and information we often cannot retrieve such knowl...	1
A chiral field theory of $MONEY glueball is presented. The coupling between the quark operator and the $MONEY glueball field is revealed from the ORG) anomaly. The NORP of this theory is constructed by adding a $MONEY glueball field to a successful NORP of chiral field theory of pseudoscalar, vector, and axial-vector m...	Based on an effective chiral theory of pseudoscalar, vector, and axial-vector mesons, the coefficients of the chiral perturbation theory are predicted. There is no new parameter in these predictions.	1
The scope of this teaching package is to make a brief introduction to some notions and properties of chaotic systems. We ORDINAL make a brief introduction to chaos in general and then we show some important properties of chaotic systems using the logistic map and its bifurcation diagram. We also show the universality f...	This paper discusses the benefits of describing the world as information, especially in the study of the evolution of life and cognition. Traditional studies encounter problems because it is difficult to describe life and cognition in terms of matter and energy, since their laws are valid only at the physical scale. Ho...	1
Cirquent calculus is a novel proof theory permitting component-sharing between logical expressions. Using it, the predecessor article "Elementary-base cirquent calculus I: Parallel and choice connectives" built the sound and complete axiomatization CL16 of a propositional fragment of computability logic (see http://www...	Clarithmetics are number theories based on computability logic (see http://www.csc.villanova.edu/~japaridz/CL/ ). Formulas of these theories represent interactive computational problems, and their "truth" is understood as existence of an algorithmic solution. Various complexity constraints on such solutions induce vari...	1
In the same sense as classical logic is a formal theory of truth, the recently initiated approach called computability logic is a formal theory of computability. It understands (interactive) computational problems as games played by a machine against the environment, their computability as existence of a machine that a...	We consider the state dependent channels with full state information with at the sender and partial state information at the receiver. For this state dependent channel, the channel capacity under rate constraint on the state information at the decoder was determined by PERSON. In this paper, we study the correct probab...	0
We extend the algebra of reversible computation to support ORG computing. Since the algebra is based on true concurrency, it is reversible for quantum computing and it has a sound and complete theory.	We have unified quantum and classical computing in open ORG systems called NORP which is a quantum generalization of process algebra ORG. But, an axiomatization for quantum and classical processes with an assumption of closed ORG systems is still missing. For closed ORG, unitary operator, ORG measurement and ORG are CA...	1
A major challenge of interdisciplinary description of complex system behaviour is whether real systems of higher complexity levels can be understood with at least the same degree of objective, "scientific" rigour and universality as "simple" systems of classical, NORP science paradigm. The problem is reduced to that of...	This paper examines whether unitary evolution alone is sufficient to explain emergence of the classical world from the perspective of computability theory. Specifically, it looks at the problem of how the choice related to the measurement is made by the observer viewed as a quantum system. In interpretations where the ...	0
We calculate the limiting behavior of relative NORP entropy when the ORDINAL probability distribution is close to the ORDINAL one in a non-regular location-shift family which is generated by a probability distribution whose support is an interval or a CARDINAL-line. This limit can be regarded as a generalization of ORG...	We derive a new upper bound for PERSON's information in secret key generation from a common random number without communication. This bound improves on PERSON et al(1995)'s bound based on the R\'enyi entropy of order CARDINAL because the bound obtained here uses the R\'enyi entropy of order $MONEY for $s \in [0,1]$. Th...	1
The theory of rational choice assumes that when people make decisions they do so in order to maximize their utility. In order to achieve this goal they ought to use all the information available and consider all the choices available to choose an optimal choice. This paper investigates what happens when decisions are m...	This paper proposes the response surface method for finite element model updating. The response surface method is implemented by approximating the finite element model surface response equation by a multi-layer perceptron. The updated parameters of the finite element model were calculated using genetic algorithm by opt...	1
The launching of NORP and ORG, and methodological developments in ORG have made many more indicators for evaluating journals available than the traditional ORG, Cited Half-life, and Immediacy Index of the ORG. In this study, these new indicators are compared with one another and with the older ones. Do the various indi...	One can study communications by using FAC's (DATE) mathematical theory of communication. In social communications, however, the channels are not "fixed", but themselves subject to change. Communication systems change by communicating information to related communication systems; co-variation among systems if repeated o...	1
We explore multi-terminal quantum transport through a benzene molecule threaded by an LOC flux $\phi$. A simple tight-binding model is used to describe the system and all the calculations are done based on the PERSON's function formalism. With a brief description of CARDINAL-terminal quantum transport, we present a det...	Computability logic is a formal theory of computational tasks and resources. Its formulas represent interactive computational problems, logical operators stand for operations on computational problems, and validity of a formula is understood as being a scheme of problems that always have algorithmic solutions. A compre...	0
We analyze electroproduction of light vector meson at small GPE $x$ within the generalized parton distribution (ORG) approach. Calculation is based on the modified perturbative approach, where the quark transverse degrees of freedom in the hard subprocess are considered. Our results on the cross section are in fair agr...	The term "PRODUCT kernel" stands for correlation-resemblance kernel. In many applications (e.g., vision), the data are often high-dimensional, sparse, and non-binary. We propose CARDINAL types of (nonlinear) PRODUCT kernels for non-binary sparse data and demonstrate the effectiveness of the new kernels through a classi...	0
The complementary roles played by parallel quantum computation and quantum measurement in originating the quantum speed-up are illustrated through an analogy with a famous metaphor by ORG.	The topical quantum computation paradigm is a transposition of the ORG machine into the quantum framework. Implementations based on this paradigm have limitations as to the number of: qubits, computation steps, efficient quantum algorithms (found so far). A new exclusively ORG paradigm (with no classical counterpart) i...	1
Data processing lower bounds on the expected distortion are derived in the finite-alphabet semi-deterministic setting, where the source produces a deterministic, individual sequence, but the channel model is probabilistic, and the decoder is subjected to various kinds of limitations, e.g., decoders implementable by fin...	This document consists of lecture notes for a graduate course, which focuses on the relations between Information Theory and Statistical Physics. The course is aimed at EE graduate students in the area of ORG, as well as to graduate students in ORG who have basic background in ORG. Strong emphasis is given to the analo...	1
The problem of calculating multicanonical parameters recursively is discussed. I describe in detail a computational implementation which has worked reasonably well in practice.	According to contemporary views, equilibrium constant is relevant only to true thermodynamic equilibria in isolated systems with CARDINAL chemical reaction. The paper presents a novel formula that ties-up equilibrium constant and chemical system composition at any state, isolated or open as well. Extending the logarith...	0
A file repository for calculations of cross sections and kinematic distributions using PERSON generators for high-energy collisions is discussed. The repository is used to facilitate effective preservation and archiving of data from theoretical calculations, as well as for comparisons with experimental data. The ORG da...	Multiplicity correlations between the current and target regions of the GPE frame in deep-inelastic scattering processes are studied. It is shown that the correlations are sensitive to the ORDINAL-order perturbative ORG effects and can be used to extract the behavior of the boson-gluon fusion rates as a function of the...	1
We analytically work out the long-term orbital perturbations induced by a homogeneous circular ring of radius PERSON and mass mr on the motion of a test particle in the cases (I): r > R_r and (II): r < R_r. In order to extend the validity of our analysis to the orbital configurations of, e.g., some proposed spacecraftb...	There is significant concern that technological advances, especially in LOC and ORG (AI), could lead to high levels of unemployment in DATE. Studies have estimated that CARDINAL of all current jobs are at risk of automation. To look into this issue in more depth, we surveyed experts in ORG and ORG about the risk, and c...	0
In a complete metric space that is equipped with a doubling measure and supports a Poincar\'e inequality, we show that functions of bounded variation (BV functions) can be approximated in the strict sense and pointwise uniformly by special functions of bounded variation, without adding significant jumps. As a main tool...	We study a stochastic control system, described by Ito controllable equation, and evaluate the solutions by an entropy functional (EF), defined by the equation functions of controllable drift and diffusion. Considering a control problem for this functional, we solve the ORG control variation problem (VP), which leads t...	0
This paper provides an overview of the NORP theory of intelligence and its central idea that artificial intelligence, mainstream computing, and much of human perception and cognition, may be understood as information compression. The background and origins of the NORP theory are described, and the main elements of th...	This article introduces the idea that probabilistic reasoning (PR) may be understood as "information compression by multiple alignment, unification and search" (ICMAUS). In this context, multiple alignment has a meaning which is similar to but distinct from its meaning in bio-informatics, while unification means a simp...	1
Information is the basic concept of information theory. However, there is no definition of this concept that can encompass all uses of the term information in information theories and beyond. Many question a possibility of such a definition. However, foundations of information theory developed in the context of the gen...	In this thesis I present a virtual laboratory which implements CARDINAL different models for controlling animats: a rule-based system, a behaviour-based system, a concept-based system, a neural network, and a GPE architecture. Through different experiments, I compare the performance of the models and conclude that ther...	0
We give an elementary review of black holes in string theory. We discuss BPS holes, the microscopic computation of entropy and the `fuzzball' picture of the black hole interior suggested by microstates of the CARDINAL-charge system.	We study the model of massless MONEY electrodynamics with nonconstant coupling, introduced by ORG as the `charge hole'. But we take the boundary of the strong coupling region to be ORDINAL timelike, then spacelike for a distance $MONEY, and then timelike again (to mimic the structure of a black hole). For an incident c...	1
There are very significant changes taking place in the university sector and in related higher education institutes in many parts of the world. In this work we look at financial data from DATE and DATE from the GPE higher education sector. Situating ourselves to begin with in the context of teaching versus research in ...	Discussion of "Treelets--An adaptive multi-Scale basis for sparse unordered data" [arXiv:0707.0481]	1
A resonance search has been made in FAC, K^{0}s-pbar and ORG invariant-mass spectra measured with the ORG detector at ORG using an integrated luminosity of CARDINAL pb^{-1}. The search was performed in the central rapidity region of inclusive deep inelastic scattering at an ep centre-of-mass energy of CARDINAL--318 GeV...	Starting from the primary representation of neutrosophic information, namely the degree of truth, degree of indeterminacy and degree of falsity, we define a nuanced representation in a penta valued fuzzy space, described by the index of truth, index of falsity, index of ignorance, index of contradiction and index of he...	0
The paper considers a linear regression model with multiple change-points occurring at unknown times. The ORG technique is very interesting since it allows the parametric estimation, including the change-points, and automatic variable selection simultaneously. The asymptotic properties of the ORG-type (which has as par...	In this paper we are interested in parameters estimation of ORG model when number of parameters increases with sample size. Without any assumption about moments of the model error, we propose and study the seamless MONEY quantile estimator. For this estimator we ORDINAL give the convergence rate. Afterwards, we prove t...	1
This empirical study is mainly devoted to comparing CARDINAL tree-based boosting algorithms: mart, ORG, robust logitboost, and ORG-logitboost, for multi-class classification on a variety of publicly available datasets. Some of those datasets have been thoroughly tested in prior studies using a broad range of classifica...	Counting is among the most fundamental operations in computing. For example, counting the pth frequency moment has been a very active area of research, in theoretical computer science, databases, and data mining. When p=1, the task (i.e., counting the sum) can be accomplished using a simple counter. PERSON (ORG) is p...	1
Computability logic (CL) (see ORG) is a semantical platform and research program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth which it has more traditionally been. Formulas in ORG stand for (interactive) computational problems, understood as games between a machin...	There are many examples in the literature that suggest that indistinguishability is intransitive, despite the fact that the indistinguishability relation is typically taken to be an equivalence relation (and thus transitive). It is shown that if the uncertainty perception and the question of when an agent reports that ...	0
The paper explores a possible application of the discrete thermodynamics to a CARDINAL-level laser. The model accounts for the laser openness to incoming pumping power and coming out energy with the emitted light. As an open system, a laser should be in open equilibrium with thermodynamic forces, related to both energy...	PERSON defined an evolutionary unit as hereditary information for which the selection bias between competing units dominates the informational decay caused by imperfect transmission. In this article, I extend PERSON' approach to show that the ratio of selection bias to transmission bias provides a unifying framework fo...	0
We consider the inverse mean curvature flow in ORG spacetimes that satisfy the PERSON equations and have a big crunch singularity and prove that under natural conditions the rescaled inverse mean curvature flow provides a smooth transition from big crunch to big bang. We also construct an example showing that in genera...	We consider optimization problems that are formulated and solved in the framework of tropical mathematics. The problems consist in minimizing or maximizing functionals defined on vectors of finite-dimensional semimodules over idempotent semifields, and may involve constraints in the form of ORG equations and inequaliti...	0
The availability of interaction devices has raised interest in techniques to support the user interface (UI). A ORG specification describes the functions that a system provides to its users by capturing the interface details and includes possible actions through interaction elements. UI developers of interactive system...	The aim of this paper is to promote the terms thing and thinging (which refers to the act of defining a boundary around some portion of reality and labeling it with a name) as valued notions that play an important role in software engineering modeling. Additionally, we attempt to furnish operational definitions for ter...	1
We propose the possibilities of designing nano-scale rectifiers using mesoscopic rings. A single mesoscopic ring is used for CARDINAL-wave rectification, while full-wave rectification is achieved using CARDINAL such rings and in both cases each ring is threaded by a time varying magnetic flux CARDINAL\phi$ which plays ...	In the measurement-based ORG computing, there is a natural "causal cone" among qubits of the resource state, since the measurement angle on a qubit has to depend on previous measurement results in order to correct the effect of byproduct operators. If we respect the no-signaling principle, byproduct operators cannot be...	0
Maybe active discussions about entanglement in ORG information science demonstrate some immaturity of this rather young area. So recent tries to look for more accurate ways of classification devote rather encouragement than criticism.	In this presentation are discussed some problems, relevant with application of information technologies in nano-scale systems and devices. Some methods already developed in ORG may be very useful here. Here are considered CARDINAL illustrative models: representation of data by ORG bits and transfer of signals in ORG wi...	1
The information-theoretic point of view proposed by ORG in DATE and developed by algorithmic information theory (ORG) suggests that mathematics and physics are not that different. This will be a ORDINAL-person account of some doubts and speculations about the nature of mathematics that I have entertained for DATE, and ...	The approach defines information process from probabilistic observation, emerging microprocess,qubit, encoding bits, evolving macroprocess, and extends to Observer information self-organization, cognition, intelligence and understanding communicating information. Studying information originating in quantum process focu...	0
A large body of research in machine learning is concerned with supervised learning from examples. The examples are typically represented as vectors in a multi-dimensional feature space (also known as attribute-value descriptions). A teacher partitions a set of training examples into a finite number of classes. The task...	We show that combining CARDINAL different hypothetical enhancements to quantum computation---namely, quantum advice and non-collapsing measurements---would let a ORG computer solve any decision problem whatsoever in polynomial time, even though neither enhancement yields extravagant power by itself. This complements a ...	0
The ORG problem for the PERSON system is shown to be locally well-posed for low regularity Schr\"odinger data u_0 ORG,p}} and wave data (ORG,p}} \times \hat{H^{l-1,p}} under certain assumptions on the parameters k,l and 1<p\le CARDINAL, where ORG,p}}} := \\| < \xi >^k \hat{u_0}\\|_{L^{p'}}, generalizing the results for p...	We consider the ORG system in GPE gauge and use a null condition to show local well-psoedness for low regularity data. This improves a recent result of ORG.	1
ORG) seem to have displaced traditional 'smooth' nonlinearities as activation-function-du-jour in many - but not all - deep neural network (DNN) applications. However, nobody seems to know why. In this article, we argue that PRODUCT are useful because they are ideal demodulators - this helps them perform fast abstract ...	Convolutional deep neural networks (DNN) are state of the art in many engineering problems but have not yet addressed the issue of how to deal with complex spectrograms. Here, we use circular statistics to provide a convenient probabilistic estimate of spectrogram phase in a complex convolutional DNN. In a typical cock...	1
We derive, for a bistochastic strictly contractive ORG channel on a matrix algebra, a relation between the contraction rate and the rate of entropy production. We also sketch some applications of our result to the statistical physics of irreversible processes and to quantum information processing.	This paper presents a new version of a branching batch classifier that has added fixed value ranges through bands, for each column or feature of the input dataset. Each layer branches like a tree, but has a different architecture to the current classifiers. Each branch is not for a feature, but for a change in output c...	0
The black hole information paradox tells us something important about the way quantum mechanics and gravity fit together. In these lectures I try to give a pedagogical review of the essential physics leading to the paradox, using mostly pictures. Hawking's argument is recast as a `theorem': if quantum gravity effects a...	We reminisce and discuss applications of algorithmic probability to a wide range of problems in artificial intelligence, philosophy and technological society. We propose that PERSON has effectively axiomatized the field of artificial intelligence, therefore establishing it as a rigorous scientific discipline. We also r...	0
Combinatorial evolution and forecasting of system requirements is examined. The morphological model is used for a hierarchical requirements system (i.e., system parts, design alternatives for the system parts, ordinal estimates for the alternatives). A set of system changes involves changes of the system structure, com...	In this note is touched upon an application of quantum information science (QIS) in nanotechnology area. The laws of quantum mechanics may be very important for nano-scale objects. A problem with simulating of ORG systems is well known and ORG computer was initially suggested by PERSON just as the way to overcome such ...	0
The article proposes a heuristic approximation approach to the bin packing problem under multiple objectives. In addition to the traditional objective of minimizing the number of bins, the heterogeneousness of the elements in each PERSON is minimized, leading to a biobjective formulation of the problem with a tradeoff ...	The article presents a local search approach for the solution of timetabling problems in general, with a particular implementation for competition track CARDINAL of ORG DATE (ORG 2007). The heuristic search procedure is based on PERSON to overcome local optima. A stochastic neighborhood is proposed and implemented, ran...	1
This paper describes a new entropy-style of equation that may be useful in a general sense, but can be applied to a cognitive model with related processes. The model is based on the human brain, with automatic and distributed pattern activity. Methods for carrying out the different processes are suggested. The main pur...	This paper continues the research that considers a new cognitive model based strongly on the human brain. In particular, it considers the neural binding structure of an earlier paper. It also describes some new methods in the areas of image processing and behaviour simulation. The work is all based on earlier research ...	1
The aim of this note is to attract once again attention of the quantum community to statistical analysis of data which was reported as violating ORG's inequality. This analysis suffers of a number of problems. And the main problem is that rough data is practically unavailable. However, experiments which are not followe...	We discuss foundation of ORG (interpretations, superposition, principle of complementarity, locality, hidden variables) and quantum information theory.	1
Transcript of PERSON DATE ORG of Computer Science Distinguished Lecture. The notion of randomness is taken from physics and applied to pure mathematics in order to shed light on the incompleteness phenomenon discovered by PERSON.	This article discusses what can be proved about the foundations of mathematics using the notions of algorithm and information. The ORDINAL part is retrospective, and presents a beautiful antique, PERSON's proof, the ORDINAL modern incompleteness theorem, PERSON's halting problem, and a piece of postmodern metamathemati...	1
Multi-agent approach has become popular in computer science and technology. However, the conventional models of multi-agent and multicomponent systems implicitly or explicitly assume existence of absolute time or even do not include time in the set of defining parameters. At the same time, it is proved theoretically an...	ORG means statistical analysis of population or sample that has indeterminate (imprecise, ambiguous, vague, incomplete, unknown) data. For example, the population or sample size might not be exactly determinate because of some individuals that partially belong to the population or sample, and partially they do not belo...	0
In this article, we perform a systematic study of the mass spectrum of the axial-vector hidden charmed and hidden bottom tetraquark states using the ORG sum rules, and identify the $Z^+(4430)$ as an axial-vector tetraquark state tentatively.	In this paper, we consider supervised learning problems such as logistic regression and study the stochastic gradient method with averaging, in the usual stochastic approximation setting where observations are used only once. We show that after $MONEY iterations, with a constant step-size proportional to MONEY \sqrt{N}...	0
The article sets forth comprehensive basics of thermodynamics of chemical equilibrium as balance of the thermodynamic forces. Based on the linear equations of irreversible thermodynamics, ORG definition of the thermodynamic force, and FAC principle, new thermodynamics of chemical equilibrium offers an explicit account ...	The paper presents new thermodynamic paradigm of chemical equilibrium, setting forth comprehensive basics of ORG (DTd). Along with previous results by the author during DATE, this work contains also some new developments of DTd. Based on the ORG's constitutive equations, reformulated by the author thermodynamic affinit...	1
We consider the problem of high-dimensional non-linear variable selection for supervised learning. Our approach is based on performing linear selection among exponentially many appropriately defined positive definite kernels that characterize non-linear interactions between the original variables. To select efficiently...	Hawking's black hole information puzzle highlights the incompatibility between our present understanding of gravity and quantum physics. However, Hawking's prediction of black-hole evaporation is at a semiclassical level. CARDINAL therefore suspects some modifications of the character of the radiation when quantum prop...	0
Game theoretic equilibria are mathematical expressions of rationality. Rational agents are used to model not only humans and their software representatives, but also organisms, populations, species and genes, interacting with each other and with the environment. Rational behaviors are achieved not only through consciou...	The diverse views of science of security have opened up several alleys towards applying the methods of science to security. We pursue a different kind of connection between science and security. This paper explores the idea that security is not just a suitable subject for science, but that the process of security is al...	1
We study light vector meson electroproduction at small $x$ within the generalized parton distributions (GPDs) model. The modified perturbative approach is used, where the quark transverse degrees of freedom in the vector meson wave function and hard subprocess are considered. Our results on ORG section and spin observa...	On the basis of the handbag approach we study cross sections and spin asymmetries for leptoproduction of various vector and pseudoscalar mesons. Our results are in good agrement with high energy experiments. We analyse what information about ORG (GPDs) can be obtained from these reactions.	1
The commonly used circuit model of ORG computing leaves out the problems of imprecision in the initial state preparation, particle statistics (indistinguishability of particles belonging to the same quantum state), and error correction (current techniques cannot correct all small errors). The initial state in the circu...	GPE computing is the use of multiple autonomic and parallel modules together with integrative processors at a higher level of abstraction to embody "intelligent" processing. The biological basis of this computing is sketched and the matter of learning is examined.	1
We show in this article that if a holomorphic vector bundle has a nonnegative NORP metric in the sense of PERSON and ORG, which always exists on globally generated holomorphic vector bundles, then some special linear combinations of ORG forms are strongly nonnegative. This particularly implies that all the ORG numbers ...	Separation of competing speech is a key challenge in signal processing and a feat routinely performed by the human auditory brain. A long standing benchmark of the spectrogram approach to source separation is known as the ideal binary mask. Here, we train a convolutional deep neural network, on a CARDINAL-speaker cockt...	0
We analyse the diffractive $Q \bar Q$ production and final jet kinematics in polarized deep-inelastic lp scattering at $\sqrt{s}=20 GeV$. We show that this reaction can be used in the new spectrometer of the COMPASS Collaboration at GPE to study the quark-pomeron coupling structure.	Connections between the sequentiality/concurrency distinction and the semantics of proofs are investigated, with particular reference to games and ORG.	0
We present new findings in regard to data analysis in very high dimensional spaces. We use dimensionalities up to CARDINAL. A particular benefit of ORG is its suitability for carrying out an orthonormal mapping, or scaling, of power law distributed data. Power law distributed data are found in many domains. Corresponde...	Errors in data are usually unwelcome and so some means to correct them is useful. However, it is difficult to define, detect or correct errors in an unsupervised way. Here, we train a deep neural network to re-synthesize its inputs at its output layer for a given class of data. We then exploit the fact that this abstra...	0
We derive an exact and efficient NORP regression algorithm for piecewise constant functions of unknown segment number, boundary location, and levels. It works for any noise and segment level prior, ORG which can handle outliers. We derive simple but good estimates for the in-segment variance. We also propose a NORP reg...	PERSON's uncomputable universal prediction scheme $\xi$ allows to predict the next symbol $x_k$ of a sequence $x_1...x_{k-1}$ for any Turing computable, but otherwise unknown, probabilistic environment $\mu$. This scheme will be generalized to arbitrary environmental classes, which, among others, allows the constructio...	1
Computability logic is a formal theory of computational tasks and resources. PERSON in it represent interactive computational problems, and "truth" is understood as algorithmic solvability. Interactive computational problems, in turn, are defined as a certain sort games between a machine and its environment, with logic...	We propose a new class of ORG computing algorithms which generalize many standard ones. The goal of our algorithms is to estimate probability distributions. Such estimates are useful in, for example, applications of WORK_OF_ART, where inferences are made based on uncertain knowledge. The class of algorithms that we pro...	0
This paper is devoted to expressiveness of hypergraphs for which uncertainty propagation by local computations via Shenoy/Shafer method applies. It is demonstrated that for this propagation method for a given joint belief distribution no valuation of hyperedges of a hypergraph may provide with simpler hypergraph struct...	Several approaches of structuring (factorization, decomposition) of PERSON joint belief functions from literature are reviewed with special emphasis on their capability to capture independence from the point of view of the claim that belief functions generalize bayes notion of probability. It is demonstrated that PER...	1
The speed and transformative power of human cultural evolution is evident from the change it has wrought on our planet. This chapter proposes a human computation program aimed at (CARDINAL) distinguishing algorithmic from non-algorithmic components of cultural evolution, (CARDINAL) computationally modeling the algorith...	General-purpose, intelligent, learning agents cycle through sequences of observations, actions, and rewards that are complex, uncertain, unknown, and NORP. On the other hand, reinforcement learning is well-developed for small finite state PERSON decision processes (MDPs). Up to now, extracting the right state represent...	0
In a previous paper, we showed how entanglement of formation can be defined as a minimum of the quantum conditional mutual information (a.k.a. ORG). In classical information theory, the NORP-Blahut method is one of the preferred methods for calculating extrema of mutual information. In this paper, we present a new meth...	ORG (QMR) is a compendium of statistical knowledge connecting diseases to findings (symptoms). The information in ORG can be represented as a NORP network. The inference problem (or, in more medical language, giving a diagnosis) for the ORG is to, given some findings, find the probability of each disease. Rejection sam...	1
ORG computers use continuous properties of physical system for modeling. In the paper is described possibility of modeling by analogue ORG computers for some model of data analysis. It is analogue associative memory and a formal neural network. A particularity of the models is combination of continuous internal process...	This paper presents a CARDINAL-valued representation of bifuzzy sets. This representation is related to a CARDINAL-valued logic that uses the following values: true, false, inconsistent, incomplete and ambiguous. In the framework of CARDINAL-valued representation, formulae for similarity, entropy and syntropy of bifuzz...	0
The place of an anthropic argument in the discrimination between various cosmological models is to be reconsidered following the classic criticisms of PERSON and PERSON. Different versions of the anthropic argument against cosmologies involving an infinite series of past events are analyzed and applied to several instr...	The intriguing suggestion of ORG (DATE) that the universe--contrary to all our experiences and expectations--contains only a small amount of information due to an extremely high degree of internal symmetry is critically examined. It is shown that there are several physical processes, notably Hawking evaporation of blac...	1
An overview of recent ORG results on inclusive production of D* mesons in deep inelastic scattering is given.	There exists a large number of experimental and theoretical results supporting the picture of "macroscopic qubits" implemented, for instance, by ORG atoms, PERSON junctions or ORG condensates - the systems which should rather emerge in localized semiclassical states. In this note it is shown how, under realistic condit...	0
Hidden variables are well known sources of disturbance when recovering belief networks from data based only on measurable variables. Hence models assuming existence of hidden variables are under development. This paper presents a new algorithm "accelerating" the known ORG algorithm of Spirtes, Glymour and ORG {Spirte...	It is proven, by example, that the version of $k$-means with random initialization does not have the property \emph{probabilistic $k$-richness}.	1
This paper is a survey discussing ORG concepts, methods, and applications. It goes deep into the document and query modelling involved in ORG systems, in addition to pre-processing operations such as removing stop words and searching by synonym techniques. The paper also tackles text categorization along with its appli...	CARDINAL of the main purposes of a computer is automation. In fact, automation is the technology by which a manual task is performed with minimum or CARDINAL human assistance. Over DATE, automation has proved to reduce operation cost and maintenance time in addition to increase system productivity, reliability, and per...	1
This paper looks at Turing's postulations about ORG in his paper 'Computing Machinery and ORG', published in DATE. It notes how accurate they were and how relevant they still are DATE. This paper notes the arguments and mechanisms that he suggested and tries to expand on them further. The paper however is mostly about ...	This paper describes some biologically-inspired processes that could be used to build the sort of networks that we associate with the human brain. New to this paper, a 'refined' neuron will be proposed. This is a group of neurons that by joining together can produce a more analogue system, but with the same level of co...	1

End of preview. Expand in Data Studio

Dataset Card for Dataset Name

Dataset for authorship verification, comprised of 12 cleaned, modified, open source authorship verification and attribution datasets.

Dataset Details

Code for cleaning and modifying datasets can be found in https://github.com/swan-07/authorship-verification/blob/main/Authorship_Verification_Datasets.ipynb and is detailed in paper.

Datasets used to produce the final dataset are:

Reuters50

@misc{misc_reuter_50_50_217, author = {Liu,Zhi}, title = {{Reuter_50_50}}, year = {2011}, howpublished = {UCI Machine Learning Repository}, note = {{DOI}: https://doi.org/10.24432/C5DS42} }

License: (CC BY 4.0)

The Blog Authorship Corpus

@misc{misc_blog_authorship_corpus, author = {J. Schler, M. Koppel, S. Argamon and J. Pennebaker}, title = {{Effects of Age and Gender on Blogging}}, year = {2006}, howpublished = {2006 AAAI Spring Symposium on Computational Approaches for Analyzing Weblogs}, note = {https://u.cs.biu.ac.il/~schlerj/schler_springsymp06.pdf} }

License from https://www.kaggle.com/datasets/rtatman/blog-authorship-corpus: The corpus may be freely used for non-commercial research purposes.

Victorian

@misc{misc_victorian_era_authorship_attribution_454, author = {Gungor,Abdulmecit}, title = {{Victorian Era Authorship Attribution}}, year = {2018}, howpublished = {UCI Machine Learning Repository}, note = {{DOI}: https://doi.org/10.24432/C5SW4H} }

License: (CC BY 4.0)

arXiv

@misc{misc_arXiv_100authors_comp_sci, author = {Moreo, Alejandro}, title = {{arXiv abstracts and titles from 1,469 single-authored papers (100 unique authors) in computer science }}, year = {2022}, howpublished = {Zenodo}, note = {{DOI}: https://doi.org/10.5281/zenodo.7404702} }

License: (CC BY 4.0)

DarkReddit

@article{DBLP:journals/corr/abs-2112-05125, author = {Andrei Manolache and Florin Brad and Elena Burceanu and Antonio Barbalau and Radu Tudor Ionescu and Marius Popescu}, title = {Transferring BERT-like Transformers' Knowledge for Authorship Verification}, journal = {CoRR}, volume = {abs/2112.05125}, year = {2021}, url = {https://arxiv.org/abs/2112.05125}, eprinttype = {arXiv}, eprint = {2112.05125}, timestamp = {Mon, 13 Dec 2021 17:51:48 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2112-05125.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

@inproceedings{Kestemont2020OverviewOT, author = {Mike Kestemont and Enrique Manjavacas and Ilia Markov and Janek Bevendorff and Matti Wiegmann and Efstathios Stamatatos and Martin Potthast and Benno Stein}, editor = {Linda Cappellato and Carsten Eickhoff and Nicola Ferro and Aur{'{e}}lie N{'{e}}v{'{e}}ol}, title = {Overview of the Cross-Domain Authorship Verification Task at {PAN} 2020}, booktitle = {Working Notes of {CLEF} 2020 - Conference and Labs of the Evaluation Forum, Thessaloniki, Greece, September 22-25, 2020}, series = {{CEUR} Workshop Proceedings}, volume = {2696}, publisher = {CEUR-WS.org}, year = {2020}, url = {http://ceur-ws.org/Vol-2696/paper\_264.pdf}, timestamp = {Tue, 27 Oct 2020 17:12:48 +0100}, biburl = {https://dblp.org/rec/conf/clef/KestemontMMBWSP20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

License from https://github.com/bit-ml/Dupin/tree/main: not disclosed

British Academic Written English (BAWE)

@misc{20.500.12024/2539, title = {British Academic Written English Corpus}, author = {Nesi, Hilary and Gardner, Sheena and Thompson, Paul and Wickens, Paul}, url = {http://hdl.handle.net/20.500.12024/2539}, note = {Oxford Text Archive}, copyright = {Distributed by the University of Oxford under a Creative Commons Attribution-{NonCommercial}-{ShareAlike} 3.0 Unported License.}, year = {2008} }

License from https://ota.bodleian.ox.ac.uk/repository/xmlui/handle/20.500.12024/2539: (CC BY-NC-SA 3.0)

IMDB62

@article{seroussi2014authorship, title={Authorship attribution with topic models}, author={Seroussi, Yanir and Zukerman, Ingrid and Bohnert, Fabian}, journal={Computational Linguistics}, volume={40}, number={2}, pages={269--310}, year={2014}, publisher={MIT Press One Rogers Street, Cambridge, MA 02142-1209, USA journals-info~…} }

License from https://umlt.infotech.monash.edu/?page_id=266: not disclosed

PAN11

@misc{misc_pan11-author-identification-corpora, author = {Argamon, Shlomo and Juola, Patrick}, title = {{PAN11 Author Identification: Attribution}}, year = {2011}, howpublished = {Zenodo}, note = {{DOI}: https://doi.org/10.5281/zenodo.3713245} }

License: not disclosed

PAN13

@misc{misc_pan13-authorship-verification-test-and-training, author = {Juola, Patrick and Stamatatos, Efstathios}, title = {{PAN13 Author Identification: Verification}}, year = {2013}, howpublished = {Zenodo}, note = {{DOI}: https://doi.org/10.5281/zenodo.3715998} }

License: not disclosed

PAN14

@misc{misc_pan14-authorship-verification-test-and-training, author = {Stamatatos, Efstathios and Daelemans, Walter and Verhoeven, Ben and Potthast, Martin and Stein, Benno and Juola, Patrick and A. Sanchez-Perez, Miguel and Barrón-Cedeño, Alberto}, title = {{PAN14 Author Identification: Verification}}, year = {2014}, howpublished = {Zenodo}, note = {{DOI}: https://doi.org/10.5281/zenodo.3716032} }

License: not disclosed

PAN15

@misc{misc_pan15-authorship-verification-test-and-training, author = {Stamatatos, Efstathios and Daelemans Daelemans amd Ben Verhoeven, Walter and Juola, Patrick and López-López, Aurelio and Potthast, Martin and Stein, Benno}, title = {{PAN15 Author Identification: Verification}}, year = {2015}, howpublished = {Zenodo}, note = {{DOI}: https://doi.org/10.5281/zenodo.3737563} }

License: not disclosed

PAN20

@Article{stein:2020k, author = {Sebastian Bischoff and Niklas Deckers and Marcel Schliebs and Ben Thies and Matthias Hagen and Efstathios Stamatatos and Benno Stein and Martin Potthast}, journal = {CoRR}, month = may, title = {{The Importance of Suppressing Domain Style in Authorship Analysis}}, url = {https://arxiv.org/abs/2005.14714}, volume = {abs/2005.14714}, year = 2020 }

using the open-set unseen all split from @article{DBLP:journals/corr/abs-2112-05125, author = {Andrei Manolache and Florin Brad and Elena Burceanu and Antonio Barbalau and Radu Tudor Ionescu and Marius Popescu}, title = {Transferring BERT-like Transformers' Knowledge for Authorship Verification}, journal = {CoRR}, volume = {abs/2112.05125}, year = {2021}, url = {https://arxiv.org/abs/2112.05125}, eprinttype = {arXiv}, eprint = {2112.05125}, timestamp = {Mon, 13 Dec 2021 17:51:48 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2112-05125.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

License from https://github.com/bit-ml/Dupin/tree/main: not disclosed

Datasets were cleaned, named entities were replaced with their general type in all except PAN14, PAN15, and PAN20, and datasets were restructured into dataframes with columns |text1|text2|same| where a value of 0 in same meant the two texts had different authors, while a value of 1 meant the two texts had the same author.

All datasets were split into train/test/verification, keeping the splits if given (see paper for specifics) and otherwise using a 0.7:0.15:0.15 split.

Downloads last month: 163

Models trained or fine-tuned on swan07/authorship-verification

swan07/bert-authorship-verification

Papers for swan07/authorship-verification

Rethinking the Authorship Verification Experimental Setups

Paper • 2112.05125 • Published Dec 9, 2021

The Importance of Suppressing Domain Style in Authorship Analysis

Paper • 2005.14714 • Published May 29, 2020