Relevant bibliographies by topics / Decomposition

Academic literature on the topic 'Decomposition'

Author: Grafiati
Published: 4 June 2021
Last updated: 7 July 2024

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 'Decomposition.'

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 "Decomposition"

1

Crâşmăreanu, Mircea. "Particular trace decompositions and applications of trace decomposition to almost projective invariants." Mathematica Bohemica 126, no. 3 (2001): 631–37. http://dx.doi.org/10.21136/mb.2001.134205.

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

BANKS, JOHN. "Regular periodic decompositions for topologically transitive maps." Ergodic Theory and Dynamical Systems 17, no. 3 (June 1997): 505–29. http://dx.doi.org/10.1017/s0143385797069885.

Full text
Abstract:
One may often decompose the domain of a topologically transitive map into finitely many regular closed pieces with nowhere dense overlap in such a way that these pieces map into one another in a periodic fashion. We call decompositions of this kind regular periodic decompositions and refer to the number of pieces as the length of the decomposition. If $f$ is topologically transitive but $f^{n}$ is not, then $f$ has a regular periodic decomposition of some length dividing $n$. Although a decomposition of a given length is unique, a map may have many decompositions of different lengths. The set of lengths of decompositions of a given map is an ideal in the lattice of natural numbers ordered by divisibility, which we call the decomposition ideal of $f$. Every ideal in this lattice arises as a decomposition ideal of some map. Decomposition ideals of Cartesian products of transitive maps are discussed and used to develop various examples. Results are obtained concerning the implications of local connectedness for decompositions. We conclude with a comprehensive analysis of the possible decomposition ideals for maps on 1-manifolds.
APA, Harvard, Vancouver, ISO, and other styles
3

Fontanil, Lauro, and Eduardo Mendoza. "Common complexes of decompositions and complex balanced equilibria of chemical reaction networks." MATCH Communications in Mathematical and in Computer Chemistry 87, no. 2 (2021): 329–66. http://dx.doi.org/10.46793/match.87-2.329f.

Full text
Abstract:
A decomposition of a chemical reaction network (CRN) is produced by partitioning its set of reactions. The partition induces networks, called subnetworks, that are "smaller" than the given CRN which, at this point, can be called parent network. A complex is called a common complex if it occurs in at least two subnetworks in a decomposition. A decomposition is said to be incidence independent if the image of the incidence map of the parent network is the direct sum of the images of the subnetworks' incidence maps. It has been recently discovered that the complex balanced equilibria of the parent network and its subnetworks are fundamentally connected in an incidence independent decomposition. In this paper, we utilized the set of common complexes and a developed criterion to investigate decomposition’s incidence independence properties. A framework was also developed to analyze decomposition classes with similar structure and incidence independence properties. We identified decomposition classes that can be characterized by their sets of common complexes and studied their incidence independence. Some of these decomposition classes occur in some biological and chemical models. Finally, a sufficient condition was obtained for the complex balancing of some power law kinetic (PLK) systems with incidence independent and complex balanced decompositions. This condition led to a generalization of the Deficiency Zero Theorem for some PLK systems.
APA, Harvard, Vancouver, ISO, and other styles
4

Kahle, Thomas, Ezra Miller, and Christopher O’Neill. "Irreducible decomposition of binomial ideals." Compositio Mathematica 152, no. 6 (April 1, 2016): 1319–32. http://dx.doi.org/10.1112/s0010437x16007272.

Full text
Abstract:
Building on coprincipal mesoprimary decomposition [Kahle and Miller, Decompositions of commutative monoid congruences and binomial ideals, Algebra and Number Theory 8 (2014), 1297–1364], we combinatorially construct an irreducible decomposition of any given binomial ideal. In a parallel manner, for congruences in commutative monoids we construct decompositions that are direct combinatorial analogues of binomial irreducible decompositions, and for binomial ideals we construct decompositions into ideals that are as irreducible as possible while remaining binomial. We provide an example of a binomial ideal that is not an intersection of irreducible binomial ideals, thus answering a question of Eisenbud and Sturmfels [Binomial ideals, Duke Math. J. 84 (1996), 1–45].
APA, Harvard, Vancouver, ISO, and other styles
5

Borup, Lasse, and Morten Nielsen. "On anisotropic Triebel-Lizorkin type spaces, with applications to the study of pseudo-differential operators." Journal of Function Spaces and Applications 6, no. 2 (2008): 107–54. http://dx.doi.org/10.1155/2008/510584.

