nils-herrmann/clean_scirepeval huggingface dataset:
Commonsense Metaphysics and Lexical Semantics
In the TACITUS project for using commonsense knowledge in the understanding of texts about mechanical devices and their failures, we have been developing various commonsense theories that are needed to mediate between the way we talk about the behavior of such devices and causal models of their operation. Of central importance in this effort is the axiomatization of what might be called "commonsense metaphysics". This includes a number of areas that figure in virtually every domain of discourse, such as scalar notions, granularity, time, space, material, physical objects, causality, functionality, force, and shape. Our approach to lexical semantics is then to construct core theories of each of these areas, and then to define, or at least characterize, a large number of lexical items in terms provided by the core theories. In the TACITUS system, processes for solving pragmatics problems posed by a text will use the knowledge base consisting of these theories in conjunction with the logical forms of the sentences in the text to produce an interpretation. In this paper we do not stress these interpretation processes; this is another, important aspect of the TACITUS project, and it will be described in subsequent papers.

title: Ernest Davis, Representations of Commonsense Knowledge

title: Interactive retrieval of complex documents
abstract: Documents such as reports, articles, memos, and forms have complex structure and layout, as well as multimedia content. Information systems that represent these aspects of documents must be able to handle queries more complex than in typical database or text retrieval systems. In this paper, we describe an interface that allows the specification of uncertain queries and combines evidence about the relevance of documents to produce an overall ranking. We also report the results of an experiment that addresses some of the cognitive aspects of such an interface.

title: Implementing ranking strategies using text signatures
abstract: Signature files provide an efficient access method for text in documents, but retrieval is usually limited to finding documents that contain a specified Boolean pattern of words. Effective retrieval requires that documents with similar meanings be found through a process of plausible inference. The simplest way of implementing this retrieval process is to rank documents in order of their probability of relevance. In this paper techniques are described for implementing probabilistic ranking strategies with sequential and bit-sliced signature tiles and the limitations of these implementations with regard to their effectiveness are pointed out. A detailed comparison is made between signature-based ranking techniques and ranking using term-based document representatives and inverted files. The comparison shows that term-based representations are at least competitive (in terms of efficiency) with signature files and, in some situations, superior.
On Senary Simplex Codes
This paper studies senary simplex codes of type ? and two punctured versions of these codes (type s and ?). Self-orthogonality, torsion codes, weight distribution and weight hierarchy properties are studied. We give a new construction of senary codes via their binary and ternary counterparts, and show that type ? and s simplex codes can be constructed by this method.

title: Some Results on NQR Codes
abstract: In  Tiu and Wallace have constructed a new class of linear codes called Norm Quadratic Residue code Cp for p> a prime of the form 4n+1 and determined some of its properties. It was shown that Cp≤ p. He further conjectured that Cp = p. In the present correspondence we show that similar construction works for primes of the form 4n-1. We further show that dimCp = p for any odd prime p and determine few elementary properties of these codes.

title: Queueing Models and Stability of Message Flows in Distributed Simulators of Open Queueing Networks

title: Human protein reference database—2006 update
abstract: Human Protein Reference Database (HPRD) () was developed to serve as a comprehensive collection of protein features, post-translational modifications (PTMs) and protein–protein interactions. Since the original report, this database has increased to >20 000 proteins entries and has become the largest database for literature-derived protein–protein interactions (>30 000) and PTMs (>8000) for human proteins. We have also introduced several new features in HPRD including: (i) protein isoforms, (ii) enhanced search options, (iii) linking of pathway annotations and (iv) integration of a novel browser, GenProt Viewer (), developed by us that allows integration of genomic and proteomic information. With the continued support and active participation by the biomedical community, we expect HPRD to become a unique source of curated information for the human proteome and spur biomedical discoveries based on integration of genomic, transcriptomic and proteomic data.
A Direct Formulation for Sparse Pca Using Semidefinite Programming
We examine the problem of approximating, in the Frobenius-norm sense, a positive, semidefinite symmetric matrix by a rank-one matrix, with an upper bound on the cardinality of its eigenvector. The problem arises in the decomposition of a covariance matrix into sparse factors, and has wide applications ranging from biology to finance. We use a modification of the classical variational representation of the largest eigenvalue of a symmetric matrix, where cardinality is constrained, and derive a semidefinite programming based relaxation for our problem. We also discuss Nesterov's smooth minimization technique applied to the SDP arising in the direct sparse PCA method.

title: Learning Spectral Clustering
abstract: Spectral clustering refers to a class of techniques which rely on the eigen-structure of a similarity matrix to partition points into disjoint clusters with points in the same cluster having high similarity and points in different clusters having low similarity. In this paper, we derive a new cost function for spectral clustering based on a measure of error between a given partition and a solution of the spectral relaxation of a minimum normalized cut problem. Minimizing this cost function with respect to the partition leads to a new spectral clustering algorithm. Minimizing with respect to the similarity matrix leads to an algorithm for learning the similarity matrix. We develop a tractable approximation of our cost function that is based on the power method of computing eigenvectors.

