Dissertations / Theses on the topic 'Threshold-based'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Threshold-based.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Zheng, Yexin. "Novel RTD-Based Threshold Logic Design and Verification." Thesis, Virginia Tech, 2008. http://hdl.handle.net/10919/32011.
Full textMaster of Science
Calota, Andra. "Reliability of spasticity measurement based on tonic stretch reflex threshold." Thesis, McGill University, 2008. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=111947.
Full textHaboush, W. S. "Adaptive task selection using threshold-based techniques in dynamic sensor networks." Thesis, University of Kent, 2008. https://kar.kent.ac.uk/24027/.
Full textKannamareddy, Aruna Sai. "Density and partition based clustering on massive threshold bounded data sets." Kansas State University, 2017. http://hdl.handle.net/2097/35467.
Full textDepartment of Computing and Information Sciences
William H. Hsu
The project explores the possibility of increasing efficiency in the clusters formed out of massive data sets which are formed using threshold blocking algorithm. Clusters thus formed are denser and qualitative. Clusters that are formed out of individual clustering algorithms alone, do not necessarily eliminate outliers and the clusters generated can be complex, or improperly distributed over the data set. The threshold blocking algorithm, a current research paper from Michael Higgins of Statistics Department on other hand, in comparison with existing algorithms performs better in forming the dense and distinctive units with predefined threshold. Developing a hybridized algorithm by implementing the existing clustering algorithms to re-cluster these units thus formed is part of this project. Clustering on the seeds thus formed from threshold blocking Algorithm, eases the task of clustering to the existing algorithm by eliminating the overhead of worrying about the outliers. Also, the clusters thus generated are more representative of the whole. Also, since the threshold blocking algorithm is proven to be fast and efficient, we now can predict a lot more decisions from large data sets in less time. Predicting the similar songs from Million Song Data Set using such a hybridized algorithm is considered as the data set for the evaluation of this goal.
Whiten, Darren M. (Darren Mark) 1977. "Threshold predictions based on an electro-anatomical model of the cochlear implant." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/87847.
Full textIncludes bibliographical references (p. 135-141).
by Darren M. Whiten.
S.M.and Elec.E.
Zou, Tao. "Non-Destructive Bridge Deck Condition Assessment with a Probability-Based Deterioration Threshold." Diss., Virginia Tech, 2014. http://hdl.handle.net/10919/49384.
Full textPh. D.
Dickinson, James Edwin. "A ground based gamma ray telescope of high sensitivity and low energy threshold." Thesis, Durham University, 1995. http://etheses.dur.ac.uk/5279/.
Full textHild, Kerstin [Verfasser]. "Femtosecond laser-based investigations of magnetic circular dichroism in near-threshold photoemission / Kerstin Hild." Mainz : Universitätsbibliothek der Johannes Gutenberg-Universität Mainz, 2011. http://d-nb.info/1221804103/34.
Full textAl, Tobi Amjad Mohamed. "Anomaly-based network intrusion detection enhancement by prediction threshold adaptation of binary classification models." Thesis, University of St Andrews, 2018. http://hdl.handle.net/10023/17050.
Full textWang, Shiyuan. "Fatigue crack threshold and growth behaviour in a near fully-lamellar gamma based titanium aluminides." Thesis, University of Birmingham, 2015. http://etheses.bham.ac.uk//id/eprint/6347/.
Full textRavi, Ajaay. "Run-Time Active Leakage Control Mechanism based on a Light Threshold Voltage Hopping Technique (LITHE)." University of Cincinnati / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1302550444.
Full textHomer, Daniel C. "Population Fit Threshold: Fully Automated Signal Map generation for Baseline Correction in NMR-based Metabolomics." Wright State University / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=wright1271689072.
Full textMartindale, Linda. "Threshold concepts in research and evidence-based practice : investigating troublesome learning for undergraduate nursing students." Thesis, Durham University, 2015. http://etheses.dur.ac.uk/10998/.
Full textGiang, Truong Minh Triet, and trietgiang@yahoo com. "Efficient Admission Control Schemes in Cellular IP Networks." RMIT University. Electrical and Computer Engineering, 2006. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20060829.113000.
Full textJohanson, Jamin K. "An Evaluation of State-and-Transition Model Development fo Ecological Sites in Northern Utah." DigitalCommons@USU, 2011. https://digitalcommons.usu.edu/etd/920.
Full textHuber, Florian. "Structural breaks in Taylor rule based exchange rate models - Evidence from threshold time varying parameter models." WU Vienna University of Economics and Business, 2017. http://epub.wu.ac.at/5461/1/wp244.pdf.
Full textSeries: Department of Economics Working Paper Series
Lin, Wei-Ting, and 林煒珽. "Steganography Based on Threshold Secret Sharing." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/sdghuw.
Full text國立臺灣海洋大學
資訊工程學系
105
Secret sharing is a very important part of modern cryptography. Secret image sharing technology is the expension of traditional secret sharing. When using this technology to share images, this technology can ensure the integrity and security of the secret image. This thesis discussed the main of steganography based on threshold secret sharing, so QR code applied to information hiding with the properties of storage data and error correction capability. The dealer generated shadow images by using secret image sharing scheme. Then user recorded the pixel values of shadow images, and transform into QR code by a program. To ensure QR code is maliciously destroyed that can decode and obtain the pixel value of the shadow images, thus restoring the secret image of the dealer. In this thesis, secret image used n shadow images which is generated from (t, n) threshold secret image sharing scheme. If the dealer wants to restore the secret image, he needs at least t shadow images. Besides, QR code as a watermark embedded in the original image as well as cropping, brightness, and compression attack watermarked image in the part of watermark test. After the QR code is extracted, the participanting party determine the QR code whether it can be transformed into shadow images. Finally, we show the secret image sharing and restoring scheme in this thesis is feasible by restoring the secret image from shadow images, and ensure the integrity and security of secret image.
Chun-Chung, Yu, and 游俊忠. "Evolutionary Threshold-based Business Rating System." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/81418865721017798361.
Full text國立高雄應用科技大學
資訊管理研究所碩士班
96
In recent years, the serious financial issues occurred frequently. For example: Asian Financial Crisis, Subprime Mortgage. These crises have related to bank inadequacy management. Loan business is a major source of bank profit. Most of all loans belonging to enterprise loans. Therefore, the management of corporate default risk, it is much more important. Many country are active in Basel II as the main guiding principles for credit risk management related reforms. Basel II suggest banks to adopt the IRB( Internal Rating Based Approach). IRB allow banks to own strategy based on demand. It can build more autonomy and flexibility credit risk rating system. Statistics model and variable selection method are important elements of default forecast model. Logistic regression is a simple and easy-to-use regression model. It only applies to solve the problem of divided into two categories forecast. Although the cumulative logistic regression model can be divided into many categories. But the cumulative logistic S-curve of the cumulative probability that hard to distinguish between the thresholds. In this study, we use of multiple combinatorial logistic regression to improve and combine genetic algorithm to develop Evolutionary Threshold-based Business Rating System. Finally, we verified multiple combinatorial logistic regression model and TCRI model by Basel II proposing method. The experimental results found that in addition to the stability of model no better than TCRI. Use samples that close to default time to training MCLR rules will be more effective forecasting.
Chen, Huei-Ju, and 陳蕙茹. "Threshold Signature Schemes Based on Quadratic Residue." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/52885485616990182011.
Full text國立臺灣大學
電機工程學研究所
90
Due to the fast progress of computers and communication networks, more and more electronic services are provided. Many of them require digital signatures such as voting and document issuing. By distributing power of generating signatures among a group of people, threshold signatures not only secure the group private key but also increase the availability of the signing service. Existing threshold signatures are based on either discrete logarithm or RSA. However, most of them require many exponential operations and some even have very cumbersome mathematical structures. In this thesis, we propose a user and signer efficient threshold signature scheme based on QR to achieve security as well as efficiency. Two modifications are also presented, the first one to enhance availability of signing service and the second one to add anonymity and traceability. These proposed schemes are shown to be correct, secure, robust, as well as computationally efficient. Also adversaries would not be able to forge signatures on a message. The efficiency of proposed schemes would meet the need for more and more sophisticated and advanced electronic and Internet services.
Huang, Po-Kai, and 黃柏凱. "speech enhancement based on audible masking threshold." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/79153188367709186735.
Full textHuang, Shao-nung, and 黃劭農. "Identity-based multi-proxy threshold signature scheme." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/68572252859043360980.
Full text逢甲大學
資訊工程所
95
We present three identity-based multi-proxy threshold signature schemes. First one is easier to manage. the second one is anonymity, the third one is anomymity and traceable. The main features of our proposed work are: (a)ID-based scheme reduces certificate management, (b) riginal signers and proxy signers are both allowed to be a group (c) only t or more proxy signers of the group can cooperatively issue a proxy signature on behalf of the original signer group, (d) the first and the third proposed schemes, we allow anyone join the original group without reset the system, (e) we support anonymity ability for the second and the third proposed schemes, (f ) in traceable scheme, if it’s necessary we can trace the co-signers of a certain signature. Furthermore, our proxy signature scheme is shown to be secure against forgery attacks.
Huang, Chung-Yuan, and 黃宗元. "Threshold Proxy Signature based on GQ scheme." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/09427588242274926553.
Full text國立交通大學
資訊科學系
91
A (t,l) threshold proxy signature is a signature scheme that is designed to delegate the original signer signing capability to a designated group of l proxy signers. Only any t or more proxy signers of the designated group can generate the proxy signature behalf of the original signer. In this thesis, we propose the first (t,l) threshold proxy signature scheme based on GQ signature. The proposed scheme satisfies all requirements of a proxy signature and a threshold signature under adaptive adversary.
Huang, Xiao-Wei, and 黃曉偉. "An RSA-based (t, l) Threshold Proxy Signature." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/89591276325242220711.
Full text國立臺灣海洋大學
資訊工程學系
95
In this thesis we propose and analyze a new RSA-based proxy signature scheme and its corresponding (t, ) threshold scheme. Unlike numerous previous research works, the threshold proxy scheme does not require any trusted combiner and is thus a truly practical approach. The security of both schemes is based on the RSA assumption. Both schemes are existentially unforgeable against no message attack in the random oracle model and especially the threshold proxy scheme inherits the merit of its predecessor - Shoup’s RSA threshold scheme - and thus is secure under a multi-party computation setup with active adversaries.
Hung, Yuan-Ying, and 洪沅瑩. "Analysis of Charge Pump Based Threshold-Compensated Rectifiers." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/kvxp4z.
Full text國立勤益科技大學
電子工程系
105
Wireless sensor network (WSN) require sensor nodes which must be small with simple structure and low cost. It also needs long-distance communication technique to obtain a variety of information and to minimize the number of base stations. How to supply a continuous power to sensor nodes is a key issue of WSN design. Therefore, energy harvesting techniques become increasingly important in solving WSN power supply issue. The main building block in a radio frequency (RF) energy harvesting system is an RF to direct current (DC) rectifier. Based on both TSMC 0.18μm and 90 nm CMOS processes, the different threshold voltage (VTH) MOS transistors will be used in design RF to DC rectifier to study the design tradeoff between VTH and leakage current. In addition, voltage attenuation and dead zone problems existed in the traditional charge pump will be discussed. The experiment environment is set to be input frequency at 900MHz, RF input voltage peak 0.4V, and the load current 15uA or load 1 M Ω, to explore the conversion efficiency (η). Experimental results of FCR (Feedback Compensation Rectifiers, FCR) rectifier show that the output voltage is boost to 2.13V and the efficiency is 48.59% by using Normal_2 TSMC 0.18um process technology. If the 90nm Normal_2 used to design RF to DC rectifier, the post-sim output voltage is 2.01V and the efficiency is 15.06%. Experimental results of CR5S (Cross-Coupled Rectifiers 5 Stage, CR5S) rectifier show that the output voltage is boost to 1.49V and the efficiency is 25.63% by using Normal_2 TSMC 0.18um process technology. If the 90nm Normal_2 used to design RF to DC rectifier, the post-sim output voltage is 1.73V and the efficiency is 0.82%.
Tran, Ngoc Dang Khoa, and 陳玉登科. "Design of Threshold Accelerometer Based on Multistable Mechanism." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/m5hp6b.
Full text國立中興大學
精密工程學系所
106
A compliant tristable mechanism (TM) has been applied to develop a threshold accelerometer. The accelerometer is capable of sensing two distinct inertial signals when acceleration thresholds are exceeded along one axis. This function allows the flexibility to detect two consecutive events with the expected threshold values of the stimuli or two level quasi-static acceleration thresholds. The TM is a series connection of two bistable mechanisms (BMs). An analytical model based on a chained beam constraint model (CBCM) is developed for design and characterization of the TM. Feasibility of the device is demonstrated by experiments. The developed analytical model for the TM is verified by finite element analyses and experiments. Detection accuracy and fault tolerance can be enhanced by the thresholds created by snap through behavior of the TM.
Cheng, Chung-Chuan, and 鄭中川. "Automated Lung Segmentation Based on Grey-level Threshold." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/4f5feu.
Full text朝陽科技大學
資訊管理系碩士班
94
Lung is one of the most important organs in the body. Medical Image analysis can be used to aid the diagnosis for the clinicians, to trace the progression of diseases. By applying the object segmentation technique in medical images, the contours of organs can be detected and used to analyze the tissue characteristics. Subsequently, these can be provided to doctors and researchers to aid their works. X-ray is the most widely used imaging modality for diagnosing diseases occurred in the chest and other anatomical organs. It is cheap and commonly taken routinely. This study investigates PA View chest radiographs. Canny edge detector and active contour models (ACM) are widely used techniques for object segmentation in medical images. However, the main weakness of the ACM is that an initial contour must be given so that the contour can be attracted to a proper position. In addition, it is time-consuming. For application in lung segmentation, it is easy to be interfered by the rib cage. This study proposes a fast method for lung segmentation. Salient features of chest images are used to locate the lung field. After the Canny edge detector has been adopted to detect edges and to find the approximated contours of the III lung lobes. Finally, the contours of the lung lobe with great accuracy can be obtained.
"Testing of threshold logic latch based hybrid circuits." Master's thesis, 2013. http://hdl.handle.net/2286/R.I.20796.
Full textDissertation/Thesis
M.S. Electrical Engineering 2013
WANG, YEN-TING, and 王彥婷. "A HIGH PERFORMANCE THRESHOLD VOLTAGE BASED TEMPERATURE SENSOR." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/03935992866969689706.
Full text大同大學
電機工程學系(所)
98
A smart temperature sensing system with digital output consists of a temperature sensor and a voltage reference in the front end and an analog-to-digital converter (ADC) in the back end. In this thesis, a threshold-voltage based temperature sensor has been presented, and a low temperature coefficient voltage reference is achieved by using a pn-junction proportional to absolute temperature (PTAT) current generator to compensate the threshold-voltage based temperature sensor. In addition, a 7-bit flash ADC has been designed to convert the output of the temperature sensor to a digital code. The simulation results obtained from HSPICE using a standard TSMC 0.18um CMOS models and 1.8V power supply are presented in this thesis. This sensor is almost insensitive to the supply and is very linear dependent to temperature. The simulation result shows that the voltage output of the sensor has the temperature error of ±0.07°C from -20°C~100°C, and temperature coefficient of it is -1.239 mV/°C. The low temperature coefficient voltage reference has the result of 1.51V, and the temperature coefficient is 1.058ppm/°C. The 7-bit flash bit has the INL of 0.32LSB, and DNL of 0.38LSB, which can meet the requirement of the temperature sensing system with 1°C resolution.
Wang, Zhi-Wei, and 王志暐. "Threshold-Based Admission Control for an MMS Server." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/83195093885446878932.
Full text元智大學
資訊工程學系
92
Multimedia messaging service (MMS) promises a dramatic increase in messaging capabilities that will enrich user experience and a major new source of revenue for network operators as well as content and service providers. However, despite the advances in this area, the ability to exchange large amounts of information further fuels the demand for more resource-intensive applications and affects the bandwidth allocated for ensuing transactions. In addition, delays perceived by users can increase depending on the size and location of the multimedia content. In this paper, we propose a QoS control strategy, called Threshold-Based Admission Control (TBAC), for an MMS server supporting two types of MMs: high- and low-priority. Taking the forwarding and the expiration effects of queued MMs into account, this paper develops an analytical model to study the TBAC performance. On the basis of the analysis, the optimal threshold for the TBAC strategy is numerically determined so that the bandwidth is efficiently utilized and the QoS requirements for both classes of MMs are satisfied.
Liu, Yi-Cheng, and 劉毅成. "Image Sharing Based on Shamir's (k, n) Threshold Scheme." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/83465976504422940023.
Full text國立清華大學
資訊系統與應用研究所
99
一般典型的秘密影像分享技術,是由一莊家將秘密影像切分成n張分享的子圖,並交由n位參與者保管,使得只要收集到其中任k張就能回復秘密影像,同時若少於k張則無法得知足夠的訊息去還原這張秘密影像。這個影像分享的觀念來自於1979年,由Blakley及Shamir所各別研究提出的(k, n)門檻方法。 在本篇論文中,我們提出一個方法來實作秘密影像分享,其中利用affine cipher的概念與林志青教授等所提出的架構,來得到重組後的影像與產生分享的子圖。在所提出的方法中,於分享的步驟前,我們選定(a, b)兩個數來當作鑰匙,並利用它們來對像素位置做洗牌,同時保有原來直方圖的分布。這個方法打亂了原來像素間的相關位置,避免使分享的子圖暴露出秘密影像的輪廓。我們提供了兩張影像與兩組重組鑰匙來做為實驗結果。
Wu, Cheng-Han, and 吳承翰. "(4,6)-Threshold Image Sharing Based on Chinese Remainder Theorem." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/f3uu5s.
Full text國立清華大學
資訊工程學系所
106
For the reason that the rapid growth of information in the era of Big Data nowadays, information security plays an important role. To avoid secret information carried by single carrier, this thesis studied image sharing based on (k,n)-threshold scheme, which distributes a secret image to n shadow images preserved by n participants. Collect at least k of them, we can recover the secret image, but fewer than k of them could not. We proposed a method for the extension of Chuang’s scheme [Chua2016] based on Chinese Remainder Theorem in this thesis. Compared to other image sharing methods, our method is much simpler and efficient. Although the recovered image in our method has the difference of the least significant bit with the secret image, the experimental result shows that human beings can hardly distinguish two pictures with PSNR value over 50db. Moreover, we can additionally process the least significant bit of each pixel during the sharing and recovering parts if we want to recover the image completely.
Syu, Jhih-Hao, and 許智豪. "Reliable Heterogeneous Mobile Cloud Storage Based on Threshold Technology." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/96044018892634842204.
Full text樹德科技大學
資訊工程系碩士班
101
Due to the popularity of cloud computing, a lot of cloud services have created. Therefore, the cloud storage service is one of the most characteristic services in recent years. Before the cloud storage service has not been prevalent, the data generally exist inside the hard disk. However, because the aging of cloud storage technology, many today''s service providers have been offering unique conception of cloud storage services. Its advantages such as: (1) On-line without hindrance: As long as accessing to the Internet, there are immediate features of on-line or off-line. (2) Simple operation: Neither having to learn difficult IT technology nor need to update or repair. (3) Suitable for the development of applications: Related service providers will release the development documents for development community. (4) Without purchasing any hardware and save cost. In summary, cloud storage services gradually are the general public''s favorite, also an increasing number of businesses use it to store data. Consequently, the user interfaces of the service providers are different, so that the files on cloud storage services emerged inconvenience and safety concerns. For example, there are confidentiality problems of files stored in the cloud storage service, as well as the availability problem due to service interruptions resulting file missing. Therefore, we hope to create a unified operating platform to enhance the confidentiality of cloud file storage services. And if a service interruption resulting in missing files, the system can recover files through several service providers systems. In this thesis, threshold secret sharing and WuKong heterogeneous cloud storage system are the thesis''s main frameworks. Threshold secret sharing depends on the user’s settings, scatter secret content into many a pieces and it doesn''t have any meaning. But if having not taken back definite framework can combine different cloud storage service resource. And users can set operating pattern independently, integrating with different operating platform, let the users be easy stocking data. Therefore, this paper is aimed at Wukong''s way and present misgiving of cloud storage service suggest some hiatus, such as keep the file in the confidentiality of cloud storage service, service abort leads to file lose. For solving this kind of problem, utilize the method in this paper, for instance, threshold secret sharing to solve users’ mistrust and data safety with cloud storage service, and research HDFS now to restoration lose or destroy data. The framework of this research is integration of different cloud storage service''s API, scatter threshold''s principle to solve the file''s adaptability, and cryptographic symmetric encryption to increase confidentiality. Finally, integrate various platform, increase users convenience and look for more efficient encryption method to increase file confidentiality and adaptability. The implementation of this system is mainly in the mobile device environment, the hardware specifications includes CPU 1.6GHz quad-core processor, 2GB RAM and 32GB ROM, the system environment for the Android 3.0 Honeycomb or more. Development environment includes Eclipse Developer, Android SDK, Java JDK 1.6, DropBox Android SDK 1.5.4 and SQLite database system.
Ren, Deng Yi, and 任登義. "ATM AAL receiver design supporting threshold based buffering mechanism." Thesis, 1996. http://ndltd.ncl.edu.tw/handle/35021372177170968123.
Full text國立臺灣大學
資訊工程學研究所
84
A broad-band terminal adaptor (BTA) is needed in the internetworking unit between LANs and ATM network to provide the necessary conversion of data packets. The ATM adaptation layer (AAL) design is the kernel component in BTA. In this thesis, we examine the AAL5 BTA implementation problems and discuss some of their solutions. Design issues of AAL5 consists of the transmitting end and the receiving end. In the transmitting end, AAL5 deals mainly with data segmentation and generates CRC field. At the receiving end, the AAL5 entry receives ATM cells, reassembly them into a upper layer PDU, detects error and handles cell loss. In this thesis we focus design issues at the receiving end. Since an AAL5 may support multiple virtual channels at the same time, at AAL5 entry receiving end needs to be equipped with sufficient reassembly buffers to temporarily store many partially-reassembled messages. Meanwhile, if the host interface is busy and network is heavy loaded, how the BTA handle heavy traffic becomes an essential issue. For example, if one can reduce the events of discarding cells due to buffer overflow the packet level throughput can be improved. Here we propose a useful buffer management mechanism, which is named Threshold-Based Buffering Mechanism, to reduce performance degradation level. This mechanism sets a threshold on reassembly buffer. In congestion, once reassembly buffer space excesses threshold, the receiving end BTA will choose the longest packet in reassembly buffer and then deliver part of it to the upper layer even it is still incomplete.
Tang, Chi-Feng, and 唐啟峰. "A Threshold-based Matching Algorithm for Photonic Clos Network Switches." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/32266835842900584556.
Full text國立中興大學
資訊科學研究所
94
This thesis is concerned with a cell matching algorithm for the three-stage Clos network. The three-stage Clos network not only provides more switch capacity but also decreases the numbers of switch elements in the network. Matching algorithms are used to solve the scheduling problem on the Clos network. In this thesis, we propose a new matching algorithm, with features of the cut-through, variable threshold mechanism and preemption mechanism. Our study on performance evaluation focuses on the bursty traffic model. We present the simulation results by t-MAC, and show the improvement of transmission efficiency.
Chen, LungHsi, and 陳隆熙. "A Reliable Solver of TSP─Based on Threshold Accepting Algorithm." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/16429388038282845419.
Full text大葉大學
工業工程研究所
90
Threshold Accepting(TA)method is a meta-heuristic algorithm to solve the optimization problem. Like the Simulated Annealing(SA)method, the result of TA varies from one run to another. Here we propose to find a reliable TSP solver such that the optimal solution is guaranteed within a specified number of function evaluations. The method is called “Double Threshold Accepting Algorithm”, or called Double TA for short. In this algorithm, the threshold value is decomposed into two parts : normalized threshold value and cap. The threshold value is equal to normalized threshold value multiplied by cap. First, we plan to find that with a proper selection of threshold values in TA, the empirical result shows it always converges to the optimal solution in the regular-grid TSPs. The experiment will be performed on 18 cases ranging from 16 through 441 points(cities)and each case is executed 100 times. We desire that they all converge to the optimal solution within the specified limit of number of function evaluations. The pattern of threshold is in the shape of natural cubic spline and can be constructed by several control points. The scale is termed cap and can be obtained from the cap function of positive changes of the cost function in the step of move from a sub-optimal tour to a global optimal tour. The TA is performed twice in our implementation where the name “Double Threshold Accepting” is derived. The second run of the TA makes sure the optimal value is obtained in case it slips away from the optimal in the first run. Furthermore, we plan to apply it to other practical problems listed in the literature especially the Grotschel’s pcb442 problem. This problem is notorious because it has many degenerate points nearby the global optimal.
Chang, Ching-Lueh, and 張經略. "Analysis of Threshold-Based Processes of Cascading Activation in Graphs." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/00673767390340864352.
Full text臺灣大學
資訊工程學研究所
98
Let $G(V,E)$ be a simple directed or undirected graph and $phi(v)geq 1$ for each $vin V$. The following process and its variants have been studied extensively in the literature. Initially, only a set of vertices, called the seeds, are active. Thereafter, an inactive vertex $v$ is activated when at least $phi(v)$ of its in-neighbors are active. The process ends when no additional vertices can be activated. We derive bounds on the minimum number of seeds needed to activate at least a $deltain [0,1]$ fraction of the vertices at the end, for the following cases: egin{itemize} item $G$ is an Erd{H{o}}s-R{''e}nyi random graph. An inactive vertex is activated when at least a $ hoin [0,1]$ fraction of its neighbors are active. item $G$ is a connected undirected graph. An inactive vertex is activated when more than half of its neighbors are active. item $G$ is a directed graph with positive indegrees. An inactive vertex is activated when at least half of its in-neighbors are active. item $G$ is a directed graph with positive indegrees. An inactive vertex is activated when more than half of its in-neighbors are active. item $G$ is a directed graph, $phi(v)geq 1$ for all $vin V$ and $delta=1$. end{itemize} We also investigate the computational hardness of finding a minimum set of seeds activating all vertices at the end.
Chen, Yu-Gou, and 陳裕國. "Estimating the Green Threshold of Enterprises Based on Utility Matrix." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/50959339610915103911.
Full text康寧大學
運籌與科技管理研究所
99
With the current global warming crisis, the obvious greenhouse gas effect has had an impact on the sustainable development of many, if not all countries that it has been one of the main concerns of the government and the citizenry. Government agencies and non-profit organizations actively discuss the necessary measures for environmental protection and promoting afforestation, especially the setting in place of an evaluation system which is expected to help determine the measures necessary to recover the original appearance and function of natural ecology. Global environmental greening campaigns not only appeal to the enterprises to develop various business opportunities from the use of green energy but also to actively create a green enterprise image, advocate environmental and social responsibility and enhance operations by remaining competitive in this aspect. It will be the future trend for enterprises to invest in environmental protection and to incorporate the setting up of a green management into their operations. The research mainly discusses the level of participation towards environmental protection and afforestation by case enterprises in Taiwan in the course of their operations, and applies the multiple criteria decision making as the basis for the research methods. First and foremost, reports of Greenbiz Company were taken to assess the index and a set of assessment index system for the environmental protection and afforestation programs of enterprises was established. The companies’ afforestation and environmental protection programs were sorted and classified, and the elements used for the assessment methods were analyzed. There are 6 dimensions and 21 standard elements. The 6 dimensions include green economy and industrial structure, green innovation, social responsibility, environmental impact, employees and working environment and the use of resources. Then according to the experts’ questionnaire survey, weighting of dimensions and criteria will be calculated using the method of analytic hierarchy process. In addition, grading the threshold value of every element will be calculated using the questionnaire given to enterprises. Finally, the VIKOR ranking method which can produce compromising solutions will be applied to rank the case enterprises in Taiwan and discuss the level of afforestation participation in the course of their operations and rank them in terms of quality. Based on the results of the research, strengthening the dissemination process of green information and presenting competitive advantages of green companies are indicated as some of the strategies that can be done. Screening qualified case enterprises to improve the competitiveness and enterprise image is also considered so as to help them obtain maximum profits and margins. The highest goal is to improve operational efficiency while taking into account environmental protection measures and therefore create an enterprise with a sustainable operational environment.
Chang, Juei-Feng, and 張瑞芳. "Image Threshold selection based on PSO and 2D-Otsu Algorithm." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/90250525774143478346.
Full text國立中央大學
通訊工程學系在職專班
101
Threshold selecting is a significant technique for image segmentation, which is applied broadly in many fields such as character recognition, analysis of biologic images etc. The method mainly includes P-tile method , the maximum entropy method , Otsu and so on. It is essentially a pixels classification problem. Its basic objective is to classify the pixels of a given image into two classes: one is those pertaining to an object and another is those pertaining to the background. While one includes pixels with gray values that are below or equal to a certain threshold, the other includes those with gray values above the threshold. As an extension of Otsu algorithm, two-dimensional Otsu algorithm (2D-Otsu) can give good result for those objects whose histogram does not have two peaks which represent objects and background, however, it costs complex computation. Particle swarm optimization (PSO) is a swarm intelligence optimization algorithm as a set few parameters, better global search capability, search results more stable and widely used. So we combined successfully these two algorithms to get ideal segmentation result with less computation cost.
Chung, Chun-Hua, and 鐘俊驊. "ILP-Based Multi-Threshold Voltage Assignment for Leakage Power Reduction." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/85654015920881135264.
Full text中原大學
資訊工程研究所
97
Along with the shrink of Integrated Circuit (IC) process technology, the consumption of dynamic power reduces due to reduction of the supply voltage. However, the consumption of static power occupies a greater proportion of entire power consumption. The consumption of leakage power occupies about half of entire power consumption in 90nm process technology. Therefore, how to reduce the consumption of leakage power has become an important issue for the deep-submicron chip design in the future. This research paper proposes a method to reduce leakage power with the application of integer linear programming (ILP) on the swapping of multi-threshold voltage. The objective of this paper is to retain the performance of original circuit design while effectively minimizing the consumption of leakage power in various timing constraionts. First, we perform static timing analyze, as well as formulate the corresponding consumption of circuit power and timing model of integer linear programming. We then resolve the integer linear programming problem and acquire the optimal solution for the model of integer linear programming by using the commercial linear programming software (LINGO v11). This paper utilizes ISCAS’85 benchmark for the testing circuit; the benchmark circuit power consumption and timing model are realized with TSMC 90nm standard library. Comparing to the original design, the experimental results indicate that the dual-threshold and multi-threshold voltage approach can provide up to an average of 66.11% and 69.52% of leakage power reduction, respectively. In addition, the average runtime of our integer linear programming model in LINGO v11 for all circuits is less than three minutes.
Lin, Shu-Ying, and 林書瑩. "Stock returns and trading volume based on double-threshold models." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/21239669295383854335.
Full text逢甲大學
統計與精算所
92
This paper examines the hypothesis that both returns and volatility respond asymmetrically to past volume and returns. The approach we adopt is based on a double threshold GARCH model. The main feature of this model is to allow the threshold nonlinearity in mean and volatility to be determined by lagged changes in trading volume and returns. The error terms are assumed to be fat-tailed distribution to capture the usual conditional leptokurtosis in financial return data. Estimation is performed using Markov chain Monte Carlo methods. The proposed methodology is illustrated using both simulated and international market index data. By employing our double-threshold GARCH model to investigate five major stock market return series, we find strong evidence to support the existence of return spillover effect and asymmetric relationships between returns and changes in trading volume. We also use the posterior odds ratio to determine which threshold model is the best among the standard GARCH and eight possible threshold GARCH models.
Lin, Ying-Hsiu, and 林映秀. "Triple Visual Secrets Sharing Scheme Based on (2,) Threshold Scheme." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/19918992101736917368.
Full text嶺東科技大學
資訊科技應用研究所
97
Visual cryptography, the theme of this research, was first proposed by Naor and Shamir in 1994; Its greatest advantage is in decryption, which requires only superimposing the share images, no complicated computation or cryptology is required. Most traditional visual cryptology technologies are based on one secret image between two share images and the halftoning scheme to handle the gray-scale images. This research proposes a triple visual secrets sharing scheme with two share images-a three blacks and one white pixels Share A and a two blacks and two whites pixels Share B. By rotating clockwise and counterclockwise each 2*2 black of the Share A, it allows the two share images to hold three kinds of confidential messages. The construction, which based on (2,2) threshold scheme, handles Share A and Share B; also utilizes bit-level decomposition and superimposition techniques to replace the traditional halftoning scheme. This scheme, which is not affected by the different color tones, can be applied to black-white and grey-scale visual cryptography, and the color images as well. Moreover, the triple visual secrets sharing schemes in this study is an easy information hiding procedure and generates uniformly distributed share images. Keywords: Visual Cryptography, Share Image, Secret Image, Grey –Scale Image, Bit-Level, Color Image
Wang, Po-Hsueh, and 王柏學. "Downlink Scheduling Algorithm Based on Delay Threshold in LTE Systems." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/89hnnz.
Full text國立中興大學
資訊科學與工程學系
103
Modified Largest Weighted Delay First (M-LWDF), Exponential Proportional Fair (EXP/PF), and Channel Dependent Earliest Due Date (CD-EDD) are commonly frequent referenced algorithms for downlink scheduling the requests of real time multimedia applications in LTE downlink systems. They take into account of both channel quality and packet delay in the decision of packet dispatching. However, when a packet gets close to its delay budget, it may be eventually dropped without raising its delivery priority quickly with M-LWDF, while the packet with good channel condition but short waiting time may not be scheduled due to its packets selection emphasizing on the earliest time to expire with CD-EDD, as well as with EXP/PF. By considering both the channel condition and packet waiting time, we propose a delay threshold scheduling (DTS) algorithm in this paper. We adopt delay thresholds to differentiate packets and apply different proportional weights between channel condition and waiting time to prioritize real time services. Simulation results show that, by adopting DTS, higher throughput for video traffic, lower packet delay and less packet loss ratio for real time services than M-LWDF, EXP/PF, and CD-EDD can be achieved.
Husaini and 胡桑尼. "A Threshold-based Cloud Resource Allocation Framework with QoS Considerations." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/p322cu.
Full text國立交通大學
電機資訊國際學程
103
Resource allocation, which is the process of assigning the amount of resources needed by cloud applications, is very crucial concern in the service provision. If the allocation of resources is not managed precisely, the cloud services may starve during the peak load time or waste the resources during the off-peak time. Auto scaling mechanism is one approach used in IaaS in which service providers can maintain the resources and reduce waste resources by automatically increase or decrease them when needed. Some of the cloud services support auto-scaling functionality. However, it is still difficult to predict the client side experience which later will cause in decreasing performance because of lacking computing instances. In this paper, we focus on allocating resources at the application level rather than mapping the physical resources to virtual resources for the efficient resource utilization. We present a novel cloud resource management framework which supports dynamic auto-scaling. The proposed system will monitor the end-user’s response time directly from client-side. We defined several thresholds with Quality of Services (QoS) considerations which include response time and error rates sampling in order to optimize the decision of reallocating the virtual resources. The goal of this study was to dynamically allocate the virtual resource among the cloud applications based on their workload changes in order to improve resource utilization, prevent from resource starvation and reduce the user usage cost. The experimental results show the proposed framework can improve the efficiency of resource utilization.
Masunda, Kennedy Tohwechipi Fudu. "Threshold based multi-bit flipping decoding of binary LDPC codes." Thesis, 2017. https://hdl.handle.net/10539/24242.
Full textThere has been a surge in the demand of high speed reliable communication infrastructure in the last few decades. Advanced technology, namely the internet has transformed the way people live and how they interact with their environment. The Internet of Things (IoT) has been a very big phenomenon and continues to transform infrastructure in the home and work place. All these developments are underpinned by the availability of cost-effective, reliable and error free communication services. A perfect and reliable communication channel through which to transmit information does not exist. Telecommunication channels are often characterised by random noise and unpredictable disturbances that distort information or result in the loss of information. The need for reliable error-free communication has resulted in advanced research work in the field of Forward Error Correction (FEC). Low density parity check (LDPC) codes, discovered by Gallager in 1963 provide excellent error correction performance which is close to the vaunted Shannon limit when used with long block codes and decoded with the sum-product algorithm (SPA). However, long block code lengths increase the decoding complexity exponentially and this problem is exacerbated by the intrinsic complexity of the SPA and its approximate derivatives. This makes it impossible for the SPA to be implemented in any practical communication device. Bit flipping LDPC decoders, whose error correction performance pales in comparison to the SPA have been devised to counter the disadvantages of the SPA. Even though, the bit flipping algorithms do not perform as well as the SPA, their exceeding low complexity makes them attractive for practical implementation in high speed communication devices. Thus, a lot of research has gone into the design and development of improved bit flipping algorithms. This research work analyses and focusses on the design of improved multi-bit flipping algorithms which converge faster than single-bit flipping algorithms. The aim of the research is to devise methods with which to obtain thresholds that can be used to determine erroneous sections of a given codeword so that they can be corrected. Two algorithms that use multi-thresholds are developed during the course of this research. The first algorithm uses multiple adaptive thresholds while the second algorithm uses multiple near optimal SNR dependant fixed thresholds to identify erroneous bits in a codeword. Both algorithms use soft information modification to further improve the decoding performance. Simulations show that the use of multiple adaptive or near optimal SNR dependant fixed thresholds improves the bit error rate (BER) and frame error rate (FER) correcting performance and also decreases the average number of iterations (ANI) required for convergence. The proposed algorithms are also investigated in terms of quantisation for practical applications in communication devices. Simulations show that the bit length of the quantizer as well as the quantization strategy (uniform or non-uniform quantization) is very important as it affects the decoding performance of the algorithms significantly.
MT2018
Jing-YuHuang and 黃境昱. "A Reliable Near-threshold Voltage SRAM-based Physical Unclonable Function." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/3ff7jx.
Full textLai, Tien-Hsiang, and 賴天祥. "Threshold Biometrics-based Remote User Authentication Scheme Using Smart Cards." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/84566735069847588327.
Full text中國文化大學
資訊管理研究所
97
Combing biometrics characteristics with usage of smart card for identification recognition has been widely discussed. Researches on the technology are addressed in the undeniable uniqueness for identification. Hwang-Li at year 2000 and Lee and et al. at year 2002 respectfully proposed identification frameworks based on the finger-print recognition. Their innovative algorithms allow finger-print identification. However, the proposed frameworks still have the problems of the security weakness, which are unable to avoid camouflage attacks. In this thesis, we have analyzed Hwang-Li and Lee’s algorithms and raised the issues of the security loophole. In advance, we propose an improved framework and the algorithms to amend the problem of the Hwang-Li and Lee’s system. To fix the shortcomings of Lee’s proposed framework, our proposed framework can ensure that only certified users are allowed to access the information in the system. In addition, our framework innovatively utilizes the secret sharing technology upon identity verification technology, which strengthens the security of the entire algorithm. To consider the users’ security while using the bio characteristics information, we have innovatively utilized secret sharing technology on the verification technology. Within this framework, not only the biometrics characteristics replace the passwords, but also the users are allowed to spread out a certain amount of information when needed and to modify their passwords directly. The proposed framework can protect the system from both the reply attacks and the offline-dictionary attacks. The effectiveness, security and privacy of our proposed framework are verified.
Li, Shih-hsun, and 李士勳. "Traceable identity-based threshold signature scheme with multiple signing policies." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/96958193977543784971.
Full text逢甲大學
資訊工程所
95
We propose to work on identity-based cryptosystem that provides traceable threshold signature with multiple signing policies. There are four distinct features of the proposed systems: (a) identity-based public key, allowing uses to use name, email address and/or phone numbers as their public keys; (b) multiple signing policies, the threshold values can be chosen as different signing policies; (c) single private key for each user; and (e) all signers are traceable. Analysis will be given to show that our proposed cryptosystem is secure under various attacks.
Kan, Chia-Chao, and 甘家兆. "An Efficient Secure Broadcast Model for PHF-based Threshold Cryptosystems." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/02194404910583680880.
Full text國立交通大學
資訊科學與工程研究所
94
The thesis targets for the particular requirement of secure broadcast on PHF (Perfect Hash Family)-based threshold cryptosystems on wireless networks, and we propose a method for doing such secure broadcast. There is a property on PHF-based threshold cryptosystems: The users in the system can be partitioned into groups by the shares they keep. In such perspective, the secure communication between groups and within groups will be an issue which is needed to be solved. If such issue has been solved, then we can play applications of "share renewal", etc. Moreover, consider the native property of communication on a wireless network. If we apply broadcast technique, then we can reduce the communication cost greatly. The paper in [1] gave a general secure broadcast scheme. It needs a TA (trust authority) to do the distributions of pre-key. However, in some wireless networks (Ex:Mobile Ad-hoc Network[2]), the existence of a TA is not practical at all. In the thesis, we propose a secure broadcast model on PHF-based threshold cryptosystems. It needs not a TA, and also, the communication cost while doing secure broadcast is less than [1].
Yang, Shun-Yuan, and 楊順元. "A secure e-mail system based on (2,2) threshold scheme." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/43930935730343885323.
Full text國立雲林科技大學
電子與資訊工程研究所碩士班
90
Email has been the Internet’s killer application since 1970s. Early email systems were lack of security services to prevent sensitive information from disclosure. Though many variations of Email software such as PGP, PEM and S/MIME support secure email services, they cannot control the recipient’s behavior. For example, the recipient can copy, print, past and forward the important and sensitive emails intentionally or unintentionally. In this paper, we propose a new architecture of secure Email system based on (2,2) threshold scheme and cryptographic technology to not only provide confidentiality, integrity, authentication and nonrepudiation services during email transmission, but also control the recipient’s behavior according to the security rules set by the sender.
Huang, Pao-Wei, and 黃寶瑋. "An Uplink Scheduling Algorithm based on Adaptive Threshold in WiMAX Networks." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/47564556191485019011.
Full text國立高雄應用科技大學
電機工程系
98
WiMAX network define Broadband Wireless Access(BWA).WiMAX provides high speed and wide range wireless network services. Although the WiMAX standard provided the main principles in designing a QoS architecture to support multimedia applications, the important issue is uplink scheduling, bandwidth allocation and admission control. In recent years, lots of researches in uplink schediing are focusing on system throughput and the issues how to uplink scheduling efficiently in WiMAX network becomes important. In this paper An Uplink Scheduling Algorithm based on Adaptive Threshold in WiMAX Networks (US-AT Algorithm) that focused system throughput and total revenue. This Algorithm used the rtPS queue size to determine the system to Non-Critical State or Critical State;In Non-Critical State, first set rtPS deficit counter to lower bound and change the nrtPS and BE deficit counter to get proportional or weighted. In the Critical State, first calculates the real-time application packet deadline and divide packets levels, finally use the ladder state to have adequate deficit counter..The US-AT algorithm could efficiently to improve the real-time requirements and provide more QoS guarantee in WiMAX network.