Full text
Abstract:
A construction of Triebel-Lizorkin type spaces associated with flexible decompositions of the frequency spaceℝdis considered. The class of admissible frequency decompositions is generated by a one parameter group of (anisotropic) dilations onℝdand a suitable decomposition function. The decomposition function governs the structure of the decomposition of the frequency space, and for a very particular choice of decomposition function the spaces are reduced to classical (anisotropic) Triebel-Lizorkin spaces. An explicit atomic decomposition of the Triebel-Lizorkin type spaces is provided, and their interpolation properties are studied. As the main application, we consider Hörmander type classes of pseudo-differential operators adapted to the anisotropy and boundedness of such operators between corresponding Triebel-Lizorkin type spaces is proved.
APA, Harvard, Vancouver, ISO, and other styles
6

Wakamatsu, Masashi. "Is gauge-invariant complete decomposition of the nucleon spin possible?" International Journal of Modern Physics A 29, no. 09 (April 8, 2014): 1430012. http://dx.doi.org/10.1142/s0217751x14300129.

Full text
Abstract:
Is gauge-invariant complete decomposition of the nucleon spin possible? Although it is a difficult theoretical question which has not reached a complete consensus yet, a general agreement now is that there are at least two physically inequivalent gauge-invariant decompositions (I) and (II) of the nucleon. In these two decompositions, the intrinsic spin parts of quarks and gluons are just common. What discriminate these two decompositions are the orbital angular momentum parts. The orbital angular momenta of quarks and gluons appearing in the decomposition (I) are the so-called "mechanical" orbital angular momenta, while those appearing in the decomposition (II) are the generalized (gauge-invariant) "canonical" ones. By this reason, these decompositions are also called the "mechanical" and "canonical" decompositions of the nucleon spin, respectively. A crucially important question is which decomposition is more favorable from the observational viewpoint. The main objective of this concise review is to try to answer this question with careful consideration of recent intensive researches on this problem.
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Haitao, Jie Xiong, Jianhui Xie, Zhongbao Zhou, and Jinlong Zhang. "A Unified Approach to Efficiency Decomposition for a Two-Stage Network DEA Model with Application of Performance Evaluation in Banks and Sustainable Product Design." Sustainability 11, no. 16 (August 14, 2019): 4401. http://dx.doi.org/10.3390/su11164401.

Full text
Abstract:
Data envelopment analysis (DEA) is a data-driven tool for performance evaluation, benchmarking and multiple-criteria decision-making. This article investigates efficiency decomposition in a two-stage network DEA model. Three major methods for efficiency decomposition have been proposed: uniform efficiency decomposition, Nash bargaining game decomposition, and priority decomposition. These models were developed on the basis of different assumptions that led to different efficiency decompositions and thus confusion among researchers. The current paper attempts to reconcile these differences by redefining the fairness of efficiency decomposition based on efficiency rank, and develops a rank-based model with two parameters. In our new rank-based model, these three efficiency decomposition methods can be treated as special cases where these parameters take special values. By showing the continuity of the Pareto front, we simplify the uniform efficiency decomposition, and indicate that the uniform efficiency decomposition and Nash bargaining game decomposition can converge to the same efficiency decomposition. To demonstrate the merits of our model, we use data from the literature to evaluate the performance of 10 Chinese banks, and compare the different efficiency decompositions created by different methods. Last, we apply the proposed model to the performance evaluation of sustainable product design in the automobile industry.
APA, Harvard, Vancouver, ISO, and other styles
8

von Brasch, Thomas, Håkon Grini, Magnus Berglund Johnsen, and Trond Christian Vigtel. "A Two-Stage Bennet Decomposition of the Change in the Weighted Arithmetic Mean." Journal of Official Statistics 39, no. 1 (March 1, 2023): 123–37. http://dx.doi.org/10.2478/jos-2023-0006.

