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.

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].

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.

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.

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.

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.

The Dual of the Two-Variable Exponent Amalgam Spaces (Lq(),lp())(Ω)

Wiener amalgam spaces are a class of function spaces where the function’s local and global behavior can be easily distinguished. These spaces are ex-tensively used in Harmonic analysis that originated in the work of Wiener. In this paper: we first introduce a two-variable exponent amalgam space (Lq(),lp())(Ω). Secondly, we investigate some basic properties of these spaces, and finally, we study their dual.

Nonlinear Parabolic Equations with Singularities in Colombeau Vector Spaces

We consider nonlinear parabolic equations with nonlinear non-Lipschitz＇s term and singular initial data like Dirac measure, its derivatives and powers. We prove existence-uniqueness theorems in Colombeau vector space yC^1,W^2,2（[0,T）,R^n）,n ≤ 3. Due to high singularity in a case of parabolic equation with nonlinear conservative term we employ the regularized derivative for the conservative term, in order to obtain the global existence-uniqueness result in Colombeau vector space yC^1,L^2（[0,T）,R^n）,n≤ 3.

Inverse problems of the Erdos-Ko-Rado type theorems for families of vector spaces and permutations

Ever since the famous Erd os-Ko-Rado theorem initiated the study of intersecting families of subsets,extremal problems regarding intersecting properties of families of various combinatorial objects have been extensively investigated.Among them,studies about families of subsets,vector spaces and permutations are of particular concerns.Recently,we proposed a new quantitative intersection problem for families of subsets:For F([n]k),define its total intersection number as I(F)=ΣF1;F2∈F|F1∩F2|.Then,what is the structure of F when it has the maximal total intersection number among all the families in([n]k)with the same family size?In a recent paper,Kong and Ge(2020)studied this problem and characterized extremal structures of families maximizing the total intersection number of given sizes.In this paper,we consider the analogues of this problem for families of vector spaces and permutations.For certain ranges of family sizes,we provide structural characterizations for both families of subspaces and families of permutations having maximal total intersection numbers.To some extent,these results determine the unique structure of the optimal family for some certain values of jFj and characterize the relationship between having the maximal total intersection number and being intersecting.Besides,we also show several upper bounds on the total intersection numbers for both families of subspaces and families of permutations of given sizes.

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.

Composition Operators with Linear Fractional Symbols on Vector-Valued Bergman Spaces

Let φ and ψ be linear fractional self\|maps of the unit disk D and X a separable Hilbert space. In this paper we completely characterize the weak compactness of the product operators of a composition operation C φ with another one's adjoint C * ψ on the vector\|valued Bergman space B 1(X) for forms C φC * ψ and C * ψC φ.

EMBEDDING THEOREMS ON CAMPANATO-MORREY SPACES FOR VECTOR FIELDS OF HoRMANDER TYPE

This paper deals with embedding theorems on Campanato-Marrey spaces formed by degenerate vector fields, which include Honnander and Grushin type of vector fields. These embedding theorems are somewhat different from the known Poincare estimates. The main ingredients of the proofs rely on the fractional maximal functions. These results evidently have applications to the regularity of subelliptic PDE.

Indirect Vector Control of Linear Induction Motors Using Space Vector Pulse Width Modulation

Vector control schemes have recently been used to drive linear induction motors(LIM)in high-performance applications.This trend promotes the development of precise and efficient control schemes for individual motors.This research aims to present a novel framework for speed and thrust force control of LIM using space vector pulse width modulation(SVPWM)inverters.The framework under consideration is developed in four stages.To begin,MATLAB Simulink was used to develop a detailed mathematical and electromechanical dynamicmodel.The research presents a modified SVPWM inverter control scheme.By tuning the proportional-integral(PI)controller with a transfer function,optimized values for the PI controller are derived.All the subsystems mentioned above are integrated to create a robust simulation of the LIM’s precise speed and thrust force control scheme.The reference speed values were chosen to evaluate the performance of the respective system,and the developed system’s response was verified using various data sets.For the low-speed range,a reference value of 10m/s is used,while a reference value of 100 m/s is used for the high-speed range.The speed output response indicates that themotor reached reference speed in amatter of seconds,as the delay time is between 8 and 10 s.The maximum amplitude of thrust achieved is less than 400N,demonstrating the controller’s capability to control a high-speed LIM with minimal thrust ripple.Due to the controlled speed range,the developed system is highly recommended for low-speed and high-speed and heavy-duty traction applications.

Word Embeddings and Semantic Spaces in Natural Language Processing

One of the critical hurdles, and breakthroughs, in the field of Natural Language Processing (NLP) in the last two decades has been the development of techniques for text representation that solves the so-called curse of dimensionality, a problem which plagues NLP in general given that the feature set for learning starts as a function of the size of the language in question, upwards of hundreds of thousands of terms typically. As such, much of the research and development in NLP in the last two decades has been in finding and optimizing solutions to this problem, to feature selection in NLP effectively. This paper looks at the development of these various techniques, leveraging a variety of statistical methods which rest on linguistic theories that were advanced in the middle of the last century, namely the distributional hypothesis which suggests that words that are found in similar contexts generally have similar meanings. In this survey paper we look at the development of some of the most popular of these techniques from a mathematical as well as data structure perspective, from Latent Semantic Analysis to Vector Space Models to their more modern variants which are typically referred to as word embeddings. In this review of algoriths such as Word2Vec, GloVe, ELMo and BERT, we explore the idea of semantic spaces more generally beyond applicability to NLP.

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.

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.

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.

Analysis method and algorithm design of biological sequence problem based on generalized k-mer vector

K-mer can be used for the description of biological sequences and k-mer distribution is a tool for solving sequences analysis problems in bioinformatics.We can use k-mer vector as a representation method of the k-mer distribution of the biological sequence.Problems,such as similarity calculations or sequence assembly,can be described in the k-mer vector space.It helps us to identify new features of an old sequence-based problem in bioinformatics and develop new algorithms using the concepts and methods from linear space theory.In this study,we defined the k-mer vector space for the generalized biological sequences.The meaning of corresponding vector operations is explained in the biological context.We presented the vector/matrix form of several widely seen sequence-based problems,including read quantification,sequence assembly,and pattern detection problem.Its advantages and disadvantages are discussed.Also,we implement a tool for the sequence assembly problem based on the concepts of k-mer vector methods.It shows the practicability and convenience of this algorithm design strategy.

COVERING PROPERTIES ON H-SPACES AND APPLICATIONS

Several theorems on closed (resp. open) covering properties of H-spaces are obtained which improve and generalize the corresponding results of Sperner, Klee, Alexandroff-Pasynkoff, Berge, Ghouila-Houri, Danzer-Grunbaum-Klee, Ky Fan, Shih-Tan, Horvath and Lassonde. As application an almost fixed point theorem for lower semi-continuous map in l.c.-spaces and a generalization of Tychonoffs fixed point theorem are proved in l.c.-spaces which improve those results of Ky Fan and Horvath.