Keyword: ⛔ no doi found
2019 (1)
RACE: Sub-Linear Memory Sketches for Approximate Near-Neighbor Search on Streaming Data. Coleman, B., Shrivastava, A., & Baraniuk, R. G. arXiv:1902.06687 [cs, eess, stat], February, 2019. arXiv: 1902.06687
![RACE: Sub-Linear Memory Sketches for Approximate Near-Neighbor Search on Streaming Data [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex
Paper abstract bibtex We demonstrate the first possibility of a sub-linear memory sketch for solving the approximate near-neighbor search problem. In particular, we develop an online sketching algorithm that can compress \$N\$ vectors into a tiny sketch consisting of small arrays of counters whose size scales as \$O(N{\textasciicircum}\{b\}{\textbackslash}log{\textasciicircum}2\{N\})\$, where \$b {\textless} 1\$ depending on the stability of the near-neighbor search. This sketch is sufficient to identify the top-\$v\$ near-neighbors with high probability. To the best of our knowledge, this is the first near-neighbor search algorithm that breaks the linear memory (\$O(N)\$) barrier. We achieve sub-linear memory by combining advances in locality sensitive hashing (LSH) based estimation, especially the recently-published ACE algorithm, with compressed sensing and heavy hitter techniques. We provide strong theoretical guarantees; in particular, our analysis sheds new light on the memory-accuracy tradeoff in the near-neighbor search setting and the role of sparsity in compressed sensing, which could be of independent interest. We rigorously evaluate our framework, which we call RACE (Repeated ACE) data structures on a friend recommendation task on the Google plus graph with more than 100,000 high-dimensional vectors. RACE provides compression that is orders of magnitude better than the random projection based alternative, which is unsurprising given the theoretical advantage. We anticipate that RACE will enable both new theoretical perspectives on near-neighbor search and new methodologies for applications like high-speed data mining, internet-of-things (IoT), and beyond.
@article{coleman_race:_2019,
title = {{RACE}: {Sub}-{Linear} {Memory} {Sketches} for {Approximate} {Near}-{Neighbor} {Search} on {Streaming} {Data}},
shorttitle = {{RACE}},
url = {http://arxiv.org/abs/1902.06687},
abstract = {We demonstrate the first possibility of a sub-linear memory sketch for solving the approximate near-neighbor search problem. In particular, we develop an online sketching algorithm that can compress \$N\$ vectors into a tiny sketch consisting of small arrays of counters whose size scales as \$O(N{\textasciicircum}\{b\}{\textbackslash}log{\textasciicircum}2\{N\})\$, where \$b {\textless} 1\$ depending on the stability of the near-neighbor search. This sketch is sufficient to identify the top-\$v\$ near-neighbors with high probability. To the best of our knowledge, this is the first near-neighbor search algorithm that breaks the linear memory (\$O(N)\$) barrier. We achieve sub-linear memory by combining advances in locality sensitive hashing (LSH) based estimation, especially the recently-published ACE algorithm, with compressed sensing and heavy hitter techniques. We provide strong theoretical guarantees; in particular, our analysis sheds new light on the memory-accuracy tradeoff in the near-neighbor search setting and the role of sparsity in compressed sensing, which could be of independent interest. We rigorously evaluate our framework, which we call RACE (Repeated ACE) data structures on a friend recommendation task on the Google plus graph with more than 100,000 high-dimensional vectors. RACE provides compression that is orders of magnitude better than the random projection based alternative, which is unsurprising given the theoretical advantage. We anticipate that RACE will enable both new theoretical perspectives on near-neighbor search and new methodologies for applications like high-speed data mining, internet-of-things (IoT), and beyond.},
urldate = {2019-03-23TZ},
journal = {arXiv:1902.06687 [cs, eess, stat]},
author = {Coleman, Benjamin and Shrivastava, Anshumali and Baraniuk, Richard G.},
month = feb,
year = {2019},
note = {arXiv: 1902.06687},
keywords = {⛔ No DOI found}
}2018 (4)
Parallel WaveNet: Fast High-Fidelity Speech Synthesis. van den Oord, A., Li, Y., Babuschkin, I., Simonyan, K., Vinyals, O., Kavukcuoglu, K., van den Driessche, G., Lockhart, E., Cobo, L. C., Stimberg, F., Casagrande, N., Grewe, D., Noury, S., Dieleman, S., Elsen, E., Kalchbrenner, N., Zen, H., Graves, A., King, H., Walters, T., Belov, D., & Hassabis, D. In Dy, J. G. & Krause, A., editors, ICML, volume 80, of Proceedings of Machine Learning Research, pages 3915–3923, 2018. PMLR.
Paper bibtex
Paper bibtex Rhinosinusites aiguës de l'enfant. Simon, F. Pédiatrie Pratique, 295:2–3, 2018.
bibtex
bibtex
@article{simon_rhinosinusites_2018,
title = {Rhinosinusites aiguës de l'enfant},
volume = {295},
copyright = {All rights reserved},
shorttitle = {Rhinosinusites aiguës de l'enfant},
language = {fr},
journal = {Pédiatrie Pratique},
author = {Simon, F.},
year = {2018},
keywords = {⛔ No DOI found, 🔍No DOI found},
pages = {2--3}
}Learning-Aided Physical Layer Authentication as an Intelligent Process. Fang, H., Wang, X., & Hanzo, L. arXiv:1808.02456 [cs], August, 2018. arXiv: 1808.02456
Paper abstract bibtex
Paper abstract bibtex Performance of the existing physical layer authentication schemes could be severely affected by the imperfect estimates and variations of the communication link attributes used. The commonly adopted static hypothesis testing for physical layer authentication faces significant challenges in time-varying communication channels due to the changing propagation and interference conditions, which are typically unknown at the design stage. To circumvent this impediment, we propose an adaptive physical layer authentication scheme based on machine-learning as an intelligent process to learn and utilize the complex and time-varying environment, and hence to improve the reliability and robustness of physical layer authentication. Explicitly, a physical layer attribute fusion model based on a kernel machine is designed for dealing with multiple attributes without requiring the knowledge of their statistical properties. By modeling the physical layer authentication as a linear system, the proposed technique directly reduces the authentication scope from a combined N-dimensional feature space to a single dimensional (scalar) space, hence leading to reduced authentication complexity. By formulating the learning (training) objective of the physical layer authentication as a convex problem, an adaptive algorithm based on kernel least-mean-square is then proposed as an intelligent process to learn and track the variations of multiple attributes, and therefore to enhance the authentication performance. Both the convergence and the authentication performance of the proposed intelligent authentication process are theoretically analyzed. Our simulations demonstrate that our solution significantly improves the authentication performance in time-varying environments.
@article{fang_learning-aided_2018,
title = {Learning-{Aided} {Physical} {Layer} {Authentication} as an {Intelligent} {Process}},
url = {http://arxiv.org/abs/1808.02456},
abstract = {Performance of the existing physical layer authentication schemes could be severely affected by the imperfect estimates and variations of the communication link attributes used. The commonly adopted static hypothesis testing for physical layer authentication faces significant challenges in time-varying communication channels due to the changing propagation and interference conditions, which are typically unknown at the design stage. To circumvent this impediment, we propose an adaptive physical layer authentication scheme based on machine-learning as an intelligent process to learn and utilize the complex and time-varying environment, and hence to improve the reliability and robustness of physical layer authentication. Explicitly, a physical layer attribute fusion model based on a kernel machine is designed for dealing with multiple attributes without requiring the knowledge of their statistical properties. By modeling the physical layer authentication as a linear system, the proposed technique directly reduces the authentication scope from a combined N-dimensional feature space to a single dimensional (scalar) space, hence leading to reduced authentication complexity. By formulating the learning (training) objective of the physical layer authentication as a convex problem, an adaptive algorithm based on kernel least-mean-square is then proposed as an intelligent process to learn and track the variations of multiple attributes, and therefore to enhance the authentication performance. Both the convergence and the authentication performance of the proposed intelligent authentication process are theoretically analyzed. Our simulations demonstrate that our solution significantly improves the authentication performance in time-varying environments.},
urldate = {2018-12-12TZ},
journal = {arXiv:1808.02456 [cs]},
author = {Fang, He and Wang, Xianbin and Hanzo, Lajos},
month = aug,
year = {2018},
note = {arXiv: 1808.02456},
keywords = {⛔ No DOI found}
}Sanctorum: A lightweight security monitor for secure enclaves. Lebedev, I., Hogan, K., Drean, J., Kohlbrenner, D., Lee, D., Asanović, K., Song, D., & Devadas, S. arXiv:1812.10605 [cs], December, 2018. arXiv: 1812.10605
Paper abstract bibtex
Paper abstract bibtex Enclaves have emerged as a particularly compelling primitive to implement trusted execution environments: strongly isolated sensitive user-mode processes in a largely untrusted software environment. While the threat models employed by various enclave systems differ, the high-level guarantees they offer are essentially the same: attestation of an enclave's initial state, as well as a guarantee of enclave integrity and privacy in the presence of an adversary. This work describes Sanctorum, a small trusted code base (TCB), consisting of a generic enclave-capable system, which is sufficient to implement secure enclaves akin to the primitive offered by Intel's SGX. While enclaves may be implemented via unconditionally trusted hardware and microcode, as it is the case in SGX, we employ a smaller TCB principally consisting of authenticated, privileged software, which may be replaced or patched as needed. Sanctorum implements a formally verified specification for generic enclaves on an in-order multiprocessor system meeting baseline security requirements, e.g., the MIT Sanctum processor and the Keystone enclave framework. Sanctorum requires trustworthy hardware including a random number generator, a private cryptographic key pair derived via a secure bootstrapping protocol, and a robust isolation primitive to safeguard sensitive information. Sanctorum's threat model is informed by the threat model of the isolation primitive, and is suitable for adding enclaves to a variety of processor systems.
@article{lebedev_sanctorum:_2018,
title = {Sanctorum: {A} lightweight security monitor for secure enclaves},
shorttitle = {Sanctorum},
url = {http://arxiv.org/abs/1812.10605},
abstract = {Enclaves have emerged as a particularly compelling primitive to implement trusted execution environments: strongly isolated sensitive user-mode processes in a largely untrusted software environment. While the threat models employed by various enclave systems differ, the high-level guarantees they offer are essentially the same: attestation of an enclave's initial state, as well as a guarantee of enclave integrity and privacy in the presence of an adversary. This work describes Sanctorum, a small trusted code base (TCB), consisting of a generic enclave-capable system, which is sufficient to implement secure enclaves akin to the primitive offered by Intel's SGX. While enclaves may be implemented via unconditionally trusted hardware and microcode, as it is the case in SGX, we employ a smaller TCB principally consisting of authenticated, privileged software, which may be replaced or patched as needed. Sanctorum implements a formally verified specification for generic enclaves on an in-order multiprocessor system meeting baseline security requirements, e.g., the MIT Sanctum processor and the Keystone enclave framework. Sanctorum requires trustworthy hardware including a random number generator, a private cryptographic key pair derived via a secure bootstrapping protocol, and a robust isolation primitive to safeguard sensitive information. Sanctorum's threat model is informed by the threat model of the isolation primitive, and is suitable for adding enclaves to a variety of processor systems.},
urldate = {2019-03-10TZ},
journal = {arXiv:1812.10605 [cs]},
author = {Lebedev, Ilia and Hogan, Kyle and Drean, Jules and Kohlbrenner, David and Lee, Dayeol and Asanović, Krste and Song, Dawn and Devadas, Srinivas},
month = dec,
year = {2018},
note = {arXiv: 1812.10605},
keywords = {⛔ No DOI found}
}2017 (11)
Malformation veineuse de la tête et du cou, Intérêt du laser diode. Sauvaget, E., Simon, F., Salvan, D., Faucon, B., Borsik, M., Le Clerc, N., & Bisdorff, A. Sang Thrombose Vaisseaux, 29(2):69–74, 2017.
bibtex
bibtex
@article{sauvaget_malformation_2017,
title = {Malformation veineuse de la tête et du cou, {Intérêt} du laser diode},
volume = {29},
copyright = {All rights reserved},
shorttitle = {Malformation veineuse de la tête et du cou, {Intérêt} du laser diode},
language = {fr},
number = {2},
journal = {Sang Thrombose Vaisseaux},
author = {Sauvaget, E. and Simon, F. and Salvan, D. and Faucon, B. and Borsik, M. and Le Clerc, N. and Bisdorff, A.},
year = {2017},
keywords = {⛔ No DOI found, 🔍No DOI found},
pages = {69--74}
}Robust Physical-World Attacks on Deep Learning Models. Evtimov, I., Eykholt, K., Fernandes, E., Kohno, T., Li, B., Prakash, A., Rahmati, A., & Song, D. arXiv:1707.08945 [cs], July, 2017. arXiv: 1707.08945
Paper abstract bibtex
Paper abstract bibtex Although deep neural networks (DNNs) perform well in a variety of applications, they are vulnerable to adversarial examples resulting from small-magnitude perturbations added to the input data. Inputs modified in this way can be mislabeled as a target class in targeted attacks or as a random class different from the ground truth in untargeted attacks. However, recent studies have demonstrated that such adversarial examples have limited effectiveness in the physical world due to changing physical conditions–they either completely fail to cause misclassification or only work in restricted cases where a relatively complex image is perturbed and printed on paper. In this paper, we propose a general attack algorithm–Robust Physical Perturbations (RP2)– that takes into account the numerous physical conditions and produces robust adversarial perturbations. Using a real-world example of road sign recognition, we show that adversarial examples generated using RP2 achieve high attack success rates in the physical world under a variety of conditions, including different viewpoints. Furthermore, to the best of our knowledge, there is currently no standardized way to evaluate physical adversarial perturbations. Therefore, we propose a two-stage evaluation methodology and tailor it to the road sign recognition use case. Our methodology captures a range of diverse physical conditions, including those encountered when images are captured from moving vehicles. We evaluate our physical attacks using this methodology and effectively fool two road sign classifiers. Using a perturbation in the shape of black and white stickers, we attack a real Stop sign, causing targeted misclassification in 100% of the images obtained in controlled lab settings and above 84% of the captured video frames obtained on a moving vehicle for one of the classifiers we attack.
@article{evtimov_robust_2017,
title = {Robust {Physical}-{World} {Attacks} on {Deep} {Learning} {Models}},
url = {http://arxiv.org/abs/1707.08945},
abstract = {Although deep neural networks (DNNs) perform well in a variety of applications, they are vulnerable to adversarial examples resulting from small-magnitude perturbations added to the input data. Inputs modified in this way can be mislabeled as a target class in targeted attacks or as a random class different from the ground truth in untargeted attacks. However, recent studies have demonstrated that such adversarial examples have limited effectiveness in the physical world due to changing physical conditions--they either completely fail to cause misclassification or only work in restricted cases where a relatively complex image is perturbed and printed on paper. In this paper, we propose a general attack algorithm--Robust Physical Perturbations (RP2)-- that takes into account the numerous physical conditions and produces robust adversarial perturbations. Using a real-world example of road sign recognition, we show that adversarial examples generated using RP2 achieve high attack success rates in the physical world under a variety of conditions, including different viewpoints. Furthermore, to the best of our knowledge, there is currently no standardized way to evaluate physical adversarial perturbations. Therefore, we propose a two-stage evaluation methodology and tailor it to the road sign recognition use case. Our methodology captures a range of diverse physical conditions, including those encountered when images are captured from moving vehicles. We evaluate our physical attacks using this methodology and effectively fool two road sign classifiers. Using a perturbation in the shape of black and white stickers, we attack a real Stop sign, causing targeted misclassification in 100\% of the images obtained in controlled lab settings and above 84\% of the captured video frames obtained on a moving vehicle for one of the classifiers we attack.},
journal = {arXiv:1707.08945 [cs]},
author = {Evtimov, Ivan and Eykholt, Kevin and Fernandes, Earlence and Kohno, Tadayoshi and Li, Bo and Prakash, Atul and Rahmati, Amir and Song, Dawn},
month = jul,
year = {2017},
note = {arXiv: 1707.08945},
keywords = {⛔ No DOI found}
}Une stratégie moins agressive pour le traitement des chondrosarcomes des fosses nasales et de la base du crâne. Simon, F., Feuvret, L., Bresson, D., Calugaru, V., Guichard, J., El Zein, S., Froelich, S., Vérillaud, B., & Herman, P. Cancer/Radiothérapie, 21(6):679, 2017.
bibtex
bibtex
@article{simon_strategie_2017,
title = {Une stratégie moins agressive pour le traitement des chondrosarcomes des fosses nasales et de la base du crâne},
volume = {21},
copyright = {All rights reserved},
issn = {1278-3218},
shorttitle = {Une stratégie moins agressive pour le traitement des chondrosarcomes des fosses nasales et de la base du crâne},
language = {fr},
number = {6},
journal = {Cancer/Radiothérapie},
author = {Simon, F. and Feuvret, L. and Bresson, D. and Calugaru, V. and Guichard, J-P. and El Zein, S. and Froelich, S. and Vérillaud, B. and Herman, P.},
year = {2017},
keywords = {⛔ No DOI found, 🔍No DOI found},
pages = {679}
}Feature Alignment for the Analysis of Verbatim Text Transcripts. Jentner, W., El-Assady, M., Gipp, B., & Keim, D. In Proceedings of the Eurographics Conference on Visualization (EuroVis), 2017.
bibtex
bibtex
@inproceedings{JentnerEGK17,
title = {Feature {{Alignment}} for the {{Analysis}} of {{Verbatim Text Transcripts}}},
booktitle = {Proceedings of the {{Eurographics Conference}} on {{Visualization}} ({{EuroVis}})},
author = {Jentner, Wolfgang and {El-Assady}, Mennatallah and Gipp, Bela and Keim, Daniel},
year = {2017},
file = {..\\..\\..\\..\\..\\files/27981/JentnerEGK17--feature_alignment_for_the_analysis_of_verbatim_text_transcripts.pdf},
keywords = {!bg,!bg_author,!bg_preprint,⛔ No DOI found,jabref_imp2,old_tex_field_preprint},
oldkey = {Jentner2017},
preprint = {https://ag-gipp.github.io/bib/preprints/jentner2017.pdf},
topic = {misc}
}Zugang zu und Nachnutzung von wissenschaftlicher Software. Science, A. O. March, 2017.
Paper bibtex
Paper bibtex @article{science_zugang_2017,
title = {Zugang zu und {Nachnutzung} von wissenschaftlicher {Software}.},
url = {https://os.helmholtz.de/index.php?id=2766},
author = {Science, Arbeitskreis Open},
month = mar,
year = {2017},
keywords = {Nachhaltigkeit, Workshop, ⛔ No DOI found}
}Security for 4G and 5G Cellular Networks: A Survey of Existing Authentication and Privacy-preserving Schemes. Ferrag, M. A., Maglaras, L., Argyriou, A., Kosmanos, D., & Janicke, H. arXiv:1708.04027 [cs], August, 2017. arXiv: 1708.04027
Paper abstract bibtex
Paper abstract bibtex This paper presents a comprehensive survey of existing authentication and privacy-preserving schemes for 4G and 5G cellular networks. We start by providing an overview of existing surveys that deal with 4G and 5G communications, applications, standardization, and security. Then, we give a classification of threat models in 4G and 5G cellular networks in four categories, including, attacks against privacy, attacks against integrity, attacks against availability, and attacks against authentication. We also provide a classification of countermeasures into three types of categories, including, cryptography methods, humans factors, and intrusion detection methods. The countermeasures and informal and formal security analysis techniques used by the authentication and privacy preserving schemes are summarized in form of tables. Based on the categorization of the authentication and privacy models, we classify these schemes in seven types, including, handover authentication with privacy, mutual authentication with privacy, RFID authentication with privacy, deniable authentication with privacy, authentication with mutual anonymity, authentication and key agreement with privacy, and three-factor authentication with privacy. In addition, we provide a taxonomy and comparison of authentication and privacy-preserving schemes for 4G and 5G cellular networks in form of tables. Based on the current survey, several recommendations for further research are discussed at the end of this paper.
@article{ferrag_security_2017,
title = {Security for 4G and 5G {Cellular} {Networks}: {A} {Survey} of {Existing} {Authentication} and {Privacy}-preserving {Schemes}},
shorttitle = {Security for 4G and 5G {Cellular} {Networks}},
url = {http://arxiv.org/abs/1708.04027},
abstract = {This paper presents a comprehensive survey of existing authentication and privacy-preserving schemes for 4G and 5G cellular networks. We start by providing an overview of existing surveys that deal with 4G and 5G communications, applications, standardization, and security. Then, we give a classification of threat models in 4G and 5G cellular networks in four categories, including, attacks against privacy, attacks against integrity, attacks against availability, and attacks against authentication. We also provide a classification of countermeasures into three types of categories, including, cryptography methods, humans factors, and intrusion detection methods. The countermeasures and informal and formal security analysis techniques used by the authentication and privacy preserving schemes are summarized in form of tables. Based on the categorization of the authentication and privacy models, we classify these schemes in seven types, including, handover authentication with privacy, mutual authentication with privacy, RFID authentication with privacy, deniable authentication with privacy, authentication with mutual anonymity, authentication and key agreement with privacy, and three-factor authentication with privacy. In addition, we provide a taxonomy and comparison of authentication and privacy-preserving schemes for 4G and 5G cellular networks in form of tables. Based on the current survey, several recommendations for further research are discussed at the end of this paper.},
urldate = {2018-09-23TZ},
journal = {arXiv:1708.04027 [cs]},
author = {Ferrag, Mohamed Amine and Maglaras, Leandros and Argyriou, Antonios and Kosmanos, Dimitrios and Janicke, Helge},
month = aug,
year = {2017},
note = {arXiv: 1708.04027},
keywords = {⛔ No DOI found}
}Image Acquisition System Using On Sensor Compressed Sampling Technique. Gupta, P. S. & Choi, G. S. arXiv:1709.07041 [eess], September, 2017. arXiv: 1709.07041
Paper abstract bibtex
Paper abstract bibtex Advances in CMOS technology have made high resolution image sensors possible. These image sensor pose significant challenges in terms of the amount of raw data generated, energy efficiency and frame rate. This paper presents a new design methodology for an imaging system and a simplified novel pixel design to be used in such system so that Compressed Sensing technique can be implemented easily at the sensor level. This results in significant energy savings as it not only cuts the raw data rate but also reduces transistor count per pixel, decreases pixel size, increases fill factor, simplifies ADC, JPEG encoder and JPEG decoder design and decreases wiring as well as address decoder size by half. Thus Compressed Sensing has the potential to increase the resolution of image sensors for a given technology and die size while significantly decreasing the power consumption and design complexity. We show that it has potential to reduce power consumption by about 23%-65%.
@article{gupta_image_2017,
title = {Image {Acquisition} {System} {Using} {On} {Sensor} {Compressed} {Sampling} {Technique}},
url = {http://arxiv.org/abs/1709.07041},
abstract = {Advances in CMOS technology have made high resolution image sensors possible. These image sensor pose significant challenges in terms of the amount of raw data generated, energy efficiency and frame rate. This paper presents a new design methodology for an imaging system and a simplified novel pixel design to be used in such system so that Compressed Sensing technique can be implemented easily at the sensor level. This results in significant energy savings as it not only cuts the raw data rate but also reduces transistor count per pixel, decreases pixel size, increases fill factor, simplifies ADC, JPEG encoder and JPEG decoder design and decreases wiring as well as address decoder size by half. Thus Compressed Sensing has the potential to increase the resolution of image sensors for a given technology and die size while significantly decreasing the power consumption and design complexity. We show that it has potential to reduce power consumption by about 23\%-65\%.},
urldate = {2017-11-01TZ},
journal = {arXiv:1709.07041 [eess]},
author = {Gupta, Pravir Singh and Choi, Gwan Seong},
month = sep,
year = {2017},
note = {arXiv: 1709.07041},
keywords = {Important, ⛔ No DOI found}
}Adversarial Example Defenses: Ensembles of Weak Defenses are not Strong. He, W., Wei, J., Chen, X., Carlini, N., & Song, D. arXiv:1706.04701 [cs], June, 2017. arXiv: 1706.04701
Paper abstract bibtex
Paper abstract bibtex Ongoing research has proposed several methods to defend neural networks against adversarial examples, many of which researchers have shown to be ineffective. We ask whether a strong defense can be created by combining multiple (possibly weak) defenses. To answer this question, we study three defenses that follow this approach. Two of these are recently proposed defenses that intentionally combine components designed to work well together. A third defense combines three independent defenses. For all the components of these defenses and the combined defenses themselves, we show that an adaptive adversary can create adversarial examples successfully with low distortion. Thus, our work implies that ensemble of weak defenses is not sufficient to provide strong defense against adversarial examples.
@article{he_adversarial_2017,
title = {Adversarial {Example} {Defenses}: {Ensembles} of {Weak} {Defenses} are not {Strong}},
shorttitle = {Adversarial {Example} {Defenses}},
url = {http://arxiv.org/abs/1706.04701},
abstract = {Ongoing research has proposed several methods to defend neural networks against adversarial examples, many of which researchers have shown to be ineffective. We ask whether a strong defense can be created by combining multiple (possibly weak) defenses. To answer this question, we study three defenses that follow this approach. Two of these are recently proposed defenses that intentionally combine components designed to work well together. A third defense combines three independent defenses. For all the components of these defenses and the combined defenses themselves, we show that an adaptive adversary can create adversarial examples successfully with low distortion. Thus, our work implies that ensemble of weak defenses is not sufficient to provide strong defense against adversarial examples.},
journal = {arXiv:1706.04701 [cs]},
author = {He, Warren and Wei, James and Chen, Xinyun and Carlini, Nicholas and Song, Dawn},
month = jun,
year = {2017},
note = {arXiv: 1706.04701},
keywords = {⛔ No DOI found}
}Arrays of (locality-sensitive) Count Estimators (ACE): High-Speed Anomaly Detection via Cache Lookups. Luo, C. & Shrivastava, A. arXiv:1706.06664 [cs, stat], June, 2017. arXiv: 1706.06664
Paper abstract bibtex
Paper abstract bibtex Anomaly detection is one of the frequent and important subroutines deployed in large-scale data processing systems. Even being a well-studied topic, existing techniques for unsupervised anomaly detection require storing significant amounts of data, which is prohibitive from memory and latency perspective. In the big-data world existing methods fail to address the new set of memory and latency constraints. In this paper, we propose ACE (Arrays of (locality-sensitive) Count Estimators) algorithm that can be 60x faster than the ELKI package\textasciitilde\textbackslashcite\DBLP:conf/ssd/AchtertBKSZ09\, which has the fastest implementation of the unsupervised anomaly detection algorithms. ACE algorithm requires less than \$4MB\$ memory, to dynamically compress the full data information into a set of count arrays. These tiny \$4MB\$ arrays of counts are sufficient for unsupervised anomaly detection. At the core of the ACE algorithm, there is a novel statistical estimator which is derived from the sampling view of Locality Sensitive Hashing(LSH). This view is significantly different and efficient than the widely popular view of LSH for near-neighbor search. We show the superiority of ACE algorithm over 11 popular baselines on 3 benchmark datasets, including the KDD-Cup99 data which is the largest available benchmark comprising of more than half a million entries with ground truth anomaly labels.
@article{luo_arrays_2017,
title = {Arrays of (locality-sensitive) {Count} {Estimators} ({ACE}): {High}-{Speed} {Anomaly} {Detection} via {Cache} {Lookups}},
shorttitle = {Arrays of (locality-sensitive) {Count} {Estimators} ({ACE})},
url = {http://arxiv.org/abs/1706.06664},
abstract = {Anomaly detection is one of the frequent and important subroutines deployed in large-scale data processing systems. Even being a well-studied topic, existing techniques for unsupervised anomaly detection require storing significant amounts of data, which is prohibitive from memory and latency perspective. In the big-data world existing methods fail to address the new set of memory and latency constraints. In this paper, we propose ACE (Arrays of (locality-sensitive) Count Estimators) algorithm that can be 60x faster than the ELKI package{\textasciitilde}{\textbackslash}cite\{DBLP:conf/ssd/AchtertBKSZ09\}, which has the fastest implementation of the unsupervised anomaly detection algorithms. ACE algorithm requires less than \$4MB\$ memory, to dynamically compress the full data information into a set of count arrays. These tiny \$4MB\$ arrays of counts are sufficient for unsupervised anomaly detection. At the core of the ACE algorithm, there is a novel statistical estimator which is derived from the sampling view of Locality Sensitive Hashing(LSH). This view is significantly different and efficient than the widely popular view of LSH for near-neighbor search. We show the superiority of ACE algorithm over 11 popular baselines on 3 benchmark datasets, including the KDD-Cup99 data which is the largest available benchmark comprising of more than half a million entries with ground truth anomaly labels.},
urldate = {2019-03-23TZ},
journal = {arXiv:1706.06664 [cs, stat]},
author = {Luo, Chen and Shrivastava, Anshumali},
month = jun,
year = {2017},
note = {arXiv: 1706.06664},
keywords = {⛔ No DOI found}
}FLASH: Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search. Wang, Y., Shrivastava, A., & Ryu, J. arXiv:1709.01190 [cs], September, 2017. arXiv: 1709.01190
Paper abstract bibtex
Paper abstract bibtex We present FLASH (\\textbackslashbf F\ast \\textbackslashbf L\SH \\textbackslashbf A\lgorithm for \\textbackslashbf S\imilarity search accelerated with \\textbackslashbf H\PC (High-Performance Computing)), a similarity search system for ultra-high dimensional datasets on a single machine, which does not require similarity computation. Our system is an auspicious illustration of the power of randomized algorithms carefully tailored for high-performance computing platforms. We leverage LSH style randomized indexing procedure and combine it with several principled techniques, such as reservoir sampling, recent advances in one-pass minwise hashing, and count based estimations. The combination, while retaining sound theoretical guarantees, reduces the computational as well as parallelization overhead of our proposal. We provide CPU and hybrid CPU-GPU implementations of FLASH for replicability of our results https://github.com/RUSH-LAB/Flash. We evaluate FLASH on several real high dimensional datasets coming from different domains including text, malicious URL, click-through prediction, social networks, etc. Our experiments shed new light on the difficulties associated with datasets having several millions of dimensions. Current state-of-the-art implementations either fail on the presented scale or are orders of magnitude slower than our system. FLASH is capable of computing an approximate k-NN graph, from scratch, over full webspam dataset (1.3 billion nonzeros) in less than 10 seconds. Computing full k-NN graph in less than 10 seconds on webspam dataset, using brute-force (\$n{\textasciicircum}2D\$), will require at least 20 TFLOPS. We hope that FLASH gets adopted in practice.
@article{wang_flash:_2017-1,
title = {{FLASH}: {Randomized} {Algorithms} {Accelerated} over {CPU}-{GPU} for {Ultra}-{High} {Dimensional} {Similarity} {Search}},
shorttitle = {{FLASH}},
url = {http://arxiv.org/abs/1709.01190},
abstract = {We present FLASH (\{{\textbackslash}bf F\}ast \{{\textbackslash}bf L\}SH \{{\textbackslash}bf A\}lgorithm for \{{\textbackslash}bf S\}imilarity search accelerated with \{{\textbackslash}bf H\}PC (High-Performance Computing)), a similarity search system for ultra-high dimensional datasets on a single machine, which does not require similarity computation. Our system is an auspicious illustration of the power of randomized algorithms carefully tailored for high-performance computing platforms. We leverage LSH style randomized indexing procedure and combine it with several principled techniques, such as reservoir sampling, recent advances in one-pass minwise hashing, and count based estimations. The combination, while retaining sound theoretical guarantees, reduces the computational as well as parallelization overhead of our proposal. We provide CPU and hybrid CPU-GPU implementations of FLASH for replicability of our results https://github.com/RUSH-LAB/Flash. We evaluate FLASH on several real high dimensional datasets coming from different domains including text, malicious URL, click-through prediction, social networks, etc. Our experiments shed new light on the difficulties associated with datasets having several millions of dimensions. Current state-of-the-art implementations either fail on the presented scale or are orders of magnitude slower than our system. FLASH is capable of computing an approximate k-NN graph, from scratch, over full webspam dataset (1.3 billion nonzeros) in less than 10 seconds. Computing full k-NN graph in less than 10 seconds on webspam dataset, using brute-force (\$n{\textasciicircum}2D\$), will require at least 20 TFLOPS. We hope that FLASH gets adopted in practice.},
urldate = {2018-02-08TZ},
journal = {arXiv:1709.01190 [cs]},
author = {Wang, Yiqiu and Shrivastava, Anshumali and Ryu, Junghee},
month = sep,
year = {2017},
note = {arXiv: 1709.01190},
keywords = {⛔ No DOI found}
}What Are Optimal Coding Functions for Time-of-Flight Imaging?. GUPTA, M., VELTEN, A., NAYAR, S. K., & BREITBACH, E. 2017.
bibtex
bibtex
@article{gupta_what_2017,
title = {What {Are} {Optimal} {Coding} {Functions} for {Time}-of-{Flight} {Imaging}?},
author = {GUPTA, MOHIT and VELTEN, ANDREAS and NAYAR, SHREE K. and BREITBACH, ERIC},
year = {2017},
keywords = {⛔ No DOI found}
}2016 (9)
Towards the Science of Security and Privacy in Machine Learning. Papernot, N., McDaniel, P. D., Sinha, A., & Wellman, M. P. CoRR, 2016.
Paper bibtex
Paper bibtex @article{DBLP:journals/corr/PapernotMSW16,
author = {Nicolas Papernot and
Patrick D. McDaniel and
Arunesh Sinha and
Michael P. Wellman},
title = {Towards the Science of Security and Privacy in Machine Learning},
journal = {CoRR},
volume = {abs/1611.03814},
year = {2016},
url = {http://arxiv.org/abs/1611.03814},
archivePrefix = {arXiv},
eprint = {1611.03814},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/PapernotMSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}Sanctum: Minimal Hardware Extensions for Strong Software Isolation. Costan, V., Lebedev, I., & Devadas, S. In 25th \USENIX\ Security Symposium (\USENIX\ Security 16), pages 857–874, 2016.
Paper bibtex
Paper bibtex @inproceedings{costan_sanctum:_2016,
title = {Sanctum: {Minimal} {Hardware} {Extensions} for {Strong} {Software} {Isolation}},
shorttitle = {Sanctum},
url = {https://www.usenix.org/conference/usenixsecurity16/technical-sessions/presentation/costan},
language = {en},
urldate = {2019-03-14TZ},
booktitle = {25th \{{USENIX}\} {Security} {Symposium} (\{{USENIX}\} {Security} 16)},
author = {Costan, Victor and Lebedev, Ilia and Devadas, Srinivas},
year = {2016},
keywords = {⛔ No DOI found},
pages = {857--874}
}Malformation veineuse de la langue entraînant un syndrome d’apnée du sommeil sévère. Simon, F., Le Clerc, N., Bisdorff, A., & Herman, P. La Lettre de l'ORL, 2016.
bibtex
bibtex
@article{simon_malformation_2016,
title = {Malformation veineuse de la langue entraînant un syndrome d’apnée du sommeil sévère.},
copyright = {All rights reserved},
shorttitle = {Malformation veineuse de la langue entraînant un syndrome d’apnée du sommeil sévère.},
language = {fr},
number = {346},
journal = {La Lettre de l'ORL},
author = {Simon, F. and Le Clerc, N. and Bisdorff, A. and Herman, P.},
year = {2016},
keywords = {⛔ No DOI found, 🔍No DOI found},
pages = {14--15}
}From Scenarios over Models to Management — Alien Spread Management. Krug, R. M, Roura-Pascual, N., & Richardson, D. M In 2016. 00000
bibtex
bibtex
@inproceedings{krug_scenarios_2016,
title = {From {Scenarios} over {Models} to {Management} — {Alien} {Spread} {Management}},
copyright = {All rights reserved},
author = {Krug, Rainer M and Roura-Pascual, Núria and Richardson, David M},
year = {2016},
note = {00000},
keywords = {MP - Presentations, My Publications, ⛔ No DOI found}
}Integrating Scenarios and Models into Ecosystem Management: an example from the Maloti-Drakensberg Park World Heritage Site, South Africa. Rushworth, I. & Krug, R. M In 2016. 00000
bibtex
bibtex
@inproceedings{rushworth_integrating_2016,
title = {Integrating {Scenarios} and {Models} into {Ecosystem} {Management}: an example from the {Maloti}-{Drakensberg} {Park} {World} {Heritage} {Site}, {South} {Africa}},
copyright = {All rights reserved},
author = {Rushworth, Ian and Krug, Rainer M},
year = {2016},
note = {00000},
keywords = {MP - Presentations, My Publications, ⛔ No DOI found}
}Handling Privacy and Security in the Internet of Things. Britton, K. 2016.
bibtex
bibtex
@article{britton_handling_2016,
title = {Handling {Privacy} and {Security} in the {Internet} of {Things}},
language = {en},
author = {Britton, Katherine},
year = {2016},
keywords = {⛔ No DOI found},
pages = {6}
}Sampling Race: Bypassing Timing-Based Analog Active Sensor Spoofing Detection on Analog-Digital Systems. Shin, H., Son, Y., Park, Y., Kwon, Y., & Kim, Y. In 2016.
Paper bibtex
Paper bibtex @inproceedings{shin_sampling_2016,
title = {Sampling {Race}: {Bypassing} {Timing}-{Based} {Analog} {Active} {Sensor} {Spoofing} {Detection} on {Analog}-{Digital} {Systems}},
shorttitle = {Sampling {Race}},
url = {https://www.usenix.org/conference/woot16/workshop-program/presentation/shin},
language = {en},
urldate = {2019-03-18TZ},
author = {Shin, Hocheol and Son, Yunmok and Park, Youngseok and Kwon, Yujin and Kim, Yongdae},
year = {2016},
keywords = {⛔ No DOI found}
}On the Security of Millimeter Wave Vehicular Communication Systems using Random Antenna Subsets. Eltayeb, M. E., Choi, J., Al-Naffouri, T. Y., & Heath Jr, R. W. arXiv:1609.04499 [cs, math], September, 2016. arXiv: 1609.04499
Paper abstract bibtex
Paper abstract bibtex Millimeter wave (mmWave) vehicular communica tion systems have the potential to improve traffic efficiency and safety. Lack of secure communication links, however, may lead to a formidable set of abuses and attacks. To secure communication links, a physical layer precoding technique for mmWave vehicular communication systems is proposed in this paper. The proposed technique exploits the large dimensional antenna arrays available at mmWave systems to produce direction dependent transmission. This results in coherent transmission to the legitimate receiver and artificial noise that jams eavesdroppers with sensitive receivers. Theoretical and numerical results demonstrate the validity and effectiveness of the proposed technique and show that the proposed technique provides high secrecy throughput when compared to conventional array and switched array transmission techniques.
@article{eltayeb_security_2016,
title = {On the {Security} of {Millimeter} {Wave} {Vehicular} {Communication} {Systems} using {Random} {Antenna} {Subsets}},
url = {http://arxiv.org/abs/1609.04499},
abstract = {Millimeter wave (mmWave) vehicular communica tion systems have the potential to improve traffic efficiency and safety. Lack of secure communication links, however, may lead to a formidable set of abuses and attacks. To secure communication links, a physical layer precoding technique for mmWave vehicular communication systems is proposed in this paper. The proposed technique exploits the large dimensional antenna arrays available at mmWave systems to produce direction dependent transmission. This results in coherent transmission to the legitimate receiver and artificial noise that jams eavesdroppers with sensitive receivers. Theoretical and numerical results demonstrate the validity and effectiveness of the proposed technique and show that the proposed technique provides high secrecy throughput when compared to conventional array and switched array transmission techniques.},
urldate = {2018-12-12TZ},
journal = {arXiv:1609.04499 [cs, math]},
author = {Eltayeb, Mohammed E. and Choi, Junil and Al-Naffouri, Tareq Y. and Heath Jr, Robert W.},
month = sep,
year = {2016},
note = {arXiv: 1609.04499},
keywords = {⛔ No DOI found}
}SC-DCNN: Highly-Scalable Deep Convolutional Neural Network using Stochastic Computing. Ren, A., Li, J., Li, Z., Ding, C., Qian, X., Qiu, Q., Yuan, B., & Wang, Y. arXiv:1611.05939 [cs], November, 2016. arXiv: 1611.05939
Paper abstract bibtex
Paper abstract bibtex With the recent advance of wearable devices and Internet of Things (IoTs), it becomes attractive to implement the Deep Convolutional Neural Networks (DCNNs) in embedded and portable systems. Currently, executing the software-based DCNNs requires high-performance servers, restricting the widespread deployment on embedded and mobile IoT devices. To overcome this obstacle, considerable research efforts have been made to develop highly-parallel and specialized DCNN accelerators using GPGPUs, FPGAs or ASICs. Stochastic Computing (SC), which uses a bit-stream to represent a number within [-1, 1] by counting the number of ones in the bit-stream, has high potential for implementing DCNNs with high scalability and ultra-low hardware footprint. Since multiplications and additions can be calculated using AND gates and multiplexers in SC, significant reductions in power (energy) and hardware footprint can be achieved compared to the conventional binary arithmetic implementations. The tremendous savings in power (energy) and hardware resources allow immense design space for enhancing scalability and robustness for hardware DCNNs.
@article{ren_sc-dcnn:_2016,
title = {{SC}-{DCNN}: {Highly}-{Scalable} {Deep} {Convolutional} {Neural} {Network} using {Stochastic} {Computing}},
shorttitle = {{SC}-{DCNN}},
url = {http://arxiv.org/abs/1611.05939},
abstract = {With the recent advance of wearable devices and Internet of Things (IoTs), it becomes attractive to implement the Deep Convolutional Neural Networks (DCNNs) in embedded and portable systems. Currently, executing the software-based DCNNs requires high-performance servers, restricting the widespread deployment on embedded and mobile IoT devices. To overcome this obstacle, considerable research efforts have been made to develop highly-parallel and specialized DCNN accelerators using GPGPUs, FPGAs or ASICs. Stochastic Computing (SC), which uses a bit-stream to represent a number within [-1, 1] by counting the number of ones in the bit-stream, has high potential for implementing DCNNs with high scalability and ultra-low hardware footprint. Since multiplications and additions can be calculated using AND gates and multiplexers in SC, significant reductions in power (energy) and hardware footprint can be achieved compared to the conventional binary arithmetic implementations. The tremendous savings in power (energy) and hardware resources allow immense design space for enhancing scalability and robustness for hardware DCNNs.},
language = {en},
urldate = {2019-03-23TZ},
journal = {arXiv:1611.05939 [cs]},
author = {Ren, Ao and Li, Ji and Li, Zhe and Ding, Caiwen and Qian, Xuehai and Qiu, Qinru and Yuan, Bo and Wang, Yanzhi},
month = nov,
year = {2016},
note = {arXiv: 1611.05939},
keywords = {⛔ No DOI found}
}2015 (3)
A SysML formal framework to combine discrete and continuous simulation for testing. Gauthier, J., Bouquet, F., Hammad, A., & Peureux, F. In International Conference on Formal Engineering Methods, pages 134–152, 2015. Springer.
bibtex
bibtex
@inproceedings{gauthier_sysml_2015,
title = {A {SysML} formal framework to combine discrete and continuous simulation for testing},
booktitle = {International {Conference} on {Formal} {Engineering} {Methods}},
publisher = {Springer},
author = {Gauthier, Jean-Marie and Bouquet, Fabrice and Hammad, Ahmed and Peureux, Fabien},
year = {2015},
keywords = {⛔ No DOI found},
pages = {134--152},
}Android Permissions Remystified: A Field Study on Contextual Integrity. Wijesekera, P., Baokar, A., Hosseini, A., Egelman, S., Wagner, D., & Beznosov, K. In USENIX Security Symposium, pages 499–514, 2015.
bibtex
bibtex
FPGA Based Accelerator for Pattern Matching in YARA Framework. Singapura, S. G., Yang, Y. E., Panangadan, A., Nemeth, T., & Prasanna, V. K. 2015.
bibtex
bibtex
@article{singapura_fpga_2015,
title = {{FPGA} {Based} {Accelerator} for {Pattern} {Matching} in {YARA} {Framework}},
author = {Singapura, Shreyas G. and Yang, Yi-Hua E. and Panangadan, Anand and Nemeth, Tamas and Prasanna, Viktor K.},
year = {2015},
keywords = {⛔ No DOI found}
}2014 (11)
弯管中段塞流的数值模拟. 杨帆 & 周晓 辽宁石油化工大学期刊社, 34(5):23–27, 2014.
bibtex
bibtex
@article{__2014,
title = {弯管中段塞流的数值模拟},
volume = {34},
number = {5},
journal = {辽宁石油化工大学期刊社},
author = {{杨帆} and {周晓}},
year = {2014},
keywords = {②已读1x, ④弃读-x, ⛔ No DOI found},
pages = {23--27},
}Model-based synthesis of control software from system-level formal specifications. Mari, F., Melatti, I., Salvo, I., & Tronci, E. ACM Transactions on Software Engineering and Methodology, 23(1):6:1–6:42, February, 2014. tex.ids= mari_model_2013
Paper doi abstract bibtex
Paper doi abstract bibtex Many embedded systems are indeed software-based control systems, that is, control systems whose controller consists of control software running on a microcontroller device. This motivates investigation on formal model-based design approaches for automatic synthesis of embedded systems control software. We present an algorithm, along with a tool QKS implementing it, that from a formal model (as a discrete-time linear hybrid system) of the controlled system (plant), implementation specifications (that is, number of bits in the Analog-to-Digital, AD, conversion) and system-level formal specifications (that is, safety and liveness requirements for the closed loop system) returns correct-by-construction control software that has a Worst-Case Execution Time (WCET) linear in the number of AD bits and meets the given specifications. We show feasibility of our approach by presenting experimental results on using it to synthesize control software for a buck DC-DC converter, a widely used mixed-mode analog circuit, and for the inverted pendulum.
@article{mari_model-based_2014,
title = {Model-based synthesis of control software from system-level formal specifications},
volume = {23},
issn = {1049-331X},
url = {https://doi.org/10.1145/2559934},
doi = {10/gbfrm5},
abstract = {Many embedded systems are indeed software-based control systems, that is, control systems whose controller consists of control software running on a microcontroller device. This motivates investigation on formal model-based design approaches for automatic synthesis of embedded systems control software. We present an algorithm, along with a tool QKS implementing it, that from a formal model (as a discrete-time linear hybrid system) of the controlled system (plant), implementation specifications (that is, number of bits in the Analog-to-Digital, AD, conversion) and system-level formal specifications (that is, safety and liveness requirements for the closed loop system) returns correct-by-construction control software that has a Worst-Case Execution Time (WCET) linear in the number of AD bits and meets the given specifications. We show feasibility of our approach by presenting experimental results on using it to synthesize control software for a buck DC-DC converter, a widely used mixed-mode analog circuit, and for the inverted pendulum.},
number = {1},
urldate = {2021-01-27},
journal = {ACM Transactions on Software Engineering and Methodology},
author = {Mari, Federico and Melatti, Igor and Salvo, Ivano and Tronci, Enrico},
month = feb,
year = {2014},
note = {tex.ids= mari\_model\_2013},
keywords = {Hybrid systems, correct-by-construction control software synthesis, model-based design of control software, ⛔ No DOI found},
pages = {6:1--6:42},
}TUW-IMP at the NTCIR-11 Math-2. Lipani, A., Andersson, L., Piroi, F., Lupu, M., & Hanbury, A. In Kando, N., Joho, H., & Kishida, K., editors, Proceedings of the 11th NTCIR Conference on Evaluation of Information Access Technologies, NTCIR-11, National Center of Sciences, Tokyo, Japan, December 9-12, 2014, 2014. National Institute of Informatics (NII).
![TUW-IMP at the NTCIR-11 Math-2 [pdf]](https://bibbase.org/img/filetypes/pdf.svg "pdf")
Paper bibtex
Paper bibtex @inproceedings{lipani_tuw-imp_2014,
title = {{TUW}-{IMP} at the {NTCIR}-11 {Math}-2},
url = {http://research.nii.ac.jp/ntcir/workshop/OnlineProceedings11/pdf/NTCIR/Math-2/09-NTCIR11-MATH-LipaniA.pdf},
urldate = {2021-08-19},
booktitle = {Proceedings of the 11th {NTCIR} {Conference} on {Evaluation} of {Information} {Access} {Technologies}, {NTCIR}-11, {National} {Center} of {Sciences}, {Tokyo}, {Japan}, {December} 9-12, 2014},
publisher = {National Institute of Informatics (NII)},
author = {Lipani, Aldo and Andersson, Linda and Piroi, Florina and Lupu, Mihai and Hanbury, Allan},
editor = {Kando, Noriko and Joho, Hideo and Kishida, Kazuaki},
year = {2014},
keywords = {⛔ No DOI found},
}Towards Formal Modelling and Verification of Pervasive Computing Systems. Liu, Y., Zhang, X., Liu, Y., Dong, J. S., Sun, J., Biswas, J., & Mokhtari, M. In Trans. Computational Collective Intelligence, volume 16, pages 62–91, 2014.
bibtex
bibtex
@inproceedings{liu_towards_2014,
title = {Towards {Formal} {Modelling} and {Verification} of {Pervasive} {Computing} {Systems}.},
volume = {16},
booktitle = {Trans. {Computational} {Collective} {Intelligence}},
author = {Liu, Yan and Zhang, Xian and Liu, Yang and Dong, Jin Song and Sun, Jun and Biswas, Jit and Mokhtari, Mounir},
year = {2014},
keywords = {⛔ No DOI found},
pages = {62--91},
}Distributed Representations of Sentences and Documents. Le, Q. V. & Mikolov, T. In Proceedings of the 31th International Conference on Machine Learning, ICML 2014, Beijing, China, 21-26 June 2014, volume 32, of JMLR Workshop and Conference Proceedings, pages 1188–1196, 2014. JMLR.org.
Paper bibtex
Paper bibtex @inproceedings{le_distributed_2014,
series = {{JMLR} {Workshop} and {Conference} {Proceedings}},
title = {Distributed {Representations} of {Sentences} and {Documents}},
volume = {32},
url = {http://proceedings.mlr.press/v32/le14.html},
urldate = {2021-09-05},
booktitle = {Proceedings of the 31th {International} {Conference} on {Machine} {Learning}, {ICML} 2014, {Beijing}, {China}, 21-26 {June} 2014},
publisher = {JMLR.org},
author = {Le, Quoc V. and Mikolov, Tomás},
year = {2014},
keywords = {⛔ No DOI found},
pages = {1188--1196},
}An Institutional Framework for Heterogeneous Formal Development in UML. Knapp, A., Mossakowski, T., & Roggenbach, M. arXiv:1403.7747 [cs], March, 2014.
Paper abstract bibtex
Paper abstract bibtex We present a framework for formal software development with UML. In contrast to previous approaches that equip UML with a formal semantics, we follow an institution based heterogeneous approach. This can express suitable formal semantics of the different UML diagram types directly, without the need to map everything to one specific formalism (let it be first-order logic or graph grammars). We show how different aspects of the formal development process can be coherently formalised, ranging from requirements over design and Hoare-style conditions on code to the implementation itself. The framework can be used to verify consistency of different UML diagrams both horizontally (e.g., consistency among various requirements) as well as vertically (e.g., correctness of design or implementation w.r.t. the requirements).
@article{knapp_institutional_2014,
title = {An {Institutional} {Framework} for {Heterogeneous} {Formal} {Development} in {UML}},
url = {http://arxiv.org/abs/1403.7747},
abstract = {We present a framework for formal software development with UML. In contrast to previous approaches that equip UML with a formal semantics, we follow an institution based heterogeneous approach. This can express suitable formal semantics of the different UML diagram types directly, without the need to map everything to one specific formalism (let it be first-order logic or graph grammars). We show how different aspects of the formal development process can be coherently formalised, ranging from requirements over design and Hoare-style conditions on code to the implementation itself. The framework can be used to verify consistency of different UML diagrams both horizontally (e.g., consistency among various requirements) as well as vertically (e.g., correctness of design or implementation w.r.t. the requirements).},
urldate = {2021-01-27},
journal = {arXiv:1403.7747 [cs]},
author = {Knapp, Alexander and Mossakowski, Till and Roggenbach, Markus},
month = mar,
year = {2014},
keywords = {Computer Science - Logic in Computer Science, Computer Science - Software Engineering, ⛔ No DOI found},
}Sequence to Sequence Learning with Neural Networks. Sutskever, I., Vinyals, O., & Le, Q. V. In Ghahramani, Z., Welling, M., Cortes, C., Lawrence, N. D., & Weinberger, K. Q., editors, Annual Conference on Neural Information Processing Systems, pages 3104–3112, Montreal, Quebec, Canada, 2014.
Paper bibtex
Paper bibtex @inproceedings{sutskever_sequence_2014,
address = {Montreal, Quebec, Canada},
title = {Sequence to {Sequence} {Learning} with {Neural} {Networks}},
url = {https://proceedings.neurips.cc/paper/2014/hash/a14ac55a4f27472c5d894ec1c3c743d2-Abstract.html},
urldate = {2021-09-10},
booktitle = {Annual {Conference} on {Neural} {Information} {Processing} {Systems}},
author = {Sutskever, Ilya and Vinyals, Oriol and Le, Quoc V.},
editor = {Ghahramani, Zoubin and Welling, Max and Cortes, Corinna and Lawrence, Neil D. and Weinberger, Kilian Q.},
year = {2014},
keywords = {⛔ No DOI found},
pages = {3104--3112},
}Deep Neural Networks are Easily Fooled: High Confidence Predictions for Unrecognizable Images. Nguyen, A., Yosinski, J., & Clune, J. arXiv:1412.1897 [cs], December, 2014. arXiv: 1412.1897
Paper abstract bibtex
Paper abstract bibtex Deep neural networks (DNNs) have recently been achieving state-of-the-art performance on a variety of pattern-recognition tasks, most notably visual classification problems. Given that DNNs are now able to classify objects in images with near-human-level performance, questions naturally arise as to what differences remain between computer and human vision. A recent study revealed that changing an image (e.g. of a lion) in a way imperceptible to humans can cause a DNN to label the image as something else entirely (e.g. mislabeling a lion a library). Here we show a related result: it is easy to produce images that are completely unrecognizable to humans, but that state-of-the-art DNNs believe to be recognizable objects with 99.99% confidence (e.g. labeling with certainty that white noise static is a lion). Specifically, we take convolutional neural networks trained to perform well on either the ImageNet or MNIST datasets and then find images with evolutionary algorithms or gradient ascent that DNNs label with high confidence as belonging to each dataset class. It is possible to produce images totally unrecognizable to human eyes that DNNs believe with near certainty are familiar objects, which we call "fooling images" (more generally, fooling examples). Our results shed light on interesting differences between human vision and current DNNs, and raise questions about the generality of DNN computer vision.
@article{nguyen_deep_2014,
title = {Deep {Neural} {Networks} are {Easily} {Fooled}: {High} {Confidence} {Predictions} for {Unrecognizable} {Images}},
shorttitle = {Deep {Neural} {Networks} are {Easily} {Fooled}},
url = {http://arxiv.org/abs/1412.1897},
abstract = {Deep neural networks (DNNs) have recently been achieving state-of-the-art performance on a variety of pattern-recognition tasks, most notably visual classification problems. Given that DNNs are now able to classify objects in images with near-human-level performance, questions naturally arise as to what differences remain between computer and human vision. A recent study revealed that changing an image (e.g. of a lion) in a way imperceptible to humans can cause a DNN to label the image as something else entirely (e.g. mislabeling a lion a library). Here we show a related result: it is easy to produce images that are completely unrecognizable to humans, but that state-of-the-art DNNs believe to be recognizable objects with 99.99\% confidence (e.g. labeling with certainty that white noise static is a lion). Specifically, we take convolutional neural networks trained to perform well on either the ImageNet or MNIST datasets and then find images with evolutionary algorithms or gradient ascent that DNNs label with high confidence as belonging to each dataset class. It is possible to produce images totally unrecognizable to human eyes that DNNs believe with near certainty are familiar objects, which we call "fooling images" (more generally, fooling examples). Our results shed light on interesting differences between human vision and current DNNs, and raise questions about the generality of DNN computer vision.},
journal = {arXiv:1412.1897 [cs]},
author = {Nguyen, Anh and Yosinski, Jason and Clune, Jeff},
month = dec,
year = {2014},
note = {arXiv: 1412.1897},
keywords = {⛔ No DOI found}
}21.7 A 1.8 mW PLL-free channelized 2.4 GHz ZigBee receiver utilizing fixed-LO temperature-compensated FBAR resonator. Wang, K., Koo, J., Ruby, R., & Otis, B. In Solid-State Circuits Conference Digest of Technical Papers (ISSCC), 2014 IEEE International, pages 372–373, 2014. IEEE.
Paper bibtex
Paper bibtex @inproceedings{wang_21.7_2014,
title = {21.7 {A} 1.8 {mW} {PLL}-free channelized 2.4 {GHz} {ZigBee} receiver utilizing fixed-{LO} temperature-compensated {FBAR} resonator},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6757475},
urldate = {2014-11-26TZ},
booktitle = {Solid-{State} {Circuits} {Conference} {Digest} of {Technical} {Papers} ({ISSCC}), 2014 {IEEE} {International}},
publisher = {IEEE},
author = {Wang, Keping and Koo, Jabeom and Ruby, Richard and Otis, Brian},
year = {2014},
keywords = {⛔ No DOI found},
pages = {372--373}
}Densifying One Permutation Hashing via Rotation for Fast Near Neighbor Search. Shrivastava, A. & Li, P. In Proceedings of the 31st International Conference on International Conference on Machine Learning - Volume 32, of ICML'14, pages I–557–I–565, Beijing, China, 2014. JMLR.org.
Paper abstract bibtex
Paper abstract bibtex The query complexity of locality sensitive hashing (LSH) based similarity search is dominated by the number of hash evaluations, and this number grows with the data size (Indyk & Motwani, 1998). In industrial applications such as search where the data are often high-dimensional and binary (e.g., text n-grams), minwise hashing is widely adopted, which requires applying a large number of permutations on the data. This is costly in computation and energy-consumption. In this paper, we propose a hashing technique which generates all the necessary hash evaluations needed for similarity search, using one single permutation. The heart of the proposed hash function is a "rotation" scheme which densifies the sparse sketches of one permutation hashing (Li et al., 2012) in an unbiased fashion thereby maintaining the LSH property. This makes the obtained sketches suitable for hash table construction. This idea of rotation presented in this paper could be of independent interest for densifying other types of sparse sketches. Using our proposed hashing method, the query time of a (K,L)-parameterized LSH is reduced from the typical O(dKL) complexity to merely O(KL + dL), where d is the number of nonzeros of the data vector, K is the number of hashes in each hash table, and L is the number of hash tables. Our experimental evaluation on real data confirms that the proposed scheme significantly reduces the query processing time over minwise hashing without loss in retrieval accuracies.
@inproceedings{shrivastava_densifying_2014,
address = {Beijing, China},
series = {{ICML}'14},
title = {Densifying {One} {Permutation} {Hashing} via {Rotation} for {Fast} {Near} {Neighbor} {Search}},
url = {http://dl.acm.org/citation.cfm?id=3044805.3044869},
abstract = {The query complexity of locality sensitive hashing (LSH) based similarity search is dominated by the number of hash evaluations, and this number grows with the data size (Indyk \& Motwani, 1998). In industrial applications such as search where the data are often high-dimensional and binary (e.g., text n-grams), minwise hashing is widely adopted, which requires applying a large number of permutations on the data. This is costly in computation and energy-consumption. In this paper, we propose a hashing technique which generates all the necessary hash evaluations needed for similarity search, using one single permutation. The heart of the proposed hash function is a "rotation" scheme which densifies the sparse sketches of one permutation hashing (Li et al., 2012) in an unbiased fashion thereby maintaining the LSH property. This makes the obtained sketches suitable for hash table construction. This idea of rotation presented in this paper could be of independent interest for densifying other types of sparse sketches. Using our proposed hashing method, the query time of a (K,L)-parameterized LSH is reduced from the typical O(dKL) complexity to merely O(KL + dL), where d is the number of nonzeros of the data vector, K is the number of hashes in each hash table, and L is the number of hash tables. Our experimental evaluation on real data confirms that the proposed scheme significantly reduces the query processing time over minwise hashing without loss in retrieval accuracies.},
urldate = {2018-02-08TZ},
booktitle = {Proceedings of the 31st {International} {Conference} on {International} {Conference} on {Machine} {Learning} - {Volume} 32},
publisher = {JMLR.org},
author = {Shrivastava, Anshumali and Li, Ping},
year = {2014},
keywords = {⛔ No DOI found},
pages = {I--557--I--565}
}Building fast Bayesian computing machines out of intentionally stochastic, digital parts. Mansinghka, V. & Jonas, E. arXiv:1402.4914 [cs, stat], February, 2014. arXiv: 1402.4914
Paper abstract bibtex
Paper abstract bibtex The brain interprets ambiguous sensory information faster and more reliably than modern computers, using neurons that are slower and less reliable than logic gates. But Bayesian inference, which underpins many computational models of perception and cognition, appears computationally challenging even given modern transistor speeds and energy budgets. The computational principles and structures needed to narrow this gap are unknown. Here we show how to build fast Bayesian computing machines using intentionally stochastic, digital parts, narrowing this efficiency gap by multiple orders of magnitude. We find that by connecting stochastic digital components according to simple mathematical rules, one can build massively parallel, low precision circuits that solve Bayesian inference problems and are compatible with the Poisson firing statistics of cortical neurons. We evaluate circuits for depth and motion perception, perceptual learning and causal reasoning, each performing inference over 10,000+ latent variables in real time - a 1,000x speed advantage over commodity microprocessors. These results suggest a new role for randomness in the engineering and reverse-engineering of intelligent computation.
@article{mansinghka_building_2014,
title = {Building fast {Bayesian} computing machines out of intentionally stochastic, digital parts},
url = {http://arxiv.org/abs/1402.4914},
abstract = {The brain interprets ambiguous sensory information faster and more reliably than modern computers, using neurons that are slower and less reliable than logic gates. But Bayesian inference, which underpins many computational models of perception and cognition, appears computationally challenging even given modern transistor speeds and energy budgets. The computational principles and structures needed to narrow this gap are unknown. Here we show how to build fast Bayesian computing machines using intentionally stochastic, digital parts, narrowing this efficiency gap by multiple orders of magnitude. We find that by connecting stochastic digital components according to simple mathematical rules, one can build massively parallel, low precision circuits that solve Bayesian inference problems and are compatible with the Poisson firing statistics of cortical neurons. We evaluate circuits for depth and motion perception, perceptual learning and causal reasoning, each performing inference over 10,000+ latent variables in real time - a 1,000x speed advantage over commodity microprocessors. These results suggest a new role for randomness in the engineering and reverse-engineering of intelligent computation.},
urldate = {2018-02-04TZ},
journal = {arXiv:1402.4914 [cs, stat]},
author = {Mansinghka, Vikash and Jonas, Eric},
month = feb,
year = {2014},
note = {arXiv: 1402.4914},
keywords = {⛔ No DOI found}
}2013 (5)
Formal verification of loop bound estimation for WCET analysis. Blazy, S., Maroneze, A., & Pichardie, D. In Working Conference on Verified Software: Theories, Tools, and Experiments, pages 281–303, 2013. Springer. tex.ids= blazyFormalVerificationLoop2013a, blazyFormalVerificationLoop2013b
bibtex
bibtex
@inproceedings{blazy_formal_2013,
title = {Formal verification of loop bound estimation for {WCET} analysis},
booktitle = {Working {Conference} on {Verified} {Software}: {Theories}, {Tools}, and {Experiments}},
publisher = {Springer},
author = {Blazy, Sandrine and Maroneze, André and Pichardie, David},
year = {2013},
note = {tex.ids= blazyFormalVerificationLoop2013a, blazyFormalVerificationLoop2013b},
keywords = {⛔ No DOI found},
pages = {281--303},
}Methodological Guidelines for Modelling and Design of Embedded Systems. Wolff, S. Aarhus University, Aarhus, Denmark, 2013.
bibtex
bibtex
@article{wolff_methodological_2013,
title = {Methodological {Guidelines} for {Modelling} and {Design} of {Embedded} {Systems}},
journal = {Aarhus University, Aarhus, Denmark},
author = {Wolff, Sune},
year = {2013},
keywords = {⛔ No DOI found},
}中国第六次人口普查长寿人口研究. 樊, 新. 人口学刊, 35(04):14–20, 2013. ZSCC: 0000010
Paper abstract bibtex
Paper abstract bibtex 文章利用第六次人口普查资料,对比第五次人口普查,以65岁以上老年人口为基数,统计分析90岁、100岁长寿人口。文章认为,长寿人口总体规模呈快速增长趋势;两次人口普查长寿人口地区分布基本一致;沿海经济发达地区的长寿人口比例比西北一些省份高;华南沿海地区的长寿老人比例两次普查都比较高,地理区位特点显著;第六次人口普查显示城市与乡村长寿人口趋于一致。对中国100万人口以上的19个民族长寿人口研究结果显示,90岁以上长寿老人排序前五位的民族有:回族、壮族、黎族、瑶族、维吾尔族。100岁以上长寿老人排序前五位的民族有:黎族、维吾尔族、瑶族、傣族、回族。长寿人口健康状况研究显示,90岁以上长寿老人22%生...
@article{__2013,
title = {中国第六次人口普查长寿人口研究},
volume = {35},
issn = {1004-129X},
url = {https://kns.cnki.net/KCMS/detail/detail.aspx?dbcode=CJFQ&dbname=CJFD2013&filename=RKXK201304003&v=Mjg1NDRSN3FmYitkb0Z5bm1WYi9KTnliVFpiRzRIOUxNcTQ5Rlo0UjhlWDFMdXhZUzdEaDFUM3FUcldNMUZyQ1U=},
abstract = {文章利用第六次人口普查资料,对比第五次人口普查,以65岁以上老年人口为基数,统计分析90岁、100岁长寿人口。文章认为,长寿人口总体规模呈快速增长趋势;两次人口普查长寿人口地区分布基本一致;沿海经济发达地区的长寿人口比例比西北一些省份高;华南沿海地区的长寿老人比例两次普查都比较高,地理区位特点显著;第六次人口普查显示城市与乡村长寿人口趋于一致。对中国100万人口以上的19个民族长寿人口研究结果显示,90岁以上长寿老人排序前五位的民族有:回族、壮族、黎族、瑶族、维吾尔族。100岁以上长寿老人排序前五位的民族有:黎族、维吾尔族、瑶族、傣族、回族。长寿人口健康状况研究显示,90岁以上长寿老人22\%生...},
language = {中文;},
number = {04},
urldate = {2020-08-17},
journal = {人口学刊},
author = {樊, 新民},
year = {2013},
note = {ZSCC: 0000010},
keywords = {distribution characteristics, growth rate, health status, sixth census, the Longevity population, ⛔ No DOI found, 健康状况, 分布特点, 增长速度, 第六次人口普查, 长寿人口},
pages = {14--20},
}A 467nW CMOS visual motion sensor with temporal averaging and pixel aggregation. Kim, G., Barangi, M., Foo, Z., Pinckney, N., Bang, S., Blaauw, D., & Sylvester, D. In Solid-State Circuits Conference Digest of Technical Papers (ISSCC), 2013 IEEE International, pages 480–481, 2013. IEEE.
bibtex
bibtex
@inproceedings{kim_467nw_2013,
title = {A 467nW {CMOS} visual motion sensor with temporal averaging and pixel aggregation},
booktitle = {Solid-{State} {Circuits} {Conference} {Digest} of {Technical} {Papers} ({ISSCC}), 2013 {IEEE} {International}},
publisher = {IEEE},
author = {Kim, Gyouho and Barangi, Mahmood and Foo, Zhiyoong and Pinckney, Nathaniel and Bang, Suyoung and Blaauw, David and Sylvester, Dennis},
year = {2013},
keywords = {Important, ⛔ No DOI found},
pages = {480--481}
}Robust random chip ID generation with wide-aperture clocked comparators and maximum likelihood detection. Choi, Y. & Kim, J. In Circuits and Systems (ISCAS), 2013 IEEE International Symposium on, pages 1014–1017, 2013. IEEE.
Paper bibtex
Paper bibtex @inproceedings{choi_robust_2013,
title = {Robust random chip {ID} generation with wide-aperture clocked comparators and maximum likelihood detection},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6572021},
urldate = {2015-01-29TZ},
booktitle = {Circuits and {Systems} ({ISCAS}), 2013 {IEEE} {International} {Symposium} on},
publisher = {IEEE},
author = {Choi, Yunju and Kim, Jaeha},
year = {2013},
keywords = {⛔ No DOI found},
pages = {1014--1017}
}2012 (3)
A 280 nW, 100 kHz, 1-cycle start-up time, on-chip CMOS relaxation oscillator employing a feedforward period control scheme. Tokairin, T., Nose, K., Takeda, K., Noguchi, K., Maeda, T., Kawai, K., & Mizuno, M. In VLSI Circuits Symp. Dig. Tech. Papers, pages 16–17, 2012.
Paper bibtex
Paper bibtex @inproceedings{tokairin_280_2012,
title = {A 280 {nW}, 100 {kHz}, 1-cycle start-up time, on-chip {CMOS} relaxation oscillator employing a feedforward period control scheme},
url = {http://ar.newsmth.net/att/2345676ba8f1b5/oscillator_employing_a_feedforward_period_control_scheme.pdf},
urldate = {2014-11-25TZ},
booktitle = {{VLSI} {Circuits} {Symp}. {Dig}. {Tech}. {Papers}},
author = {Tokairin, Takashi and Nose, Koichi and Takeda, Koichi and Noguchi, Koichiro and Maeda, Tadashi and Kawai, Kazuyoshi and Mizuno, Masayuki},
year = {2012},
keywords = {⛔ No DOI found},
pages = {16--17}
}TARDIS: Time and remanence decay in SRAM to implement secure protocols on embedded devices without clocks. Rahmati, A., Salajegheh, M., Holcomb, D., Sorber, J., Burleson, W. P., & Fu, K. In Proceedings of the 21st USENIX conference on Security symposium, pages 36–36, 2012. USENIX Association.
bibtex
bibtex
@inproceedings{rahmati_tardis:_2012,
title = {{TARDIS}: {Time} and remanence decay in {SRAM} to implement secure protocols on embedded devices without clocks},
shorttitle = {{TARDIS}},
booktitle = {Proceedings of the 21st {USENIX} conference on {Security} symposium},
publisher = {USENIX Association},
author = {Rahmati, Amir and Salajegheh, Mastooreh and Holcomb, Dan and Sorber, Jacob and Burleson, Wayne P. and Fu, Kevin},
year = {2012},
keywords = {⛔ No DOI found},
pages = {36--36}
}A 32.4 ppm/° C 3.2-1.6 V self-chopped relaxation oscillator with adaptive supply generation. Hsiao, K. In VLSI Circuits (VLSIC), 2012 Symposium on, pages 14–15, 2012. IEEE.
Paper bibtex
Paper bibtex @inproceedings{hsiao_32.4_2012,
title = {A 32.4 ppm/° {C} 3.2-1.6 {V} self-chopped relaxation oscillator with adaptive supply generation},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6243766},
urldate = {2014-11-25TZ},
booktitle = {{VLSI} {Circuits} ({VLSIC}), 2012 {Symposium} on},
publisher = {IEEE},
author = {Hsiao, Keng-Jan},
year = {2012},
keywords = {⛔ No DOI found},
pages = {14--15}
}2011 (3)
Multimodal Deep Learning. Ngiam, J., Khosla, A., Kim, M., Nam, J., Lee, H., & Ng, A. Y. In Getoor, L. & Scheffer, T., editors, Proceedings of the 28\textsuperscriptth International Conference on Machine Learning, ICML 2011, Bellevue, Washington, USA, June 28 - July 2, 2011, pages 689–696, 2011. Omnipress.
bibtex
bibtex
A testing methodology for side-channel resistance validation. Gilbert Goodwill, B. J., Jaffe, J., Rohatgi, P., & others In NIST Non-invasive attack testing workshop, 2011.
Paper bibtex
Paper bibtex @inproceedings{gilbert_goodwill_testing_2011,
title = {A testing methodology for side-channel resistance validation},
url = {http://www.rambus.com/wp-content/uploads/2015/08/a-testing-methodology-for-side-channel-resistance-validation.pdf},
urldate = {2017-07-04TZ},
booktitle = {{NIST} {Non}-invasive attack testing workshop},
author = {Gilbert Goodwill, Benjamin Jun and Jaffe, Josh and Rohatgi, Pankaj and {others}},
year = {2011},
keywords = {⛔ No DOI found}
}A true random number generator using time-dependent dielectric breakdown. Liu, N., Pinckney, N., Hanson, S., Sylvester, D., & Blaauw, D. In VLSI Circuits (VLSIC), 2011 Symposium on, pages 216–217, 2011. IEEE.
Paper bibtex
Paper bibtex @inproceedings{liu_true_2011,
title = {A true random number generator using time-dependent dielectric breakdown},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5986112},
urldate = {2015-01-17TZ},
booktitle = {{VLSI} {Circuits} ({VLSIC}), 2011 {Symposium} on},
publisher = {IEEE},
author = {Liu, Nurrachman and Pinckney, Nathaniel and Hanson, Scott and Sylvester, Dennis and Blaauw, David},
year = {2011},
keywords = {⛔ No DOI found},
pages = {216--217}
}2010 (4)
The Landscape of Digital Humanities. Svensson, P. Digital Humanities Quarterly, 2010. 00000
Paper bibtex
Paper bibtex @article{svensson_landscape_2010,
title = {The {Landscape} of {Digital} {Humanities}},
volume = {4},
url = {http://digitalhumanities.org/dhq/vol/4/1/000080/000080.html},
number = {1},
urldate = {2011-08-30},
journal = {Digital Humanities Quarterly},
author = {Svensson, Patrik},
year = {2010},
note = {00000},
keywords = {⛔ No DOI found, 🔍No DOI found},
}QDA Miner 3.2 (with WordStat and Simstat) Distinguishing features and functions. Silver, C. & Lewins, A. 2010. Publisher: University of Surrey
bibtex
bibtex
@article{silver_qda_2010,
title = {{QDA} {Miner} 3.2 (with {WordStat} and {Simstat}) {Distinguishing} features and functions},
author = {Silver, Christina and Lewins, Ann},
year = {2010},
note = {Publisher: University of Surrey},
keywords = {⛔ No DOI found},
}Trust Online: Young Adults' Evaluation of Web Content. Hargittai, E., Fullerton, L., Menchen-Trevino, E., & Thomas, K. Y. International Journal of Communication, April, 2010. 27
abstract bibtex
abstract bibtex
Little of the work on online credibility assessment has considered how the information-seeking process figures into the final evaluation of content people encounter. Using unique data about how a diverse group of young adults looks for and evaluates Web content, our paper makes contributions to existing literature by highlighting factors beyond site features in how users assess credibility. We find that the process by which users arrive at a site is an important component of how they judge the final destination. In particular, search context, branding and routines, and a reliance on those in one’s networks play important roles in online information-seeking and evaluation. We also discuss that users differ considerably in their skills when it comes to judging online content credibility.
@article{hargittai_trust_2010,
title = {Trust {Online}: {Young} {Adults}' {Evaluation} of {Web} {Content}},
volume = {4},
abstract = {Little of the work on online credibility assessment has considered how the information-seeking process figures into the final evaluation of content people encounter. Using unique data about how a diverse group of young adults looks for and evaluates Web content, our paper makes contributions to existing literature by highlighting factors beyond site features in how users assess credibility. We find that the process by which users arrive at a site is an important component of how they judge the final destination. In particular, search context, branding and routines, and a reliance on those in one’s networks play important roles in online information-seeking and evaluation. We also discuss that users differ considerably in their skills when it comes to judging online content credibility.},
journal = {International Journal of Communication},
author = {Hargittai, Eszter and Fullerton, Lindsay and Menchen-Trevino, Ericka and Thomas, Kristin Yates},
month = apr,
year = {2010},
note = {27},
keywords = {⛔ No DOI found},
}2.4 GHz 7mW all-digital PVT-variation tolerant True Random Number Generator in 45nm CMOS. Srinivasan, S., Mathew, S., Ramanarayanan, R., Sheikh, F., Anders, M., Kaul, H., Erraguntla, V., Krishnamurthy, R., & Taylor, G. In VLSI Circuits (VLSIC), 2010 IEEE Symposium on, pages 203–204, 2010. IEEE.
Paper bibtex
Paper bibtex @inproceedings{srinivasan_2.4_2010,
title = {2.4 {GHz} 7mW all-digital {PVT}-variation tolerant {True} {Random} {Number} {Generator} in 45nm {CMOS}},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5560296},
urldate = {2015-01-17TZ},
booktitle = {{VLSI} {Circuits} ({VLSIC}), 2010 {IEEE} {Symposium} on},
publisher = {IEEE},
author = {Srinivasan, Suresh and Mathew, Sanu and Ramanarayanan, Rajaraman and Sheikh, Farhana and Anders, Mark and Kaul, Himanshu and Erraguntla, Vasantha and Krishnamurthy, Ram and Taylor, Greg},
year = {2010},
keywords = {⛔ No DOI found},
pages = {203--204}
}2009 (3)
A 150pW program-and-hold timer for ultra-low-power sensor platforms. Lin, Y., Sylvester, D. M., & Blaauw, D. T. In Solid-State Circuits Conference-Digest of Technical Papers, 2009. ISSCC 2009. IEEE International, pages 326–327, 2009. IEEE.
bibtex
bibtex
@inproceedings{lin_150pw_2009,
title = {A 150pW program-and-hold timer for ultra-low-power sensor platforms},
urldate = {2014-11-25TZ},
booktitle = {Solid-{State} {Circuits} {Conference}-{Digest} of {Technical} {Papers}, 2009. {ISSCC} 2009. {IEEE} {International}},
publisher = {IEEE},
author = {Lin, Yu-Shiang and Sylvester, Dennis M. and Blaauw, David T.},
year = {2009},
keywords = {⛔ No DOI found},
pages = {326--327}
}Hardware Trojan by Hot Carrier Injection. Shiyanovskii, Y., Wolff, F., Papachristou, C., Weyer, D., & Clay, W. arXiv:0906.3832 [cs], June, 2009. arXiv: 0906.3832
Paper abstract bibtex
Paper abstract bibtex This paper discusses how hot carrier injection (HCI) can be exploited to create a trojan that will cause hardware failures. The trojan is produced not via additional logic circuitry but by controlled scenarios that maximize and accelerate the HCI effect in transistors. These scenarios range from manipulating the manufacturing process to varying the internal voltage distribution. This new type of trojan is difficult to test due to its gradual hardware degradation mechanism. This paper describes the HCI effect, detection techniques and discusses the possibility for maliciously induced HCI trojans.
@article{shiyanovskii_hardware_2009,
title = {Hardware {Trojan} by {Hot} {Carrier} {Injection}},
url = {http://arxiv.org/abs/0906.3832},
abstract = {This paper discusses how hot carrier injection (HCI) can be exploited to create a trojan that will cause hardware failures. The trojan is produced not via additional logic circuitry but by controlled scenarios that maximize and accelerate the HCI effect in transistors. These scenarios range from manipulating the manufacturing process to varying the internal voltage distribution. This new type of trojan is difficult to test due to its gradual hardware degradation mechanism. This paper describes the HCI effect, detection techniques and discusses the possibility for maliciously induced HCI trojans.},
urldate = {2016-03-12TZ},
journal = {arXiv:0906.3832 [cs]},
author = {Shiyanovskii, Y. and Wolff, F. and Papachristou, C. and Weyer, D. and Clay, W.},
month = jun,
year = {2009},
note = {arXiv: 0906.3832},
keywords = {Done, Important, ⛔ No DOI found}
}Silicon physical unclonable function resistant to a 1025-trial brute force attack in 90 nm cmos. Stanzione, S. & Iannaccone, G. Power (PW), 30:38, 2009.
Paper bibtex
Paper bibtex @article{stanzione_silicon_2009,
title = {Silicon physical unclonable function resistant to a 1025-trial brute force attack in 90 nm cmos},
volume = {30},
url = {http://www.iannaccone.org/data/P85.pdf},
urldate = {2015-01-29TZ},
journal = {Power (PW)},
author = {Stanzione, S. and Iannaccone, G.},
year = {2009},
keywords = {⛔ No DOI found},
pages = {38}
}2008 (2)
基于二次函数环量分配的液力变矩器叶片设计方法. 刘伟辉, 刘春宝, 汪清波, 马文星, & 褚亚旭 农业机械学报, 2008.
abstract bibtex
abstract bibtex
提出了基于二次函数环量分配的液力变矩器叶片设计方法,并给出了应用实例。计算液力变矩器流道过流断面面积及建立三维实体模型后,与传统的等环量分配叶片设计法相比,在同等叶片加厚条件下,新方法设计出的叶形更合理,流道过流面积变化更为平缓。应用CFD软件计算了用2种方法设计叶片的液力变矩器的三维流场,基于三维流场数值解计算出液力变矩器的特性,并与传统设计方法设计的变矩器特性进行了对比分析。
@article{LiuWeiHui2008,
title = {基于二次函数环量分配的液力变矩器叶片设计方法},
issn = {1000-1298},
abstract = {提出了基于二次函数环量分配的液力变矩器叶片设计方法,并给出了应用实例。计算液力变矩器流道过流断面面积及建立三维实体模型后,与传统的等环量分配叶片设计法相比,在同等叶片加厚条件下,新方法设计出的叶形更合理,流道过流面积变化更为平缓。应用CFD软件计算了用2种方法设计叶片的液力变矩器的三维流场,基于三维流场数值解计算出液力变矩器的特性,并与传统设计方法设计的变矩器特性进行了对比分析。},
language = {中文;},
number = {08},
journal = {农业机械学报},
author = {{刘伟辉} and {刘春宝} and {汪清波} and {马文星} and {褚亚旭}},
year = {2008},
keywords = {Blade design, Distribution of momentum, Quadratic function, Torque converter, ⛔ No DOI found, 二次函数, 叶片设计, 液力变矩器, 环量分配},
pages = {145--148},
}A temperature-compensated low-noise digitally-controlled crystal oscillator for multi-standard applications. Tsai, M., Yeh, C., Cho, Y., Ke, L., Chen, P., & Dehng, G. In Radio Frequency Integrated Circuits Symposium, 2008. RFIC 2008. IEEE, pages 533–536, 2008. IEEE.
Paper bibtex
Paper bibtex @inproceedings{tsai_temperature-compensated_2008,
title = {A temperature-compensated low-noise digitally-controlled crystal oscillator for multi-standard applications},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4561493},
urldate = {2014-11-26TZ},
booktitle = {Radio {Frequency} {Integrated} {Circuits} {Symposium}, 2008. {RFIC} 2008. {IEEE}},
publisher = {IEEE},
author = {Tsai, Ming-Da and Yeh, Chih-Wei and Cho, Yi-Hsien and Ke, Ling-Wei and Chen, Pei-Wei and Dehng, Guang-Kaai},
year = {2008},
keywords = {⛔ No DOI found},
pages = {533--536}
}2007 (2)
Active Hardware Metering for Intellectual Property Protection and Security. Alkabani, Y. & Koushanfar, F. In USENIX security symposium, pages 291–306, 2007.
bibtex
bibtex
@inproceedings{alkabani_active_2007,
title = {Active {Hardware} {Metering} for {Intellectual} {Property} {Protection} and {Security}.},
booktitle = {{USENIX} security symposium},
author = {Alkabani, Yousra and Koushanfar, Farinaz},
year = {2007},
keywords = {To Read, ⛔ No DOI found},
pages = {291--306}
}ISSCC 2007/SESSION 22/DIGITAL CIRCUIT INNOVATIONS/22.5. Su, Y., Holleman, J., & Otis, B. 2007.
Paper bibtex
Paper bibtex @article{su_isscc_2007,
title = {{ISSCC} 2007/{SESSION} 22/{DIGITAL} {CIRCUIT} {INNOVATIONS}/22.5},
url = {http://web.eecs.utk.edu/research/isis/papers/isscc_ui2c07.pdf},
urldate = {2015-01-29TZ},
author = {Su, Y. and Holleman, J. and Otis, B.},
year = {2007},
keywords = {⛔ No DOI found}
}2006 (2)
Concatenative Synthesis Using Score-Aligned Transcriptions. Dannenberg, R. B. In ICMC, 2006. Michigan Publishing.
Paper bibtex
Paper bibtex State of the Art in True Random Number Generation. Sunar, B. 2006.
Paper bibtex
Paper bibtex @article{sunar_state_2006,
title = {State of the {Art} in {True} {Random} {Number} {Generation}},
url = {http://www.ipam.ucla.edu/publications/scws4/scws4_6650.pdf},
urldate = {2015-01-17TZ},
author = {Sunar, Berk},
year = {2006},
keywords = {⛔ No DOI found}
}2005 (2)
DigEuLit–a European framework for digital literacy: a progress report. Martin, A. Journal of eLiteracy, 2:130–136, 2005. Publisher: Citeseer
bibtex
bibtex
@article{martin_digeuliteuropean_2005,
title = {{DigEuLit}–a {European} framework for digital literacy: a progress report},
volume = {2},
journal = {Journal of eLiteracy},
author = {Martin, Allan},
year = {2005},
note = {Publisher: Citeseer},
keywords = {⛔ No DOI found},
pages = {130--136},
}Audio Analogies: Creating New Music from an Existing Performance by concatenative synthesis. Simon, I., Basu, S., Salesin, D., & Agrawala, M. In ICMC, 2005. Michigan Publishing.
Paper bibtex
Paper bibtex 2004 (5)
Restoration of West Coast Renosterveld: facilitating the return of a highly threatened vegetation type. Krug, C B, Krug, R M, Iponga, D M, Walton, B A, Milton, S J, & Shiponeni, N N 2004. 00004
abstract bibtex
abstract bibtex
West Coast Renosterveld, a Mediterranean-type shrubland vegetation within the Cape Floral Region in South Africa, is typically associated with fertile shale soils in low-lying areas. This association with fertile soils has resulted in extensive transformation of the vegetation through human intervention, leaving less than 5% of the extent of the original vegetation. The remaining fragments are isolated, within a matrix of agricultural and urban areas, and the vegetation is degraded.
@article{krug_restoration_2004,
title = {Restoration of {West} {Coast} {Renosterveld}: facilitating the return of a highly threatened vegetation type},
copyright = {All rights reserved},
abstract = {West Coast Renosterveld, a Mediterranean-type shrubland vegetation within the Cape Floral Region in South Africa, is typically associated with fertile shale soils in low-lying areas. This association with fertile soils has resulted in extensive transformation of the vegetation through human intervention, leaving less than 5\% of the extent of the original vegetation. The remaining fragments are isolated, within a matrix of agricultural and urban areas, and the vegetation is degraded.},
language = {en},
author = {Krug, C B and Krug, R M and Iponga, D M and Walton, B A and Milton, S J and Shiponeni, N N},
year = {2004},
note = {00004},
keywords = {MP - Proceedings, My Publications, ⛔ No DOI found},
pages = {12}
}Reconstructing West Coast Renosterveld: past and present ecological processes in a Mediterranean shrubland of South Africa. Krug, R. M., Krug, C B, Midoko-Iponga, D., Walton, B A, Milton, S J, Newton, I P, Farley, N, & Shiponeni, N N Ecology, Conservation and Management of Mediterranean Ecosystems. Proceedings of the 10th International Conference on Mediterranean Ecosystems, April 25 – May 1, 2204, Rhodes, Greece., 2004. 00009
Paper bibtex
Paper bibtex @article{krug_reconstructing_2004,
title = {Reconstructing {West} {Coast} {Renosterveld}: past and present ecological processes in a {Mediterranean} shrubland of {South} {Africa}},
copyright = {All rights reserved},
url = {http://www.uaeco.edu.gr/medecos/presentations/Tuesday/1s/Rainer%20M%20Krug.pdf},
number = {1999},
journal = {Ecology, Conservation and Management of Mediterranean Ecosystems. Proceedings of the 10th International Conference on Mediterranean Ecosystems, April 25 – May 1, 2204, Rhodes, Greece.},
author = {Krug, Rainer M. and Krug, C B and Midoko-Iponga, Donald and Walton, B A and Milton, S J and Newton, I P and Farley, N and Shiponeni, N N},
year = {2004},
note = {00009},
keywords = {MP - Proceedings, My Publications, ⛔ No DOI found},
pages = {1--12}
}Diffusion tensor imaging of cerebral white matter: a pictorial review of physics, fiber tract anatomy, and tumor imaging patterns. Jellison, B., Field, A., Medow, J., Lazar, M., Salamat, M., & Alexander, A. American Journal of Neuroradiology, 25(3):356–369, 2004.
Paper bibtex
Paper bibtex @article{jellison_diffusion_2004,
title = {Diffusion tensor imaging of cerebral white matter: a pictorial review of physics, fiber tract anatomy, and tumor imaging patterns},
volume = {25},
url = {http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?cmd=Retrieve&db=PubMed&dopt=Citation&list_uids=15037456},
number = {3},
journal = {American Journal of Neuroradiology},
author = {Jellison, B.J. and Field, A.S. and Medow, J. and Lazar, M. and Salamat, M.S. and Alexander, A.L.},
year = {2004},
keywords = {\#nosource, *Diffusion Magnetic Resonance Imaging, *Image Processing, Computer-Assisted, Brain Mapping, Brain Neoplasms/diagnosis/pathology/surgery, Brain/*pathology/surgery, Computer Graphics, Dominance, Cerebral/physiology, Humans, Nerve Fibers, Myelinated/*pathology, Neural Pathways/pathology/surgery, Physics, ⛔ No DOI found},
pages = {356--369},
}Once again: The perception of piano touch and tone. Can touch audibly change piano sound independently of intensity?. Goebl, W., Bresin, R., & Galembo, A. In Proceedings of the international symposium on musical acoustics, 2004.
bibtex
bibtex
Copilot-a Coprocessor-based Kernel Runtime Integrity Monitor. Petroni Jr, N. L., Fraser, T., Molina, J., & Arbaugh, W. A. In USENIX Security Symposium, pages 179–194, 2004. San Diego, USA.
bibtex
bibtex
@inproceedings{petroni_jr_copilot-coprocessor-based_2004,
title = {Copilot-a {Coprocessor}-based {Kernel} {Runtime} {Integrity} {Monitor}.},
booktitle = {{USENIX} {Security} {Symposium}},
publisher = {San Diego, USA},
author = {Petroni Jr, Nick L. and Fraser, Timothy and Molina, Jesus and Arbaugh, William A.},
year = {2004},
keywords = {⛔ No DOI found},
pages = {179--194}
}2003 (2)
三种湍流模式数值模拟直角弯管内三维分离流动的比较. 丁珏 & 翁培奋 计算物理, 20(5):386–390, 2003.
bibtex
bibtex
@article{DingJue2003SanChong,
title = {三种湍流模式数值模拟直角弯管内三维分离流动的比较},
volume = {20},
issn = {1001-246X},
number = {5},
journal = {计算物理},
author = {{丁珏} and {翁培奋}},
year = {2003},
keywords = {⛔ No DOI found},
pages = {386--390},
}Secure routing in wireless sensor networks: Attacks and countermeasures. Karlof, C. & Wagner, D. Ad hoc networks, 1(2):293–315, 2003.
Paper bibtex
Paper bibtex @article{karlof_secure_2003,
title = {Secure routing in wireless sensor networks: {Attacks} and countermeasures},
volume = {1},
shorttitle = {Secure routing in wireless sensor networks},
url = {http://www.sciencedirect.com/science/article/pii/S1570870503000088},
number = {2},
urldate = {2016-01-14TZ},
journal = {Ad hoc networks},
author = {Karlof, Chris and Wagner, David},
year = {2003},
keywords = {⛔ No DOI found},
pages = {293--315}
}2002 (3)
The Performance Worm: Real Time Visualisation of Expression Based on Langner's Tempo-loudness Animation. Dixon, S., Goebl, W., & Widmer, G. In ICMC, 2002.
bibtex
bibtex
Automatic Real-time Extraction of Musical Expression. Friberg, A., Schoonderwaldt, E., Juslin, P., & Bresin, R. In Proceedings of the 2002 International Computer Music Conference, ICMC 2002, Gothenburg, Sweden, September 16-21, 2002, 2002. Michigan Publishing.
Paper bibtex
Paper bibtex Design of an on&# 8211; chip random number generator using metastability. Kinniment, D. J. & Chester, E. G. In Solid-State Circuits Conference, 2002. ESSCIRC 2002. Proceedings of the 28th European, pages 595–598, 2002. IEEE.
Paper bibtex
Paper bibtex @inproceedings{kinniment_design_2002,
title = {Design of an on\&\# 8211; chip random number generator using metastability},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1471597},
urldate = {2015-01-17TZ},
booktitle = {Solid-{State} {Circuits} {Conference}, 2002. {ESSCIRC} 2002. {Proceedings} of the 28th {European}},
publisher = {IEEE},
author = {Kinniment, D. J. and Chester, E. G.},
year = {2002},
keywords = {⛔ No DOI found},
pages = {595--598}
}2000 (1)
A noise-based IC random number generator for applications in cryptography. Petrie, C. S. & Connelly, J. A. Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on, 47(5):615–621, 2000.
Paper bibtex
Paper bibtex @article{petrie_noise-based_2000,
title = {A noise-based {IC} random number generator for applications in cryptography},
volume = {47},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=847868},
number = {5},
urldate = {2015-01-17TZ},
journal = {Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on},
author = {Petrie, Craig S. and Connelly, J. Alvin},
year = {2000},
keywords = {⛔ No DOI found},
pages = {615--621}
}1999 (4)
Bro: a system for detecting network intruders in real-time. Paxson, V. Computer networks, 31(23):2435–2463, 1999.
bibtex 1 download
bibtex 1 download
@article{paxson_bro:_1999,
title = {Bro: a system for detecting network intruders in real-time},
volume = {31},
shorttitle = {Bro},
number = {23},
journal = {Computer networks},
author = {Paxson, Vern},
year = {1999},
keywords = {⛔ No DOI found},
pages = {2435--2463}
}Snort - Lightweight Intrusion Detection for Networks. Roesch, M. In Proceedings of the 13th USENIX Conference on System Administration, of LISA '99, pages 229–238, Berkeley, CA, USA, 1999. USENIX Association. event-place: Seattle, Washington
Paper abstract bibtex
Paper abstract bibtex Network intrusion detection systems (NIDS) are an important part of any network security architecture. They provide a layer of defense which monitors network traffic for predefined suspicious activity or patterns, and alert system administrators when potential hostile traffic is detected. Commercial NIDS have many differences, but Information Systems departments must face the commonalities that they share such as significant system footprint, complex deployment and high monetary cost. Snort was designed to address these issues.
@inproceedings{roesch_snort_1999,
address = {Berkeley, CA, USA},
series = {{LISA} '99},
title = {Snort - {Lightweight} {Intrusion} {Detection} for {Networks}},
url = {http://dl.acm.org/citation.cfm?id=1039834.1039864},
abstract = {Network intrusion detection systems (NIDS) are an important part of any network security architecture. They provide a layer of defense which monitors network traffic for predefined suspicious activity or patterns, and alert system administrators when potential hostile traffic is detected. Commercial NIDS have many differences, but Information Systems departments must face the commonalities that they share such as significant system footprint, complex deployment and high monetary cost. Snort was designed to address these issues.},
urldate = {2019-04-30TZ},
booktitle = {Proceedings of the 13th {USENIX} {Conference} on {System} {Administration}},
publisher = {USENIX Association},
author = {Roesch, Martin},
year = {1999},
note = {event-place: Seattle, Washington},
keywords = {⛔ No DOI found},
pages = {229--238}
}The Intel random number generator. Jun, B. & Kocher, P. Cryptography Research Inc. white paper, 1999.
Paper bibtex
Paper bibtex @article{jun_intel_1999,
title = {The {Intel} random number generator},
url = {http://www.kemt-old.fei.tuke.sk/predmety/KEMT414_AK/_materialy/Info/RND_Generatory/IntelRNG.pdf},
urldate = {2015-01-17TZ},
journal = {Cryptography Research Inc. white paper},
author = {Jun, Benjamin and Kocher, Paul},
year = {1999},
keywords = {⛔ No DOI found}
}Design Principles for Tamper-Resistant Smartcard Processors. Kömmerling, O. & Kuhn, M. G. Smartcard, 99:9–20, 1999.
Paper bibtex
Paper bibtex @article{kommerling_design_1999,
title = {Design {Principles} for {Tamper}-{Resistant} {Smartcard} {Processors}.},
volume = {99},
url = {http://static.usenix.org/events/smartcard99/full_papers/kommerling/kommerling.pdf},
urldate = {2016-07-14TZ},
journal = {Smartcard},
author = {Kömmerling, Oliver and Kuhn, Markus G.},
year = {1999},
keywords = {⛔ No DOI found},
pages = {9--20}
}1998 (2)
A Hidden Markov Model Framework for Video Segmentation Using Audio and Image Features. Boreczky, J. S. & Wilcox, L. D. In Acoustics, Speech and Signal Processing, 1998. Proceedings of the 1998 IEEE International Conference on, volume 6, pages 3741–3744, 1998. IEEE.
bibtex
bibtex
Eye movements, attention and trans-saccadic memory. Irwin, D. & Gordon, R. Visual Cognition, 5:127155, 1998.
bibtex
bibtex
@article{irwin_eye_1998,
title = {Eye movements, attention and trans-saccadic memory},
volume = {5},
journal = {Visual Cognition},
author = {Irwin, D.E. and Gordon, R.D.},
year = {1998},
keywords = {\#nosource, ⛔ No DOI found},
pages = {127155},
}1997 (1)
An integrated analog/digital random noise source. Holman, W. T., Connelly, J. A., & Dowlatabadi, A. B. Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on, 44(6):521–528, 1997.
Paper bibtex
Paper bibtex @article{holman_integrated_1997,
title = {An integrated analog/digital random noise source},
volume = {44},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=586025},
number = {6},
urldate = {2015-01-17TZ},
journal = {Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on},
author = {Holman, W. Timothy and Connelly, J. Alvin and Dowlatabadi, Ahmad B.},
year = {1997},
keywords = {⛔ No DOI found},
pages = {521--528}
}1996 (1)
Wirkung der raeumlichen Heterogenitaet innerhalb eines Habitats auf die mittlere Ueberlebensdauer einer Zauneidechsen-Population. Krug, R M, Johst, K, Wissel, C, & Maertens, B Verhandlungen der Gesellschaft fuer Oekologie, 1996. 00000
bibtex
bibtex
@article{krug_wirkung_1996,
title = {Wirkung der raeumlichen {Heterogenitaet} innerhalb eines {Habitats} auf die mittlere {Ueberlebensdauer} einer {Zauneidechsen}-{Population}},
copyright = {All rights reserved},
journal = {Verhandlungen der Gesellschaft fuer Oekologie},
author = {Krug, R M and Johst, K and Wissel, C and Maertens, B},
year = {1996},
note = {00000},
keywords = {MP - Proceedings, My Publications, ⛔ No DOI found}
}1989 (1)
液力变矩器叶片设计和特性计算的通用程序及其应用. 马文星, 罗邦杰, & 吴淑荣 汽车技术, 1989.
abstract bibtex
abstract bibtex
给出了液力变矩器叶片设计和特性计算的通用程序,提出了在计算机上实现加厚叶片设计和数学模型建立的方法.所给通用程序不仅具有计算和绘图能力,而且可进行多方案比较.介绍了利用该程序对DFZFB-323型变矩器进行的多方案叶片设计和特性计算,并与试验结果作了对比.
@article{__1989,
title = {液力变矩器叶片设计和特性计算的通用程序及其应用},
abstract = {给出了液力变矩器叶片设计和特性计算的通用程序,提出了在计算机上实现加厚叶片设计和数学模型建立的方法.所给通用程序不仅具有计算和绘图能力,而且可进行多方案比较.介绍了利用该程序对DFZFB-323型变矩器进行的多方案叶片设计和特性计算,并与试验结果作了对比.},
number = {12},
journal = {汽车技术},
author = {马文星 and 罗邦杰 and 吴淑荣},
year = {1989},
keywords = {⛔ No DOI found, 变矩器-叶片;设计计算;计算机应用},
pages = {1--4},
}1988 (1)
应用激光多普勒流速计测定液力变矩器内部流场的探讨. 过学迅 工程机械, 1988.
Paper abstract bibtex
Paper abstract bibtex 介绍了激光多普勒流速计应用于液力变矩器内部流场测量的意义、测量原理,以及用于测定一般叶轮机械流场的光学系统组成;介绍了测量中的一些问题和应采取的措施,以及使用...
@article{__1988,
title = {应用激光多普勒流速计测定液力变矩器内部流场的探讨},
url = {http://www.cqvip.com/QK/91771X/198802/71677465495756564850484948.html},
abstract = {介绍了激光多普勒流速计应用于液力变矩器内部流场测量的意义、测量原理,以及用于测定一般叶轮机械流场的光学系统组成;介绍了测量中的一些问题和应采取的措施,以及使用...},
number = {2},
urldate = {2018-09-19},
journal = {工程机械},
author = {{过学迅}},
year = {1988},
keywords = {⛔ No DOI found},
pages = {41--45+62},
}undefined (14)
Bringing Science to Management: using Simulation- and Scenario-Based Approaches to Guide Decision Making in Invasive Species Management — one tool which can do both. Krug, R. M In 00000
bibtex
bibtex
@inproceedings{krug_bringing_nodate,
title = {Bringing {Science} to {Management}: using {Simulation}- and {Scenario}-{Based} {Approaches} to {Guide} {Decision} {Making} in {Invasive} {Species} {Management} — one tool which can do both},
copyright = {All rights reserved},
author = {Krug, Rainer M},
note = {00000},
keywords = {MP - Presentations, My Publications, ⛔ No DOI found}
}A MATLAB GUI for the analysis and reconstruction of signal and image data of a SAFT-based 3D Ultrasound Computer Tomograph. Hopp, T., Schwarzenberg, G. F, Zapf, M., & Ruiter, N. V 00004
abstract bibtex
abstract bibtex
At Forschungszentrum Karlsruhe, a new imaging system for early diagnosis of breast cancer is currently developed. The 3D Ultrasound Computer Tomograph (USCT) consists of approximately 2000 ultrasound transducers, which produce 3.5 million A-scans (amplitude scans) summing up to 20 GB of raw data for one image. The large number of A-scans, the large amount of data and the complex relationship between raw data and reconstructed image makes analysis, understanding and further development difficult for the scientists and especially for new employees and students. For this reason, an interactive graphical user interface (GUI) was developed using MATLAB. It integrates existent analysis methods and is easily extendable with new functionality via a plugin concept. The software provides several visualization functions for the raw data, the reconstructed 3D images, the USCT aperture and the relationships between them. This approaches demonstrate that MATLAB is not only applicable as programming language for numerical problems, but also adequate for representing complex systems by a GUI. It has a large benefit for the working group as it is used as common development platform: The plugin concept is widely used to integrate new analysis methods and share them with the rest of the scientists. The GUI and the visualization of the complex relationships of the USCT reduces the training period for new employees and students. An evaluation of the usability shows that the users evaluated the user interface to be very helpful, clearly arranged and beneficial for a better understanding of the coherencies of the USCT system.
@article{hopp_matlab_nodate,
title = {A {MATLAB} {GUI} for the analysis and reconstruction of signal and image data of a {SAFT}-based {3D} {Ultrasound} {Computer} {Tomograph}},
abstract = {At Forschungszentrum Karlsruhe, a new imaging system for early diagnosis of breast cancer is currently developed. The 3D Ultrasound Computer Tomograph (USCT) consists of approximately 2000 ultrasound transducers, which produce 3.5 million A-scans (amplitude scans) summing up to 20 GB of raw data for one image. The large number of A-scans, the large amount of data and the complex relationship between raw data and reconstructed image makes analysis, understanding and further development difficult for the scientists and especially for new employees and students. For this reason, an interactive graphical user interface (GUI) was developed using MATLAB. It integrates existent analysis methods and is easily extendable with new functionality via a plugin concept. The software provides several visualization functions for the raw data, the reconstructed 3D images, the USCT aperture and the relationships between them. This approaches demonstrate that MATLAB is not only applicable as programming language for numerical problems, but also adequate for representing complex systems by a GUI. It has a large benefit for the working group as it is used as common development platform: The plugin concept is widely used to integrate new analysis methods and share them with the rest of the scientists. The GUI and the visualization of the complex relationships of the USCT reduces the training period for new employees and students. An evaluation of the usability shows that the users evaluated the user interface to be very helpful, clearly arranged and beneficial for a better understanding of the coherencies of the USCT system.},
language = {en},
author = {Hopp, Torsten and Schwarzenberg, Gregor F and Zapf, Michael and Ruiter, Nicole V},
note = {00004},
keywords = {⛔ No DOI found},
pages = {11},
}Variability Modeling and Statistical Parameter Extraction for CMOS Devices. Qian, K.
bibtex
bibtex
@article{qian_variability_nodate,
title = {Variability {Modeling} and {Statistical} {Parameter} {Extraction} for {CMOS} {Devices}},
language = {en},
author = {Qian, Kun},
keywords = {⛔ No DOI found},
pages = {158}
}On the Feasibility of Side-Channel Attacks with Brain-Computer Interfaces. Martinovic, I., Davies, D., Frank, M., Perito, D., Ros, T., & Song, D.
abstract bibtex
abstract bibtex
Brain computer interfaces (BCI) are becoming increasingly popular in the gaming and entertainment industries. Consumer-grade BCI devices are available for a few hundred dollars and are used in a variety of applications, such as video games, hands-free keyboards, or as an assistant in relaxation training. There are application stores similar to the ones used for smart phones, where application developers have access to an API to collect data from the BCI devices.
@article{martinovic_feasibility_nodate,
title = {On the {Feasibility} of {Side}-{Channel} {Attacks} with {Brain}-{Computer} {Interfaces}},
abstract = {Brain computer interfaces (BCI) are becoming increasingly popular in the gaming and entertainment industries. Consumer-grade BCI devices are available for a few hundred dollars and are used in a variety of applications, such as video games, hands-free keyboards, or as an assistant in relaxation training. There are application stores similar to the ones used for smart phones, where application developers have access to an API to collect data from the BCI devices.},
language = {en},
author = {Martinovic, Ivan and Davies, Doug and Frank, Mario and Perito, Daniele and Ros, Tomas and Song, Dawn},
keywords = {⛔ No DOI found},
pages = {16}
}Evaluation of On-chip Decoupling Capacitor’s Effect on AES Cryptographic Circuit. Nakai, T., Shiozaki, M., Kubota, T., & Fujino, T.
abstract bibtex
abstract bibtex
Power Analysis (PA) attack and Electromagnetic Analysis (EMA) attack reveal a secret key on cryptographic circuits by measuring power variation and electromagnetic radiation during the cryptographic operations, respectively. Inserting decoupling capacitors reduces a PA leak; however, a resistance against EMA attack is not well-known. We fabricated Advanced Encryption Standard (AES) cryptographic chips with and without on-chip decoupling capacitors, and evaluated the resistance against PA and EMA attack. This paper presents that the on-chip decoupling capacitors make vulnerable to EMA attack using Hamming-weight model.
@article{nakai_evaluation_nodate,
title = {Evaluation of {On}-chip {Decoupling} {Capacitor}’s {Effect} on {AES} {Cryptographic} {Circuit}},
abstract = {Power Analysis (PA) attack and Electromagnetic Analysis (EMA) attack reveal a secret key on cryptographic circuits by measuring power variation and electromagnetic radiation during the cryptographic operations, respectively. Inserting decoupling capacitors reduces a PA leak; however, a resistance against EMA attack is not well-known. We fabricated Advanced Encryption Standard (AES) cryptographic chips with and without on-chip decoupling capacitors, and evaluated the resistance against PA and EMA attack. This paper presents that the on-chip decoupling capacitors make vulnerable to EMA attack using Hamming-weight model.},
author = {Nakai, Tsunato and Shiozaki, Mitsuru and Kubota, Takaya and Fujino, Takeshi},
keywords = {⛔ No DOI found},
pages = {6}
}Sancus: Low-cost trustworthy extensible networked devices with a zero-software Trusted Computing Base. Noorman, J., Agten, P., Daniels, W., Strackx, R., Herrewege, A. V., Huygens, C., Preneel, B., Verbauwhede, I., & Piessens, F.
abstract bibtex
abstract bibtex
In this paper we propose Sancus, a security architecture for networked embedded devices. Sancus supports extensibility in the form of remote (even third-party) software installation on devices while maintaining strong security guarantees. More specifically, Sancus can remotely attest to a software provider that a specific software module is running uncompromised, and can authenticate messages from software modules to software providers. Software modules can securely maintain local state, and can securely interact with other software modules that they choose to trust. The most distinguishing feature of Sancus is that it achieves these security guarantees without trusting any infrastructural software on the device. The Trusted Computing Base (TCB) on the device is only the hardware. Moreover, the hardware cost of Sancus is low. We describe the design of Sancus, and develop and evaluate a prototype FPGA implementation of a Sancusenabled device. The prototype extends an MSP430 processor with hardware support for the memory access control and cryptographic functionality required to run Sancus. We also develop a C compiler that targets our device and that can compile standard C modules to Sancus protected software modules.
@article{noorman_sancus:_nodate,
title = {Sancus: {Low}-cost trustworthy extensible networked devices with a zero-software {Trusted} {Computing} {Base}},
abstract = {In this paper we propose Sancus, a security architecture for networked embedded devices. Sancus supports extensibility in the form of remote (even third-party) software installation on devices while maintaining strong security guarantees. More specifically, Sancus can remotely attest to a software provider that a specific software module is running uncompromised, and can authenticate messages from software modules to software providers. Software modules can securely maintain local state, and can securely interact with other software modules that they choose to trust. The most distinguishing feature of Sancus is that it achieves these security guarantees without trusting any infrastructural software on the device. The Trusted Computing Base (TCB) on the device is only the hardware. Moreover, the hardware cost of Sancus is low. We describe the design of Sancus, and develop and evaluate a prototype FPGA implementation of a Sancusenabled device. The prototype extends an MSP430 processor with hardware support for the memory access control and cryptographic functionality required to run Sancus. We also develop a C compiler that targets our device and that can compile standard C modules to Sancus protected software modules.},
language = {en},
author = {Noorman, Job and Agten, Pieter and Daniels, Wilfried and Strackx, Raoul and Herrewege, Anthony Van and Huygens, Christophe and Preneel, Bart and Verbauwhede, Ingrid and Piessens, Frank},
keywords = {⛔ No DOI found},
pages = {16}
}A Full-mode FME VLSI Architecture Based on 8x8/4x4 Adaptive Hadamard Transform For QFHD H.264/AVC Encoder. Liu, J., Chen, X., Fan, Y., & Zeng, X.
abstract bibtex
abstract bibtex
Adaptive Block-size Transform (ABT) has been added to H.264/AVC standard with the Fidelity Range Extension. In this paper, we apply this ABT concept to our FME design and propose a full-mode FME architecture based on 8x8/4x4 adaptive Hadamard Transform. This technique can avoid unifying all variable block-size blocks into 4x4-size blocks and improve the encoding performance. We also exploit the linearity of Hadamard Transform in quarter-pel refinement and decrease the cycles caused by the second long search process. In architecture level, we employ two interpolating engines that can support 8-pel and 4-pel input to time-share one SATD (Sum of Absolute Hadamard Transform) Generator. These strategies can increase parallelism and reduce the cycles efficiently. Besides, this design can support full modes, which guarantees the encoding performance. Experimental results show that our design can achieve real-time processing for QFHD@30fps at the operation frequency of 320MHz with 444.6K gates hardware.
@article{liu_full-mode_nodate,
title = {A {Full}-mode {FME} {VLSI} {Architecture} {Based} on 8x8/4x4 {Adaptive} {Hadamard} {Transform} {For} {QFHD} {H}.264/{AVC} {Encoder}},
abstract = {Adaptive Block-size Transform (ABT) has been added to H.264/AVC standard with the Fidelity Range Extension. In this paper, we apply this ABT concept to our FME design and propose a full-mode FME architecture based on 8x8/4x4 adaptive Hadamard Transform. This technique can avoid unifying all variable block-size blocks into 4x4-size blocks and improve the encoding performance. We also exploit the linearity of Hadamard Transform in quarter-pel refinement and decrease the cycles caused by the second long search process. In architecture level, we employ two interpolating engines that can support 8-pel and 4-pel input to time-share one SATD (Sum of Absolute Hadamard Transform) Generator. These strategies can increase parallelism and reduce the cycles efficiently. Besides, this design can support full modes, which guarantees the encoding performance. Experimental results show that our design can achieve real-time processing for QFHD@30fps at the operation frequency of 320MHz with 444.6K gates hardware.},
language = {en},
author = {Liu, Jialiang and Chen, Xinhua and Fan, Yibo and Zeng, Xiaoyang},
keywords = {⛔ No DOI found},
pages = {6}
}ARMing TrustZone with User-space Enclaves. Brasser, F., Gens, D., Jauernig, P., Sadeghi, A., & Stapf, E.
abstract bibtex
abstract bibtex
ARM TrustZone is one of the most widely deployed security architecture providing Trusted Execution Environments (TEEs). Unfortunately, its usage and potential benefits for application developers and end users are largely limited due to restricted deployment policies imposed by device vendors. Restriction is enforced since every Trusted App (TA) increases the TEE’s attack surface: any vulnerable or malicious TA can compromise the system’s security. Hence, deploying a TA requires mutual trust between device vendor and application developer, incurring high costs for both. Vendors work around this by offering interfaces to selected TEE functionalities, however, these are not sufficient to securely implement advanced mobile services like banking. Extensive discussion of Intel’s SGX technology in academia and industry has unveiled the demand for an unrestricted use of TEEs, yet no comparable security architecture for mobile devices exists to this day.
@article{brasser_arming_nodate,
title = {{ARMing} {TrustZone} with {User}-space {Enclaves}},
abstract = {ARM TrustZone is one of the most widely deployed security architecture providing Trusted Execution Environments (TEEs). Unfortunately, its usage and potential benefits for application developers and end users are largely limited due to restricted deployment policies imposed by device vendors. Restriction is enforced since every Trusted App (TA) increases the TEE’s attack surface: any vulnerable or malicious TA can compromise the system’s security. Hence, deploying a TA requires mutual trust between device vendor and application developer, incurring high costs for both. Vendors work around this by offering interfaces to selected TEE functionalities, however, these are not sufficient to securely implement advanced mobile services like banking. Extensive discussion of Intel’s SGX technology in academia and industry has unveiled the demand for an unrestricted use of TEEs, yet no comparable security architecture for mobile devices exists to this day.},
language = {en},
author = {Brasser, Ferdinand and Gens, David and Jauernig, Patrick and Sadeghi, Ahmad-Reza and Stapf, Emmanuel},
keywords = {⛔ No DOI found},
pages = {15}
}On the Formal Foundations of PUFs and Related Primitives. Rührmair, U.
bibtex
bibtex
@article{ruhrmair_formal_nodate,
title = {On the {Formal} {Foundations} of {PUFs} and {Related} {Primitives}},
language = {en},
author = {Rührmair, Ulrich},
keywords = {⛔ No DOI found},
pages = {245}
}Stochastic Architectures for Probabilistic Computation. Jonas, E. M
abstract bibtex
abstract bibtex
The brain interprets ambiguous sensory information faster and more reliably than modern computers, using neurons that are slower and less reliable than logic gates. But Bayesian inference, which is at the heart of many models for sensory information processing and cognition, as well as many machine intelligence systems, appears computationally challenging, even given modern transistor speeds and energy budgets. The computational principles and structures needed to narrow this gap are unknown. Here I show how to build fast Bayesian computing machines using intentionally stochastic, digital parts, narrowing this efficiency gap by multiple orders of magnitude.
@article{jonas_stochastic_nodate,
title = {Stochastic {Architectures} for {Probabilistic} {Computation}},
abstract = {The brain interprets ambiguous sensory information faster and more reliably than modern computers, using neurons that are slower and less reliable than logic gates. But Bayesian inference, which is at the heart of many models for sensory information processing and cognition, as well as many machine intelligence systems, appears computationally challenging, even given modern transistor speeds and energy budgets. The computational principles and structures needed to narrow this gap are unknown. Here I show how to build fast Bayesian computing machines using intentionally stochastic, digital parts, narrowing this efficiency gap by multiple orders of magnitude.},
language = {en},
author = {Jonas, Eric M},
keywords = {⛔ No DOI found},
pages = {111}
}Probabilistic CMOS (PCMOS) Logic for Nanoscale Circuit Design. Palem, K. V, Korkmaz, P., Yeo, K., & Kong, Z.
bibtex
bibtex
@article{palem_probabilistic_nodate,
title = {Probabilistic {CMOS} ({PCMOS}) {Logic} for {Nanoscale} {Circuit} {Design}},
language = {en},
author = {Palem, Krishna V and Korkmaz, Pinar and Yeo, Kiat-Seng and Kong, Zhi-Hui},
keywords = {⛔ No DOI found},
pages = {15}
}Breakthrough silicon scanning discovers backdoor in military chip (DRAFT of 05 March 2012). Skorobogatov, S. & Woods, C.
Paper bibtex
Paper bibtex @article{skorobogatov_breakthrough_nodate,
title = {Breakthrough silicon scanning discovers backdoor in military chip ({DRAFT} of 05 {March} 2012)},
url = {http://karbalus.free.fr/sat/smartcards/Silicon_scan_draft.pdf},
urldate = {2016-07-24TZ},
author = {Skorobogatov, Sergei and Woods, Christopher},
keywords = {⛔ No DOI found}
}A Memory Encryption Engine Suitable for General Purpose Processors. Gueron, S.
abstract bibtex
abstract bibtex
Cryptographic protection of memory is an essential ingredient for any technology that allows a closed computing system to run software in a trustworthy manner and handle secrets, while its external memory is susceptible to eavesdropping and tampering. An example for such a technology is Intel’s emerging Software Guard Extensions technology (Intel SGX) that appears in the latest processor generation, Architecture Codename Skylake. This technology operates under the assumption that the security perimeter includes only the internals of the CPU package, and in particular, leaves the DRAM untrusted. It is supported by an autonomous hardware unit called the Memory Encryption Engine (MEE), whose role is to protect the confidentiality, integrity, and freshness of the CPU-DRAM traffic over some memory range. To succeed in adding this unit to the micro architecture of a general purpose processor product, it must be designed under very strict engineering constraints. This requires a careful combination of cryptographic primitives operating over a customized integrity tree that mostly resides on the DRAM while relying only on a small internally stored root. The purpose of this paper is to explain how this hardware component of SGX works, and the rationale behind some of its design choices. To this end, we formalize the MEE threat model and security objectives, describe the MEE design, cryptographic properties, security margins, and report some concrete performance results.
@article{gueron_memory_nodate,
title = {A {Memory} {Encryption} {Engine} {Suitable} for {General} {Purpose} {Processors}},
abstract = {Cryptographic protection of memory is an essential ingredient for any technology that allows a closed computing system to run software in a trustworthy manner and handle secrets, while its external memory is susceptible to eavesdropping and tampering. An example for such a technology is Intel’s emerging Software Guard Extensions technology (Intel SGX) that appears in the latest processor generation, Architecture Codename Skylake. This technology operates under the assumption that the security perimeter includes only the internals of the CPU package, and in particular, leaves the DRAM untrusted. It is supported by an autonomous hardware unit called the Memory Encryption Engine (MEE), whose role is to protect the confidentiality, integrity, and freshness of the CPU-DRAM traffic over some memory range. To succeed in adding this unit to the micro architecture of a general purpose processor product, it must be designed under very strict engineering constraints. This requires a careful combination of cryptographic primitives operating over a customized integrity tree that mostly resides on the DRAM while relying only on a small internally stored root. The purpose of this paper is to explain how this hardware component of SGX works, and the rationale behind some of its design choices. To this end, we formalize the MEE threat model and security objectives, describe the MEE design, cryptographic properties, security margins, and report some concrete performance results.},
language = {en},
author = {Gueron, Shay},
keywords = {⛔ No DOI found},
pages = {14}
}A Probabilistic CMOS Switch and its Realization by Exploiting Noise. Cheemalavagu, S., Korkmaz, P., Palem, K. V, Akgul, B. E S, & Chakrapani, L. N
abstract bibtex
abstract bibtex
By viewing noise as a resource rather than as an impediment, we demonstrate an entirely novel approach to ultra low-energy computing. The subject of this study is the probabilistic inverter, ubiquitous to the design of digital systems, whose behavior is rendered probabilistic by noise. Summarized through the concept of an energyprobability relationship for inverters based on AMI 0.5µm and TSMC 0.25µm processes, we quantitatively show that significant energy savings are possible when a probabilistic inverter is switched with probability 1/2 \textless p \textless 1, and that these savings increase exponentially as p is lowered. We also quantitatively show that for a fixed p, increasing the noise RMS has the effect of increasing energy dissipation quadratically. Collectively, we refer to these two facts as the energy-probability laws governing probabilistic CMOS switches—these laws constitute the first contribution of this work. Furthermore, we also present a practical realization of a probabilistic inverter in a readily available TSMC 0.25µm technology. Finally, by using the probabilistic inverter as a building block, we provide early evidence that probabilistic switches can yield significant improvements to the energy×performance metric at the application level, by a factor of more than 288, for a probabilistic neural network application.
@article{cheemalavagu_probabilistic_nodate,
title = {A {Probabilistic} {CMOS} {Switch} and its {Realization} by {Exploiting} {Noise}},
abstract = {By viewing noise as a resource rather than as an impediment, we demonstrate an entirely novel approach to ultra low-energy computing. The subject of this study is the probabilistic inverter, ubiquitous to the design of digital systems, whose behavior is rendered probabilistic by noise. Summarized through the concept of an energyprobability relationship for inverters based on AMI 0.5µm and TSMC 0.25µm processes, we quantitatively show that significant energy savings are possible when a probabilistic inverter is switched with probability 1/2 {\textless} p {\textless} 1, and that these savings increase exponentially as p is lowered. We also quantitatively show that for a fixed p, increasing the noise RMS has the effect of increasing energy dissipation quadratically. Collectively, we refer to these two facts as the energy-probability laws governing probabilistic CMOS switches—these laws constitute the first contribution of this work. Furthermore, we also present a practical realization of a probabilistic inverter in a readily available TSMC 0.25µm technology. Finally, by using the probabilistic inverter as a building block, we provide early evidence that probabilistic switches can yield significant improvements to the energy×performance metric at the application level, by a factor of more than 288, for a probabilistic neural network application.},
language = {en},
author = {Cheemalavagu, Suresh and Korkmaz, Pinar and Palem, Krishna V and Akgul, Bilge E S and Chakrapani, Lakshmi N},
keywords = {⛔ No DOI found},
pages = {7}
}