To see the other types of publications on this topic, follow the link: Random information.

Dissertations / Theses on the topic 'Random information'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Random information.'

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.

1

Sneltvedt, Tommy. "Sequential value information for Markov random field." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for fysikk, 2011. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-13500.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Higgins, Julian P. T. "Exploiting information in random effects meta-analysis." Thesis, University of Reading, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.387704.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Barber, Stuart. "Group sequential tests with random information accrual." Thesis, University of Bath, 1999. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.301534.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Law, Yan Tai. "Pricing under random information flow and the theory of information pricing." Thesis, Imperial College London, 2012. http://hdl.handle.net/10044/1/9292.

Full text
Abstract:
This thesis presents a mathematical formulation of informational inhomogeneity in financial markets, with emphasis on its impact on asset volatility, the notion of information extraction, and the role of information providers. We begin with a brief review of the BHM framework, which models the market filtration by an information process consisting of a signal and a noise term, such that the signal-to-noise ratio is determined by the information flow rate. Motivated by the observations that valuable information is rarely circulated homogeneously across financial markets, and that the informatio
APA, Harvard, Vancouver, ISO, and other styles
5

Ratnarajah, Tharmalingam. "Topics in complex random matrices and information theory." Thesis, University of Ottawa (Canada), 2003. http://hdl.handle.net/10393/29001.

Full text
Abstract:
The eigenvalue distribution of both central and noncentral complex Wishart matrices are investigated with the objective of studying several open problems in information theory and numerical analysis, etc. Specifically, the largest, kth largest, and the smallest eigenvalue distributions of complex Wishart matrices and the condition number distribution of complex Gaussian random matrices are derived. These distributions are represented by complex hypergeometric functions of matrix arguments, which can be expressed in terms of complex zonal polynomials. We derive several results on complex hyper
APA, Harvard, Vancouver, ISO, and other styles
6

Loher, Urs. "Information-theoretic and genie-aided analyses of random-acess algorithms /." Zurich, 1998. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=12627.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ideker, Trey. "Offset correction techniques for imaging sensors using random dither information." Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/11470.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Tyrrell, Simon. "Random and rational methods for compound selection." Thesis, University of Sheffield, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.370002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hansson, Bevin. "Random Testing of Code Generation in Compilers." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-175852.

Full text
Abstract:
Compilers are a necessary tool for all software development. As modern compilers are large and complex systems, ensuring that the code they produce is accurate and correct is a vital but arduous task. Correctness of the code generation stage is important. Maintaining full coverage of test cases in a compiler is virtually impossible due to the large input and output domains. We propose that random testing is a highly viable method for testing a compiler. A method is presented to randomly generate a lower level code representation and use it to test the code generation stage of a compiler. This
APA, Harvard, Vancouver, ISO, and other styles
10

Conway, P. A. "The application of random dither to a digital CODEC." Thesis, University of Bradford, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.233656.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Levine, Daniel S. Ph D. Massachusetts Institute of Technology. "Information-rich path planning under general constraints using Rapidly-exploring Random Trees." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/59684.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2010.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 99-104).<br>This thesis introduces the Information-rich Rapidly-exploring Random Tree (IRRT), an extension of the RRT algorithm that embeds information collection as predicted using Fisher information matrices. The primary contribution of this trajectory generation algorithm is target-based information maximization in general (possibly heavily constrained) environments, with complex vehicle dynamic constraints and
APA, Harvard, Vancouver, ISO, and other styles
12

Shafie, Termeh. "Random Multigraphs : Complexity Measures, Probability Models and Statistical Inference." Doctoral thesis, Stockholms universitet, Statistiska institutionen, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-82697.

Full text
Abstract:
This thesis is concerned with multigraphs and their complexity which is defined and quantified by the distribution of edge multiplicities. Two random multigraph models are considered.  The first model is random stub matching (RSM) where the edges are formed by randomly coupling pairs of stubs according to a fixed stub multiplicity sequence. The second model is obtained by independent edge assignments (IEA) according to a common probability distribution over the edge sites. Two different methods for obtaining an approximate IEA model from an RSM model are also presented. In Paper I, multigraphs
APA, Harvard, Vancouver, ISO, and other styles
13

Karlsson, Isak. "Order in the random forest." Doctoral thesis, Stockholms universitet, Institutionen för data- och systemvetenskap, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-142052.

