Relevant bibliographies by topics / Partial structure representations

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Partial structure representations'

Author: Grafiati
Published: 4 June 2021
Last updated: 13 February 2022

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Partial structure representations.'

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 "Partial structure representations"

1

Lee, Sang Hun, and Kunwoo Lee. "Partial Entity Structure: A Compact Boundary Representation for Non-Manifold Geometric Modeling." Journal of Computing and Information Science in Engineering 1, no. 4 (November 1, 2001): 356–65. http://dx.doi.org/10.1115/1.1433486.

Full text
Abstract:
Non-manifold boundary representations have become very popular in recent years and various representation schemes have been proposed, as they represent a wider range of objects, for various applications, than conventional manifold representations. As these schemes mainly focus on describing sufficient adjacency relationships of topological entities, the models represented in these schemes occupy storage space redundantly, although they are very efficient in answering queries on topological adjacency relationships. To solve this problem, in this paper, we propose a compact as well as fast non-manifold boundary representation, called the partial entity structure. This representation reduces the storage size to half that of the radial edge structure, which is one of the most popular and efficient of existing data structures, while allowing full topological adjacency relationships to be derived without loss of efficiency. In order to verify the time and storage efficiency of the partial entity structure, the time complexity of basic query procedures and the storage requirement for typical geometric models are derived and compared with those of existing schemes.
APA, Harvard, Vancouver, ISO, and other styles
2

Trapani, Camillo. "UnboundedC*-seminorms, biweights, and*-representations of partial*-algebras: A review." International Journal of Mathematics and Mathematical Sciences 2006 (2006): 1–34. http://dx.doi.org/10.1155/ijmms/2006/79268.

Full text
Abstract:
The notion of (unbounded)C*-seminorms plays a relevant role in the representation theory of*-algebras and partial*-algebras. A rather complete analysis of the case of*-algebras has given rise to a series of interesting concepts like that of semifiniteC*-seminorm and spectralC*-seminorm that give information on the properties of*-representations of the given*-algebraAand also on the structure of the*-algebra itself, in particular whenAis endowed with a locally convex topology. Some of these results extend to partial*-algebras too. The state of the art on this topic is reviewed in this paper, where the possibility of constructing unboundedC*-seminorms from certain families of positive sesquilinear forms, called biweights, on a (partial)*-algebraAis also discussed.
APA, Harvard, Vancouver, ISO, and other styles
3

Mlinar, Vladan. "Constraints on nanomaterial structure from experiment and theory: reconciling partial representations." Materials Research Express 2, no. 1 (January 2, 2015): 015015. http://dx.doi.org/10.1088/2053-1591/2/1/015015.

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

Wang, Jing, Atsushi Suzuki, Linchuan Xu, Feng Tian, Liang Yang, and Kenji Yamanishi. "Orderly Subspace Clustering." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 5264–72. http://dx.doi.org/10.1609/aaai.v33i01.33015264.

Full text
Abstract:
Semi-supervised representation-based subspace clustering is to partition data into their underlying subspaces by finding effective data representations with partial supervisions. Essentially, an effective and accurate representation should be able to uncover and preserve the true data structure. Meanwhile, a reliable and easy-to-obtain supervision is desirable for practical learning. To meet these two objectives, in this paper we make the first attempt towards utilizing the orderly relationship, such as the data a is closer to b than to c, as a novel supervision. We propose an orderly subspace clustering approach with a novel regularization term. OSC enforces the learned representations to simultaneously capture the intrinsic subspace structure and reveal orderly structure that is faithful to true data relationship. Experimental results with several benchmarks have demonstrated that aside from more accurate clustering against state-of-the-arts, OSC interprets orderly data structure which is beyond what current approaches can offer.
APA, Harvard, Vancouver, ISO, and other styles
5

Sun, Hanlin, Wei Jie, Jonathan Loo, Liang Chen, Zhongmin Wang, Sugang Ma, Gang Li, and Shuai Zhang. "Network Representation Learning Enhanced by Partial Community Information That Is Found Using Game Theory." Information 12, no. 5 (April 25, 2021): 186. http://dx.doi.org/10.3390/info12050186.

Full text
Abstract:
Presently, data that are collected from real systems and organized as information networks are universal. Mining hidden information from these data is generally helpful to understand and benefit the corresponding systems. The challenges of analyzing such data include high computational complexity and low parallelizability because of the nature of complicated interconnected structure of their nodes. Network representation learning, also called network embedding, provides a practical and promising way to solve these issues. One of the foremost requirements of network embedding is preserving network topology properties in learned low-dimension representations. Community structure is a prominent characteristic of complex networks and thus should be well maintained. However, the difficulty lies in the fact that the properties of community structure are multivariate and complicated; therefore, it is insufficient to model community structure using a predefined model, the way that is popular in most state-of-the-art network embedding algorithms explicitly considering community structure preservation. In this paper, we introduce a multi-process parallel framework for network embedding that is enhanced by found partial community information and can preserve community properties well. We also implement the framework and propose two node embedding methods that use game theory for detecting partial community information. A series of experiments are conducted to evaluate the performance of our methods and six state-of-the-art algorithms. The results demonstrate that our methods can effectively preserve community properties of networks in their low-dimension representations. Specifically, compared to the involved baselines, our algorithms behave the best and are the runners-up on networks with high overlapping diversity and density.
APA, Harvard, Vancouver, ISO, and other styles
6

