108,666 research outputs found

    Eigen, G.

    No full text

    Channel Prediction Aided Coded Modulation Assisted Eigen-Beamforming

    No full text
    Eigen-beamforming is capable of providing attractive performance gains in the context of Multiple-Input Multiple-Output (MIMO) systems, provided that accurate Channel State Information (CSI) is available. However, when a realistic pilot-based channel predictor is used for acquiring the CSI, a significant performance degradation may be imposed by the phase-ambiguity inherent in the estimated eigen-vectors. In this contribution, both sophisticated Coded Modulation (CM) schemes and differentially encoded CM schemes are employed for assisting the operation of the eigen-beamformer, when employing a minimum mean square error based pilot-assisted channel predictor. It is shown that differentially encoded CM schemes are capable of assisting the eigen-beamformer in attaining a coding gain of about 6.5 dBs, when communicating over correlated Rayleigh fading channels

    Heuristic Analysis of Time Series Internal Structure

    No full text
    A method of analysis of Time Series Internal Structures based on Singular Spectrum Analysis is discussed. It has been shown that in the case when the Time Series contains deterministic additive components rank of the trajectory matrices equal to number of parameters of the components. Also it was proved that both eigen and factor vectors repeat shapes of the additive components and both eigen values and eigen vectors can be divided into additive groups. Some useful patterns of deterministic components were identified, which permit to provide graphical analysis of times series Internal Structures.Singular spectrum Analysis, Time series decomposition, Singular vectors, singular values, deterministic additive components, patterns

    Analisis Keberhinggaan Matriks Representasi atas Grup Berhingga

    No full text
    Representation of a finite group G over generator linear non singular mxm matrix with entries of field K defined by group homomorphismA : G → GLm(K)Basically, the non singular mxm matrix A(x) which representing the finite group G divided into two, that are the unitary matrix and non unitary matrix . If A(x) is a non unitary matrix, then there exist a unitary matrix which similar to A(x). This research deals to analyze the numbers of one example of a unitary matrix representation over arbitrary finite group G with order n that is permutation matrix, and the number of unitary matrix which is similar to real non unitary matrix representation of arbitrary finite group G order 2. The results showed the numbers of permutation matrix representation is n! and unitary matrix which is similar to non unitary matrix representation is 2

    Algebraic Structures and Combinatorial Properties of Unit Graphs in Rings of Integer Modulo with Specific Orders

    No full text
    Unit graph is the intersection of graph theory and algebraic structure, which can be seen from the unit graph representing the ring modulo n in graph form. Let R be a ring with nonzero identity. The unit graph of R, denoted by G(R), has its set of vertices equal to the set of all elements of R; distinct vertices x and y are adjacent if and only if x + y is a unit of R. In this study, the unit graph, which is in the ring of integers modulo n, denoted by G(Zn). It turns out when n is 2^k, G(Zn) forms a complete bipartite graph for k∈N, whereas when n is prime, G(Zn) forms a complete (n+1)/2-partites graph. Additionally, the numerical invariants of the graph G(Zn), such as degree, chromatic number, clique number, radius, diameter, domination number, and independence number complement the characteristics of G(Zn) for further research

    The Intersection Graph of a Dihedral Group

    No full text
    The intersection graph of a finite group G is a graph (V,E) where V is a set of all non-trivial subgroups of G and E is a set of edges where two distinct subgroups H_i , H_j  are said to be adjacent if and only if H_i \cap H_j \neq {e} . This study discusses the intersection graph of a dihedral group D_{2n} specifically the subgraph, degree of vertices, radius, diameter, girth, and domination number. From this study, we obtained that if n=p^2 then the intersection graph of D_{2n} is containing complete subgraph K_{p+2} and \gamma(\Gamma_{D_{2n}})=p.

    Analisis Automorfisma Graf Pembagi-nol dari Ring Komutatif dengan Elemen Satuan

    No full text
    Zero-divisor graphs of a commutative ring with identity has 3 specific simple forms, namely star zero-divisor graph, complete zero-divisor graph and complete bipartite zero-divisor graph. Graph automorphism is one of the interesting concepts in graph theory. Automorphism of  graph G is an isomorphism from graph G to itself. In other words, an automorphism of a graph G is a permutation φ of  the set points V(G) which has the property that (x,y) in E(G)  if and only if (φ(x),φ(y)) in E(G), i.e. φ preserves adjacency.This study aims to analyze the form of zero-divisor graph automorphisms of a commutative ring with identity formed. The method used in this study was taking sampel of each zero-divisor graph to represent each graph. Thus, pattern and shape of automorphism of each graph can be determined. Based on the results of this study, a star zero-divisor graph with pattern K_1,(p-1), where p is prime, has (p-1)! automorphisms, a complete zero-divisor graph with pattern K_(p-1), where p is prime, has (p-1)!  automorphisms, and a complete bipartite zero-divisor graph with pattern K_(p-1),(q-1), where p is prime, has (p-1)!(q-1)! automorphisms, when p not equals to q  and 2((p-1)!(q-1)!) automorphisms  when p=q

    Verzilveren van overwaarde, om te voorzien in de eigen zorgbehoefte

    No full text
    Zorgkosten zullen volgens het nieuwe overheidsbeleid steeds vaker door ouderen zelf betaalt moeten gaan worden. Het eigen vermogen van ouderen zal in de toekomst dus steeds vaker aangesproken worden om in hun zorgbehoefte te kunnen voorzien. Maar woning-eigenaren hebben vaak een (groot) deel van hun vermogen opgeslagen in hun woning. Voor huishoudens met een laag inkomen en een laag eigen vermogen kan het benutten van de overwaarde uit de woning dienen om de zorgkosten te kunnen financieren. Zeker voor deze groep is het van belang dat de markt voor verzilveringsproducten op gang kom. Maar ook voor andere woning-eigenaren kan het vrij maken van de overwaarde uit de woning zeer gewenst zijn. De kosten voor woningaanpassingen en zorg aan huis kunnen namelijk hoog oplopen. Bestaande verzilveringsproducten zijn tot nu toe nog weinig succesvol geweest in Nederland, investeerders en consumenten ondervinden vaak nog te veel belemmeringen bij de bestaande verzilveringsproducten. Om te zorgen dat nieuwe verzilveringsproducten voldoen aan de voorwaarden van de consument zijn deze voorwaarden in kaart gebracht in dit rapport. De resultaten kunnen gebruikt worden om producten te ontwikkelen die beter aansluiten op de voorwaarden en wensen van de consument, wanneer de vraag naar verzilveringsproducten zal toenemen. Hiervoor zijn concrete aanbevelingen gedaan voor de belanghebbende partijen.Housing Policy, Management & SustainabilityManagement in the Built EnvironmentArchitecture and The Built Environmen

    KARAKTERISTIK NILAI EIGEN DARI MATRIKS LAPLACIAN

    No full text
    Matriks Laplacian dari suatu graf G adalah matriks diagonal dikurangi dengan matriks ketetanggaan. Paper ini membahas karakteristik nilai eigen dari matriks Laplacian dan hubungan nilai eigen matriks Laplacian dengan nilai eigen matriks ketetanggaan dari graf reguler
    corecore