1 |
Quelques problèmes combinatoires sur l'hypercube et les graphes de HammingMollard, Michel. Laborde, Jean-Marie. Benzaken, Claude. Payan, Charles. January 2008 (has links)
Reproduction de : Thèse d'Etat : sciences : Grenoble 1 : 1989. / Titre provenant de l'écran-titre.
|
2 |
An Analysis of E-learning Innovation and Impact using a Hypercube ModelLee, Ying-hua 13 July 2005 (has links)
This study utilizes an electronic learning (E-learning) innovation model to analyze the differences in technological knowledge, learning service delivery model and impact on the stakeholders. The results indicated that the innovation from traditional classroom learning to E-learning is radical for learner and instructor, leading to drastic changes in the technology knowledge and learning related service delivery model. Thereafter, the critical impacts of e-learning innovations on the stakeholders are identified.
|
3 |
An investigation of super line graphs of hypercubesVasquez, Maria Rosario January 1993 (has links)
Graphs, as mathematical objects, play a dominant role in the study of network modeling, VLSI design, data structures, parallel computation, process scheduling and in a variety of other areas of computer science. Hypercubes are one of the preferred architectures for parallel computation, and a study of some properties of the hypercubes motivated this thesis.The concept of super line graphs, introduced by Bagga at el, generalizes the notion of line graphs. In this thesis several graph theoretic properties of super line graphs of hypercubes are studied. In particular the super line graphs of index two of hypercubes are investigated and some exact results and precise characterizations are found. / Department of Computer Science
|
4 |
New classes of multivariate gamma survival and reliability modelsDiawara, Norou Dini, Carpenter, Mark. January 2006 (has links) (PDF)
Dissertation (Ph.D.)--Auburn University, 2006. / Abstract. Vita. Includes bibliographic references.
|
5 |
Algorithms for the identification of maximal fault-free paths and cycles in faulty hypercubes /Fisher, Jennette Caryl, January 2008 (has links)
Thesis (M.A.) -- Central Connecticut State University, 2008. / Thesis advisor: Nelson Castañeda. "... in partial fulfillment of the requirements for the degree of Master of Arts in Mathematical Sciences." Includes bibliographical references (leaf 32). Also available via the World Wide Web.
|
6 |
Permutation Routing in the Hypercube and Grid TopologiesCarnes, Tim Alan 01 May 2005 (has links)
The problem of edge disjoint path routing arises from applications in distributed memory parallel computing. We examine this problem in both the directed hypercube and two-dimensional grid topologies. Complexity results are obtained for these problems where the routing must consist entirely of shortest length paths. Additionally, approximation algorithms are presented for the case when the routing request is of a special form known as a permutation. Permutations simply require that no vertex in the graph may be used more than once as either a source or target for a routing request. Szymanski conjectured that permutations are always routable in the directed hypercube, and this remains an open problem.
|
7 |
Eléments finis stochastiques : approches intrusive et non intrusive pour des analyses de fiabilitéBerveiller, Marc. Lemaire, Maurice. January 2008 (has links)
Reproduction de : Thèse de doctorat : génie mécanique : Clermont Ferrand 2 : 2005. / Thèse avec annexes. Titre provenant de l'écran titre. Bibliogr. p.146-153.
|
8 |
Cosmographic Origins for a New ClassicismPliam, Steven L. 10 February 2006 (has links)
The spirit of the Latin 'classicus' as a broad ideology has in one sense existed through every age of modern human history. It could begin to be described as an attitude that is resistant to sudden change and is not interested in dramatic breaks with tradition or the avant garde. It embraces the methodical evolution of aesthetic and artistic values that are connected at their origin to a cosmography which is conceived within every given age. This large-scale conception of existence which encompasses all of what is known in the cosmos is a primary manifestation of every culture.
Several systems of ideas are given by 20th century theoretical physics. They are the foundation of our science and provide an explicit basis for all branches of scientific endeavor. Taken as a whole, they constitute the current understanding of our universe--our world. What emerges from the ideas given by relativity theory, quantum physics, string theory, and the mathematics of astro-physics is a profound and far reaching cosmography resembling nothing like that of the Renaissance or of classical Greece. Non-Euclidean geometry and the math of higher dimensional space begin to break free of their abstract character as these symbolic disciplines now inform and reconcile the reality of cosmic space.
It is therefore appropriate to understand the cosmography of today in relation to the new science paradigm. As cosmic space and conceptual space have always been intimately connected in architecture of the classical spirit, this new cosmography then becomes a viable basis for reestablishing a classical expression. / Master of Architecture
|
9 |
Parallel computation of fast Fourier transformsKhan, Aman Ullah January 1991 (has links)
No description available.
|
10 |
A linear equation model for a family of interconnection networksLarson, Shawn M. 04 May 1995 (has links)
The most important part of parallel computation is communication. Except in the most embarassingly parallel examples, processors cannot work cooperatively to solve a problem unless they can communicate. One way to solve the problem of communication is to use an interconnection network. Processors are located at nodes of the network, which are joined by communication channels. Desirable aspects of an interconnection network include low maximum and average routing distances (as measured in the number of communication channels crossed), a large number of processors, and low number of communication channels per processor.
A number of published networks are created from the hypercube by rearranging the hypercube's communication links in a systematic way [23] [28] [30] [33] [50]. These networks maintain the same number of processors, communication links, and links per processor as the hypercube, but have dramatically smaller maximum and average routing distances.
This thesis derives one formal mathematical description for this family of networks. This formal description is used to derive graph-theoretic properties of existing networks, and to design new networks. The description is also used to design generalized routing and other communications algorithms for these networks, and to show that these networks can embed and simulate other standard networks, for instance, ring and mesh networks.
A network simulator is used to model the dynamic behavior of this family of networks under both store-and-forward and wormhole routing strategies for message-passing. The simulation results are used to study and compare the networks' behavior under various message-passing loads, and to determine what properties are desirable in a network that exists in this model. / Graduation date: 1995
|
Page generated in 0.0453 seconds