Factbites
 Where results make sense
About us   |   Why use us?   |   Reviews   |   PR   |   Contact us  

Topic: Combinatory Analysis


Related Topics

In the News (Fri 29 Aug 08)

  
  How is a Genre Created? Five combinatory hypotheses
Although word-frequency distributions are the main focus of the combinatory approach to genre theory, this does not mean that other phenomena are unimportant to genre identification (see the variables discussed in Holmes; De Nooy; Hanauer; Bortolussi and Dixon; Mealand; Zubarev, ).
In consequence, I argue that combinatory genre theory and the proposition of word-frequency distribution may be the only criterion that is necessary for the identification of a genre and thus word frequencies can be used successfully as an indicator of genre.
The combinatory approach stresses the importance of the stimulus and of the audience's (reader, viewer, spectator) who is subject to general mathematical rules from which genre, genre formation, and prototype follow automatically.
clcwebjournal.lib.purdue.edu /clcweb00-2/hoorn1-00.html   (4441 words)

  
  Methods and computer system for combinatorial analysis of lighting phosphors - US Patent 6567751   (Site not responding. Last check: 2007-11-02)
The analysis module is connected directly to the database and the interface; it uses the data from the database, performs analyses according to the user's request received from the interface.
The analysis module 106 of the computer system not only provides the basic computational capacities for calculating the photo-metric properties; it is also capable of performing statistical and other comprehensive data analyses on the attributes and characteristics of the phosphors.
In summary, the integration of the combinatorial hardware instrumentation with the database and analysis modules as provided by the computer system and method according to the preferred embodiments of the present invention increases the efficiency and speed of the combinatorial synthesis and screening process for identifying desired luminescent materials.
www.patentstorm.us /patents/6567751.html   (5352 words)

  
 [No title]
Parsing in CCG is generally construed as the application of a finite set of combinatory rules to the categories licensed by the input and created from previous applications of the rules.
In combination with the analysis of the English subject/object asymmetry by Steedman (1996) and a further analysis in Chapter 7 of asymmetries in Toba Batak, I explicate a cross-linguistic characterization of the appearance of asymmetries.
In the Multi-Modal CCG analysis provided in this dissertation, on the other hand, local permutativity and extractability are not intertwined --- local permutativity is permitted because the arguments of Tagalog's verbal categories are contained in multisets, and the asymmetries arise because of differences in the modes of grammatical composition specified for those arguments (Thesis 2).
www.cs.nott.ac.uk /~nza/beth02/baldridge-abstract   (5694 words)

  
 SICS › About IAM
Currently this includes methods for planning and scheduling, resource allocation and flow optimisation, data analysis, process modelling and monitoring, fault diagnosis and decision support.
This research direction is motivated by the conviction that the science of computation must include the study of practical application of its results.
Analysis and usage optimisation with application in e.g.
www.sics.se /groups/iam/about   (412 words)

  
 Detienne Essay in Cultures and Classics, Vol.1 No.1   (Site not responding. Last check: 2007-11-02)
For structural analysis, that is precisely the principal justification for its practice: because it has defined myth by recurrence and repetition in variation, it has given itself the task of deciphering simultaneously the different versions of a single myth in such a way as to recognize their hidden systems.
The danger of such reconnoitering is to confuse structural analysis with the search for a single structure repeating itself in different contexts, such as the motif of the murderous wife or the theme of the simple opposition between savagery and civilized life.
Yet a structural analysis can show that the strangeness of the Orphic tale disappears when it is confronted with sacrificial procedures, with the fundamental relationship between spit and cauldron, and beyond that with the ensemble of significations the Greeks ascribed to roasting as against boiling food.
www.jhu.edu /cultures/detienne.html   (6837 words)

  
 20th WCP: Dual Identity Combinators
The last section of the paper shows the devastating effect the identity combinators have for a dual system: they half trivialize simple combinatory bases, although they are not sufficient to cause real triviality for what cancellative combinators are needed.
I have retained the parentheses in these axioms to emphasize that the sequences are right associated; certainly, if we would be dealing with a combinatory system containing exclusively dual combinators, then we could introduce a convention that if parentheses are omitted the sequences are understood as associated to the right.
In general, combinatory logics include some primitive terms (variables) which are assumed to be distinct from the combinators (and the compound terms).
www.bu.edu /wcp/Papers/Logi/LogiBimb.htm   (3211 words)

  
 [No title]   (Site not responding. Last check: 2007-11-02)
