• All Solutions All Solutions Caret
    • Editage

      One platform for all researcher needs

    • Paperpal

      AI-powered academic writing assistant

    • R Discovery

      Your #1 AI companion for literature search

    • Mind the Graph

      AI tool for graphics, illustrations, and artwork

    • Journal finder

      AI-powered journal recommender

    Unlock unlimited use of all AI tools with the Editage Plus membership.

    Explore Editage Plus
  • Support All Solutions Support
    discovery@researcher.life
Discovery Logo
Sign In
Paper
Search Paper
Cancel
Pricing Sign In
  • My Feed iconMy Feed
  • Search Papers iconSearch Papers
  • Library iconLibrary
  • Explore iconExplore
  • Ask R Discovery iconAsk R Discovery Star Left icon
  • Chat PDF iconChat PDF Star Left icon
  • Chrome Extension iconChrome Extension
    External link
  • Use on ChatGPT iconUse on ChatGPT
    External link
  • iOS App iconiOS App
    External link
  • Android App iconAndroid App
    External link
  • Contact Us iconContact Us
    External link
Discovery Logo menuClose menu
  • My Feed iconMy Feed
  • Search Papers iconSearch Papers
  • Library iconLibrary
  • Explore iconExplore
  • Ask R Discovery iconAsk R Discovery Star Left icon
  • Chat PDF iconChat PDF Star Left icon
  • Chrome Extension iconChrome Extension
    External link
  • Use on ChatGPT iconUse on ChatGPT
    External link
  • iOS App iconiOS App
    External link
  • Android App iconAndroid App
    External link
  • Contact Us iconContact Us
    External link

Related Topics

  • Vector Space
  • Vector Space

Articles published on basis-of-vector-space

Authors
Select Authors
Journals
Select Journals
Duration
Select Duration
122 Search results
Sort by
Recency
  • Open Access Icon
  • Research Article
  • Cite Count Icon 70
  • 10.1109/12.869334
Tolerating multiple faults in multistage interconnection networks with minimal extra stages
  • Jan 1, 2000
  • IEEE Transactions on Computers
  • C.C Fan + 1 more

Adams and Siegel (1982) proposed an extra stage cube interconnection network that tolerates one switch failure with one extra stage. We extend their results and discover a class of extra stage interconnection networks that tolerate multiple switch failures with a minimal number of extra stages. Adopting the same fault model as Adams and Siegel, the faulty switches can be bypassed by a pair of demultiplexer/multiplexer combinations. It is easy to show that, to maintain point to point and broadcast connectivities, there must be at least S extra stages to tolerate I switch failures. We present the first known construction of an extra stage interconnection network that meets this lower-bound. This 12-dimensional multistage interconnection network has n+f stages and tolerates I switch failures. An n-bit label called mask is used for each stage that indicates the bit differences between the two inputs coming into a common switch. We designed the fault-tolerant construction such that it repeatedly uses the singleton basis of the n-dimensional vector space as the stage mask vectors. This construction is further generalized and we prove that an n-dimensional multistage interconnection network is optimally fault-tolerant if and only if the mask vectors of every n consecutive stages span the n-dimensional vector space.

  • Research Article
  • Cite Count Icon 5
  • 10.1007/bf02487904
The state space reconstruction technology of different kinds of chaotic data obtained from dynamical system
  • Feb 1, 1999
  • Acta Mechanica Sinica
  • Chen Yushu + 2 more

Certain deterministic nonlinear systems may show chaotic behavior. We consider the motion of qualitative information and the practicalities of extracting a part from chaotic experimental data. Our approach based on a theorem of Takens draws on the ideas from the generalized theory of information known as singular system analysis. We illustrate this technique by numerical data from the chaotic region of the chaotic experimental data. The method of the singular-value decomposition is used to calculate the eigenvalues of embedding space matrix. The corresponding concrete algorithm to calculate eigenvectors and to obtain the basis of embedding vector space is proposed in this paper. The projection on the orthogonal basis generated by eigenvectors of timeseries data and concrete paradigm are also provided here. Meanwhile the state space reconstruction technology of different kinds of chaotic data obtained from dynamical system has also been discussed in detail.

  • Research Article
  • 10.1007/bf02434915
