Relevant bibliographies by topics / Network Lattice

Academic literature on the topic 'Network Lattice'

Author: Grafiati
Published: 9 March 2023
Last updated: 10 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Network Lattice.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Network Lattice"

1

KAMEI, HIROKO. "CONSTRUCTION OF LATTICES OF BALANCED EQUIVALENCE RELATIONS FOR REGULAR HOMOGENEOUS NETWORKS USING LATTICE GENERATORS AND LATTICE INDICES." International Journal of Bifurcation and Chaos 19, no. 11 (November 2009): 3691–705. http://dx.doi.org/10.1142/s0218127409025067.

Full text
Abstract:
Regular homogeneous networks are a class of coupled cell network, which comprises one type of cell (node) with one type of coupling (arrow), and each cell has the same number of input arrows (called the valency of the network). In coupled cell networks, robust synchrony (a flow-invariant polydiagonal) corresponds to a special kind of partition of cells, called a balanced equivalence relation. Balanced equivalence relations are determined solely by the network structure. It is well known that the set of balanced equivalence relations on a given finite network forms a complete lattice. In this paper, we consider regular homogeneous networks in which the internal dynamics of each cell is one-dimensional, and whose associated adjacency matrices have simple eigenvalues (real or complex). We construct explicit forms of lattices of balanced equivalence relations for such networks by introducing key building blocks, called lattice generators, along with integer numbers called lattice indices. The properties of lattice indices allow construction of all possible lattice structures for balanced equivalence relations of regular homogeneous networks of any number of cells with any valency. As an illustration, we show all 14 possible lattice structures of balanced equivalence relations for four-cell regular homogeneous networks.
APA, Harvard, Vancouver, ISO, and other styles
2

KENDZIORRA, ANDREAS, and STEFAN E. SCHMIDT. "NETWORK CODING WITH MODULAR LATTICES." Journal of Algebra and Its Applications 10, no. 06 (December 2011): 1319–42. http://dx.doi.org/10.1142/s0219498811005208.

Full text
Abstract:
Kötter and Kschischang presented in 2008 a new model for error correcting codes in network coding. The alphabet in this model is the subspace lattice of a given vector space, a code is a subset of this lattice and the used metric on this alphabet is the map d : (U, V) ↦ dim (U+V)- dim (U∩V). In this paper we generalize this model to arbitrary modular lattices, i.e. we consider codes, which are subsets of modular lattices. The used metric in this general case is the map d : (u, v) ↦ h(u ∨ v) - h(u ∧ v), where h is the height function of the lattice. We apply this model to submodule lattices. Moreover, we show a method to compute the size of spheres in certain modular lattices and present a sphere packing bound, a sphere covering bound, and a Singleton bound for codes, which are subsets of modular lattices.
APA, Harvard, Vancouver, ISO, and other styles
3

Joewondo, Nerine, Valeria Garbin, and Ronny Pini. "Nonuniform Collective Dissolution of Bubbles in Regular Pore Networks." Transport in Porous Media 141, no. 3 (January 12, 2022): 649–66. http://dx.doi.org/10.1007/s11242-021-01740-w.

Full text
Abstract:
AbstractUnderstanding the evolution of solute concentration gradients underpins the prediction of porous media processes limited by mass transfer. Here, we present the development of a mathematical model that describes the dissolution of spherical bubbles in two-dimensional regular pore networks. The model is solved numerically for lattices with up to 169 bubbles by evaluating the role of pore network connectivity, vacant lattice sites and the initial bubble size distribution. In dense lattices, diffusive shielding prolongs the average dissolution time of the lattice, and the strength of the phenomenon depends on the network connectivity. The extension of the final dissolution time relative to the unbounded (bulk) case follows the power-law function, $${B^k/\ell }$$ B k / ℓ , where the constant $$\ell$$ ℓ is the inter-bubble spacing, B is the number of bubbles, and the exponent k depends on the network connectivity. The solute concentration field is both the consequence and a factor affecting bubble dissolution or growth. The geometry of the pore network perturbs the inward propagation of the dissolution front and can generate vacant sites within the bubble lattice. This effect is enhanced by increasing the lattice size and decreasing the network connectivity, yielding strongly nonuniform solute concentration fields. Sparse bubble lattices experience decreased collective effects, but they feature a more complex evolution, because the solute concentration field is nonuniform from the outset.
APA, Harvard, Vancouver, ISO, and other styles
4

Ostoja-Starzewski, Martin. "Lattice models in micromechanics." Applied Mechanics Reviews 55, no. 1 (January 1, 2002): 35–60. http://dx.doi.org/10.1115/1.1432990.

