Orbit Weighting Scheme in the Context of Vector Space Information Retrieval

This study introduces the Orbit Weighting Scheme(OWS),a novel approach aimed at enhancing the precision and efficiency of Vector Space information retrieval(IR)models,which have traditionally relied on weighting schemes like tf-idf and BM25.These conventional methods often struggle with accurately capturing document relevance,leading to inefficiencies in both retrieval performance and index size management.OWS proposes a dynamic weighting mechanism that evaluates the significance of terms based on their orbital position within the vector space,emphasizing term relationships and distribution patterns overlooked by existing models.Our research focuses on evaluating OWS’s impact on model accuracy using Information Retrieval metrics like Recall,Precision,InterpolatedAverage Precision(IAP),andMeanAverage Precision(MAP).Additionally,we assessOWS’s effectiveness in reducing the inverted index size,crucial for model efficiency.We compare OWS-based retrieval models against others using different schemes,including tf-idf variations and BM25Delta.Results reveal OWS’s superiority,achieving a 54%Recall and 81%MAP,and a notable 38%reduction in the inverted index size.This highlights OWS’s potential in optimizing retrieval processes and underscores the need for further research in this underrepresented area to fully leverage OWS’s capabilities in information retrieval methodologies.

Near-Vector Spaces Constructed over Zp, for p a Prime

The purpose of this paper is to construct near-vector spaces using a result by Van der Walt, with Zp for p a prime, as the underlying near-field. There are two notions of near-vector spaces, we focus on those studied by André [1]. These near-vector spaces have recently proven to be very useful in finite linear games. We will discuss the construction and properties, give examples of these near-vector spaces and give its application in finite linear games.

On Irresolute Topological Vector Spaces

In this paper, our focus is to investigate the notion of irresolute topological vector spaces. Irresolute topological vector spaces are defined by using semi open sets and irresolute mappings. The notion of irresolute topological vector spaces is analog to the notion of topological vector spaces, but mathematically it behaves differently. An example is given to show that an irresolute topological vector space is not a topological vector space. It is proved that: 1) Irresolute topological vector spaces possess open hereditary property;2) A homomorphism of irresolute topological vector spaces is irresolute if and only if it is irresolute at identity element;3) In irresolute topological vector spaces, the scalar multiple of semi compact set is semi compact;4) In irresolute topological vector spaces, every semi open set is translationally invariant.

Applying two channels to vector space secret sharing based multi-signature scheme

Secret sharing and digital signature is an important research area in information security and has wide applications in such fields as safeguarding and legal use of confidential information, secure multiparty computation and electronic commerce. But up to now, study of signature based on general vector space secret sharing is very weak. Aiming at this drawback, the authors did some research on vector space secret sharing against cheaters, and proposed an efficient but secure vector space secret sharing based multi-signature scheme, which is implemented in two channels. In this scheme, the group signature can be easily produced if an authorized subset of participants pool their secret shadows and it is impossible for them to generate a group signature if an unauthorized subset of participants pool their secret shadows. The validity of the group signature can be verified by means of verification equations. A group signature of authorized subset of participants cannot be impersonated by any other set of partici- pants. Moreover, the suspected forgery can be traced, and the malicious participants can be detected in the scheme. None of several possible attacks can successfully break this scheme.

Dynamic Vector Space Secret Sharing Based on Certificates

A vector space secret sharing scheme based on certificates is proposed in this paper. The difficulties of solving discrete logarithm assure confidential information＇s security, and the use of each participant＇s certificate makes the dealer have no need to transfer secret information to the participants. The proposed scheme is dynamic. It can effectively check cheaters and does not have secure channel requirements.

Edge Enhancement for Remote Sensing Image Using Norm Algorithm in L_2 Vector Space

The Householder transformation-norm structure function in L2 vector space of linear algebra is introduced, and the edge enhancement for remote sensing images is realized. The experiment result is compared with traditional Laplacian and Sobel edge enhancements and it shows that the effect of the new method is better than that of the traditional algorithms.

ON THE SYMPLECTIC INVARIANTS OF A SUBSPACE OF A VECTOR SPACE~*

Let F be any commutative field. Let v be an integer≥1 and be a fixed 2v × 2v nonsingular alternate matrix over F. Define Sp(F)={T: 2v×2v matrix over F|TKT~T=K}. It is well-known that Sp(F) is a group with respect to the matrix multiplication and is called the symplectic group of degree 2v over F

A Group Oriented Cryptosystem for the Vector Space Access Structure

A group oriented cryptosystem for the vector space access structure was proposed. This cryptosystem adopts self-certified public keys. It allows the participants of an authorized subset to cooperatively access an encrypted message. All data delivered in the cryptosystem are public. Therefore it does not need a partial decrypting results combiner and any secure communication channel. The security of the group oriented cryptosystem is based on the intractability of the discrete log problem and difficulty of factoring large integers. The suspected attacks can not break it.

ON THE DECOMPOSITION OF COMPLEX VECTOR SPACES AND THE JORDAN CANONICAL FORM OF COMPLEX LINEAR TRANSFORMATIONS