Fitzgerald, D. G., and Jonathan Leech. "Dual symmetric inverse monoids and representation theory." Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 64, no. 3 (June 1998): 345–67. http://dx.doi.org/10.1017/s1446788700039227.

Full text
Abstract:
AbstractThere is a substantial theory (modelled on permutation representations of groups) of representations of an inverse semigroup S in a symmetric inverse monoid Ix, that is, a monoid of partial one-to-one selfmaps of a set X. The present paper describes the structure of a categorical dual Ix* to the symmetric inverse monoid and discusses representations of an inverse semigroup in this dual symmetric inverse monoid. It is shown how a representation of S by (full) selfmaps of a set X leads to dual pairs of representations in Ix and Ix*, and how a number of known representations arise as one or the other of these pairs. Conditions on S are described which ensure that representations of S preserve such infima or suprema as exist in the natural order of S. The categorical treatment allows the construction, from standard functors, of representations of S in certain other inverse algebras (that is, inverse monoids in which all finite infima exist). The paper concludes by distinguishing two subclasses of inverse algebras on the basis of their embedding properties.
APA, Harvard, Vancouver, ISO, and other styles
7

BEN-ASHER, YOSI, and EITAN FARCHI. "COMPACT REPRESENTATIONS OF SEARCH IN COMPLEX DOMAINS." International Game Theory Review 07, no. 01 (March 2005): 73–90. http://dx.doi.org/10.1142/s0219198905000399.

Full text
Abstract:
We introduce a new zero-sum matrix game for modeling search in structured domains. In this game, one player tries to find a "bug" while the other tries to hide it. Both players exploit the structure of the "search" domain. Intuitively, this search game is a mathematical generalization of the well known binary search. The generalization is from searching over totally ordered sets to searching over more complex search domains such as trees, partial orders and general set systems. As there must be one row for every search strategy, and there are exponentially many ways to search even in very simple search domains, the game's matrix has exponential size ("space"). In this work we present two ways to reduce the space required to compute the Nash value (in pure strategies) of this game: • First we show that a Nash equilibrium in pure strategies can be computed by using a backward induction on the matrices of each "part" or sub structure of the search domain. This can significantly reduce the space required to represent the game. • Next, we show when general search domains can be represented as DAGs (Directed Acycliqe Graphs). As a result, the Nash equilibrium can be directly computed using the DAG. Consequently the space needed to compute the desired search strategy is reduced to O(n2) where n is the size of the search domain.
APA, Harvard, Vancouver, ISO, and other styles
8

BEN-ASHER, YOSI, and EITAN FARCHI. "COMPACT REPRESENTATIONS OF SEARCH IN COMPLEX DOMAINS." International Game Theory Review 07, no. 02 (June 2005): 171–88. http://dx.doi.org/10.1142/s0219198905000478.

Full text
Abstract:
We introduce a new zero-sum matrix game for modeling search in structured domains. In this game, one player tries to find a "bug" while the other tries to hide it. Both players exploit the structure of the "search" domain. Intuitively, this search game is a mathematical generalization of the well known binary search. The generalization is from searching over totally ordered sets to searching over more complex search domains such as trees, partial orders and general set systems. As there must be one row for every search strategy, and there are exponentially many ways to search even in very simple search domains, the game's matrix has exponential size ("space"). In this work we present two ways to reduce the space required to compute the Nash value (in pure strategies) of this game: • First we show that a Nash equilibrium in pure strategies can be computed by using a backward induction on the matrices of each "part" or sub structure of the search domain. This can significantly reduce the space required to represent the game. • Next, we show when general search domains can be represented as DAGs (Directed Acycliqe Graphs). As a result, the Nash equilibrium can be directly computed using the DAG. Consequently the space needed to compute the desired search strategy is reduced to O(n2) where n is the size of the search domain.
APA, Harvard, Vancouver, ISO, and other styles
9

Burla, M. C., M. Camalli, G. Cascarano, C. Giacovazzo, G. Polidori, R. Spagna, and D. Viterbo. "SIR88 – a direct-methods program for the automatic solution of crystal structures." Journal of Applied Crystallography 22, no. 4 (August 1, 1989): 389–93. http://dx.doi.org/10.1107/s0021889889004103.

Full text
Abstract:
SIR88 is an integrated package of computer programs for the solution of crystal structures. The package is based on the estimation of one- and two-phase structure seminvariants and three- and four-phase structure invariants according to the theory of representations [Giacovazzo (1977). Acta Cryst. A33, 933–944; (1980). Acta Cryst. A36, 362–372]. The program works in all the space groups and in most cases it is able to provide the correct solution without user intervention. Some prior information like the availability of a partial structure or of pseudotranslational symmetry is easily exploited to obtain the structure solution.
APA, Harvard, Vancouver, ISO, and other styles
10

Cepek, O., S. Gursky, and P. Kucera. "On Minimum Representations of Matched Formulas." Journal of Artificial Intelligence Research 51 (December 23, 2014): 707–23. http://dx.doi.org/10.1613/jair.4517.