title: Three-dimensional description of scenes observed in aerial photography
abstract: Three-dimensional (3-D) representation of natural scenes is a major problem of computer vision. In this paper, we present a method for re-building scenes from aerial photographs. The complete method involves the geometric modelling of taking of views, the automatic matching of images and the scene description as a set of vertical, oblique or horizontal planes. This method was tested on images of urban and industrial zones. The precision that we obtained allows us to introduce such a 3-D representation in a complex set of routines for the analysis of aerial photographs.
A key-chain-based keying scheme for many-to-many secure group communication
We propose a novel secure group keying scheme using hash chain for many-to-many secure group communication. This scheme requires a key predistribution center to generate multiple hash chains and allocates exactly one hash value from each chain to a group member. A group member can use its allocated hash values (secrets) to generate group and subgroup keys. Key distribution can be offline or online via the key distribution protocol. Once keys are distributed, this scheme enables a group member to communicate with any possible subgroups without the help of the key distribution center, and without having to leave the overall group, thus avoiding any setup delay. Our scheme is suitable for applications where the population of a system is stable, group size is moderate, subgroup formation is frequent, and the application is delay sensitive. Through analysis, we present effectiveness of our approach.

title: Source routing based pairwise key establishment protocol for sensor networks
abstract: Sensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys must be established between them. The establishment of secret keys after deployment of sensors requires wireless communication. Because of the energy constraints, an efficient key establishment scheme cannot be designed without considering the power consumption factor in wireless communication. In order to reduce the communication overhead, we propose a source routing based pairwise key establishment protocol for large-scale sensor networks. We then use a probability model proposed in [D. Huang et al., (2004)] to analyze the communication overhead, and security strength of the scheme.

title: An interference-cancellation scheme for carrier frequency offsets correction in OFDMA systems
abstract: Recently, orthogonal frequency-division multiplexing (OFDM), with clusters of subcarriers allocated to different subscribers (often referred to as OFDMA), has gained much attention for its ability in enabling multiple-access wireless multimedia communications. In such systems, carrier frequency offsets (CFOs) can destroy the orthogonality among subcarriers. As a result, multiuser interference (MUI) along with significant performance degradation can be induced. In this paper, we present a scheme to compensate for the CFOs at the base station of an OFDMA system. In the proposed scheme, circular convolutions are employed to generate the interference after the discrete Fourier transform processing, which is then removed from the original received signal to increase the signal-to-interference power ratio (SIR). Both SIR analysis and simulation results will show that the proposed scheme can significantly improve system performance.

title: A state-transition-based incremental protocol specification
The Internet Chair
A pivot (swivel, rotating) chair is considered as an input/output device, an information appliance. The input modality is orientation tracking, which can dynamically select transfer functions used to spatialize audio in a rotation-invariant soundscape. In groupware situations, like teleconferencing or chat spaces, such orientation tracking can also be used to twist iconic representations of a seated user, avatars in a virtual world, enabling social situation awareness via coupled visual displays, soundscape-stabilized virtual source locations, and direction-dependent projection of non-omnidirectional sources. Using its audio output modality, the system can present unencumbered binaural sound with soundscape stabilization for multichannel sound image localization.

title: Design and Control of Shared Conferencing Environments for Audio Telecommunication Using Individually Measured HRTFs
abstract: A technique is presented for dynamically invoking a set of head-related transfer functions (HRTFs) and scaling gain, driven by a dynamic map in a graphic window. With such an interface, users may configure a virtual conferencing environment, manipulating virtual positions of teleconferees. The design of a personal headphone teleconferencing prototype is proposed, integrating spatialized sound presentation with individualized HRTF measurement using a bifunctional transducer. According to judgment tests, the use of individualized HRTFs instead of dummy-head HRTFs can reduce front-back sound image confusion.

title: Virtual Gain for Audio Windows
abstract: Audio windowing is a front-end, or user interface, to an audio system with a real-time spatial sound back end. Complementing directionalization by a digital signal processor (DSP), gain adjustment is used to control the volume of the various mixels ([sound] mixing elements). Virtual gain can be synthesized from components derived from collective iconic size, mutual distance, orientation and directivity, and selectively enabled according to room-wise partitioning of sources across sinks. This paper describes a derivation of virtual gain, and outlines the deployment of these expressions in an audio windowing system.

