🌟 Exciting Learning Opportunity Alert! 🌟Join us for a transformative experience with "On Their Own: Supporting Independence in Autistic Students Using Activity Systems." 🧩📅 When: All throughout November📌 Where: Online - Accessible anytime!📧 Contact: Mercedes Pagano at paganom@fau.edu 📞 Call: (561)-212-8058In this pre-recorded event, you'll unlock a world of insights:1️⃣ Gain a deep understanding of why activity systems are remarkably effective in nurturing independence.2️⃣ Dive into the research base of the activity system and discover its powerful potential.3️⃣ Learn practical strategies to implement the activity system, fostering independence in the classroom, home, and the community. 🏠🏫🌆Empower yourself with knowledge that can make a real difference in the lives of autistic students. 🧡💙Don't miss this opportunity to make a positive impact! 🌠Register https://pepsasupporting.eventbrite.com

🌟 Exciting News for Parents and Educators! 🌟 Throughout November, join us for an empowering presentation on "Practical Ways To Support Advocacy In Students With Disabilities." 🎓✨On this journey, we'll explore how to seamlessly integrate decision-making, reasoning, and problem-solving into daily tasks, fostering independence and empowerment in students.📆 Save the date and don't miss out on expert insights!🔍 For more details, reach out to Mercedes Pagano:📧 Email: paganom@fau.edu📞 Call: (561)-212-8058Register: https://SupportAdvocacy.eventbrite.com

The portion of the exhibition that is in the Jaffe Book Arts Gallery is available for viewing during our regular hours: Monday to Friday, 10 a.m. to 4 p.m. Learn more here.

Crypto CaféSpeaker: Paolo Santini, Universita Polotecnica Delle Marche, ItalyTitle: A New Formulation of the Linear Equivalence Problem and Shorter LESS SignaturesAbstract: The problem of determining whether two linear codes are equivalent is called Code Equivalence Problem. When codes are endowed with the Hamming metric (which is the most studied case), the equivalence is mainly considered with respect to monomial transformations (permutations with scaling factors) and the problem is known as the Linear Equivalence Problem (LEP). Code equivalence can be described as a transitive, non-commutative group action and, as such, finds a natural application in cryptography: for example, it is possible to design zero-knowledge proofs, and hence signature schemes. In recent works, it has been shown that LEP can be reformulated using notions such as information sets (arguably, ubiquitous objects in coding theory) and canonical forms. This unlocks some new features, such as the possibility of communicating the equivalence map in a very compact way (which leads to much shorter signatures), as well as opening new attack avenues. In this talk, we recall the basics of code equivalence and then focus on these recent results, aiming to describe how they can be applied to boost the performance of cryptographic schemes.Zoom (click here)Meeting ID: 878 9825 0483 Passcode: gHJF6gAll are cordially invited.

Crypto CaféSpeaker: Paolo Santini, Universita Polotecnica Delle Marche, ItalyTitle: A New Formulation of the Linear Equivalence Problem and Shorter LESS SignaturesAbstract: The problem of determining whether two linear codes are equivalent is called Code Equivalence Problem. When codes are endowed with the Hamming metric (which is the most studied case), the equivalence is mainly considered with respect to monomial transformations (permutations with scaling factors) and the problem is known as the Linear Equivalence Problem (LEP). Code equivalence can be described as a transitive, non-commutative group action and, as such, finds a natural application in cryptography: for example, it is possible to design zero-knowledge proofs, and hence signature schemes. In recent works, it has been shown that LEP can be reformulated using notions such as information sets (arguably, ubiquitous objects in coding theory) and canonical forms. This unlocks some new features, such as the possibility of communicating the equivalence map in a very compact way (which leads to much shorter signatures), as well as opening new attack avenues. In this talk, we recall the basics of code equivalence and then focus on these recent results, aiming to describe how they can be applied to boost the performance of cryptographic schemes.Zoom (click here)Meeting ID: 878 9825 0483 Passcode: gHJF6gAll are cordially invited.

Mathematics of Data ScienceWilliam E. Hahn, Ph.D.Office: Wimberly Library, Room 103 (Sandbox)Email: whahn@fau.eduCourse Objectives/Student Learning Outcomes1. Understand the fundamentals of neural networks and deep learning algorithms2. Learn various methods used to construct, train, evaluate and deploy mathematical models3. Analyze different types of input data including image data4. Utilize Python libraries such as PyTorch for building data science notebooksCourse Number: MAP-2192CRN: 14640Credits: 3 credits