Full text
Abstract:
A Boolean formula in conjunctive normal form (CNF) is called matched if the system of sets of variables which appear in individual clauses has a system of distinct representatives. Each matched CNF is trivially satisfiable (each clause can be satisfied by its representative variable). Another property which is easy to see, is that the class of matched CNFs is not closed under partial assignment of truth values to variables. This latter property leads to a fact (proved here) that given two matched CNFs it is co-NP complete to decide whether they are logically equivalent. The construction in this proof leads to another result: a much shorter and simpler proof of the fact that the Boolean minimization problem for matched CNFs is a complete problem for the second level of the polynomial hierarchy. The main result of this paper deals with the structure of clause minimum CNFs. We prove here that if a Boolean function f admits a representation by a matched CNF then every clause minimum CNF representation of f is matched.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Partial structure representations"

1

Jin, Meilan. "Signal Structure for a Class of Nonlinear Dynamic Systems." BYU ScholarsArchive, 2018. https://scholarsarchive.byu.edu/etd/6829.

Full text
Abstract:
The signal structure is a partial structure representation for dynamic systems. It characterizes the causal relationship between manifest variables and is depicted in a weighted graph, where the weights are dynamic operators. Earlier work has defined signal structure for linear time-invariant systems through dynamical structure function. This thesis focuses on the search for the signal structure of nonlinear systems and proves that the signal structure reduces to the linear definition when the systems are linear. Specifically, this work: (1) Defines the complete computational structure for nonlinear systems. (2) Provides a process to find the complete computational structure given a state space model. (3) Defines the signal structure for dynamic systems in general. (4) Provides a process to find the signal structure for a class of dynamic systems from their complete computational structure.
APA, Harvard, Vancouver, ISO, and other styles
2

Kong, Choi-yu. "Effective partial ontology mapping in a pervasive computing environment." Click to view the E-thesis via HKUTO, 2004. http://sunzi.lib.hku.hk/hkuto/record/B32002737.

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

Kong, Choi-yu, and 江采如. "Effective partial ontology mapping in a pervasive computing environment." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B32002737.

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

Selokela, Thulaganyo Goitseone. "The representation of women in municipal councils and executive structures - analysing the trends in the implementation of the Municipal Structures Act from the results of the 2006 and 2011 South African local government elections." Thesis, University of the Western Cape, 2012. http://etd.uwc.ac.za/index.php?module=etd&action=viewtitle&id=gen8Srv25Nme4_3560_1370595210.

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

Woodbury, Nathan Scott. "Network Reconstruction and Vulnerability Analysis of Financial Networks." BYU ScholarsArchive, 2017. https://scholarsarchive.byu.edu/etd/6370.

Full text
Abstract:
Passive network reconstruction is the process of learning a structured (networked) representation of a dynamic system through the use of known information about the structure of the system as well as data collected by observing the inputs into a system along with the resultant outputs. This work demonstrates an improvement on an existing network reconstruction algorithm so that the algorithm is capable of consistently and perfectly reconstructing a network when system inputs and outputs are measured without error. This work then extends the improved network reconstruction algorithm so that it functions even in the presence of noise as well as the situation where inputs into the system are unknown. Furthermore, this work demonstrates the capability of the new extended algorithms by reconstructing financial networks from stock market data, and then performing an analysis to understand the vulnerabilities of the reconstructed network to destabilization through localized attacks. The creation of these improved and extended algorithms has opened many theoretical questions, paving the way for future research into network reconstruction.
APA, Harvard, Vancouver, ISO, and other styles
6

Ladhams, Zieba Meagan. "Teaching and learning about reaction mechanisms in organic chemistry." University of Western Australia. School of Biomedical and Chemical Sciences, 2004. http://theses.library.uwa.edu.au/adt-WU2005.0035.

Full text
Abstract:
[Truncated abstract] This study was carried out to investigate the teaching and learning processes occurring in the topic of reaction mechanisms in three tertiary level organic chemistry courses and focussed on investigating perceptions about the importance of teaching and learning about reaction mechanisms and about the difficult aspects of the topic .... In the organic chemistry courses under investigation, students achieved many of the explicitly stated aims that their lecturers identified. The students rarely achieved implicit outcomes anticipated by the lecturer. Lecturers demonstrate a tendency to use particular structural representations when discussing certain types of reaction process. The study identified that students commonly use these same types when working through particular reaction processes. In addition, it was found that the use of a particular structure could cue students into thinking about only one type of reaction process taking place in a given reaction. The use of language that is consistent with a consideration of only single reaction particles was also commonly observed in lectures. While this can be adequate in some circumstances, other aspects of reaction processes are better considered in terms of multiple reaction particles ... The project proposes an integrated model, which takes into account the many levels (macroscopic, single particle molecular, multiple particle molecular and intramolecular) involved when describing reaction processes. It is felt that a consideration of the levels discussed in this model is useful when teaching and learning about reaction mechanisms.
APA, Harvard, Vancouver, ISO, and other styles
7

Chetty, Vasu Nephi. "Necessary and Sufficient Informativity Conditions for Robust Network Reconstruction Using Dynamical Structure Functions." BYU ScholarsArchive, 2012. https://scholarsarchive.byu.edu/etd/3810.