Full text
Abstract:
This review presents the potential that lattice (or spring network) models hold for micromechanics applications. The models have their origin in the atomistic representations of matter on one hand, and in the truss-type systems in engineering on the other. The paper evolves by first giving a rather detailed presentation of one-dimensional and planar lattice models for classical continua. This is followed by a section on applications in mechanics of composites and key computational aspects. We then return to planar lattice models made of beams, which are a discrete counterpart of non-classical continua. The final two sections of the paper are devoted to issues of connectivity and rigidity of networks, and lattices of disordered (rather than periodic) topology. Spring network models offer an attractive alternative to finite element analyses of planar systems ranging from metals, composites, ceramics and polymers to functionally graded and granular materials, whereby a fiber network model of paper is treated in considerable detail. This review article contains 81 references.
APA, Harvard, Vancouver, ISO, and other styles
5

Favoni, Matteo, Andreas Ipp, and David I. Müller. "Applications of Lattice Gauge Equivariant Neural Networks." EPJ Web of Conferences 274 (2022): 09001. http://dx.doi.org/10.1051/epjconf/202227409001.

Full text
Abstract:
The introduction of relevant physical information into neural network architectures has become a widely used and successful strategy for improving their performance. In lattice gauge theories, such information can be identified with gauge symmetries, which are incorporated into the network layers of our recently proposed Lattice Gauge Equivariant Convolutional Neural Networks (L-CNNs). L-CNNs can generalize better to differently sized lattices than traditional neural networks and are by construction equivariant under lattice gauge transformations. In these proceedings, we present our progress on possible applications of L-CNNs to Wilson flow or continuous normalizing flow. Our methods are based on neural ordinary differential equations which allow us to modify link configurations in a gauge equivariant manner. For simplicity, we focus on simple toy models to test these ideas in practice.
APA, Harvard, Vancouver, ISO, and other styles
6

KAMEI, HIROKO. "THE EXISTENCE AND CLASSIFICATION OF SYNCHRONY-BREAKING BIFURCATIONS IN REGULAR HOMOGENEOUS NETWORKS USING LATTICE STRUCTURES." International Journal of Bifurcation and Chaos 19, no. 11 (November 2009): 3707–32. http://dx.doi.org/10.1142/s0218127409025079.

Full text
Abstract:
For regular homogeneous networks with simple eigenvalues (real or complex), all possible explicit forms of lattices of balanced equivalence relations can be constructed by introducing lattice generators and lattice indices [Kamei, 2009]. Balanced equivalence relations in the lattice correspond to clusters of partially synchronized cells in a network. In this paper, we restrict attention to regular homogeneous networks with simple real eigenvalues, and one-dimensional internal dynamics for each cell. We first show that lattice elements with nonzero indices indicate the existence of codimension-one synchrony-breaking steady-state bifurcations, and furthermore, the positions of such lattice elements give the number of partially synchronized clusters. Using four-cell regular homogeneous networks as an example, we then classify a large number of regular homogeneous networks into a small number of lattice structures, in which networks share an equivalent clustering type. Indeed, some of these networks even share the same generic bifurcation structure. This classification leads us to explore how regular homogeneous networks that share synchrony-breaking bifurcation structure are topologically related.
APA, Harvard, Vancouver, ISO, and other styles
7

Stewart, Ian. "Exotic Patterns of Synchrony in Planar Lattice Networks." International Journal of Bifurcation and Chaos 29, no. 02 (February 2019): 1930003. http://dx.doi.org/10.1142/s0218127419300039.

Full text
Abstract:
Patterns of dynamical synchrony that can occur robustly in networks of coupled dynamical systems are associated with balanced colorings of the nodes of the network. In symmetric networks, the orbits of any group of symmetries automatically determine a balanced orbit coloring. Balanced colorings not of this kind are said to be exotic. Exotic colorings occur in infinite planar lattices, both square and hexagonal, with various short-range couplings. In some cases, a balanced two-coloring remains balanced when colors are swapped along suitable diagonals, giving rise to uncountably many distinct exotic colorings. We explain this phenomenon in terms of iterated orbit colorings, in which the quotient of the lattice by an orbit coloring has extra symmetries, allowing new orbit colorings on the quotient, which then lift back to the lattice. We apply the same construction to several other exotic lattice colorings. Two appendices discuss how to modify the notion of balance for networks with diffusive coupling, and how to formalize the differential equations in infinitely many variables that arise for lattices.
APA, Harvard, Vancouver, ISO, and other styles
8

Akιn, H. "Phase diagrams of lattice models on Cayley tree and chandelier network: a review." Condensed Matter Physics 25, no. 3 (2022): 32501. http://dx.doi.org/10.5488/cmp.25.32501.

Full text
Abstract:
The main purpose of this review paper is to give systematically all the known results on phase diagrams corresponding to lattice models (Ising and Potts) on Cayley tree (or Bethe lattice) and chandelier networks. A detailed survey of various modelling applications of lattice models is reported. By using Vannimenus's approach, the recursive equations of Ising and Potts models associated to a given Hamiltonian on the Cayley tree are presented and analyzed. The corresponding phase diagrams with programming codes in different programming languages are plotted. To detect the phase transitions in the modulated phase, we investigate in detail the actual variation of the wave-vector q with temperature and the Lyapunov exponent associated with the trajectory of our current recursive system. We determine the transition between commensurate (C) and incommensurate (I) phases by means of the Lyapunov exponents, wave-vector, and strange attractor for a comprehensive comparison. We survey the dynamical behavior of the Ising model on the chandelier network. We examine the phase diagrams of the Ising model corresponding to a given Hamiltonian on a new type of "Cayley-tree-like lattice", such as triangular, rectangular, pentagonal chandelier networks (lattices). Moreover, several open problems are discussed.
APA, Harvard, Vancouver, ISO, and other styles
9