Full text
Abstract:
Abstract The weighted arithmetic mean is used in a wide variety of applications. An infinite number of possible decompositions of the change in the weighted mean are available, and it is therefore an open question which of the possible decompositions should be applied. In this article, we derive a decomposition of the change in the weighted mean based on a two-stage Bennet decomposition. Our proposed decomposition is easy to employ and interpret, and we show that it satisfies the difference counterpart to the index number time reversal test. We illustrate the framework by decomposing aggregate earnings growth from 2020Q4 to 2021Q4 in Norway and compare it with some of the main decompositions proposed in the literature. We find that the wedge between the identified compositional effects from the proposed two-stage Bennet decomposition and the one-stage Bennet decomposition is substantial, and for some industries, the compositional effects have opposite signs.
APA, Harvard, Vancouver, ISO, and other styles
9

ĐOKOVIĆ, DRAGOMIR Ž., and KAIMING ZHAO. "RATIONAL JORDAN DECOMPOSITION OF BILINEAR FORMS." Communications in Contemporary Mathematics 07, no. 06 (December 2005): 769–86. http://dx.doi.org/10.1142/s0219199705001945.

Full text
Abstract:
This is a continuation of our previous work on Jordan decomposition of bilinear forms over algebraically closed fields of characteristic 0. In this note, we study Jordan decomposition of bilinear forms over any field K0 of characteristic 0. Let V0 be an n-dimensional vector space over K0. Denote by [Formula: see text] the space of bilinear forms f : V0 × V0 → K0. We say that f = g + h, where f, g, [Formula: see text], is a rational Jordan decomposition of f if, after extending the field K0 to an algebraic closure K, we obtain a Jordan decomposition over K. By using the Galois group of K/K0, we prove the existence of rational Jordan decompositions and describe a method for constructing all such decompositions. Several illustrative examples of rational Jordan decompositions of bilinear forms are included. We also show how to classify the unimodular congruence classes of bilinear forms over an algebraically closed field of characteristic different from 2 and over the real field.
APA, Harvard, Vancouver, ISO, and other styles
10

Kiana, E., S. Homayouni, M. A. Sharifi, and M. R. Farid-Rohani. "COMPARISON OF DECOMPOSITION METHODS OVER AGRICULTURAL FIELDS USING THE UAVSAR POLARIMETRIC SYNTHETIC APERTURE RADAR." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLII-4/W18 (October 18, 2019): 649–53. http://dx.doi.org/10.5194/isprs-archives-xlii-4-w18-649-2019.

Full text
Abstract:
Abstract. This paper investigates and compares the potential of five model-based polarimetric decompositions, namely those developed by Eigenvector-based decomposition (Van Zyl), Model-based decomposition (Freeman-Durden three-component decomposition and Yamaguchi four-component decomposition), An & Yang3 and An & Yang4 for crop biomass detection over agricultural fields covered by various crops. The time series of Uninhabited Aerial Vehicle Synthetic Aperture Radar (UAVSAR) data and the ground truth of soil and vegetation characteristics collected during the Soil Moisture Active Passive (SMAP) Validation Experiment in 2012 (SMAPVEX12) were used to compare the five decomposition methods with related to the scattering mechanisms and the biomass retrieval performances. The results show that the performance of each decomposition method for biomass retrieval depends on the crop types and the crop phenological stages. Finally, an overall biomass underestimation was observed from the five decompositions, and the highest regression value of 99% was obtained from Freeman decomposition as a result of the enhanced volume scattering. Indeed, Freeman-Durden model provided the best results.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Decomposition"

1

Sykes, Martin Lewis. "Metal carbonyl decomposition and carbon decomposition in the A.G.R." Thesis, University of Newcastle Upon Tyne, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.315635.

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

Ek, Christoffer. "Singular Value Decomposition." Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-21481.