Full text
Abstract:
Dynamical structure functions were developed as a partial structure representation of linear time-invariant systems to be used in the reconstruction of biological networks. Dynamical structure functions contain more information about structure than a system's transfer function, while requiring less a priori information for reconstruction than the complete computational structure associated with the state space realization. Early sufficient conditions for network reconstruction with dynamical structure functions severely restricted the possible applications of the reconstruction process to networks where each input independently controls a measured state. The first contribution of this thesis is to extend the previously established sufficient conditions to incorporate both necessary and sufficient conditions for reconstruction. These new conditions allow for the reconstruction of a larger number of networks, even networks where independent control of measured states is not possible. The second contribution of this thesis is to extend the robust reconstruction algorithm to all reconstructible networks. This extension is important because it allows for the reconstruction of networks from real data, where noise is present in the measurements of the system. The third contribution of this thesis is a Matlab toolbox that implements the robust reconstruction algorithm discussed above. The Matlab toolbox takes in input-output data from simulations or real-life perturbation experiments and returns the proposed Boolean structure of the network. The final contribution of this thesis is to increase the applicability of dynamical structure functions to more than just biological networks by applying our reconstruction method to wireless communication networks. The reconstruction of wireless networks produces a dynamic interference map that can be used to improve network performance or interpret changes of link rates in terms of changes in network structure, enabling novel anomaly detection and security schemes.
APA, Harvard, Vancouver, ISO, and other styles
8

Lukášová, Veronika. "Posvítit si do tmy." Doctoral thesis, Vysoké učení technické v Brně. Fakulta výtvarných umění, 2019. http://www.nusl.cz/ntk/nusl-403863.

Full text
Abstract:
My disertation theses explores the intricate relationship between art, science and photography in the framework of the contemporary culture. Clearly outlined research areas open up the subject to a broader theoretical examination to underpin the artistic strategies that can be employed in the practial research. The resulting artwork interprets the domain of particle physics in a series of artworks. First area of the research delves into the domain of images and seeks to understand the relationship between the images of art and science in a broader sense. Second area investigates ambiguous medium of photography as both tool of science and art. Third area is an overview of the history of representation of the subatomic world and issues related to representing what is in fact unrepresentable. Fourth seeks to find epistemic and conceptual connection between art and science and their interdisciplinary dialogue as Sci-Art. The fifth part introduces artworks that reflect the critical egangement with the theoretical research and the scientific method by building the instrument for the observation of the cosmic rays. Sources for the theoretical framework are largely drawn from the academic literature written in the UK and USA where the topics explored in the theses have been studied in depth. The time scope considered in the theses encompasses 1990's of the 20. century up utill the present day.
APA, Harvard, Vancouver, ISO, and other styles
9

Zidani, Hafid. "Représentation de solution en optimisation continue, multi-objectif et applications." Phd thesis, INSA de Rouen, 2013. http://tel.archives-ouvertes.fr/tel-00939980.

Full text
Abstract:
Cette thèse a pour objectif principal le développement de nouveaux algorithmes globaux pour la résolution de problèmes d'optimisation mono et multi-objectif, en se basant sur des formules de représentation ayant la tâche principale de générer des points initiaux appartenant à une zone proche du minimum globale. Dans ce contexte, une nouvelle approche appelée RFNM est proposée et testée sur plusieurs fonctions non linéaires, non différentiables et multimodales. D'autre part, une extension à la dimension infinie a été établie en proposant une démarche pour la recherche du minimum global. Par ailleurs, plusieurs problèmes de conception mécanique, à caractère aléatoire, ont été considérés et résolus en utilisant cette approche, avec amélioration de la méthode multi-objectif NNC. Enfin, une contribution à l'optimisation multi-objectif par une nouvelle approche a été proposée. Elle permet de générer un nombre suffisant de points pour représenter la solution optimale de Pareto.
APA, Harvard, Vancouver, ISO, and other styles
10

Gold, Daniel. "Lobbying Regulation in Canada and the United States: Political Influence, Democratic Norms and Charter Rights." Thesis, Université d'Ottawa / University of Ottawa, 2020. http://hdl.handle.net/10393/40908.

Full text
Abstract:
Lobbying should be strictly regulated – that is the major finding of this thesis. The thesis presents many reasons to enact stricter regulations. The principle one being that, as lightly regulated as it is, lobbying is corroding democracy in both Canada and the United States. The thesis opens with a deep investigation of how lobbying works in both countries. There are examples taken from the literature, as well as original qualitative interviews of Canadian lobbyists, former politicians, and officials. Together, these make it clear that there is an intimate relationship between lobbying and campaign financing. The link between the two is sufficiently tight that lobbying and campaign financing should be considered mirrors of each other for the purposes of regulatory design and constitutional jurisprudence. They both have large impacts on government decision-making. Left lightly regulated, lobbying and campaign financing erode the processes of democracy, damage policy-making, and feed an inequality spiral into plutocracy. These have become major challenges of our time. The thesis examines the lobbying regulations currently in place. It finds the regulatory systems of both countries wanting. Since stricter regulation is required to protect democracy and equality, the thesis considers what constitutional constraints, if any, would stand in the way. This, primarily, is a study of how proposed stronger lobbying regulations would interact with the Canadian Charter of Rights and Freedoms, s. 2 (free expression and association rights) and s. 3 (democratic rights). The principal findings are that legislation which restricted lobbying as proposed would probably be upheld by the Canadian court, but struck down by the American court, due to differences in their constitutional jurisprudence. The thesis contends that robust lobbying regulations would align with Canadian Charter values, provide benefits to democracy, improve government decision-making, increase equality, and create more room for citizen voices. The thesis concludes with a set of proposed principles for lobbying reform and an evaluation of two specific reforms: limits on business lobbying and funding for citizen groups. Although the thesis focuses on Canadian and American lobbying regulations, its lessons are broadly applicable to any jurisdiction that is considering regulating lobbying.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Partial structure representations"