title: Cognitive Processing and Hypermedia Comprehension: A Preliminary Synthesis
Virtual Gain for Audio Windows
Audio windowing is a front-end, or user interface, to an audio system with a real-time spatial sound back end. Complementing directionalization by a digital signal processor (DSP), gain adjustment is used to control the volume of the various mixels ([sound] mixing elements). Virtual gain can be synthesized from components derived from collective iconic size, mutual distance, orientation and directivity, and selectively enabled according to room-wise partitioning of sources across sinks. This paper describes a derivation of virtual gain, and outlines the deployment of these expressions in an audio windowing system.

title: Design and Control of Shared Conferencing Environments for Audio Telecommunication Using Individually Measured HRTFs
abstract: A technique is presented for dynamically invoking a set of head-related transfer functions (HRTFs) and scaling gain, driven by a dynamic map in a graphic window. With such an interface, users may configure a virtual conferencing environment, manipulating virtual positions of teleconferees. The design of a personal headphone teleconferencing prototype is proposed, integrating spatialized sound presentation with individualized HRTF measurement using a bifunctional transducer. According to judgment tests, the use of individualized HRTFs instead of dummy-head HRTFs can reduce front-back sound image confusion.

title: Cognitive Processing and Hypermedia Comprehension: A Preliminary Synthesis
Protecting free-roaming mobile agent against multiple colluded truncation attacks
Mobile agent environment is one of the emerging technology to reduce the network traffic. Various security issues are identified and protected. Now the new security issue in this environment is the multiple colluded truncation attacks in the Free-roaming mobile agents. This paper proposes the identity verification mechanism to protect the multiple colluded truncation attacks The identification is verified from the beginning dummy offer of the creator of the agent.

title: Generating routing table for free roaming mobile agent in distributed environment
abstract: Free roaming mobile agent [D. Xu, L. Harn, M. Narasimhan, J. Luo. ''An Improved Free-Roaming Mobile Agent Security Protocol against Colluded Truncation Attacks.'' In Proceedings of the 30th Annual international Computer Software and Applications Conference(COMPSAC,06), Volume 2, Page(s):309-314,Chigago, Sept. 2006,  S. Venkatesan, C. Chellappan, ''Protecting free roaming mobile agent against multiple colluded truncation attacks'', In proceedings of the 3rd International conference on Mobile Multimedia Communication (Mobimedia'07), page(s): 293-297, August 2007.] is to collect information from more number of remote host using the shortest route. The routing table available in the router is not applicable for the free roaming mobile agent to roam around the network, so each and every server must have the routing information. This paper proposes a model to generate the routing table for the free roaming mobile agent to roam around the network by calculating the link cost between the nodes. Link cost between the servers is measured by the energy consumed to reach the destination. Link cost is measured by the transmission of agent instead of sending the message because here the route is calculated for agent roaming. The cost for transferring the message and the agent differs because of the migration and transfer. In agent transmission, the whole thing will be migrated to the remote host. But in the message transmission, the particular message is transmitted. Routing table in the destination will be generated automatically by the mobile agent while it visits the destination host and the routing table of the source host will be generated after the agent returns to its home (source host).

title: Three Degree of Freedom Tracking in Realtime Using a Wrist-Mounted Laser Range Finder
Characterization of graphs with hall number 2
Hall’s condition is a simple condition that a graph G and list assignment L must satisfy if G has a proper L-colouring. The Hall number of G is the smallest integer m such that whenever each list has size m and Hall’s condition is satisfied a proper L-colouring exists. Hilton and P.D. Johnson introduced the parameter and showed that a graph has Hall number 1 if and only if every block is a clique. In this paper we characterize graphs with Hall number 2. ∗Current address: London School of Economics, Houghton Street, London WC2A 2AE, U.K.

title: Defining sets for Latin squares given that they are based on groups
abstract: We investigate defining sets for Latin squares where we are given that the Latin square is the Cayley table for some group. Our main result is that the proportion of entries in a smallest defining set approaches zero as the order of the group increases without bound.

title: Obtaining Online Ecological Colourings by Generalizing First-Fit
abstract: A colouring of a graph is ecological if every pair of vertices that have the same set of colours in their neighbourhood are coloured alike. We consider the following problem: if a graph G and an ecological colouring c of G are given, can further vertices added to G, one at a time, be coloured using colours from some finite set C so that at each stage the current graph is ecologically coloured? If the answer is yes, then we say that the pair (G,c) is ecologically online extendible. By generalizing the well-known First-Fit algorithm, we are able to characterize when (G,c) is ecologically online extendible. For the case where c is a colouring of G in which each vertex is coloured distinctly, we give a simple characterization of when (G,c) is ecologically online extendible using only the colours of c, and we also show that (G,c) is always online extendible if we permit ourselves to use one extra colour. We also study (off-line) ecological H-colourings where the colouring must satisfy further restrictions imposed by some fixed pattern graph H. We characterize the computational complexity of this problem. This solves an open question posed by Crescenzi et al.

title: Amalgamations of connected k-factorizations
abstract: In this paper, necessary and sufficient conditions are found for a graph with exactly one amalgamated vertex to be the amalgamation of a k-factorization of Kkn+1 in which each k factor is connected. From this result, necessary and sufficient conditions for a given edge-coloured Kt to be embedded in a connected k-factorization of Kkn+1 are deduced.
Amalgamations of factorizations of complete equipartite graphs
Let t be a positive integer, and let L=(l"1,...,l"t) and K=(k"1,...,k"t) be collections of nonnegative integers. A graph has a (t,K,L) factorization if it can be represented as the edge-disjoint union of factors F"1,...,F"t where, for 1=

title: The computational complexity of the parallel knock-out problem
abstract: We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates exactly one of its neighbours. We show that the problem of whether, for a given bipartite graph, such a scheme can be found that eliminates every vertex is NP-complete. Moreover, we show that, for all fixed positive integers k>=2, the problem of whether a given bipartite graph admits a scheme in which all vertices are eliminated in at most (exactly) k rounds is NP-complete. For graphs with bounded tree-width, however, both of these problems are shown to be solvable in polynomial time. We also show that r-regular graphs with r>=1, factor-critical graphs and 1-tough graphs admit a scheme in which all vertices are eliminated in one round.

title: Path factors and parallel knock-out schemes of almost claw-free graphs
abstract: An H"1,{H"2}-factor of a graph G is a spanning subgraph of G with exactly one component isomorphic to the graph H"1 and all other components (if there are any) isomorphic to the graph H"2. We completely characterise the class of connected almost claw-free graphs that have a P"7,{P"2}-factor, where P"7 and P"2 denote the paths on seven and two vertices, respectively. We apply this result to parallel knock-out schemes for almost claw-free graphs. These schemes proceed in rounds in each of which each surviving vertex eliminates one of its surviving neighbours. A graph is reducible if such a scheme eliminates every vertex in the graph. Using our characterisation, we are able to classify all reducible almost claw-free graphs, and we can show that every reducible almost claw-free graph is reducible in at most two rounds. This leads to a quadratic time algorithm for determining if an almost claw-free graph is reducible (which is a generalisation and improvement upon the previous strongest result that showed that there was a O(n^5^.^3^7^6) time algorithm for claw-free graphs on n vertices).

