Tesis sobre el tema "Over-Constrained"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 40 mejores tesis para su investigación sobre el tema "Over-Constrained".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Beaumont, Matthew y n/a. "Handling Over-Constrained Temporal Constraint Networks". Griffith University. School of Information Technology, 2004. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20041213.084512.
Texto completoMahanta, Girish. "Video transmission over constrained-bandwidth channels". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/MQ39991.pdf.
Texto completoBeaumont, Matthew. "Handling Over-Constrained Temporal Constraint Networks". Thesis, Griffith University, 2004. http://hdl.handle.net/10072/366603.
Texto completoThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Institute for Integrated and Intelligent Systems
Full Text
Jampel, Michael Benjamin. "Over-constrained systems in CLP and CSP". Thesis, City University London, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.319633.
Texto completoYu, Peng Ph D. Massachusetts Institute of Technology Department of Aeronautics and Astronautics. "Continuous relaxation to over-constrained temporal plans". Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/79336.
Texto completoThis electronic version was submitted and approved by the author's academic department as part of an electronic thesis pilot project. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from department-submitted PDF version of thesis.
Includes bibliographical references (p. 165-168).
When humans fail to understand the capabilities of an autonomous system or its environmental limitations, they can jeopardize their objectives and the system by asking for unrealistic goals. The objective of this thesis is to enable consensus between human and autonomous system, by giving autonomous systems the ability to communicate to the user the reasons for goal failure and the relaxations to goals that archive feasibility. We represent our problem in the context of temporal plans, a set of timed activities that can represent the goals and constraints proposed by users. Over-constrained temporal plans are commonly encountered while operating autonomous and decision support systems, when user objectives are in conflict with the environment. Over constrained plans are addressed by relaxing goals and or constraints, such as delaying the arrival time of a trip, with some candidate relaxations being preferable to others. In this thesis we present Uhura, a temporal plan diagnosis and relaxation algorithm that is designed to take over-constrained input plans with temporal flexibility and contingencies, and generate temporal relaxations that make the input plan executable. We introduce two innovative approaches within Uhura: collaborative plan diagnosis and continuous relaxation. Uhura focuses on novel ways of satisfying three goals to make the plan relaxation process more convenient for the users: small perturbation, quick response and simple interaction. First, to achieve small perturbation, Uhura resolves over-constrained temporal plans through partial relaxation of goals, more specifically, through the relaxation of schedules. Prior work on temporal relaxations takes an all-or-nothing approach in which timing constraints on goals, such as arrival times to destinations, are completely relaxed in the relaxations. The Continuous Temporal Relaxation method used by Uhura adjusts the temporal bounds of temporal constraints to minimizes the perturbation caused by the relaxations to the goals in the original plan. Second, to achieve quick responses, Uhura introduces Best-first Conflict-directed Relaxation, a new method that efficiently enumerates alternative options in best-first order. The search space of alternative options to temporal planning problems is very large and finding the best one is a NP-hard problem. Uhura empirically demonstrates fast enumeration by unifying methods from minimal relaxation and conflict-directed enumeration methods, first developed for model based diagnosis. Uhura achieves two orders of magnitude improvement in run-time performance relative to state-of-the-art approaches, making it applicable to a larger group of real-world scenarios with complex temporal plans. Finally, to achieve simple interactions, Uhura presents to the user a small set of preferred relaxations in best-first order based on user preference models. By using minimal relaxations to represent alternative options, Uhura simplifies the options presented to the user and reduces the size of its results and improves their expressiveness. Previous work either generates minimal relaxations or full relaxations based on preference, but not minimal relaxations based on preference. Preferred minimal relaxations simplify the interaction in that the users do not have to consider any irrelevant information, and may reach an agreement with the autonomous system faster. Therefore it makes communication between robots and users more convenient and precise. We have incorporated Uhura within an autonomous executive that collaborates with human operators to resolve over-constrained temporal plans. Its effectiveness has been demonstrated both in simulation and in hardware on a Personal Transportation System concept. The average runtime of Uhura on large problems with 200 activities is two order of magnitude lower compared to current approaches. In addition, Uhura has also been used in a driving assistant system to resolve conflicts in driving plans. We believe that Uhura's collaborative temporal plan diagnosis capability can benefit a wide range of applications, both within industrial applications and in our daily lives.
by Peng Yu.
S.M.
Bain, Stuart y n/a. "Evolving Algorithms for Over-Constrained and Satisfaction Problems". Griffith University. School of Information and Communication Technology, 2007. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20071126.080227.
Texto completoNesh-Nash, Ali. "Voice over IP in a resource constrained environment". Thesis, KTH, Kommunikationssystem, CoS, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-92257.
Texto completoDagens telekommunikationssystem fokuserar på mobilitet. Detta har blivit populärt under 90-talet då mobilitet blev naturligt integrerad i människans vardagliga liv i form av exempelvis mobiltelefoner. Voice over IP (VoIP) har blivit en stor del av dagen teknik där trådlösa system Wireless LANs (WLANs) har blivit en större del av mobilkommunikation. Målet med denna rapport är att förstå hur strömförbrukningen kan minimeras genom att utföra vissa operationer med hjälp av en VoIP-klient. För att åstadkomma detta porterade vi minisip, en SIP agent som är baserad på öppen källkod och körs på Linux och Windows, till en HP iPAQ 5500, en så kallad Personal Digital Assistant (PDA). Vi valde PDAn för att kunna utforska de begränsningar den medför i form av lagringsutrymme, processorkapacitet, och batteri. Denna rapport bygger vidare på tidigare rapporter som visar att minisip kan erbjuda en säker kommunikationsplattform med de senaste funktionerna som önskas i mobila VoIPsystem. De flesta av dessa tidigare rapporter baseras på system med få begränsningar rörande resurser såsom stationära- eller bärbara datorer samt serverbaserade system. Denna rapports fokus är att utforska detta fall i en miljö med större begränsningar på resurser som till exempel en iPAQ.
Cheng, Huang. "A Resource-Constrained Coverage Protocol Over Urban VANETs". Thèse, Université d'Ottawa / University of Ottawa, 2014. http://hdl.handle.net/10393/30913.
Texto completoBain, Stuart. "Evolving Algorithms for Over-Constrained and Satisfaction Problems". Thesis, Griffith University, 2007. http://hdl.handle.net/10072/365848.
Texto completoThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
School of Information and Communication Technology
Faculty of Engineering and Information Technology
Full Text
Al-Regib, Ghassan. "Delay-constrained 3-D graphics streaming over lossy networks". Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/15428.
Texto completoKang, Intae. "Topology control for broadcasting over energy constrained wireless ad hoc networks /". Thesis, Connect to this title online; UW restricted, 2005. http://hdl.handle.net/1773/6061.
Texto completoAbu, Mahfouz Adnan Mohammed I. "Elliptic curve cryptosystem over optimal extension fields for computationally constrained devices". Pretoria : [s.n.], 2004. http://upetd.up.ac.za/thesis/available/etd-06082005-144557.
Texto completoMahvidi, Hamid. "Performance of latency constrained turbo-like codes over correlated fading channels". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0024/MQ50386.pdf.
Texto completoAbu-Mahfouz, Adnan Mohammed. "Elliptic curve cryptosystem over optimal extension fields for computationally constrained devices". Diss., University of Pretoria, 2004. http://hdl.handle.net/2263/25330.
Texto completoDissertation (MEng (Computer Engineering))--University of Pretoria, 2006.
Electrical, Electronic and Computer Engineering
unrestricted
Bay, John S. "Constrained motion of a 3-D manipulator over unknown constraints : the robotic groping problem /". The Ohio State University, 1988. http://rave.ohiolink.edu/etdc/view?acc_num=osu148759165817468.
Texto completoMilchevski, Evica [Verfasser] y Sebastian [Akademischer Betreuer] Michel. "Similarity Search Algorithms over Top-k Rankings and Class-Constrained Objects / Evica Milchevski ; Betreuer: Sebastian Michel". Kaiserslautern : Technische Universität Kaiserslautern, 2019. http://d-nb.info/1194372554/34.
Texto completoBreun, Peter [Verfasser], Wolfgang [Akademischer Betreuer] Utschick y Michael [Akademischer Betreuer] Ulbrich. "Optimal Control Over Power Constrained Communication Channels / Peter Breun. Gutachter: Wolfgang Utschick ; Michael Ulbrich. Betreuer: Wolfgang Utschick". München : Universitätsbibliothek der TU München, 2013. http://d-nb.info/1042578206/34.
Texto completoBreun, Peter Verfasser], Wolfgang [Akademischer Betreuer] Utschick y Michael [Akademischer Betreuer] [Ulbrich. "Optimal Control Over Power Constrained Communication Channels / Peter Breun. Gutachter: Wolfgang Utschick ; Michael Ulbrich. Betreuer: Wolfgang Utschick". München : Universitätsbibliothek der TU München, 2013. http://nbn-resolving.de/urn:nbn:de:bvb:91-diss-20130423-1173158-0-2.
Texto completoSjöholm, Klas. "Debugging Equation-Based Languages in OpenModelica Environment". Thesis, Department of Computer and Information Science, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-19866.
Texto completoThe need for debugging tools for declarative programming languages has increased due to the rapid development of modeling and simulation tools/programs. Declarative equation-based programming languages have the problem of equation systems being over-, or under-constrained. This means that the system of equations has more equations than variables or more variables than equations respectively, making the system of equations unsolvable. In this study a static debugger is implemented in OpenModelica compiler for the equation-based programming language Modelica to make it easier for the programmer or modeler to locate the equation/s causing the unconstrained system of equations. The debugging techniques used by the debugger are developed by Peter Bunus. Those techniques are able to detect unconstrained systems of equations and give solutions by identifying the minimal set ofequation/s that should be removed or which variable/s should be added to an equation/s to make the system solvable. In this study the debugging techniques for detecting and giving a solution for over-constrained system of equations are shown suitable to be used for the programming language Modelica in the OpenModelica compiler.
Hu, Hao. "Detection and treatment of inconsistent or locally over-constrained configurations during the manipulation of 3D geometric models made of free-form surfaces". Thesis, Paris, ENSAM, 2018. http://www.theses.fr/2018ENAM0002/document.
Texto completoThree modules will be developed: The detection module has produced an analysis of problematic con figurations, i.e. a set of areas where either some new DOFs or some local changes in the constraints are mandatory. The treatment module will enable the defi nition of mechanisms to help the decision on modi cations. The prediction module will tell the degree of deformation by pre-analyzing the features of NURBS configurations
Grose, Roger. "Cost-constrained project scheduling with task durations and costs that may increase over time : demonstrated with the U.S. Army future combat systems /". Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Jun%5FGrose.pdf.
Texto completoGrose, Roger T. "Cost-constrained project scheduling with task durations and costs that may increase over time demonstrated with the U.S. Army future combat systems /". Thesis, View thesis via NPS View thesis via DTIC, 2004. http://handle.dtic.mil/100.2/ADA424957.
Texto completoTitle from title screen (viewed June 28, 2005). "June 2004." Includes bibliographical references (p. 59-61). Also issued in paper format.
Ali, Anissa. "Représentation et analyse algébriques de système de solides sur-contraints en boucle fermée". Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLC062.
Texto completoAn assembly can be partitioned into three mobility states: the impossible state, the rigid state and the mobile state. The study focuses in over-constrained closed-loop assemblies. During the process of design or re-design, the dimensions of the assembly can vary and this can lead to the loss of its mobility state.The method presented in this thesis aims at helping the designer to resize an assembly. There exist relationships between the dimension of the assembly that ensure the closure and the mobility of over-constrained. These relationships called assembly equations and mobility conditions are hence necessary to resize an over-constrained solid assembly. Assembly equations and mobility conditions are computed by a computer algebra tool: Gröbner bases. However, the algebraic solving using Gröbner bases can be costly and may fail because of unreasonable computing time, this is the main reason of the strategies described in this thesis.The approach proposed in this thesis is composed of two main steps. First of all, an algebraic representation of a closed assembly and a mobile assembly is descibed. The closed-loop equations are written by using a coordinate free method and the mobility equations are generated from the closed-loop equations using direct and incremental methods. To simplify the computation of assembly equations and mobility conditions an algebraic analysis that rely on numerical analysis tools is proposed. Starting from a set of values of the parameters that describe the assembly to resize, the mobility state of the assembly is determined. Then, if the designer want to change the mobility state, a new set of values that have the mobility state chosen by the designer is generated. Once the initial set of values has the right mobility state, some dimensions are specialized to ease the computation of assembly equations and mobility conditions. However, if the parameters chosen are linked or its number is to high, there is a high chance that the study lead to no solution. Strategies to avoid these problems are also proposed. Finally, the tools developped in Maple® software that illustrate the methods proposed are described and an interactive tool that permits the designer to visualize the solutions of the closed-loop equations, assembly equations and mobility conditions computed after specialisation is proposed
De, Clercq Alexis. "Ordonnancement cumulatif avec dépassements de capacité : Contrainte globale et décompositions". Phd thesis, Ecole des Mines de Nantes, 2012. http://tel.archives-ouvertes.fr/tel-00794323.
Texto completoGouyou, Doriane. "Introduction de pièces déformables dans l’analyse de tolérances géométriques de mécanismes hyperstatiques". Thesis, Bordeaux, 2018. http://www.theses.fr/2018BORD0343/document.
Texto completoOver-constrained mechanisms are often used in industries to ensure a good mechanical strength and a good robustness to manufacturing deviations of parts. The tolerance analysis of such assemblies is difficult to implement.Indeed, depending on the geometrical deviations of parts, over-constrained mechanisms can have assembly interferences. In this work, we used the polytope method to check whether the assembly has interferences or not. For each assembly, the resulting polytope of the mechanism is computed. If it is non empty, the assembly can be performed without interference. If not, there is interferences in the assembly. According to the result, two different methods can be implemented.For an assembly without interference, the resulting polytope enables to check directly its compliance. For an assembly with interferences, a study taking into account the stiffness of the parts is undertaken. This approach uses a model reduction with super elements. It enables to compute quickly the assembly with deformation. Then, an assembly load is computed to conclude on its feasibility. Finally, the spreading of deformation through the parts is calculated to check the compliance of the mechanism.The short computational time enables to perform stochastic tolerance analyses in order to provide the rates of compliant assemblies
Connie, Ashfiqua Tahseen. "Efficient transmission of error resilient H.264 video over wireless links". Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/1979.
Texto completoWilczynski, Anaëlle. "Interaction entre agents modélisée par un réseau social dans des problématiques de choix social computationnel Strategic Voting in a Social Context: Considerate Equilibria Object Allocation via Swaps along a Social Network Local Envy-Freeness in House Allocation Problems Constrained Swap Dynamics over a Social Network in Distributed Resource Reallocation Poll-Confident Voters in Iterative Voting". Thesis, Paris Sciences et Lettres (ComUE), 2018. http://www.theses.fr/2018PSLED073.
Texto completoSocial choice is the study of collective decision making, where a set of agents must make a decision over a set of alternatives, according to their preferences. The question relies on how aggregating the preferences of the agents in order to end up with a decision that is commonly acceptable for the group. Typically, agents can interact by collaborating, or exchanging some information. It is usually assumed in computational social choice that every agent is able to interact with any other agent. However, this assumption looks unrealistic in many concrete situations. We propose to relax this assumption by considering that the possibility of interaction is given by a social network, represented by a graph over the agents.In this context, we study two particular problems of computational social choice: strategic voting and resource allocation of indivisible goods. The focus is on two types of interaction: collaboration and information gathering. We explore how the social network,modelingapossibilityofcollaboration or a visibility relation among the agents, can impact the resolution and the solution of voting and resource allocation problems. These questions are addressed via computational social choice by using tools from algorithmic game theory and computational complexity
Ben, Zid Maha. "Emploi de techniques de traitement de signal MIMO pour des applications dédiées réseaux de capteurs sans fil". Thesis, Grenoble, 2012. http://www.theses.fr/2012GRENT017/document.
Texto completoThe aim of this work is to study from a signal processing point of view the use of MIMO (Multiple Input Multiple Output) communication systems for algorithms dedicated to wireless sensor networks. We investigate energy-constrained wireless sensor networks and we focus on cluster topology of the network. This topology permits for the use of MIMO communication system model. First, we review different aspects that characterize the wireless sensor network. Then, we introduce the existing strategies for energy conservation in the network. The basic concepts of MIMO systems are presented in the second chapter and numerical results are provided for evaluating the performances of MIMO techniques. Of particular interest, polarization diversity over rich scattering environment is studied. Thereafter, beamforming approach is proposed for the development of an original localization algorithm in wireless sensor network. The novel algorithm is described and performances are evaluated by simulation. We determine the optimal system configuration between a pair of clusters that permits for the highest capacity to energy ratio in the fourth chapter. The final chapter is devoted to sensor nodes selection in wireless sensor network. The aim of using such technique is to make energy conservation in the network
Mahanta, Girish. "Video transmission over constrained bandwidth channels". Thesis, 1997. http://spectrum.library.concordia.ca/425/1/MQ39991.pdf.
Texto completo林舜華. "Delay Constrained Scheduling over Fading Channels". Thesis, 2012. http://ndltd.ncl.edu.tw/handle/24216713717318405780.
Texto completo國立交通大學
電信工程研究所
101
For many wireless transmitters, since most devices are battery powered, increased energy e±ciency in data transmission provides signi¯cant bene¯ts. Higher energy e±- ciency may result in prolonging the lifetime of the battery. We seek to ¯nd an energy-saving scheduler that sends a packet of R bits within a hard delay deadline K over fading channels. The scheduling policies needs to determine the number of bits transmitted in the current time slot with only the knowledge of current channel state information and the channel statistics of the future channel while satisfying the quality of service QOS constraints as the deadline expired in order to minimize the total energy consump- tion. In this thesis, we will focus on the interaction between fading, hard deadlines, and causal channel information by studying transmission of only a single packet, and thus do not consider random arrivals since there are applications with deterministic packet arrivals, i.e., VoIP or video streaming where packets arrive regularly and each must be received within a short delay window. Although it is more reasonable to consider ran- dom arrivals and outage probability that allows few packets missing, to emphasize the relationship between fading, hard deadlines, and causal channel information, we only consider a fundamental scheduling problem that one packet and no outage is allowed. An optimal non-causal scheduling policy is derived by inverse water-¯lling (IWF) method and an optimal causal scheduling policy is also derived for total time slots K = 2. We also develop a dynamic programming formulation that leads to an optimal transmission schedule, however, it is hard to express as a closed form when K > 2. Thus, we propose two suboptimal scheduler which give simple structure for general problems, and one utilizes central limit theorem (CLT) for approximation while the other is inspired by the IWF method. The policies are composed of a linear combination of channel-awareness term and delay-awareness term. The numerical results show that the proposed policies are nearly optimal when R is large. In addition, we extend our work to multiple user case. At the ¯rst phase, we only have the channel pdfs of users. Since delay constraint speci¯es only that the rate is achieved in K blocks, the order of which the users are scheduled within the K blocks is not important in this phase, so the scheduling boils down to sorting out the number of blocks being allocated to each user. After deciding the number of blocks allocated to each user, the problem can be treated as independent single-user single-carrier problems with competitions. With multiple users, the scheduling problem is composed of distributing resources, channel assignment that the transmitter requires to decide which user occupies the channel at any given time slot by order statistic method and bit allocation that how many bits should be allocated in order to minimize the total energy consumption of all users.
Raposo, André Filipe Mendes. "Wireless communication over NFC with a constrained resouce device". Master's thesis, 2010. http://hdl.handle.net/10216/61304.
Texto completoRaposo, André Filipe Mendes. "Wireless communication over NFC with a constrained resouce device". Dissertação, 2010. http://hdl.handle.net/10216/61304.
Texto completoRojas, Norman Alejandro Jose. "Feedback control over signal to noise ratio constrained communication channels". Thesis, 2006. http://hdl.handle.net/1959.13/24913.
Texto completoPhD Doctorate
Rojas, Norman Alejandro Jose. "Feedback Control over Signal to Noise Ratio Constrained Communication Channels". 2006. http://hdl.handle.net/1959.13/24913.
Texto completoPhD Doctorate
Nagaraj, B. P. "Kinematic And Static Analysis Of Over-Constrained Mechanisms And Deployable Pantograph Masts". Thesis, 2009. http://hdl.handle.net/2005/1014.
Texto completoWang, Wei. "Quality-driven cross layer design for multimedia security over resource constrained wireless sensor networks". 2009. http://proquest.umi.com/pqdweb?did=1933031681&sid=9&Fmt=2&clientId=14215&RQT=309&VName=PQD.
Texto completoTitle from title screen (site viewed March 2, 2010). PDF text: ix, 110 p. : ill. (chiefly col.) ; 3 Mb. UMI publication number: AAT 3386564. Includes bibliographical references. Also available in microfilm and microfiche formats.
Yen, Shih-Chia y 嚴仕佳. "Time-Constrained Aggregated ARQ with an Adaptive Rate Control for SVC Streaming over Wireless LAN". Thesis, 2012. http://ndltd.ncl.edu.tw/handle/16319233243840335345.
Texto completo國立中正大學
通訊工程研究所
100
With the advances in voice, video compression and broadband technology, multimedia streaming services become an integral part of daily life. Multimedia streaming using Scalable Video Coding (SVC) mechanism to improve the transmission quality of the multimedia network, to better meets the application requirements in the various terminal devices in a distributed heterogeneous network environment. TCP sliding window mechanism adjust its sending rate too violent, and its retransmission mechanism for real-time video packet recovery may suffer a long round trip time delay has made the protocol not an ideal candidate for streaming applications. However, given the lack of inbuilt congestion and flow control mechanisms within UDP may cause the occurrence of network congestion, and also UDP does not provide retransmission mechanism to ensure the integrity of the video data. In this paper, we proposed UDP as transport protocol and added aggregated ARQ with time-constrained at application layer to solve the reliability problem of transmission. Through the aggregated ARQ to avoid per-packet ACK leads to generate too many ACKs and causes channel contention, thus degrading the throughput. In adaptive rate control, we refer to the AIMD rate control mechanism and consider packet loss due to changes in channel quality over WLAN. Finally, we integrate the above methods to design a suitable transmission control protocol for SVC multimedia streaming over WLAN environment.
Pholotho, Tholo Johannes. "Toward a broadband service delivery model over wireless technologies to resource-constrained public high schools in South Africa". Diss., 2017. http://hdl.handle.net/10500/23229.
Texto completoSchool of Computing
M. Tech (Information Technology)
Ash, Michael R. "Constrained inversion of gravity data over the Ovoid and mini-ovoid in the Voisey's Bay Ni-Cu-Co deposit, Labrador /". 2007. http://collections.mun.ca/u?/theses,146575.
Texto completo林儀甄. "An Action Research on How A School Counselor Developed Antagonistic Reaction Against Constrained Scenario Where Student Counselling Work Become Over-medicalized and Programmed under the Frame of Gender Equality Education Act". Thesis, 2019. http://ndltd.ncl.edu.tw/handle/4m2k3k.
Texto completo