Dias, Ana Paula S., and Eliana Manuel Pinho. "Enumerating periodic patterns of synchrony via finite bidirectional networks." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 466, no. 2115 (November 16, 2009): 891–910. http://dx.doi.org/10.1098/rspa.2009.0404.

Full text
Abstract:
Periodic patterns of synchrony are lattice networks whose cells are coloured according to a local rule, or balanced colouring, and such that the overall system has spatial periodicity. These patterns depict the finite-dimensional flow-invariant subspaces for all the lattice dynamical systems, in the given lattice network, that exhibit those periods. Previous results relate the existence of periodic patterns of synchrony, in n -dimensional Euclidean lattice networks with nearest neighbour coupling architecture, with that of finite coupled cell networks that follow the same colouring rule and have all the couplings bidirectional. This paper addresses the relation between periodic patterns of synchrony and finite bidirectional coloured networks. Given an n -dimensional Euclidean lattice network with nearest neighbour coupling architecture, and a colouring rule with k colours, we enumerate all the periodic patterns of synchrony generated by a given finite network, or graph. This enumeration is constructive and based on the automorphisms group of the graph.
APA, Harvard, Vancouver, ISO, and other styles
10

Bang, Wonbae, M. T. Kaffash, M. T. Hossain, A. Hoffmann, J. B. Ketterson, and M. B. Jungfleisch. "Spin dynamics in permalloy nano-ellipses for honeycomb and square lattices." AIP Advances 12, no. 3 (March 1, 2022): 035131. http://dx.doi.org/10.1063/9.0000307.

Full text
Abstract:
We report experimental and theoretical studies of spin dynamics in lattice structures of permalloy (Ni80Fe20) nano-ellipses, with four different types of networks including honeycomb and square lattices. The lattices are patterned at the center line of the co-planar wave guide and consist of non-contacting or contacting ellipses. Micromagnetic simulations show excellent agreement with the broadband ferromagnetic resonance (FMR) experimental results. We find the existence of a spin-wave mode localized in the vertex region of the contacting nano-ellipse network. Our finding has important implications when designing an artificial spin ice (ASI) network for functional magnonics.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Network Lattice"

1

Liu, William. "Physical layer network coding using lattice codes." Thesis, Imperial College London, 2016. http://hdl.handle.net/10044/1/49432.

Full text
Abstract:
In this thesis, using lattice codes and channel codes, we propose several solutions to improve the performance of physical-layer network coding (PNC) schemes over the two-way relay network as well as the multi-way relay network. In the first part of our work, we propose an efficient equation-coefficient search algorithm for compute-and-forward over complex-valued channels, which guarantees to find the optimal coefficients over the ring of Gaussian integers as well as the ring of Eisenstein integers. We also propose an optimal coefficient search algorithm for the Integer-Forcing compute-and-forward receiver, when multiple receive antennas are available at the relay. The proposed algorithms are shown to have low polynomial complexity in transmitting user number and we use numerical results to verify the performance of our algorithms against other competitive search algorithms in literature. In the second part of our work we investigate the performance of popular PNC schemes for the two-way relay network and derive their end-to-end achievable rates with channel inversion precoding over the Rayleigh fading channel. We also propose a power efficient precoding scheme based on compute-and forward-to improve the network throughput. In the third part of our work, after introducing the novel concept of compatibility between channel code and lattice code, we propose several low complexity joint channel coded network coding (JCCNC) schemes for PAM and QAM two-way relay networks. Firstly, using LDPC codes, we propose the lattice-decoded JCCNC (LD-JCCNC) scheme. Secondly, we propose two JCCNC schemes using low density construction A (LDA) lattices and polar lattices, which we call LDA-JCCNC and PLA-JCCNC respectively. In both JCCNC schemes, channel coding and network coding operations are integrated through the use of lattice decoding at the relay, where the arithmetic addition of lattice codewords is directly decoded using their corresponding lattice decoding algorithm. In contrast with most existing JCCNC schemes which are restricted to set types of modulation schemes, we also give clear methodology on how our JCCNC schemes can be applied to general types of higher order PAM and QAM modulation schemes. In the final part of our work, we extend our novel JCCNC schemes to the general multi-way relay network for the compute-and-forward scheme, and show how they can be used with general types of PAM and QAM modulation systems. Detailed simulation analysis are carried out to evaluate and compare the performance of all proposed JCCNC schemes in relation to existing schemes in literature.
APA, Harvard, Vancouver, ISO, and other styles
2

Huang, Qinhui. "Lattice network coding in distributed massive MIMO systems." Thesis, University of York, 2017. http://etheses.whiterose.ac.uk/18826/.

