150,926 results on '"An, Omer"'
Search Results
2. Large area monocrystalline and surfactant-free copper microflake synthesis
- Author
-
Dayi, Elif Nur, Pellet, Diotime, Vensaus, Priscila, Kiani, Fatemeh, Bowman, Alan R., Karaman, Omer Can, and Tagliabue, Giulia
- Subjects
Physics - Chemical Physics ,Condensed Matter - Materials Science - Abstract
Copper is one of the most extensively studied materials for energy conversion and catalytic systems, with a wide range of other applications from nanophotonics to biotechnology. However, existing synthesis methods are limited with many undesirable by-products and poorly defined morphologies. Here, we report a surfactant-free on-substrate wet synthesis approach that yields monocrystalline metallic Cu microflakes with (111) crystalline exposed surface. By systematically studying the growth mechanism, we achieve unprecedented sizes of more than 130 {\mu}m, which is two orders of magnitude larger than reported in most previous studies, along with higher aspect ratios of over 400. Furthermore, we show distinctly higher stability against oxidation provided by the halide adlayer. Overall, our facile synthesis approach delivers an exciting venue for the emerging fields of catalysis and nanophotonics.
- Published
- 2025
3. Humanity's Last Exam
- Author
-
Phan, Long, Gatti, Alice, Han, Ziwen, Li, Nathaniel, Hu, Josephina, Zhang, Hugh, Shi, Sean, Choi, Michael, Agrawal, Anish, Chopra, Arnav, Khoja, Adam, Kim, Ryan, Hausenloy, Jason, Zhang, Oliver, Mazeika, Mantas, Anderson, Daron, Nguyen, Tung, Mahmood, Mobeen, Feng, Fiona, Feng, Steven Y., Zhao, Haoran, Yu, Michael, Gangal, Varun, Zou, Chelsea, Wang, Zihan, Wang, Jessica P., Kumar, Pawan, Pokutnyi, Oleksandr, Gerbicz, Robert, Popov, Serguei, Levin, John-Clark, Kazakov, Mstyslav, Schmitt, Johannes, Galgon, Geoff, Sanchez, Alvaro, Lee, Yongki, Yeadon, Will, Sauers, Scott, Roth, Marc, Agu, Chidozie, Riis, Søren, Giska, Fabian, Utpala, Saiteja, Giboney, Zachary, Goshu, Gashaw M., Xavier, Joan of Arc, Crowson, Sarah-Jane, Naiya, Mohinder Maheshbhai, Burns, Noah, Finke, Lennart, Cheng, Zerui, Park, Hyunwoo, Fournier-Facio, Francesco, Wydallis, John, Nandor, Mark, Singh, Ankit, Gehrunger, Tim, Cai, Jiaqi, McCarty, Ben, Duclosel, Darling, Nam, Jungbae, Zampese, Jennifer, Hoerr, Ryan G., Bacho, Aras, Loume, Gautier Abou, Galal, Abdallah, Cao, Hangrui, Garretson, Alexis C, Sileo, Damien, Ren, Qiuyu, Cojoc, Doru, Arkhipov, Pavel, Qazi, Usman, Li, Lianghui, Motwani, Sumeet, de Witt, Christian Schroeder, Taylor, Edwin, Veith, Johannes, Singer, Eric, Hartman, Taylor D., Rissone, Paolo, Jin, Jaehyeok, Shi, Jack Wei Lun, Willcocks, Chris G., Robinson, Joshua, Mikov, Aleksandar, Prabhu, Ameya, Tang, Longke, Alapont, Xavier, Uro, Justine Leon, Zhou, Kevin, Santos, Emily de Oliveira, Maksimov, Andrey Pupasov, Vendrow, Edward, Zenitani, Kengo, Guillod, Julien, Li, Yuqi, Vendrow, Joshua, Kuchkin, Vladyslav, Ze-An, Ng, Marion, Pierre, Efremov, Denis, Lynch, Jayson, Liang, Kaiqu, Gritsevskiy, Andrew, Martinez, Dakotah, Pageler, Ben, Crispino, Nick, Zvonkine, Dimitri, Fraga, Natanael Wildner, Soori, Saeed, Press, Ori, Tang, Henry, Salazar, Julian, Green, Sean R., Brüssel, Lina, Twayana, Moon, Dieuleveut, Aymeric, Rogers, T. Ryan, Zhang, Wenjin, Li, Bikun, Yang, Jinzhou, Rao, Arun, Loiseau, Gabriel, Kalinin, Mikhail, Lukas, Marco, Manolescu, Ciprian, Mishra, Subrata, Kamdoum, Ariel Ghislain Kemogne, Kreiman, Tobias, Hogg, Tad, Jin, Alvin, Bosio, Carlo, Sun, Gongbo, Coppola, Brian P, Tarver, Tim, Heidinger, Haline, Sayous, Rafael, Ivanov, Stefan, Cavanagh, Joseph M, Shen, Jiawei, Imperial, Joseph Marvin, Schwaller, Philippe, Senthilkuma, Shaipranesh, Bran, Andres M, Dehghan, Ali, Algaba, Andres, Verbeken, Brecht, Noever, David, P V, Ragavendran, Schut, Lisa, Sucholutsky, Ilia, Zheltonozhskii, Evgenii, Lim, Derek, Stanley, Richard, Sivarajan, Shankar, Yang, Tong, Maar, John, Wykowski, Julian, Oller, Martí, Sandlin, Jennifer, Sahu, Anmol, Hu, Yuzheng, Fish, Sara, Heydari, Nasser, Apronti, Archimedes, Rawal, Kaivalya, Vilchis, Tobias Garcia, Zu, Yuexuan, Lackner, Martin, Koppel, James, Nguyen, Jeremy, Antonenko, Daniil S., Chern, Steffi, Zhao, Bingchen, Arsene, Pierrot, Goldfarb, Alan, Ivanov, Sergey, Poświata, Rafał, Wang, Chenguang, Li, Daofeng, Crisostomi, Donato, Achilleos, Andrea, Myklebust, Benjamin, Sen, Archan, Perrella, David, Kaparov, Nurdin, Inlow, Mark H, Zang, Allen, Thornley, Elliott, Orel, Daniil, Poritski, Vladislav, Ben-David, Shalev, Berger, Zachary, Whitfill, Parker, Foster, Michael, Munro, Daniel, Ho, Linh, Hava, Dan Bar, Kuchkin, Aleksey, Lauff, Robert, Holmes, David, Sommerhage, Frank, Schneider, Keith, Kazibwe, Zakayo, Stambaugh, Nate, Singh, Mukhwinder, Magoulas, Ilias, Clarke, Don, Kim, Dae Hyun, Dias, Felipe Meneguitti, Elser, Veit, Agarwal, Kanu Priya, Vilchis, Victor Efren Guadarrama, Klose, Immo, Demian, Christoph, Anantheswaran, Ujjwala, Zweiger, Adam, Albani, Guglielmo, Li, Jeffery, Daans, Nicolas, Radionov, Maksim, Rozhoň, Václav, Ma, Ziqiao, Stump, Christian, Berkani, Mohammed, Platnick, Jacob, Nevirkovets, Volodymyr, Basler, Luke, Piccardo, Marco, Jeanplong, Ferenc, Cohen, Niv, Tkadlec, Josef, Rosu, Paul, Padlewski, Piotr, Barzowski, Stanislaw, Montgomery, Kyle, Menezes, Aline, Patel, Arkil, Wang, Zixuan, Tucker-Foltz, Jamie, Stade, Jack, Goertzen, Tom, Kazemi, Fereshteh, Milbauer, Jeremiah, Ambay, John Arnold, Shukla, Abhishek, Labrador, Yan Carlos Leyva, Givré, Alan, Wolff, Hew, Rossbach, Vivien, Aziz, Muhammad Fayez, Kaddar, Younesse, Chen, Yanxu, Zhang, Robin, Pan, Jiayi, Terpin, Antonio, Muennighoff, Niklas, Schoelkopf, Hailey, Zheng, Eric, Carmi, Avishy, Jones, Adam, Shah, Jainam, Brown, Ethan D. L., Zhu, Kelin, Bartolo, Max, Wheeler, Richard, Ho, Andrew, Barkan, Shaul, Wang, Jiaqi, Stehberger, Martin, Kretov, Egor, Sridhar, Kaustubh, EL-Wasif, Zienab, Zhang, Anji, Pyda, Daniel, Tam, Joanna, Cunningham, David M., Goryachev, Vladimir, Patramanis, Demosthenes, Krause, Michael, Redenti, Andrew, Bugas, Daniel, Aldous, David, Lai, Jesyin, Coleman, Shannon, Bahaloo, Mohsen, Xu, Jiangnan, Lee, Sangwon, Zhao, Sandy, Tang, Ning, Cohen, Michael K., Carroll, Micah, Paradise, Orr, Kirchner, Jan Hendrik, Steinerberger, Stefan, Ovchynnikov, Maksym, Matos, Jason O., Shenoy, Adithya, Junior, Benedito Alves de Oliveira, Wang, Michael, Nie, Yuzhou, Giordano, Paolo, Petersen, Philipp, Sztyber-Betley, Anna, Shukla, Priti, Crozier, Jonathan, Pinto, Antonella, Verma, Shreyas, Joshi, Prashant, Yong, Zheng-Xin, Tee, Allison, Andréoletti, Jérémy, Weller, Orion, Singhal, Raghav, Zhang, Gang, Ivanov, Alexander, Khoury, Seri, Mostaghimi, Hamid, Thaman, Kunvar, Chen, Qijia, Khánh, Tran Quoc, Loader, Jacob, Cavalleri, Stefano, Szlyk, Hannah, Brown, Zachary, Roberts, Jonathan, Alley, William, Sun, Kunyang, Stendall, Ryan, Lamparth, Max, Reuel, Anka, Wang, Ting, Xu, Hanmeng, Raparthi, Sreenivas Goud, Hernández-Cámara, Pablo, Martin, Freddie, Malishev, Dmitry, Preu, Thomas, Korbak, Tomek, Abramovitch, Marcus, Williamson, Dominic, Chen, Ziye, Bálint, Biró, Bari, M Saiful, Kassani, Peyman, Wang, Zihao, Ansarinejad, Behzad, Goswami, Laxman Prasad, Sun, Yewen, Elgnainy, Hossam, Tordera, Daniel, Balabanian, George, Anderson, Earth, Kvistad, Lynna, Moyano, Alejandro José, Maheshwari, Rajat, Sakor, Ahmad, Eron, Murat, McAlister, Isaac C., Gimenez, Javier, Enyekwe, Innocent, O., Andrew Favre D., Shah, Shailesh, Zhou, Xiaoxiang, Kamalov, Firuz, Clark, Ronald, Abdoli, Sherwin, Santens, Tim, Meer, Khalida, Wang, Harrison K, Ramakrishnan, Kalyan, Chen, Evan, Tomasiello, Alessandro, De Luca, G. Bruno, Looi, Shi-Zhuo, Le, Vinh-Kha, Kolt, Noam, Mündler, Niels, Semler, Avi, Rodman, Emma, Drori, Jacob, Fossum, Carl J, Jagota, Milind, Pradeep, Ronak, Fan, Honglu, Shah, Tej, Eicher, Jonathan, Chen, Michael, Thaman, Kushal, Merrill, William, Harris, Carter, Gross, Jason, Gusev, Ilya, Sharma, Asankhaya, Agnihotri, Shashank, Zhelnov, Pavel, Usawasutsakorn, Siranut, Mofayezi, Mohammadreza, Bogdanov, Sergei, Piperski, Alexander, Carauleanu, Marc, Zhang, David K., Ler, Dylan, Leventov, Roman, Soroko, Ignat, Jansen, Thorben, Lauer, Pascal, Duersch, Joshua, Taamazyan, Vage, Morak, Wiktor, Ma, Wenjie, Held, William, Huy, Tran Đuc, Xian, Ruicheng, Zebaze, Armel Randy, Mohamed, Mohanad, Leser, Julian Noah, Yuan, Michelle X, Yacar, Laila, Lengler, Johannes, Shahrtash, Hossein, Oliveira, Edson, Jackson, Joseph W., Gonzalez, Daniel Espinosa, Zou, Andy, Chidambaram, Muthu, Manik, Timothy, Haffenden, Hector, Stander, Dashiell, Dasouqi, Ali, Shen, Alexander, Duc, Emilien, Golshani, Bita, Stap, David, Uzhou, Mikalai, Zhidkovskaya, Alina Borisovna, Lewark, Lukas, Vincze, Mátyás, Wehr, Dustin, Tang, Colin, Hossain, Zaki, Phillips, Shaun, Muzhen, Jiang, Ekström, Fredrik, Hammon, Angela, Patel, Oam, Remy, Nicolas, Farhidi, Faraz, Medley, George, Mohammadzadeh, Forough, Peñaflor, Madellene, Kassahun, Haile, Friedrich, Alena, Sparrow, Claire, Sakal, Taom, Dhamane, Omkar, Mirabadi, Ali Khajegili, Hallman, Eric, Battaglia, Mike, Maghsoudimehrabani, Mohammad, Hoang, Hieu, Amit, Alon, Hulbert, Dave, Pereira, Roberto, Weber, Simon, Mensah, Stephen, Andre, Nathan, Peristyy, Anton, Harjadi, Chris, Gupta, Himanshu, Malina, Stephen, Albanie, Samuel, Cai, Will, Mehkary, Mustafa, Reidegeld, Frank, Dick, Anna-Katharina, Friday, Cary, Sidhu, Jasdeep, Kim, Wanyoung, Costa, Mariana, Gurdogan, Hubeyb, Weber, Brian, Kumar, Harsh, Jiang, Tong, Agarwal, Arunim, Ceconello, Chiara, Vaz, Warren S., Zhuang, Chao, Park, Haon, Tawfeek, Andrew R., Aggarwal, Daattavya, Kirchhof, Michael, Dai, Linjie, Kim, Evan, Ferret, Johan, Wang, Yuzhou, Yan, Minghao, Burdzy, Krzysztof, Zhang, Lixin, Franca, Antonio, Pham, Diana T., Loh, Kang Yong, Gul, Shreen, Chhablani, Gunjan, Du, Zhehang, Cosma, Adrian, White, Colin, Riblet, Robin, Saxena, Prajvi, Votava, Jacob, Vinnikov, Vladimir, Delaney, Ethan, Halasyamani, Shiv, Shahid, Syed M., Mourrat, Jean-Christophe, Vetoshkin, Lavr, Bacho, Renas, Ginis, Vincent, Maksapetyan, Aleksandr, de la Rosa, Florencia, Li, Xiuyu, Malod, Guillaume, Lang, Leon, Laurendeau, Julien, Adesanya, Fatimah, Portier, Julien, Hollom, Lawrence, Souza, Victor, Zhou, Yuchen Anna, Yalın, Yiğit, Obikoya, Gbenga Daniel, Arnaboldi, Luca, Rai, Bigi, Filippo, Bacho, Kaniuar, Clavier, Pierre, Recchia, Gabriel, Popescu, Mara, Shulga, Nikita, Tanwie, Ngefor Mildred, Lux, Thomas C. H., Rank, Ben, Ni, Colin, Yakimchyk, Alesia, Huanxu, Liu, Häggström, Olle, Verkama, Emil, Narayan, Himanshu, Gundlach, Hans, Brito-Santana, Leonor, Amaro, Brian, Vajipey, Vivek, Grover, Rynaa, Fan, Yiyang, Silva, Gabriel Poesia Reis e, Xin, Linwei, Kratish, Yosi, Łucki, Jakub, Li, Wen-Ding, Xu, Justin, Scaria, Kevin Joseph, Vargus, Freddie, Habibi, Farzad, Long, Lian, Rodolà, Emanuele, Robins, Jules, Cheng, Vincent, Grabb, Declan, Bosio, Ida, Fruhauff, Tony, Akov, Ido, Lo, Eve J. Y., Qi, Hao, Jiang, Xi, Segev, Ben, Fan, Jingxuan, Martinson, Sarah, Wang, Erik Y., Hausknecht, Kaylie, Brenner, Michael P., Mao, Mao, Jiang, Yibo, Zhang, Xinyu, Avagian, David, Scipio, Eshawn Jessica, Siddiqi, Muhammad Rehan, Ragoler, Alon, Tan, Justin, Patil, Deepakkumar, Plecnik, Rebeka, Kirtland, Aaron, Montecillo, Roselynn Grace, Durand, Stephane, Bodur, Omer Faruk, Adoul, Zahra, Zekry, Mohamed, Douville, Guillaume, Karakoc, Ali, Santos, Tania C. B., Shamseldeen, Samir, Karim, Loukmane, Liakhovitskaia, Anna, Resman, Nate, Farina, Nicholas, Gonzalez, Juan Carlos, Maayan, Gabe, Hoback, Sarah, Pena, Rodrigo De Oliveira, Sherman, Glen, Mariji, Hodjat, Pouriamanesh, Rasoul, Wu, Wentao, Demir, Gözdenur, Mendoza, Sandra, Alarab, Ismail, Cole, Joshua, Ferreira, Danyelle, Johnson, Bryan, Milliron, Hsiaoyun, Safdari, Mohammad, Dai, Liangti, Arthornthurasuk, Siriphan, Pronin, Alexey, Fan, Jing, Ramirez-Trinidad, Angel, Cartwright, Ashley, Pottmaier, Daphiny, Taheri, Omid, Outevsky, David, Stepanic, Stanley, Perry, Samuel, Askew, Luke, Rodríguez, Raúl Adrián Huerta, Dendane, Abdelkader, Ali, Sam, Lorena, Ricardo, Iyer, Krishnamurthy, Salauddin, Sk Md, Islam, Murat, Gonzalez, Juan, Ducey, Josh, Campbell, Russell, Somrak, Maja, Mavroudis, Vasilios, Vergo, Eric, Qin, Juehang, Borbás, Benjámin, Chu, Eric, Lindsey, Jack, Radhakrishnan, Anil, Jallon, Antoine, McInnis, I. M. J., Hoover, Alex, Möller, Sören, Bian, Song, Lai, John, Patwardhan, Tejal, Yue, Summer, Wang, Alexandr, and Hendrycks, Dan
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence ,Computer Science - Computation and Language - Abstract
Benchmarks are important tools for tracking the rapid advancements in large language model (LLM) capabilities. However, benchmarks are not keeping pace in difficulty: LLMs now achieve over 90\% accuracy on popular benchmarks like MMLU, limiting informed measurement of state-of-the-art LLM capabilities. In response, we introduce Humanity's Last Exam (HLE), a multi-modal benchmark at the frontier of human knowledge, designed to be the final closed-ended academic benchmark of its kind with broad subject coverage. HLE consists of 3,000 questions across dozens of subjects, including mathematics, humanities, and the natural sciences. HLE is developed globally by subject-matter experts and consists of multiple-choice and short-answer questions suitable for automated grading. Each question has a known solution that is unambiguous and easily verifiable, but cannot be quickly answered via internet retrieval. State-of-the-art LLMs demonstrate low accuracy and calibration on HLE, highlighting a significant gap between current LLM capabilities and the expert human frontier on closed-ended academic questions. To inform research and policymaking upon a clear understanding of model capabilities, we publicly release HLE at https://lastexam.ai., Comment: 25 pages, 6 figures
- Published
- 2025
4. End-to-end workflow for machine learning-based qubit readout with QICK and hls4ml
- Author
-
Di Guglielmo, Giuseppe, Du, Botao, Campos, Javier, Boltasseva, Alexandra, Dixit, Akash V., Fahim, Farah, Kudyshev, Zhaxylyk, Lopez, Santiago, Ma, Ruichao, Perdue, Gabriel N., Tran, Nhan, Yesilyurt, Omer, and Bowring, Daniel
- Subjects
Quantum Physics ,Computer Science - Machine Learning - Abstract
We present an end-to-end workflow for superconducting qubit readout that embeds co-designed Neural Networks (NNs) into the Quantum Instrumentation Control Kit (QICK). Capitalizing on the custom firmware and software of the QICK platform, which is built on Xilinx RFSoC FPGAs, we aim to leverage machine learning (ML) to address critical challenges in qubit readout accuracy and scalability. The workflow utilizes the hls4ml package and employs quantization-aware training to translate ML models into hardware-efficient FPGA implementations via user-friendly Python APIs. We experimentally demonstrate the design, optimization, and integration of an ML algorithm for single transmon qubit readout, achieving 96% single-shot fidelity with a latency of 32ns and less than 16% FPGA look-up table resource utilization. Our results offer the community an accessible workflow to advance ML-driven readout and adaptive control in quantum information processing applications.
- Published
- 2025
5. Idiom Detection in Sorani Kurdish Texts
- Author
-
Omer, Skala Kamaran and Hassani, Hossein
- Subjects
Computer Science - Computation and Language - Abstract
Idiom detection using Natural Language Processing (NLP) is the computerized process of recognizing figurative expressions within a text that convey meanings beyond the literal interpretation of the words. While idiom detection has seen significant progress across various languages, the Kurdish language faces a considerable research gap in this area despite the importance of idioms in tasks like machine translation and sentiment analysis. This study addresses idiom detection in Sorani Kurdish by approaching it as a text classification task using deep learning techniques. To tackle this, we developed a dataset containing 10,580 sentences embedding 101 Sorani Kurdish idioms across diverse contexts. Using this dataset, we developed and evaluated three deep learning models: KuBERT-based transformer sequence classification, a Recurrent Convolutional Neural Network (RCNN), and a BiLSTM model with an attention mechanism. The evaluations revealed that the transformer model, the fine-tuned BERT, consistently outperformed the others, achieving nearly 99% accuracy while the RCNN achieved 96.5% and the BiLSTM 80%. These results highlight the effectiveness of Transformer-based architectures in low-resource languages like Kurdish. This research provides a dataset, three optimized models, and insights into idiom detection, laying a foundation for advancing Kurdish NLP., Comment: 22 pages, 8 figures, 7 tables
- Published
- 2025
6. Experimental Realizations of Information Engines: Beyond Proof of Concept
- Author
-
Goerlich, Rémi, Hoek, Laura, Chor, Omer, Rahav, Saar, and Roichman, Yael
- Subjects
Condensed Matter - Statistical Mechanics ,Condensed Matter - Soft Condensed Matter - Abstract
Gathering information about a system enables greater control over it. This principle lies at the core of information engines, which use measurement-based feedback to rectify thermal noise and convert information into work. Originating from Maxwell's and Szil\'ard's thought experiments, the thermodynamics of information engines has steadily advanced, with recent experimental realizations both confirming established results and pushing the field forward. Coupled with technological advances and developments in nonequilibrium thermodynamics, novel implementations of information engines continue to challenge theoretical understanding. In this perspective, we discuss recent progress and highlight new opportunities, such as applying information engines to active, many-body, and inertial systems, and leveraging tools like optimal control to design their driving protocols., Comment: 7 pages 3 figures
- Published
- 2025
7. TokenVerse: Versatile Multi-concept Personalization in Token Modulation Space
- Author
-
Garibi, Daniel, Yadin, Shahar, Paiss, Roni, Tov, Omer, Zada, Shiran, Ephrat, Ariel, Michaeli, Tomer, Mosseri, Inbar, and Dekel, Tali
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
We present TokenVerse -- a method for multi-concept personalization, leveraging a pre-trained text-to-image diffusion model. Our framework can disentangle complex visual elements and attributes from as little as a single image, while enabling seamless plug-and-play generation of combinations of concepts extracted from multiple images. As opposed to existing works, TokenVerse can handle multiple images with multiple concepts each, and supports a wide-range of concepts, including objects, accessories, materials, pose, and lighting. Our work exploits a DiT-based text-to-image model, in which the input text affects the generation through both attention and modulation (shift and scale). We observe that the modulation space is semantic and enables localized control over complex concepts. Building on this insight, we devise an optimization-based framework that takes as input an image and a text description, and finds for each word a distinct direction in the modulation space. These directions can then be used to generate new images that combine the learned concepts in a desired configuration. We demonstrate the effectiveness of TokenVerse in challenging personalization settings, and showcase its advantages over existing methods. project's webpage in https://token-verse.github.io/
- Published
- 2025
8. QualityFlow: An Agentic Workflow for Program Synthesis Controlled by LLM Quality Checks
- Author
-
Hu, Yaojie, Zhou, Qiang, Chen, Qihong, Li, Xiaopeng, Liu, Linbo, Zhang, Dejiao, Kachroo, Amit, Oz, Talha, and Tripp, Omer
- Subjects
Computer Science - Software Engineering ,Computer Science - Artificial Intelligence - Abstract
We introduce QualityFlow, a dynamic agentic workflow for program synthesis. Given the English description of a programming problem and a set of unit tests, the model's goal is to synthesize the correct program that solves the problem and passes the tests. QualityFlow consists of multiple large language model (LLM) agents that resemble a software development team, including code generation, testing, and self-debugging. Existing program synthesis methods face three major limitations: assumption of visible unit test conformity, bottleneck of synthesized test quality, and deviation of self-debugging trajectory. To address them, we propose the LLM Quality Checker, which explicitly "imagines" whether the synthesized programs' execution would conform to the unit tests. The Quality Checks dynamically control the workflow, including actions to submit the final answer, clarify the problem statement, and revert previous workflow steps. As a result, our Quality Checker can precisely accept any correct program, mitigate faulty synthesized tests, and prevent potential workflow deviation. The success of the Quality Checker further enables Diversified Prompting, which encourages variations in LLM responses to maximize the possibility that a correct program appears and passes the quality check. In experiments, QualityFlow establishes the state-of-the-art results on four program synthesis benchmarks: MBPP, HumanEval, and the stricter evaluations of both MBPP and HumanEval from EvalPlus. Our systematic analysis shows that the dynamic workflow controlled by LLM quality checks can outperform static workflows and single-attempt zero-shot synthesis. The Quality Checker is the center of our investigation, and we dissect its individual performance and integrated impact on the workflow accuracy, as well as other ablations experiments to justify our workflow design.
- Published
- 2025
9. Multi-Stage Active Sequential Hypothesis Testing with Clustered Hypotheses
- Author
-
Vershinin, George, Cohen, Asaf, and Gurewitz, Omer
- Subjects
Computer Science - Information Theory - Abstract
We consider the problem where an active Decision-Maker (DM) is tasked to identify the true hypothesis using as few as possible observations while maintaining accuracy. The DM collects observations according to its determined actions and knows the distributions under each hypothesis. We propose a deterministic and adaptive multi-stage hypothesis-elimination strategy where the DM selects an action, applies it repeatedly, and discards hypotheses in light of its obtained observations. The DM selects actions based on maximal separation expressed by the distance between the parameter vectors of each distribution under each hypothesis. Close distributions can be clustered, simplifying the search and significantly reducing the number of required observations. Our algorithms achieve vanishing Average Bayes Risk (ABR) as the error probability approaches zero, i.e., the algorithm is asymptotically optimal. Furthermore, we show that the ABR is bounded when the number of hypotheses grows. Simulations are carried out to evaluate the algorithm's performance compared to another multi-stage hypothesis-elimination algorithm, where an improvement of several orders of magnitude in the mean number of observations required is observed., Comment: 7 pages, 2 figures
- Published
- 2025
10. OpenAI ChatGPT interprets Radiological Images: GPT-4 as a Medical Doctor for a Fast Check-Up
- Author
-
Aydin, Omer and Karaarslan, Enis
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
OpenAI released version GPT-4 on March 14, 2023, following the success of ChatGPT, which was announced in November 2022. In addition to the existing GPT-3 features, GPT-4 has the ability to interpret images. To achieve this, the processing power and model have been significantly improved. The ability to process and interpret images goes far beyond the applications and effectiveness of artificial intelligence. In this study, we will first explore the interpretation of radiological images in healthcare using artificial intelligence (AI). Then, we will experiment with the image interpretation capability of the GPT-4. In this way, we will address the question of whether artificial intelligence (AI) can replace a healthcare professional (e.g., a medical doctor) or whether it can be used as a decision support tool that makes decisions easier and more reliable.
- Published
- 2025
11. Rising Rested MAB with Linear Drift
- Author
-
Amichay, Omer and Mansour, Yishay
- Subjects
Computer Science - Machine Learning - Abstract
We consider non-stationary multi-arm bandit (MAB) where the expected reward of each action follows a linear function of the number of times we executed the action. Our main result is a tight regret bound of $\tilde{\Theta}(T^{4/5}K^{3/5})$, by providing both upper and lower bounds. We extend our results to derive instance dependent regret bounds, which depend on the unknown parametrization of the linear drift of the rewards.
- Published
- 2025
12. Propagation velocity measurements of substrate phonon bursts using MKIDs for superconducting circuits
- Author
-
Moshel, Guy, Rabinowitz, Omer, Blumenthal, Eliya, and Hacohen-Gourgy, Shay
- Subjects
Condensed Matter - Superconductivity - Abstract
High-energy bursts in superconducting quantum circuits from various radiation sources have recently become a practical concern due to induced errors and their propagation in the chip. The speed and distance of these disturbances have practical implications. We used a linear array of multiplexed MKIDs on a single silicon chip to measure the propagation velocity of a localized high-energy burst, introduced by driving a Normal metal- Insulator-Superconductor (NIS) junction. We observed a reduction in the apparent propagation velocity with NIS power, which is due to the combined effect of reduced phonon flux with distance and the existence of a minimum detectable QP density in the MKIDs. A simple theoretical model is fitted to extract the longitudinal phonon velocity in the substrate and the conversion efficiency of phonons to QPs in the superconductor.
- Published
- 2025
13. Equity Impacts of Public Transit Network Redesign with Shared Autonomous Mobility Services
- Author
-
Ng, Max T. M., Raymer, Meredith, Mahmassani, Hani S., Verbas, Omer, and Cokyasar, Taner
- Subjects
Electrical Engineering and Systems Science - Systems and Control ,Mathematics - Optimization and Control - Abstract
This study examines the equity impacts of integrating shared autonomous mobility services (SAMS) into transit system redesign. Using the Greater Chicago area as a case study, we compare two optimization objectives in multimodal transit network redesign: minimizing total generalized costs (equity-agnostic) versus prioritizing service in low-income areas (equity-focused). We evaluate the achieved accessibility of clustered zones with redesigned transit networks under two objectives, compared to driving and the existing transit network. The transit access gaps across zones and between transit and driving are found to be generally reduced with the introduction of SAMS, but less so with the subsequent improved infrastructure under budget. Differential improvement in equity is seen across suburbs and areas of the city, reflecting the disparity in current transit access and improvement potential. In particular, SAMS bridges the transit access gaps in suburban and city areas currently underserved by transit. The City of Chicago, which is also disproportionately home to vulnerable populations, offers an avenue to improve vertical equity. These findings demonstrate that SAMS can enhance both horizontal and vertical equity in transit systems, particularly when equity is explicitly incorporated into the design objective., Comment: Restructuring the paper for more precise research direction
- Published
- 2025
14. A Neural Network-Based Search for Unmodeled Transients in LIGO-Virgo-KAGRA's Third Observing Run
- Author
-
Raikman, Ryan, Moreno, Eric A., Govorkova, Katya, Soni, Siddharth, Marx, Ethan, Benoit, William, Gunny, Alec, Chatterjee, Deep, Reissel, Christina, Desai, Malina M., Omer, Rafia, Saleem, Muhammed, Harris, Philip, Katsavounidis, Erik, Coughlin, Michael W., and Rankin, Dylan
- Subjects
General Relativity and Quantum Cosmology ,Astrophysics - Instrumentation and Methods for Astrophysics ,Computer Science - Machine Learning - Abstract
This paper presents the results of a Neural Network (NN)-based search for short-duration gravitational-wave transients in data from the third observing run of LIGO, Virgo, and KAGRA. The search targets unmodeled transients with durations of milliseconds to a few seconds in the 30-1500 Hz frequency band, without assumptions about the incoming signal direction, polarization, or morphology. Using the Gravitational Wave Anomalous Knowledge (GWAK) method, three compact binary coalescences (CBCs) identified by existing pipelines are successfully detected, along with a range of detector glitches. The algorithm constructs a low-dimensional embedded space to capture the physical features of signals, enabling the detection of CBCs, detector glitches, and unmodeled transients. This study demonstrates GWAK's ability to enhance gravitational-wave searches beyond the limits of existing pipelines, laying the groundwork for future detection strategies.
- Published
- 2024
15. Joint Optimization of Multimodal Transit Frequency and Shared Autonomous Vehicle Fleet Size with Hybrid Metaheuristic and Nonlinear Programming
- Author
-
Ng, Max T. M., Mahmassani, Hani S., Tong, Draco, Verbas, Omer, and Cokyasar, Taner
- Subjects
Electrical Engineering and Systems Science - Systems and Control ,Mathematics - Optimization and Control - Abstract
This paper presents an optimization framework for the joint multimodal transit frequency and shared autonomous vehicle (SAV) fleet size optimization, a problem variant of the transit network frequency setting problem (TNFSP) that explicitly considers mode choice behavior and route selection. To address the non-linear non-convex optimization problem, we develop a hybrid solution approach that combines metaheuristics (particle swarm optimization, PSO) with local nonlinear programming (NLP) improvement, incorporating approximation models for SAV waiting time, multimodal route choice, and mode choice. Applied to the Chicago metropolitan area, our method achieves a 33.3% increase in transit ridership., Comment: 21 pages, 5 figures, a previous version is under review for the Conference on Advanced Systems in Public Transport and TransitData 2025 in Kyoto, Japan on 1 - 4 July 2025
- Published
- 2024
16. Bayesian Optimization of Bilevel Problems
- Author
-
Ekmekcioglu, Omer, Aydin, Nursen, and Branke, Juergen
- Subjects
Computer Science - Machine Learning ,Mathematics - Optimization and Control - Abstract
Bilevel optimization, a hierarchical mathematical framework where one optimization problem is nested within another, has emerged as a powerful tool for modeling complex decision-making processes in various fields such as economics, engineering, and machine learning. This paper focuses on bilevel optimization where both upper-level and lower-level functions are black boxes and expensive to evaluate. We propose a Bayesian Optimization framework that models the upper and lower-level functions as Gaussian processes over the combined space of upper and lower-level decisions, allowing us to exploit knowledge transfer between different sub-problems. Additionally, we propose a novel acquisition function for this model. Our experimental results demonstrate that the proposed algorithm is highly sample-efficient and outperforms existing methods in finding high-quality solutions.
- Published
- 2024
17. Ab initio theory of the non-resonant Raman effect in crystals at finite temperature in comparison to experiment: The examples of GaN and BaZrS3
- Author
-
Knoop, Florian, Benshalom, Nimrod, Menahem, Matan, Gartner, Paul, Salzillo, Tommaso, Yaffe, Omer, and Hellman, Olle
- Subjects
Condensed Matter - Materials Science - Abstract
We present an ab initio theory of the non-resonant Raman scattering process in crystals at finite temperature in direct comparison with experiments. The theory incorporates the scattering geometry and polarization dependence of the Raman process and the small but finite wave vectors of the phonons for correctly describing the scattering with longitudinal optical (LO) modes in optically anisotropic solids. We implement the theory for first-order Raman scattering and showcase the approach for wurtzite Gallium Nitride and the complex chalcogenide perovskite BaZrS3 in comparison to experiment. We subsequently discuss several common estimates for second-order Raman scattering in complex materials, and highlight similarities and differences to established theoretical approaches and simulation protocols both from phonon theory and molecular dynamics., Comment: 16 pages, 8 figures
- Published
- 2024
18. Leveraging Weak Supervision for Cell Localization in Digital Pathology Using Multitask Learning and Consistency Loss
- Author
-
Cesur, Berke Levent, Karasayar, Ayse Humeyra Dur, Bulutay, Pinar, Kapucuoglu, Nilgun, Mericoz, Cisel Aydin, Eren, Handan, Dilbaz, Omer Faruk, Osmanli, Javidan, Yetkili, Burhan Soner, Kulac, Ibrahim, Koyuncu, Can Fahrettin, and Gunduz-Demir, Cigdem
- Subjects
Electrical Engineering and Systems Science - Image and Video Processing ,Computer Science - Computer Vision and Pattern Recognition - Abstract
Cell detection and segmentation are integral parts of automated systems in digital pathology. Encoder-decoder networks have emerged as a promising solution for these tasks. However, training of these networks has typically required full boundary annotations of cells, which are labor-intensive and difficult to obtain on a large scale. However, in many applications, such as cell counting, weaker forms of annotations--such as point annotations or approximate cell counts--can provide sufficient supervision for training. This study proposes a new mixed-supervision approach for training multitask networks in digital pathology by incorporating cell counts derived from the eyeballing process--a quick visual estimation method commonly used by pathologists. This study has two main contributions: (1) It proposes a mixed-supervision strategy for digital pathology that utilizes cell counts obtained by eyeballing as an auxiliary supervisory signal to train a multitask network for the first time. (2) This multitask network is designed to concurrently learn the tasks of cell counting and cell localization, and this study introduces a consistency loss that regularizes training by penalizing inconsistencies between the predictions of these two tasks. Our experiments on two datasets of hematoxylin-eosin stained tissue images demonstrate that the proposed approach effectively utilizes the weakest form of annotation, improving performance when stronger annotations are limited. These results highlight the potential of integrating eyeballing-derived ground truths into the network training, reducing the need for resource-intensive annotations.
- Published
- 2024
19. RAG for Effective Supply Chain Security Questionnaire Automation
- Author
-
Reza, Zaynab Batool, Syed, Abdul Rafay, Iqbal, Omer, Mensah, Ethel, Liu, Qian, Rahman, Maxx Richard, and Maass, Wolfgang
- Subjects
Computer Science - Machine Learning - Abstract
In an era where digital security is crucial, efficient processing of security-related inquiries through supply chain security questionnaires is imperative. This paper introduces a novel approach using Natural Language Processing (NLP) and Retrieval-Augmented Generation (RAG) to automate these responses. We developed QuestSecure, a system that interprets diverse document formats and generates precise responses by integrating large language models (LLMs) with an advanced retrieval system. Our experiments show that QuestSecure significantly improves response accuracy and operational efficiency. By employing advanced NLP techniques and tailored retrieval mechanisms, the system consistently produces contextually relevant and semantically rich responses, reducing cognitive load on security teams and minimizing potential errors. This research offers promising avenues for automating complex security management tasks, enhancing organizational security processes.
- Published
- 2024
20. Ultra-wideband Double-Directionally Resolved Channel Measurements of Line-of-Sight Microcellular Scenarios in the Upper Mid-band
- Author
-
Abbasi, Naveed A., Arana, Kelvin, Gomez-Ponce, Jorge, Pal, Tathagat, Vasudevan, Vikram, Bist, Atulya, Serbetci, Omer Gokalp, Nam, Young Han, Zhang, Charlie, and Molisch, Andreas F.
- Subjects
Electrical Engineering and Systems Science - Systems and Control - Abstract
The growing demand for higher data rates and expanded bandwidth is driving the exploration of new frequency ranges, including the upper mid-band spectrum (6-24 GHz), which is a promising candidate for future Frequency Range 3 (FR3) applications. This paper presents ultra-wideband double-directional channel measurements in line-of-sight microcellular scenarios within the upper mid-band spectrum (6-18 GHz). Conducted in an urban street canyon environment, these measurements explore key channel characteristics such as power delay profiles, angular power spectra, path loss, delay spread, and angular spread to provide insights essential for robust communication system design. Our results reveal that path loss values for both omni-directional and best beam configurations are lower than free-space predictions due to multipath contributions from the environment. Analysis also indicates a high degree of stability in delay spread and angular spread across the entire band, with small variation between sub-bands.
- Published
- 2024
21. Hierarchical Control of State Transitions in Dense Associative Memories
- Author
-
Grishechkin, Anton, Mukherjee, Abhirup, and Karin, Omer
- Subjects
Quantitative Biology - Cell Behavior ,Quantitative Biology - Molecular Networks - Abstract
Dense Associative Memories are dynamical systems that can encode for many attractor memory patterns through higher-order interactions. Here we analyze a continuous form of Dense Associative Memories that emerges in biological and engineered settings, including in the gene regulatory networks that control cellular identity. The dynamics are governed by the interplay between an inverse-temperature-like parameter $\beta$ and an input field $\textbf{w}$. The parameter $\beta$ controls the attractor landscape structure: at large $\beta$, memory patterns are stable attractors, while at lower $\beta$ values, the attractors are associated with progenitor states-weighted combinations of two or more memory patterns. We associate progenitor states with self-similarity of the model following a coarse-graining transformation on memory pattern subsets. We use this transformation to propose a hierarchical model for the control of the identity, stability, and basins of attraction of the progenitor states which facilitates transitions between memory patterns through an annealing-like mechanism. We use this framework to explain the dynamical regulation of blood formation, demonstrating how robust control of attractor transitions may emerge in biological networks and providing a mathematical basis for well-established experimental observations on the hierarchical control of cell identity.
- Published
- 2024
22. Multi-objective Combinatorial Methodology for Nuclear Reactor Site Assessment: A Case Study for the United States
- Author
-
Erdem, Omer, Daley, Kevin, Hoelzle, Gabrielle, and Radaideh, Majdi I.
- Subjects
Computer Science - Computational Engineering, Finance, and Science ,Computer Science - Machine Learning - Abstract
As the global demand for clean energy intensifies to achieve sustainability and net-zero carbon emission goals, nuclear energy stands out as a reliable solution. However, fully harnessing its potential requires overcoming key challenges, such as the high capital costs associated with nuclear power plants (NPPs). One promising strategy to mitigate these costs involves repurposing sites with existing infrastructure, including coal power plant (CPP) locations, which offer pre-built facilities and utilities. Additionally, brownfield sites - previously developed or underutilized lands often impacted by industrial activity - present another compelling alternative. These sites typically feature valuable infrastructure that can significantly reduce the costs of NPP development. This study introduces a novel multi-objective optimization methodology, leveraging combinatorial search to evaluate over 30,000 potential NPP sites in the United States. Our approach addresses gaps in the current practice of assigning pre-determined weights to each site attribute that could lead to bias in the ranking. Each site is assigned a performance-based score, derived from a detailed combinatorial analysis of its site attributes. The methodology generates a comprehensive database comprising site locations (inputs), attributes (outputs), site score (outputs), and the contribution of each attribute to the site score (outputs). We then use this database to train a machine learning neural network model, enabling rapid predictions of nuclear siting suitability across any location in the contiguous United States., Comment: 29 pages, 8 Tables, 12 figures
- Published
- 2024
23. Network and timing effects in social learning
- Author
-
Hann-Caruthers, Wade, Pan, Minghao, and Tamuz, Omer
- Subjects
Economics - Theoretical Economics - Abstract
We consider a group of agents who can each take an irreversible costly action whose payoff depends on an unknown state. Agents learn about the state from private signals, as well as from past actions of their social network neighbors, which creates an incentive to postpone taking the action. We show that outcomes depend on network structure: on networks with a linear structure patient agents do not converge to the first-best action, while on regular directed tree networks they do.
- Published
- 2024
24. Simulation of Multi-Stage Attack and Defense Mechanisms in Smart Grids
- Author
-
Sen, Omer, Ivanov, Bozhidar, Kloos, Christian, Zol_, Christoph, Lutat, Philipp, Henze, Martin, and Ulbig, Andreas
- Subjects
Computer Science - Cryptography and Security - Abstract
The power grid is a critical infrastructure essential for public safety and welfare. As its reliance on digital technologies grows, so do its vulnerabilities to sophisticated cyber threats, which could severely disrupt operations. Effective protective measures, such as intrusion detection and decision support systems, are essential to mitigate these risks. Machine learning offers significant potential in this field, yet its effectiveness is constrained by the limited availability of high-quality data due to confidentiality and access restrictions. To address this, we introduce a simulation environment that replicates the power grid's infrastructure and communication dynamics. This environment enables the modeling of complex, multi-stage cyber attacks and defensive responses, using attack trees to outline attacker strategies and game-theoretic approaches to model defender actions. The framework generates diverse, realistic attack data to train machine learning algorithms for detecting and mitigating cyber threats. It also provides a controlled, flexible platform to evaluate emerging security technologies, including advanced decision support systems. The environment is modular and scalable, facilitating the integration of new scenarios without dependence on external components. It supports scenario generation, data modeling, mapping, power flow simulation, and communication traffic analysis in a cohesive chain, capturing all relevant data for cyber security investigations under consistent conditions. Detailed modeling of communication protocols and grid operations offers insights into attack propagation, while datasets undergo validation in laboratory settings to ensure real-world applicability. These datasets are leveraged to train machine learning models for intrusion detection, focusing on their ability to identify complex attack patterns within power grid operations.
- Published
- 2024
- Full Text
- View/download PDF
25. Towards a Comprehensive Framework for Cyber-Incident Response Decision Support in Smart Grids
- Author
-
Sen, Omer, Aust, Yanico, Neumuller, Martin, Hacker, Immanuel, and Ulbig, Andreas
- Subjects
Computer Science - Cryptography and Security - Abstract
The modernization of power grid infrastructures necessitates the incorporation of decision support systems to effectively mitigate cybersecurity threats. This paper presents a comprehensive framework based on integrating Attack-Defense Trees and the Multi-Criteria Decision Making method to enhance smart grid cybersecurity. By analyzing risk attributes and optimizing defense strategies, this framework enables grid operators to prioritize critical security measures. Additionally, this paper incorporates findings on decision-making processes in intelligent power systems to present a comprehensive approach to grid cybersecurity. The proposed model aims to optimize the effectiveness and efficiency of grid cybersecurity efforts while offering insights into future grid management challenges.
- Published
- 2024
26. A Kunen-Like Model with a Critical Failure of the Continuum Hypothesis
- Author
-
Ben-Neria, Omer and Kaplan, Eyal
- Subjects
Mathematics - Logic - Abstract
We construct a model of the form $L[A,U]$ that exhibits the simplest structural behavior of $\sigma$-complete ultrafilters in a model of set theory with a single measurable cardinal $\kappa$ , yet satisfies $2^\kappa = \kappa^{++}$. This result establishes a limitation on the extent to which structural properties of ultrafilters can determine the cardinal arithmetic at large cardinals, and answers a question posed by Goldberg concerning the failure of the Continuum Hypothesis at a measurable cardinal in a model of the Ultrapower Axiom. The construction introduces several methods in extensions of embeddings theory and fine-structure-based forcing, designed to control the behavior of non-normal ultrafilters in generic extensions.
- Published
- 2024
27. Encryption-Aware Anomaly Detection in Power Grid Communication Networks
- Author
-
Sen, Omer, Gurabi, Mehdi Akbari, Deruelle, Milan, Ulbig, Andreas, and Decker, Stefan
- Subjects
Computer Science - Cryptography and Security - Abstract
The shift to smart grids has made electrical power systems more vulnerable to sophisticated cyber threats. To protect these systems, holistic security measures that encompass preventive, detective, and reactive components are required, even with encrypted data. However, traditional intrusion detection methods struggle with encrypted traffic, our research focuses on the low-level communication layers of encrypted power grid systems to identify irregular patterns using statistics and machine learning. Our results indicate that a harmonic security concept based on encrypted traffic and anomaly detection is promising for smart grid security; however, further research is necessary to improve detection accuracy.
- Published
- 2024
28. On Process Awareness in Detecting Multi-stage Cyberattacks in Smart Grids
- Author
-
Sen, Omer, Aust, Yanico, Glomb, Simon, and Ulbig, Andreas
- Subjects
Computer Science - Cryptography and Security - Abstract
This study delves into the role of process awareness in enhancing intrusion detection within Smart Grids, considering the increasing fusion of ICT in power systems and the associated emerging threats. The research harnesses a co-simulation environment, encapsulating IT, OT, and ET layers, to model multi-stage cyberattacks and evaluate machine learning-based IDS strategies. The key observation is that process-aware IDS demonstrate superior detection capabilities, especially in scenarios closely tied to operational processes, as opposed to IT-only IDS. This improvement is notable in distinguishing complex cyber threats from regular IT activities. The findings underscore the significance of further developing sophisticated IDS benchmarks and digital twin datasets in Smart Grid environments, paving the way for more resilient cybersecurity infrastructures.
- Published
- 2024
29. A cyber-physical digital twin approach to replicating realistic multi-stage cyberattacks on smart grids
- Author
-
Sen, Omer, Bleser, Nathalie, Henze, Martin, and Ulbig, Andreas
- Subjects
Computer Science - Cryptography and Security - Abstract
The integration of information and communication technology in distribution grids presents opportunities for active grid operation management, but also increases the need for security against power outages and cyberattacks. This paper examines the impact of cyberattacks on smart grids by replicating the power grid in a secure laboratory environment as a cyber-physical digital twin. A simulation is used to study communication infrastructures for secure operation of smart grids. The cyber-physical digital twin approach combines communication network emulation and power grid simulation in a common modular environment, and is demonstrated through laboratory tests and attack replications.
- Published
- 2024
- Full Text
- View/download PDF
30. Digital Twin for Evaluating Detective Countermeasures in Smart Grid Cybersecurity
- Author
-
Sen, Omer, Bleser, Nathalie, and Ulbig, Andreas
- Subjects
Computer Science - Cryptography and Security - Abstract
As the integration of digital technologies and communication systems continues within distribution grids, new avenues emerge to tackle energy transition challenges. Nevertheless, this deeper technological immersion amplifies the necessity for resilience against threats, encompassing both systemic outages and targeted cyberattacks. To ensure the robustness and safeguarding of vital infrastructure, a thorough examination of potential smart grid vulnerabilities and subsequent countermeasure development is essential. This study delves into the potential of digital twins, replicating a smart grid's cyber-physical laboratory environment, thereby enabling focused cybersecurity assessments. Merging the nuances of communication network emulation and power network simulation, we introduce a flexible, comprehensive digital twin model equipped for hardware-in-the-loop evaluations. Through this innovative framework, we not only verify and refine security countermeasures but also underscore their role in maintaining grid stability and trustworthiness.
- Published
- 2024
- Full Text
- View/download PDF
31. AI-based Attacker Models for Enhancing Multi-Stage Cyberattack Simulations in Smart Grids Using Co-Simulation Environments
- Author
-
Sen, Omer, Pohl, Christoph, Hacker, Immanuel, Stroot, Markus, and Ulbig, Andreas
- Subjects
Computer Science - Cryptography and Security - Abstract
The transition to smart grids has increased the vulnerability of electrical power systems to advanced cyber threats. To safeguard these systems, comprehensive security measures-including preventive, detective, and reactive strategies-are necessary. As part of the critical infrastructure, securing these systems is a major research focus, particularly against cyberattacks. Many methods are developed to detect anomalies and intrusions and assess the damage potential of attacks. However, these methods require large amounts of data, which are often limited or private due to security concerns. We propose a co-simulation framework that employs an autonomous agent to execute modular cyberattacks within a configurable environment, enabling reproducible and adaptable data generation. The impact of virtual attacks is compared to those in a physical lab targeting real smart grids. We also investigate the use of large language models for automating attack generation, though current models on consumer hardware are unreliable. Our approach offers a flexible, versatile source for data generation, aiding in faster prototyping and reducing development resources and time.
- Published
- 2024
- Full Text
- View/download PDF
32. Numerical approach to compressible shallow-water dynamics of neutron-star spreading layers
- Author
-
Rusakov, Aleksandr, Abolmasov, Pavel, and Bromberg, Omer
- Subjects
Astrophysics - High Energy Astrophysical Phenomena - Abstract
A weakly magnetized neutron star (NS) undergoing disk accretion should release about a half of its power in a compact region known as the accretion boundary layer. Latitudinal spread of the accreted matter and efficient radiative cooling justify the approach to this flow as a two-dimensional spreading layer (SL) on the surface of the star. Numerical simulations of SLs are challenging because of the curved geometry and supersonic nature of the problem. We develop a new two-dimensional hydrodynamics code that uses the multislope second-order MUSCL scheme in combination with an HLLC+ Riemann solver on an arbitrary irregular mesh on a spherical surface. The code is suitable and accurate for Mach numbers at least up to 5-10. Adding sinks and sources to the conserved variables, we simulate constant-rate accretion onto a spherical NS. During the early stages of accretion, heating in the equatorial region triggers convective instability that causes rapid mixing in latitudinal direction. One of the outcomes of the instability is the development of a two-armed `tennis ball' pattern rotating as a rigid body. From the point of view of a high-inclination observer, its contribution to the light curve is seen as a high-quality-factor quasi-periodic oscillation mode with a frequency considerably smaller than the rotation frequency of the matter in the SL. Other variability modes seen in the simulated light curves are probably associated with low-azimuthal-number Rossby waves., Comment: comments welcome, to be submitted to ApJ within a week
- Published
- 2024
33. Decoupling Optical and Thermal Responses: Thermo-optical Nonlinearities Unlock MHz Transmission Modulation in Dielectric Metasurfaces
- Author
-
Karaman, Omer Can, Naidu, Gopal Narmada, Bowman, Alan R., Dayi, Elif Nur, and Tagliabue, Giulia
- Subjects
Physics - Optics ,Physics - Applied Physics - Abstract
Thermo-optical nonlinearities (TONL) in metasurfaces enable dynamic control of optical properties like transmission, reflection, and absorption through external stimuli such as laser irradiation or temperature. As slow thermal dynamics of extended systems are expected to limit modulation speeds ultimately, research has primarily focused on steady-state effects. In this study, we investigate photo-driven TONL in amorphous silicon (a-Si) metasurfaces both under steady-state and, most importantly, dynamic conditions (50 kHz modulation) using a 488 nm continuous-wave pump laser. First, we show that a non-monotonic change in the steady-state transmission occurs at wavelengths longer than the electric-dipole resonance (800 nm). In particular, at 815 nm transmission first decreases by 30% and then increases by 30% as the laser intensity is raised to 5 mW/{\mu}m2. Next, we demonstrate that TONL decouple the thermal and optical characteristic times, the latter being up to 7 times shorter in the tested conditions (i.e {\tau}opt =0.5 {\mu}s vs {\tau}th =3.5 {\mu}s). Most remarkably, we experimentally demonstrate that combining these two effects enables optical modulation at twice the speed (100 kHz) of the excitation laser modulation. We finally show how to achieve all-optical transmission modulation at MHz speeds with large amplitudes (85%). Overall, these results show that photo-driven TONL produce large and fully reversible transmission modulation in dielectric metasurfaces with fast and adjustable speeds. Therefore, they open completely new opportunities toward exploiting TONL in dynamically reconfigurable systems, from optical switching to wavefront manipulation., Comment: 12 pages, 4 figures
- Published
- 2024
34. Laughter and Classroom Boundaries
- Author
-
Moriah Omer-Attali, Adam Lefstein, and Hadar Netz
- Abstract
While once forbidden in classrooms, laughter is increasingly encouraged as contributing to a positive learning environment. However, analyses of laughter in conversation show that laughter performs multiple social functions, some of which are not necessarily positive. Applying this lens, this study investigates the interactional functions of laughter in Israeli upper-primary classrooms. Using micro-ethnographic, multimodal methods, we analyzed 27 laughter events drawn from 35 lessons taught by five teachers in four classrooms. We found that student laughter was for the most part treated as undesirable and occurred rarely. When it did occur, laughter primarily played a role in marking, maintaining, or negotiating symbolic and social classroom boundaries. Along with nonverbal cues, such as eye contact and body language, students' and teachers' laughter served multiple functions in relation to these boundaries, including emphasizing social boundaries, subverting teacher authority, bypassing norms, and responding to transgressions.
- Published
- 2025
- Full Text
- View/download PDF
35. Social Anxiety in Online Instructional Discussion Forums: The Role of Participation Styles and ICT Infrastructure
- Author
-
Murat Cinar, Omer Demir, and Sinan Keskin
- Abstract
Examination of the personal characteristics (i.e., gender, participation styles) of participants and the technical infrastructure (i.e., device type, internet connection type) of Instructional Discussion Forums (IDFs) can provide functional clues for mitigating social anxiety in these settings. In this context, this research investigated variances in learners' participation styles and social anxiety in IDFs in terms of gender and ICT availability. In addition, it explored the predictive relationships between participation styles and social anxiety. A sample of 272 freshman undergraduate students discussed various topics related to Internet ethics for three weeks through an IDF. The results indicated that participation styles differed by gender and ICT availability in several respects. First, handheld devices and cellular internet connections exerted a medium-size effect on social anxiety. Further, "to get information" and "to fulfill requirement" purposes in the "Why" dimension of participation styles had a small predictive relationship with social anxiety, as did "analytical" and "practical" participation approaches in the "How" dimension. Of these, only the "to get information" purpose negatively predicted social anxiety. Overall, participation styles accounted for 19.1% of the variance in social anxiety. Based on the findings, future directions and practical implications are suggested for both researchers and practitioners.
- Published
- 2024
36. Close pine gap: Protesting genocide in central Australia
- Author
-
Omer, Lou and Doyle, Jorgen
- Published
- 2024
37. The Effect of the Online Flipped Learning Model on Secondary School Students' Academic Achievement, Attitudes towards Their Mathematics Course, and Cognitive Load
- Author
-
Seda Kavaz and Omer Kocak
- Abstract
This study aims to investigate the effect of the online flipped learning model (OFLM) when integrated into a mathematics course in an emergency remote teaching process on seventh grade students' academic achievement, their attitudes towards their mathematics course, and their cognitive load. The study was designed as a crossover experimental research model and conducted in two stages. In the first stage, 26 girls constituted the experimental group and 22 boys constituted the control group. In the second stage, the experimental and control groups were switched. In both stages, an academic achievement test was administered to the groups before and after implementation, an attitude test towards the mathematics course was applied to the experimental group before and after each stage, and a cognitive load test was administered to the groups after the live online classes each week. Also, the students' views about OFLM were obtained through qualitative methods. The findings indicate that there is a significant difference between the academic achievement of the experimental and control groups in favour of the experimental group in the first stage. However, in the second stage, no significant difference was found between the groups. Students had a more positive attitude towards the mathematics course when the flipped learning model was used. There was a significant difference in favour of the experimental groups in the cognitive load of the experimental and control groups in both stages except for the first week. This study provides evidence that OFLM contributed positively to the mathematics learning of secondary school students in distance education.
- Published
- 2024
- Full Text
- View/download PDF
38. Puzzle: Distillation-Based NAS for Inference-Optimized LLMs
- Author
-
Bercovich, Akhiad, Ronen, Tomer, Abramovich, Talor, Ailon, Nir, Assaf, Nave, Dabbah, Mohammad, Galil, Ido, Geifman, Amnon, Geifman, Yonatan, Golan, Izhak, Haber, Netanel, Karpas, Ehud, Koren, Roi, Levy, Itay, Molchanov, Pavlo, Mor, Shahar, Moshe, Zach, Nabwani, Najeeb, Puny, Omri, Rubin, Ran, Schen, Itamar, Shahaf, Ido, Tropp, Oren, Argov, Omer Ullman, Zilberstein, Ran, and El-Yaniv, Ran
- Subjects
Computer Science - Machine Learning - Abstract
Large language models (LLMs) have demonstrated remarkable capabilities, but their adoption is limited by high computational costs during inference. While increasing parameter counts enhances accuracy, it also widens the gap between state-of-the-art capabilities and practical deployability. We present Puzzle, a framework to accelerate LLM inference on specific hardware while preserving their capabilities. Through an innovative application of neural architecture search (NAS) at an unprecedented scale, Puzzle systematically optimizes models with tens of billions of parameters under hardware constraints. Our approach utilizes blockwise local knowledge distillation (BLD) for parallel architecture exploration and employs mixed-integer programming for precise constraint optimization. We demonstrate the real-world impact of our framework through Llama-3.1-Nemotron-51B-Instruct (Nemotron-51B), a publicly available model derived from Llama-3.1-70B-Instruct. Nemotron-51B achieves a 2.17x inference throughput speedup, fitting on a single NVIDIA H100 GPU while preserving 98.4% of the original model's capabilities. Nemotron-51B currently stands as the most accurate language model capable of inference on a single GPU with large batch sizes. Remarkably, this transformation required just 45B training tokens, compared to over 15T tokens used for the 70B model it was derived from. This establishes a new paradigm where powerful models can be optimized for efficient deployment with only negligible compromise of their capabilities, demonstrating that inference performance, not parameter count alone, should guide model selection. With the release of Nemotron-51B and the presentation of the Puzzle framework, we provide practitioners immediate access to state-of-the-art language modeling capabilities at significantly reduced computational costs.
- Published
- 2024
39. DIESEL -- Dynamic Inference-Guidance via Evasion of Semantic Embeddings in LLMs
- Author
-
Ganon, Ben, Zolfi, Alon, Hofman, Omer, Singh, Inderjeet, Kojima, Hisashi, Elovici, Yuval, and Shabtai, Asaf
- Subjects
Computer Science - Computation and Language ,Computer Science - Machine Learning - Abstract
In recent years, conversational large language models (LLMs) have shown tremendous success in tasks such as casual conversation, question answering, and personalized dialogue, making significant advancements in domains like virtual assistance, social interaction, and online customer engagement. However, they often generate responses that are not aligned with human values (e.g., ethical standards, safety, or social norms), leading to potentially unsafe or inappropriate outputs. While several techniques have been proposed to address this problem, they come with a cost, requiring computationally expensive training or dramatically increasing the inference time. In this paper, we present DIESEL, a lightweight inference guidance technique that can be seamlessly integrated into any autoregressive LLM to semantically filter undesired concepts from the response. DIESEL can function either as a standalone safeguard or as an additional layer of defense, enhancing response safety by reranking the LLM's proposed tokens based on their similarity to predefined negative concepts in the latent space. This approach provides an efficient and effective solution for maintaining alignment with human values. Our evaluation demonstrates DIESEL's effectiveness on state-of-the-art conversational models (e.g., Llama 3), even in challenging jailbreaking scenarios that test the limits of response safety. We further show that DIESEL can be generalized to use cases other than safety, providing a versatile solution for general-purpose response filtering with minimal computational overhead.
- Published
- 2024
40. Immobility of isolated swarmer cells due to local liquid depletion
- Author
-
Jose, Ajesh, Perez-Estay, Benjamin, Bendori, Shira Omer, Eldar, Avigdor, Kearns, Daniel B., Ariel, Gil, and Beer, Avraham
- Subjects
Condensed Matter - Soft Condensed Matter ,Physics - Biological Physics - Abstract
Bacterial swarming is a complex phenomenon in which thousands of self-propelled rod-shaped cells move coherently on surfaces, providing an excellent example of active matter. However, bacterial swarming is different from most studied examples of active systems because single isolated cells do not move, while clusters do. The biophysical aspects underlying this behavior are unclear. In this work we explore the case of low local cell densities, where single cells become temporarily immobile. We show that immobility is related to local depletion of liquid. In addition, it is also associated with the state of the flagella. Specifically, the flagellar bundles at (temporarily) liquid depleted regions are completely spread-out. Our results suggest that dry models of self-propelled agents, which only consider steric alignments and neglect hydrodynamic effects, are oversimplified and are not sufficient to describe swarming bacteria.
- Published
- 2024
41. OPMOS: Ordered Parallel Multi-Objective Shortest-Path
- Author
-
Gold, Leo, Bienkowski, Adam, Sidoti, David, Pattipati, Krishna, and Khan, Omer
- Subjects
Computer Science - Distributed, Parallel, and Cluster Computing ,Computer Science - Artificial Intelligence ,Computer Science - Hardware Architecture ,Computer Science - Data Structures and Algorithms ,Computer Science - Performance - Abstract
The Multi-Objective Shortest-Path (MOS) problem finds a set of Pareto-optimal solutions from a start node to a destination node in a multi-attribute graph. To solve the NP-hard MOS problem, the literature explores heuristic multi-objective A*-style algorithmic approaches. A generalized MOS algorithm maintains a "frontier" of partial paths at each node and performs ordered processing to ensure that Pareto-optimal paths are generated to reach the goal node. The algorithm becomes computationally intractable as the number of objectives increases due to a rapid increase in the non-dominated paths, and the concomitantly large increase in Pareto-optimal solutions. While prior works have focused on algorithmic methods to reduce the complexity, we tackle this challenge by exploiting parallelism using an algorithm-architecture approach. The key insight is that MOS algorithms rely on the ordered execution of partial paths to maintain high work efficiency. The OPMOS framework, proposed herein, unlocks ordered parallelism and efficiently exploits the concurrent execution of multiple paths in MOS. Experimental evaluation using the NVIDIA GH200 Superchip shows the performance scaling potential of OPMOS on work efficiency and parallelism using a real-world application to ship routing., Comment: 15 pages
- Published
- 2024
42. Simulations of Eccentricity Growth in Compact Binary Accretion Disks with MHD Turbulence
- Author
-
Ohana, Morgan, Jiang, Yan-Fei, Blaes, Omer, and Oyang, Bryance
- Subjects
Astrophysics - High Energy Astrophysical Phenomena - Abstract
We present the results of four magnetohydrodynamic simulations and one alpha-disk simulation of accretion disks in a compact binary system, neglecting vertical stratification and assuming a locally isothermal equation of state. We demonstrate that in the presence of net vertical field, disks that extend out to the 3:1 mean motion resonance grow eccentricity in full MHD in much the same way as in hydrodynamical disks. Hence turbulence due to the magnetorotational instability (MRI) does not impede the tidally-driven growth of eccentricity in any meaningful way. However, we find two important differences with alpha-disk theory. First, in MHD, eccentricity builds up in the inner disk with a series of episodes of radial disk breaking into two misaligned eccentric disks, separated by a region of circular orbits. Standing eccentric waves are often present in the inner eccentric disk. Second, the successful spreading of an accretion disk with MRI turbulence out to the resonant radius is nontrivial, and much harder than spreading an alpha-disk. This is due to the tendency to develop over-dense rings in which tidal torques overwhelm MRI transport and truncate the disk too early. We believe that the inability to spread the disk sufficiently was the reason why our previous attempt to excite eccentricity via the 3:1 mean motion resonance with MHD failed. Exactly how MHD disks successfully spread outward in compact binary systems is an important problem that has not yet been understood., Comment: 16 pages, 11 Figures, 1 table, accepted by ApJ
- Published
- 2024
43. Blockchain-Enhanced Framework for Secure Third-Party Vendor Risk Management and Vigilant Security Controls
- Author
-
Gupta, Deepti, Elluri, Lavanya, Jain, Avi, Moni, Shafika Showkat, and Aslan, Omer
- Subjects
Computer Science - Cryptography and Security - Abstract
In an era of heightened digital interconnectedness, businesses increasingly rely on third-party vendors to enhance their operational capabilities. However, this growing dependency introduces significant security risks, making it crucial to develop a robust framework to mitigate potential vulnerabilities. This paper proposes a comprehensive secure framework for managing third-party vendor risk, integrating blockchain technology to ensure transparency, traceability, and immutability in vendor assessments and interactions. By leveraging blockchain, the framework enhances the integrity of vendor security audits, ensuring that vendor assessments remain up-to-date and tamperproof. This proposed framework leverages smart contracts to reduce human error while ensuring real-time monitoring of compliance and security controls. By evaluating critical security controls-such as data encryption, access control mechanisms, multi-factor authentication, and zero-trust architecture-this approach strengthens an organization's defense against emerging cyber threats. Additionally, continuous monitoring enabled by blockchain ensures the immutability and transparency of vendor compliance processes. In this paper, a case study on iHealth's transition to AWS Cloud demonstrates the practical implementation of the framework, showing a significant reduction in vulnerabilities and marked improvement in incident response times. Through the adoption of this blockchain-enabled approach, organizations can mitigate vendor risks, streamline compliance, and enhance their overall security posture.
- Published
- 2024
44. Robot Metabolism: Towards machines that can grow by consuming other machines
- Author
-
Wyder, Philippe Martin, Bakhda, Riyaan, Zhao, Meiqi, Booth, Quinn A., Modi, Matthew E., Song, Andrew, Kang, Simon, Wu, Jiahao, Patel, Priya, Kasumi, Robert T., Yi, David, Garg, Nihar Niraj, Jhunjhunwala, Pranav, Bhutoria, Siddharth, Tong, Evan H., Hu, Yuhang, Goldfeder, Judah, Mustel, Omer, Kim, Donghan, and Lipson, Hod
- Subjects
Computer Science - Robotics ,Computer Science - Multiagent Systems ,Electrical Engineering and Systems Science - Systems and Control ,I.6 ,H.4 ,H.m ,I.m ,B.m - Abstract
Biological lifeforms can heal, grow, adapt, and reproduce -- abilities essential for sustained survival and development. In contrast, robots today are primarily monolithic machines with limited ability to self-repair, physically develop, or incorporate material from their environments. A key challenge to such physical adaptation has been that while robot minds are rapidly evolving new behaviors through AI, their bodies remain closed systems, unable to systematically integrate new material to grow or heal. We argue that open-ended physical adaptation is only possible when robots are designed using only a small repertoire of simple modules. This allows machines to mechanically adapt by consuming parts from other machines or their surroundings and shedding broken components. We demonstrate this principle using a truss modular robot platform composed of one-dimensional actuated bars. We show how robots in this space can grow bigger, faster, and more capable by consuming materials from their environment and from other robots. We suggest that machine metabolic processes akin to the one demonstrated here will be an essential part of any sustained future robot ecology., Comment: Manuscript combined with Supplementary Materials File for arXiv submission. Submitting to Journal and will update external DOI once available
- Published
- 2024
45. Non-Invasive Glucose Level Monitoring from PPG using a Hybrid CNN-GRU Deep Learning Network
- Author
-
Soliman, Abdelrhman Y., Nor, Ahmed M., Fratu, Octavian, Halunga, Simona, Omer, Osama A., and Mubark, Ahmed S.
- Subjects
Electrical Engineering and Systems Science - Signal Processing - Abstract
Every year, humanity loses about 1.5 million persons due to diabetic disease. Therefore continuous monitoring of diabetes is highly needed, but the conventional approach, i.e., fingertip pricking, causes mental and physical pain to the patient. This work introduces painless and cheaper non-invasive blood glucose level monitoring, Exploiting the advancement and huge progress in deep learning to develop a hybrid convolution neural network (CNN) - gate recurrent unit (GRU) network to hit the targeted system, The proposed system deploys CNN for extracting spatial patterns in the photoplethysmogram (PPG) signal and GRU is used for detecting the temporal patterns. The performance of the proposed system achieves a Mean Absolute Error (MAE) of 2.96 mg/dL, a mean square error (MSE) of 15.53 mg/dL, a root mean square Error (RMSE) of 3.94 mg/dL, and a coefficient of determination ($R^2$ score) of 0.97 on the test dataset. According to the Clarke Error Grid analysis, 100% of points fall within the clinically acceptable zone (Class A)
- Published
- 2024
46. KV-Tandem -- a Modular Approach to Building High-Speed LSM Storage Engines
- Author
-
Bortnikov, Edward, Azran, Michael, Bornstein, Asa, Dashevsky, Shmuel, Huang, Dennis, Kepten, Omer, Pan, Michael, Sheffi, Gali, Twitto, Moshe, Orzech, Tamar Weiss, Keidar, Idit, Gueta, Guy, Maor, Roey, and Dayan, Niv
- Subjects
Computer Science - Databases - Abstract
We present~\emph{KV-Tandem}, a modular architecture for building LSM-based storage engines on top of simple, non-ordered persistent key-value stores (KVSs). KV-Tandem enables advanced functionalities such as range queries and snapshot reads, while maintaining the native KVS performance for random reads and writes. Its modular design offers better performance trade-offs compared to previous KV-separation solutions, which struggle to decompose the monolithic LSM structure. Central to KV-Tandem is~\emph{LSM bypass} -- a novel algorithm that offers a fast path to basic operations while ensuring the correctness of advanced APIs. We implement KV-Tandem in \emph{XDP-Rocks}, a RocksDB-compatible storage engine that leverages the XDP KVS and incorporates practical design optimizations for real-world deployment. Through extensive microbenchmark and system-level comparisons, we demonstrate that XDP-Rocks achieves 3x to 4x performance improvements over RocksDB across various workloads. XDP-Rocks is already deployed in production, delivering significant operator cost savings consistent with these performance gains.
- Published
- 2024
47. Almost Regular Closedness of the Connectedness Locus for Pairs of Affine Maps on $\mathbb{R}^2$
- Author
-
Rosler, Omer
- Subjects
Mathematics - Dynamical Systems - Abstract
We study the connectedness locus $\mathcal{N}$ for the family of iterated function systems of pairs of homogeneous affine-linear maps in the plane. We prove this set is regular closed (i.e., it is the closure of its interior) away from the diagonal, except possibly for isolated points, which we conjecture do not exist. We provide an overview of the "method of traps", introduced by Calegari et al. (2017), which lies at the heart of our proof.
- Published
- 2024
48. Fully Dynamic (\Delta+1) Coloring Against Adaptive Adversaries
- Author
-
Behnezhad, Soheil, Rajaraman, Rajmohan, and Wasim, Omer
- Subjects
Computer Science - Data Structures and Algorithms - Abstract
Over the years, there has been extensive work on fully dynamic algorithms for classic graph problems that admit greedy solutions. Examples include $(\Delta+1)$ vertex coloring, maximal independent set, and maximal matching. For all three problems, there are randomized algorithms that maintain a valid solution after each edge insertion or deletion to the $n$-vertex graph by spending $\polylog n$ time, provided that the adversary is oblivious. However, none of these algorithms work against adaptive adversaries whose updates may depend on the output of the algorithm. In fact, even breaking the trivial bound of $O(n)$ against adaptive adversaries remains open for all three problems. For instance, in the case of $(\Delta+1)$ vertex coloring, the main challenge is that an adaptive adversary can keep inserting edges between vertices of the same color, necessitating a recoloring of one of the endpoints. The trivial algorithm would simply scan all neighbors of one endpoint to find a new available color (which always exists) in $O(n)$ time. In this paper, we break this linear barrier for the $(\Delta+1)$ vertex coloring problem. Our algorithm is randomized, and maintains a valid $(\Delta+1)$ vertex coloring after each edge update by spending $\widetilde{O}(n^{8/9})$ time with high probability., Comment: Full Version of a SODA '25 paper
- Published
- 2024
49. Robust Market Interventions
- Author
-
Galeotti, Andrea, Golub, Benjamin, Goyal, Sanjeev, Talamàs, Eduard, and Tamuz, Omer
- Subjects
Economics - Theoretical Economics ,Economics - Econometrics ,Statistics - Applications - Abstract
When can interventions in markets be designed to increase surplus robustly -- i.e., with high probability -- accounting for uncertainty due to imprecise information about economic primitives? In a setting with many strategic firms, each possessing some market power, we present conditions for such interventions to exist. The key condition, recoverable structure, requires large-scale complementarities among families of products. The analysis works by decomposing the incidence of interventions in terms of principal components of a Slutsky matrix. Under recoverable structure, a noisy signal of this matrix reveals enough about these principal components to design robust interventions. Our results demonstrate the usefulness of spectral methods for analyzing imperfectly observed strategic interactions with many agents.
- Published
- 2024
50. A Multi-Modal Approach for Face Anti-Spoofing in Non-Calibrated Systems using Disparity Maps
- Author
-
Larey, Ariel, Rond, Eyal, and Achrack, Omer
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Artificial Intelligence - Abstract
Face recognition technologies are increasingly used in various applications, yet they are vulnerable to face spoofing attacks. These spoofing attacks often involve unique 3D structures, such as printed papers or mobile device screens. Although stereo-depth cameras can detect such attacks effectively, their high-cost limits their widespread adoption. Conversely, two-sensor systems without extrinsic calibration offer a cost-effective alternative but are unable to calculate depth using stereo techniques. In this work, we propose a method to overcome this challenge by leveraging facial attributes to derive disparity information and estimate relative depth for anti-spoofing purposes, using non-calibrated systems. We introduce a multi-modal anti-spoofing model, coined Disparity Model, that incorporates created disparity maps as a third modality alongside the two original sensor modalities. We demonstrate the effectiveness of the Disparity Model in countering various spoof attacks using a comprehensive dataset collected from the Intel RealSense ID Solution F455. Our method outperformed existing methods in the literature, achieving an Equal Error Rate (EER) of 1.71% and a False Negative Rate (FNR) of 2.77% at a False Positive Rate (FPR) of 1%. These errors are lower by 2.45% and 7.94% than the errors of the best comparison method, respectively. Additionally, we introduce a model ensemble that addresses 3D spoof attacks as well, achieving an EER of 2.04% and an FNR of 3.83% at an FPR of 1%. Overall, our work provides a state-of-the-art solution for the challenging task of anti-spoofing in non-calibrated systems that lack depth information.
- Published
- 2024
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.