Dissertations / Theses on the topic 'Sensitive information'
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 'Sensitive 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.
De, Cristofaro E. "Sharing sensitive information with privacy." Thesis, University College London (University of London), 2011. http://discovery.ucl.ac.uk/1450712/.
Full textAhlqvist, Ola. "Context Sensitive Transformation of Geographic Information." Doctoral thesis, Stockholm : Univ, 2000. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-200.
Full textForti, Cristiano Augusto Borges. "Bank dividends and signaling to information-sensitive depositors." reponame:Repositório Institucional do FGV, 2012. http://hdl.handle.net/10438/10518.
Full textApproved for entry into archive by Suzinei Teles Garcia Garcia (suzinei.garcia@fgv.br) on 2013-02-20T17:46:28Z (GMT) No. of bitstreams: 1 Tese Doutorado 2012 - Versão Final.pdf: 1027415 bytes, checksum: 2fa17755a9aff4536228a46badc3d5f2 (MD5)
Made available in DSpace on 2013-02-20T18:30:20Z (GMT). No. of bitstreams: 1 Tese Doutorado 2012 - Versão Final.pdf: 1027415 bytes, checksum: 2fa17755a9aff4536228a46badc3d5f2 (MD5) Previous issue date: 2012-10-24
This study investigates whether the composition of bank debt affects payout policy. I identify that information-sensitive depositors (Institutional Investors) are targets of dividend signaling by banks. I use a unique database of Brazilian banks, for which I am able to identify several types of debtholders, namely Institutional Investors, nonfinancial firms and individuals, which are potential targets of dividend signaling. I also exploit the features of the Brazilian banking system, such as the existence of several closely held banks, owned and managed by a small group of shareholders, for which shareholder-targeted signaling is implausible, and find that banks that rely more on information-sensitive (institutional) depositors for funding pay larger dividends, controlling for other features. During the financial crisis, this behavior was even more pronounced. This relationship reinforces the role of dividends as a costly and credible signal of the quality of bank assets. I also find that payout is negatively related to the banks’ cost of funding (interest rates paid on certificates of deposits), that dividends have a positive relationship with size and past profitability and that closely held banks pay more dividends than publicly traded banks, a finding that is also in line with the idea that depositors are targets of dividend-signaling. Finally, I find a negative relationship between dividends and the capital adequacy ratio, which indicates that regulatory pressure may induce banks to pay less dividends and that payouts are negatively related to the growth of the loan portfolio, consistent with the idea of banks retaining earnings to increase equity and thus their lending capacity.
Esta tese investiga se a composição do endividamento dos bancos afeta sua política de dividendos. Identificou-se que investidores sensíveis a informações (investidores institucionais) são alvos de sinalização através de dividendos por parte dos bancos. Utilizando uma base de dados exclusiva de bancos brasileiros, foi possível identificar vários tipos de credores, especificamente, investidores institucionais, empresas não financeiras e pessoas físicas, que são alvos potenciais de sinalização por dividendos. Adicionalmente, a existência de vários bancos de capital fechado, controlados e geridos por um pequeno grupo de acionistas, em que a sinalização direcionada a acionistas é implausível, permite inferir que bancos que utilizam mais fundos de investidores sensíveis a informações (institucionais) pagam mais dividendos, controlando por diversas características. Durante a crise financeira, este comportamento foi ainda mais pronunciado. Esta relação reforça o papel dos dividendos como uma forma custosa e crível de comunicar sobre a qualidade dos ativos dos bancos. A hipótese de que os dividendos podem ser utilizados como uma forma de expropriação dos depositantes por parte dos acionistas é refutada, uma vez que, se fosse esse o caso, observar-se-ia esse maiores dividendos em bancos com depositantes menos sensíveis a informação. Além disso, foi verificada uma relação negativa entre o pagamento de dividendos e o custo de captação (juros pagos em certificados de depósito bancário) e uma relação positiva de dividendos com o tamanho e com os lucros passados, e que os bancos de capital fechado pagam mais dividendos do que os de capital aberto, uma descoberta que também se alinha com a ideia de que os depositantes seriam os alvos da sinalização por dividendos. Finalmente, encontrou-se também uma relação negativa entre dividendos e adequação de capital do bancos, o que indica que pressões regulatórias podem induzir os bancos a pagar menos dividendos e que o pagamento de dividendos é negativamente relacionado com o crescimento da carteira de crédito, o que é consistente com a ideia de que os bancos com maiores oportunidades de investimento retêm seus lucros para aumentar seu patrimônio líquido e sua capacidade de conceder crédito.
Kacem, Sahraoui Ameni. "Personalized information retrieval based on time-sensitive user profile." Thesis, Toulouse 3, 2017. http://www.theses.fr/2017TOU30111/document.
Full textRecently, search engines have become the main source of information for many users and have been widely used in different fields. However, Information Retrieval Systems (IRS) face new challenges due to the growth and diversity of available data. An IRS analyses the query submitted by the user and explores collections of data with unstructured or semi-structured nature (e.g. text, image, video, Web page etc.) in order to deliver items that best match his/her intent and interests. In order to achieve this goal, we have moved from considering the query-document matching to consider the user context. In fact, the user profile has been considered, in the literature, as the most important contextual element which can improve the accuracy of the search. It is integrated in the process of information retrieval in order to improve the user experience while searching for specific information. As time factor has gained increasing importance in recent years, the temporal dynamics are introduced to study the user profile evolution that consists mainly in capturing the changes of the user behavior, interests and preferences, and updating the profile accordingly. Prior work used to discern short-term and long-term profiles. The first profile type is limited to interests related to the user's current activities while the second one represents user's persisting interests extracted from his prior activities excluding the current ones. However, for users who are not very active, the short-term profile can eliminate relevant results which are more related to their personal interests. This is because their activities are few and separated over time. For users who are very active, the aggregation of recent activities without ignoring the old interests would be very interesting because this kind of profile is usually changing over time. Unlike those approaches, we propose, in this thesis, a generic time-sensitive user profile that is implicitly constructed as a vector of weighted terms in order to find a trade-off by unifying both current and recurrent interests. User profile information can be extracted from multiple sources. Among the most promising ones, we propose to use, on the one hand, searching history. Data from searching history can be extracted implicitly without any effort from the user and includes issued queries, their corresponding results, reformulated queries and click-through data that has relevance feedback potential. On the other hand, the popularity of Social Media makes it as an invaluable source of data used by users to express, share and mark as favorite the content that interests them
Ema, Ismat. "Sensitive Data Migration to the Cloud." Thesis, Luleå tekniska universitet, Institutionen för system- och rymdteknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-64736.
Full textForde, Edward Steven. "Security Strategies for Hosting Sensitive Information in the Commercial Cloud." ScholarWorks, 2017. https://scholarworks.waldenu.edu/dissertations/3604.
Full textTräutlein, Sarah Anna Elisabeth [Verfasser], Peter [Akademischer Betreuer] Buxmann, and Alexander [Akademischer Betreuer] Benlian. "Employees' sensitive information disclosure behavior in enterprise information systems / Sarah Träutlein ; Peter Buxmann, Alexander Benlian." Darmstadt : Universitäts- und Landesbibliothek Darmstadt, 2017. http://d-nb.info/1149252448/34.
Full textTräutlein, Sarah [Verfasser], Peter [Akademischer Betreuer] Buxmann, and Alexander [Akademischer Betreuer] Benlian. "Employees' sensitive information disclosure behavior in enterprise information systems / Sarah Träutlein ; Peter Buxmann, Alexander Benlian." Darmstadt : Universitäts- und Landesbibliothek Darmstadt, 2017. http://d-nb.info/1149252448/34.
Full textLi, Xinfeng. "Time-sensitive Information Communication, Sensing, and Computing in Cyber-Physical Systems." The Ohio State University, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=osu1397731767.
Full textLiu, Yin. "Methodologies, Techniques, and Tools for Understanding and Managing Sensitive Program Information." Diss., Virginia Tech, 2021. http://hdl.handle.net/10919/103421.
Full textDoctor of Philosophy
Some portions of a computer program can be sensitive, referred to as sensitive program information (SPI). By compromising SPI, attackers can hurt user security/privacy. It is hard for developers to identify and protect SPI, particularly for large programs. This dissertation introduces novel methodologies, techniques, and software tools that facilitate software developments tasks concerned with locating and protecting SPI.
Boggs, Teresa. "Sharing Sensitive Information with Parents: A Guide for Early Childhood Educators." Digital Commons @ East Tennessee State University, 2011. https://dc.etsu.edu/etsu-works/1511.
Full textRubaiy, Hussein Nori. "Allosteric information transfer through inter-subunit contacts in ATP-sensitive potassium channels." Thesis, University of Leicester, 2012. http://hdl.handle.net/2381/11003.
Full textYoon, Janghyun. "A network-aware semantics-sensitive image retrieval system." Diss., Available online, Georgia Institute of Technology, 2004:, 2003. http://etd.gatech.edu/theses/available/etd-04082004-180459/unrestricted/yoon%5fjanghyun%5f200312%5fphd.pdf.
Full textJohnson, Kenneth Tyrone. "The Training Deficiency in Corporate America: Training Security Professionals to Protect Sensitive Information." ScholarWorks, 2017. https://scholarworks.waldenu.edu/dissertations/4145.
Full textBelkacem, Thiziri. "Neural models for information retrieval : towards asymmetry sensitive approaches based on attention models." Thesis, Toulouse 3, 2019. http://www.theses.fr/2019TOU30167.
Full textThis work is situated in the context of information retrieval (IR) using machine learning (ML) and deep learning (DL) techniques. It concerns different tasks requiring text matching, such as ad-hoc research, question answering and paraphrase identification. The objective of this thesis is to propose new approaches, using DL methods, to construct semantic-based models for text matching, and to overcome the problems of vocabulary mismatch related to the classical bag of word (BoW) representations used in traditional IR models. Indeed, traditional text matching methods are based on the BoW representation, which considers a given text as a set of independent words. The process of matching two sequences of text is based on the exact matching between words. The main limitation of this approach is related to the vocabulary mismatch. This problem occurs when the text sequences to be matched do not use the same vocabulary, even if their subjects are related. For example, the query may contain several words that are not necessarily used in the documents of the collection, including relevant documents. BoW representations ignore several aspects about a text sequence, such as the structure the context of words. These characteristics are important and make it possible to differentiate between two texts that use the same words but expressing different information. Another problem in text matching is related to the length of documents. The relevant parts can be distributed in different ways in the documents of a collection. This is especially true in large documents that tend to cover a large number of topics and include variable vocabulary. A long document could thus contain several relevant passages that a matching model must capture. Unlike long documents, short documents are likely to be relevant to a specific subject and tend to contain a more restricted vocabulary. Assessing their relevance is in principle simpler than assessing the one of longer documents. In this thesis, we have proposed different contributions, each addressing one of the above-mentioned issues. First, in order to solve the problem of vocabulary mismatch, we used distributed representations of words (word embedding) to allow a semantic matching between the different words. These representations have been used in IR applications where document/query similarity is computed by comparing all the term vectors of the query with all the term vectors of the document, regardless. Unlike the models proposed in the state-of-the-art, we studied the impact of query terms regarding their presence/absence in a document. We have adopted different document/query matching strategies. The intuition is that the absence of the query terms in the relevant documents is in itself a useful aspect to be taken into account in the matching process. Indeed, these terms do not appear in documents of the collection for two possible reasons: either their synonyms have been used or they are not part of the context of the considered documents. The methods we have proposed make it possible, on the one hand, to perform an inaccurate matching between the document and the query, and on the other hand, to evaluate the impact of the different terms of a query in the matching process. Although the use of word embedding allows semantic-based matching between different text sequences, these representations combined with classical matching models still consider the text as a list of independent elements (bag of vectors instead of bag of words). However, the structure of the text as well as the order of the words is important. Any change in the structure of the text and/or the order of words alters the information expressed. In order to solve this problem, neural models were used in text matching
Boggs, Teresa. "Sharing Sensitive Information with Parents: A Guide for Discussing Speech and Language Concerns." Digital Commons @ East Tennessee State University, 2009. https://dc.etsu.edu/etsu-works/1512.
Full textEgbert, Matthew. "Adaptation from interactions between metabolism and behaviour : self-sensitive behaviour in protocells." Thesis, University of Sussex, 2012. http://sro.sussex.ac.uk/id/eprint/39564/.
Full textStrötgen, Jannik [Verfasser], and Michael [Akademischer Betreuer] Gertz. "Domain-sensitive Temporal Tagging for Event-centric Information Retrieval / Jannik Strötgen ; Betreuer: Michael Gertz." Heidelberg : Universitätsbibliothek Heidelberg, 2015. http://d-nb.info/1180395689/34.
Full textBoggs, Teresa. "Sharing Sensitive Information with Parents: A Guide for Discussing Speech, Language, and Developmental Concerns." Digital Commons @ East Tennessee State University, 2000. https://dc.etsu.edu/etsu-works/1517.
Full textNilsson, Håkan. "Reliable Communication of Time- and Security-Sensitive Information over a Single Combat Vehicle Network." Thesis, Linköpings universitet, Kommunikationssystem, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-162444.
Full textWeatherford, Mark T. "Interpretive analysis of the Joint Maritime Command Information System (JMCIS) Sensitive Compartmented Information (SCI) Local Area Network (LAN) security requirements." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1994. http://handle.dtic.mil/100.2/ADA285529.
Full textThesis advisor(s): Carl F. Jones, Cynthia E. Irvine. "September 1994." Bibliography: p. 108-112. Also available online.
Subbiah, Arun. "Efficient Proactive Security for Sensitive Data Storage." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19719.
Full textSousa, Rita Cristina Pinto de. "Parameter estimation in the presence of auxiliary information." Doctoral thesis, Faculdade de Ciências e Tecnologia, 2013. http://hdl.handle.net/10362/11295.
Full textIn survey research, there are many situations when the primary variable of interest is sensitive. The sensitivity of some queries can give rise to a refusal to answer or to false answers given intentionally. Survey can be conducted in a variety of settings, in part dictated by the mode of data collection, and these settings can differ in how much privacy they offer the respondent. The estimates obtained from a direct survey on sensitive questions would be subject to high bias. A variety of techniques have been used to improve reporting by increasing the privacy of the respondents. The Randomized Response Technique (RRT), introduced byWarner in 1965, develops a random relation between the individual’s response and the question. This technique provides confidentiality to respondents and still allows the interviewers to estimate the characteristic of interest at an aggregate level. In this thesis we propose some estimators to improve the mean estimation of a sensitive variable based on a RRT by making use of available non-sensitive auxiliary information. In the first part of this thesis we present the ratio and the regression estimators as well as some generalizations in order to study the gain in the estimation over the ordinary RRT mean estimator. In chapters 4 and 5 we study the performance of some exponential type estimators, also based on a RRT. The final part of the thesis illustrates an approach to mean estimation in stratified sampling. This study confirms some previous results for a different sample design. An extensive simulation study and an application to a real dataset are done for all the study estimators to evaluate their performance. In the last chapter we present a general discussion referring to the main results and conclusions as well as showing an application to a real dataset which compares the performance of study estimators.
Mathew, John. "Disclosure apprehension the influence of media and survey technique on the disclosure of sensitive information /." Online access for everyone, 2008. http://www.dissertations.wsu.edu/Dissertations/Summer2008/j_mathew_043008.pdf.
Full textAvranas, Apostolos. "Resource allocation for latency sensitive wireless systems." Electronic Thesis or Diss., Institut polytechnique de Paris, 2020. http://www.theses.fr/2020IPPAT021.
Full textThe new generation of wireless systems 5G aims not only to convincingly exceed its predecessor (LTE) data rate but to work with more dimensions. For instance, more user classes were introduced associated with different available operating points on the trade-off of data rate, latency, reliability. New applications, including augmented reality, autonomous driving, industry automation and tele-surgery, push the need for reliable communications to be carried out under extremely stringent latency constraints. How to manage the physical level in order to successfully meet those service guarantees without wasting valuable and expensive resources is a hard question. Moreover, as the permissible communication latencies shrink, allowing retransmission protocol within this limited time interval is questionable. In this thesis, we first pursue to answer those two questions. Concentrating on the physical layer and specifically on a point to point communication system, we aim to answer if there is any resource allocation of power and blocklength that will render an Hybrid Automatic ReQuest (HARQ) protocol with any number of retransmissions beneficial. Unfortunately, the short latency requirements force only a limited number of symbols to possibly be transmitted which in its turn yields the use of the traditional Shannon theory inaccurate. Hence, the more involved expression using finite blocklength theory must be employed rendering the problem substantially more complicate. We manage to solve the problem firstly for the additive white gaussian noise (AWGN) case after appropriate mathematical manipulations and the introduction of an algorithm based on dynamic programming. Later we move on the more general case where the signal is distorted by a Ricean channel fading. We investigate how the scheduling decisions are affected given the two opposite cases of Channel State Information (CSI), one where only the statistical properties of the channel is known, i.e. statistical CSI, and one where the exact value of the channel is provided to the transmitter, i.e., full CSI.Finally we ask the same question one layer above, i.e. the Medium Access Contron (MAC). The resource allocation must be performed now accross multiple users. The setup for each user remains the same, meaning that a specific amount of information must be delivered successfully under strict latency constraints within which retransmissions are allowed. As 5G categorize users to different classes users according to their needs, we model the traffic under the same concept so each user belongs to a different class defining its latency and data needs. We develop a deep reinforcement learning algorithm that manages to train a neural network model that competes conventional approaches using optimization or combinatorial algorithms. In our simulations, the neural network model actually manages to outperform them in both statistical and full CSI case
Wimmer, Raphael [Verfasser], and Heinrich [Akademischer Betreuer] Hußmann. "Grasp-sensitive surfaces : utilizing grasp information for human-computer interaction / Raphael Wimmer. Betreuer: Heinrich Hußmann." München : Universitätsbibliothek der Ludwig-Maximilians-Universität, 2015. http://d-nb.info/1070762814/34.
Full textBarboa, Elvia. "The use of a culturally sensitive video in presenting AIDS information to a Hispanic population." Scholarly Commons, 1998. https://scholarlycommons.pacific.edu/uop_etds/2719.
Full textHarding, Genevieve E. "Developing methods to access sensitive industrial wastewater information in South Africa (with treatment in mind)." Master's thesis, University of Cape Town, 2018. http://hdl.handle.net/11427/29446.
Full textThompson, Dale. "Sensitive information an inquiry into the interpretation of information in the workplace from an individual's perspective using qualitative methods / by Dale Thompson." Related electronic resource: Current Research at SU : database of SU dissertations, recent titles available full text, 2008. http://wwwlib.umi.com/cr/syr/main.
Full textSledz, Larysa. "A GIS model for environmentally sensitive areas in Delaware County, Indiana." Virtual Press, 2004. http://liblink.bsu.edu/uhtbin/catkey/1294899.
Full textDepartment of Natural Resources and Environmental Management
Francis, Anthony G. Jr. "Context-sensitive asynchronous memory : a general experience-based method for managing information access in cognitive agents." Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/9177.
Full textYoong, Ho Liang. "IP services design and implementation in a prototype device for transient tactical access to sensitive information." Thesis, Monterey, California. Naval Postgraduate School, 2010. http://hdl.handle.net/10945/4982.
Full textIn network-centric warfare, access to critical information can result in a strategic advantage. During critical situations, a soldier using tactical devices may need transient access to information beyond their normal clearances. The Least Privilege Separation Kernel (LPSK) being developed at the Naval Postgraduate School, can be the basis of an extended multilevel security (MLS) system that can support and control such access. A Trusted Services Layer (TSL), which depends on the LPSK, provides support for various multilevel security services. Currently, the LPSK lacks a software network stack for networking communications. Without networking functionality, tactical devices cannot share vital situational updates and information superiority is unattainable. An Internet Protocol (IP) stack was proposed for the LPSK-based system. The IP stack is to be implemented in the context of the LPSK architecture, which uses modularity and layering to organize its software. Open source implementations of the IP stack were evaluated to leverage the common functionality required by all IP stacks. Lightweight Internet Protocol (LWIP) was selected as a starting point for use with the LPSK. LWIP required modifications for use with the LPSK. The IP stack and a proof of concept networking demonstration were successfully implemented in this project.
Vega, Laurian. "Security in Practice: Examining the Collaborative Management of Sensitive Information in Childcare Centers and Physicians' Offices." Diss., Virginia Tech, 2011. http://hdl.handle.net/10919/37552.
Full textPh. D.
Murandu, Ngoni. "The extent to which sensitive information is secured by institutions that donate computers to educational settings." Morgantown, W. Va. : [West Virginia University Libraries], 2003. http://etd.wvu.edu/templates/showETD.cfm?recnum=3295.
Full textTitle from document title page. Document formatted into pages; contains ix, 67 p. Vita. Includes abstract. Includes bibliographical references (p. 53-57).
Ehlin, Max. "An overview of Product Service System through Integrated Vehicle Health Management in an information sensitive industry." Thesis, Luleå tekniska universitet, Institutionen för ekonomi, teknik och samhälle, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-75861.
Full textOrding, Marcus. "Context-Sensitive Code Completion : Improving Predictions with Genetic Algorithms." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-205334.
Full textInom området kontextkänslig kodkomplettering finns det ett behov av precisa förutsägande modeller för att kunna föreslå användbara kodkompletteringar. Den traditionella metoden för att optimera prestanda hos kodkompletteringssystem är att empiriskt utvärdera effekten av varje systemparameter individuellt och finjustera parametrarna. Det här arbetet presenterar en genetisk algoritm som kan optimera systemparametrarna med en frihetsgrad som är lika stor som antalet parametrar att optimera. Studien utvärderar effekten av de optimerade parametrarna på det studerade kodkompletteringssystemets pre- diktiva kvalitet. Tidigare utvärdering av referenssystemet utökades genom att även inkludera modellstorlek och slutledningstid. Resultaten av studien visar att den genetiska algoritmen kan förbättra den prediktiva kvali- teten för det studerade kodkompletteringssystemet. Jämfört med referenssystemet så lyckas det förbättrade systemet korrekt känna igen 1 av 10 ytterligare kodmönster som tidigare varit osedda. Förbättringen av prediktiv kvalietet har inte en signifikant inverkan på systemet, då slutledningstiden förblir mindre än 1 ms för båda systemen.
Hayden, Angela. "THE DEVELOPMENT OF EXPERT FACE PROCESSING: ARE INFANTS SENSITIVE TO NORMAL DIFFERENCES IN SECOND-ORDER RELATIONAL INFORMATION?" Lexington, Ky. : [University of Kentucky Libraries], 2006. http://lib.uky.edu/ETD/ukypeps2006t00518/Masters.pdf.
Full textTitle from document title page (viewed on January 29, 2007). Document formatted into pages; contains: viii, 50 p. : ill. (some col.). Includes abstract and vita. Includes bibliographical references (p. 44-48).
Gjære, Erlend Andreas. "Sensitive Information on Display : Using flexible de-identification for protecting patient privacy in (semi-) public hospital environments." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for datateknikk og informasjonsvitenskap, 2011. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-14089.
Full textEngin, Melih. "Text Classificaton In Turkish Marketing Domain And Context-sensitive Ad Distribution." Master's thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/12610457/index.pdf.
Full textThinyane, Mamello P. "A knowledge-oriented, context-sensitive architectural framework for service deployment in marginalized rural communities." Thesis, Rhodes University, 2009. http://hdl.handle.net/10962/d1004843.
Full textLang, Martin. "Secure Automotive Ethernet : Balancing Security and Safety in Time Sensitive Systems." Thesis, Blekinge Tekniska Högskola, Institutionen för datavetenskap, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-18235.
Full textBakgrund.Som en påföljd av den digitala eran, så har fordon blivit digitalis-erade i ett hastigt tempo. Självkörande bilar och kraftfulla infotainmentsys-tem är bara några få av förändringarna som sker med bilarna. Dessa systemkräver att mer information skickas genom fordonets nätverk. För att nå dessahastigheter föreslogs Ethernet. Dock så är Ethernet ett så kallat ’best-effort’protokoll, vilket inte kan garantera tillförlitlig leverans av meddelanden. För attlösa detta har speciella tillämpningar skett, vilket skapar Automotive Ethernet.Det finns fortfarande sårbarheterna av Ethernet kvar, och behöver hanteras föratt tillämpningen skall vara lämplig för fordonsindustrin. Syfte.Denna studie undersöker vilka sårbarheter som finns i Ethernet ’out-of-the-box’ och identifierar vilka sårbarheter som har värst konsekvenser urperspektivet säkerhet för människor och egendom. Två säkerhetsimplementa-tioner väljs ut för att se över vidare de kan användas för kommunikation i bilar. Metod.För att nå arbetets mål, så genomfördes en literaturstudie för attundersöka sårbarheter och potentiella motverkningar. Studiens resulat använ-des sedan i en simulering för att kunna mäta fördröjningen av en enkel topologii en OMNeT++miljö. Sedan addera den tiden med exekveringstiden för säker-hetsimplementationerna för att få en total fördröjning. Kommunikationstidenmåste vara mindre än 10 ms för att räknas som säker för bilar. Resultat.I simuleringen, så ger mätningarna en basal kommunikation på1.14957±0.02053 ms. När säkerhetsimplementationerna tillsätts så får manden totala kommunikationstiden. För HMAC-SHA-512 mäts den totala kom-munikationstiden till 1.192274 ms genom att använda den övre gränsen av kon-fidensintervallet. För ECDSA - ED25519 mäts tiden till 3.108424 ms. Slutsatser.Enligt resultaten så är både HMAC-SHA-512 och ECDSA - ED25519möjliga alternativ för integritets- och äkthetstillämpningar i fordorns kommu-nikation. Dessa resultaten är dock framtagna ur en simulering och bör verifierasmed hjälp av fysisk hårdvara så mätningarna är sanningsenliga.
Brox, Elin Anette. "Information Security in Distribued Health Information Systems in Scandinavia : A Comparative Study of External Conditions and Solutions for Exchange and Sharing of Sensitive Health Information in Denmark, Norway and Sweden." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2006. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9469.
Full textExchange and sharing of sensitive health information have to happen according to prevailing external conditions established by laws, regulations and liable authorities. These external conditions create various limitations, making requests for adaptative health information systems. Especially, when developing new solutions, defining the balance between protection of personal privacy and availability of information, is a great challenge. Several projects are working on possible solutions to the problem of sharing health information in a distributed way. Based on two different pilot projects in each of the countries Denmark, Norway and Sweden, and seen from an information security perspective, this thesis does a comparison of external conditions and various approaches to these conditions. Main focus is on the Scandinavian health legislation, but organisation of health services will also be considered briefly. The objective is to acquire new knowledge about and to contribute to the debate concerning exchange and sharing of health information. The results of this project are founded on an inductive multiple case study, and empirical data have been collected through semi-structured interviews. Through this thesis, it has become evident that health care in the Scandinavian countries is upon the whole equally organised and struggles with many of the same technological challenges. All three countries' health legislation promotes personal integrity, with Sweden as the most expressive. Nevertheless, there is a tendency towards enhancement of the patient's autonomy and a request for more united health care processes, leading to needs for new types of technological tools to ensure information security. In order to meet these requests, common national technological standards, concepts and infrastructure have become more important. In addition, the systems made have to be in accordance with Acts and regulations. Parts of the prevailing legislation are to a hindrance for exchange and sharing of information across organisational borders. The technological solutions chosen within the scope of the limiting external conditions are generally well-defined, high quality systems which have information security in focus. Still, there has become evident that some weak points exist, and there is room for improvements. In order to make health care of higher quality and ensure information security to an even larger degree, legal amendments and a more extensive national co-operation will arrange for the possibility of developing better information security solutions.
Ljungberg, Lucas. "Using unsupervised classification with multiple LDA derived models for text generation based on noisy and sensitive data." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-255010.
Full textAtt skapa modeller som genererar kontextuella svar på frågor är ett svårt problem från början, någonting som blir än mer svårt när tillgänglig data innehåller både brus och känslig information. Det är både viktigt och av stort intresse att hitta modeller och metoder som kan hantera dessa svårigheter så att även problematisk data kan användas produktivt.Detta examensarbete föreslår en modell baserat på ett par samarbetande Topic Models (ämnesbaserade modeller) med skiljande ansvarsområden (LDA och GSDMM) för att underlätta de problematiska egenskaperna av datan. Modellen testas på ett verkligt dataset med dessa svårigheter samt ett dataset utan dessa. Målet är att 1) inspektera båda ämnesmodellernas beteende för att se om dessa kan representera datan på ett sådant sätt att andra modeller kan använda dessa som indata eller utdata och 2) förstå vilka av dessa svårigheter som kan hanteras som följd.Resultaten visar att ämnesmodellerna kan representera semantiken och betydelsen av dokument bra nog för att producera välartad indata för andra modeller. Denna representation kan även hantera stora ordlistor och brus i texten. Resultaten visar även att ämnesgrupperingen av responsdatan är godartad nog att användas som mål för klassificeringsmodeller sådant att korrekta meningar kan genereras som respons.
Skoglund, Caroline. "Risk-aware Autonomous Driving Using POMDPs and Responsibility-Sensitive Safety." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-300909.
Full textAutonoma fordon förutspås spela en stor roll i framtiden med målen att förbättra effektivitet och säkerhet för vägtransporter. Men även om vi sett flera exempel av autonoma fordon ute på vägarna de senaste åren är frågan om hur säkerhet ska kunna garanteras ett utmanande problem. Det här examensarbetet har studerat denna fråga genom att utveckla ett ramverk för riskmedvetet beslutsfattande. Det autonoma fordonets dynamik och den oförutsägbara omgivningen modelleras med en partiellt observerbar Markov-beslutsprocess (POMDP från engelskans “Partially Observable Markov Decision Process”). Ett riskmått föreslås baserat på ett säkerhetsavstånd förkortat RSS (från engelskans “Responsibility-Sensitive Safety”) som kvantifierar det minsta avståndet till andra fordon för garanterad säkerhet. Riskmåttet integreras i POMDP-modellens belöningsfunktion för att åstadkomma riskmedvetna beteenden. Den föreslagna riskmedvetna POMDP-modellen utvärderas i två fallstudier. I ett scenario där det egna fordonet följer ett annat fordon på en enfilig väg visar vi att det egna fordonet kan undvika en kollision då det framförvarande fordonet bromsar till stillastående. I ett scenario där det egna fordonet ansluter till en huvudled från en ramp visar vi att detta görs med ett tillfredställande avstånd till andra fordon. Slutsatsen är att den riskmedvetna POMDP-modellen lyckas realisera en avvägning mellan säkerhet och användbarhet genom att hålla ett rimligt säkerhetsavstånd och anpassa sig till andra fordons beteenden.
Nightingale, Sarah. "Culturally sensitive and community-based HIV/AIDS prevention messages for African American women." Thesis, Manhattan, Kan. : Kansas State University, 2008. http://hdl.handle.net/2097/813.
Full textSadler, Pauline Barbara. "Balancing the public interest: The D-Notice system and the suppression of sensitive government information relating to national security." Thesis, Sadler, Pauline Barbara (1999) Balancing the public interest: The D-Notice system and the suppression of sensitive government information relating to national security. PhD thesis, Murdoch University, 1999. https://researchrepository.murdoch.edu.au/id/eprint/51263/.
Full textKini, Ananth Ullal. "On the effect of INQUERY term-weighting scheme on query-sensitive similarity measures." Texas A&M University, 2005. http://hdl.handle.net/1969.1/3116.
Full textLindberg, Susanne. "Involving Children in the Design of Online Peer Support for Children with Cancer." Thesis, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4528.
Full textRenshaw, K. J. "Semi-natural vegetation characteristics and the prediction of hydrological and hydrochemical information within moorland, acid-sensitive catchments in upland Wales." Thesis, Swansea University, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.638645.
Full textBELIAN, Rosalie Barreto. "A context-based name resolution approach for semantic schema integration." Universidade Federal de Pernambuco, 2008. https://repositorio.ufpe.br/handle/123456789/1512.
Full textUma das propostas da Web Semântica é fornecer uma grande diversidade de serviços de diferentes domínios na Web. Estes serviços são, em sua maioria, colaborativos, cujas tarefas se baseiam em processos de tomada de decisão. Estas decisões, por sua vez, serão mais bem embasadas se considerarem a maior quantidade possível de informação relacionada às tarefas em execução. Neste sentido, este cenário encoraja o desenvolvimento de técnicas e ferramentas orientadas para a integração de informação, procurando soluções para a heterogeneidade das fontes de dados. A arquitetura baseada em mediação, utilizada no desenvolvimento de sistemas de integração de informações tem como objetivo isolar o usuário das fontes de dados distribuídas utilizando uma camada intermediária de software chamada de mediador. O mediador, em um sistema de integração de informações, utiliza um esquema global para a execução das consultas do usuário que são reformuladas em sub-consultas de acordo com os esquemas locais das fontes de dados. Neste caso, um processo de integração de esquemas gera o esquema global (esquema de mediação) como resultado da integração dos esquemas individuais das fontes de dados. O problema maior em integração de esquemas é a heterogeneidade das fontes de dados locais. Neste sentido, a resolução semântica é primordial. A utilização de métodos puramente estruturais e sintáticos na integração de esquemas é pouco eficaz se antes não houver a identificação do real significado dos elementos dos esquemas. Um processo de integração de esquemas tem como resultado um esquema global integrado e um conjunto de mapeamentos inter-esquema e usualmente, compreende algumas etapas básicas como: pré-integração, comparação, mapeamento e unificação de esquemas e geração do esquema de mediação. Em integração de esquemas, resolução de nomes é o processo que determina a qual entidade do mundo real um dado elemento de esquema se refere, levando em consideração um conjunto de informações semânticas disponíveis. A informação semântica necessária para resolução de nomes, em geral, é obtida de vocabulários genéricos e/ou específicos de um determinado domínio de conhecimento. Nomes de elementos podem apresentar significados diferentes dependendo do contexto semântico ao qual eles estão relacionados. Assim, o uso de informação contextual, além da de domínio, pode trazer uma maior precisão na interpretação dos elementos permitindo modificar o seu significado de acordo com um dado contexto. Este trabalho propõe uma abordagem de resolução de nomes baseada em contexto para integração de esquemas. Um de seus pontos fortes é a utilização e modelagem da informação contextual necessária à resolução de nomes em diferentes etapas do processo de integração de esquemas. A informação contextual está modelada utilizando uma ontologia, o que favorece a utilização de mecanismos de inferência, compartilhamento e reuso da informação. Além disto, este trabalho propõe um processo de integração de esquemas simples e extensível de forma que seu desenvolvimento se concentrasse principalmente nos requisitos relacionados à resolução de nomes. Este processo foi desenvolvido para um sistema de integração de informações baseado em mediação, que adota a abordagem GAV e XML como modelo comum para intercâmbio de dados e integração de fontes de dados na Web