Dissertationen zum Thema „Projective code“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "Projective code" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
Qian, Liqin. „Contributions to the theory of algebraic coding on finite fields and rings and their applications“. Electronic Thesis or Diss., Paris 8, 2022. http://www.theses.fr/2022PA080064.
Der volle Inhalt der QuelleAlgebraic coding theory over finite fields and rings has always been an important research topic in information theory thanks to their various applications in secret sharing schemes, strongly regular graphs, authentication and communication codes.This thesis addresses several research topics according to the orientations in this context, whose construction methods are at the heart of our concerns. Specifically, we are interested in the constructions of optimal codebooks (or asymptotically optimal codebooks), the constructions of linear codes with a one-dimensional hull, the constructions of minimal codes, and the constructions of projective linear codes. The main contributions are summarized as follows. This thesis gives an explicit description of additive and multiplicative characters on finite rings (precisely _\mathbb{F}_q+u\mathbb{F}_q~(u^2= 0)s and S\mathbb{F}_q+u\mathbb{F}_q~(u^2=u)S), employees Gaussian, hyper Eisenstein and Jacobi sums and proposes several classes of optimal (or asymptotically optimal) new codebooks with flexible parameters. Next, it proposes(optimal or nearly optimal) linear codes with a one-dimensional hull over finite fields by employing tools from the theory of Gaussian sums. It develops an original method to construct these codes. It presents sufficient conditions for one-dimensional hull codes and a lower bound on its minimum distance. Besides, this thesis explores several classes of (optimal for the well-known Griesmer bound) binary linear codes over finite fields based on two generic constructions using functions. It determines their parameters and weight distributions and derives several infinite families of minimal linear codes. Finally, it studies (optimal for the sphere packing bound) constructions of several classes of projective binary linear codes with a few weight and their corresponding duals codes
Patraucean, Viorica. „Detection and identification of elliptical structure arrangements in images : theory and algorithms“. Thesis, Toulouse, INPT, 2012. http://www.theses.fr/2012INPT0020/document.
Der volle Inhalt der QuelleThis thesis deals with different aspects concerning the detection, fitting, and identification of elliptical features in digital images. We put the geometric feature detection in the a contrario statistical framework in order to obtain a combined parameter-free line segment, circular/elliptical arc detector, which controls the number of false detections. To improve the accuracy of the detected features, especially in cases of occluded circles/ellipses, a simple closed-form technique for conic fitting is introduced, which merges efficiently the algebraic distance with the gradient orientation. Identifying a configuration of coplanar circles in images through a discriminant signature usually requires the Euclidean reconstruction of the plane containing the circles. We propose an efficient signature computation method that bypasses the Euclidean reconstruction; it relies exclusively on invariant properties of the projective plane, being thus itself invariant under perspective
Caullery, Florian. „Polynomes sur les corps finis pour la cryptographie“. Thesis, Aix-Marseille, 2014. http://www.theses.fr/2014AIXM4013/document.
Der volle Inhalt der QuelleFunctions from F_q to itself are interesting objects arising in various domains such as cryptography, coding theory, finite geometry or algebraic geometry. It is well known that these functions admit a univariate polynomial representation. There exists many interesting classes of such polynomials with plenty of applications in pure or applied maths. We are interested in three of them: Almost Perfect Nonlinear (APN) polynomials, Planar (PN) polynomials and o-polynomials. APN polynomials are mostly used in cryptography to provide S-boxes with the best resistance to differential cryptanalysis and in coding theory to construct double error-correcting codes. PN polynomials and o-polynomials first appeared in finite geometry. They give rise respectively to projective planes and ovals in P^2(F_q). Also, their field of applications was recently extended to symmetric cryptography and error-correcting codes.A complete classification of APN, PN and o-polynomials is an interesting open problem that has been widely studied by many authors. A first approach toward the classification was to consider only power functions and the studies were recently extended to polynomial functions.One way to face the problem of the classification is to consider the polynomials that are APN, PN or o-polynomials over infinitely many extensions of F_q, namely, the exceptional APN, PN or o-polynomials.We improve the partial classification of exceptional APN and PN polynomials and give a full classification of exceptional o-polynomials. The proof technique is based on the Lang-Weil bound for the number of rational points in algebraic varieties together with elementary methods
Wong, Chee Heng. „Aerodynamic analysis of M33 projectile using the CFX code“. Monterey, California. Naval Postgraduate School, 2011. http://hdl.handle.net/10945/10711.
Der volle Inhalt der QuelleSt, George Julia. „Visual codes of secrecy photography of death and projective identification /“. Access electronically, 2005. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20060608.143049/index.html.
Der volle Inhalt der QuelleWu, Junhua. „Geometric structures and linear codes related to conics in classical projective planes of odd orders“. Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 105 p, 2009. http://proquest.umi.com/pqdweb?did=1654490971&sid=2&Fmt=2&clientId=8331&RQT=309&VName=PQD.
Der volle Inhalt der QuelleHuang, Jen-Fa. „On finding generator polynomials and parity-check sums of binary projective geometry codes“. Thesis, University of Ottawa (Canada), 1985. http://hdl.handle.net/10393/4800.
Der volle Inhalt der QuelleChu, Lei. „Colouring Cayley Graphs“. Thesis, University of Waterloo, 2005. http://hdl.handle.net/10012/1125.
Der volle Inhalt der QuellePassuello, Alberto. „Semidefinite programming in combinatorial optimization with applications to coding theory and geometry“. Phd thesis, Université Sciences et Technologies - Bordeaux I, 2013. http://tel.archives-ouvertes.fr/tel-00948055.
Der volle Inhalt der QuelleAlshawish, H. M. M. „3-D object classification using space-time coded light projection“. Thesis, University of Newcastle Upon Tyne, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.336757.
Der volle Inhalt der QuelleBauer, Karl Gregory. „Projection based image restoration, super-resolution and error correction codes“. Diss., The University of Arizona, 1999. http://hdl.handle.net/10150/284043.
Der volle Inhalt der QuelleOgrahn, Fredrik, und August Wande. „Automatiserade regressionstester avseende arbetsflöden och behörigheter i ProjectWise. : En fallstudie om ProjectWise på Trafikverket“. Thesis, Högskolan Dalarna, Informatik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:du-23290.
Der volle Inhalt der QuelleSoftware testing is done in order to see whether the system meets specified requirements and to find bugs. It is an important part of system development and involves, among other things, regression testing. Regression tests are performed to ensure that a change in the system does not affect other parts of the system adversely. Document management systems often deals with sensitive data for organizations, which place high demands on safety. Permissions in the system has to be tested thoroughly to ensure that data does not fall into the wrong hands. Document management systems make it possible for organizations to pool their resources and knowledge together to achieve common goals. Common work processes are supported through workflows that contains a variety of states. These different permissions apply to different states. When a permission changes regression tests are required to ensure that the changes has not made an impact on other permissions. This study was conducted as a qualitative case study whose purpose was to describe the challenges of regression testing of roles and permissions in document workflows in a document management system. Through interviews and an observation it emerged that the major challenges of these tests is that workflow states follow a predetermined sequence. To complete this sequence, a huge amount of permissions must be tested. This provides a very extensive test work that is time consuming and costly. The study was directed toward the document management system ProjectWise, managed by Trafikverket. Supporting documentation for decision making was produced for a technical solution for automated regression testing of roles and permissions in workflows for ProjectWise. Based on a requirement gathering decision-making was provided that involved the Team Foundation Server (TFS), Coded UI and a keyword-driven test method for a technical solution. Finally, a comparison was made of differences in the technical solution versus today's manual testing. Based on literature, document studies and first hand experiences, test automation provides differences in a number of problem areas, including time and cost.
Bevilacqua, Francesca. „Projection and reconstruction-based noise filtering methods in cone beam CT“. Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019.
Den vollen Inhalt der Quelle findenBaratov, Rishat. „Efficient conic decomposition and projection onto a cone in a Banach ordered space“. Thesis, University of Ballarat, 2005. http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/61401.
Der volle Inhalt der QuelleChen, Mingqing. „Development of a diaphragm tracking algorithm for megavoltage cone beam CT projection data“. Thesis, University of Iowa, 2009. https://ir.uiowa.edu/etd/228.
Der volle Inhalt der QuelleMueller, Klaus. „Fast and accurate three-dimensional reconstrution from cone-beam projection data using algebraic methods /“. The Ohio State University, 1998. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487950658545496.
Der volle Inhalt der QuelleChavez, Daniel. „Parallelizing Map Projection of Raster Data on Multi-core CPU and GPU Parallel Programming Frameworks“. Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-190883.
Der volle Inhalt der QuelleKartprojektioner är en central del av geografiska informationssystem och en otalig mängd av kartprojektioner används idag. Omprojiceringen mellan olika kartprojektioner sker regelbundet i ett geografiskt informationssystem och den kan parallelliseras med flerkärniga CPU:er och GPU:er. Denna masteruppsats implementerar en parallel och analytisk omprojicering av rasterdata i C/C++ med ramverken Pthreads, C++11 STL threads, OpenMP, Intel TBB, CUDA och OpenCL. Uppsatsen jämför de olika implementationernas exekveringstider på tre rasterdata av varierande storlek, där OpenMP hade bäst speedup på 6, 6.2 och 5.5. GPU-implementationerna var 293 % snabbare än de snabbaste CPU-implementationerna, där profileringen visar att de senare spenderade mest tid på trigonometriska funktioner. Resultaten visar att GPU:n är bäst lämpad för omprojicering av rasterdata, medan OpenMP är den snabbaste inom CPU ramverken.
Belloni, Sofia. „Implementazione in linguaggio C++ in versione ottimizzata del tool Reconstruction and Visualization from a Single Projection (ReViSP)“. Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/24301/.
Der volle Inhalt der QuelleStaub, David. „Time dependent cone-beam CT reconstruction via a motion model optimized with forward iterative projection matching“. VCU Scholars Compass, 2013. http://scholarscompass.vcu.edu/etd/3092.
Der volle Inhalt der QuelleEichert, Pascale. „Etude de l'écoulement gazeux, au sein et à l'extérieur d'une torche de projection à plasma d'arc soufflé, à l'aide du code PHOENICSTm“. Besançon, 1996. http://www.theses.fr/1996BESA2063.
Der volle Inhalt der QuelleThe present work was devoted to the modeling of flows of plasma jets often used within the D. C. Plasma spraying technology by implementation of the CFD PHOENICSTm code. The definition of the different parameters of the study was made through the literature search, for example concerning the assumptions, the studied domain, the boundary conditions and the gas mixtures properties. The flow modelling, from the cold gases injection into the torch to the plasma ejection, not necessitates the use of equations of chemical species conservation because of the chemical equilibrium assumption which permits to use data from the literature where the thermodynamic data and the transport coefficients have been calculated from the chemical composition of gas mixtures and are given in function of the temperature and for the atmospheric pressure. The conservation equations are discretized by a finite volume approach and the non-linear and coupled set of algebraic equations is solved using the SIMPLEST algorithm implemented into the code. The comparison of the results with data from the literature shows a good agreement for the flow prediction of plasma jets. The model is applied to the study of the electric power value influence on the flow. The free thermal subsonic jets characteristics (temperature and velocity) are compared to observations taken from the literature. The study of the ambient gas entrainment gives a complementary information. The difficulty of approximation of the radial profiles at the torch exit by simple relationships is also put into evidence
Gillies, Peter. „'Poems to the Sea', and, Painterly poetics : Charles Olson, Robert Creeley, Cole Swensen“. Thesis, University of Plymouth, 2016. http://hdl.handle.net/10026.1/5225.
Der volle Inhalt der QuelleSunnegårdh, Johan. „Combining analytical and iterative reconstruction in helical cone-beam CT“. Licentiate thesis, Computer Vision, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-8286.
Der volle Inhalt der QuelleContemporary algorithms employed for reconstruction of 3D volumes from helical cone beam projections are so called non-exact algorithms. This means that the reconstructed volumes contain artifacts irrespective of the detector resolution and number of projection angles employed in the process. In this thesis, three iterative schemes for suppression of these so called cone artifacts are investigated.
The first scheme, iterative weighted filtered backprojection (IWFBP), is based on iterative application of a non-exact algorithm. For this method, artifact reduction, as well as spatial resolution and noise properties are measured. During the first five iterations, cone artifacts are clearly reduced. As a side effect, spatial resolution and noise are increased. To avoid this side effect and improve the convergence properties, a regularization procedure is proposed and evaluated.
In order to reduce the cost of the IWBP scheme, a second scheme is created by combining IWFBP with the so called ordered subsets technique, which we call OSIWFBP. This method divides the projection data set into subsets, and operates sequentially on each of these in a certain order, hence the name “ordered subsets”. We investigate two different ordering schemes and number of subsets, as well as the possibility to accelerate cone artifact suppression. The main conclusion is that the ordered subsets technique indeed reduces the number of iterations needed, but that it suffers from the drawback of noise amplification.
The third scheme starts by dividing input data into high- and low-frequency data, followed by non-iterative reconstruction of the high-frequency part and IWFBP reconstruction of the low-frequency part. This could open for acceleration by reduction of data in the iterative part. The results show that a suppression of artifacts similar to that of the IWFBP method can be obtained, even if a significant part of high-frequency data is non-iteratively reconstructed.
Sunnegårdh, Johan. „Iterative Enhancement of Non-Exact Reconstruction in Cone Beam CT“. Thesis, Computer Vision, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2577.
Der volle Inhalt der QuelleContemporary algorithms employed for reconstruction of 3D volumes from helical cone beam projections are so called non-exact algorithms. This means that the reconstructed volumes will contain artifacts irrespective of the detector resolution and number of projections angles employed in the process.
It has been proposed that these artifacts can be suppressed using an iterative scheme which comprises computation of projections from the already reconstructed volume as well as the non-exact reconstruction itself.
The purpose of the present work is to examine if the iterative scheme can be applied to the non-exact reconstruction method PI-original in order to improve the reconstruction result. An important part in this implementation is a careful design of the projection operator, as a poorly designed projection operator may result in aliasing and/or other artifacts in the reconstruction result. Since the projection data is truncated, special care must be taken along the boundaries of the detector. Three different ways of handling this interpolation problem is proposed and examined.
The results show that artifacts caused by the PI-original method can indeed be reduced by the iterative scheme. However, each iteration requires at least three times more processing time than the initial reconstruction, which may call for certain compromises, smartness and/or parallelization in the innermost loops. Furthermore, at higher cone angles certain types of artifacts seem to grow by each iteration instead of being suppressed.
Pokhrel, Damodar. „Brachytherapy Seed and Applicator Localization via Iterative Forward Projection Matching Algorithm using Digital X-ray Projections“. VCU Scholars Compass, 2010. http://scholarscompass.vcu.edu/etd/2283.
Der volle Inhalt der QuelleBenremdane, Ahmed. „La projection de la culture marocaine dans "Makbara" et "Reivindicacion del conde Don Julian" de Juan Goytisolo : un dialogue avec l'Espagne“. Montpellier 3, 1986. http://www.theses.fr/1986MON30027.
Der volle Inhalt der QuelleThe aim of the thesis shows to what extent the spanish novelist juan goytisole, has been able to use in his recent novels especially in "la reivindicacion" and "makbara" the moroccan culture with a view to destroy on one hand, the myth of the "sacred spain" and on the other, to reveal the disadvantages of the europeean capitalism. The thesis contains three principal parts: the first part deals with the anthor's closeness to the arabic his reflexions upon the spanish arabism and problems that the moroccan culture faces. The interest of the author in morocco and in the moroccan culture is the main theme in the second part. The third part is related to the image of arabie in the western society, the author has indeed chosen moroccan characters with the intention to erase the bad picture given to arabic by the west. The fourth part is related to the lexicon of the arabic origin including a great deal or arabism and the use of the moroccan dialect in the two novels
Couvreur, Alain. „Résidus de 2-formes différentielles sur les surfaces algébriques et applications aux codes correcteurs d'erreurs“. Phd thesis, Université Paul Sabatier - Toulouse III, 2008. http://tel.archives-ouvertes.fr/tel-00376546.
Der volle Inhalt der QuelleAlmazmomi, Afnan. „Likelihood Inference for Order Restricted Models“. Digital WPI, 2018. https://digitalcommons.wpi.edu/etd-theses/355.
Der volle Inhalt der QuelleDudin, Bashar. „Compactification ELSV des champs de Hurwitz“. Thesis, Grenoble, 2013. http://www.theses.fr/2013GRENM059.
Der volle Inhalt der QuelleWe study a compactification, due to Ekedahl, Lando, Shapiro and Vainshtein, of the stack of smooth curves endowed with meromorphic functions having fixed orders. The original compactification is obtained as the closure of the initial stack in a proper substack. We start by giving two alternative constructions of the E.L.S.V compactification and by studying the deformation theory of its points. We finally link it to the Harris-Mumford compactification by admissible covers and give a modular interpretation of boundary points
Couderc, Frédéric. „Développement d'un code de calcul pour la simulation d'écoulements de fluides non miscibles : application à la désintégration assistée d'un jet liquide par un courant gazeux“. Phd thesis, Ecole nationale superieure de l'aeronautique et de l'espace, 2007. http://tel.archives-ouvertes.fr/tel-00143709.
Der volle Inhalt der QuelleLes choix des hypothèses physiques et des schémas numériques associés ont été fait afin de respecter au mieux la physique complexe de brisure d'un jet liquide. La résolution des équations de Navier-Stokes incompressibles est faite de façon directe par le biais d'une méthode de projection. La méthode naissante et prometteuse Level-Set assure quant à elle le suivi numérique de la surface de séparation entre deux fluides non miscibles. Enfin, la méthode Ghost Fluid permet un traitement correct des discontinuités à la traversée de l'interface en préservant au niveau discret les conditions de saut entre équilibre des forces de capillarité, de pression et de viscosité. Les bonnes aptitudes de tels schémas numériques sont montrées à travers une batterie de cas tests académiques.
Les mécanismes physiques mis en jeu lors de l'atomisation primaire d'un jet liquide ont fait l'objet de nombreuses études théoriques et expérimentales. Les instabilités se développant à la surface du liquide sont multiples et clairement tridimensionnelles. Actuellement et malgré beaucoup d'efforts de recherche, aucune théorie ou modèle ne rend compte rigoureusement de ce phénomène. Or, il est montré que l'outil numérique peut apporter une lumière nouvelle. Par exemple, l'impact de la couche limite gazeuse sur la fréquence d'oscillation est étudié. Nous avons également pu retrouver par la simulation la dynamique ligamentaire intrinsèque à la désintégration assistée d'un jet liquide.
Deltour, Guillaume. „Propriétés symplectiques et hamiltoniennes des orbites coadjointes holomorphes“. Phd thesis, Université Montpellier II - Sciences et Techniques du Languedoc, 2010. http://tel.archives-ouvertes.fr/tel-00552150.
Der volle Inhalt der QuelleBeaudry, Joel. „4D cone-beam CT image reconstruction of Varian TrueBeam v1.6 projection images for clinical quality assurance of stereotactic ablative radiotherapy to the lung“. Thesis, University of British Columbia, 2015. http://hdl.handle.net/2429/52814.
Der volle Inhalt der QuelleScience, Faculty of
Physics and Astronomy, Department of
Graduate
Hrouza, Ondřej. „LDPC kódy“. Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2012. http://www.nusl.cz/ntk/nusl-219786.
Der volle Inhalt der QuelleDias, Guilherme dos Santos Martins. „Códigos projetivos parametrizados“. Universidade Federal de Uberlândia, 2017. https://repositorio.ufu.br/handle/123456789/18286.
Der volle Inhalt der QuelleEste trabalho tem como objetivo estudar os parametros de um codigo projetivo gerado por um conjunto algebrico torico X que e parametrizado por uma quantidade nita de monomios em varias variaveis. Tambem podemos obter conjuntos algebricos toricos associados a matrizes de incidencia de grafos e cluters, e nestes casos obtemos resultados mais precisos, ja que os conjuntos algebricos toricos obtidos sao parametrizados por monomios com mesmo grau. Nos capitulos iniciais sao apresentados os conceitos basicos que servirao de ferramentas para atingir estes objetivos.
This work aims at studying the parameters of a projective code generated by an algebraic toric set X which is parameterized by a nite number of monomials in several variables. We also can obtain algebraic toric sets associated to graph or clutter incidence matrices and in these cases we obtain more precise results since the algebraic toric sets which are obtained are parameterized by monomials of the same degree. In the rst chapters we introduce basic concepts which will serve as tools to reach our aim.
Dissertação (Mestrado)
Laviole, Jérémy. „Interaction en réalité augmentée spatiale pour le dessin physique“. Phd thesis, Université Sciences et Technologies - Bordeaux I, 2013. http://tel.archives-ouvertes.fr/tel-00935602.
Der volle Inhalt der QuelleMazade, Marc. „Ensembles localement prox-réguliers et inéquations variationnelles“. Thesis, Montpellier 2, 2011. http://www.theses.fr/2011MON20141.
Der volle Inhalt der QuelleThe properties of locally prox-regular sets have been studied by R.A. Poliquin, R.T. Rockafellar and L. Thibault. R.A. Poliquin also introduced the concept of ``primal lower nice function. This dissertation is devoted, on one hand to the study of primal lower nice functions and locally prox-regular sets and, on the other hand, to show existence and uniqueness of solutions of differential variational inequalities involwing such sets. Concerning the first part, we introduce a quantified viewpoint of local-prox-regularity and establish a series of characterizations for set satisfying this property. In the second part, we study differential variational inequalities with locally prox-regular sets and we show the relevance of our quantified viewpoint to prove existence results of solutions
Zamora, i. Mestre Joan-Lluís. „Proposta de codi normalitzat per a la representació gràfica de la tecnologia de la construcció“. Doctoral thesis, Universitat Politècnica de Catalunya, 1995. http://hdl.handle.net/10803/6120.
Der volle Inhalt der QuelleAdemás la progresiva incorporación de la tecnología informática abre nuevas posibilidades de tratamiento de la información. Resulta pertinente reflexionar ahora sobre las bases de la representación gráfica de la tecnología de la construcción arquitectónica con el fin que las nuevas tecnologías no se conviertan en puros instrumentos de edición sino que se concentren en dar servicio a las necesidades de la elaboración y comunicación de la información.
El concepto de código normalizado intenta ir más allá y se refiere a un procedimiento lingüístico normalizado: cuales son las letras, las palabras y las frases del discurso gráfico del proyecto atendiendo a los contenidos tecnológicos básicos de la edificación que hay que comunicar:
1 Situación y disposición de cada elemento constructivo
2 Forma i dimensiones de cada elemento constructivo
3 Situación y disposición de los materiales y productos dentro del elemento constructivo
4 Forma y dimensiones de cada material o producto constructivo
5 Condiciones de borde interior
6 Condiciones de borde exterior
Sin embargo también es cierto que nunca se dibuja todo, sino solo aquello que no es habitual, que está sometido a control externo o que forma parte de las propias competencias.
La representación gráfica del proyecto ejecutivo tiene dos claras vertientes: una vertiente introspectiva puesto que el proyectista realiza a través del dibujo técnico un proceso interior, consigo mismo y sus compañeros de equipo, de toma de decisiones siguiendo un camino de reducción de incertidumbres. Una vertiente externa, puesto que al final el proyecto se convierte simultáneamente en un gran libro de instrucciones que contiene dos relatos: uno referente al proceso de ejecución y otro referente al propio comportamiento fisiológico y funcional del futuro edificio.
INDICIOS DE CALIDAD
La normativa europea no ha desarrollado profundamente estos temas y solo existen ciertas convenciones gráficas y de formato impulsadas por algunos organismos de control. Existe poco debate entorno al contenido informativo del proyecto y su forma de procesamiento, incluso entre los organismo de visado y ayuntamientos que cada día verifican, en parte, multitud de proyectos.
Además esta tesis cubre un vacío docente puesto que las asignaturas de expresión gráfica no tienen oportunidad de entrar a tratar estos temas que están en el núcleo del ejercicio profesional.
Aún cuando el contenido reflexivo y analítico de esta tesis era alto tampoco se pretendía que finalizara en un manual de procedimiento para los estudiantes de arquitectura. Sin embargo el director de la tesis, Don Jaime Avellaneda Diaz-Grande insistió en que se verificaran las hipótesis y soluciones apuntadas por lo cual se decidió "redibujar" todo un proyecto ejecutivo ya existente, de acuerdo con las directrices emanadas de la tesis.
Se trata pues de una tesis doctoral sólida y una aportación original al conocimiento sobre la cual se pueden elaborar en el futuro otras tesis sobre aspectos que la tecnología informática ya está ofreciendo : representaciones 3D, dibujos dinámicos, uso del color, adjunción de archivos de sonido, etc.
This thesis left from the establishment on the part of the author who all the technical content of an architecture project is spilled mainly in its graphical documentation. Nevertheless this documentation suffers from many defects as much from the point of view of its elaboration (what it is drawn, how it is drawn in a architectural team , where and how is drawn) like from the point of view of its communicative result (errors of understanding, incorporation of dynamic processes, etc.)
In addition the progressive incorporation to the computer science technology opens new possibilities of data processing. It turns out pertinent to reflect now on the bases of the graphical representation of the technology of the architectonic construction with the aim that the new technologies do not become pure edition instruments but that are concentrated in giving to service to the necessities of the elaboration and communication of the information.
The concept of standardized code tries to go beyond and it talks about a standardized linguistic procedure: as they are the letters, the words and the phrases of the graphical speech of the project taking care of basic the technological contents of the construction that there is to communicate:
1 Situation and disposition of each constructive element
2 Form and dimensions of each constructive element
3 Situation and disposition of the materials and products within the constructive element
4 Form and dimensions of each material or constructive product
5 Conditions of inner edge
6 Conditions of outer edge
Nevertheless also it is certain that everything is never drawn, but single what is not habitual, that is put under external control or that comprises of the own competitions.
The graphical representation of the executive project knows two clearly slopes: a introspectiva slope since the designer makes through technical drawing an inner process, with itself and its teammates, of decision making following a way of reduction of uncertainties. An external slope, since in the end the project becomes simultaneously a great book of instructions that contains two stories: one referring to the execution process and another referring one to the own physiological and functional behavior of the future building.
QUALITY INDICATIONS
The European norms has not developed deeply these subjects and single certain graphical conventions and of format exist impelled by some organisms of control. Little debate exists surroundings to the informative content of the project and its form of processing, even between the organism of visa and city councils that every day verify, partly, multitude of projects.
In addition this thesis covers an educational emptiness since the subjets of graphical expression do not have opportunity to enter to treat these subjects that are in the nucleus of the professional exercise.
Even though the reflective and analytical content of this thesis was not high either was tried that it finalized in a manual of procedure for the architecture students. Nevertheless the director of the thesis, Professor Jaime Avellaneda Diaz-Grande insisted on which the hypotheses were verified and solutions pointed thus an executive project was decided "to redrawn" everything already existing, in agreement with the emanated directives of the thesis.
One is then a solid doctoral thesis and an original contribution to the knowledge on which they are possible to be elaborated the future in other theses on aspects that the computer science technology already is offering: representations 3D, dynamic drawings, use of the color, adjunción of sound archives, etc.
Chen, Brenden Chong. „Robust image hash functions using higher order spectra“. Thesis, Queensland University of Technology, 2012. https://eprints.qut.edu.au/61087/1/Brenden_Chen_Thesis.pdf.
Der volle Inhalt der QuelleCarcolé, Carrubé Eduard. „Three-dimensional spatial distribution of scatterers in the crust by inversion analysis of s-wave coda envelopes. A case study of Gauribidanur seismic array site (Southern india) and Galeras volcano (South-western Colombia)“. Doctoral thesis, Universitat Ramon Llull, 2006. http://hdl.handle.net/10803/9321.
Der volle Inhalt der QuelleFBP and SIRT are then used to determine the SDS in southern India. Results are almost independent of the inversion method used and they are frequency dependent. They show a remarkably uniform distribution of the scattering strength in the crust around GBA. However, a shallow (0-24 km) strong scattering structure, which is only visible at low frequencies, seems to coincide with de Closepet granitic batholith which is the boundary between the eastern and western parts of the Dharwar craton.
Also, the SDS is estimated for the Galeras volcano, Colombia. Results reveal a highly non-uniform SDS. Strong scatterers show frequency dependence, which is interpreted in terms if the scale of the heterogeneities producing scattering. Two zones of strong scattering are detected: the shallower one is located at a depth from 4 km to 8 km under the summit whereas the deeper one is imaged at a depth of ~37 km from the Earth's surface. Both zones may be correlated with the magmatic plumbing system beneath Galeras volcano. The second strong scattering zone may be probably related to the deeper magma reservoir that feeds the system.
Reshef, Aymeric. „Dual-rotation C-arm cone-beam tomographic acquisition and reconstruction frameworks for low-contrast detection in brain soft-tissue imaging“. Electronic Thesis or Diss., Paris, ENST, 2018. http://www.theses.fr/2018ENST0044.
Der volle Inhalt der QuelleInterventional C-arm systems are real-time X-ray imaging systems, that can perform tomographic acquisitions by rotating the C-arm around the patient ; however, C-arm cone-beam computed tomography (CBCT) achieves a lower contrast resolution than diagnostic CT, which is necessary in order to benefit from the clinical information of soft tissues in the brain. We propose a new C-arm CBCT acquisition and reconstruction framework to increase low-contrast detection in brain soft-tissue imaging. In order to emulate a bow-tie filter, a dualrotation acquisition is proposed. To account for all the specificities of the dual-rotation acquisition, a dedicated iterative reconstruction algorithm is designed, that includes the ramp filter in the cost function. By switching from filtered backprojection (FBP) to backprojection-filtration (BPF) reconstruction methods, we propose an alternative, direct reconstruction method for dual-rotation acquisitions. For single-rotation acquisitions, the method ensures to perform as good as FBP with arbitrarily coarse angular sampling in planar geometries, and provides a different approximation from the Feldkamp-Davis-Kress (FDK) algorithm in the cone-beam geometry. Although we used it to emulate a virtual bow-tie, our dual-rotation acquisition framework is intrinsically related to region-of-interest (ROI) imaging through the truncated acquisition. With few or no modification of the proposed reconstruction methods, we successfully addressed the problem of ROI imaging in the context of dual-rotation acquisitions
Garla, Venkatakrishnaiah Sharath Chandra, und Harivinay Varadaraju. „Validation of Black-and-White Topology Optimization Designs“. Thesis, Linköpings universitet, Mekanik och hållfasthetslära, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-174807.
Der volle Inhalt der QuelleДолгіх, Володимир Миколайович, Владимир Николаевич Долгих, Volodymyr Mykolaiovych Dolhikh und П. І. Стецюк. „О применении методов негладкой оптимизации для исследования эффективности сложных экономических систем“. Thesis, Таврійський національний університет, 2013. http://essuir.sumdu.edu.ua/handle/123456789/58879.
Der volle Inhalt der QuelleHitchcock, Yvonne Roslyn. „Elliptic curve cryptography for lightweight applications“. Thesis, Queensland University of Technology, 2003. https://eprints.qut.edu.au/15838/1/Yvonne_Hitchcock_Thesis.pdf.
Der volle Inhalt der QuelleHitchcock, Yvonne Roslyn. „Elliptic Curve Cryptography for Lightweight Applications“. Queensland University of Technology, 2003. http://eprints.qut.edu.au/15838/.
Der volle Inhalt der QuelleZakaryan, Taron. „Contribution à l'analyse variationnelle : stabilité des cônes tangents et normaux et convexité des ensembles de Chebyshev“. Thesis, Dijon, 2014. http://www.theses.fr/2014DIJOS073/document.
Der volle Inhalt der QuelleThe aim of this thesis is to study the following three problems: 1) We are concerned with the behavior of normal cones and subdifferentials with respect to two types of convergence of sets and functions: Mosco and Attouch-Wets convergences. Our analysis is devoted to proximal, Fréchet, and Mordukhovich limiting normal cones and subdifferentials. The results obtained can be seen as extensions of Attouch theorem to the context of non-convex functions on locally uniformly convex Banach space. 2) For a given bornology β on a Banach space X we are interested in the validity of the following "lim inf" formula (…).Here Tβ(C; x) and Tc(C; x) denote the β-tangent cone and the Clarke tangent cone to C at x. We proved that it holds true for every closed set C ⊂ X and any x ∈ C, provided that the space X x X is ∂β-trusted. The trustworthiness includes spaces with an equivalent β-differentiable norm or more generally with a Lipschitz β-differentiable bump function. As a consequence, we show that for the Fréchet bornology, this "lim inf" formula characterizes in fact the Asplund property of X. 3) We investigate the convexity of Chebyshev sets. It is well known that in a smooth reflexive Banach space with the Kadec-Klee property every weakly closed Chebyshev subset is convex. We prove that the condition of the weak closedness can be replaced by the local weak closedness, that is, for any x ∈ C there is ∈ > 0 such that C ∩ B(x, ε) is weakly closed. We also prove that the Kadec-Klee property is not required when the Chebyshev set is represented by a finite union of closed convex sets
Waidacher, Christoph. „Charge properties of cuprates: ground state and excitations“. Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2000. http://nbn-resolving.de/urn:nbn:de:swb:14-998985918593-73513.
Der volle Inhalt der QuelleWaidacher, Christoph. „Charge properties of cuprates: ground state and excitations“. Doctoral thesis, Technische Universität Dresden, 1999. https://tud.qucosa.de/id/qucosa%3A24786.
Der volle Inhalt der QuelleLiška, Ondřej. „Lineární kódy a projektivní rovina řádu 10“. Master's thesis, 2013. http://www.nusl.cz/ntk/nusl-320996.
Der volle Inhalt der QuelleWu, Min Tzu, und 吳敏子. „Fairy Tale Code and Self Projection“. Thesis, 2010. http://ndltd.ncl.edu.tw/handle/5qp9pq.
Der volle Inhalt der Quelle國立臺北藝術大學
美術學系碩士在職專班
98
Through Fairy Tale Code and Self Projection, I attempt to explore my inner part with recognizing the interference of fairy tales and images to my body and my values during childhood. While pondering the concept of “Love”, which one of the main issues of this thesis, I found out how“Love” becomes a formulistic visual icon as a result elaborately decorated in consumption culture.“ Love ” is commercially packed, circulated and utilized over and over in media market. Base on text of selected fairy tales, my purpose is to explore the experiences of how I accepted the code of objects that were transformed from characters in fairy tales. I purpose to use “codes”from fairy tale characters to reflect another more meaningful intention to re-assemble an implied narrative in painting.
Basu, Pranab. „On Linear Codes in Projective Spaces“. Thesis, 2019. https://etd.iisc.ac.in/handle/2005/4418.
Der volle Inhalt der QuelleKhaleghi, Azadeh. „Projective Space Codes for the Injection Metric“. Thesis, 2009. http://hdl.handle.net/1807/18790.
Der volle Inhalt der Quelle