The model of Applicative and Combinatory Categorial Grammar The model of Applicative and Combinatory Categorial Grammar (ACCG) falls under a paradigm of language analysis that allows a complete abstraction of grammatical structure from its linear representation due to the linearity of the linguistic signs and a complete abstraction of grammar from the lexicon.
The analysis of various relative, completive and indirect interrogative clauses presented here shows that they often share common syntactic structures, and, different nouns were frequently used to identify similar syntactic constructions.
The present study was limited to the analysis of qui and que in French.
www.uqtr.ca /~biskri/Personnel/articles/flairs2004.doc   (2608 words)

  
 IS-lab | Education   (Site not responding. Last check: 2007-11-02)
There is also a smaller part including sequential and combinatory systems with function descriptions and PLC systems.
Image Analysis II A continuation of the Image Analysis I course.
Some of the the concepts in the course are: classification of signals and systems, Filtertheory, Bessel-, Butterworth- and Chebyshevfilters and filter transformations, sampling theorem, FIR- and IIR-filters, spectrum, amplitude- and phasecharacteristics, Analysis of electrical circuits using Fourier- and Laplace transform methods, Convolution.
islab.hh.se /islab/islab/education.html   (325 words)

  
 Côte d'Azur Développement - Information Technology on the French Riviera, France - Public Research Centers
Founded in 1992, CRAM is a federation of establishments that pool their resources to enable public laboratories and private firms to have access to costly microscopy and analysis techniques, and sample preparation techniques.
AXIS (artificial intelligence, data analysis and software engineering) leads researches in the area of information systems, and particularly Web sites, and aims to develop methods and tools used in the design, the analysis and the improvement of these systems.
Research in computational geometry is geared primarily towards the design and analysis of geometric algorithms, from a theoretical or practical standpoint.
www.investincotedazur.com /uk/ti/ti005.htm   (4603 words)

  
 :: PROJETS • Oxydation thermophile et thermogène du méthane dans les environs des décharges de ...
Combined Statistical analysis of bacterial community structures from an eutrophic lake revealed by DGGE, PLFA and chemical analysis.
In this project, we investigated the potential of DGGE analysis for ecological investigations when the results are statistically combined with other measured parameters.
Statistical analysis of the data sets consisted of non-parametric combinatory analysis (such as Mantel tests) and ordination methods (CCA and PCA).
www.unine.ch /bota/lamun/fr/projets/loclat.html   (332 words)

  
 Kristine Vlagsma   (Site not responding. Last check: 2007-11-02)
From 1993 till 1995 she was a Head of Macro-fiscal Analysis and Forecasting division.
Her master theses consisted of a macro and micro level analysis of the financial sector crisis in Latvian Republic between 1991 and 1995.
The related research topics are analysis of consumer value systems as well as the role of motivation in consumer behavior.
www.eco.rug.nl /medewerk/vlagsma/vlagsma.htm   (259 words)

  
 Environmental Suite Technical Specifications
EarthVision can perform volumetric and combinatory analysis (such as 3D risk analysis) and pass summarized data to predictive models (such as flow and transport codes).
The Exploratory Data Analysis (EDA) Tools are used to examine the univariant statistics and bivariant statistics of the z-value (2D) or p-value (3D) of one to two data sets and/or grids.
The analysis of the data (scattered data, property data, 2D grids, and/or 3D grids) is based on graphical presentations of the information.
www.dgi.com /earthvision/techspecs_environ.shtml   (3975 words)

  
 Combinatory Representation of Mobile Processes - Honda, Yoshida (ResearchIndex)
The new combinators are derived from the analysis of the operation called asynchronous name passing, just as the analysis of logical substitution gave rise to the sequential combinators.
A system with seven atoms and fixed interaction rules, but with no notion of prefixing, is introduced, and is shown to be capable of representing input and output prefixes over arbitrary terms in a behaviourally...
The graph only includes citing articles where the year of publication is known.
citeseer.ist.psu.edu /honda94combinatory.html   (643 words)

  
 Nat' Academies Press, Calculating the Secrets of Life: Contributions of the Mathematical Sciences to Molecular Biology ...