Topological characteristics of free bases of topological groups and topological vector spaces
  • Oct 1, 1998
  • Journal of Mathematical Sciences
  • T V Burova

Mutual dimensional properties of basis-equivalent (b-equivalent) and weakly l-equivalent topological spaces are studied. It is shown that the b-equivalence does not preserve bicompactness; in particular, b-equivalent topological spaces can be non-l-equivalent. Bibliography: 18 titles.

  • Research Article
  • Cite Count Icon 13
  • 10.1016/0165-0114(95)00364-9
On local bases of fuzzy topological vector spaces
  • May 1, 1997
  • Fuzzy Sets and Systems
  • Fang Jin-Xuan

On local bases of fuzzy topological vector spaces

  • Research Article
  • Cite Count Icon 25
  • 10.1112/s0024610797004882
Quasi-Permutation Representations of p -Groups of Class 2
  • Apr 1, 1997
  • Journal of the London Mathematical Society
  • Houshang Behravesh

If G is a finite linear group of degree n, that is, a finite group of automorphisms of an n-dimensional complex vector space (or, equivalently, a finite group of non-singular matrices of order n with complex coefficients), we shall say that G is a quasi-permutation group if the trace of every element of G is a non-negative rational integer. The reason for this terminology is that, if G is a permutation group of degree n, its elements, considered as acting on the elements of a basis of an n-dimensional complex vector space V, induce automorphisms of V forming a group isomorphic to G. The trace of the automorphism corresponding to an element x of G is equal to the number of letters left fixed by x, and so is a non-negative integer. Thus, a permutation group of degree n has a representation as a quasi-permutation group of degree n. See [8].

  • Research Article
  • Cite Count Icon 8
  • 10.1093/imamci/13.1.1
Geometric properties, invariants, and the Toeplitz structure of minimal bases of rational vector spaces
  • Mar 1, 1996
  • IMA Journal of Mathematical Control and Information
  • N Karcanias

Geometric properties, invariants, and the Toeplitz structure of minimal bases of rational vector spaces

  • Open Access Icon
  • Research Article
  • Cite Count Icon 9
  • 10.1090/s0002-9939-96-03305-9
Bases for vector spaces over the two-element field and the axiom of choice
  • Jan 1, 1996
  • Proceedings of the American Mathematical Society
  • Kyriakos Keremedis

It is shown that the axiom of choice follows in a weaker form than the Zermelo - Fraenkel set theory from the assertion: every set of generators G of a vector space V over the two element field includes a basis L for V. It is also shown that: for every family A = { A i : i ∈ k } \mathcal {A}=\{A_i:i\in k\} of non empty sets there exists a family F = { F i : i ∈ k } \mathcal {F=}\{F_i:i\in k\} of odd sized sets such that, for every i ∈ k i\in k , F i ⊆ A F_i\subseteq A iff in every vector space B B over the two-element field every subspace V ⊆ B V\subseteq B has a complementary subspace S S iff every quotient group of an abelian group each of whose elements has order 2 has a set of representatives.

  • Research Article
  • Cite Count Icon 18
  • 10.1016/0165-0114(94)90350-6
On fuzzy bases of vector spaces
  • Apr 1, 1994
  • Fuzzy Sets and Systems
  • K.S Abdukhalikov + 2 more

On fuzzy bases of vector spaces

  • Research Article
  • Cite Count Icon 18
  • 10.1016/0020-0255(93)90085-z
Bases of fuzzy vector spaces
  • Jan 1, 1993
  • Information Sciences
  • John N Mordeson

Bases of fuzzy vector spaces

  • Research Article
  • Cite Count Icon 7
  • 10.1016/0012-365x(91)90467-g
