To see the other types of publications on this topic, follow the link: Bug.
Dissertations / Theses on the topic 'Bug'
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 'Bug.'
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
Adhikarla, Sridhar. "Automated Bug Classification. : Bug Report Routing." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-166224.
Full textAbstract:
With the growing software technologies companies tend to develop automated solutions to save time and money. Automated solutions have seen tremendous growth in the software industry and have benefited from extensive machine learning research. Although extensive research has been done in the area of automated bug classification, with the new data being collected, more precise methods are yet to be developed. An automated bug classifier will process the content of the bug report and assign it to the person or department that would fix the problem. A bug report typically contains an unstructured text field where the problem is described in detail. A lot of research regarding information extraction from such text fields has been done. This thesis uses a topic modeling technique, Latent Dirichlet Allocation (LDA), and a numerical statistic Term Frequency - Inverse Document Frequency (TF-IDF), to generate two different features from the unstructured text fields of the bug report. A third set of features was created by concatenating the TF-IDF and the LDA features. The class distribution of the data used in this thesis changes over time. To explore if time has an impact on the prediction, the age of the bug report was introduced as a feature. The importance of this feature, when used along with the LDA and TF-IDF features, was also explored in this thesis. These generated feature vectors were used as predictors to train three different classification models; multinomial logistic regression, dense neural networks, and DO-probit. The prediction of the classifiers, for the correct department to handle a bug, was evaluated on the accuracy and the F1-score of the prediction. For comparison, the predictions from a Support Vector Machine (SVM) using a linear kernel was treated as the baseline. The best results for the multinomial logistic regression and the dense neural networks classifiers were obtained when the TF-IDF features of the bug reports were used as predictors. Among the three classifiers trained the dense neural network had the best performance, though the classifier was not able to perform better than the SVM baseline. Using age as a feature did not give a significant improvement in the predictive performance of the classifiers, but was able to identify some interesting patterns in the data. Further research on other ways of using the age of the bug reports could be promising.
2
Cordell, Susan, and TP Baxter. "The Conenose Bug (AKA "The Kissing Bug")." College of Agriculture and Life Sciences, University of Arizona (Tucson, AZ), 1999. http://hdl.handle.net/10150/144783.
Full textAbstract:
2 pp.One would not suspect that an insect with the congenial nickname of kissing bug could cause life-threatening allergic reactions (anaphylaxis) in sensitive individuals. But anaphylactic shock can be the result of the bite of Triatoma species, also known as the conenose bug, kissing bug, assassin bug, Mexican bedbug, and the Wallapai tiger. This publication discusses the identification, habitat, and the conenose bite of this insect, as well as the controlling method used to reduce theie numbers.
3
Connelly, Rita. "Whiteflies-the Tiny Bug with the Big Bite." College of Agriculture, University of Arizona (Tucson, AZ), 1992. http://hdl.handle.net/10150/295733.
Full text
4
Austli, Viktor, and Elin Hernborg. "Standardization of Bug Validation." Thesis, Högskolan i Halmstad, Akademin för informationsteknologi, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-34801.
Full textAbstract:
The usage of the Internet is widely implemented all over the world in a number of concepts. This generates a demand of establishing security as to sustain the integrity of data. In this thesis a service will be presented which can be used to identify various web vulnerabilities in order to regulate these and therefore prevent exploitation. As the world is today the increase of technical implementation provides with a growing amount of security flaws, this affect the organizations which may have to increase their resource financing in an effort to counter these. But what if a tremendous amount of work could be automated and avoid organizations having to spend an enormous amount of finances validating security flaws reported to them? What if these flaws could be validated in a more effective manner? With this tool being establish an individual will no longer require advanced technical knowledge in order to identify whether a web vulnerability is present or not but instead have an automated test perform the procedure for them.
5
Chen, Jau-Yuan. "Mobile Energy Bug Diagnosis." The Ohio State University, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=osu1366382081.
Full text
6
Svahn, Caroline. "Automated Bug Report Routing." Thesis, Linköpings universitet, Statistik och maskininlärning, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-139037.
Full textAbstract:
As the software industry grows larger by the minute, the need for automated solutions within bug report management is on the rise. Although some research has been conducted in the area of bug handling, new, faster or more precise approaches are yet to be developed. A bug report typically contains a free text observations field where the issue can be described by a human. Research regarding processing of this type of field is extensive, however, bug reports are often accompanied with system log files which have been given less attention so far. In the 4G LTE telecommunications network, the available system log files are many and several are likely to aid the routing of bug reports. In this thesis, one system log file was chosen to be evaluated; the alarm log. The alarm logs are time series count data containing alarms raised by the system. The alarm log data have been pre-processed with data mining techniques. The Apriori algorithm has been used to mine for specific alarms and alarming objects which indicates that the bug report should be solved by a particular developer group. We extend the Apriori algorithm to a temporal setting by using a customised time dependent confidence measure. To further mine for interesting sequences of events in the logs, the sequence mining approach SPADE has been used. The extracted class-associated sequences from both pre-processing approaches are transformed into binary features possible to use as predictors in any prediction model. The results have been evaluated by predicting the correct developer group with two different methods; logistic regression and DO-probit. Logistic regression was regularised with the elastic net penalty to avoid computational issues as well as handling the sparse covariate set. DO-probit was used with a horseshoe prior; it is well suited for the sparse covariate regression problem as it is customised to obtain signals in sparse, noisy data. The results indicate that a data mining approach for processing alarm logs is promising. The results show that the rules obtained with the Apriori mining process are suitable for mining the alarm logs as most binary representations of the rules used as covariates in logistic regression are kept in the equations for the expected classes with strongly positive coefficients. Although, the overall improvement in accuracy from using the alarms logs in addition to the learned topics from free text fields is modest, the alarm logs are concluded to be a good complement to the free text information as some Apriori covariates appears to be better suited to predict some classes than some topics.
7
Gouge, Dawn, and Carl Olson. "Choosing a Bug Repellent." College of Agriculture and Life Sciences, University of Arizona (Tucson, AZ), 2011. http://hdl.handle.net/10150/146730.
Full textAbstract:
5 pp."Bugs @ Home series Formerly titled: Insect Repellents; Originally published: 2003"
This publication describes how to use insect repellents safely and effectively. It offers comparisons between repellents available to the public and gives advice on which products are suitable for children.
8
Auwal, Bilyaminu Romo. "Improving the quality of bug data in software repositories." Thesis, Brunel University, 2016. http://bura.brunel.ac.uk/handle/2438/13655.
Full textAbstract:
Context : Researchers have increasingly recognised the benefit of mining software repositories to extract information. Thus, integrating a version control tool (VC tool) and bug tracking tool (BT tool) in mining software repositories as well as synchronising missing bug tracking data (BT data) and version control log (VC log) becomes of paramount importance, in order to improve the quality of bug data in software repositories. In this way, researchers can do good quality research for software project benefit especially in open source software projects where information is limited in distributed development. Thus, shared data to track the issues of the project are not common. BT data often appears not to be mirrored when considering what developers logged as their actions, resulting in reduced traceability of defects in the development logs (VC logs). VC system (Version control system) data can be enhanced with data from bug tracking system (BT system), because VC logs reports about past software development activities. When these VC logs and BT data are used together, researchers can have a more complete picture of a bug’s life cycle, evolution and maintenance. However, current BT system and VC systems provide insufficient support for cross-analysis of both V Clogs and BT data for researchers in empirical software engineering research: prediction of software faults, software reliability, traceability, software quality, effort and cost estimation, bug prediction, and bug fixing. Aims and objectives: The aim of the thesis is to design and implement a tool chain to support the integration of a VC tool and a BT tool, as well as to synchronise the missing VC logs and BT data of open-source software projects automatically. The syncing process, using Bicho (BT tool) and CVSAnalY (VC tool), will be demonstrated and evaluated on a sample of 344 open source software (OSS) projects. Method: The tool chain was implemented and its performance evaluated semi-automatically. The SZZ algorithm approach was used to detect and trace BT data and VC logs. In its formulation, the algorithm looks for the terms "Bugs," or "Fixed" (case-insensitive) along with the ’#’ sign, that shows the ID of a bug in the VC system and BT system respectively. In i addition, the SZZ algorithm was dissected in its formulation and precision and recall analysed for the use of “fix”, “bug” or “# + digit” (e.g., #1234), was detected was detected when tracking possible bug IDs from the VC logs of the sample OSS projects. Results: The results of this analysis indicate that use of “# + digit” (e.g., #1234) is more precise for bug traceability than the use of the “bug” and “fix” keywords. Such keywords are indeed present in the VC logs, but they are less useful when trying to connect the development actions with the bug traces – that is, their recall is high. Overall, the results indicate that VC log and BT data retrieved and stored by automatic tools can be tracked and recovered with better accuracy using only a part of the SZZ algorithm. In addition, the results indicate 80-95% of all the missing BT data and VC logs for the 344 OSS projects has been synchronised into Bicho and CVSAnalY database respectively. Conclusion: The presented tool chain will eliminate and avoid repetitive activities in traceability tasks, as well as software maintenance and evolution. This thesis provides a solution towards the automation and traceability of BT data of software projects (in particular, OSS projects) using VC logs to complement and track missing bug data. Synchronising involves completing the missing data of bug repositories with the logs de tailing the actions of developers. Synchronising benefit various branches of empirical software engineering research: prediction of software faults, software reliability, traceability, software quality, effort and cost estimation, bug prediction ,and bug fixing.
9
Kingdon, Lorraine B. "The Bug of the Year." College of Agriculture, University of Arizona (Tucson, AZ), 1993. http://hdl.handle.net/10150/295734.
Full text
10
Anvik, John. "Assisting bug report triage through recommendation." Thesis, University of British Columbia, 2007. http://hdl.handle.net/2429/265.
Full textAbstract:
A key collaborative hub for many software development projects is the issue tracking system, or bug repository. The use of a bug repository can improve the software development process in a number of ways including allowing developers who are geographically distributed to communicate about project development. However, reports added to the repository need to be triaged by a human, called the triager, to determine if reports are meaningful. If a report is meaningful, the triager decides how to organize the report for integration into the project's development process. We call triager decisions with the goal of determining if a report is meaningful, repository-oriented decisions, and triager decisions that organize reports for the development process, development-oriented decisions.
Triagers can become overwhelmed by the number of reports added to the repository. Time spent triaging also typically diverts valuable resources away from the improvement of the product to the managing of the development process. To assist triagers, this dissertation presents a machine learning approach to create recommenders that assist with a variety of development-oriented decisions. In this way, we strive to reduce human involvement in triage by moving the triager's role from having to gather information to make a decision to that of confirming a suggestion.
This dissertation introduces a triage-assisting recommender creation process that can create a variety of different development-oriented decision recommenders for a range of projects. The recommenders created with this approach are accurate: recommenders for which developer to assign a report have a precision of 70% to 98% over five open source projects, recommenders for which product component the report is for have a recall of 72% to 92%, and recommenders for who to add to the cc: list of a report that have a recall of 46% to 72%. We have evaluated recommenders created with our triage-assisting recommender creation process using both an analytic evaluation and a field study. In addition, we present in this dissertation an approach to assist project members to specify the project-specific values for the triage-assisting recommender creation process, and show that such recommenders can be created with a subset of the repository data.
11
Gordon, Jennifer R. "Insecticide Resistance in the Bed Bug." UKnowledge, 2014. http://uknowledge.uky.edu/entomology_etds/14.
Full textAbstract:
Populations of Cimex lectularius, the bed bug, have resurged around the world posing significant challenges for pest management professionals and causing physical, economic, and emotional strife. Pyrethroid resistance has been found in the vast majority of populations making pest management more difficult. The objectives of my dissertation research were to document the evolution of resistance to pyrethroid and neonicotinoid combination products (called combination products here) and to a neonicotinoid in the laboratory, to record potential fitness costs to resistance to the combination products, and to compare the efficacy of nine insecticides on six populations. In the laboratory, populations of bed bugs evolve resistance rapidly to a combination product and that resistance translates into cross resistance to another combination product. In a follow up experiment, resistance to a neonicotinoid occurred after three generations of selection. Cross resistance between neonicotinoid and pyrethroid resistance was also found, likely due to a common detoxification mechanism (cytochrome P450 mediated metabolism). Resistance was associated with life history costs in three populations that had been selected with a combination product. Therefore, in the absence of selection pressure, populations of bed bugs should revert towards increasing susceptibility. Two pyrethroid products and three combination products were effective at killing three populations of bed bugs but were relatively ineffective against three other populations. However, the combination product, Transport GHP®, the single action pyrrole product, Phantom SC®, and the single action desiccant, CimeXa®, killed 95 to 100% of all populations investigated over a 14-day exposure. Taken together, results reported in this dissertation suggest that insecticide resistance management may be a useful tool for extending the efficacy of insecticides for control of C. lectularius.
12
Zhang, Yiwei, and 张益维. "SIGBOT: signature-based multiple-bug localization." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B43757418.
Full text
13
Araújo, Cristiano Werner. "Bug prediction in procedural software systems." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2017. http://hdl.handle.net/10183/170023.
Full textAbstract:
Informação relacionada a concertos de bugs tem sido explorada na construção de preditores de bugs cuja função é o suporte para a verificação de sistemas de software identificando quais elementos, como arquivos, são mais propensos a bugs. Uma grande variedade de métricas estáticas de código e métricas de mudança já foi utilizada para construir tais preditores. Dos muitos preditores de bugs propostos, a grande maioria foca em sistemas orientados à objeto. Apesar de orientação a objetos ser o paradigma de escolha para a maioria das aplicações, o paradigma procedural ainda é usado em várias — muitas vezes cruciais — aplicações, como sistemas operacionais e sistemas embarcados. Portanto, eles também merecem atenção. Essa dissertação extende o trabalho na área de predição de bugs ao avaliar e aprimorar preditores de bugs para sistemas procedurais de software. Nós proporcionamos três principais contribuições: (i) comparação das abordagens existentes de predição de bugs no contexto de sistemas procedurais, (ii) proposta de uso dos atributos de qualidade de software como atributos de predição no contexto estudado e (iii) avaliação dos atributos propostos em conjunto com a melhor abordagem encontrada em (i). Nosso trabalho provê, portanto, fundamentos para melhorar a performance de preditores de bugs no contexto de sistemas procedurais.Information regarding bug fixes has been explored to build bug predictors, which provide support for the verification of software systems, by identifying fault-prone elements, such as files. A wide range of static and change metrics have been used as features to build such predictors. Many bug predictors have been proposed, and their main target is objectoriented systems. Although object-orientation is currently the choice for most of the software applications, the procedural paradigm is still being used in many—sometimes crucial—applications, such as operating systems and embedded systems. Consequently, they also deserve attention. This dissertation extends work on bug prediction by evaluating and tailoring bug predictors to procedural software systems. We provide three key contributions: (i) comparison of bug prediction approaches in context of procedural software systems, (ii) proposal of the use of software quality features as prediction features in the studied context, and (iii) evaluation of the proposed features in association with the best approach found in (i). Our work thus provides foundations for improving the bug prediction performance in the context of procedural software systems.
14
Vatandoust, Arman. "Machine Learning for Software Bug Categorization." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-395253.
Full textAbstract:
The pursuit of flawless software is often an exhausting task for software developers. Code defects can range from soft issues to hard issues that lead to unforgiving consequences. DICE have their own system which automatically collects these defects which are grouped into buckets, however, this system suffers from the flaw of sometimes incorrectly grouping unrelated issues, and missing apparent duplicates. This time-consuming flaw puts excessive work for software developers and leads to wasted resources in the company. These flaws also impact the data quality of the system's defects tracking datasets which turn into a never-ending vicious circle. In this thesis, we investigate the method of measuring the similarity between reports in order to reduce incorrectly grouped issues and duplicate reports. Prototype models have been built for bug categorization and bucketing using convolutional neural networks. For each report, the prototype is able to provide developers with candidates of related issues with likelihood metric whether the issues are related. The similarity measurement is made in the representation phase of the neural networks, which we call the latent space. We also use Kullback–Leibler divergence in this space in order to get better similarity metrics. The results show important findings and insights for further improvement in the future. In addition to this, we discuss methods and strategies for detecting outliers using Mahalanobis distance in order to prevent incorrectly grouped reports.
15
Grangier, Emmanuelle. "Le bug : une esthétique de l'accident." Paris 1, 2006. http://www.theses.fr/2006PA010575.
Full textAbstract:
Face à l'écran, nous sommes en position d'utilisateur, tout nous semble normal, nos attentes sont satisfaites, nos gestes sont emprunts d'un certain automatisme, notre comportement tout entier, semble s'effectuer, d'une certaine manière, hors conscience, nous sommes tout à la fois collés à l'écran et mis à distance par le dispositif interfaciel et nous sommes bercé par le train-train fonctionnel. Mais si, brusquement, le système dysfonctionne, alors là, en cet instant précis, quand l'écran se fige ou que l'affichage devient instable, quand nos attentes sont contrariées, quand nos demandes n'accèdent plus aux réponses que nous anticipions, à celles que nous espérions, quand tout se désynchronise, quand le temps de réflexion, quand l'anarchie de l'intervalle reprend ses droit, quand tout semble paralysé ou que tout commence à vibrer dans un clignotement spasmodique, quand nous ne contrôlons plus rien, que notre sentiment de frustration et d'impuissance nous paralyse et nous culpabilise, alors là, il semble advenir quelque chose, la tyrannie du "temps réel" est rompue et une respiration, le temps de la disponibilité resurgit, une distance semble rétablie. Comment se manifeste le bug? Si le bug semble apparaître comme une puissance de rupture, à quelles ruptures procède-t-il ? Comment opèrent-t-elles ou autrement dit comment cet accident est-il perçu par l'utilisateur? Et comment les oeuvres programmées mettent-elles en oeuvre ces ruptures générées par l'accident informatique? Dans un monde tiraillé entre le tout sécuritaire, le tout anticipé et une réhabilitation de l'accident dans certaines pratiques émergentes, qui tend aujourd'hui, en s'étendant à tous les champs de la recherche, à contaminer notre vision du monde, le bug apparaît comme cet accident particulier, improbable, paradoxal, par définition, réfractaire à toute forme d'anticipation et de mise en œuvre. Si parler d'esthétique de l'accident et tout particulièrement d'une esthétique du bug s'avère, a priori, contre-nature, alors comment les œuvres programmées font-elles advenir un accidentel ? Comment travaillent-elles cet imprévisible, ce non programme ? Quelles sont leurs propres modes opératoires?
16
Zhang, Yiwei. "SIGBOT signature-based multiple-bug localization /." Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B43757418.
Full text
17
Gouge, Dawn. "How to Bug Proof your Home." College of Agriculture and Life Sciences, University of Arizona (Tucson, AZ), 2009. http://hdl.handle.net/10150/146731.
Full text
18
Moran, Kevin Patrick. "Enhancing Bug Reports for Mobile Apps." W&M ScholarWorks, 2015. https://scholarworks.wm.edu/etd/1539626966.
Full text
19
Cavalcanti, Yguaratã Cerqueira. "A bug report analysis and search tool." Universidade Federal de Pernambuco, 2009. https://repositorio.ufpe.br/handle/123456789/2027.
Full textAbstract:
Made available in DSpace on 2014-06-12T15:53:57Z (GMT). No. of bitstreams: 2
arquivo1938_1.pdf: 2696606 bytes, checksum: c2ff3cbbb3029fd0f89eb8d67c0e4f08 (MD5)
license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5)
Previous issue date: 2009Manutenção e evolução de software são atividades caracterizadas pelo seu enorme custo e baixa velocidade de execução. Não obstante, elas são atividades inevitáveis para garantir a qualidade do software quase todo software bem sucedido estimula os usuários a fazer pedidos de mudanças e melhorias. Sommerville é ainda mais enfático e diz que mudanças em projetos de software são um fato. Além disso, diferentes estudos têm afirmado ao longo dos anos que as atividades de manutenção e evolução de software são as mais caras do ciclo de desenvolvimento, sendo responsável por cerca de até 90% dos custos. Todas essas peculiaridades da fase de manutenção e evolução de software leva o mundo acadêmico e industrial a investigar constantemente novas soluções para reduzir os custos dessas atividades. Neste contexto, Gerência de Configuração de Software (GCS) é um conjunto de atividades e normas para a gestão da evolução e manutenção de software; GCS define como são registradas e processadas todas as modificações, o impacto das mesmas em todo o sistema, dentre outros procedimentos. Para todas estas tarefas de GCM existem diferentes ferramentas de auxílio, tais como sistemas de controle de versão e bug trackers. No entanto, alguns problemas podem surgir devido ao uso das mesmas, como por exemplo o problema de atribuição automática de responsável por um bug report e o problema de duplicação de bug reports. Neste sentido, esta dissertação investiga o problema de duplicação de bug reports resultante da utilização de bug trackers em projetos de desenvolvimento de software. Tal problema é caracterizado pela submissão de dois ou mais bug reports que descrevem o mesmo problema referente a um software, tendo como principais conseqüências a sobrecarga de trabalho na busca e análise de bug reports, e o mal aproveitamento do tempo destinado a essa atividade
20
Kim, Sunghun. "Adaptive bug prediction by analyzing project history /." Diss., Digital Dissertations Database. Restricted to UC campuses, 2006. http://uclibs.org/PID/11984.
Full text
21
Horn, Alex. "Automated concurrency bug finding using partial-orders." Thesis, University of Oxford, 2015. https://ora.ox.ac.uk/objects/uuid:a7c5aaee-2a40-4c22-aed8-3e12287bc315.
Full textAbstract:
Concurrent systems are ubiquitous, ranging from multi-core processors to large-scale distributed systems. Yet, the verification of concurrent systems remains a daunting task, and technological advances such as weak memory architectures greatly compound this problem. Such challenges have renewed interest in symbolic encodings of partial-order semantics of concurrency using propositional logic or decidable fragments of first-order logic. The impetus behind these partial-order encodings is the efficiency of evermore highly optimized decision procedures, such as Boolean satisfiability (SAT) and Satisfiability Modulo Theory (SMT) solvers. While methods to effectively use SAT/SMT solvers for automatically finding bugs in sequential software through symbolic techniques, such as bounded model checking or symbolic execution, are well known, this thesis gives theoretical and experimental results that highlight a new set of challenges faced by partial-order encoding techniques. Furthermore, it shows how different solutions to these problems emerge if partial-order encodings are restructured into three separate theory-specific parts. This separation opens up a fresh and fruitful algorithmic perspective on partial-order encodings, including a new partial-order encoding that can drastically reduce the run-time of the analysis prior to calling the SAT/SMT solver, and new insights into the exponential worst-case time complexity of partial-order encodings during SAT/SMT solving. These results are significant as they propose a paradigm shift in how to harness the computational power of SAT/SMT solvers for partial-order encodings.
22
Tait, Calista (Calista Elizabeth) 1975. "A highly configurable software bug tracking system." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/80130.
Full textAbstract:
Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.Includes bibliographical references (p. 61-62).
by Calista Tait.
S.B.and M.Eng.
23
Rahimi, Ali 1976. "Bug vision : experiments in low resolution vision." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/62362.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, School of Architecture and Planning, Program in Media Arts and Sciences, 2001.Includes bibliographical references (p. 71-73).
Tracking multiple people using cameras is similar to the well-studied problem of tracking multiple radar or sonar echoes. This thesis shows that current camera-based tracking algorithms convert each image in a video sequence to a list of targets through a segmentation step, and pass this target set to a traditional multiple-point-target tracking algorithm. Various tracking vision-based strategies as well as point tracking strategies are discussed. Bayesian solutions to the point-tracking problem are well understood, because the generative models need describe the dynamics of simple point objects. In addition, the radar tracking problem assumes that measurements are noise corrupted positions, which makes it easy to cast the tracking problem in a Bayesian framework. Unlike radar, cameras report observations as images. Though point object dynamics can still be used to describe the hidden state of targets, the observation model is an image formation process. As such, the typical solution to tracking in the camera-based tracking community is to reduce each image to a point set, where each point corresponds to a potential target. However, this step introduces uncertainty that is usually not modeled. This thesis proposes a Bayesian person-tracking algorithm which models the entire process of tracking, from the dynamics of the targets to the formation of easy to compute image transforms. An approximate Bayesian tracking algorithm based on Variational Bayes is developed. All the benefits of a Bayesian framework including modeling of the certainty of the recovered results and model selection are taken advantage of. The resulting person tracking algorithm can operate on extremely poor quality imagery. In addition, the tracker can compute the number of targets in the scene automatically as a side effect of its Bayesian formulation.
by Ali Rahimi.
S.M.
24
Bug, Hannah [Verfasser]. "Digitalisierung und Rundfunkkonzentrationskontrolle von Medienkonglomeraten / Hannah Bug." Frankfurt a.M. : Peter Lang GmbH, Internationaler Verlag der Wissenschaften, 2018. http://d-nb.info/1161044469/34.
Full text
25
Eriksson, Caroline, and Emilia Kallis. "NLP-Assisted Workflow Improving Bug Ticket Handling." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-301248.
Full textAbstract:
Software companies spend a lot of resources on debugging, a process where previous solutions can help in solving current problems. The bug tickets, containing this information, are often time-consuming to read. To minimize the time spent on debugging and to make sure that the knowledge from prior solutions is kept in the company, an evaluation was made to see if summaries could make this process more efficient. Abstractive and extractive summarization models were tested for this task and fine-tuning of the bert-extractive-summarizer was performed. The model-generated summaries were compared in terms of perceived quality, speed, similarity to each other, and summarization length. The average description summary contained part of the description needed and the found solution was either well documented or did not answer the problem at all. The fine-tuned extractive model and the abstractive model BART provided good conditions for generating summaries containing all the information needed.Vid mjukvaruutveckling går mycket resurser åt till felsökning, en process där tidigare lösningar kan hjälpa till att lösa aktuella problem. Det är ofta tidskrävande att läsa felrapporterna som innehåller denna information. För att minimera tiden som läggs på felsökning och säkerställa att kunskap från tidigare lösningar bevaras inom företaget, utvärderades om sammanfattningar skulle kunna effektivisera detta. Abstrakta och extraherande sammanfattningsmodeller testades för uppgiften och en finjustering av bert-extractive- summarizer gjordes. De genererade sammanfattningarna jämfördes i avseende på upplevd kvalitet, genereringshastighet, likhet mellan varandra och sammanfattningslängd. Den genomsnittliga sammanfattningen innehöll delar av den viktigaste informationen och den föreslagna lösningen var antingen väldokumenterad eller besvarade inte problembeskrivningen alls. Den finjusterade BERT och den abstrakta modellen BART visade goda förutsättningar för att generera sammanfattningar innehållande all den viktigaste informationen.
26
Näslund, Johan, and Henrik Nero. "To Force a Bug : Extending Hybrid Fuzzing." Thesis, Blekinge Tekniska Högskola, Institutionen för datavetenskap, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-19721.
Full textAbstract:
One of the more promising solutions for automated binary testing today is hybrid fuzzing, a combination of the two acknowledged approaches, fuzzing and symbolic execution, for detecting errors in code. Hybrid fuzzing is one of the pioneering works coming from the authors of Angr and Driller, opening up for the possibility for more specialized tools such as QSYM to come forth. These hybrid fuzzers are coverage guided, meaning they measure their success in how much code they have covered. This is a typical approach but, as with many, it is not flawless. Just because a region of code has been covered does not mean it has been fully tested. Some flaws depend on the context in which the code is being executed, such as double-free vulnerabilities. Even if the free routine has been invoked twice, it does not mean that a double-free bug has occurred. To cause such a vulnerability, one has to free the same memory chunk twice (without it being reallocated between the two invocations to free). In this research, we will extend one of the current state-of-the-art hybrid fuzzers, QSYM, which is an open source project. We do this extension, adding double-free detection, in a tool we call QSIMP. We will then investigate our hypothesis, stating that it is possible to implement such functionality without losing so much performance that it would make the tool impractical. To test our hypothesis we have designed two experiments. One experiment tests the ability of our tool to find double-free bugs (the type of context-sensitive bug that we have chosen to test with). In our second experiment, we explore the scalability of the tool when this functionality is executed. Our experiments showed that we were able to implement context-sensitive bug detection within QSYM. We can find most double-free vulnerabilities we have tested it on, although not all, because of some optimizations that we were unable to build past. This has been done with small effects on scalability according to our tests. Our tool can find the same bugs that the original QSYM while adding functionality to find double-free vulnerabilities.En av de mer lovande lösningarna för automatiserad binärtestning är i dagsläget hybrid fuzzing, en kombination av två vedertagna tillvägagångssätt, fuzzing och symbolisk exekvering. Forskarna som utvecklade Angr och Driller anses ofta vara några av de första med att testa denna approach. Detta har i sin tur öppnat upp för fler mer specialiserade verktyg som QSYM. Dessa hybrid fuzzers mäter oftast sin framgång i hänsyn till hur mycket kod som nås under testningen. Detta är ett typiskt tillvägagångssätt, men som med många metoder är det inte felfri. Kod som har exekverats, utan att en bugg utlösts, är inte nödvändigtvis felfri. Vissa buggar beror på vilken kontext maskininstruktioner exekveras i -- ett exempel är double-free sårbarheter. Att minne har frigjorts flera gånger betyder inte ovillkorligen att en double-free sårbarhet har uppstått. För att en sådan sårbarhet ska uppstå måste samma minne frigöras flera gånger (utan att detta minne omallokerats mellan anropen till free). I detta projekt breddar vi en av de främsta hybrid fuzzers, QSYM, ett projekt med öppen källkod. Det vi tillför är detektering av double-free i ett verktyg vi kallar QSIMP. Vi undersöker sedan vår hypotes, som säger att det är möjligt att implementera sådan funktionalitet utan att förlora så mycket prestanda att det gör verktyget opraktiskt. För att bepröva hypotesen har vi designat två experiment. Ett experiment testar verktygets förmåga att detektera double-free sårbarheter (den sortens kontext-känsliga sårbarheter vi har valt att fokusera på). I det andra experimentet utforskar vi huruvida verktyget är skalbart då den nya funktionaliteten körs. Våra experiment visar att vi har möjliggjort detektering av kontext-känsliga buggar genom vidareutveckling av verktyget QSYM. QSIMP hittar double-free buggar, dock inte alla, på grund av optimiseringar som vi ej har lyckats arbeta runt. Detta har gjorts utan större effekter på skalbarheten av verktyget enligt resultaten från våra experiment. Vårt verktyg hittar samma buggar som orignal verktyget QSYM, samtidigt som vi tillägger funktionalitet för att hitta double-free sårbarheter.
27
Wei, Pihui. "Dynamic Bug Detection in TinyOS Operating Environments." The Ohio State University, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=osu1238166929.
Full text
28
Rehnholm, Gustav, and Felix Rysjö. "Bug Prediction with Machine Learning : Bloodhound 0.1." Thesis, Karlstads universitet, Institutionen för matematik och datavetenskap (from 2013), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-84333.
Full textAbstract:
Introduction Bugs in software is a problem that grows over time if they are not dealt with in an early stage, therefore it is desirable to find bugs as early as possible. Bugs usually correlate with low software quality, which can be measured with different code metrics. The goal of this thesis is to find out if machine learning can be used to predict bugs, using code metric trends. Method To achieve the thesis goal a program was developed, which will be called Bloodhound, that analyses code metric trends to predict bugs using the machine learning algorithm k nearest neighbour. The code metrics required to do so is extracted using the program cdbs, which in turn uses the program SonarQube to create the source code metrics. Results Bloodhound were trained with a time-frame of 42 days between the dates June 1, 2016 to July 13, 2016 containing 202 commits and 312 changed files from the JabRef repository. The files were changed on average 1.5 times. Bloodhound never found more than 25% of the bugs and of its bug predictions, was right at most 42% of the time. Conclusion Bloodhound did not succeed in predicting bugs. But that was most likely because the time frame was too short to generate any significant trends.
29
Dilshener, Tezcan. "Improving information retrieval bug localisation using contextual heuristics." Thesis, Open University, 2017. http://oro.open.ac.uk/50204/.
Full textAbstract:
Software developers working on unfamiliar systems are challenged to identify where and how high-level concepts are implemented in the source code prior to performing maintenance tasks. Bug localisation is a core program comprehension activity in software maintenance: given the observation of a bug, e.g. via a bug report, where is it located in the source code? Information retrieval (IR) approaches see the bug report as the query, and the source files as the documents to be retrieved, ranked by relevance. Current approaches rely on project history, in particular previously fixed bugs and versions of the source code. Existing IR techniques fall short of providing adequate solutions in finding all the source code files relevant for a bug. Without additional help, bug localisation can become a tedious, time- consuming and error-prone task. My research contributes a novel algorithm that, given a bug report and the application’s source files, uses a combination of lexical and structural information to suggest, in a ranked order, files that may have to be changed to resolve the reported bug without requiring past code and similar reports. I study eight applications for which I had access to the user guide, the source code, and some bug reports. I compare the relative importance and the occurrence of the domain concepts in the project artefacts and measure the effectiveness of using only concept key words to locate files relevant for a bug compared to using all the words of a bug report. Measuring my approach against six others, using their five metrics and eight projects, I position an effected file in the top-1, top-5 and top-10 ranks on average for 44%, 69% and 76% of the bug reports respectively. This is an improvement of 23%, 16% and 11% respectively over the best performing current state-of-the-art tool. Finally, I evaluate my algorithm with a range of industrial applications in user studies, and found that it is superior to simple string search, as often performed by developers. These results show the applicability of my approach to software projects without history and offers a simpler light-weight solution.
30
Naciri, William Malik. "Bug Finding Methods for Multithreaded Student Programming Projects." Thesis, Virginia Tech, 2017. http://hdl.handle.net/10919/78675.
Full textAbstract:
The fork-join framework project is one of the more challenging programming assignments in the computer science curriculum at Virginia Tech. Students in Computer Systems must manage a pool of threads to facilitate the shared execution of dynamically created tasks. This project is difficult because students must overcome the challenges of concurrent programming and conform to the project's specific semantic requirements.
When working on the project, many students received inconsistent test results and were left confused when debugging. The suggested debugging tool, Helgrind, is a general-purpose thread error detector. It is limited in its ability to help fix bugs because it lacks knowledge of the specific semantic requirements of the fork-join framework. Thus, there is a need for a special-purpose tool tailored for this project.
We implemented Willgrind, a debugging tool that checks the behavior of fork-join frameworks implemented by students through dynamic program analysis. Using the Valgrind framework for instrumentation, checking statements are inserted into the code to detect deadlock, ordering violations, and semantic violations at run-time. Additionally, we extended Willgrind with happens-before based checking in WillgrindPlus. This tool checks for ordering violations that do not manifest themselves in a given execution but could in others.
In a user study, we provided the tools to 85 students in the Spring 2017 semester and collected over 2,000 submissions. The results indicate that the tools are effective at identifying bugs and useful for fixing bugs. This research makes multithreaded programming easier for students and demonstrates that special-purpose debugging tools can be beneficial in computer science education.Master of Science
31
Harrison, Scott Atlee. "Reproductive Behavior in the Bed Bug (Cimex lectularius)." The Ohio State University, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=osu1452251747.
Full text
32
Bealmear, Stacey, Peter Warren, and Kelly Young. "Bagrada Bug: A New Pest for Arizona Gardeners." College of Agriculture and Life Sciences, University of Arizona (Tucson, AZ), 2012. http://hdl.handle.net/10150/263172.
Full text
33
Artchounin, Daniel. "Tuning of machine learning algorithms for automatic bug assignment." Thesis, Linköpings universitet, Programvara och system, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-139230.
Full textAbstract:
In software development projects, bug triage consists mainly of assigning bug reports to software developers or teams (depending on the project). The partial or total automation of this task would have a positive economic impact on many software projects. This thesis introduces a systematic four-step method to find some of the best configurations of several machine learning algorithms intending to solve the automatic bug assignment problem. These four steps are respectively used to select a combination of pre-processing techniques, a bug report representation, a potential feature selection technique and to tune several classifiers. The aforementioned method has been applied on three software projects: 66 066 bug reports of a proprietary project, 24 450 bug reports of Eclipse JDT and 30 358 bug reports of Mozilla Firefox. 619 configurations have been applied and compared on each of these three projects. In production, using the approach introduced in this work on the bug reports of the proprietary project would have increased the accuracy by up to 16.64 percentage points.
34
McEwan, Peter Kwaku. "Flight capacity of triatomine bug vectors of Chagas disease." Thesis, Bangor University, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.304798.
Full text
35
Politt, Holger. "Hinter dem Bug : zur polnischen Sicht auf die Ukrainekrise." Universität Potsdam, 2014. http://opus.kobv.de/ubp/volltexte/2014/7182/.
Full textAbstract:
Polens Sicht auf die Ukrainekrise ist von dessen geopolitischer Lage geprägt. Als Teil der EU und NATO grenzt das Land unmittelbar an die Krisenregion. Sowohl die Parteien als auch die öffentliche Meinung in Polen verteidigen übereinstimmend die territoriale Integrität der Ukraine und halten deren staatliche Unabhängigkeit für einen unentbehrlichen Faktor der politischen Ordnung in Europa. Vor allem die Frage nach den künftigen Möglichkeiten einer weiteren Ostausdehnung der EU steht daher aus Warschauer Sicht auf der Agenda.
36
Newcombe, Devi Isadora Ramayanti. "Maternal effects in the large milkweed bug Oncopeltus fasciatus." Thesis, University of Exeter, 2013. http://hdl.handle.net/10871/11343.
Full textAbstract:
Maternal effects are the non-genetic contributions of mothers (or fathers) towards the phenotype of their offspring. Maternal effects are now well recognised as a facilitator for evolutionary change in offspring phenotypes and life history strategies which can have effects on population dynamics, population divergence and even speciation. Furthermore, maternal effects have been shown to have a heritable genetic basis and that they are genetically variable, which suggests that they contribute to maintaining phenotypic variation. Maternal effects may impede or accelerate responses to selection which has implications for adaptive evolution and making predictions about their evolutionary potential. The importance of their contribution to phenotypic variation and life history evolution has made maternal effects an important consideration in fields such as conservation and population biology, evolutionary ecology and evolutionary genetics. The aim of this thesis is to investigate if maternal effects can influence offspring life history traits and fitness parameters through maternal resources via the egg. Main questions that are asked include: can maternal effects help facilitate transition to a novel host-diet (Chapter 2); does maternal diet influence egg composition and, if so, does this have an effect on offspring life-history parameters (Chapter 3); is there a genetic basis to egg composition and is there potential for egg composition to evolve (Chapter 4); and are defensive compounds from the diet transferred into the eggs, if so, are these uni- or biparentally transferred and does this offer protection against predation (Chapter 5)? To address these questions we used a specialist insect herbivore, the large milkweed bug Oncopeltus fasciatus (Hemiptera: Lygaeidae). In the wild, O. fasciatus feed on plants from the genus Asclepias (Apocynacea). However, O. fasciatus can be reared successfully in laboratories on sunflower seeds Helianthus annus. For our experiments we used two populations of O. fasciatus, one population has been maintained on dry seeds of A. syriaca while the other population has been reared and maintained on sunflower seeds. The results of Chapter 2 were suggestive of a maternal host-diet effect on egg mass and hatching success, but we did not find evidence that maternal host-diet was significant in influencing a transition to a novel host. In Chapter 3 we found that there was variation in the free amino acid profiles of the eggs between our treatments suggesting that amino acid profiles may be influenced by maternal diet. The results of our multivariate selection analysis to examine linear and nonlinear (quadratic) relationships between maternal diet and the free amino acid profiles of the eggs suggest that there may be population-specific responses which can influence specific amino acid profiles in relation to hatchling mass. In Chapter 4 we used only the milkweed-adapted population to determine if there was a genetic basis to amino acid profiles in the eggs. We constructed a genetic variance-covariance (G) matrix to determine the strength and direction of the relationships between amino acids and to assess the potential for amino acid profiles to evolve. While we found genetic variation for amino acids, and that there was evidence for positive moderate to strong genetic correlations between many of them, we also found evidence for constraints for the potential for amino acid profiles to evolve as evidenced by the calculation of gmax (which represents the linear combination of components that has the highest genetic variance and which is the most accessible to evolution). In Chapter 5 we found maternal, but not paternal, transmission of cardenolides into the eggs. However, this did not confer protection of all eggs against predation from larvae of the green lacewing Chrysoperla carnea. Overall, results suggest that for our populations of O. fasciatus, maternal effects are significant in influencing early life history traits such as egg mass and hatchling mass. However, we did not find any significant effects on other offspring life history or fitness parameters that we measured. This may be surprising as positive, and negative, effects of non-genetic contributions of females (and males) to their offspring has been widely reported in many taxa. The patterns and implications of maternal resource allocation and their effects on offspring life history evolution are explored and discussed, as are the limitations of our experimental designs. I hope that this research can be used to stimulate further investigations into maternal effects and the relationships between host-plant, maternal allocation strategies and life history evolution.
37
Barber, Kristin M. "Improving Bug Visibility using System-Level Assertions and Transactions." University of Cincinnati / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1377875020.
Full text
38
Nabil, Mohamed. "Le bug de l'an 2000 : aspects économiques et juridiques." Perpignan, 1999. http://www.theses.fr/1999PERP0349.
Full text
39
Taylor, Christopher Michael. "Understanding the relationship between the brown marmorated stink bug, Halyomorpha halys (Stal), and its symbiont, Pantoea carbekii, with implications for stink bug management." Thesis, University of Maryland, College Park, 2016. http://pqdtopen.proquest.com/#viewpdf?dispub=10128715.
Full textAbstract:
Symbiotic relationships between insects and beneficial microbes are very common in nature, especially within the Hemiptera. The brown marmorated stink bug, Halyomorpha halys Stål, harbors a symbiont, Pantoea carbekii, within the fourth region of the midgut in specialized crypts. In this dissertation, I explored this insect-microbe relationship. I determined that the brown marmorated stink bug is heavily reliant on its symbiont, and that experimental removal of the symbiont from the egg mass surface prior to nymphal acquisition led to lower survival, longer development, lower fecundity, and aberrant nymphal behavior. Additionally, I determined that even when the symbiont is acquired and housed in the midgut crypts, it is susceptible to stressors. Stink bugs reared at a higher temperature showed lower survival, longer development, and a cease in egg mass production, and when bugs were screened for their symbiont, fewer had successfully retained it while under heat stress. Finally, with the knowledge that the stink bug suffers decreases in fitness when its symbiont is missing or stressed, I wanted to determine if targeting the symbiont was a possible management technique for the stink bug. I tested the efficacy of a number of different insecticidal and antimicrobial products to determine whether prevention of symbiont acquisition from the egg mass was possible, and results indicated that transmission of the symbiont from the egg mass to the newly hatched nymph was negatively impacted when certain products were applied (namely surfactants or products containing surfactants). Additionally, direct effects on hatch rate and survival were reported for certain products, namely the insect growth regulator azadirachtin, which suggests that nymphs can pick up residues from the egg mass surface while probing for the symbiont. I conclude that P. carbekii plays a critically important role in the survival of its host, the brown marmorated stink bug, and its presence on the egg mass surface before nymphal hatch makes it targetable as a potential management technique.
40
Erezyilmaz, Deniz F. "The genetic and endocrine bases of the evolution of complete metamorphosis in insects /." Thesis, Connect to this title online; UW restricted, 2004. http://hdl.handle.net/1773/5165.
Full text
41
Blinka, Eric Lee. "BIOLOGICAL AND ECOLOGICAL STUDIES ON GREEN STINK BUG, Acrosternum hilare, AND BROWN STINK BUG, Euschistus servus (HEMIPTERA: PENTATOMIDAE), IN EASTERN NORTH CAROLINA CROPPING SYSTEMS." NCSU, 2008. http://www.lib.ncsu.edu/theses/available/etd-04282008-114706/.
Full textAbstract:
In 2004 through 2007, biological and ecological studies were conducted on the stink bug complex across Eastern North Carolina with emphasis on the brown stink bug, Euschistus servus (Hemiptera: Pentatomidae). Ecological studies included the use of survey samples, pheromone traps, and black light traps to monitor brown stink and green stink bug, Acrosternum hilare (Hemiptera: Pentatomidae), movement across selected Eastern North Carolina agro-ecosystems. Ecological research also focused on the movement of brown stink bugs within a wheat / corn agro-ecosystem through the use of sweep net samples and whole plant examinations, along with the vertical distribution of brown stink bugs on corn plants. Based upon brown stink bugs ability to fully complete the F1 generation within wheat in NC, historical weather data was examined utilizing a sine wave growing degree day model to predict the number of generations possible. The relationship among differing stink bug boll-feeding symptoms (external signs vs. internal symptoms) and boll damage to lint gin-out and quality were also examined. The last ecological study focused on the evaluation of the relationship between stink bug pressure and yield under a regressive spray treatment. A molecular study was conducted to help validate brown stink bug movement between crops by separating proteins of crop host from insect guts utilizing gel electrophoresis and mass finger printing the peptides. The peptides were then searched against the Viridiplantea data base for conformation which crop host proteins were derived from. Results from this work have given some insight to the biological and ecological movement of stink bugs across Eastern North Carolina. It has also demonstrated that there is a need for further investigation into the stink bug complex.
42
Wenstad, Peder. "GPS Guided R/C Car : The Local Bug Test Platform." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for teknisk kybernetikk, 2010. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-11121.
Full textAbstract:
This thesis is a part of the Local Hawk student project where the overall goal is to develop a Autonomous Unmanned Aerial Vehicle (AUAV). The project was initiated by Kongsberg Defence Systems (KDS) and is developed in collaboration with the Norwegian University of Science and Technology (NTNU). In an AUAV it is necessary to have a guidance system in order to be autonomous. To be able to test guidance principles in practice without risking the Local Hawk airframe the need of a ground based test platform became apparent. This thesis is the development of the Local Bug Test Platform.The Local Bug is based on a R/C car and utilizes electronics used and developed in the Local Hawk project. In order to understand the system behaviour, vehicle modelling is discussed and two models are presented. One of them is used in a SIMULINK simulator design for the Local Bug. The simulator is used to ensure the correct controller behaviour before it is tested on the real system. Phoenix II is the backbone of the Local Bug electronics and is used to gather measurement data, log data to memory and execute controller algorithms. Custom made C-code is used as a framework providing all the functionality needed. A introduction to Real-Time Workshop is given, and a step-by-step guide on how to use RTW generated C-code on the Phoenix II for controller purposes.A heading controller is designed and used in combination to two different guidance algorithms. The Line of Sight algorithm aims for the next waypoint regardless where the vehicle is positioned relative other waypoints. A Cross-Track Error algorithm with look ahead distance functionality focuses on minimizing the vehicles distance from a desired path. Both algorithms successfully guides the vehicle trough the test route visiting all the waypoints. The Local Bug is now usable as a test platform for controller algorithms. Measurements are logged to memory making it possible to analyse the performance after a test has been conducted. The overall functionality is found to be satisfactory and the Local Hawk project now has its desired controller/guidance test platform.
43
Schulz, Pascal. "Penetration Testing of Web Applications in a Bug Bounty Program." Thesis, Karlstads universitet, Institutionen för matematik och datavetenskap, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-32404.
Full textAbstract:
Web applications provide the basis for the use of the "World-Wide-Web", as people know itnowadays. These software solutions get programmed by a numerous amount of developersall over the world. For all this software, it is not possible to guarantee a 100 percent security.Therefore, it is desirable that every application should get evaluated using penetration tests.Anewformof security testing platforms is getting provided by bug bounty programs, whichencourage the community to help searching for security breaches. This work introduces thecurrently leading portal for bug bounties, called Bugcrowd Inc. In addition, web applications,which were part of the program, got tested in order to evaluate their security level.A comparison is made with given statistics by leading penetration testing companies, showingthe average web application security level. The submission process, to send informationabout vulnerabilities, is getting evaluated. The average time it takes, to receive an answer regardinga submission is getting reviewed. In the end, the findings get retested, to evaluate, ifthe bug bounty program is a useful opportunity to increase security and if website operatorstake submissions serious by patching the software flaws.
44
Bug, Steffen [Verfasser]. "Charakterisierung von Mobilfunkkanälen auf Basis der nichtlinearen Dynamik / Steffen Bug." Aachen : Shaker, 2006. http://d-nb.info/1186583835/34.
Full text
45
Gao, Qi. "Runtime Support for Improving Reliability in System Software." The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1267818711.
Full text
46
Stutt, Alastair David. "Reproductive strategies and sexual conflict in the bed bug Cimex lectularius." Thesis, University of Sheffield, 1999. http://etheses.whiterose.ac.uk/6027/.
Full textAbstract:
In this thesis I examine the reproductive strategies of the bed bug Cimex lectularius, a traumatically inseminating insect. In Chapter 21 examine the mating behaviour of C. lectularius, including the mating rates of males and females. Remating rates were very high, with females mating with 5 different males during a single reproductive bout. Males copulated for longer with virgin females than non-virgins. Sperm competition was predicted to be an important determinant of male reproductive success, because the ejaculates of an average of 5 males will be concurrent in the female's reproductive tract during a reproductive bout. In Chapter 3 the different gamete allocation strategies used by males were examined. Males allocated more sperm to virgin females than to non-virgins. Sperm migration and storage by females was examined in order to provide a basis from which mechanisms of sperm competition could be predicted. In Chapter 4 the patterns of sperm precedence were examined and a hypothetical mechanism of sperm competition was tested experimentally. Sperm precedence appears to favour the last male to mate due to a positional effect in the spermalege of the last ejaculate inseminated. In Chapter 5 the effect of high mating rates on females was assessed experimentally. Females mating at a high rate were found to die earlier than females mating at an artificially low rate. There was no difference in the rate of egg production of females between these two groups, so females mating at a low rate had a higher lifetime reproductive success. Appendix I investigates the potential benefits females may gain from polyandry. Both direct benefits of mating and a suite of possible fitness traits were assessed. However, no detectable differences in number or quality of offspring were uncovered. Chapter 6 reviews the evidence for a conflict of interest between the sexes over the remating rate and the possible causes of this conflict.
47
FERREIRA, ISABELLA VIEIRA. "ASSESSING THE BUG-PRONENESS OF REFACTORED CODE: LONGITUDINAL MULTI-PROJECT STUDIES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2018. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=35428@1.
Full textAbstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIROCONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO
Os elementos de código geralmente mudam ao longo da evolução do sistema, o que implica em uma eventual degradação estrutural do código fonte. Sintomas recorrentes de tal degradação são chamados anomalias de código. Estudos sugerem que quanto mais anomalias de código afetam um sistema, mais alta se torna a propensão a bugs dos elementos de código. Para lidar com tal degradação da qualidade estrutural do código, desenvolvedores geralmente aplicam refatorações no código fonte. No entanto, aplicar refatorações pode não ser suficiente para reduzir a propensão a bugs dos elementos de código degradados. Um estudo recente sugere que refatorações induzem bugs frequentemente. No entanto, os autores não analisam se o código refatorado está, de fato, diretamente relacionado à introdução de bugs. Com isso, nesta dissertação, realizamos dois estudos longitudinais de múltiplos projetos para avaliar a propensão a bugs do código refatorado. Nossa metodologia teve como objetivo abordar várias limitações de estudos anteriores. Por exemplo, definimos duas propriedades complementares da propensão a bugs do código refatorado, sendo elas, frequência e distância. Enquanto a primeira propriedade quantifica a frequência com que um código refatorado está relacionado a bugs que emergiram no código fonte, a distância quantifica o quão próximo um bug surge depois que uma refatoração é aplicada. Nosso primeiro estudo tem como objetivo avaliar a propensão a bugs de refatorações isoladas. Primeiro, nossos resultados mostram que 80 porcento dos elementos degradados que se tornaram bugs não foram previamente refatorados. Este resultado implica que um código refatorado é menos propenso a bugs do que um código não refatorado. Em segundo lugar, em 75 porcento das vezes um bug surge depois de 7 mudanças feitas a partir da operação de refatoração, o que geralmente corresponde à 3 meses nos projetos analisados. Nosso segundo estudo tem como objetivo avaliar a propensão a bugs de refatorações em lote, ou seja, refatorações aplicadas em sequência. Nossos resultados mostram que, na maioria dos casos, o código refatorado em lotes é mais resiliente à introdução de bugs do que o código refatorado por meio de refatorações isoladas.
Programs often change along the system evolution, which implies an eventual code structure degradation. Recurring symptoms of such degradation are code smells. Studies suggest that the more frequently code smells affect a system, the higher becomes the bug-proneness of the code elements. To tackle code structural quality degradation, developers often apply refactorings on smelly program elements. However, applying refactorings might not suffice to reduce the bug-proneness of such degraded program elements. Previous empirical studies do not systematically analyze the bug-proneness of refactored code. Even though a recent study suggests that refactoring induces bugs frequently, the authors do not analyze to what extent refactored code is indeed closely related to the bug occurrence. Thus, in this dissertation, we conducted two longitudinal multi-project studies to assess the bugproneness of refactored code. Our methodology aimed to address various limitations of previous studies. For instance, we have defined two complementary properties of the bug-proneness of refactored code, i.e., frequency and distance. While the former quantifies how often a refactored code is related to emerging bugs, the latter quantifies how close a bug emerges after a refactoring has been applied. The quantitative analysis of such properties was complemented by a manual analysis of refactorings closely related to the bug occurrence. Our first study aims at assessing the bug-proneness of code refactored through isolated refactorings, i.e., a single refactoring operation not performed in conjunction with other refactoring operations. This study reveals that 80 per cent of the smelly elements that became buggy were not previously refactored. This result suggests the refactored code is much less bug-prone than non-refactored code. Moreover, in 75 per cent of the times, a bug emerges in 7 changes far from the refactoring operation; this amount of changes usually corresponds to 3 months in the analyzed projects. Our second study aims at assessing the bug-proneness of code elements refactored through batch refactorings, i.e., a sequence of inter-related refactoring operations. Our results show that code refactored through batches is often more resilient to the introduction of bugs as compared to code refactored through isolated refactorings.
48
Tomasco, Ermenegildo. "Separating computation from communication : a design approach for concurrent bug finding." Thesis, University of Southampton, 2017. https://eprints.soton.ac.uk/418976/.
Full textAbstract:
With the spread of multi-core systems, the need to write concurrent programs in order to take advantage of their multi-core processors continues to grow. Developing concurrent programs free of errors is very difficult, due to their often non-deterministic nature. Further, weak memory models (WMMs) implemented in modern multi-core hardware architectures introduce additional executions that can lead to seemingly counter-intuitive results which confound the developers' reasoning. Although testing is a widely used approach to finding program errors, testing-only approaches, such as stress testing, remain highly ineffective for concurrency errors that rarely manifest themselves and are difficult to reproduce. Despite the substantial advancements in the field of analysis and verification of concurrent programs assuming the classical Sequential Consistency (SC) memory model, the stateof- the-art technology for other WMMs is quite unsatisfactory. The main goal of this thesis is to extend existing successful techniques that have been implemented for SC to more general WMMs. This work describes a general approach that allows to combine different verification techniques with different memory models in the style of a plug-and-play architecture. Its main idea is to introduce an abstraction that allows us to separate the computation and communication concerns of concurrent programs, without loosing the efficiency of existing approaches. We start by introducing an abstract data type, called shared memory abstraction (SMA), that encapsulates the semantics of the underlying memory model and implements it under the simpler SC and assume that all the standard concurrency operations in multi-threaded programs are performed by invoking the corresponding calls to API operations over the SMA. Furthermore, we implement efficient SMAs for Total Store Ordering (TSO) and Partial Store Ordering (PSO) semantics in our tool LazySMA and we experimentally demonstrate that it is very effective in finding bugs on a large set of benchmarks from the literature. iv Then, we formally characterize the concept of thread-asynchronous transition systems that allows us to optimize intra-thread analysis by rearranging the operations of the threads. this thesis also shows that several concurrent verification techniques from the literature can easily be recast in our setting and thus be extended to weak memory models. We give thread-asynchronous SMA implementations for the SC, TSO, and PSO memory models that are based on the idea of individual memory unwinding. Finally, we instantiate our approach by developing a new, efficient BMC-based bug finding tool for multi-threaded C programs under SC, TSO, or PSO memory models, and experimentally demonstrate on the same set of benchmarks used for LazySMA that it is competitive with existing tools.
49
Van, den Hooff Jelle (Jelle August). "Fast bug finding in lock-free data structures with CB-DPOR." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/92058.
Full textAbstract:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 39-40).
This thesis describes CB-DPOR, an algorithm for quickly finding bugs in lock-free data structures. CB-DPOR is a combination of the CHESS and DPOR model checking algorithms. CB-DPOR performs similar to the concurrently developed preemption-bounded BPOR algorithm. CODEX is a tool for finding bugs in lock-free data structures. CODEX implements CBDPOR and this thesis demonstrates how to use CODEX to find bugs. This thesis describes new bugs in open-source lock-free data structures, and compares the performance of CBDPOR with the earlier model checking algorithms CHESS, DPOR, and PCT. CB-DPOR find bugs one to two orders of magnitude faster than earlier algorithms.
by Jelle van den Hooff.
M. Eng.
50
Andersson, Johan. "Bug Report: A Study of Semantic Change during the Digital Revolution." Thesis, Stockholms universitet, Engelska institutionen, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-189593.
Full textAbstract:
Semantic change is a phenomenon that has been subject to a lot of research during the past few decades. However, a large part of the existing research has been conducted with the goal of finding causes of change or creating typologies in order to classify different types of changes. The present study has been conducted with the aim to examine how a specific extra-linguistic factor has affected a select few words. The extra-linguistic factor that is the focal point of this study is the rapid technological change during what is known as the digital revolution. This essay explores how the digital revolution has affected the uses of four words: bug, web, mouse,and cloud. The first part of this study was a collocational analysis of these four words. The results of the collocational analysis indicated that changes occurred during certain time periods. A closer context analysis was performed for each of the words on the time period during which a semantic change was suspected to occur. The findings of this essay are that all the examined words have gotten new technological meanings during the past 70 years, thus exhibiting semantic widening. All four words are currently polysemous words. Replacive change, meaning a change in the primary meaning of a word, is only apparent in web. The remaining words keep their primary senses throughout the examined period, and the new senses are added as periphery senses. The trends in the usage of these words indicate that it is possible that more of them will undergo replacive change, however, it is too early to tell.