56271 research outputs found
Sort by
Identity and intertextuality in Kate Atkinson's emotionally weird
Get PDFMany women writers employ intertextuality to question gender identity and to produce female characters who are free of the narratives that have proven to be violent, oppressive and not viable for the contemporary female experience. In this article, I propose a reading of Kate Atkinson's 2000 novel, Emotionally Weird in the light of Bakhtin's argument on intertextuality in novelistic discourse to understand how the novel rewrites the gendered individual. Emotionally Weird combines the quest for a new female character and the investigation of postmodern novel's relation to previous novelistic discourses. Kate Atkinson stages a quest of identity, crystallized in Euphemia Stuart Murray's search for her true parentage, which merges with the quest of the paternity of the novel searched through the rewritings of literary traditions. The new woman that emerges when these quests are resolved is an illegitimate woman writer; a bastard born out of wedlock who disrupts the law of inheritance while the postmodern novel is similarly shown as an illegitimate novelistic discourse born out of its dialogism with previous novelistic discourses and other literary forms
Being oneself through time:bases of selfcontinuity across 55 cultures
No full textSelf-continuity – the sense that one’s past, present, and future are meaningfully connected – is considered a defining feature of personal identity. However, bases of self-continuity may depend on cultural beliefs about personhood. In multilevel analyses of data from 7287 adults from 55 cultural groups in 33 nations, we tested a new tripartite theoretical model of bases of self-continuity. As expected, perceptions of stability, sense of narrative, and associative links to one’s past each contributed to predicting the extent to which people derived a sense of self-continuity from different aspects of their identities. Ways of constructing self-continuity were moderated by cultural and individual differences in mutable (vs. immutable) personhood beliefs – the belief that human attributes are malleable. Individuals with lower mutability beliefs based self-continuity more on stability; members of cultures where mutability beliefs were higher based self-continuity more on narrative. Bases of self-continuity were also moderated by cultural variation in contextualized (vs. decontextualized) personhood beliefs, indicating a link to cultural individualism-collectivism. Our results illustrate the cultural flexibility of the motive for self-continuity
A systematic approach to designing a wide-current range, MOS capacitor-based switched-capacitor DC-DC converter with an augmenting LDO
No full textSwitched‐capacitor DC‐DC converters (SC DC‐DC) are analyzed for loss sources,
voltage regulation integrity, start‐up latency, and ripple size, while the trade‐offs
between these metrics are derived. These analyses are used to design a SC DC‐
DC that achieves high efficiency in a wide load current range. Four‐way interleaving
was employed to reduce the output ripple and efficiency loss due to this
ripple. The design can be reconfigured to achieve gains of 1/3 and 2/5 for inputs
ranging between 1.4 and 3.6 V to generate output voltage range of 0.4 to 1.27 V
and can supply peak load current of 22 mA. It uses thin‐oxide MOS capacitors
for their high density and achieves 75.4% peak efficiency with an input frequency
of 100 MHz and a load capacitor of 10 nF. An augmenting LDO that only
regulates during sudden load transients helps the converter respond fast to these
transients. The chip was implemented using a 65‐nm standard CMOS process
Deep learning in cyber security for internet of things
No full textTezin basılısı İstanbul Şehir Üniversitesi Kütphanesi'ndedir.Cyber threats are a showstopper for Internet of Things (IoT) which has recently gained popularity. Network layer attacks on IoT can cause significant disruptions and loss of information. Among such attacks, routing attacks are especially hard to defend against because of the ad-hoc nature of IoT systems and resource constraints of IoT devices. Hence a an efficient approach for detecting and predicting IoT attacks is needed. For the security of IoT, detecting malicious attacks is vital to avoid of unintended consequences such as lack of availability, integrity and confidentiality. For secure IoT needs a system that is able to robust detection against routing attacks. We propose a deep-learning basedforcontinuoussecuritymonitoringanalysisforIoT.Applicationofdeeplearningfor cyber-security in IoT requires the availability of substantial IoT attack data, however the lack of IoT attack data is an important issue. In our study, the Cooja IoT simulator has beenutilizedforgenerationofhigh-fidelityattackdata, withinIoTnetworksrangingfrom up to 1000 nodes. We propose a highly scalable, deep-learning based attack detection methodology for detection of IoT routing attacks with high accuracy and precision.Abstract iv
Öz v
Acknowledgments vii
List of Figures x
List of Tables xii
Abbreviations xiii
1 Introduction 1
1.1 Context . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Security Problems of Internet of Things . . . . . . . . . . . . . . . . . . . 2
1.3 Proposed Methodology in the Thesis . . . . . . . . . . . . . . . . . . . . . 3
1.4 Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
1.5 Outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
2 Background 8 2.1 Internet of Things (IoT) . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
2.1.1 Cyber-Physical Systems (CPS) . . . . . . . . . . . . . . . . . . . . 8
2.1.2 IoT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
2.1.3 Challenges of IoT . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
2.1.4 Threats and Risks of IoT . . . . . . . . . . . . . . . . . . . . . . . 11
2.1.5 Simulation of Routing Attacks . . . . . . . . . . . . . . . . . . . . 12
2.1.5.1 Routing Attacks to IoT . . . . . . . . . . . . . . . . . . . 14
2.2 Deep Learning for Cyber Security . . . . . . . . . . . . . . . . . . . . . . . 19
2.2.1 Machine Learning . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
2.2.2 Deep Learning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
3 Related Work 27
3.1 Deep Learning based Cyber Security Methods . . . . . . . . . . . . . . . . 34
4 IoT Routing Attack Dataset(IRAD) 36
4.1 Feature Extraction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
4.2 Feature Normalization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42
4.3 Feature Importance and Selection . . . . . . . . . . . . . . . . . . . . . . . 43
4.4 Overview of Datasets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46
5 Deep Learning Based Detection of Routing Attacks 48
5.1 Routing Attack Detection . . . . . . . . . . . . . . . . . . . . . . . . . . . 48
5.2 Deep Learning Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49
6 Evaluation and Conclusion 53
6.1 Performance Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53
6.2 Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54
6.2.1 Decreased Rank Attack . . . . . . . . . . . . . . . . . . . . . . . . 55
6.2.2 Hello Flood Attack . . . . . . . . . . . . . . . . . . . . . . . . . . . 56
6.2.3 Version Number Attack . . . . . . . . . . . . . . . . . . . . . . . . 58
6.3 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60
6.4 Future Works . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60
Appendix 61
Bibliography 7
A novel biasing technique for low phase noise voltage controlled oscillators
No full textThis paper proposes a new biasing technique for LC-based voltage controlled oscillators to improve the phase noise performance while ensuring the current variations to be within an acceptable range. The proposed technique uses a feedback loop and a LDO to generate, sense, and regulate the output current. The oscillator has 33.3%tuningrangearoundacenterfrequencyof2.4GHz.Theproposeddesignachieves −127.2dBc/Hzphase noise at 1 MHz offset from 2.25 GHz while consuming 3.36 mA from a 3.3-V supply. The circuit was implementedin65nmUMCCMOSprocess.TheresultsshowthatthecircuithasFoMof−183.8dBc/HzandFoMT of −194.5dBc/Hzat1MHzoffset,andthecurrentvariationacrossPVTiswithin +68μAto−63μArange
A frequency multiplier for reference frequency in frequency synthesizer systems
No full textA low jitter frequency multiplier, which requires less power, area, and design complexity than reference multiplying PLL or DLL circuits can be used to generate the reference frequency for a low phase noise frequency synthesizer. This paper proposes a mixed signal solution based on the fact that the average DC value of a signal is proportional to its duty cycle. The solution uses a feedback loop with coarse and fine delay resolution to generate a 90 phase shifted clock that is used to produce a doubled frequency signal with 50% duty cycle. This method can be used to multiply the input frequency of 40 MHz by multiples of 2, up to 16. The design is implemented in 65 nm UMC CMOS process. Operating from 1.2-V supply, it dissipates 0.46 to 1.2 mA at output frequencies 80–640 MHz, achieving - 162.3 and - 139 dBc/Hz phase noise at 1 MHz offset, respectively
Synthesis of CIS (CuInSe2) based materials for solar applications
Get PDFNanopowders of copper indium diselenide were produced with five different organic solvents: ethylenediamine, triethanolamine, oleylamine, oleic acid, and polyetheramine. We successfully synthesized pure CIS nanopowders at a temperature of 240 degrees C at three different durations of 10 h, 20 h, and 40 h with a one-step process. This shorter time method offers important cost advantages in manufacturing. Polyetheramine and oleic acid were used for the first time in literature for CIS synthesis in an autoclave
Yeni medyada çeviri aracılığıyla popülerleştirme: düşünbil örneği
No full textThis study aims to explore the opportunities the new media present for the popularization of scien-
tific knowledge through translation, based on the case study of a Turkish website called Düşünbil
(www.dusunbil.com). The article will touch upon debates on science popularization, new media, and
the translation of social sciences texts, highlighting the role of online translation projects in circulat-
ing new and hybrid genres. The contribution combines two under-researched topics in translation
studies: popularization, and the translation of social sciences and humanities texts. On the other
hand, TS research on popularization has so far mainly focused on natural sciences whereas this study
concerns social sciences and humanities texts.
Düşünbil Portal relies on non-professional volunteer translators for the translation of popular texts.
In this respect, the translational action undertaken may be considered a case of “community transla-
tion.” These texts, translated almost exclusively from English, represent a mix of social sciences and
journalism, some leaning towards self-help in terms of content and style.
It is the convergent aspect of digital media that make them particularly amenable for popularization:
the functions of information and entertainment converge on the internet. The translation of social
sciences and humanities texts, hitherto largely confined to conventional print media, helps extend
knowledge in these fields thanks to projects like Düşünbil.
After a conceptual discussion, the paper will elaborate on strategies of knowledge mediation through
examples drawn from translated texts, their source texts as well as texts written originally in Turkish and
published on Düşünbil. Proximity, regarded to be the distinctive feature of popular science texts, will be
addressed not only as a textual-linguistic feature but also in terms of the wider strategies of presenting
information. Aspects such as interactivity and conceptual clarification will also be illustrated, followed by
an examination of translation strategies employed on texts originally written in Turkish
Efficiency optimizations on Yao’s garbled circuits and their practical applications
No full textTezin basılısı İstanbul Şehir Üniversitesi Kütüphanesi'ndedir.The advance of cloud computing and big data technologies brings out major changes in the ways that people make use of information systems. While those technologies extremely ease our lives, they impose the danger of compromising privacy and security of data due to performing the computation on an untrusted remote server. Moreover, there are also many other real-world scenarios requiring two or more (possibly distrustful) parties to securely compute a function without leaking their respective inputs to each other. In this respect, various secure computation mechanisms have been proposed in order to protect users’ data privacy. Yao’s garbled circuit protocol is one of the most powerful solutions for this problem. In this thesis, we first describe the Yao’s protocol in detail, and include the complete list of optimizations over the Yao’s protocol. We also compare their advantages in terms of communication and computation complexities, and analyse their compatibility with each other. We also look into generic Yao implementations (including garbled RAM) to demonstrate the use of this powerful tool in practice. We compare those generic implementations in terms of their use of garbled circuit optimizations. We also cover the specific real-world applications for further illustration. Moreover, in some scenarios, the functionality itself may also need to be kept private which leads to an ideal solution of secure computation problem. In this direction, we finally cover the problem of Private Function Evaluation, in particular for the 2-party case where garbled circuits have an important role. We finally analyse the generic mechanism of Mohassel et al. and contribute to it by proposing a new technique for the computation of the number of possible circuit mappings.Declaration of Authorship ii
Abstract iv
Öz v
Acknowledgments vii
List of Figures x
List of Tables xi
Abbreviations xii
1 Introduction 1
1.1 Overview of the Thesis ............................. 3
2 Preliminaries 5
2.1 Requirements of Secure Multi-Party Computation .............. 5
2.2 Adversary Models ................................ 6
2.2.1 Semi-Honest Adversaries ........................ 6
2.2.2 Covert Adversaries ........................... 6
2.2.3 Malicious Adversaries ......................... 7
2.3 Corruption Models ............................... 7
2.4 Circuit Concepts ................................ 8
2.4.1 Boolean circuits ............................. 8
2.4.2 Arithmetic circuits ........................... 11
2.5 Cryptographic Basis .............................. 12
2.5.1 Symmetric Encryption ......................... 12
2.5.2 Public Key Encryption ......................... 12
2.5.3 Cryptographic Hash Function ..................... 13
2.5.4 Pseudo-Random Function ....................... 13
2.5.5 Message Authentication Code (MAC) ................. 13
2.5.6 Dual-Key Cipher ............................ 13
2.6 Secret Sharing .................................. 15
2.6.1 XOR Sharing ............................... 15
2.6.2 Arithmetic Sharing ........................... 15
2.6.3 Yao Sharing ............................... 15
2.6.4 Shamir’s Secret Sharing ........................ 16
2.7 Oblivious Transfer ............................... 16
2.8 Homomorphic Encryption ........................... 17
2.9 Goldreich-Micali-Wigderson (GMW) Protocol for MPC ........... 17
3 Yao’s Garbled Circuit Protocol 18
3.1 Formal Definiton of Yao’s Protocol ...................... 19
3.2 Security Properties of Yao’s Protocol ..................... 22
3.2.1 Privacy ................................. 22
3.2.2 Obliviousness .............................. 23
3.2.3 Authenticity .............................. 23
4 Garbled Circuit Optimizations 24
4.1 General Focus .................................. 24
4.1.1 The Size Parameter .......................... 24
4.1.2 The Computation Time Parameter .................. 25
4.1.3 Security Parameter ........................... 25
4.2 Point and Permute ............................... 26
4.3 Garbled Row Reduction 3 Ciphertexts .................... 27
4.4 Free XOR ..................................... 28
4.5 Garbled Row Reduction 2 Ciphertexts .................... 30
4.6 FleXOR ...................................... 33
4.7 Half Gates .................................... 34
4.8 Our Compatibility Analysis of Garbled Circuit Optimizations ....... 41
5 Practical Implementations of Yao’s Protocol 42
5.1 Generic Usage of Yao’s Protocol in Practice ................. 42
5.1.1 Pipelined Implementation (FastGC) .................. 42
5.1.2 Garbled RAM .............................. 43
5.1.3 JustGarble ............................... 46
5.1.4 ABY .................................... 47
5.1.5 Obliv-C ................................. 47
5.1.6 ObliVM .................................. 48
5.1.7 Frigate ................................. 48
5.1.8 Comparison Based on Garbling Optimizations Used ........ 48
5.2 Real-World Applications ............................ 49
5.2.1 Secure Computation of Satellite Collusion Probabilities....... 49
5.2.2 Privacy-Preserving Data Mining ................... 52
6 Private Function Evaluation 56
6.1 Mohassel and Sadeghian’s Generic PFE Scheme [1] ............. 57
6.2 CTH Functionality Realization ......................... 59
6.3 Two-Party PFE of Yao’s Protocol ....................... 64
7 Conclusion and Discussions 67
Bibliography 6