Full text
Abstract:
In many domains, repeated measurements are systematically collected to obtain the characteristics of objects or situations that evolve over time or other logical orderings. Although the classification of such data series shares many similarities with traditional multidimensional classification, inducing accurate machine learning models using traditional algorithms are typically infeasible since the order of the values must be considered. In this thesis, the challenges related to inducing predictive models from data series using a class of algorithms known as random forests are studied for the
APA, Harvard, Vancouver, ISO, and other styles
14

Zhang, Mingchuan. "Advanced spatial information processes: modeling and application." Diss., Virginia Polytechnic Institute and State University, 1985. http://hdl.handle.net/10919/76087.

Full text
Abstract:
Making full use of spatial information is an important problem in information-processing and decision making. In this dissertation, two Bayesian decision theoretic frameworks for context classification are developed which make full use of spatial information. The first framework is a new multispectral image context classification technique which is based on a recursive algorithm for optimal estimation of the state of a two-dimensional discrete Markov Random Field (MRF). The implementation of the recursive algorithm is a form of dynamic programming. The second framework is based on a stochastic
APA, Harvard, Vancouver, ISO, and other styles
15

Hoydis, Jakob. "Random matrix theory for advanced communication systems." Phd thesis, Supélec, 2012. http://tel.archives-ouvertes.fr/tel-00765458.

Full text
Abstract:
Advanced mobile communication systems are characterized by a dense deployment of different types of wireless access points. Since these systems are primarily limited by interference, multiple-input multiple-output (MIMO) techniques as well as coordinated transmission and detection schemes are necessary to mitigate this limitation. Thus, mobile communication systems become more complex which requires that also the mathematical tools for their theoretical analysis must evolve. These must be able to take the most important system characteristics into account, such as fading, path loss, and interf
APA, Harvard, Vancouver, ISO, and other styles
16

Radley, Johannes Jurgens. "Pseudo-random access compressed archive for security log data." Thesis, Rhodes University, 2015. http://hdl.handle.net/10962/d1020019.

Full text
Abstract:
We are surrounded by an increasing number of devices and applications that produce a huge quantity of machine generated data. Almost all the machine data contains some element of security information that can be used to discover, monitor and investigate security events.The work proposes a pseudo-random access compressed storage method for log data to be used with an information retrieval system that in turn provides the ability to search and correlate log data and the corresponding events. We explain the method for converting log files into distinct events and storing the events in a compresse
APA, Harvard, Vancouver, ISO, and other styles
17

Pettarin, Alberto. "Graph Models of Information Spreading in Wireless Networks." Doctoral thesis, Università degli studi di Padova, 2012. http://hdl.handle.net/11577/3422448.

