Search results for "modular"
showing 10 items of 288 documents
Modulāra sistēmas dizaina ieviešana "white-label" mobilo lietotņu izstrādei
2022
“White-label” mobilo lietotņu izstrāde ir izstrādes stratēģija, kas sevī ietver bāzes koda izstrādi un bāzes pielāgošanu, izveidojot dažādas programmas dažādu klientu prasībām. Šādai stratēģijai palīdz pielāgojama sistēmas struktūra un modulāra dizaina ieviešana padara sistēmu pielāgojamāku. Darbā tiks apskatīti ieteikumi modulāra dizaina ieviešanai un analizēti attiecībā pret “white-label” lietotņu izstrādes pieredzi.
Team Description Mainz Rolling Brains 2001
2002
The Mainz Rolling Brains 2001 team is based on our last year’s team. Our modular design as described in [1] has proved to be efficient and flexible. Thus the team could easily be adopted to the soccerserver’s new features and some of the weak spots of our team could be eliminated.
Modeling and Simulation of Network-on-Chip Systems with DEVS and DEUS
2013
Networks on-chip (NoCs) provide enhanced performance, scalability, modularity, and design productivity as compared with previous communication architectures for VLSI systems on-chip (SoCs), such as buses and dedicated signal wires. Since the NoC design space is very large and high dimensional, evaluation methodologies rely heavily on analytical modeling and simulation. Unfortunately, there is no standard modeling framework. In this paper we illustrate how to design and evaluate NoCs by integrating the Discrete Event System Specification (DEVS) modeling framework and the simulation environment called DEUS. The advantage of such an approach is that both DEVS and DEUS support modularity—the fo…
From fuzzy metric spaces to modular metric spaces: a fixed point approach
2017
We propose an intuitive theorem which uses some concepts of auxiliary functions for establishing existence and uniqueness of the fixed point of a self-mapping. First we work in the setting of fuzzy metric spaces in the sense of George and Veeramani, then we deduce some consequences in modular metric spaces. Finally, a sample homotopy result is derived making use of the main theorem.
A note on the admissibility of modular function spaces
2017
Abstract In this paper we prove the admissibility of modular function spaces E ρ considered and defined by Kozlowski in [17] . As an application we get that any compact and continuous mapping T : E ρ → E ρ has a fixed point. Moreover, we prove that the same holds true for any retract of E ρ .
Efficient computation of the branching structure of an algebraic curve
2012
An efficient algorithm for computing the branching structure of a compact Riemann surface defined via an algebraic curve is presented. Generators of the fundamental group of the base of the ramified covering punctured at the discriminant points of the curve are constructed via a minimal spanning tree of the discriminant points. This leads to paths of minimal length between the points, which is important for a later stage where these paths are used as integration contours to compute periods of the surface. The branching structure of the surface is obtained by analytically continuing the roots of the equation defining the algebraic curve along the constructed generators of the fundamental gro…
Intersection subgroups of complex hyperplane arrangements
2000
Abstract Let A be a central arrangement of hyperplanes in C n , let M( A ) be the complement of A , and let L ( A ) be the intersection lattice of A . For X in L ( A ) we set A X ={H∈ A : H⫆X} , and A /X={H/X: H∈ A X } , and A X ={H∩X: H∈ A \ A X } . We exhibit natural embeddings of M( A X ) in M( A ) that give rise to monomorphisms from π 1 (M( A X )) to π 1 (M( A )) . We call the images of these monomorphisms intersection subgroups of type X and prove that they form a conjugacy class of subgroups of π 1 (M( A )) . Recall that X in L ( A ) is modular if X+Y is an element of L ( A ) for all Y in L ( A ) . We call X in L ( A ) supersolvable if there exists a chain 0⫅X 1 ⫅⋯⫅X d =X in L ( A ) …
Brauer characters and coprime action
2016
Abstract It is an open problem to show that under a coprime action, the number of invariant Brauer characters of a finite group is the number of the Brauer characters of the fixed point subgroup. We prove that this is true if the non-abelian simple groups satisfy a stronger condition.
A note on projective coordinate systems of modular lattices
1993
This note clarifies the combinatorial nature of projective coordinate systems of modular upper continuous lattices. It generalizes the classical relationship between 3-dimensional Desarguesian configurations and coordinate systems of projective 3-spaces.
Quantum computing thanks to Bianchi groups
2018
It has been shown that the concept of a magic state (in universal quantum computing: uqc) and that of a minimal informationally complete positive operator valued measure: MIC-POVMs (in quantum measurements) are in good agreement when such a magic state is selected in the set of non-stabilizer eigenstates of permutation gates with the Pauli group acting on it [1]. Further work observed that most found low-dimensional MICs may be built from subgroups of the modular group PS L(2, Z) [2] and that this can be understood from the picture of the trefoil knot and related 3-manifolds [3]. Here one concentrates on Bianchi groups PS L(2, O10) (with O10 the integer ring over the imaginary quadratic fie…