Full text
Abstract:
Digital information och kommunikation genom digitala medier är ett växande område. E-post och andra kommunikationsmedel används dagligen över hela världen. Parallellt med att området växer så växer även intresset av att hålla informationen säker. Transmission via antenner är inom signalbehandling ett välkänt område. Transmission från en sändare till en mottagare genom fri rymd är ett vanligt exempel. I en tuff miljö som till exempel ett rum med reflektioner och oberoende elektriska apparater kommer det att finnas en hel del distorsion i systemet och signalen som överförs kan, på grund av systemets egenskaper och buller förvrängas.Systemidentifiering är ett annat välkänt begrepp inom signalbehandling. Denna avhandling fokuserar på systemidentifiering i en tuff miljö med okända system. En presentation ges av matematiska verktyg från den linjära algebran samt en tillämpning inom signalbehandling. Denna avhandling grundar sig främst på en matrisfaktorisering känd som Singular Value Decomposition (SVD). SVD’n används här för att lösa komplicerade matrisinverser och identifiera system.Denna avhandling utförs i samarbete med Combitech AB. Deras expertis inom signalbehandling var till stor hjälp när teorin praktiserades. Med hjälp av ett välkänt programmeringsspråk känt som LabView praktiserades de matematiska verktygen och kunde synkroniseras med diverse instrument som användes för att generera signaler och system.
Digital information transmission is a growing field. Emails, videos and so on are transmitting around the world on a daily basis. Along the growth of using digital devises there is in some cases a great interest of keeping this information secure. In the field of signal processing a general concept is antenna transmission. Free space between an antenna transmitter and a receiver is an example of a system. In a rough environment such as a room with reflections and independent electrical devices there will be a lot of distortion in the system and the signal that is transmitted might, due to the system characteristics and noise be distorted. System identification is another well-known concept in signal processing. This thesis will focus on system identification in a rough environment and unknown systems. It will introduce mathematical tools from the field of linear algebra and applying them in signal processing. Mainly this thesis focus on a specific matrix factorization called Singular Value Decomposition (SVD). This is used to solve complicated inverses and identifying systems. This thesis is formed and accomplished in collaboration with Combitech AB. Their expertise in the field of signal processing was of great help when putting the algorithm in practice. Using a well-known programming script called LabView the mathematical tools were synchronized with the instruments that were used to generate the systems and signals.
APA, Harvard, Vancouver, ISO, and other styles
3

LeBlanc, Andrew Roland. "Engineering design decomposition." Thesis, Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/16044.

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

Schäfer, Mark. "Advanced STG decomposition." kostenfrei, 2008. http://d-nb.info/992317746/34.

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

Buth, Gerrit J. "Decomposition and primary production in salt marshes = Decompositie en primaire produktie in schorren /." [S.l. : s.n.], 1993. http://www.gbv.de/dms/bs/toc/131131834.pdf.

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

Westling, Lauren. "Underwater decomposition: an examination of factors surrounding freshwater decomposition in eastern Massachusetts." Thesis, Boston University, 2012. https://hdl.handle.net/2144/12670.

Full text
Abstract:
Thesis (M.S.)--Boston University
This study investigated the decomposition of three pig (Sus scrofa) carcasses in the same body of water under lentic and lotic conditions and at variable depths in a temperate mixed forest in the Outdoor Research Facility (ORF) in Holliston, Massachusetts in the summer months of June and July. Data were collected on the invertebrate activity, scavenger activity, water and ambient temperature, stages ofbody decomposition, and the rate of decomposition for each set of remains. Accumulated degree days (ADD) and total body scores (TBS) were used to determine two equations, differentiated by their microhabitat, with the potential use of estimating the postmortem submergence interval (PMSI) in death investigations under similar conditions. The aquatic remains reached skeletonization in 45 days and the terrestrial control remains in 14. Terrestrial and aquatic invertebrate activity was extensive both above and below the waterline with 42 families from 17 orders collected and identified. Through the use of motion detector cameras the researcher was able to view the activities performed around the remains by a blue heron, a coyote, a raccoon, multiple black vultures, multiple turkey vultures, multiple squirrels, and multiple American bullfrogs.
APA, Harvard, Vancouver, ISO, and other styles
7

Bülükbaşi, Güven. "Aspectual decomposition of transactions." Thesis, McGill University, 2007. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=101839.

Full text
Abstract:
The AspectOPTIMA project aims to build an aspect-oriented framework that provides run-time support for transactions. The previously established decomposition of the ACID (atomicity, consistency, isolation, durability) properties into ten well-defined reusable aspects had one limitation: it didn't take into account the concerns of transaction life-time support, resulting in the creation of a cross-cutting concern among the aspects. This thesis removes the cross-cutting concern by integrating the transactional life cycle management issues such as determining the transaction boundaries, maintaining a well-defined state and managing the involvement of the participants. The integration process results in the creation of new aspects that serve as building blocks for various transactional models. The thesis also demonstrates how these base aspects can be configured and composed in different ways to design customized transaction models with different concurrency control and recovery strategies.
APA, Harvard, Vancouver, ISO, and other styles
8

Le, Monnier Francis. "Seaweed decomposition in soil." Thesis, Imperial College London, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.300081.

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