title: Defining sets for Latin squares given that they are based on groups
abstract: We investigate defining sets for Latin squares where we are given that the Latin square is the Cayley table for some group. Our main result is that the proportion of entries in a smallest defining set approaches zero as the order of the group increases without bound.
Path factors and parallel knock-out schemes of almost claw-free graphs
An H"1,{H"2}-factor of a graph G is a spanning subgraph of G with exactly one component isomorphic to the graph H"1 and all other components (if there are any) isomorphic to the graph H"2. We completely characterise the class of connected almost claw-free graphs that have a P"7,{P"2}-factor, where P"7 and P"2 denote the paths on seven and two vertices, respectively. We apply this result to parallel knock-out schemes for almost claw-free graphs. These schemes proceed in rounds in each of which each surviving vertex eliminates one of its surviving neighbours. A graph is reducible if such a scheme eliminates every vertex in the graph. Using our characterisation, we are able to classify all reducible almost claw-free graphs, and we can show that every reducible almost claw-free graph is reducible in at most two rounds. This leads to a quadratic time algorithm for determining if an almost claw-free graph is reducible (which is a generalisation and improvement upon the previous strongest result that showed that there was a O(n^5^.^3^7^6) time algorithm for claw-free graphs on n vertices).

title: The computational complexity of the parallel knock-out problem
abstract: We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates exactly one of its neighbours. We show that the problem of whether, for a given bipartite graph, such a scheme can be found that eliminates every vertex is NP-complete. Moreover, we show that, for all fixed positive integers k>=2, the problem of whether a given bipartite graph admits a scheme in which all vertices are eliminated in at most (exactly) k rounds is NP-complete. For graphs with bounded tree-width, however, both of these problems are shown to be solvable in polynomial time. We also show that r-regular graphs with r>=1, factor-critical graphs and 1-tough graphs admit a scheme in which all vertices are eliminated in one round.

title: Characterization of graphs with hall number 2
abstract: Hall’s condition is a simple condition that a graph G and list assignment L must satisfy if G has a proper L-colouring. The Hall number of G is the smallest integer m such that whenever each list has size m and Hall’s condition is satisfied a proper L-colouring exists. Hilton and P.D. Johnson introduced the parameter and showed that a graph has Hall number 1 if and only if every block is a clique. In this paper we characterize graphs with Hall number 2. ∗Current address: London School of Economics, Houghton Street, London WC2A 2AE, U.K.