Full text
Abstract:
This thesis investigates the structural properties of graph models of wireless networks, where autonomous agents communicate using radios in order to accomplish a predefined task. Ad hoc, sensor, and vehicle networks are perhaps the most familiar examples. The goal of this thesis is the analytical characterization of information spreading in graph models of wireless networks, since this fundamental process is a primitive needed to accomplish more complex tasks. The well-established graph-based approaches adopted when analyzing the behavior of “classical” distributed systems (e.g., P2P network
APA, Harvard, Vancouver, ISO, and other styles
18

Kanavati, Fahdi. "Efficient extraction of semantic information from medical images in large datasets using random forests." Thesis, Imperial College London, 2017. http://hdl.handle.net/10044/1/58017.

Full text
Abstract:
Large datasets of unlabelled medical images are increasingly becoming available; however only a small subset tend to be manually semantically labelled as it is a tedious and extremely time-consuming task to do for large datasets. This thesis aims to tackle the problem of efficiently extracting semantic information in the form of image segmentations and organ localisations from large datasets of unlabelled medical images. To do so, we investigate the suitability of supervoxels and random classification forests for the task. The first contribution of this thesis is a novel method for efficiently
APA, Harvard, Vancouver, ISO, and other styles
19

Marcheggiani, Diego <1983&gt. "Beyond linear chain: a journey through conditional random fields for information extraction from text." Doctoral thesis, Università Ca' Foscari Venezia, 2014. http://hdl.handle.net/10579/5588.

Full text
Abstract:
Natural language, spoken and written, is the most important way for humans to communicate information to each other. In the last decades \emph{natural language processing} (NLP) researchers have studied methods aimed at making computers ``understand'' the information enclosed in human language. \emph{Information Extraction} (IE) is a field of NLP that studies methods aimed at extracting information from text so that it can be used to populate a structured information repository, such as a relational database. The main approaches by means of which the task of IE has been tackled rely on superv
APA, Harvard, Vancouver, ISO, and other styles
20

Qi, Luole. "Conditional random fields based method for feature-level opinion mining and results visualization." HKBU Institutional Repository, 2012. https://repository.hkbu.edu.hk/etd_ra/1475.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Mohapatra, Prateeti. "Deriving Novel Posterior Feature Spaces For Conditional Random Field - Based Phone Recognition." The Ohio State University, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=osu1236784133.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Cohn, Trevor A. "Scaling conditional random fields for natural language processing /." Connect to thesis, 2007. http://eprints.unimelb.edu.au/archive/00002874.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Apprey-Hermann, Joseph Kwame. "Evaluating The Predictability of Pseudo-Random Number Generators Using Supervised Machine Learning Algorithms." Youngstown State University / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1588805461290138.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Alharbi, Manal. "Random Walks on Free Products of Cyclic Groups." Thesis, Université d'Ottawa / University of Ottawa, 2018. http://hdl.handle.net/10393/37494.

Full text
Abstract:
In this thesis, we investigate examples of random walks on free products of cyclic groups. Free products are groups that contain words constructed by concatenation with possible simplifications[20]. Mairesse in [17] proved that the harmonic measure on the boundary of these random walks has a Markovian Multiplicative structure (this is a class of Markov measures which requires fewer parameters than the usual Markov measures for its description ), and also showed how in the case of the harmonic measure these parameters can be found from Traffic Equations. Then Mairesse and Math ́eus in [20] cont
APA, Harvard, Vancouver, ISO, and other styles
25

Williams, Alyssa. "Hybrid Recommender Systems via Spectral Learning and a Random Forest." Digital Commons @ East Tennessee State University, 2019. https://dc.etsu.edu/etd/3666.

Full text
Abstract:
We demonstrate spectral learning can be combined with a random forest classifier to produce a hybrid recommender system capable of incorporating meta information. Spectral learning is supervised learning in which data is in the form of one or more networks. Responses are predicted from features obtained from the eigenvector decomposition of matrix representations of the networks. Spectral learning is based on the highest weight eigenvectors of natural Markov chain representations. A random forest is an ensemble technique for supervised learning whose internal predictive model can be interprete
APA, Harvard, Vancouver, ISO, and other styles
26

Onorati, Emilio Federico [Verfasser]. "Random Processes over the Unitary Group : Mixing Properties and Applications in Quantum Information / Emilio Federico Onorati." Berlin : Freie Universität Berlin, 2019. http://d-nb.info/1195528620/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Pazman, Andrej, and Werner Müller. "Optimal Design of Experiments Subject to Correlated Errors." Department of Statistics and Mathematics, WU Vienna University of Economics and Business, 2000. http://epub.wu.ac.at/64/1/document.pdf.

Full text
Abstract:
In this paper we consider optimal design of experiments in the case of correlated observations, when no replications are possible. This situation is typical when observing a random process or random field with known covariance structure. We present a theorem which demonstrates that the computation of optimum exact designs corresponds to solving minimization problems in terms of design measures. (author's abstract)<br>Series: Forschungsberichte / Institut für Statistik
APA, Harvard, Vancouver, ISO, and other styles
28

Zhang, Xiaodan Hu Xiaohua. "Exploiting external/domain knowledge to enhance traditional text mining using graph-based methods /." Philadelphia, Pa. : Drexel University, 2009. http://hdl.handle.net/1860/3076.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Gomes, Rahul. "Incorporating Sliding Window-Based Aggregation for Evaluating Topographic Variables in Geographic Information Systems." Diss., North Dakota State University, 2019. https://hdl.handle.net/10365/29913.

Full text
Abstract:
The resolution of spatial data has increased over the past decade making them more accurate in depicting landform features. From using a 60m resolution Landsat imagery to resolution close to a meter provided by data from Unmanned Aerial Systems, the number of pixels per area has increased drastically. Topographic features derived from high resolution remote sensing is relevant to measuring agricultural yield. However, conventional algorithms in Geographic Information Systems (GIS) used for processing digital elevation models (DEM) have severe limitations. Typically, 3-by-3 window sizes are use
APA, Harvard, Vancouver, ISO, and other styles
30

Antonijevic, Filip. "PGG - Processuell Grottgenerering : En jämförelse mellan Cellulär Automat, Random Walk och Perlin Noise." Thesis, Högskolan i Skövde, Institutionen för informationsteknologi, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-19983.

Full text
Abstract:
I detta arbete undersöktes processuell generering med tre algoritmer i syfte att skapa grottliknande banor och utvärdera kriterier baserat på eftertraktande egenskaper gällande tid, storlek, variation och pålitlighet. Algoritmerna är cellulär automat, random walk och Perlin noise. Flera olika hjälpfunktioner och algoritmer användes för utvärderingen av kriterierna. Syftet med arbetet var att ta reda på vilken av dessa algoritmer skulle passa bäst att användas i ett roguelikespel. Slutsatsen som drogs från undersökningen är att algoritmen random walk gav det bästa resultat gällande pålitlighet,
APA, Harvard, Vancouver, ISO, and other styles
31

Lou, Yuxiang, and Filip Matz. "Optimizing Product Assortments with Unknown Historical Transaction Data Using Nonparametric Choice Modeling and Random Forest Classification." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-261636.

Full text
Abstract:
Assortment optimization is a crucial problem for many firms who need to make decisions on which products to stock in their stores in order to maximize revenues. Optimizing assortments usually entails fitting choice models to historical data. To a large extent, this becomes a problem of understanding consumer behavior. In this paper, a two-step method is proposed for optimizing assortments for stores where there was no known sales data. First, training data was generated by optimizing assortments, using a non parametric choice model, on similar stores for which data is available. Then this trai
APA, Harvard, Vancouver, ISO, and other styles
32

Xiao, Jiaxi. "Information theoretic approach in detection and security codes." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/43620.

Full text
Abstract:
Signal detection plays a critical role in realizing reliable transmission through communication systems. In this dissertation, by applying information theoretic approach, efficient detection schemes and algorithms are designed for three particular communication systems. First, a computation efficient coding and detection algorithm is developed to decode two dimensional inter-symbol interference (ISI) channels. The detection algorithm significantly reduces the computation complexity and makes the proposed equalization algorithm applicable. A new metric, the post-detection mutual information (PM
APA, Harvard, Vancouver, ISO, and other styles
33

Özyagci, Ali. "Selfish Dynamic Spectrum Access in Multichannel Wireless Networks : Complete and incomplete information analysis." Licentiate thesis, KTH, Kommunikationssystem, CoS, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-50738.

Full text
Abstract:
The increasing popularity and widespread deployment of wireless data systems fuel the increasing demand for more spectrum. On the other hand, various studies measuring spectrum utilization show that there is a huge variation in spectrum utilization at different times and locations. In view of this, various dynamic spectrum access (DSA) methods have been proposed in order to achieve more efficient utilization of spectrum resources by virtue of exploiting the variations in spectrum demand over time and space. Implementing DSA systems in a centralized way can lead to complexity and scalability pr
APA, Harvard, Vancouver, ISO, and other styles
34

Liu, Hain-Ching. "Automatic scene detection in MPEG digital video for random access indexing and MPEG compression optimization /." Thesis, Connect to this title online; UW restricted, 1995. http://hdl.handle.net/1773/6001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Jacobsson, Linus. "Random numbers for generation in web games : And how the quality of them effects the end user." Thesis, Högskolan i Skövde, Institutionen för informationsteknologi, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-17122.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Öberg, Johanna. "Time prediction and process discovery of administration process." Thesis, Uppsala universitet, Institutionen för biologisk grundutbildning, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-432893.

Full text
Abstract:
Machine learning and process mining are two techniques that are becoming more and more popular among organisations for business intelligence purposes. Results from these techniques can be very useful for organisations' decision-making. The Swedish National Forensic Centre (NFC), an organisation that performs forensic analyses, is in need of a way to visualise and understand its administration process. In addition, the organisation would like to be able to predict the time analyses will take to perform. In this project, it was evaluated if machine learning and process mining could be used on NF
APA, Harvard, Vancouver, ISO, and other styles
37

Frondana, Iara Moreira. "Model selection for discrete Markov random fields on graphs." Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/45/45133/tde-02022018-151123/.

Full text
Abstract:
In this thesis we propose to use a penalized maximum conditional likelihood criterion to estimate the graph of a general discrete Markov random field. We prove the almost sure convergence of the estimator of the graph in the case of a finite or countable infinite set of variables. Our method requires minimal assumptions on the probability distribution and contrary to other approaches in the literature, the usual positivity condition is not needed. We present several examples with a finite set of vertices and study the performance of the estimator on simulated data from theses examples. We also
APA, Harvard, Vancouver, ISO, and other styles
38

Stum, Alexander Knell. "Random Forests Applied as a Soil Spatial Predictive Model in Arid Utah." DigitalCommons@USU, 2010. https://digitalcommons.usu.edu/etd/736.

Full text
Abstract:
Initial soil surveys are incomplete for large tracts of public land in the western USA. Digital soil mapping offers a quantitative approach as an alternative to traditional soil mapping. I sought to predict soil classes across an arid to semiarid watershed of western Utah by applying random forests (RF) and using environmental covariates derived from Landsat 7 Enhanced Thematic Mapper Plus (ETM+) and digital elevation models (DEM). Random forests are similar to classification and regression trees (CART). However, RF is doubly random. Many (e.g., 500) weak trees are grown (trained) independentl
APA, Harvard, Vancouver, ISO, and other styles
39

Luo, Simon Junming. "An Information Geometric Approach to Increase Representational Power in Unsupervised Learning." Thesis, The University of Sydney, 2021. https://hdl.handle.net/2123/25773.

Full text
Abstract:
Machine learning models increase their representational power by increasing the number of parameters in the model. The number of parameters in the model can be increased by introducing hidden nodes, higher-order interaction effects or by introducing new features into the model. In this thesis we study different approaches to increase the representational power in unsupervised machine learning models. We investigate the use of incidence algebra and information geometry to develop novel machine learning models to include higher-order interactions effects into the model. Incidence algebra provide
APA, Harvard, Vancouver, ISO, and other styles
40

Linn, Hanna. "Detecting quantum speedup for random walks with artificial neural networks." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-289347.

Full text
Abstract:
Random walks on graphs are an essential base for crucial algorithms for solving problems, like the boolean satisfiability problem. A speedup of random walks could improve these algorithms. The quantum version of the random walk, quantum walk, is faster than random walks in specific cases, e.g., on some linear graphs. An analysis of when the quantum walk is faster than the random walk can be accomplished analytically or by simulating both the walks on the graph. The problem arises when the graphs grow in size and connectivity. There are no known general rules for what an arbitrary graph not hav
APA, Harvard, Vancouver, ISO, and other styles
41

Ma, Jian James. "People, Processes, and Products: Case Studies in Open-Source Software Using Complex Networks." Diss., The University of Arizona, 2011. http://hdl.handle.net/10150/217072.

Full text
Abstract:
Open-source software becomes increasingly popular nowadays. Many startup companies and small business owners choose to adopt open source software packages to meet their daily office computing needs or to build their IT infrastructure. Unlike proprietary software systems, open source software systems usually have a loosely-organized developer collaboration structure. Developers work on their "assignments" on a voluntary basis. Many developers do not physically meet their "co-workers." This unique developer collaboration pattern leads to unique software development process, and hence unique
APA, Harvard, Vancouver, ISO, and other styles
42

Endres, Sarah L. "Mapping Coastal Great Lakes Wetlands and Adjacent Land Use Through Hybrid Optical-Infrared and Radar Image Classification Techniques: A Remote Sensing and Geographic Information Science Internship with Michigan Technological Research Institute." Miami University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=miami1344646318.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Leone, Nicolò. "A quantum entropy source based on Single Photon Entanglement." Doctoral thesis, Università degli studi di Trento, 2022. https://hdl.handle.net/11572/339572.

Full text
Abstract:
In this thesis, I report on how to use Single Photon Entanglement for generating certified quantum random numbers. Single Photon Entanglement is a particular type of entanglement which involves non-contextual correlations between two degrees of freedom of a single photon. In particular, here I consider momentum and polarization. The presence of the entanglement was validated using different attenuated coherent and incoherent sources of light by evaluating the Bell inequality, a well-known entanglement witness. Different non-idealities in the calculation of the inequality are discussed addressi
APA, Harvard, Vancouver, ISO, and other styles
44

Ertug, Ozgur. "Generalized Random Spreading Performance Analysis Of Cdma Over Gwssus Fading Channels." Phd thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12607022/index.pdf.

Full text
Abstract:
Since direct-sequence code-division multiple-access (DS-CDMA) is an interference-limited random multiple-access scheme, the reduction of co-channel interference with either interference suppression or interference cancellation multiuser receivers and/or power control to prevent detrimental near-far situations is vital for improved performance. Up to date, some contributions investigated randomly-spread asymptotically - large number of users and large bandwidth - large CDMA systems with multiuser receivers and power control via random matrix theoretic and free probability theoretic tools especi
APA, Harvard, Vancouver, ISO, and other styles
45

Manilich, Elena A. "Hereditary Colorectal Cancer: Information-Based Approach." Cleveland, Ohio : Case Western Reserve University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=case1252247671.

Full text
Abstract:
Thesis(Ph.D.)--Case Western Reserve University, 2010<br>Title from PDF (viewed on 2009-12-30) Department of Electrical Engineering and Computer Science Includes abstract Includes bibliographical references and appendices Available online via the OhioLINK ETD Center
APA, Harvard, Vancouver, ISO, and other styles
46

Brandt, Carl-Simon, Jonathan Kleivard, and Andreas Turesson. "Convolutional, adversarial and random forest-based DGA detection : Comparative study for DGA detection with different machine learning algorithms." Thesis, Högskolan i Skövde, Institutionen för informationsteknologi, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-20103.

Full text
Abstract:
Malware is becoming more intelligent as static methods for blocking communication with Command and Control (C&amp;C) server are becoming obsolete. Domain Generation Algorithms (DGAs) are a common evasion technique that generates pseudo-random domain names to communicate with C&amp;C servers in a difficult way to detect using handcrafted methods. Trying to detect DGAs by looking at the domain name is a broad and efficient approach to detect malware-infected hosts. This gives us the possibility of detecting a wider assortment of malware compared to other techniques, even without knowledge of the
APA, Harvard, Vancouver, ISO, and other styles
47

Kagioglidis, Ioannis. "Performance analysis of a LINK-16/JTIDS compatible waveform with noncoherent detection, diversity and side information." Thesis, Monterey, California : Naval Postgraduate School, 2009. http://edocs.nps.edu/npspubs/scholarly/theses/2009/Sep/09Sep%5FKagioglidis%5FECE.pdf.

Full text
Abstract:
Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, September 2009.<br>Thesis Advisor(s): Robertson, R. Clark. "September 2009." Description based on title screen as viewed on 6 November 2009. Author(s) subject terms: Link-16/JTIDS, (31, 15) Reed-Solomon (RS) coding, 32-ary Orthogonal signaling, Additive White Gaussian Noise (AWGN), Pulse-Noise Interference (PNI), Perfect Side Information (PSI). Includes bibliographical references (p. 49-51). Also available in print.
APA, Harvard, Vancouver, ISO, and other styles
48

Jonsson, Estrid, and Sara Fredrikson. "An Investigation of How Well Random Forest Regression Can Predict Demand : Is Random Forest Regression better at predicting the sell-through of close to date products at different discount levels than a basic linear model?" Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-302025.

Full text
Abstract:
Allt eftersom klimatkrisen fortskrider ökar engagemanget kring hållbarhet inom företag. Växthusgaser är ett av de största problemen och matsvinn har därför fått mycket uppmärksamhet sedan det utnämndes till den tredje största bidragaren till de globala utsläppen. För att minska sitt bidrag rabatterar många matbutiker produkter med kort bästföredatum, vilket kommit att kräva en förståelse för hur priskänslig efterfrågan på denna typ av produkt är. Prisoptimering görs vanligtvis med så kallade Generalized Linear Models men då efterfrågan är ett komplext koncept har maskininl ärningsmetoder börja
APA, Harvard, Vancouver, ISO, and other styles
49

Baris, Yuksel. "Automated Building Detection From Satellite Images By Using Shadow Information As An Object Invariant." Master's thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12614909/index.pdf.

Full text
Abstract:
Apart from classical pattern recognition techniques applied for automated building detection in satellite images, a robust building detection methodology is proposed, where self-supervision data can be automatically extracted from the image by using shadow and its direction as an invariant for building object. In this methodology<br>first the vegetation, water and shadow regions are detected from a given satellite image and local directional fuzzy landscapes representing the existence of building are generated from the shadow regions using the direction of illumination obtained from image meta
APA, Harvard, Vancouver, ISO, and other styles
50

Waade, Eystein. "Extracting Particular Information from Swedish Public Procurement Using Machine Learning." Thesis, Uppsala universitet, Avdelningen för systemteknik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-414562.

Full text
Abstract:
The Swedish procurement process has a yearly value of 706 Billion SEK over approximately 18 000 procurements. With each process comes many documents written in different formats that need to be understood to be able to be a possible tender. With the development of new technology and the age of Machine Learning it is of huge interest to investigate how we can use this knowledge to enhance the way we procure. The goal of this project was to investigate if public procurements written in Swedish in PDF format can be parsed and segmented into a structured format. This process was divided into three
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!