Full text
Abstract:
In this thesis, the uplink of distributed massive MIMO where a large number of distributed access point antennas simultaneously serve a relatively smaller number of users is considered. Lattice network coding (LNC), which comprises compute and forward (C&F) and integer forcing (IF), is employed to avoid the potentially enormous backhaul load. Firstly, novel algorithms for coefficient selection in C&F are proposed. For the first time, we propose a low polynomial complexity algorithm to find the optimal solution for the complex valued case. Then we propose a sub-optimal simple linear search algorithm which is conceptually sub-optimal, however numerical results show that the performance degradation is negligible compared to the exhaustive method. The complexity of both algorithms are investigated both theoretically and numerically. The results show that our proposed algorithms achieve better performance-complexity trade-offs compared to the existing algorithms. Both algorithms are suitable for lattices over a wide range of algebraic integer domains. Secondly, the performance of LNC in a realistic distributed massive MIMO model (including fading, pathloss and correlated shadowing) is investigated in this thesis. By utilising the characteristic of pathloss, a low complexity coefficient selection algorithm for LNC is proposed. A greedy algorithm for selecting the global coefficient matrix is proposed. Comprehensive comparisons between LNC and some other promising linear strategies for massive MIMO, such as small cells (SC), maximum ratio combining (MRC), and minimum mean square error (MMSE) are also provided. Numerical results reveal that LNC not only reduces the backhaul load, but also provides uniformly good service to all users in a wide range of applications. Thirdly, the inevitable loss of information due to the quantisation and modulo operation under different backhaul constraints are investigated. An extended C\&F with flexible cardinalities is proposed to adapt to the different backhaul constraints. Numerical results show that by slightly increasing the cardinality, the gap between C\&F to the infinite backhaul case can be significantly reduced.
APA, Harvard, Vancouver, ISO, and other styles
3

Milsted, Ashley [Verfasser]. "Tensor network methods for quantum lattice systems / Ashley Milsted." Hannover : Technische Informationsbibliothek (TIB), 2016. http://d-nb.info/1097229254/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wiklund, Hanna. "Lattice Boltzmann simulations of two-phased flow in fibre network systems." Doctoral thesis, Mittuniversitetet, Institutionen för tillämpad naturvetenskap och design, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-16475.

Full text
Abstract:
Two-phase flow in microfluidic systems is of great interest for many scientificand engineering problems. Especially in the pulp and paper area, the problems spanfrom fibre-fibre interactions in the consolidation process of papermaking to edgewickingin paper board during the aseptic treatment of liquid packaging.The objective of this thesis is to gain a fundamental understanding of the microfluidicmechanisms that play a significant role in various problems of two-phaseflow in fibre networks. To achieve this objective a new method for the treatment ofwetting boundary conditions in the lattice Boltzmann model has been developed.The model was validated and compared with the previous treatments of wettingboundary conditions, by using two test cases: droplet spreading and capillary intrusion.The new wetting boundary condition was shown to give more accurate resultsfor a wider range of contact angles than previous methods, and capillary intrusioncould be simulated with higher accuracy even at a relatively low resolution.As an application of the developed method, two examples of two-phase flowproblems in fibre networks are taken: the shear resistance of liquid bridges, as relatedto the wet web strength, and liquid penetration into porous structures, as related toedge-wicking in paper board. The shear resistance force was shown to depend verylittle on surface tension and contact angle. Instead, the shear resistance is a dynamicforce and a major contributing factor is the distortion of the flow field caused bythe presence of interfaces. This distortion of the flow field is size-dependent: thesmaller the bridge, the larger the proportion of the distorted flow field and thus alarger shear resistance force per unit width. In other words, multiple small bridgeshave an enhancement effect on shear resistance. The results from the simulations ofliquid penetration into porous structures showed that the discontinuities in the solidsurfacecurvature, as are present in the formof corners on the capillary surfaces, havestrong influences on liquid penetration through their pinning effects and also theirinteractions with local geometry. The microtopography can therefore, accelerate,decelerate and, in some cases, even stop the liquid penetration into random porousmedia.
APA, Harvard, Vancouver, ISO, and other styles
5

Mori, Yuto. "Path optimization with neural network for sign problem in quantum field theories." Doctoral thesis, Kyoto University, 2021. http://hdl.handle.net/2433/263466.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

GILARDI, ANDREA. "Statistical Models and Data Structures for Spatial Data on Road Networks." Doctoral thesis, Università degli Studi di Milano-Bicocca, 2021. http://hdl.handle.net/10281/314016.