Young tableaux and linear independence of standard monomials in multiminors of a multimatrix
  • Dec 1, 1991
  • Discrete Mathematics
  • Shreeram S Abhyankar + 1 more

Young tableaux and linear independence of standard monomials in multiminors of a multimatrix

  • Research Article
  • Cite Count Icon 4
  • 10.1016/0012-365x(91)90213-l
Generalized rodeletive correspondence between multitableaux and multimonomials
  • Nov 1, 1991
  • Discrete Mathematics
  • Shreeram S Abhyankar + 1 more

Generalized rodeletive correspondence between multitableaux and multimonomials

  • Research Article
  • Cite Count Icon 29
  • 10.1016/0097-3165(91)90045-i
Additive bases of vector spaces over prime fields
  • Jul 1, 1991
  • Journal of Combinatorial Theory, Series A
  • N Alon + 2 more

Additive bases of vector spaces over prime fields

  • Research Article
  • Cite Count Icon 3
  • 10.1016/0012-365x(91)90350-b
Generalized roinsertive correspondence between multitableaux and multimonomials
  • Jul 1, 1991
  • Discrete Mathematics
  • Shreeram S Abhyankar + 1 more

Generalized roinsertive correspondence between multitableaux and multimonomials

  • Open Access Icon
  • Research Article
  • Cite Count Icon 8
  • 10.1111/j.1365-246x.1991.tb00811.x
Density-gravity covariance functions produced by overlapping rectangular blocks of constant density
  • Jun 1, 1991
  • Geophysical Journal International
  • C C Tscherning

A set of N rectangular blocks of unit density form the basis of a linear vector space. This space will be a Hilbert space with reproducing kernel, when equipped with the L2 norm (and inner product). The kernel, K(P, Q), will be the product sum of the (maximally N) orthonormalized base functions evaluated at two points P, Q, in space. Multiplied by an appropriate scaling constant, this function will be a covariance function for a random density (anomaly) function. Using covariance propagation, auto- and cross-covariance functions for and with quantities related to the (anomalous) gravity field created by the random density function may be computed. When blocks of varying volume are used, the density variance will vary within the structure described by the blocks. For disjoint blocks, the variance is inversely proportional to the volume. The use of overlapping blocks generally creates correlations between density values in different blocks, a possibility which does not exist when using disjoint blocks. Computational examples are presented which show that it is possible to create realistic covariance models for the gravity anomaly, and that the cross-correlation between surface gravity and surface density may obtain values in the interval from 0.4 to 0.7. These values are more realistic than values obtained in earlier studies using quasi-harmonic density models.

  • Research Article
  • Cite Count Icon 11
  • 10.1016/0021-9045(91)90113-o
Module and vector space bases for spline spaces
  • Apr 1, 1991
  • Journal of Approximation Theory
  • Ruth Haas

Module and vector space bases for spline spaces

  • Research Article
  • Cite Count Icon 73
  • 10.1016/0165-0114(90)90206-l
Fuzzy vector spaces
  • Dec 1, 1990
  • Fuzzy Sets and Systems
  • P Lubczonok

Fuzzy vector spaces

  • Open Access Icon
  • Research Article
  • Cite Count Icon 5
  • 10.1016/0196-8858(89)90019-5
Biorthonormal systems, partial fractions, and Hermite interpolation
  • Sep 1, 1989
  • Advances in Applied Mathematics
  • Luis Verde-Star

Biorthonormal systems, partial fractions, and Hermite interpolation

  • Research Article
  • 10.1007/bf01261978
On weak and Schauder ?-bases in topological vector spaces
  • Dec 1, 1988
  • Archiv der Mathematik
  • I Gim�Nez + 1 more

On weak and Schauder ?-bases in topological vector spaces

  • Research Article
  • Cite Count Icon 23
  • 10.1137/0326011
Disturbance Decoupling Problems by Measurement Feedback: A Characterization of All Solutions and Fixed Modes
  • Jan 1, 1988
  • SIAM Journal on Control and Optimization
  • Vasfi Eldem + 1 more