An important parameter in the analysis is the effective population size of the group.
Nonetheless, the combinatorial structure of the Ewens sampling formula has recently emerged as a useful approximation to the component counting process of a wide range of combinatorial objects, among them random permutations, random mapping functions, and factorization of polynomials over a finite field.
In conclusion, we have seen that a variety of interesting functionals of the component structure of certain combinatorial processes can be approximated in total variation norm by either those functionals of an independent process or those functionals of the ESF itself.
www.nap.edu /books/0309048869/html/114.html   (6585 words)

  
 THE PALEOLITHIC ARCHAEOLOGY OF WEASEL CAVE
A detailed analysis shows that the many of the characteristics that are vividly displayed in Layers 5-7 also occur in Layers 12-14, where at least some tools were made using the same technological processes.
An unique attribute-based analysis technique called "combinatory analysis", which was developed by Dr. Hidjrati, shows connections between the assemblages from Weasel Cave and those from other cave and open air sites in the area around Kuardzin Mountain, and makes it possible to define a “Kuardzin Culture” from the Middle Paleolithic.
Koetje’s analysis of the spatial patterning in layer 5 was conducted using K-means clustering, and diversity measures.
www.acs.appstate.edu /dept/anthro/new_orleans.html   (2627 words)

  
 MIT Combinatorics Seminar: Guoce Xin   (Site not responding. Last check: 2007-11-02)
In his famous book "Combinatory Analysis" MacMahon introduced partition analysis as a computational method for solving problems of counting solutions to linear Diophantine equations and inequalities, counting lattice points in a convex polytope, and computing Ehrhart quasi-polynomials.
Recent results by (1998) G.E. Andrews and his co-authors, together with their Omega package, which can be used as a tool for solving such problems, will be introduced.
I will present a new approach, which combines the theory of iterated Laurent series and a new algorithm for partial fraction decompositions, and leads to an algorithm, whose running time is much less than that of the Omega package.
www-math.mit.edu /~combin/archive/2004_fall/04_10_06_xin.html   (133 words)

  
 Palmer | The Interpretation of Mycenaean Greek Texts | Book #20403   (Site not responding. Last check: 2007-11-02)
Intended as an introduction to the information contained in the Linear B texts from Mycenaean Greek sites and addressed to the non-specialist, this book provides a selection of the more interesting texts with a full commentary.
Palmer's interpretation is by combinatory analysis in which "the meaning of syllabically written words is circumscribed as far as possible by textual analysis before the lexicon is consulted", rather than the purely etymological method used by earlier scholars, including Ventris.
The results are summarized in Palmer's introduction, which deals with epigraphy, decipherment, and the Mycenaean language together with questions of geography, social structure, economy and religion.
www.powellschicago.com /html/reprints/20403.html   (140 words)

  
 Renaissance of MacMahon’s Partition Analysis: Symbolic Summation at RISC-Linz
In his famous book ‘Combinatory Analysis’ (1916) MacMahon introduced partition analysis as a method in additive number theory for solving problems with constraints in the form of linear diophantine (ie, with integer coefficients) inequalities or equations, respectively.
Omega can be used in various ways: for finding all non-negative integer solutions to a given (homogeneous) linear diophantine system of inequalities or equations, respectively; for deriving closed form representations of multivariate generating functions with linear diophantine constraints on the summation parameters; or as a heuristic tool for combinatorial studies.
The primary interest of the RISC Combinatorics Group is to contribute to this field by the design of new algorithms and by providing prototype implementations in the form of computer algebra packages.
www.ercim.org /publication/Ercim_News/enw50/paule.html   (957 words)

  
 Introduction to Combinatorial Analysis
By Subject > Science and Mathematics > Mathematics > Combinatorial Optimization
This is a text that defines "the number of ways there are of doing some well-defined operation." Covers permutations and combinations associated with elementary algebra, generating functions, the principle of inclusion and exclusion, the cycles of permutations, the theory of distributions, partitions, compositions, trees, and linear graphs; and permutations with restricted position.
Suitable for courses in combinatorial computing and concrete computational complexity.
store.doverpublications.com /0486425363.html   (241 words)

  
 Andrews, Paule, SLC42i   (Site not responding. Last check: 2007-11-02)
In his famous book ``Combinatory Analysis" MacMahon introduced Partition Analysis as a computational method for solving problems in connection with linear homogeneous diophantine inequalities and equations, respectively.
Namely, we show that Partition Analysis can be also used for proving hypergeometric multisum identities.
Our examples range from combinatorial sums involving binomial coefficients, harmonic and derangement numbers to multisums which arise in physics and which are related to the Knuth-Bender theorem.
www.maths.tcd.ie /EMIS/journals/SLC/wpapers/s42paule.html   (102 words)

  
 TRIP   (Site not responding. Last check: 2007-11-02)