Hamilton, Daniel. "Decomposition and diet problems." Thesis, University of Edinburgh, 2010. http://hdl.handle.net/1842/3798.

Full text
Abstract:
The purpose of this thesis is to efficiently solve real life problems. We study LPs. We study an NLP and an MINLP based on what is known as the generalised pooling problem (GPP), and we study an MIP that we call the cattle mating problem. These problems are often very large or otherwise difficult to solve by direct methods, and are best solved by decomposition methods. During the thesis we introduce algorithms that exploit the structure of the problems to decompose them. We are able to solve row-linked, column-linked and general LPs efficiently by modifying the tableau simplex method, and suggest how this work could be applied to the revised simplex method. We modify an existing sequential linear programming solver that is currently used by Format International to solve GPPs, and show the modified solver takes less time and is at least as likely to find the global minimum as the old solver. We solve multifactory versions of the GPP by augmented Lagrangian decomposition, and show this is more efficient than solving the problems directly. We introduce a decomposition algorithm to solve a MINLP version of the GPP by decomposing it into NLP and ILP subproblems. This is able to solve large problems that could not be solved directly. We introduce an efficient decomposition algorithm to solve the MIP cattle mating problem, which has been adopted for use by the Irish Cattle Breeding Federation. Most of the solve methods we introduce are designed only to find local minima. However, for the multifactory version of the GPP we introduce two methods that give a good chance of finding the global minimum, both of which succeed in finding the global minimum on test problems.
APA, Harvard, Vancouver, ISO, and other styles
10

Imbert, F. E. "Aspects of alkane decomposition." Thesis, Swansea University, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.637369.

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

Books on the topic "Decomposition"

1

Miller, J. Eric. Decomposition. Fargo, ND: Ephemera Bound Pub., 2006.

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

Decomposition. Bloomington, Indiana]: Trafford Publishing, 2014.

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

Silverman, Buffy. Composting: Decomposition. Chicago, Ill: Heinemann Library, 2008.

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

Higle, Julia L., and Suvrajeet Sen. Stochastic Decomposition. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4615-4115-8.

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

Silverman, Buffy. Composting: Decomposition. Harlow, U.K: Heinemann Library, 2008.

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

Matroid decomposition. Boston: Academic Press, 1992.

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

Truemper, K. Matroid decomposition. 2nd ed. [Berlin, Germany]: ELibM [EMIS, EMS], 2000.

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

F, Chan Tony, ed. Domain decomposition methods. Philadelphia: SIAM, 1989.

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

Zhu, Wen-Hong. Virtual Decomposition Control. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-10724-5.

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

Iatsenko, Dmytro. Nonlinear Mode Decomposition. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-20016-3.

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

Book chapters on the topic "Decomposition"

1

Nešetřil, Jaroslav, and Patrice Ossona de Mendez. "Decomposition." In Algorithms and Combinatorics, 145–74. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-27875-4_7.

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

Tuy, Hoang. "Decomposition." In Nonconvex Optimization and Its Applications, 223–76. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4757-2809-5_7.

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

Simola, Nicola, Micaela Morelli, Tooru Mizuno, Suzanne H. Mitchell, Harriet de Wit, H. Valerie Curran, Celia J. A. Morgan, et al. "Decomposition." In Encyclopedia of Psychopharmacology, 370. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-540-68706-1_4178.

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

Gooch, Jan W. "Decomposition." In Encyclopedic Dictionary of Polymers, 196–97. New York, NY: Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4419-6247-8_3342.

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

Ellenbroek, G. A. "Decomposition." In Ecology and productivity of an African wetland system, 231–36. Dordrecht: Springer Netherlands, 1987. http://dx.doi.org/10.1007/978-94-009-4051-2_8.

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

Lambers, Hans, F. Stuart Chapin, and Thijs L. Pons. "Decomposition." In Plant Physiological Ecology, 545–54. New York, NY: Springer New York, 2008. http://dx.doi.org/10.1007/978-0-387-78341-3_18.

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

Singer, Adam B. "Decomposition." In Practical C++ Design, 9–29. Berkeley, CA: Apress, 2017. http://dx.doi.org/10.1007/978-1-4842-3057-2_2.

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

Lapointe, Sandra. "Decomposition." In Bolzano's Theoretical Philosophy, 18–28. London: Palgrave Macmillan UK, 2011. http://dx.doi.org/10.1057/9780230308640_3.

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