Full text
Abstract:
Negli ultimi anni è nato un interesse sempre crescente verso l’analisi statistica di dati spaziali aventi supporto di network. Gli esempi più classici di questa tipologia di eventi sono, ad esempio, gli incidenti stradali, i furti di auto, i crimini, e gli interventi delle ambulanze, mentre le linee che compongono la network rappresentano tipicamente le strade, i fiumi, i binari della ferrovia, oppure le terminazioni nervose. L’analisi di questi fenomeni è interessante sotto diversi punti di vista. Innanzitutto, i modelli statistici presentano diverse problematiche legate al supporto spaziale. Per questo motivo, negli ultimi anni sono stati pubblicati diversi paper che mostrano le difficoltà principali legate alla natura stessa della network. Inoltre, il recente sviluppo di database spaziali open source (quali Open Street Map) ha permesso il download e la creazione di dataset che coprono le reti stradali di quasi tutto il mondo. L’enorme mole di dati e gli (inevitabili) errori geometrici presenti nei database di Open Street Map rappresentano due problematiche ulteriori. Infine, dato che al momento la maggior parte dei pacchetti R per l’analisi di dati su network sono ancora in fase di sviluppo, esistono anche diverse difficoltà computazionali e problemi nell’implementazione di metodologie nuove. Questo lavoro di tesi riassume quattro articoli che presentano strutture dati e metodologie statistiche per l’analisi di dati spaziali aventi supporto di network, considerando sia un approccio di tipo network-lattice che un approccio di tipo point-pattern. Il primo paper presenta una revisione bibliografica dei pacchetti R che implementano classi e funzioni per l’analisi di network stradali, concentrandosi in particolare su stplanr e dodgr. Vengono introdotte le principali routines legate al calcolo di shortest paths e centrality measures utilizzando dataset via via più complessi. Il secondo lavoro presenta un modello di Poisson Dinamico Zero Inflated per la stima di due indici di rischiosità relativi agli incidenti stradali avvenuti nel network di Milano dal 2015 al 2017. L’unità statistica elementare è rappresentata dal singolo segmento di strada, mentre la variabile risposta misura il numero di incidenti avvenuti in ognuno dei tre anni. Viene impiegato un insieme di covariate demografiche e strutturali estratte da Open Street Map e dai dati del censimento italiano avvenuto nel 2011. Il terzo paper introduce un modello Bayesiano gerarchico multivariato per la stima della rischiosità stradale tramite un approccio di tipo network-lattice. Ci si è concentrati sul network stradale della città di Leeds e su due diverse tipologie di incidenti. La componente spaziale è stata modellata tramite un errore casuale di tipo Multivariate CAR, mentre le correlazioni residue sono state catturate tramite un errore casuale non strutturato. Infine, si è anche sviluppata una metodologia nuova per l’analisi di MAUP su dati di tipo network-lattice. Per concludere, il quarto articolo presenta un insieme di risultati preliminari relativi all’analisi spazio-temporale di point pattern su network tramite processi di Poisson non-omogenei. In particolare, si è analizzata la distribuzione degli interventi delle ambulanze nel comune di Milano tra il 2015 ed il 2017, sviluppando un modello a fattori latenti per la componente temporale ed uno stimatore kernel non-parametrico per l’intensità spaziale, riadattato nel caso di dati su reticolo. La tesi si compone anche di tre appendici. Le prima riassume le caratteristiche di base del software e della metodologia INLA, la seconda presenta i materiali addizionali legati al quarto capitolo, mentre la terza appendice introduce un pacchetto R chiamato osmextract, utilizzato per manipolare dati da Open Street Map. Il quinto capitolo conclude la tesi, riassumendo i risultati principali e introducendo alcuni sviluppi futuri.
In the last years, we observed a surge of interest in the statistical analysis of spatial data lying on or alongside networks. Car crashes, vehicle thefts, bicycle incidents, roadside kiosks, neuroanatomical features, and ambulance interventions are just a few of the most typical examples, whereas the edges of the network represent an abstraction of roads, rivers, railways, cargo-ship routes or nerve fibers. This type of data is interesting for several reasons. First, the statistical analysis of the events presents several challenges because of the complex and non-homogeneous nature of the network, which creates unique methodological problems. Several authors discussed and illustrated the common pitfalls of re-adapting classical planar spatial models to network data. Second, the rapid development of open-source spatial databases (such as Open Street Map) provides the starting point for creating road networks at a wide range of spatial scales. The size and volume of the data raise complex computational problems, while common geometrical errors in the network’s software representations create another source of complexity. Third, at the time of writing, the most important software routines and functions (mainly implemented in R) are still in the process of being re-written and readapted for the new spatial support. This manuscript collects four articles presenting data structures and statistical models to analyse spatial data lying on road networks using point-pattern and network-lattice approaches. The first paper reviews classes, vital pre-processing steps and software representations to manipulate road network data. In particular, it focuses on the R packages stplanr and dodgr, highlighting their main functionalities, such as shortest paths or centrality measures, using a range of datasets, from a roundabout to a complete network covering an urban city. The second paper proposes the adoption of two indices for assessing the risk of car crashes on the street network of a metropolitan area via a dynamic zero-inflated Poisson model. The elementary statistical units are the road segments of the network. It employs a set of open-source spatial covariates representing the network’s structural and demographic characteristics (such as population density, traffic lights or crossings) extracted from Open Street Map and 2011 Italian Census. The third paper demonstrates a Bayesian hierarchical model for identifying road segments of particular concern using a network-lattice approach. It is based on a case study of a major city (Leeds, UK), in which car crashes of different severities were recorded over several years. It includes spatially structured and unstructured random effects to capture the spatial nature of the events and the dependencies between the severity levels. It also recommends a novel procedure for estimating the MAUP (Modifiable Areal Unit Problem) for network-lattice data. Finally, the fourth paper summarises a set of preliminary results related to the analysis of spatio-temporal point patterns lying on road networks using non-homogeneous Poisson processes. It focuses on the ambulance interventions that occurred in the municipality of Milan from 2015 to 2017, developing two distinct models, one for the spatial component and one for the temporal component. The spatial intensity function was estimated using a network readaptation of the classical non-parametric kernel estimator. The first two appendices briefly review the basics of INLA methodology, the corresponding R package and the supplementary materials related to the fourth chapter, while the third appendix briefly introduces an R package, named osmextract, that was developed during the PhD and focuses on Open Street Map data. The fifth chapter concludes the manuscript, summarising the main contributions and emphasising future research developments.
APA, Harvard, Vancouver, ISO, and other styles
7