This two-day course is designed to provide hands-on experience on multimedia localization, which involves video and audio editing, management of image and sound subordinate interaction, translation of computer interactive language and hypertextual combinatory translation.
It will focus on the way the correlated and interactive information of multimedia requires from the translator a series of abilities concerning spatial reasoning, combinatory analysis and a visual sense of time and space.
The workshop will provide an overview of the multimedia localization process, with special attention to the specific professional requirements for the translator of multimedia works.
trip.binghamton.edu /Summer04.html   (289 words)

  
 Combinatory Analysis
These texts offer mathematicians and students an account of the theorems in combinatory analysis, showing their connections and bringing them together as parts of a general doctrine.
Classic work on analysis and design of finite processes for approximating solutions of analytical problems.
Introductory text surveys, among other topics, the theory of permutations and combinations associated with elementary algebra, the principle of inclusion and exclusion, and the theory of distributions and partitions in cyclic representation.
www.doverdirect.com /0486495868.html   (148 words)

  
 The Abstract   (Site not responding. Last check: 2007-11-02)
In his famous book "Combinatory Analysis" MacMahon introduced Partition Analysis ("Omega Calculus") as a computational method for solving problems in connection with linear diophantine inequalities and equations.
The technique has recently been given a new life by G.E. Andrews and his coauthors, who had the idea of marrying it with the tools of to-day's Computer Algebra.
Since the program efficiency is a persisting problem in several-variable polynomial Calculus, we did our best to make the algorithm as fast as possible.
www.combinatorics.net /aoc/toc/v7n4/Han/Han.htm   (185 words)

  
 The Abstract   (Site not responding. Last check: 2007-11-02)
MIn his famous book "Combinatory Analysis"MacMahon introduced Partition Analysis as a computational method for solving combinatorial problems in connection with systems of linear diophantine inequalities and equations.
By developing the omega package we have shown that Partition Analysis is ideally suited for being supplemented by computer algebra methods.
In order to make this article as self-contained as possible we give a brief introduction to Partition Analysis together with a variety of illustrative examples.
www.combinatorics.net /aoc/toc/V5n3-4/Andrews/Andrew.htm   (172 words)

  
 TOPPS Bibliography
Combinatory Reduction Systems with Explicit Substitution that Preserve Strong Normalisation.
Program Analysis and Specialization for the C Programming Language.
Binding-Time Analysis and the Taming of C Pointers.
www.diku.dk /forskning/topps/bibliography/bibl-lib.html   (3149 words)

  
 Formal Analysis of Single WAIT VHDL processes for Semantic Based Synthesis
Ultimately a set of equations is extracted, and a formal analysis is performed on all cyclic VHDL symbol assignments.
The analysis of the support of the assigned signal or variable and the sensitivity list of the corresponding process, as shown below, allows us to classify each signal or variable into three distinct classes : un-synthesizable assignment, noncyclic combinatorial assignment and cyclic combinatorial assignment.
This is done by the analysis of the cyclic and noncyclic data equations attached to the Petri Net, taking into account the sensitivity list of the process.
www-asim.lip6.fr /~ludo/ludo/vlsi99   (3882 words)

  
 Journal of the American Mathematical Society
D. Bressoud, Analytic and combinatorial generalizations of the Rogers-Ramanujan identities, Memoirs Amer.
B. Gordon, A combinatorial generalization of the Rogers-Ramanujan identities, Amer.
L. Rogers, On two theorems of combinatory analysis and some allied identities, Proc.
www.ams.org /jams/1999-12-03/S0894-0347-99-00297-0/home.html   (584 words)

  
 Combinatory Analysis av Percy Alexander Macmahon - 0486495868 - Internetbokhandeln.se
Combinatory Analysis av Percy Alexander Macmahon - 0486495868 - Internetbokhandeln.se
Det finns inga recensioner av Combinatory Analysis än.
FÖR DIG SOM TITTAR PÅ BOKEN Combinatory Analysis, SE ÄVEN
www.internetbokhandeln.se /bok.html?isbn=0486495868   (60 words)

Try your search on: Qwika (all wikis)

Factbites
  About us   |   Why use us?   |   Reviews   |   Press   |   Contact us  
Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.