Stoer, Mechthild. "Decomposition." In Design of Survivable Networks, 33–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/bfb0088967.

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

Falsafi, Babak, Samuel Midkiff, JackB Dennis, JackB Dennis, Amol Ghoting, Roy H. Campbell, Christof Klausecker, et al. "Decomposition." In Encyclopedia of Parallel Computing, 545. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_2463.

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

Conference papers on the topic "Decomposition"

1

Dougherty, Sean, and Tanay Roy. "Hardware-Efficient Decomposition of Qudit Gates." In Hardware-Efficient Decomposition of Qudit Gates. US DOE, 2023. http://dx.doi.org/10.2172/1995268.

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

Kim, Yong Se, and Kenneth D. Roe. "Conversions in Form Feature Recognition Using Convex Decomposition." In ASME 1992 International Computers in Engineering Conference and Exposition. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/cie1992-0029.

Full text
Abstract:
Abstract A convergent convex decomposition method called Alternating Sum of Volumes with Partitioning (ASVP) has been used to recognize volumetric form features intrinsic to the product shape. The recognition process is done by converting the ASVP decomposition into a form feature decomposition by successively applying combination operations on ASVP components. In this paper, we describe a method to generate new combination operations through inductive learning from conversion processes of primal and dual ASVP decompositions when one decomposition produces more desirable form feature information than the other.
APA, Harvard, Vancouver, ISO, and other styles
3

Purwar, Anurag, and Q. J. Ge. "Polar Decomposition of Unit Dual Quaternions." In ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-70882.

Full text
Abstract:
This paper seeks to extend the notion of polar decomposition from matrix algebra to dual quaternion algebra. The goal is to obtain a simple, efficient and explicit method for determining the polar decompositions (PD) of spatial displacements in Euclidean three-space that belong to a special Euclidean Group known as SE(3). It has been known that such a decomposition is equivalent to the projection of an element of SE(3) onto SO(4) that yields hyper spherical displacements that best approximate rigid-body displacements. It is shown in this paper that a dual quaternion representing an element of SE(3) can be decomposed into a pair of unit quaternions, called double quaternion, that represents an element of SO(4). Furthermore, this decomposition process may be interpreted as the projection of a point in four-dimensional space onto a unit hypersphere. Examples are provided to illustrate that the results obtained from this dual-quaternion based polar decomposition are same as those obtained from the matrix based polar decomposition.
APA, Harvard, Vancouver, ISO, and other styles
4

Rich, Kathryn M., T. Andrew Binkowski, Carla Strickland, and Diana Franklin. "Decomposition." In ICER '18: International Computing Education Research Conference. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3230977.3230979.

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

Emura, Satoru, and Noboru Harada. "Sound Field Decomposition Using SPICE Decomposition." In ICASSP 2018 - 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2018. http://dx.doi.org/10.1109/icassp.2018.8461283.

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

Shen, Yan, and Jami J. Shah. "Feature Recognition by Volume Decomposition Using Half-Space Partitioning." In ASME 1994 Design Technical Conferences collocated with the ASME 1994 International Computers in Engineering Conference and Exhibition and the ASME 1994 8th Annual Database Symposium. American Society of Mechanical Engineers, 1994. http://dx.doi.org/10.1115/detc1994-0100.

Full text
Abstract:
Abstract A volume decomposition method called minimum convex decomposition by half space partitioning has been developed to recognize machining features from the boundary representation of the solid model. First, the total volume to be removed by machining is obtained by subtracting the part from the stock. This volume is decomposed into minimum convex cells by half space partitioning at every concave edge. A method called maximum convex cell composition is developed to generate all alternative volume decompositions. The composing sub volumes are classified based on degree of freedom analysis. This paper focuses on the first part of our system, i.e., the volume decomposition. The other part of the work will be submitted for publication at a leter date.
APA, Harvard, Vancouver, ISO, and other styles
7

Chen, Changbo, Marc Moreno Maza, Bican Xia, and Lu Yang. "Computing cylindrical algebraic decomposition via triangular decomposition." In the 2009 international symposium. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1576702.1576718.

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

