Rozprawy doktorskie na temat „REVERSIBLE MULTIPLIER”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 18 najlepszych rozpraw doktorskich naukowych na temat „REVERSIBLE MULTIPLIER”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Bollinger, Patrick James. "Prime Factorization Through Reversible Logic Gates". Youngstown State University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1558867948427409.
Pełny tekst źródłaMorrison, Matthew Arthur. "Design of a Reversible ALU Based on Novel Reversible Logic Structures". Scholar Commons, 2012. http://scholarcommons.usf.edu/etd/4175.
Pełny tekst źródłaCabbage, Sarah E. "Reversible regulatory T cell-mediated suppression of myelin basic protein-specific T cells /". Thesis, Connect to this title online; UW restricted, 2006. http://hdl.handle.net/1773/5034.
Pełny tekst źródłaBérut, Antoine. "Fluctuations and Interactions of Brownian particles in multiple Optical Traps". Thesis, Lyon, École normale supérieure, 2015. http://www.theses.fr/2015ENSL1003/document.
Pełny tekst źródłaWe experimentally study the fluctuations of Brownian micro-particles trapped with optical tweezers arranged in various spatial configurations. We give a general description of the set-up and detail four different experiments we conducted. We first use a single particle in a double-well potential to model a two-state memory system. We verify the Landauer principle on the minimal energetic cost to erase one bit of information, and we use a detailed version of a fluctuation theorem to retrieve the expected energetic bound. We then use two particles in two different traps to study the hydrodynamic interactions between two systems kept at different effective temperatures. Contrary to what was previously observed, we show that the sol-gel transition of gelatine does not provide any anomalous fluctuations for the trapped particle when the sample is quenched below gelification temperature. However, we show that an effective temperature is created when a well chosen random noise is added on one trap position. We demonstrate that the random forcing on one particle induces an instantaneous correlation between the two particles motions, and an energy exchange from the virtually hot particle to the cold one, which is in equilibrium with the thermal bath. We show a good agreement between the experimental data and the predictions from an hydrodynamic coupling model. Finally, we describe the use of micro-fluidic channels to create a shear flow at the micron size, and we discuss the possibility to interpret the force due to the shear-flow in terms of an effective temperature by testing a fluctuation-dissipation relation
O'Leary, Rebecca A. "Informed statistical modelling of habitat suitability for rare and threatened species". Thesis, Queensland University of Technology, 2008. https://eprints.qut.edu.au/17779/1/Rebecca_O%27Leary_Thesis.pdf.
Pełny tekst źródłaO'Leary, Rebecca A. "Informed statistical modelling of habitat suitability for rare and threatened species". Queensland University of Technology, 2008. http://eprints.qut.edu.au/17779/.
Pełny tekst źródłaKuhnert, Petra Meta. "New methodology and comparisons for the analysis of binary data using Bayesian and tree based methods". Thesis, Queensland University of Technology, 2003.
Znajdź pełny tekst źródłaAssareh, Hassan. "Bayesian hierarchical models in statistical quality control methods to improve healthcare in hospitals". Thesis, Queensland University of Technology, 2012. https://eprints.qut.edu.au/53342/1/Hassan_Assareh_Thesis.pdf.
Pełny tekst źródłaRUHELA, DIKSHA. "DESIGN AND IMPLEMENTATION OF EFFICIENT REVERSIBLE MULTIPLIER USING VEDIC MATHEMATICS TOOL". Thesis, 2016. http://dspace.dtu.ac.in:8080/jspui/handle/repository/14759.
Pełny tekst źródłaHua, Chen-Wei, i 華振崴. "Multiple Acceleration on Reversible Markov Chain". Thesis, 2019. http://ndltd.ncl.edu.tw/handle/2hd8vc.
Pełny tekst źródła國立臺灣大學
數學研究所
107
Chen and Hwang, 2013 proposed to improve a reversible Markov chain by adding an antisymmetric perturbation on a cycle. Since the perturbed Markov chain is no longer reversible, one can not iteratively apply this antisymmetric perturbation method on different cycles. Chen and Hwang, 2013 also showed that the method works on disjoint cycles. In this paper, we further investigate the case of two cycles sharing the same vertex. We will show that the method can work on two cycles under some additional conditions. In addition to the theory, we implement the antisymmetric perturbation method on the Ising model.
Fan, Chen-Hao, i 范振晧. "Reversible Data Hiding Technique Based on Multiple Diffusion". Thesis, 2015. http://ndltd.ncl.edu.tw/handle/s493uj.
Pełny tekst źródła國立雲林科技大學
資訊工程系
103
This thesis proposes a novel reversible data hiding technique based on multiple diffusion. To achieve a better distribution of pixel values, we first use the Torus automorphism permutation scheme and the modified EMD scheme to change pixel’s location and value. Then, encrypt the resultant image by the selected encryption scheme. This thesis proposed two encryption schemes to analyze. The secret messages are embedded by the dual image reversible data hiding scheme; With the encrypted image and different sets of keys, the receiver can extract the following different informations: (1) the secret messages only; (2) an inferior quality of the image; (3) the secret message and the original image. In this thesis, we also researched irreversible data hiding and encryption scheme on images which are not require high quality. Using the GMEMD scheme to embed the secret messages, and encrypt it by the proposed scheme. In the extraction phase, with the feature of the GMEMD scheme we can directly extract the secret messages without any processing. But we cannot recover the original image after decryption. Experimental results show that the proposed schemes has a lower correlation between two adjacent pixels and a better uniform distribution of pixel values compared to other schemes. Thus, it can effectively resist histogram attack. In addition, we are able to decide the quality of the extracted image and whether can extract the secret messages or not by giving the receiver different sets of keys.
Lu, Chin-Yung, i 盧勤庸. "Reversible Circuit Synthesis and Multiple-Valued Quantum Circuit Verification". Thesis, 2010. http://ndltd.ncl.edu.tw/handle/30871474106224513591.
Pełny tekst źródła臺灣大學
電子工程學研究所
98
Reversible circuits have applications in many areas such as digital signal processing, low power design, and quantum computing. If a circuit is reversible, it can reduce the energy consumption caused by information loss. The Karnaugh map method is faster and easier to apply than other simplification methods for combination logic circuits. But the classical Karnaugh map is not directly applicable to reversible circuits because the basic logic gates, except the NOT gate, are not reversible gates. In this dissertation, we propose a method to solve the problem so that the Karnaugh map can be applied to the reversible circuit synthesis. Our algorithm provides a systematic method for simplifying the reversible circuit. This can generate the resulting expression in exclusive-sum form and transform it into a final reversible circuit with lower quantum cost. Moreover, we can realize permutations to be reversible circuits with lower quantum cost and without unnecessary garbage bits. We can also convert irreversible circuits by adding qubits to make the circuits reversible. The experimental results show that the average saving in quantum cost is 15.82% compared with previous approaches. So far there are no synthesis algorithms that can find all the optimal reversible circuits except an exhaustive algorithm. We propose a method based on the divide and conquer approach which can significantly improve the performance of the existing synthesis algorithms to synthesize reversible circuits. A reversible circuit is first divided into two subcircuits. The smaller subcircuit will input all possible combinations of m gates, except for those combinations with the same functionality only the one with fewest gates is selected for input. The other subcircuit can be synthesized with an existing algorithm. The two subcircuits are then combined to form all the possible results and from these results we can choose the most simplified one. According to the experimental results on all the 3-variable reversible functions, we can see that the performance of the existing algorithms can be significantly improved by using our method. Therefore the synthesized reversible circuits are much more simplified than previous results. Moreover, in order to efficiently represent a quantum operation, we propose X-decomposition Quantum Decision Diagram (XQDD) which can easily perform matrix operations. XQDD can be used to verify quantum and reversible circuits even if the reversible circuits have different number of garbage qubits. It is more efficient in terms of space and time. We extend the binary-valued XQDD to multiple-valued quantum logic. The extended XQDD can represent a multiple-valued quantum operation and perform matrix operations. It can be applied to verify the equivalence of two multiple-valued quantum or reversible circuits which are synthesized by different approaches. According to the simulation results, it is much better than multiple-valued QuIDD and very close to QMDD in terms of time. Besides, we show that the space in multiple-valued XQDD is less than other representations. Finally, previous quantum secure direct communication (QSDC) protocols usually consume one Einstein-Podolsky-Rosen (EPR) pair to transmit a single qubit. If Alice wants to transmit an n-bit message, she needs at least n/2 EPR pairs when dense coding scheme is used. We propose a new QSDC protocol based on EPR pairs. If both Alice and Bob pre-share 2c+1 EPR pairs with the trusted server where c is a constant, Alice can transmit arbitrary number of qubits to Bob. The 2c EPR pairs are used by Alice and Bob to authenticate each other and the remaining EPR pair is used to encode and decode the message qubit. Thus the total number of EPR pairs used for one communication is a constant no matter how many bits will be transmitted. It does not need to transmit EPR pairs before transmitting the secret message except the pre-shared constant number of EPR pairs. It reduces both the utilization of the quantum channel and the risk. In addition, after the authentication, the server is not involved in the message transmission. Thus we can prevent the server from knowing the message.
Li, Yen-Cheng, i 李彥徵. "A New Reversible Data Hiding Scheme Using Multiple steganographic Images". Thesis, 2011. http://ndltd.ncl.edu.tw/handle/41036177782946470277.
Pełny tekst źródła逢甲大學
通訊工程所
99
Data hiding technique is mainly embedding the secret messages using a meaningful digital media as a cover, that other people cannot detect the existence of the secret messages. The technology of reversible data hiding has many typical applications, such as related fields of medical and military. The technology of reversible data hiding using multiple steganographic can be used to achieve a hidden secret communication behavior of secret sharing techniques. In 2009, Lee et al. proposed a novel reversible data hiding based on dual steganographic images. Their main idea is to disperse the secret messages hiding in two identical cover images and to produce two different stego-images. Thus the people must also have two stego-images who can extract the secret messages completely. According to Lee et al.’s embedding algorithm, there is 0 bit, 2 bits or 4 bits embedded into four pixels. The average of capacity is about 0.75 bpp and PSNR is about 52.3 dB. In this paper, we propose a method to improve the algorithm proposed by Lee et al. In our proposed method, not only using three identical cover images to produce three different stego-images, but also ensure that can embed 4 secret bits into three pixels without overflow. Thus our method not only obtains higher capacity (about 1.333 bpp) but also preserves pretty good image quality (about 49.77 dB).
Fan, Jiang Shu-Yuan, i 范姜淑媛. "Multiple Responsive Reversible Shape Memory Olefin Block Copolymer (OBC)/ Polycaprolactone (PCL) Blends". Thesis, 2019. http://ndltd.ncl.edu.tw/handle/4chj5k.
Pełny tekst źródła國立宜蘭大學
化學工程與材料工程學系碩士班
107
In this work we prepared peroxide crosslinked OBC/PCL blends with different ratios of olefin block copolymer (OBC) and polycaprolactone (PCL). The gel contents of blends were above 98 % after adding 2 phr peroxide, and this strong polymer network is beneficial for shape memory. The 2DXRD (Two-dimensional X-Ray Diffractometer) patterns revealed the stress-induced orientation of crystalline regions in the two-way shape memory with applied load. In the one-way shape memory results, the fixing ratios of the blends were above 95 %, and the recovery ratios of the blends were above 96 %. The samples had the reversible two-way shape memory effect under external force. Additionally, the blends demonstrated the triple-shape reversible shape memory behavior because OBC and PCL had two distinct melting/crystallization temperatures. They also had the reversible shape memory behavior under stress-free condition after programming. The optimized blend of OBC/PCL D2 40/60 with the absolute reversible strain change of 7.7 % and the relative reversible strain change of 17.5 % was prepared after 300 kPa programming. These blends achieved the effect by partially melting the crystals of PCL to improve the narrow range of melting temperature in the respective neat resin. In chemo-induced shape memory effect, we discovered that the deformed samples had the reversible shape change owing to the solvent-induced inhomogeneous swelling/crystallization, which was different from those previous reported literature work requiring additional pre-soaking treatment. The results showed that the higher content of PCL to increase the reversible angle was more significant in both THF and acetone vapor environment, and these phenomena showed a similar tendency in solvent uptake. Furthermore, the addition of multi-walled carbon nanotube (CNT) in blends showed the reversible shape memory behavior by near-infrared laser irradiation.
Mehrbany, Irany Behrang. "A High Capacity Reversible Multiple Watermarking Scheme - applications to Images, Medical Data, and Biometrics". Thesis, 2011. http://hdl.handle.net/1807/29530.
Pełny tekst źródłaChung, Che-Lun, i 鍾哲倫. "Application for Reversible Information Hiding in Multiple Secret Images Sharing Based on Shamir’s Scheme". Thesis, 2013. http://ndltd.ncl.edu.tw/handle/59214594702450088362.
Pełny tekst źródła玄奘大學
資訊管理學系碩士班
101
We proposed an application for reversible information hiding in multiple secret images sharing based on Shamir’s method. Many researchers develop secret image sharing method with Shamir’s scheme in one image. We mixed the multiples secret images with one host image and employ the modified Shamir’s method to share the participants. Lagrange method is applied with enough numbers of the shadow images in the retrieval step. The experiment results demonstrate our method can retrieve secret images lossless.
Gaffney, Patrick Joseph. "An efficient reversible jump Markov chain Monte Carlo approach to detect multiple loci and their effects in inbred crosses". 2001. http://www.library.wisc.edu/databases/connect/dissertations.html.
Pełny tekst źródłaLiu, Kuan-Liang, i 劉冠良. "Histogram Based Reversible Information Hiding Improved by Multiple Prediction Methods with the Variance to Enhance Image Quality and Capacity". Thesis, 2014. http://ndltd.ncl.edu.tw/handle/69183212911167308640.
Pełny tekst źródła國立屏東教育大學
資訊科學系碩士班
102
Reversible data hiding based on prediction methods is a good technique that can hide secret bits into cover images efficiently. In this study, we propose a reversible data hiding method based on multiple prediction methods and local complexity. In our proposed method, before we embed the secret message in one level, we evaluate four prediction methods by two ways to decide which prediction method will be used. First, if we want to achieve high-capacity, the prediction methods’ capacities are calculated. Second, if we want to achieve high-quality, the prediction methods’ efficiency ratios are calculated. When the selected prediction method is applied, a threshold based on local complexity is used to determine which pixel should join the shifting and embedding process. If the local complexity is smaller than the threshold, the pixel will be taken for message hiding or pixel shifting; otherwise, the pixel will quit joining the process of data concealing and pixel shifting. Therefore, more pixels will avoid executing the process of pixel shifting. It results to the stego-images with lower distortion. The experimental results show that our embedding capacity and quality are superior to other approaches.