1

Igusa, Kiyoshi, 1949- editor of compilation, Martsinkovsky, A. (Alex), editor of compilation, and Todorov, G. (Gordana), editor of compilation, eds. Expository lectures on representation theory: Maurice Auslander Distinguished Lectures and International Conference, April 25-30, 2012, Woods Hole Oceanographic Institute, Quissett Campus, Falmouth, MA. Providence, Rhode Island: American Mathematical Society, 2014.

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

India) International Congress of Mathematicians Satellite Conference on Algebraic and Combinatorial Approaches to Representation Theory (2010 Bangalore. Recent developments in algebraic and combinatorial aspects of representation theory: International Congress of Mathematicians Satellite Conference on Algebraic and Combinatorial Approaches to Representation Theory, August 12-16, 2010, National Institute of Advanced Studies, Bangalore, India : Conference on Algebraic and Combinatorial Approaches to Representation Theory, May 18-20, 2012, University of California, Riverside, CA. Edited by Chari, Vyjayanthi, editor of compilation and Conference on Algebraic and Combinatorial Approaches to Representation Theory (2012 : Riverside, Calif.). Providence, Rhode Island: American Mathematical Society, 2013.

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

Falcoff, Mark. Chile: Prospects for Democracy. New York: Council on Foreign Relations, 1988.

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

Hans, Keman, and Budge Ian, eds. Party government in 48 democracies (1945-1998): Composition, duration, personnel. Dordrecht: Kluwer Academic Publishers, 2000.

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

Sang-in, Chŏn, ed. Hanʼguk hyŏndaesa: Chinsil kwa haesŏk. Kyŏnggi-do Pʻaju-si: Nanam Chʻulpʻan, 2005.

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

Bueno, Otávio, and Steven French. Scientific Representation and the Application of Mathematics. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198815044.003.0003.

Full text
Abstract:
In this chapter, we show how the partial structures framework can be used to give an account of how scientific models represent systems, and in a way that pays due regard to the relations between the relevant mathematics and such models. In particular, both the open-ended nature of these developments and the transfer of relations between one structure and another can be accommodated within the partial structures account. Finally, the expansion of the framework to include partial homomorphisms holding between structures also allows us to accommodate the fact that typically not all of the mathematics is used in a particular application, leaving surplus structure that can be subsequently exploited.
APA, Harvard, Vancouver, ISO, and other styles
7

Horing, Norman J. Morgenstern. Thermodynamic Green’s Functions and Spectral Structure. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198791942.003.0007.

Full text
Abstract:
Multiparticle thermodynamic Green’s functions, defined in terms of grand canonical ensemble averages of time-ordered products of creation and annihilation operators, are interpreted as tracing the amplitude for time-developing correlated interacting particle motions taking place in the background of a thermal ensemble. Under equilibrium conditions, time-translational invariance permits the one-particle thermal Green’s function to be represented in terms of a single frequency, leading to a Lehmann spectral representation whose frequency poles describe the energy spectrum. This Green’s function has finite values for both t>t′ and t<t′ (unlike retarded Green’s functions), and the two parts G1> and G1< (respectively) obey a simple proportionality relation that facilitates the introduction of a spectral weight function: It is also interpreted in terms of a periodicity/antiperiodicity property of a modified Green’s function in imaginary time capable of a Fourier series representation with imaginary (Matsubara) frequencies. The analytic continuation from imaginary time to real time is discussed, as are related commutator/anticommutator functions, also retarded/advanced Green’s functions, and the spectral weight sum rule is derived. Statistical thermodynamic information is shown to be embedded in physical features of the one- and two-particle thermodynamic Green’s functions.
APA, Harvard, Vancouver, ISO, and other styles
8

Impett, Jonathan. Making a mark The psychology of composition. Edited by Susan Hallam, Ian Cross, and Michael Thaut. Oxford University Press, 2012. http://dx.doi.org/10.1093/oxfordhb/9780199298457.013.0037.

Full text
Abstract:
This article discusses the psychology of composition. Composition is a reflexive, iterative process of inscription. The work, once named as such and externalizable to some degree, passes circularly between inner and outer states. It passes through internal and external representations – mostly partial or compressed, some projected in mental rather than physical space, not all necessarily conscious or observable – and phenomenological experience, real or imagined. At each state-change the work is re-mediated by the composer, whose decision-making process is conditioned by the full complexity of human experience. This entire activity informs the simultaneous development of the composer's understanding of the particular work in its autonomy, of their own creativity, and of music more broadly. While the urge to compose – to invent, structure, and define sound and musical behaviour – may be to some degree innate, modes of conceiving, representing, and realizing are the product of a situated process. Even if some or all of that activity is so well assimilated personally or culturally that it remains hidden from experimental view, it remains a behaviour in respect of an emerging object.
APA, Harvard, Vancouver, ISO, and other styles
9

Bäck, Hanna, and Gissur Ó. Erlingsson. Introduction. Edited by Jon Pierre. Oxford University Press, 2016. http://dx.doi.org/10.1093/oxfordhb/9780199665679.013.43.

Full text
Abstract:
This introduction to the section on the party system in Sweden starts with the premise that political parties are essential for the upholding of legitimacy in parliamentary democracies. Four chapters make up the section. The first focuses on the changing Swedish party system, where Social Democrats historically have held an exceptionally strong position, which has weakened during recent years. The second analyzes the parties’ internal organizational structure, suggesting that although Swedish parties have become more professionalized, and the ‘mass party’ has faded away, this does not imply they have become internally less democratic. The third chapter focuses on representation, arguing that Swedish parties today face a more complex environment than before, with more diversity among representatives. The concluding chapter suggests that some features of Swedish cabinets stand out in a comparative perspective, with many single-party minority governments, where the Social Democrats have ruled with the help of ‘support party coalitions’.
APA, Harvard, Vancouver, ISO, and other styles
10

Deruelle, Nathalie, and Jean-Philippe Uzan. The kinematics of a point particle. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198786399.003.0020.

Full text
Abstract:
This chapter discusses the kinematics of point particles undergoing any type of motion. It introduces the concept of proper time—the geometric representation of the time measured by an accelerated clock. It also describes a world line, which represents the motion of a material point or point particle P, that is, an object whose spatial extent and internal structure can be ignored. The chapter then considers the interpretation of the curvilinear abscissa, which by definition measures the length of the world line L representing the motion of the point particle P. Next, the chapter discusses a mathematical result popularized by Paul Langevin in the 1920s, the so-called ‘Langevin twins’ which revealed a paradoxical result. Finally, the transformation of velocities and accelerations is discussed.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Partial structure representations"

1

Bardos, Claude, and Nicolas Besse. "Hamiltonian Structure, Fluid Representation and Stability for the Vlasov–Dirac–Benney Equation." In Hamiltonian Partial Differential Equations and Applications, 1–30. New York, NY: Springer New York, 2015. http://dx.doi.org/10.1007/978-1-4939-2950-4_1.

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

Solovtsov, Igor L. "Target Mass Effects and the Jost-Lehmann-Dyson Representation for Structure Functions." In Particle Physics in the New Millennium, 526–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-36539-7_49.

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

Rapoport, Diego L. "Non-Riemannian Geometry of Continuous-Spin Infinite- Particle Systems and Their Non-Interaction Representation." In Instabilities and Nonequilibrium Structures IX, 259–69. Dordrecht: Springer Netherlands, 2004. http://dx.doi.org/10.1007/978-94-007-0991-1_17.

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

Zbroja, Stanisław, and Antoni Ligęza. "Case-Based Reasoning within Tabular Systems. Extended Structural Data Representation and Partial Matching." In Flexible Query Answering Systems, 230–39. Heidelberg: Physica-Verlag HD, 2001. http://dx.doi.org/10.1007/978-3-7908-1834-5_22.

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

Kharchev, S., D. Lebedev, and M. Semenov-Tian-Shansky. "Unitary Representations of the Modular and Two-Particle Q-Deformed Toda Chains." In Integrable Structures of Exactly Solvable Two-Dimensional Models of Quantum Field Theory, 223–42. Dordrecht: Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-010-0670-5_14.

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

Linder, Wolf, and Sean Mueller. "Consensus Democracy: The Swiss System of Power-Sharing." In Swiss Democracy, 167–207. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-63266-3_5.

Full text
Abstract:
AbstractThis chapter unpacks the notion of power-sharing and explains its centrality for political Switzerland. While direct democracy has played an important part in its evolution, law-making in Switzerland has become impossible without the participation of various interest groups at early stages of drafting already. The chapter details the functioning of Switzerland’s broad-based political pluralism, its structure of consociational democracy, the representation of the most important political parties and interest groups, and the ensuing processes of negotiation and mutual adjustment. It also discusses challenges and pitfalls of power-sharing.
APA, Harvard, Vancouver, ISO, and other styles
7

Preminger, Jonathan. "Labor Representation outside Union Structures." In Labor in Israel. Cornell University Press, 2018. http://dx.doi.org/10.7591/cornell/9781501717123.003.0012.

Full text
Abstract:
The first of five chapters which address the third sphere, organized labor’s relationship to the wider political community, Chapter 11 explores the development of labor representation outside classic union structures. Following the weakening of organized labor’s links to political parties and the influx of groups of workers who have no historical ties with the political establishment and in some cases are not even citizens, workers are finding new ways of bringing their demands into the political arena. The chapter focuses on the Workers Advice Center which made a partially-successful move from NGO to classic union, and on Kav Laoved, a workers’ rights organization. It suggests that such organizations reflect a change in the nature of labor representation as elected representatives are replaced by “experts in the field” and a focus on advancing case law through targeted legal struggle and lobbying – a transformation that has engendered representative organizations with hybrid identities.
APA, Harvard, Vancouver, ISO, and other styles
8

Hennessey, Thomas, Máire Braniff, James W. McAuley, Jonathan Tonge, and Sophie A. Whiting. "Institutional Structures, Party Selection, and Spotty Tights." In The Ulster Unionist Party, 194–216. Oxford University Press, 2019. http://dx.doi.org/10.1093/oso/9780198794387.003.0010.

Full text
Abstract:
Chapter 9 assesses the representation and roles of women in the UUP. Women represent 30 per cent of members of the Northern Ireland Assembly and 25 per cent of local councillors However, compared to other devolved institutions, where female representation is 42 and 35 per cent in the Welsh Assembly and Scottish Parliament respectively, Northern Ireland politics maintains a significant gender deficit, as nationality and religion tend to eclipse a gender focus. The gender deficit within unionist politics is stark when compared with nationalist parties. The chapter accounts for the reasons behind the gender deficit in the UUP, where there is low female party membership and elected representation. The chapter discusses how female participation is promoted. It examines male and female attitudes to women in the party, utilizing survey evidence on views of quotas, on whether female elected representatives can better represent women’s interests, and whether women have significant voice.
APA, Harvard, Vancouver, ISO, and other styles
9

"Party systems and structures of representation." In Political Parties in Post-Communist Eastern Europe, 135–61. Routledge, 2002. http://dx.doi.org/10.4324/9780203183380-8.

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

French, Steven. "Theories as Representations." In There Are No Such Things As Theories, 51–96. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780198848158.003.0003.

Full text
Abstract:
The nature of scientific representation has been the subject of considerable discussion recently with frequent comparisons made between theories and depictive artworks. Here it is argued that the Semantic Approach can be understood as a useful means of capturing this representational relationship, in both the scientific and artistic domains. In particular, by deploying the device of partial structures it can capture the manner in which apparently inconsistent theories and pictures can represent, as well as that of certain abstract artworks. Nevertheless, care must be taken in drawing on examples from one domain to support or undermine arguments made about the nature of representation in the other. The comparisons involved highlight crucial differences between theories and artworks that will be drawn upon in subsequent chapters.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Partial structure representations"

1

Liu, Yang, Haixu Liu, Chenyu Liu, and Xueming Li. "Structure-constrained low-rank and partial sparse representation for image classification." In 2014 IEEE International Conference on Image Processing (ICIP). IEEE, 2014. http://dx.doi.org/10.1109/icip.2014.7026057.

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

Solovtsov, I. L. "INTEGRAL REPRESENTATION FOR STRUCTURE FUNCTIONS AND TARGET MASS EFFECTS." In Proceedings of the Eleventh Lomonosov Conference on Elementary Particle Physics. WORLD SCIENTIFIC, 2005. http://dx.doi.org/10.1142/9789812702074_0034.

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

Gao, Li, Hong Yang, Jia Wu, Chuan Zhou, Weixue Lu, and Yue Hu. "Recommendation with Multi-Source Heterogeneous Information." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/469.

Full text
Abstract:
Network embedding has been recently used in social network recommendations by embedding low-dimensional representations of network items for recommendation. However, existing item recommendation models in social networks suffer from two limitations. First, these models partially use item information and mostly ignore important contextual information in social networks such as textual content and social tag information. Second, network embedding and item recommendations are learned in two independent steps without any interaction. To this end, we in this paper consider item recommendations based on heterogeneous information sources. Specifically, we combine item structure, textual content and tag information for recommendation. To model the multi-source heterogeneous information, we use two coupled neural networks to capture the deep network representations of items, based on which a new recommendation model Collaborative multi-source Deep Network Embedding (CDNE for short) is proposed to learn different latent representations. Experimental results on two real-world data sets demonstrate that CDNE can use network representation learning to boost the recommendation performance.
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Ziwei, Gengyu Lyu, and Songhe Feng. "Partial Multi-Label Learning via Multi-Subspace Representation." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/362.

Full text
Abstract:
Partial Multi-Label Learning (PML) aims to learn from the training data where each instance is associated with a set of candidate labels, among which only a part of them are relevant. Existing PML methods mainly focus on label disambiguation, while they lack the consideration of noise in the feature space. To tackle the problem, we propose a novel framework named partial multi-label learning via MUlti-SubspacE Representation (MUSER), where the redundant labels together with noisy features are jointly taken into consideration during the training process. Specifically, we first decompose the original label space into a latent label subspace and a label correlation matrix to reduce the negative effects of redundant labels, then we utilize the correlations among features to project the original noisy feature space to a feature subspace to resist the noisy feature information. Afterwards, we introduce a graph Laplacian regularization to constrain the label subspace to keep intrinsic structure among features and impose an orthogonality constraint on the correlations among features to guarantee discriminability of the feature subspace. Extensive experiments conducted on various datasets demonstrate the superiority of our proposed method.
APA, Harvard, Vancouver, ISO, and other styles
5

Correia, Artur Jordão Lima, and William Robson Schwartz. "Partial Least Squares: A Deep Space Odyssey." In Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação, 2021. http://dx.doi.org/10.5753/ctd.2021.15753.

Full text
Abstract:
Modern visual pattern recognition models are based on deep convolutional networks. Such models are computationally expensive, hindering applicability on resource-constrained devices. To handle this problem, we propose three strategies. The first removes unimportant structures (neurons or layers) of convolutional networks, reducing their computational cost. The second inserts structures to design architectures automatically, enabling us to build high-performance networks. The third combines multiple layers of convolutional networks, enhancing data representation at negligible additional cost. These strategies are based on Partial Least Squares (PLS) which, despite promising results, is infeasible on large datasets due to memory constraints. To address this issue, we also propose a discriminative and low-complexity incremental PLS that learns a compact representation of the data using a single sample at a time, thus enabling applicability on large datasets.
APA, Harvard, Vancouver, ISO, and other styles
6

Shogo Sakanaka. "Classification of eigenmodes in a side-coupled structure according to the space group representations." In 2007 IEEE Particle Accelerator Conference (PAC). IEEE, 2007. http://dx.doi.org/10.1109/pac.2007.4441168.

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

Neville, Dorothy, and Leo Joskowicz. "A Representation Language for Mechanical Behavior." In ASME 1993 Design Technical Conferences. American Society of Mechanical Engineers, 1993. http://dx.doi.org/10.1115/detc1993-0001.

Full text
Abstract:
Abstract Automating mechanism design requires developing a representation language for describing mechanism behavior. The language is necessary to specify design requirements, to describe existing mechanisms, and to catalog them for design reuse. This paper presents a simple and expressive language for describing the behavior of fixed-axes mechanisms. The language uses predicates and algebraic relations to describe the positions and motions of each part of the mechanism and the relationships between them. It allows both accurate and complete descriptions and partial, abstract, and under-specified descriptions. We show that the language is computationally viable by describing how to automatically derive behavioral descriptions stated in the language from the mechanism structure. To test its usefulness, we describe a design validation algorithm that determines if a given mechanism structure can produce desired behaviors stated in the language.
APA, Harvard, Vancouver, ISO, and other styles
8

Hayes, Layton, Prashant Doshi, Swaraj Pawar, and Hari Teja Tatavarti. "State-Based Recurrent SPMNs for Decision-Theoretic Planning under Partial Observability." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/348.

Full text
Abstract:
The sum-product network (SPN) has been extended to model sequence data with the recurrent SPN (RSPN), and to decision-making problems with sum-product-max networks (SPMN). In this paper, we build on the concepts introduced by these extensions and present state-based recurrent SPMNs (S-RSPMNs) as a generalization of SPMNs to sequential decision-making problems where the state may not be perfectly observed. As with recurrent SPNs, S-RSPMNs utilize a repeatable template network to model sequences of arbitrary lengths. We present an algorithm for learning compact template structures by identifying unique belief states and the transitions between them through a state matching process that utilizes augmented data. In our knowledge, this is the first data-driven approach that learns graphical models for planning under partial observability, which can be solved efficiently. S-RSPMNs retain the linear solution complexity of SPMNs, and we demonstrate significant improvements in compactness of representation and the run time of structure learning and inference in sequential domains.
APA, Harvard, Vancouver, ISO, and other styles
9

Li, Hang, Haozheng Wang, Zhenglu Yang, and Haochen Liu. "Effective Representing of Information Network by Variational Autoencoder." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/292.

Full text
Abstract:
Network representation is the basis of many applications and of extensive interest in various fields, such as information retrieval, social network analysis, and recommendation systems. Most previous methods for network representation only consider the incomplete aspects of a problem, including link structure, node information, and partial integration. The present study proposes a deep network representation model that seamlessly integrates the text information and structure of a network. Our model captures highly non-linear relationships between nodes and complex features of a network by exploiting the variational autoencoder (VAE), which is a deep unsupervised generation algorithm. We also merge the representation learned with a paragraph vector model and that learned with the VAE to obtain the network representation that preserves both structure and text information. We conduct comprehensive empirical experiments on benchmark datasets and find our model performs better than state-of-the-art techniques by a large margin.
APA, Harvard, Vancouver, ISO, and other styles
10

Armand, J., L. Salles, and C. W. Schwingshackl. "Numerical Simulation of Partial Slip Contact Using a Semi-Analytical Method." In ASME 2015 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/detc2015-46464.

Full text
Abstract:
Almost all mechanical structures consist of an assembly of components that are linked together with joints. If such a structure experiences vibration during operation, micro-sliding can occur in the joint, resulting in fretting wear. Fretting wear affects the mechanical properties of the joints over their lifetime and as a result impacts the non-linear dynamic response of the system. For accurate prediction of the non-linear dynamic response over the lifetime of the structure, fretting wear should be considered in the analysis. Fretting wear studies require an accurate assessment of the stresses and strains in the contacting surfaces of the joints. To provide this information, a contact solver based on the semi-analytical method has been implemented in this study. By solving the normal and tangential contact problems between two elastic semi-infinite bodies, the contact solver allows an accurate calculation of the pressure and shear distributions as well as the relative slips in the contact area. The computed results for a smooth spherical contact between similar elastic materials are presented and validated against analytical solutions. The results are also compared with those obtained from finite element simulations to demonstrate the accuracy and computational benefits of the semi-analytical method. Its capabilities are further illustrated in a new test case of a cylinder with rounded edges on a flat surface, which is a more realistic contact representation of an industrial joint.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Partial structure representations' for particular source types:
Journal articles 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