Fuhry, David P. "PLASMA-HD: Probing the LAttice Structure and MAkeup of High-dimensional Data." The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1440431146.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Puig, Montellà Eduard. "Modeling capillarity and two-phase flow in granular media : from pore-scale to network scale." Thesis, Université Grenoble Alpes (ComUE), 2019. http://www.theses.fr/2019GREAI046/document.

Full text
Abstract:
Les simulations numériques à l'échelle du pore sont fréquemment utilisées pour étudier le comportement des écoulements multiphasiques largement rencontrées dans phénomènes naturels et applications industrielles. Dans ce travail, la morphologie de structures liquides et l'action capillaire sont examinées à l'échelle des pores par la méthode de Boltzmann sur réseau (LBM) à plusieurs composants selon le modèle de Shan-Chen. Les résultats numériques obtenus sont en bon accord avec les solutions théoriques. Les simulations numériques sont étendues à microstructures complexes au-delà du régime pendulaire.La LBM a été utilisée pour modéliser l'écoulement multiphasique à travers un milieu poreux idéalisé dans des conditions de drainage primaire quasi-statique. Les simulations LBM ont fourni une excellente description du déplacement de l'interface fluide-fluide à travers les grains. Pendant le drainage, les simulations LBM sont capables de reproduire la déconnexion d'une phase dans le milieu granulaire sous la forme de ponts pendulaires ou structures liquides complexes. Malheureusement, le temps de calcul nécessaire pour ce type de simulations est assez élevé. Afin d’optimiser les ressources de calcul, nous présentons un modèle 2D (modèle Throat-Network) basé sur des solutions analytiques pour décrire l'écoulement biphasique à travers un ensemble de disques dans un temps de calcul très réduit, donc le modèle 2D est susceptible de remplacer les simulations LBM lorsque les ressources de calcul sont limitées. L'approche souligne l'importance de simuler le problème a l'échelle de la gorge du pore pour obtenir les relations volume - pression capillaire locales. Le modèle Throat-Network est un point de départ pour le modèle hybride proposé pour résoudre les problèmes en 3D. Le modèle hybride combine l’efficacité de l’approche réseau de pores et la précision du LBM à l’échelle des pores. Le modèle hybride est basé sur la décomposition de l’échantillon en petits sous-domaines, dans lesquels des simulations LBM sont effectuées pour déterminer les propriétés hydrostatiques principales (pression capillaire d'entrée, courbe de drainage primaire et morphologie du liquide pour chaque gorge du pore). Malgré la réduction significative des temps de calcul obtenus avec le modèle hybride, le temps n’est pas négligeable et les modélisations numériques d'échantillons de grandes tailles ne sont pas réalistes. Les approximations données par les méthodes Incircle et MS-P, qui prédisent les propriétés hydrostatiques, sont comparées à celles de LBM et du modèle hybride
Numerical simulations at the pore scale are a way to study the behavior of multiphase flows encountered in many natural processes and industrial applications. In this work, liquid morphology and capillary action are examined at the pore-scale by means of the multicomponent Shan-Chen lattice Boltzmann method (LBM). The accuracy of the numerical model is first contrasted with theoretical solutions. The numerical results are extended to complex microstructures beyond the pendular regime.The LBM has been employed to simulate multiphase flow through idealized granular porous media under quasi-static primary drainage conditions. LBM simulations provide an excellent description of the fluid-fluid interface displacement through the grains. Additionally, the receding phase trapped in the granular media in form of pendular bridges or liquid clusters is well captured. Unfortunately, such simulations require a significant computation time. A 2D model (Throat-Network model) based on analytical solutions is proposed to mimic the multiphase flow with very reduced computation cost, therefore, suitable to replace LBM simulations when the computation resources are limited. The approach emphasizes the importance of simulating at the throat scale rather than the pore body scale in order to obtain the local capillary pressure - liquid content relationships. The Throat-Network model is a starting point for the a hybrid model proposed to solve 3D problems. The hybrid model combines the efficiency of the pore-network approach and the accuracy of the LBM at the pore scale to optimize the computational resources. The hybrid model is based on the decomposition of the granular assembly into small subsets, in which LBM simulations are performed to determine the main hydrostatic properties (entry capillary pressure, capillary pressure - liquid content relationship and liquid morphology for each pore throat). Despite the reduction of computation time, it is still not negligible and not affordable for large granular packings. Approximations by the Incircle and the MS-P method, which predict hydrostatic properties, are contrasted with the results provided by LBM and the hybrid model. Relatively accurate predictions are given by the approximations
APA, Harvard, Vancouver, ISO, and other styles
9

Charles, Noah S. "Multifractal Methods for Anderson Transitions." The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1595519105865006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wang, Zhicun. "Time-Domain Simulations of Aerodynamic Forces on Three-Dimensional Configurations, Unstable Aeroelastic Responses, and Control by Neural Network Systems." Diss., Virginia Tech, 2004. http://hdl.handle.net/10919/11181.

Full text
Abstract:
The nonlinear interactions between aerodynamic forces and wing structures are numerically investigated as integrated dynamic systems, including structural models, aerodynamics, and control systems, in the time domain. An elastic beam model coupled with rigid-body rotation is developed for the wing structure, and the natural frequencies and mode shapes are found by the finite-element method. A general unsteady vortex-lattice method is used to provide aerodynamic forces. This method is verified by comparing the numerical solutions with the experimental results for several cases; and thereafter applied to several applications such as the inboard-wing/twin-fuselage configuration, and formation flights. The original thought that the twin fuselage could achieve two-dimensional flow on the wing by eliminating free wing tips appears to be incorrect. The numerical results show that there can be a lift increase when two or more wings fly together, compared to when they fly alone. Flutter analysis is carried out for a High-Altitude-Long-Endurance aircraft wing cantilevered from the wall of the wind tunnel, a full-span wing mounted on a free-to-roll sting at its mid-span without and with a center mass (fuselage). Numerical solutions show that the rigidity added by the wall results in a higher flutter speed for the wall-mounted semi-model than that for the full-span model. In addition, a predictive control technique based on neural networks is investigated to suppress flutter oscillations. The controller uses a neural network model to predict future plant responses to potential control signals. A search algorithm is used to select the best control input that optimizes future plant performance. The control force is assumed to be given by an actuator that can apply a distributed torque along the spanwise direction of the wing. The solutions with the wing-tip twist or the wing-tip deflection as the plant output show that the flutter oscillations are successfully suppressed with the neural network predictive control scheme.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Network Lattice"

1

Digitale Signalverarbeitung mit MATLAB-Praktikum: Zustandsraumdarstellung, Lattice-Strukturen, PrÞ̧diktion und adaptive Filter. Wiesbaden: Friedr. Vieweg & Sohn Verlag, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lin, Shu. Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes. Boston, MA: Springer US, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

ZnO bao mo zhi bei ji qi guang, dian xing neng yan jiu. Shanghai Shi: Shanghai da xue chu ban she, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Blue Lattice Network and Other Stories. Lulu Press, Inc., 2017.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Vernizzi, Graziano, and Henri Orland. Complex networks. Edited by Gernot Akemann, Jinho Baik, and Philippe Di Francesco. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198744191.013.43.

Full text
Abstract:
This article deals with complex networks, and in particular small world and scale free networks. Various networks exhibit the small world phenomenon, including social networks and gene expression networks. The local ordering property of small world networks is typically associated with regular networks such as a 2D square lattice. The small world phenomenon can be observed in most scale free networks, but few small world networks are scale free. The article first provides a brief background on small world networks and two models of scale free graphs before describing the replica method and how it can be applied to calculate the spectral densities of the adjacency matrix and Laplacian matrix of a scale free network. It then shows how the effective medium approximation can be used to treat networks with finite mean degree and concludes with a discussion of the local properties of random matrices associated with complex networks.
APA, Harvard, Vancouver, ISO, and other styles
6

Zamir, Ram, Ilai Bistritz, Yuval Kochman, and Bobak Nazer. Lattice Coding for Signals and Networks. Cambridge University Press, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Collet, Bernard, Andrzej Nowakowski, Thomas Michelitsch, Alejandro Perez Riascos, and Franck Nicolleau. Fractional Dynamics on Networks and Lattices. Wiley & Sons, Incorporated, John, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Collet, Bernard, Andrzej Nowakowski, Thomas Michelitsch, Alejandro Perez Riascos, and Franck Nicolleau. Fractional Dynamics on Networks and Lattices. Wiley & Sons, Incorporated, John, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Collet, Bernard, Andrzej Nowakowski, Thomas Michelitsch, Alejandro Perez Riascos, and Franck Nicolleau. Fractional Dynamics on Networks and Lattices. Wiley & Sons, Incorporated, John, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Collet, Bernard, Andrzej Nowakowski, Thomas Michelitsch, Alejandro Perez Riascos, and Franck Nicolleau. Fractional Dynamics on Networks and Lattices. Wiley & Sons, Incorporated, John, 2019.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Network Lattice"

1

Lin, Zihuai. "Lattice Network Coding for Multi-Way Relaying Systems." In Design of Network Coding Schemes in Wireless Networks, 67–80. Boca Raton: CRC Press, 2022. http://dx.doi.org/10.1201/9781003203803-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Plantard, Thomas, and Willy Susilo. "Broadcast Attacks against Lattice-Based Cryptosystems." In Applied Cryptography and Network Security, 456–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01957-9_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ran, Shi-Ju, Emanuele Tirrito, Cheng Peng, Xi Chen, Luca Tagliacozzo, Gang Su, and Maciej Lewenstein. "Tensor Network Approaches for Higher-Dimensional Quantum Lattice Models." In Tensor Network Contractions, 87–97. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-34489-4_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Yi, Yu-Chih Huang, Alister G. Burr, and Krishna R. Narayanan. "Multilevel Lattices for Compute-and-Forward and Lattice Network Coding." In Number Theory Meets Wireless Communications, 201–40. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-61303-7_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Yi, Yu-Chih Huang, Alister G. Burr, and Krishna R. Narayanan. "Multilevel Lattices for Compute-and-Forward and Lattice Network Coding." In Number Theory Meets Wireless Communications, 201–40. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-61303-7_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, Jinhui, and Yong Yu. "Lattice Based Verifiably Encrypted Double Authentication Preventing Signatures." In Network and System Security, 581–95. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-36938-5_36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhang, Leyou, and Qing Wu. "Adaptively Secure Hierarchical Identity-Based Encryption over Lattice." In Network and System Security, 46–58. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-64701-2_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Alkim, Erdem, Paulo S. L. M. Barreto, Nina Bindel, Juliane Krämer, Patrick Longa, and Jefferson E. Ricardini. "The Lattice-Based Digital Signature Scheme qTESLA." In Applied Cryptography and Network Security, 441–60. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-57808-4_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Jin, Zhengzhong, and Yunlei Zhao. "Generic and Practical Key Establishment from Lattice." In Applied Cryptography and Network Security, 302–22. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-21568-2_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sehrawat, Vipin Singh, and Yvo Desmedt. "Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption." In Cryptology and Network Security, 3–23. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-31578-8_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Network Lattice"

1

Shum, Kenneth W., and Qifu Tyler Sun. "Lattice network codes over optimal lattices in low dimensions." In 2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA). IEEE, 2015. http://dx.doi.org/10.1109/iwsda.2015.7458384.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sadeghi, Mohammad-Reza, Farzane Amirzade, Daniel Panario, and Amin Sakzad. "A Neural Network Lattice Decoding Algorithm." In 2018 IEEE Information Theory Workshop (ITW). IEEE, 2018. http://dx.doi.org/10.1109/itw.2018.8613440.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Feng, Chen, Danilo Silva, and Frank R. Kschischang. "Lattice network coding over finite rings." In 2011 12th Canadian Workshop on Information Theory (CWIT). IEEE, 2011. http://dx.doi.org/10.1109/cwit.2011.5872128.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Feng, Chen, Danilo Silva, and Frank R. Kschischang. "Lattice network coding via signal codes." In 2011 IEEE International Symposium on Information Theory - ISIT. IEEE, 2011. http://dx.doi.org/10.1109/isit.2011.6034049.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Feng, Chen, Danilo Silva, and Frank R. Kschischang. "Design criteria for lattice network coding." In 2011 45th Annual Conference on Information Sciences and Systems (CISS). IEEE, 2011. http://dx.doi.org/10.1109/ciss.2011.5766229.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Liang, G. Q., and Y. D. Chong. "Topological optical network in honeycomb lattice." In Frontiers in Optics. Washington, D.C.: OSA, 2014. http://dx.doi.org/10.1364/fio.2014.ftu2e.5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Clayman, Stuart, Alex Galis, and Lefteris Mamatas. "Monitoring virtual networks with Lattice." In 2010 IEEE/IFIP Network Operations and Management Symposium Workshops. IEEE, 2010. http://dx.doi.org/10.1109/nomsw.2010.5486569.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Becker, Daniela, Jorge Guajardo, and Karl-Heinz Zimmermann. "Revisiting Private Stream Aggregation: Lattice-Based PSA." In Network and Distributed System Security Symposium. Reston, VA: Internet Society, 2018. http://dx.doi.org/10.14722/ndss.2018.23120.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wang, Huan-liang, Xi-jun Zhu, and Ji-qing Han. "Lattice Segmentation Based Confusion Network Generation Method." In 2009 International Conference on Education Technology and Computer. IEEE, 2009. http://dx.doi.org/10.1109/icetc.2009.75.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kalamani, D., and P. Balasubramanie. "Age Classification using Fuzzy Lattice Neural Network." In Sixth International Conference on Intelligent Systems Design and Applications. IEEE, 2006. http://dx.doi.org/10.1109/isda.2006.8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Network Lattice' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography