DOCSLIB.ORG

ADSA13 Final Report

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
ADSA13 Final Report for Securityfor Applications Development Advanced Strategic Study Workshop Series Advanced Development for Security Applications October 2015 Workshop Final Report Final OctoberWorkshop 2015 Screening of Personnel and Divested Items at the Checkpoint - Part II ADSA13 ADSA13 October 2015 Workshop ALERT 2015Publication Awareness and Localization ofof Explosives-RelatedExplosives-Related Threats This material is based upon work supported by the U.S. Department of Homeland Security under Award Number 2013-ST-061-ED0001. The views and conclusions contained in this document are those of the authors and should not be interpreted as necessarily representing the offi cial poli- cies, either expressed or implied, of the U.S. Department of Homeland Security. Advanced Development Final Report for Security Applications October 2015 Workshop Table of Contents 1. Executive Summary 3 2. Disclaimers 5 3. Introduction 6 4. Discussion 7 5. Acknowledgements 14 6. Workshop Planning and Support 15 7. Appendix: Notes 16 8. Appendix: Agenda 17 9. Appendix: Previous Workshops 20 10. Appendix: List of Participants 21 11. Appendix: Presenter Biographies 25 12. Appendix: Questionnaire 39 13. Appendix: Questionnaire Responses 40 14. Appendix: Acronyms 81 15. Appendix: Minutes 87 16. Appendix: Presentations 141 Advanced Development Final Report for Security Applications October 2015 Workshop This page intentionally left blank. Advanced Development Final Report for Security Applications October 2015 Workshop 1. Executive Summary A workshop focused on screening of personnel and divested items at the checkpoint was held at Northeastern University (NEU) in Boston on October 28-29, 2015. This workshop was the thirteenth in a series dealing with ad- vanced development for security applications (ADSA13). The workshop was a continuation of the twelfth workshop, ADSA12. The topic of screening of personnel and divested items at the checkpoint was chosen as the workshop topic in order to support the Department of Home- land Security’s (DHS) objective of improving the performance of existing tech- nologies and to improve the passenger experience at checkpoints. Another goal of the workshop was to support DHS’s objective to increase the partici- pation of third parties, such as researchers from academia, national labs, and industry other than the incumbent vendors, in algorithm and system develop- ment for security applications. The following topics were addressed at the workshop: • Emerging hardware, algorithms and processes, • Concept of operations, • Testing, • Improving the passenger experience, and • Assessing and using risk. The topics were addressed from the perspectives of the following stakehold- ers: • Passengers, • TSA, • Airlines, and • Airports. The key indings from the workshop on what can be done to improve the ex- perience for the stakeholders at the checkpoint, per the editors of this report, are as follows. • Addressing the checkpoint from the perspectives listed above resulted in three competing drivers: o Strengthen security, o Increase operational eficiency, and o Improve passenger experience. • Silver bullets do not exist to solve these goals simultaneously. 3 Advanced Development Final Report for Security Applications October 2015 Workshop • Improvements may be made by developing orthogonal technologies that can be fused with extant technologies. However, improvements are re- quired in the following areas related to fused technologies: o Speciication, o Testing, and o Networking. • Video tracking of passengers and divested objects may be used to improve throughput and to support risk-based screening. • Vendor neutral airports and standards – there is strong interest when standards and neutrality save time and effort, especially for the vendors. • Standards, such as the interface to the baggage handling system, are use- ful when they reduce the development efforts of vendors. • Game theory and risk-based screening may be useful for allocating re- sources via a Dynamic Aviation Risk Management Systems (DARMS), but may not ind “the needle in a haystack.” • Deterrence may be useful, but test methods are required. • Advances may be coming in AIT ATR, Terahertz, ETD, CT reconstruction and image enhancement, but it is important to consider how it will be in- tegrated and deployed to the operating environment. Not all capabilities will ind a market. • Working with OEMs has the potential to educate new developers. • New methods are needed to decrease time from the emergence of a threat to ield deployment, including ATRs to detect the threat. At the meeting, it seemed that ADSA14 (Spring 2016) should address devel- oping and deploying technologies that can be fused. 4 Advanced Development Final Report for Security Applications October 2015 Workshop 2. Disclaimers This document was prepared as an account of work sponsored by an agency of the United States government. Neither the United States government nor Northeastern University nor any of their employees makes any warranty, ex- pressed or implied, or assumes any legal liability or responsibility for the ac- curacy, completeness, or usefulness of any information, apparatus, product, or process disclosed, or represents that its use would not infringe privately owned rights. Reference herein to any speciic commercial product, process or service by trade name, trademark, manufacturer, or otherwise does not necessarily constitute or imply its endorsement, recommendation or favoring by the United States government or Northeastern University. The views and opinions of authors expressed herein do not necessarily state or relect those of the United States government or Northeastern University, and shall not be used for advertising or product endorsement purposes. This document summarizes a workshop at which a number of people partic- ipated by discussions and/or presentations. The views in this summary are those of ALERT and do not necessarily relect the views of all the participants. All errors and omissions are the sole responsibility of ALERT. This material is based upon work supported by the U.S. Department of Home- land Security under Award Number 2013-ST-061-ED0001. The views and conclusions contained in this document are those of the authors and should not be interpreted as necessarily representing the oficial policies, either ex- pressed or implied, of the U.S. Department of Homeland Security. 5 Advanced Development Final Report for Security Applications October 2015 Workshop 3. Introduction The Explosive Division (EXD) of US Department of Homeland Security (DHS) Science & Technology Directorate (S&T), in coordination with the Transpor- tation Security Administration (TSA), has the objectives of improving the per- formance of existing technologies and to improve the passenger experience at checkpoints. One tactic that DHS is pursuing to achieve these objectives is to create an environment in which the capabilities and capacities of the estab- lished vendors can be augmented or complemented by third-party algorithm and hardware development. A third-party developer in this context refers to academia, National Labs, and companies other than the incumbent vendors. DHS is particularly interested in adopting the model that has been used by the medical imaging industry, in which university researchers and small commer- cial companies develop technologies that are eventually deployed in commer- cial medical imaging equipment. A tactic that DHS is using to stimulate third-party algorithm and hardware development is to sponsor a series of workshops addressing the research op- portunities that may enable the development of next-generation technologies for homeland security applications. The series of workshops are entitled “Ad- vanced Development for Security Applications (ADSA)”. The workshops are convened by Professor Michael B. Silevitch as part of the DHS Center of Ex- cellence (COE) for Awareness and Localization of Explosives-Related Threats (ALERT) at NEU. ADSA13 was held on October 28-29, 2015 at NEU. The workshop focused on screening of personnel and divested items at the checkpoint. The workshop was a continuation of the twelfth workshop, ADSA12. This report discusses what transpired at the workshop and details a summary of the indings and recommendations. 6 Advanced Development Final Report for Security Applications October 2015 Workshop 4. Discussion 4.1 Objectives The objective of the workshop was to improve the performance of screening passengers and divested items for explosives. The topics that were addressed centered on the following points. • Emerging hardware: o THz. o Photon counting detectors for X-rays. o Coded aperture. o X-ray backscatter. o Explosive trace detection. • Emerging algorithms and processes: o Video tracking of passengers and their divested items. o Simulations. o Image super resolution. o Iterative CT reconstruction. • Emerging processes: o Concepts of operations. o Vendor neutral airports. o Common interfaces. o Fused systems. • Improving the passenger experience: o Improving throughput and reducing divestiture. o Integration of detection systems at the checkpoint. o Managed inclusion and exclusion of passengers. • Assessing and using risk: o Risk-based screening (RBS). o Game theory. o Deterrence. o Developing and verifying models of adversary behaviors. • Other: o Role of third parties in the development of enhanced explosive detec- 7 Advanced Development Final Report for Security Applications October 2015 Workshop tion equipment. o Reducing time for ATR deployment.
Load more

Recommended publications
  • Reproducibility and Pseudo-Determinism in Log-Space
    Reproducibility and Pseudo-determinism in Log-Space by Ofer Grossman S.B., Massachusetts Institute of Technology (2017) Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Master of Science in Electrical Engineering and Computer Science at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY May 2020 c Massachusetts Institute of Technology 2020. All rights reserved. Author...................................................................... Department of Electrical Engineering and Computer Science May 15, 2020 Certified by.................................................................. Shafi Goldwasser RSA Professor of Electrical Engineering and Computer Science Thesis Supervisor Accepted by................................................................. Leslie A. Kolodziejski Professor of Electrical Engineering and Computer Science Chair, Department Committee on Graduate Students 2 Reproducibility and Pseudo-determinism in Log-Space by Ofer Grossman Submitted to the Department of Electrical Engineering and Computer Science on May 15, 2020, in partial fulfillment of the requirements for the degree of Master of Science in Electrical Engineering and Computer Science Abstract Acuriouspropertyofrandomizedlog-spacesearchalgorithmsisthattheiroutputsareoften longer than their workspace. This leads to the question: how can we reproduce the results of a randomized log space computation without storing the output or randomness verbatim? Running the algorithm again with new
    [Show full text]
  • Bioactive Nanotherapeutic Trends to Combat Triple Negative Breast Cancer
    University of Texas Rio Grande Valley ScholarWorks @ UTRGV School of Medicine Publications and Presentations School of Medicine 3-13-2021 Bioactive nanotherapeutic trends to combat triple negative breast cancer Pallabita Chowdhury University of Tennessee Health Science Center Upasana Ghosh Kamalika Samanta Meena Jaggi The University of Texas Rio Grande Valley, [email protected] Subhash C. Chauhan The University of Texas Rio Grande Valley, [email protected] See next page for additional authors Follow this and additional works at: https://scholarworks.utrgv.edu/som_pub Part of the Chemicals and Drugs Commons Recommended Citation Chowdhury, P., Ghosh, U., Samanta, K., Jaggi, M., Chauhan, S. C., & Yallapu, M. M. (2021). Bioactive nanotherapeutic trends to combat triple negative breast cancer. Bioactive materials, 6(10), 3269–3287. https://doi.org/10.1016/j.bioactmat.2021.02.037 This Article is brought to you for free and open access by the School of Medicine at ScholarWorks @ UTRGV. It has been accepted for inclusion in School of Medicine Publications and Presentations by an authorized administrator of ScholarWorks @ UTRGV. For more information, please contact [email protected], [email protected]. Authors Pallabita Chowdhury, Upasana Ghosh, Kamalika Samanta, Meena Jaggi, Subhash C. Chauhan, and Murali M. Yallapu This article is available at ScholarWorks @ UTRGV: https://scholarworks.utrgv.edu/som_pub/324 Bioactive Materials 6 (2021) 3269–3287 Contents lists available at ScienceDirect Bioactive Materials journal homepage: www.sciencedirect.com/journal/bioactive-materials Bioactive nanotherapeutic trends to combat triple negative breast cancer Pallabita Chowdhury a, Upasana Ghosh b, Kamalika Samanta a, Meena Jaggi a,c,d, Subhash C.
    [Show full text]
  • FOCS 2005 Program SUNDAY October 23, 2005
    FOCS 2005 Program SUNDAY October 23, 2005 Talks in Grand Ballroom, 17th floor Session 1: 8:50am – 10:10am Chair: Eva´ Tardos 8:50 Agnostically Learning Halfspaces Adam Kalai, Adam Klivans, Yishay Mansour and Rocco Servedio 9:10 Noise stability of functions with low influences: invari- ance and optimality The 46th Annual IEEE Symposium on Elchanan Mossel, Ryan O’Donnell and Krzysztof Foundations of Computer Science Oleszkiewicz October 22-25, 2005 Omni William Penn Hotel, 9:30 Every decision tree has an influential variable Pittsburgh, PA Ryan O’Donnell, Michael Saks, Oded Schramm and Rocco Servedio Sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing 9:50 Lower Bounds for the Noisy Broadcast Problem In cooperation with ACM SIGACT Navin Goyal, Guy Kindler and Michael Saks Break 10:10am – 10:30am FOCS ’05 gratefully acknowledges financial support from Microsoft Research, Yahoo! Research, and the CMU Aladdin center Session 2: 10:30am – 12:10pm Chair: Satish Rao SATURDAY October 22, 2005 10:30 The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics Tutorials held at CMU University Center into `1 [Best paper award] Reception at Omni William Penn Hotel, Monongahela Room, Subhash Khot and Nisheeth Vishnoi 17th floor 10:50 The Closest Substring problem with small distances Tutorial 1: 1:30pm – 3:30pm Daniel Marx (McConomy Auditorium) Chair: Irit Dinur 11:10 Fitting tree metrics: Hierarchical clustering and Phy- logeny Subhash Khot Nir Ailon and Moses Charikar On the Unique Games Conjecture 11:30 Metric Embeddings with Relaxed Guarantees Break 3:30pm – 4:00pm Ittai Abraham, Yair Bartal, T-H.
    [Show full text]
  • Secure Multi-Party Computation in Practice
    SECURE MULTI-PARTY COMPUTATION IN PRACTICE Marcella Christine Hastings A DISSERTATION in Computer and Information Science Presented to the Faculties of the University of Pennsylvania in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy 2021 Supervisor of Dissertation Nadia Heninger Adjunct Associate Professor, University of Pennsylvania Associate Professor, University of California, San Diego Graduate Group Chairperson Mayur Naik Professor and Computer and Information Science Graduate Group Chair Dissertation Committee Brett Hemenway Falk, Research Assistant Professor Stephan A. Zdancewic, Professor Sebastian Angel, Raj and Neera Singh Term Assistant Professor abhi shelat, Associate Professor at Khoury College of Computer Sciences, Northeastern University ACKNOWLEDGMENT This dissertation would have been much less pleasant to produce without the presence of many people in my life. I would like to thank my advisor and my dissertation committee for their helpful advice, direction, and long-distance phone calls over the past six years. I would like to thank my fellow PhD students at the University of Pennsylvania, especially the ever-changing but consistently lovely office mates in the Distributed Systems Laboratory and my cohort. Our shared tea-time, cookies, disappointments, and achievements provided an essential community that brought me great joy during my time at Penn. I would like to thank the mentors and colleagues who hosted me at the Security and Privacy Lab at the University of Washington in 2018, the Software & Application Innovation Lab at Boston University in 2019, and the Cryptography and Privacy Research group at Microsoft Research in 2020. My career and happiness greatly benefited from spending these summers exploring fresh research directions and rediscovering the world outside my own work.
    [Show full text]
  • A Decade of Lattice Cryptography
    Full text available at: http://dx.doi.org/10.1561/0400000074 A Decade of Lattice Cryptography Chris Peikert Computer Science and Engineering University of Michigan, United States Boston — Delft Full text available at: http://dx.doi.org/10.1561/0400000074 Foundations and Trends R in Theoretical Computer Science Published, sold and distributed by: now Publishers Inc. PO Box 1024 Hanover, MA 02339 United States Tel. +1-781-985-4510 www.nowpublishers.com [email protected] Outside North America: now Publishers Inc. PO Box 179 2600 AD Delft The Netherlands Tel. +31-6-51115274 The preferred citation for this publication is C. Peikert. A Decade of Lattice Cryptography. Foundations and Trends R in Theoretical Computer Science, vol. 10, no. 4, pp. 283–424, 2014. R This Foundations and Trends issue was typeset in LATEX using a class file designed by Neal Parikh. Printed on acid-free paper. ISBN: 978-1-68083-113-9 c 2016 C. Peikert All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, mechanical, photocopying, recording or otherwise, without prior written permission of the publishers. Photocopying. In the USA: This journal is registered at the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923. Authorization to photocopy items for in- ternal or personal use, or the internal or personal use of specific clients, is granted by now Publishers Inc for users registered with the Copyright Clearance Center (CCC). The ‘services’ for users can be found on the internet at: www.copyright.com For those organizations that have been granted a photocopy license, a separate system of payment has been arranged.
    [Show full text]
  • Hard Communication Channels for Steganography
    Hard Communication Channels for Steganography Sebastian Berndt1 and Maciej Liśkiewicz2 1 University of Lübeck, Lübeck, Germany [email protected] 2 University of Lübeck, Lübeck, Germany [email protected] Abstract This paper considers steganography – the concept of hiding the presence of secret messages in legal communications – in the computational setting and its relation to cryptography. Very re- cently the first (non-polynomial time) steganographic protocol has been shown which, for any communication channel, is provably secure, reliable, and has nearly optimal bandwidth. The security is unconditional, i.e. it does not rely on any unproven complexity-theoretic assumption. This disproves the claim that the existence of one-way functions and access to a communication channel oracle are both necessary and sufficient conditions for the existence of secure steganogra- phy in the sense that secure and reliable steganography exists independently of the existence of one-way functions. In this paper, we prove that this equivalence also does not hold in the more realistic setting, where the stegosystem is polynomial time bounded. We prove this by construct- ing (a) a channel for which secure steganography exists if and only if one-way functions exist and (b) another channel such that secure steganography implies that no one-way functions exist. We therefore show that security-preserving reductions between cryptography and steganography need to be treated very carefully. 1998 ACM Subject Classification E.3 Data Encryption Keywords and phrases provable secure steganography, cryptographic assumptions, pseudoran- dom functions, one-way functions, signature schemes Digital Object Identifier 10.4230/LIPIcs.ISAAC.2016.16 1 Introduction Digital steganography has recently received substantial interest in modern computer science since it allows secret communication without revealing its presence.
    [Show full text]
  • Algebraic Pseudorandom Functions with Improved Efficiency from the Augmented Cascade*
    Algebraic Pseudorandom Functions with Improved Efficiency from the Augmented Cascade* DAN BONEH† HART MONTGOMERY‡ ANANTH RAGHUNATHAN§ Department of Computer Science, Stanford University fdabo,hartm,[email protected] September 8, 2020 Abstract We construct an algebraic pseudorandom function (PRF) that is more efficient than the classic Naor- Reingold algebraic PRF. Our PRF is the result of adapting the cascade construction, which is the basis of HMAC, to the algebraic settings. To do so we define an augmented cascade and prove it secure when the underlying PRF satisfies a property called parallel security. We then use the augmented cascade to build new algebraic PRFs. The algebraic structure of our PRF leads to an efficient large-domain Verifiable Random Function (VRF) and a large-domain simulatable VRF. 1 Introduction Pseudorandom functions (PRFs), first defined by Goldreich, Goldwasser, and Micali [GGM86], are a fun- damental building block in cryptography and have numerous applications. They are used for encryption, message integrity, signatures, key derivation, user authentication, and many other cryptographic mecha- nisms. Beyond cryptography, PRFs are used to defend against denial of service attacks [Ber96, CW03] and even to prove lower bounds in learning theory. In a nutshell, a PRF is indistinguishable from a truly random function. We give precise definitions in the next section. The fastest PRFs are built from block ciphers like AES and security is based on ad-hoc inter- active assumptions. In 1996, Naor and Reingold [NR97] presented an elegant PRF whose security can be deduced from the hardness of the Decision Diffie-Hellman problem (DDH) defined in the next section.
    [Show full text]
  • Omer Reingold, June 2017
    Omer Reingold, June 2017 My research is focused on a wide range of topics within the Foundations of Computer Science. In particular, my core areas, which include my most significant contributions, are Computational Complexity and the Foundations of Cryptography, with an emphasis on Randomness, Derandomization and Explicit Combinatorial Constructions. However, I am interested in a much broader range of topics (some closer and some further away from my core areas). Examples include Differential Privacy and Fairness, Game Theory, Hashing and Data Structures, Resource Allocation and Data Analysis. Current Academic Employment: Professor of Computer Science, Stanford University, Since Feb. 2015. Education: • 1994-1998 Weizmann Institute of Science, Rehovot, Israel. Ph.D. in Computer Science. Thesis title: Pseudo-random synthesizers, functions and permutations. Advisor: Prof. Moni Naor. • 1991-1994 Tel-Aviv University, Tel-Aviv, Israel. B.Sc in Mathematics and Computer Science - Summa Cum Laude. Selected Awards and distinctions (additional awards below): • The 2009 Gödel Prize for outstanding papers in the area of theoretical computer science (jointly with Salil Vadhan and Avi Wigderson). • 2005 ACM Grace Murray Hopper Award. Awarded by the Association for Computing Machinery (ACM) to “the outstanding young computer professional of the year.” • ACM Fellow (2014) Previous Academic Employment and Short Term Visits: • Feb 2015 – September 2016 Principal Research Engineer, Samsung Research America (SRA) • Nov 2014 – Feb 2015 (while on leave from
    [Show full text]
  • Immunizing Encryption Schemes from Decryption Errors
    Immunizing Encryption Schemes from Decryption Errors Cynthia Dwork1, Moni Naor2, and Omer Reingold2 1 Microsoft Research, SVC 1065 L’Avenida Mountain View, CA 94043 [email protected] 2 Weizmann Institute of Science Rehovot 76100, Israel {moni.naor,omer.reingold}@weizmann.ac.il Abstract. We provide methods for transforming an encryption scheme susceptible to decryption errors into one that is immune to these errors. Immunity to decryption errors is vital when constructing non-malleable and chosen ciphertext secure encryption schemes via current techniques; in addition, it may help defend against certain cryptanalytic techniques, such as the attack of Proos [33] on the NTRU scheme. When decryption errors are very infrequent, our transformation is ex- tremely simple and efficient, almost free. To deal with significant error probabilities, we apply amplification techniques translated from a re- lated information theoretic setting. These techniques allow us to correct even very weak encryption schemes where in addition to decryption er- rors, an adversary has substantial probability of breaking the scheme by decrypting random messages (without knowledge of the secret key). In other words, under these weak encryption schemes, the only guaranteed difference between the legitimate recipient and the adversary is in the frequency of decryption errors. All the above transformations work in a standard cryptographic model; specifically, they do not rely on a random oracle. We also consider the random oracle model, where we give a simple trans- formation from a one-way encryption scheme which is error-prone into one that is immune to errors. We conclude that error-prone cryptosystems can be used in order to create more secure cryptosystems.
    [Show full text]
  • Computational Hardness of Optimal Fair Computation: Beyond Minicrypt
    Computational Hardness of Optimal Fair Computation: Beyond Minicrypt Hemanta K. Maji Department of Computer Science, Purdue University, USA [email protected] Mingyuan Wang Department of Computer Science, Purdue University, USA [email protected] Abstract Secure multi-party computation allows mutually distrusting parties to compute securely over their private data. However, guaranteeing output delivery to honest parties when the adversarial parties may abort the protocol has been a challenging objective. As a representative task, this work considers two-party coin-tossing protocols with guaranteed output delivery, a.k.a., fair coin- tossing. In the information-theoretic plain model, as in two-party zero-sum games, one of the parties can force an output with certainty. In the commitment-hybrid, any r-message coin-tossing proto- √ √ col is 1/ r-unfair, i.e., the adversary can change the honest party’s output distribution by 1/ r in the statistical distance. Moran, Naor, and Segev (TCC–2009) constructed the first 1/r-unfair protocol in the oblivious transfer-hybrid. No further security improvement is possible because Cleve (STOC–1986) proved that 1/r-unfairness is unavoidable. Therefore, Moran, Naor, and Segev’s coin-tossing protocol is optimal. However, is oblivious transfer necessary for optimal fair coin-tossing? Maji and Wang (CRYPTO–2020) proved that any coin-tossing protocol using one-way func- √ tions in a black-box manner is at least 1/ r-unfair. That is, optimal fair coin-tossing is impossible in Minicrypt. Our work focuses on tightly characterizing the hardness of computation assump- tion necessary and sufficient for optimal fair coin-tossing within Cryptomania, outside Minicrypt.
    [Show full text]
  • Fall 2016 Dear Computer Science Alumni and Friends, These Are
    Alex Aiken Alcatel-Lucent Professor Tencent Chair, Department of Computer Science Fall 2016 Dear Computer Science Alumni and Friends, These are exciting times in computer science, with research, education, and the industry continuing to evolve at a rapid and seemingly increasing rate. The role of computer science is also changing, shifting from being a dynamic, exciting intellectual field driving technological change to becoming a dynamic, exciting intellectual field that is a significant component of many other fields of inquiry as well as a major social and cultural force. The effects of these changes on academic computer science departments, at least in the United States, are well known: soaring enrollments at all levels; a major expansion of research efforts, particularly in collaborations with other fields; and the stresses associated with trying to adapt and grow to meet these challenges and opportunities. The CS department at Stanford has been riding this wave with excitement and enthusiasm—and sometimes exhaustion! In this newsletter, I’ll talk about some of the changes that are taking place. A key part of this process has been discussions with the alumni and friends of the department; many of you have helped by sharing your thoughts with me and other faculty, for which we are sincerely grateful. Faculty Hiring The School of Engineering and the department have agreed that the CS department will grow by a net of 10 full-time faculty positions, from about 40 full-time positions today to about 50. Many of you will no doubt recognize that this won’t change our hiring rate (we’ve been hiring as fast as we can for several years), but it will allow us to take a step back and think about the future composition of the department.
    [Show full text]
  • Experimentally Demonstrated the Intrinsic Instability of the Fluorite-Type Zr Cation Network
    0246110 Rta(i) 1 1,2 l,4 1,6 1,l 2 22 Rta(i) Figure 2. Temperature dependence of Zr-FTfor pure orthorhombic zirconia Figure 3 Temperature dependence of Zr-0 shell in tetragonal zirconia solid solution Our study has experimentally demonstrated the intrinsic instability of the fluorite-type Zr cation network. Coherent scattering beween Conclusions central Zr ion and distant cations is weaker and vibration modes of the Zr-cation network are It is found that, for all of zirconia solid softer in tetragonal zirconia than in monoclmic, solutions studied, the dopant-oxygen distances are orthorhombic, or stabilized cubic zirconia. In si@icantly ddferent from the Zr-0 distances. addition, the outer foux oxygens in the 8-fold The dopant-cation distances, on the other hand, coordinated Zr-0 polyhedron are only loosely are usually very close to the Zr-Zr distance, solutions. A bonded and are subject to very large static and confirming the formation of solid dynamic distortions. This effect is illustrated by general structural picture for zirconia solid the expanded portion of the Fourier transform solutions is one that places the dopant cations shown in Figure 3. randomly on tbe Zr sites in the cation network, but with distorted and sometimes very different Dopant Structure dopant-oxygen polyhedra surrounding these dopants. In the case of Ge4+ doping and Y-Nb We have also successfully performed co-doping, short-rangecation ordering has been EXAFS experiments at the dopant absorption suggested from our EXAFS results. edges for doped zirconia solid solutions. Dopants Based on the above structural information studied include the Ce-,Nb-, and Y-K edges as and other EXAFS results obtained from NSLS, well as Ce-LIn edge.
    [Show full text]