Otake, Yuki, and Osamu Sakata. "Shunt sound decomposition by empirical mode decomposition." In TENCON 2020 - 2020 IEEE REGION 10 CONFERENCE (TENCON). IEEE, 2020. http://dx.doi.org/10.1109/tencon50793.2020.9293800.

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

Baykara, N. A., and Ercan Gürvit. "Nested Taylor decomposition in multivariate function decomposition." In 10TH INTERNATIONAL CONFERENCE ON MATHEMATICAL PROBLEMS IN ENGINEERING, AEROSPACE AND SCIENCES: ICNPAA 2014. AIP Publishing LLC, 2014. http://dx.doi.org/10.1063/1.4904571.

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

Lodha, Neha, Sebastian Ordyniak, and Stefan Szeider. "A SAT Approach to Branchwidth." 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/689.

Full text
Abstract:
Branch decomposition is a prominent method for structurally decomposing a graph, hypergraph or CNF formula. The width of a branch decomposition provides a measure of how well the object is decomposed. For many applications it is crucial to compute a branch decomposition whose width is as small as possible. We propose a SAT approach to finding branch decompositions of small width. The core of our approach is an efficient SAT encoding which determines with a single SAT-call whether a given hypergraph admits a branch decomposition of certain width. For our encoding we develop a novel partition-based characterization of branch decompositions. The encoding size imposes a limit on the size of the given hypergraph. In order to break through this barrier and to scale the SAT approach to larger instances, we develop a new heuristic approach where the SAT encoding is used to locally improve a given candidate decomposition until a fixed-point is reached. This new method scales now to instances with several thousands of vertices and edges.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Decomposition"

1

Patwardhan, Kedar A., and Guillermo Sapiro. Automatic Image Decomposition. Fort Belvoir, VA: Defense Technical Information Center, February 2004. http://dx.doi.org/10.21236/ada522288.

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

Martin, Olga. Carbon Dioxide Decomposition. Office of Scientific and Technical Information (OSTI), October 2012. http://dx.doi.org/10.2172/1054236.

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

Zhou, Feng, Lijun Yang, Hao-min Zhou, and Lihua Yang. Optimal Averages for Nonlinear Signal Decompositions - Another Alternative for Empirical Mode Decomposition. Fort Belvoir, VA: Defense Technical Information Center, October 2014. http://dx.doi.org/10.21236/ada610276.

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

Ferrizz, Robert Matthew. Erbium hydride decomposition kinetics. Office of Scientific and Technical Information (OSTI), November 2006. http://dx.doi.org/10.2172/897616.

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

Barnes, M. J. Decomposition of Sodium Tetraphenylborate. Office of Scientific and Technical Information (OSTI), November 1998. http://dx.doi.org/10.2172/4971.

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

Slepoy, Alexander. Quantum gate decomposition algorithms. Office of Scientific and Technical Information (OSTI), July 2006. http://dx.doi.org/10.2172/889415.

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

Jackson, Daniel, and Michael Jackson. Problem Decomposition for Reuse,. Fort Belvoir, VA: Defense Technical Information Center, January 1995. http://dx.doi.org/10.21236/ada292245.

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

Cao, D. S., C. H. Chen, C. W. Hill, S. H. Li, and G. B. Stringfellow. Decomposition Studies of Tertiarybutyldimethylantimony. Fort Belvoir, VA: Defense Technical Information Center, May 1992. http://dx.doi.org/10.21236/ada250670.

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

Fortin, Nicole, Thomas Lemieux, and Sergio Firpo. Decomposition Methods in Economics. Cambridge, MA: National Bureau of Economic Research, June 2010. http://dx.doi.org/10.3386/w16045.

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

Hanslow, Kevin. A General Welfare Decomposition for CGE Models. GTAP Technical Paper, March 2001. http://dx.doi.org/10.21642/gtap.tp19.

Full text
Abstract:
Huff and Hertel (2001) derive a welfare decomposition for the equivalent variation in the GTAP model. The derivation appears to be very specific to GTAP. Nevertheless, it contains nearly all the ingredients required for performing welfare decomposition for any CGE model. In this paper, the approach of Huff and Hertel (2001) is generalised to derive a welfare decomposition that can be applied to most, if not all, CGE models. General production and utility functions are accommodated, as are foreign income flows. A brief guide to coding the proposed welfare decomposition in GEMPACK is also provided. The decomposition is applied to decomposing the equivalent variation in GTAP.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Decomposition' 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