This paper presents a new approach to disturbance decoupling problems by measurement feedback (DDPM). The novelty in this approach is that it yields a characterization of the sets of all solutions to DDPM and DDPM with internal stability and that the set of fixed modes of DDPM with respect to dynamic output feedback is easily identified. The central object used in deriving these results is a minimal polynomial basis of a rational vector space which conveniently represents the problem data.

  • Research Article
  • Cite Count Icon 6
  • 10.1016/s1474-6670(17)55949-2
Discrete-time Adaptive Control for Periodically Time-varying Systems
  • Jul 1, 1987
  • IFAC Proceedings Volumes
  • Li Zheng

Discrete-time Adaptive Control for Periodically Time-varying Systems

  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • .
  • 1
  • 2
  • 3
  • 4
  • 5

Popular topics

  • Latest Artificial Intelligence papers
  • Latest Nursing papers
  • Latest Psychology Research papers
  • Latest Sociology Research papers
  • Latest Business Research papers
  • Latest Marketing Research papers
  • Latest Social Research papers
  • Latest Education Research papers
  • Latest Accounting Research papers
  • Latest Mental Health papers
  • Latest Economics papers
  • Latest Education Research papers
  • Latest Climate Change Research papers
  • Latest Mathematics Research papers

Most cited papers

  • Most cited Artificial Intelligence papers
  • Most cited Nursing papers
  • Most cited Psychology Research papers
  • Most cited Sociology Research papers
  • Most cited Business Research papers
  • Most cited Marketing Research papers
  • Most cited Social Research papers
  • Most cited Education Research papers
  • Most cited Accounting Research papers
  • Most cited Mental Health papers
  • Most cited Economics papers
  • Most cited Education Research papers
  • Most cited Climate Change Research papers
  • Most cited Mathematics Research papers

Latest papers from journals

  • Scientific Reports latest papers
  • PLOS ONE latest papers
  • Journal of Clinical Oncology latest papers
  • Nature Communications latest papers
  • BMC Geriatrics latest papers
  • Science of The Total Environment latest papers
  • Medical Physics latest papers
  • Cureus latest papers
  • Cancer Research latest papers
  • Chemosphere latest papers
  • International Journal of Advanced Research in Science latest papers
  • Communication and Technology latest papers

Latest papers from institutions

  • Latest research from French National Centre for Scientific Research
  • Latest research from Chinese Academy of Sciences
  • Latest research from Harvard University
  • Latest research from University of Toronto
  • Latest research from University of Michigan
  • Latest research from University College London
  • Latest research from Stanford University
  • Latest research from The University of Tokyo
  • Latest research from Johns Hopkins University
  • Latest research from University of Washington
  • Latest research from University of Oxford
  • Latest research from University of Cambridge

Popular Collections

  • Research on Reduced Inequalities
  • Research on No Poverty
  • Research on Gender Equality
  • Research on Peace Justice & Strong Institutions
  • Research on Affordable & Clean Energy
  • Research on Quality Education
  • Research on Clean Water & Sanitation
  • Research on COVID-19
  • Research on Monkeypox
  • Research on Medical Specialties
  • Research on Climate Justice
Discovery logo
FacebookTwitterLinkedinInstagram

Download the FREE App

  • Play store Link
  • App store Link
  • Scan QR code to download FREE App

    Scan to download FREE App

  • Google PlayApp Store
FacebookTwitterTwitterInstagram
  • Universities & Institutions
  • Publishers
  • R Discovery PrimeNew
  • Ask R Discovery
  • Blog
  • Accessibility
  • Topics
  • Journals
  • Open Access Papers
  • Year-wise Publications
  • Recently published papers
  • Pre prints
  • Questions
  • FAQs
  • Contact us
Lead the way for us

Your insights are needed to transform us into a better research content provider for researchers.

Share your feedback here.

FacebookTwitterLinkedinInstagram
Cactus Communications logo

Copyright 2025 Cactus Communications. All rights reserved.

Privacy PolicyCookies PolicyTerms of UseCareers