New objects characterizing the structure of complex linear transformations areintroduced. These new objects yield a new result for the decomposition of complexvector spaces relative to complex lrnear transformations and provide all Jordan basesby which the Jordan canonical form is constructed. Accordingly, they can result in thecelebrated Jordan theorem and the third decomposition theorem of space directly. and,moreover, they can give a new deep insight into the exquisite and subtle structure ofthe Jordan form. The latter indicates that the Jordan canonical form of a complexlinear transformation is an invariant structure associated with double arbitrary. choices.

Generalized Bi quasi variational Inequalities in Locally Convex Topological Vector Spaces

In this paper we investigate generalized bi quasi variational inequalities in locally convex topological vector spaces. Motivated and inspired by the recent research work in this field,we establish several existence theorems of solutions for generalized bi quasi variational inequalities,which are the extension and improvements of the earlier and recent results obtained previously by many authors including Sun and Ding [18],Chang and Zhang [23] and Zhang [24].

Construction of PBIB Desings by Using Subspace of Vector Space over Finite Fields

A new transitivity theorem of the general linear group GLn(Fq)is proved. A kind of new PBIB desings is constructed.

Evaluation of Modified Vector Space Representation Using ADFA-LD and ADFA-WD Datasets

Predicting anomalous behaviour of a running process using system call trace is a common practice among security community and it is still an active research area. It is a typical pattern recognition problem and can be dealt with machine learning algorithms. Standard system call datasets were employed to train these algorithms. However, advancements in operating systems made these datasets outdated and un-relevant. Australian Defence Force Academy Linux Dataset (ADFA-LD) and Australian Defence Force Academy Windows Dataset (ADFA-WD) are new generation system calls datasets that contain labelled system call traces for modern exploits and attacks on various applications. In this paper, we evaluate performance of Modified Vector Space Representation technique on ADFA-LD and ADFA-WD datasets using various classification algorithms. Our experimental results show that our method performs well and it helps accurately distinguishing process behaviour through system calls.

A SYSTEM IDENTIFICATION METHOD USING VECTOR SPACE BASE FUNCTION

This paper presents a new system identification approach using vector space base functions, and proposes two network structures based on Gamma sequence and Laguerre sequence. After analyzing and comparing these structures in detail, some simulation results to demonstrate the conclusions are given.

Lattices Associated with a Finite Vector Space

Let be a n-dimensional row vector space over a finite field For , let be a d-?dimensional subspace of . denotes the set of all the spaces which are the subspaces of and not the subspaces of except . We define the partial order on by ordinary inclusion (resp. reverse inclusion), and then is a poset, denoted by (resp. ). In this paper we show that both and are finite atomic lattices. Further, we discuss the geometricity of and , and obtain their characteristic polynomials.

Monotonic Vector Space Model (Ⅰ): Concepts and Operations

Monotonic vector space (MVS), as a novel model in which there exist some monotonic mappings, is proposed. MVS model is an abstract of many practical problems (such as image processing, system capability engineering, etc.) and includes many useful important operations. This paper, as the first one of series papers, discusses the MVS framework, relative important concepts and important operations including partition, synthesis, screening, sampling, etc. And algorithms for these operations are the focus of this paper. The application of these operations in system capability engineering will be dealt with in the second part of this series of papers.

A Simple Proof for a Property of the Vector Space Ⅴ Over the Field F

In this paper we’ll prove a fundameutal property of the vector space by means of the ex-tension field,i.e.the numbers of the elements of a basis of the vector space V over the field Fequal to the d imensions(V:F).

Monotonic Vector Space Model(II): Application in System Capability Indicator Analysis and Design

The application of some MVS operations (each dimension of which corresponds to a capability indicator) in system capability analysis and design, including capability indicator requirement analysis, effectiveness analysis, sensibility analysis, fuzzy analysis, stability analysis, capability optimization design, etc., is discussed in the second paper of this series of papers. And some MVS-based models and algorithms for capability analysis and design are put forward. Finally, an example of capability analysis and optimization design is given for explaining the usages of related models and algorithms.

L vector spaces and L fields

We construct in ZFC(the Zermelo-Fraenkel system with choice) an L topological vector space—a topological vector space that is an L space—and an L field—a topological field that is an L space. This generalizes earlier results in L spaces and L groups.

Structure of Quasi-Invariant Vector Spaces

Let V be a vector space over a field F and G a group of linear transformations in V. It is proved in this note that for any subspace U (V, if dimU/(U∩ g(U))≤ 1, for any g∈G, then there is a g∈ G such that U∩g(U) is a G-invariant subspace, or there is an x∈ V\U such that U + <x> is a G-invariant subspace. So a vector-space analog of Brailovsky's results on quasi-invariant sets is given.

A Construction of Authentication Codes with Arbitration from Vector Spaces over Finite Fields

This paper is devoted to constructing an authentication code with arbitration using subspaces of vector spaces over finite fields.Moreover,if we choose the encoding rules of the transmitter and the decoding rules of the receiver according to a uniform probability distribution,then some parameters and the probabilities of successful attacks are computed.