555,912 results on '"Hsu BE"'
Search Results
2. A Deep Learning Approach to Localizing Multi-level Airway Collapse Based on Snoring Sounds
- Author
-
Hsu, Ying-Chieh, Liu, Stanley Yung-Chuan, Huang, Chao-Jung, Wu, Chi-Wei, Cheng, Ren-Kai, Hsu, Jane Yung-Jen, Huang, Shang-Ran, Cheng, Yuan-Ren, and Hsu, Fu-Shun
- Subjects
Computer Science - Sound ,Computer Science - Artificial Intelligence ,Computer Science - Machine Learning ,Electrical Engineering and Systems Science - Audio and Speech Processing - Abstract
This study investigates the application of machine/deep learning to classify snoring sounds excited at different levels of the upper airway in patients with obstructive sleep apnea (OSA) using data from drug-induced sleep endoscopy (DISE). The snoring sounds of 39 subjects were analyzed and labeled according to the Velum, Oropharynx, Tongue Base, and Epiglottis (VOTE) classification system. The dataset, comprising 5,173 one-second segments, was used to train and test models, including Support Vector Machine (SVM), Bidirectional Long Short-Term Memory (BiLSTM), and ResNet-50. The ResNet-50, a convolutional neural network (CNN), showed the best overall performance in classifying snoring acoustics, particularly in identifying multi-level obstructions. The study emphasizes the potential of integrating snoring acoustics with deep learning to improve the diagnosis and treatment of OSA. However, challenges such as limited sample size, data imbalance, and differences between pharmacologically induced and natural snoring sounds were noted, suggesting further research to enhance model accuracy and generalizability.
- Published
- 2024
3. Swift-BAT GUANO follow-up of gravitational-wave triggers in the third LIGO-Virgo-KAGRA observing run
- Author
-
Raman, Gayathri, Ronchini, Samuele, Delaunay, James, Tohuvavohu, Aaron, Kennea, Jamie A., Parsotan, Tyler, Ambrosi, Elena, Bernardini, Maria Grazia, Campana, Sergio, Cusumano, Giancarlo, D'Ai, Antonino, D'Avanzo, Paolo, D'Elia, Valerio, De Pasquale, Massimiliano, Dichiara, Simone, Evans, Phil, Hartmann, Dieter, Kuin, Paul, Melandri, Andrea, O'Brien, Paul, Osborne, Julian P., Page, Kim, Palmer, David M., Sbarufatti, Boris, Tagliaferri, Gianpiero, Troja, Eleonora, Abac, A. G., Abbott, R., Abe, H., Abouelfettouh, I., Acernese, F., Ackley, K., Adamcewicz, C., Adhicary, S., Adhikari, N., Adhikari, R. X., Adkins, V. K., Adya, V. B., Affeldt, C., Agarwal, D., Agathos, M., Aguiar, O. D., Aguilar, I., Aiello, L., Ain, A., Akutsu, T., Albanesi, S., Alfaidi, R. A., Al-Jodah, A., Alléné, C., Allocca, A., Al-Shammari, S., Altin, P. A., Alvarez-Lopez, S., Amato, A., Amez-Droz, L., Amorosi, A., Amra, C., Anand, S., Ananyeva, A., Anderson, S. B., Anderson, W. G., Andia, M., Ando, M., Andrade, T., Andres, N., Andrés-Carcasona, M., Andrić, T., Anglin, J., Ansoldi, S., Antelis, J. M., Antier, S., Aoumi, M., Appavuravther, E. Z., Appert, S., Apple, S. K., Arai, K., Araya, A., Araya, M. C., Areeda, J. S., Aritomi, N., Armato, F., Arnaud, N., Arogeti, M., Aronson, S. M., Ashton, G., Aso, Y., Assiduo, M., Melo, S. Assis de Souza, Aston, S. M., Astone, P., Aubin, F., AultONeal, K., Avallone, G., Babak, S., Badaracco, F., Badger, C., Bae, S., Bagnasco, S., Bagui, E., Bai, Y., Baier, J. G., Bajpai, R., Baka, T., Ball, M., Ballardin, G., Ballmer, S. W., Banagiri, S., Banerjee, B., Bankar, D., Baral, P., Barayoga, J. C., Barish, B. C., Barker, D., Barneo, P., Barone, F., Barr, B., Barsotti, L., Barsuglia, M., Barta, D., Barthelmy, S. D., Barton, M. A., Bartos, I., Basak, S., Basalaev, A., Bassiri, R., Basti, A., Bawaj, M., Baxi, P., Bayley, J. C., Baylor, A. C., Bazzan, M., Bécsy, B., Bedakihale, V. M., Beirnaert, F., Bejger, M., Belardinelli, D., Bell, A. S., Benedetto, V., Beniwal, D., Benoit, W., Bentley, J. D., Yaala, M. Ben, Bera, S., Berbel, M., Bergamin, F., Berger, B. K., Bernuzzi, S., Beroiz, M., Berry, C. P. L., Bersanetti, D., Bertolini, A., Betzwieser, J., Beveridge, D., Bevins, N., Bhandare, R., Bhardwaj, U., Bhatt, R., Bhattacharjee, D., Bhaumik, S., Bhowmick, S., Bianchi, A., Bilenko, I. A., Billingsley, G., Binetti, A., Bini, S., Birnholtz, O., Biscoveanu, S., Bisht, A., Bitossi, M., Bizouard, M. -A., Blackburn, J. K., Blair, C. D., Blair, D. G., Bobba, F., Bode, N., Bogaert, G., Boileau, G., Boldrini, M., Bolingbroke, G. N., Bolliand, A., Bonavena, L. D., Bondarescu, R., Bondu, F., Bonilla, E., Bonilla, M. S., Bonino, A., Bonnand, R., Booker, P., Borchers, A., Boschi, V., Bose, S., Bossilkov, V., Boudart, V., Boumerdassi, A., Bozzi, A., Bradaschia, C., Brady, P. R., Braglia, M., Branch, A., Branchesi, M., Breschi, M., Briant, T., Brillet, A., Brinkmann, M., Brockill, P., Brockmueller, E., Brooks, A. F., Brown, D. D., Brozzetti, M. L., Brunett, S., Bruno, G., Bruntz, R., Bryant, J., Bucci, F., Buchanan, J., Bulashenko, O., Bulik, T., Bulten, H. J., Buonanno, A., Burtnyk, K., Buscicchio, R., Buskulic, D., Buy, C., Byer, R. L., Davies, G. S. Cabourn, Cabras, G., Cabrita, R., Cadonati, L., Cagnoli, G., Cahillane, C., Bustillo, J. Calderón, Callaghan, J. D., Callister, T. A., Calloni, E., Camp, J. B., Canepa, M., Santoro, G. Caneva, Cannavacciuolo, M., Cannon, K. C., Cao, H., Cao, Z., Capistran, L. A., Capocasa, E., Capote, E., Carapella, G., Carbognani, F., Carlassara, M., Carlin, J. B., Carpinelli, M., Carrillo, G., Carter, J. J., Carullo, G., Diaz, J. Casanueva, Casentini, C., Castaldi, G., Castro-Lucas, S. Y., Caudill, S., Cavaglià, M., Cavalieri, R., Cella, G., Cerdá-Durán, P., Cesarini, E., Chaibi, W., Chakraborty, P., Subrahmanya, S. Chalathadka, Chan, C., Chan, J. C. L., Chan, K. H. M., Chan, M., Chan, W. L., Chandra, K., Chang, R. -J., Chanial, P., Chao, S., Chapman-Bird, C., Charlton, E. L., Charlton, P., Chassande-Mottin, E., Chatterjee, C., Chatterjee, Debarati, Chatterjee, Deep, Chaturvedi, M., Chaty, S., Chen, A., Chen, A. H. -Y., Chen, D., Chen, H., Chen, H. Y., Chen, K. H., Chen, X., Chen, Yi-Ru, Chen, Yanbei, Chen, Yitian, Cheng, H. P., Chessa, P., Cheung, H. T., Chia, H. Y., Chiadini, F., Chiang, C., Chiarini, G., Chiba, A., Chiba, R., Chierici, R., Chincarini, A., Chiofalo, M. L., Chiummo, A., Chou, C., Choudhary, S., Christensen, N., Chua, S. S. Y., Chung, K. W., Ciani, G., Ciecielag, P., Cieślar, M., Cifaldi, M., Ciobanu, A. A., Ciolfi, R., Clara, F., Clark, J. A., Clarke, T. A., Clearwater, P., Clesse, S., Cleva, F., Coccia, E., Codazzo, E., Cohadon, P. -F., Colleoni, M., Collette, C. G., Collins, J., Colloms, S., Colombo, A., Colpi, M., Compton, C. M., Conti, L., Cooper, S. J., Corbitt, T. R., Cordero-Carrión, I., Corezzi, S., Cornish, N. J., Corsi, A., Cortese, S., Costa, C. A., Cottingham, R., Coughlin, M. W., Couineaux, A., Coulon, J. -P., Countryman, S. T., Coupechoux, J. -F., Cousins, B., Couvares, P., Coward, D. M., Cowart, M. J., Coyne, D. C., Coyne, R., Craig, K., Creed, R., Creighton, J. D. E., Creighton, T. D., Cremonese, P., Criswell, A. W., Crockett-Gray, J. C. G., Croquette, M., Crouch, R., Crowder, S. G., Cudell, J. R., Cullen, T. J., Cumming, A., Cuoco, E., Cusinato, M., Dabadie, P., Canton, T. Dal, Dall'Osso, S., Dálya, G., D'Angelo, B., Danilishin, S., D'Antonio, S., Danzmann, K., Darroch, K. E., Dartez, L. P., Dasgupta, A., Datta, S., Dattilo, V., Daumas, A., Davari, N., Dave, I., Davenport, A., Davier, M., Davies, T. F., Davis, D., Davis, L., Davis, M. C., Daw, E. J., Dax, M., De Bolle, J., Deenadayalan, M., Degallaix, J., De Laurentis, M., Deléglise, S., Del Favero, V., De Lillo, F., Dell'Aquila, D., Del Pozzo, W., De Marco, F., De Matteis, F., D'Emilio, V., Demos, N., Dent, T., Depasse, A., DePergola, N., De Pietri, R., De Rosa, R., De Rossi, C., De Simone, R., Dhani, A., Dhurandhar, S., Diab, R., Díaz, M. C., Di Cesare, M., Dideron, G., Didio, N. A., Dietrich, T., Di Fiore, L., Di Fronzo, C., Di Giovanni, F., Di Giovanni, M., Di Girolamo, T., Diksha, D., Di Michele, A., Ding, J., Di Pace, S., Di Palma, I., Di Renzo, F., Divyajyoti, Dmitriev, A., Doctor, Z., Dohmen, E., Doleva, P. P., Donahue, L., D'Onofrio, L., Donovan, F., Dooley, K. L., Dooney, T., Doravari, S., Dorosh, O., Drago, M., Driggers, J. C., Drori, Y., Ducoin, J. -G., Dunn, L., Dupletsa, U., D'Urso, D., Duval, H., Duverne, P. -A., Dwyer, S. E., Eassa, C., Ebersold, M., Eckhardt, T., Eddolls, G., Edelman, B., Edo, T. B., Edy, O., Effler, A., Eichholz, J., Einsle, H., Eisenmann, M., Eisenstein, R. A., Ejlli, A., Emma, M., Engelby, E., Engl, A. J., Errico, L., Essick, R. C., Estellés, H., Estevez, D., Etzel, T., Evans, M., Evstafyeva, T., Ewing, B. E., Ezquiaga, J. M., Fabrizi, F., Faedi, F., Fafone, V., Fairhurst, S., Fan, P. C., Farah, A. M., Farr, B., Farr, W. M., Favaro, G., Favata, M., Fays, M., Fazio, M., Feicht, J., Fejer, M. M., Fenyvesi, E., Ferguson, D. L., Ferrante, I., Ferreira, T. A., Fidecaro, F., Fiori, A., Fiori, I., Fishbach, M., Fisher, R. P., Fittipaldi, R., Fiumara, V., Flaminio, R., Fleischer, S. M., Fleming, L. S., Floden, E., Foley, E. M., Fong, H., Font, J. A., Fornal, B., Forsyth, P. W. F., Franceschetti, K., Franchini, N., Frasca, S., Frasconi, F., Mascioli, A. Frattale, Frei, Z., Freise, A., Freitas, O., Frey, R., Frischhertz, W., Fritschel, P., Frolov, V. V., Fronzé, G. G., Fuentes-Garcia, M., Fujii, S., Fukunaga, I., Fulda, P., Fyffe, M., Gabella, W. E., Gadre, B., Gair, J. R., Galaudage, S., Gallardo, S., Gallego, B., Gamba, R., Gamboa, A., Ganapathy, D., Ganguly, A., Gaonkar, S. G., Garaventa, B., Garcia-Bellido, J., García-Núñez, C., García-Quirós, C., Gardner, J. W., Gardner, K. A., Gargiulo, J., Garron, A., Garufi, F., Gasbarra, C., Gateley, B., Gayathri, V., Gemme, G., Gennai, A., George, J., George, R., Gerberding, O., Gergely, L., Ghadiri, N., Ghosh, Archisman, Ghosh, Shaon, Ghosh, Shrobana, Ghosh, Suprovo, Ghosh, Tathagata, Giacoppo, L., Giaime, J. A., Giardina, K. D., Gibson, D. R., Gibson, D. T., Gier, C., Giri, P., Gissi, F., Gkaitatzis, S., Glanzer, J., Gleckl, A. E., Glotin, F., Godfrey, J., Godwin, P., Goebbels, N. L., Goetz, E., Golomb, J., Lopez, S. Gomez, Goncharov, B., González, G., Goodarzi, P., Goodwin-Jones, A. W., Gosselin, M., Göttel, A. S., Gouaty, R., Gould, D. W., Goyal, S., Grace, B., Grado, A., Graham, V., Granados, A. E., Granata, M., Granata, V., Argianas, L. Granda, Gras, S., Grassia, P., Gray, C., Gray, R., Greco, G., Green, A. C., Green, S. M., Green, S. R., Gretarsson, A. M., Gretarsson, E. M., Griffith, D., Griffiths, W. L., Griggs, H. L., Grignani, G., Grimaldi, A., Grimaud, C., Grote, H., Gruson, A. S., Guerra, D., Guetta, D., Guidi, G. M., Guimaraes, A. R., Gulati, H. K., Gulminelli, F., Gunny, A. M., Guo, H., Guo, W., Guo, Y., Gupta, Anchal, Gupta, Anuradha, Gupta, Ish, Gupta, N. C., Gupta, P., Gupta, S. K., Gupta, T., Gupte, N., Gurav, R., Gurs, J., Gutierrez, N., Guzman, F., Haba, D., Haberland, M., Haegel, L., Hain, G., Haino, S., Hall, E. D., Hamilton, E. Z., Hammond, G., Han, W. -B., Haney, M., Hanks, J., Hanna, C., Hannam, M. D., Hannuksela, O. A., Hanselman, A. G., Hansen, H., Hanson, J., Harada, R., Harder, T., Haris, K., Harmark, T., Harms, J., Harry, G. M., Harry, I. W., Haskell, B., Haster, C. -J., Hathaway, J. S., Haughian, K., Hayakawa, H., Hayama, K., Healy, J., Heffernan, A., Heidmann, A., Heintze, M. C., Heinze, J., Heinzel, J., Heitmann, H., Hellman, F., Hello, P., Helmling-Cornell, A. F., Hemming, G., Hendry, M., Heng, I. S., Hennes, E., Hennig, J. -S., Hennig, M., Henshaw, C., Hernandez, A., Hertog, T., Heurs, M., Hewitt, A. L., Higginbotham, S., Hild, S., Hill, P., Hill, S., Himemoto, Y., Hines, A. S., Hirata, N., Hirose, C., Ho, J., Hoang, S., Hochheim, S., Hofman, D., Holland, N. A., Holley-Bockelmann, K., Hollows, I. J., Holmes, Z. J., Holz, D. E., Hong, C., Hornung, J., Hoshino, S., Hough, J., Hourihane, S., Howell, E. J., Hoy, C. G., Hoyland, D., Hrishikesh, C. A., Hsieh, H. -F., Hsiung, C., Hsu, H. C., Hsu, S. -C., Hsu, W. -F., Hu, P., Hu, Q., Huang, H. Y., Huang, Y. -J., Huang, Y., Huang, Y. T., Huddart, A. D., Hughey, B., Hui, D. C. Y., Hui, V., Hur, R., Husa, S., Huxford, R., Huynh-Dinh, T., Iakovlev, A., Iandolo, G. A., Iess, A., Inayoshi, K., Inoue, Y., Iorio, G., Irwin, J., Isi, M., Ismail, M. A., Itoh, Y., Iwaya, M., Iyer, B. R., JaberianHamedan, V., Jacquet, P. -E., Jadhav, S. J., Jadhav, S. P., Jain, T., James, A. L., James, P. A., Jamshidi, R., Jan, A. Z., Jani, K., Janiurek, L., Janquart, J., Janssens, K., Janthalur, N. N., Jaraba, S., Jaranowski, P., Jasal, P., Jaume, R., Javed, W., Jennings, A., Jia, W., Jiang, J., Jin, H. -B., Johansmeyer, K., Johns, G. R., Johnson, N. A., Johnston, R., Johny, N., Jones, D. H., Jones, D. I., Jones, R., Jose, S., Joshi, P., Ju, L., Jung, K., Junker, J., Juste, V., Kajita, T., Kalaghatgi, C., Kalogera, V., Kamiizumi, M., Kanda, N., Kandhasamy, S., Kang, G., Kanner, J. B., Kapadia, S. J., Kapasi, D. P., Karat, S., Karathanasis, C., Karki, S., Kashyap, R., Kasprzack, M., Kastaun, W., Kato, J., Kato, T., Katsanevas, S., Katsavounidis, E., Katzman, W., Kaur, T., Kaushik, R., Kawabe, K., Keitel, D., Kelley-Derzon, J., Kennington, J., Kesharwani, R., Key, J. S., Khadka, S., Khalili, F. Y., Khan, F., Khan, I., Khanam, T., Khazanov, E. A., Khursheed, M., Kiendrebeogo, W., Kijbunchoo, N., Kim, C., Kim, J. C., Kim, K., Kim, M. H., Kim, S., Kim, W. S., Kim, Y. -M., Kimball, C., Kimura, N., Kinley-Hanlon, M., Kinnear, M., Kissel, J. S., Kiyota, T., Klimenko, S., Klinger, T., Knee, A. M., Knust, N., Koch, P., Koehlenbeck, S. M., Koekoek, G., Kohri, K., Kokeyama, K., Koley, S., Kolitsidou, P., Kolstein, M., Komori, K., Kong, A. K. H., Kontos, A., Korobko, M., Kossak, R. V., Kou, X., Koushik, A., Kouvatsos, N., Kovalam, M., Koyama, N., Kozak, D. B., Kranzhoff, S. L., Kringel, V., Krishnendu, N. V., Królak, A., Kuehn, G., Kuijer, P., Kulkarni, S., Ramamohan, A. Kulur, Kumar, A., Kumar, Praveen, Kumar, Prayush, Kumar, Rahul, Kumar, Rakesh, Kume, J., Kuns, K., Kuroyanagi, S., Kuwahara, S., Kwak, K., Kwan, K., Lacaille, G., Lagabbe, P., Laghi, D., Lai, S., Laity, A. H., Lakkis, M. H., Lalande, E., Lalleman, M., Landry, M., Lane, B. B., Lang, R. N., Lange, J., Lantz, B., La Rana, A., La Rosa, I., Lartaux-Vollard, A., Lasky, P. D., Lawrence, J., Laxen, M., Lazzarini, A., Lazzaro, C., Leaci, P., LeBohec, S., Lecoeuche, Y. K., Lee, H. M., Lee, H. W., Lee, K., Lee, R. -K., Lee, R., Lee, S., Lee, Y., Legred, I. N., Lehmann, J., Lehner, L., Lemaître, A., Lenti, M., Leonardi, M., Leonova, E., Lequime, M., Leroy, N., Lesovsky, M., Letendre, N., Lethuillier, M., Levesque, C., Levin, Y., Leyde, K., Li, A. K. Y., Li, K. L., Li, T. G. F., Li, X., Lin, Chien-Yu, Lin, Chun-Yu, Lin, E. T., Lin, F., Lin, H., Lin, L. C. -C., Linde, F., Linker, S. D., Littenberg, T. B., Liu, A., Liu, G. C., Liu, Jian, Llamas, F., Llobera-Querol, J., Lo, R. K. L., Locquet, J. -P., London, L., Longo, A., Lopez, D., Portilla, M. Lopez, Lorenzini, M., Loriette, V., Lormand, M., Losurdo, G., Lott IV, T. P., Lough, J. D., Loughlin, H. A., Lousto, C. O., Lowry, M. J., Lück, H., Lumaca, D., Lundgren, A. P., Lussier, A. W., Ma, L. -T., Ma, S., Ma'arif, M., Macas, R., MacInnis, M., Maciy, R. R., Macleod, D. M., MacMillan, I. A. O., Macquet, A., Macri, D., Maeda, K., Maenaut, S., Hernandez, I. Magaña, Magare, S. S., Magazzù, C., Magee, R. M., Maggio, E., Maggiore, R., Magnozzi, M., Mahesh, M., Mahesh, S., Maini, M., Majhi, S., Majorana, E., Makarem, C. N., Malaquias-Reis, J. A., Maliakal, S., Malik, A., Man, N., Mandic, V., Mangano, V., Mannix, B., Mansell, G. L., Manske, M., Mantovani, M., Mapelli, M., Marchesoni, F., Pina, D. Marín, Marion, F., Márka, S., Márka, Z., Markakis, C., Markosyan, A. S., Markowitz, A., Maros, E., Marquina, A., Marsat, S., Martelli, F., Martin, I. W., Martin, R. M., Martinez, B. B., Martinez, M., Martinez, V., Martini, A., Martinovic, K., Martins, J. C., Martynov, D. V., Marx, E. J., Massaro, L., Masserot, A., Masso-Reid, M., Mastrodicasa, M., Mastrogiovanni, S., Mateu-Lucena, M., Matiushechkina, M., Matsuyama, M., Mavalvala, N., Maxwell, N., McCarrol, G., McCarthy, R., McClelland, D. E., McCormick, S., McCuller, L., McGhee, G. I., McGowan, K. B. M., Mchedlidze, M., McIsaac, C., McIver, J., McKinney, K., McLeod, A., McRae, T., McWilliams, S. T., Meacher, D., Mehta, A. K., Meijer, Q., Melatos, A., Mellaerts, S., Menendez-Vazquez, A., Menoni, C. S., Mercer, R. A., Mereni, L., Merfeld, K., Merilh, E. L., Mérou, J. R., Merritt, J. D., Merzougui, M., Messenger, C., Messick, C., Meyer-Conde, M., Meylahn, F., Mhaske, A., Miani, A., Miao, H., Michaloliakos, I., Michel, C., Michimura, Y., Middleton, H., Miller, A. L., Miller, S., Millhouse, M., Milotti, E., Minenkov, Y., Mio, N., Mir, Ll. M., Mirasola, L., Miravet-Tenés, M., Miritescu, C. -A., Mishra, A. K., Mishra, A., Mishra, C., Mishra, T., Mitchell, A. L., Mitchell, J. G., Mitra, S., Mitrofanov, V. P., Mitselmakher, G., Mittleman, R., Miyakawa, O., Miyamoto, S., Miyoki, S., Mo, G., Mobilia, L., Modafferi, L. M., Mohapatra, S. R. P., Mohite, S. R., Molina-Ruiz, M., Mondal, C., Mondin, M., Montani, M., Moore, C. J., Morales, M., Moraru, D., Morawski, F., More, A., More, S., Moreno, C., Moreno, G., Morisaki, S., Moriwaki, Y., Morras, G., Moscatello, A., Mourier, P., Mours, B., Mow-Lowry, C. M., Mozzon, S., Muciaccia, F., Mukherjee, D., Mukherjee, Samanwaya, Mukherjee, Soma, Mukherjee, Subroto, Mukherjee, Suvodip, Mukund, N., Mullavey, A., Munch, J., Mungioli, C. L., Munn, M., Oberg, W. R. Munn, Murakoshi, M., Murray, P. G., Muusse, S., Nadji, S. L., Nagar, A., Nagarajan, N., Nagler, K. N., Nakamura, K., Nakano, H., Nakano, M., Nandi, D., Napolano, V., Narayan, P., Nardecchia, I., Narola, H., Naticchioni, L., Nayak, R. K., Neil, B. F., Neilson, J., Nelson, A., Nelson, T. J. N., Nery, M., Neunzert, A., Ng, S., Nguyen, C., Nguyen, P., Quynh, L. Nguyen, Nichols, S. A., Nielsen, A. B., Nieradka, G., Niko, A., Nishino, Y., Nishizawa, A., Nissanke, S., Nitoglia, E., Niu, W., Nocera, F., Norman, M., North, C., Novak, J., Siles, J. F. Nuño, Nurbek, G., Nuttall, L. K., Obayashi, K., Oberling, J., O'Dell, J., Oertel, M., Offermans, A., Oganesyan, G., Oh, J. J., Oh, K., Oh, S. H., O'Hanlon, T., Ohashi, M., Ohkawa, M., Ohme, F., Ohta, H., Oliveira, A. S., Oliveri, R., Oloworaran, V., O'Neal, B., Oohara, K., O'Reilly, B., Ormsby, N. D., Orselli, M., O'Shaughnessy, R., Oshima, Y., Oshino, S., Ossokine, S., Osthelder, C., Ottaway, D. J., Ouzriat, A., Overmier, H., Owen, B. J., Pace, A. E., Pagano, R., Page, M. A., Pai, A., Pai, S. A., Pal, A., Pal, S., Palaia, M. A., Palashov, O., Pálfi, M., Palma, P. P., Palomba, C., Pan, K. C., Panda, P. K., Panebianco, L., Pang, P. T. H., Pannarale, F., Pant, B. C., Panther, F. H., Panzer, C. D., Paoletti, F., Paoli, A., Paolone, A., Papalexakis, E. E., Papalini, L., Papigkiotis, G., Parisi, A., Park, J., Parker, W., Pascale, G., Pascucci, D., Pasqualetti, A., Passaquieti, R., Passuello, D., Patane, O., Patel, M., Pathak, D., Pathak, M., Patra, A., Patricelli, B., Patron, A. S., Paul, S., Payne, E., Pearce, T., Pedraza, M., Pegna, R., Pele, A., Arellano, F. E. Peña, Penn, S., Penuliar, M. D., Perego, A., Pereira, A., Perez, J. J., Périgois, C., Perkins, C. C., Perna, G., Perreca, A., Perret, J., Perriès, S., Perry, J. W., Pesios, D., Petrillo, C., Pfeiffer, H. P., Pham, H., Pham, K. A., Phukon, K. S., Phurailatpam, H., Piccinni, O. J., Pichot, M., Piendibene, M., Piergiovanni, F., Pierini, L., Pierra, G., Pierro, V., Pietrzak, M., Pillas, M., Pilo, F., Pinard, L., Pineda-Bosque, C., Pinto, I. M., Pinto, M., Piotrzkowski, B. J., Pirello, M., Pitkin, M. D., Placidi, A., Placidi, E., Planas, M. L., Plastino, W., Poggiani, R., Polini, E., Pompili, L., Poon, J., Porcelli, E., Portell, J., Porter, E. K., Posnansky, C., Poulton, R., Powell, J., Pracchia, M., Pradhan, B. K., Pradier, T., Prajapati, A. K., Prasai, K., Prasanna, R., Prasia, P., Pratten, G., Principe, M., Prodi, G. A., Prokhorov, L., Prosposito, P., Prudenzi, L., Puecher, A., Pullin, J., Punturo, M., Puosi, F., Puppo, P., Pürrer, M., Qi, H., Qin, J., Quéméner, G., Quetschke, V., Quigley, C., Quinonez, P. J., Quitzow-James, R., Raab, F. J., Raaijmakers, G., Radulesco, N., Raffai, P., Rail, S. X., Raja, S., Rajan, C., Rajbhandari, B., Ramirez, D. S., Ramirez, K. E., Vidal, F. A. Ramis, Ramos-Buades, A., Rana, D., Randel, E., Ranjan, S., Rapagnani, P., Ratto, B., Rawat, S., Ray, A., Raymond, V., Razzano, M., Read, J., Payo, M. Recaman, Regimbau, T., Rei, L., Reid, S., Reid, S. W., Reitze, D. H., Relton, P., Renzini, A., Rettegno, P., Revenu, B., Reza, A., Rezac, M., Rezaei, A. S., Ricci, F., Ricci, M., Richards, D., Richardson, C. J., Richardson, J. W., Rijal, A., Riles, K., Riley, H. K., Rinaldi, S., Rittmeyer, J., Robertson, C., Robinet, F., Robinson, M., Rocchi, A., Rolland, L., Rollins, J. G., Romanelli, M., Romano, A. E., Romano, R., Romero, A., Romero-Shaw, I. M., Romie, J. H., Roocke, T. J., Rosa, L., Rosauer, T. J., Rose, C. A., Rosińska, D., Ross, M. P., Rossello, M., Rowan, S., Roy, S. K., Roy, S., Rozza, D., Ruggi, P., Morales, E. Ruiz, Ruiz-Rocha, K., Sachdev, S., Sadecki, T., Sadiq, J., Saffarieh, P., Sah, M. R., Saha, S. S., Sainrat, T., Menon, S. Sajith, Sakai, K., Sakellariadou, M., Sako, T., Sakon, S., Salafia, O. S., Salces-Carcoba, F., Salconi, L., Saleem, M., Salemi, F., Sallé, M., Salvador, S., Sanchez, A., Sanchez, E. J., Sanchez, J. H., Sanchez, L. E., Sanchis-Gual, N., Sanders, J. R., Sänger, E. M., Saravanan, T. R., Sarin, N., Sasli, A., Sassi, P., Sassolas, B., Satari, H., Sato, R., Sato, S., Sato, Y., Sauter, O., Savage, R. L., Sawada, T., Sawant, H. L., Sayah, S., Schaetzl, D., Scheel, M., Scheuer, J., Schiworski, M. G., Schmidt, P., Schmidt, S., Schnabel, R., Schneewind, M., Schofield, R. M. S., Schouteden, K., Schuler, H., Schulte, B. W., Schutz, B. F., Schwartz, E., Scott, J., Scott, S. M., Seetharamu, T. C., Seglar-Arroyo, M., Sekiguchi, Y., Sellers, D., Sengupta, A. S., Sentenac, D., Seo, E. G., Seo, J. W., Sequino, V., Sergeev, A., Serra, M., Servignat, G., Setyawati, Y., Shaffer, T., Shah, U. S., Shahriar, M. S., Shaikh, M. A., Shams, B., Shao, L., Sharma, A. K., Sharma, P., Sharma-Chaudhary, S., Shawhan, P., Shcheblanov, N. S., Shen, B., Shikano, Y., Shikauchi, M., Shimode, K., Shinkai, H., Shiota, J., Shoemaker, D. H., Shoemaker, D. M., Short, R. W., ShyamSundar, S., Sider, A., Siegel, H., Sieniawska, M., Sigg, D., Silenzi, L., Simmonds, M., Singer, L. P., Singh, A., Singh, D., Singh, M. K., Singha, A., Sintes, A. M., Sipala, V., Skliris, V., Slagmolen, B. J. J., Slaven-Blair, T. J., Smetana, J., Smith, J. R., Smith, L., Smith, R. J. E., Smith, W. J., Soldateschi, J., Somala, S. N., Somiya, K., Soni, K., Soni, S., Sordini, V., Sorrentino, F., Sorrentino, N., Soulard, R., Souradeep, T., Southgate, A., Sowell, E., Spagnuolo, V., Spencer, A. P., Spera, M., Spinicelli, P., Srivastava, A. K., Stachurski, F., Steer, D. A., Steinlechner, J., Steinlechner, S., Stergioulas, N., Stevens, P., StPierre, M., Strang, L. C., Stratta, G., Strong, M. D., Strunk, A., Sturani, R., Stuver, A. L., Suchenek, M., Sudhagar, S., Sueltmann, N., Sullivan, A. G., Sullivan, K. D., Sun, L., Sunil, S., Sur, A., Suresh, J., Sutton, P. J., Suzuki, Takamasa, Suzuki, Takanori, Swinkels, B. L., Syx, A., Szczepańczyk, M. J., Szewczyk, P., Tacca, M., Tagoshi, H., Tait, S. C., Takahashi, H., Takahashi, R., Takamori, A., Takatani, K., Takeda, H., Takeda, M., Talbot, C. J., Talbot, C., Tamaki, M., Tamanini, N., Tanabe, D., Tanaka, K., Tanaka, S. J., Tanaka, T., Tanasijczuk, A. J., Tang, D., Tanioka, S., Tanner, D. B., Tao, L., Tapia, R. D., Martín, E. N. Tapia San, Tarafder, R., Taranto, C., Taruya, A., Tasson, J. D., Teloi, M., Tenorio, R., Themann, H., Theodoropoulos, A., Thirugnanasambandam, M. P., Thomas, L. M., Thomas, M., Thomas, P., Thompson, J. E., Thondapu, S. R., Thorne, K. A., Thrane, E., Tissino, J., Tiwari, A., Tiwari, Shubhanshu, Tiwari, Srishti, Tiwari, V., Todd, M. R., Toivonen, A. M., Toland, K., Tolley, A. E., Tomaru, T., Tomita, K., Tomura, T., Tong-Yu, C., Toriyama, A., Toropov, N., Torres-Forné, A., Torrie, C. I., Toscani, M., Melo, I. Tosta e, Tournefier, E., Trani, A. A., Trapananti, A., Travasso, F., Traylor, G., Trenado, J., Trevor, M., Tringali, M. C., Tripathee, A., Troiano, L., Trovato, A., Trozzo, L., Trudeau, R. J., Tsang, T. T. L., Tso, R., Tsuchida, S., Tsukada, L., Tsutsui, T., Turbang, K., Turconi, M., Turski, C., Ubach, H., Ubhi, A. S., Uchikata, N., Uchiyama, T., Udall, R. P., Uehara, T., Ueno, K., Unnikrishnan, C. S., Ushiba, T., Utina, A., Vacatello, M., Vahlbruch, H., Vaidya, N., Vajente, G., Vajpeyi, A., Valdes, G., Valencia, J., Valentini, M., Vallejo-Peña, S. A., Vallero, S., Valsan, V., van Bakel, N., van Beuzekom, M., van Dael, M., Brand, J. F. J. van den, Broeck, C. Van Den, Vander-Hyde, D. C., van der Sluys, M., Van de Walle, A., van Dongen, J., Vandra, K., van Haevermaet, H., van Heijningen, J. V., Vanosky, J., van Putten, M. H. P. M., van Ranst, Z., van Remortel, N., Vardaro, M., Vargas, A. F., Varma, V., Vasúth, M., Vecchio, A., Vedovato, G., Veitch, J., Veitch, P. J., Venikoudis, S., Venneberg, J., Verdier, P., Verkindt, D., Verma, B., Verma, P., Verma, Y., Vermeulen, S. M., Veske, D., Vetrano, F., Veutro, A., Vibhute, A. M., Viceré, A., Vidyant, S., Viets, A. D., Vijaykumar, A., Vilkha, A., Villa-Ortega, V., Vincent, E. T., Vinet, J. -Y., Viret, S., Virtuoso, A., Vitale, S., Vocca, H., Voigt, D., von Reis, E. R. G., von Wrangel, J. S. A., Vyatchanin, S. P., Wade, L. E., Wade, M., Wagner, K. J., Walet, R. C., Walker, M., Wallace, G. S., Wallace, L., Wang, H., Wang, J. Z., Wang, W. H., Wang, Z., Waratkar, G., Ward, R. L., Warner, J., Was, M., Washimi, T., Washington, N. Y., Watarai, D., Wayt, K. E., Weaver, B., Weaving, C. R., Webster, S. A., Weinert, M., Weinstein, A. J., Weiss, R., Weller, C. M., Weller, R. A., Wellmann, F., Wen, L., Weßels, P., Wette, K., Whelan, J. T., White, D. D., Whiting, B. F., Whittle, C., Wildberger, J. B., Wilk, O. S., Wilken, D., Willetts, K., Williams, D., Williams, M. J., Williams, N. S., Willis, J. L., Willke, B., Wils, M., Wipf, C. C., Woan, G., Woehler, J., Wofford, J. K., Wolfe, N. E., Wong, D., Wong, H. T., Wong, H. W. Y., Wong, I. C. F., Wright, J. L., Wright, M., Wu, C., Wu, D. S., Wu, H., Wysocki, D. M., Xiao, L., Xu, V. A., Xu, Y., Yadav, N., Yamamoto, H., Yamamoto, K., Yamamoto, M., Yamamoto, T. S., Yamamoto, T., Yamamura, S., Yamazaki, R., Yan, S., Yan, T., Yang, F. W., Yang, F., Yang, K. Z., Yang, L. -C., Yang, Y., Yarbrough, Z., Yeh, S. -W., Yelikar, A. B., Yeung, S. M. C., Yin, X., Yokoyama, J., Yokozawa, T., Yoo, J., Yu, H., Yuzurihara, H., Zadrożny, A., Zannelli, A. J., Zanolin, M., Zeeshan, M., Zelenova, T., Zendri, J. -P., Zeoli, M., Zerrad, M., Zevin, M., Zhang, A. C., Zhang, J., Zhang, L., Zhang, R., Zhang, T., Zhang, Y., Zhao, C., Zhao, Yue, Zhao, Yuhang, Zheng, Y., Zhong, H., Zhong, S., Zhou, R., Zhu, Z. -H., Zimmerman, A. B., Zucker, M. E., and Zweizig, J.
- Subjects
Astrophysics - High Energy Astrophysical Phenomena ,General Relativity and Quantum Cosmology - Abstract
We present results from a search for X-ray/gamma-ray counterparts of gravitational-wave (GW) candidates from the third observing run (O3) of the LIGO-Virgo-KAGRA (LVK) network using the Swift Burst Alert Telescope (Swift-BAT). The search includes 636 GW candidates received in low latency, 86 of which have been confirmed by the offline analysis and included in the third cumulative Gravitational-Wave Transient Catalogs (GWTC-3). Targeted searches were carried out on the entire GW sample using the maximum--likelihood NITRATES pipeline on the BAT data made available via the GUANO infrastructure. We do not detect any significant electromagnetic emission that is temporally and spatially coincident with any of the GW candidates. We report flux upper limits in the 15-350 keV band as a function of sky position for all the catalog candidates. For GW candidates where the Swift-BAT false alarm rate is less than 10$^{-3}$ Hz, we compute the GW--BAT joint false alarm rate. Finally, the derived Swift-BAT upper limits are used to infer constraints on the putative electromagnetic emission associated with binary black hole mergers., Comment: 50 pages, 10 figures, 4 tables
- Published
- 2024
4. The Impact of Project-Based Learning on the Development of Statistical and Scientific Skills: A Study with Chilean University Students from the Faculty of Health Sciences
- Author
-
Chuan Chih Hsu, Chia Shih Su, Kua I. Su, and Chia Li Su
- Abstract
This study investigates the impact of Project-Based Learning (PBL) with an emphasis on statistics on 26 Kinesiology students from a prominent Chilean university. A mixed-methodological approach was employed for the qualitative and quantitative analysis of data collected through surveys, supplementary interviews, and performance evaluations of these students. Furthermore, group grades during the project execution were examined. The correlation between academic performance and the perception of learning through this method was explored. The results indicate a generally favorable assessment of PBL, emphasizing its contribution to the development of statistical and scientific skills, as well as improvement in academic performance, with the option to incorporate additional methods to cater to different student needs. It is concluded that PBL is a potential pedagogical strategy that promotes active engagement in learning and the development of practical skills relevant to health sciences students in Chile.
- Published
- 2024
5. Cost-Effectiveness Analysis for Disease Prevention -- A Case Study on Colorectal Cancer Screening
- Author
-
Xiong, Yi, Chan, Kwun C G, Gorfine, Malka, and Hsu, Li
- Subjects
Statistics - Methodology ,Statistics - Applications - Abstract
Cancer Screening has been widely recognized as an effective strategy for preventing the disease. Despite its effectiveness, determining when to start screening is complicated, because starting too early increases the number of screenings over lifetime and thus costs but starting too late may miss the cancer that could have been prevented. Therefore, to make an informed recommendation on the age to start screening, it is necessary to conduct cost-effectiveness analysis to assess the gain in life years relative to the cost of screenings. As more large-scale observational studies become accessible, there is growing interest in evaluating cost-effectiveness based on empirical evidence. In this paper, we propose a unified measure for evaluating cost-effectiveness and a causal analysis for the continuous intervention of screening initiation age, under the multi-state modeling with semi-competing risks. Extensive simulation results show that the proposed estimators perform well in realistic scenarios. We perform a cost-effectiveness analysis of the colorectal cancer screening, utilizing data from the large-scale Women's Health Initiative. Our analysis reveals that initiating screening at age 50 years yields the highest quality-adjusted life years with an acceptable incremental cost-effectiveness ratio compared to no screening, providing real-world evidence in support of screening recommendation for colorectal cancer., Comment: 37 pages, 2 figures, 8 tables
- Published
- 2024
6. Understanding eGFR Trajectories and Kidney Function Decline via Large Multimodal Models
- Author
-
Li, Chih-Yuan, Wu, Jun-Ting, Hsu, Chan, Lin, Ming-Yen, and Kang, Yihuang
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence - Abstract
The estimated Glomerular Filtration Rate (eGFR) is an essential indicator of kidney function in clinical practice. Although traditional equations and Machine Learning (ML) models using clinical and laboratory data can estimate eGFR, accurately predicting future eGFR levels remains a significant challenge for nephrologists and ML researchers. Recent advances demonstrate that Large Language Models (LLMs) and Large Multimodal Models (LMMs) can serve as robust foundation models for diverse applications. This study investigates the potential of LMMs to predict future eGFR levels with a dataset consisting of laboratory and clinical values from 50 patients. By integrating various prompting techniques and ensembles of LMMs, our findings suggest that these models, when combined with precise prompts and visual representations of eGFR trajectories, offer predictive performance comparable to existing ML models. This research extends the application of foundation models and suggests avenues for future studies to harness these models in addressing complex medical forecasting challenges., Comment: This preprint version includes corrections of typographical errors related to numerical values in Table 2, which were present in the version published at the BDH workshop in MIPR 2024. These corrections do not affect the overall conclusions of the study
- Published
- 2024
7. Self-Testing Quantum Error Correcting Codes: Analyzing Computational Hardness
- Author
-
Kuo, En-Jui and Hsu, Li-Yi
- Subjects
Quantum Physics - Abstract
We present a generalization of the tilted Bell inequality for quantum [[n,k,d]] error-correcting codes and explicitly utilize the simplest perfect code, the [[5,1,3]] code, the Steane [[7,1,3]] code, and Shor's [[9,1,3]] code, to demonstrate the self-testing property of their respective codespaces. Additionally, we establish a framework for the proof of self-testing, as detailed in \cite{baccari2020device}, which can be generalized to the codespace of CSS stabilizers. Our method provides a self-testing scheme for $\cos\theta \lvert \bar{0} \rangle + \sin\theta \lvert \bar{1} \rangle$, where $\theta \in [0, \frac{\pi}{2}]$, and also discusses its experimental application. We also investigate whether such property can be generalized to qudit and show one no-go theorem. We then define a computational problem called ISSELFTEST and describe how this problem formulation can be interpreted as a statement that maximal violation of a specific Bell-type inequality can self-test a particular entanglement subspace. We also discuss the computational complexity of ISSELFTEST in comparison to other classical complexity challenges and some related open problems.
- Published
- 2024
8. Totally Nonnegative Pfaffian for Solitons in BKP Equation
- Author
-
Chang, Jen Hsu
- Subjects
Nonlinear Sciences - Exactly Solvable and Integrable Systems - Abstract
The BKP equation is obtained from the reduction of B type in the KP hierarchy under the orthogonal type transformation group for the KP equation. The skew Schur Q functions can be used to construct the Tau functions of solitons in the BKP equation. Then the totally nonnegative Pfaffian can be defined via the skew Schur Q functions to obtain nonsingular line solitons solution in the BKP equation. The totally nonnegative Pfaffians are investigated. The line solitons interact to form web like structure in the near field region and their resonances appearing in soliton graph could be investigated by the totally nonnegative Pfaffians., Comment: 22 pages, 3 firures
- Published
- 2024
9. Geospatial foundation models for image analysis: evaluating and enhancing NASA-IBM Prithvi's domain adaptability
- Author
-
Hsu, Chia-Yu, Li, Wenwen, and Wang, Sizhe
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Artificial Intelligence - Abstract
Research on geospatial foundation models (GFMs) has become a trending topic in geospatial artificial intelligence (AI) research due to their potential for achieving high generalizability and domain adaptability, reducing model training costs for individual researchers. Unlike large language models, such as ChatGPT, constructing visual foundation models for image analysis, particularly in remote sensing, encountered significant challenges such as formulating diverse vision tasks into a general problem framework. This paper evaluates the recently released NASA-IBM GFM Prithvi for its predictive performance on high-level image analysis tasks across multiple benchmark datasets. Prithvi was selected because it is one of the first open-source GFMs trained on time-series of high-resolution remote sensing imagery. A series of experiments were designed to assess Prithvi's performance as compared to other pre-trained task-specific AI models in geospatial image analysis. New strategies, including band adaptation, multi-scale feature generation, and fine-tuning techniques, are introduced and integrated into an image analysis pipeline to enhance Prithvi's domain adaptation capability and improve model performance. In-depth analyses reveal Prithvi's strengths and weaknesses, offering insights for both improving Prithvi and developing future visual foundation models for geospatial tasks.
- Published
- 2024
10. Crystalline Water Structure in Room-Temperature Clathrate State: Hydrogen-Bonded Pentagonal Rings
- Author
-
Chen, Ching-Hsiu, Hsu, Wei-Hao, Oishi-Tomiyasu, Ryoko, Lee, Chi-Cheng, Chu, Ming-Wen, and Hwang, Ing-Shouh
- Subjects
Condensed Matter - Materials Science - Abstract
Water hydrogen bonding is extremely versatile; approximately 20 ice structures and several types of clathrate hydrate structures have been identified. These crystalline water structures form at temperatures below room temperature and/or at high pressure. We used transmission electron microscopy to study a new crystalline water structure in a clathrate state that is prepared by sandwiching gas-supersaturated water between graphene layers under ambient conditions. In this clathrate state, water molecules form a three-dimensional hydrogen bonding network that encloses gas-filled cages 2-4 nm in size. We derived the crystalline water structure by recording and analyzing electron diffraction patterns and performing first-principles calculations. The structure consists purely of pentagonal rings and has a topology similar to that of water ice XVII. The study proposed a mechanism for the formation of the clathrate state. The present results improve the understanding of interactions among water and small nonpolar molecules and offer novel insights into the local structures of ambient liquid water.
- Published
- 2024
11. Self-supervised Fusarium Head Blight Detection with Hyperspectral Image and Feature Mining
- Author
-
Lin, Yu-Fan, Cheng, Ching-Heng, Qiu, Bo-Cheng, Kang, Cheng-Jun, Lee, Chia-Ming, and Hsu, Chih-Chung
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Machine Learning - Abstract
Fusarium Head Blight (FHB) is a serious fungal disease affecting wheat (including durum), barley, oats, other small cereal grains, and corn. Effective monitoring and accurate detection of FHB are crucial to ensuring stable and reliable food security. Traditionally, trained agronomists and surveyors perform manual identification, a method that is labor-intensive, impractical, and challenging to scale. With the advancement of deep learning and Hyper-spectral Imaging (HSI) and Remote Sensing (RS) technologies, employing deep learning, particularly Convolutional Neural Networks (CNNs), has emerged as a promising solution. Notably, wheat infected with serious FHB may exhibit significant differences on the spectral compared to mild FHB one, which is particularly advantageous for hyperspectral image-based methods. In this study, we propose a self-unsupervised classification method based on HSI endmember extraction strategy and top-K bands selection, designed to analyze material signatures in HSIs to derive discriminative feature representations. This approach does not require expensive device or complicate algorithm design, making it more suitable for practical uses. Our method has been effectively validated in the Beyond Visible Spectrum: AI for Agriculture Challenge 2024. The source code is easy to reproduce and available at {https://github.com/VanLinLin/Automated-Crop-Disease-Diagnosis-from-Hyperspectral-Imagery-3rd}., Comment: Beyond Visible Spectrum: AI for Agriculture Challenge, in conjunted with ICPR 2024
- Published
- 2024
12. Bridging Episodes and Semantics: A Novel Framework for Long-Form Video Understanding
- Author
-
Faure, Gueter Josmy, Yeh, Jia-Fong, Chen, Min-Hung, Su, Hung-Ting, Hsu, Winston H., and Lai, Shang-Hong
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Artificial Intelligence ,Computer Science - Computation and Language - Abstract
While existing research often treats long-form videos as extended short videos, we propose a novel approach that more accurately reflects human cognition. This paper introduces BREASE: BRidging Episodes And SEmantics for Long-Form Video Understanding, a model that simulates episodic memory accumulation to capture action sequences and reinforces them with semantic knowledge dispersed throughout the video. Our work makes two key contributions: First, we develop an Episodic COmpressor (ECO) that efficiently aggregates crucial representations from micro to semi-macro levels. Second, we propose a Semantics reTRiever (SeTR) that enhances these aggregated representations with semantic information by focusing on the broader context, dramatically reducing feature dimensionality while preserving relevant macro-level information. Extensive experiments demonstrate that BREASE achieves state-of-the-art performance across multiple long video understanding benchmarks in both zero-shot and fully-supervised settings. The project page and code are at: https://joslefaure.github.io/assets/html/hermes.html., Comment: Accepted to the EVAL-FoMo Workshop at ECCV'24. Project page: https://joslefaure.github.io/assets/html/hermes.html
- Published
- 2024
13. Grand canonical generative diffusion model for crystalline phases and grain boundaries
- Author
-
Lei, Bo, Chen, Enze, Kwon, Hyuna, Hsu, Tim, Sadigh, Babak, Lordi, Vincenzo, Frolov, Timofey, and Zhou, Fei
- Subjects
Condensed Matter - Materials Science ,Computer Science - Machine Learning - Abstract
The diffusion model has emerged as a powerful tool for generating atomic structures for materials science. This work calls attention to the deficiency of current particle-based diffusion models, which represent atoms as a point cloud, in generating even the simplest ordered crystalline structures. The problem is attributed to particles being trapped in local minima during the score-driven simulated annealing of the diffusion process, similar to the physical process of force-driven simulated annealing. We develop a solution, the grand canonical diffusion model, which adopts an alternative voxel-based representation with continuous rather than fixed number of particles. The method is applied towards generation of several common crystalline phases as well as the technologically important and challenging problem of grain boundary structures.
- Published
- 2024
14. Subgroup Analysis via Model-based Rule Forest
- Author
-
Cheng, I-Ling, Hsu, Chan, Ku, Chantung, Lee, Pei-Ju, and Kang, Yihuang
- Subjects
Computer Science - Machine Learning - Abstract
Machine learning models are often criticized for their black-box nature, raising concerns about their applicability in critical decision-making scenarios. Consequently, there is a growing demand for interpretable models in such contexts. In this study, we introduce Model-based Deep Rule Forests (mobDRF), an interpretable representation learning algorithm designed to extract transparent models from data. By leveraging IF-THEN rules with multi-level logic expressions, mobDRF enhances the interpretability of existing models without compromising accuracy. We apply mobDRF to identify key risk factors for cognitive decline in an elderly population, demonstrating its effectiveness in subgroup analysis and local model optimization. Our method offers a promising solution for developing trustworthy and interpretable machine learning models, particularly valuable in fields like healthcare, where understanding differential effects across patient subgroups can lead to more personalized and effective treatments.
- Published
- 2024
15. Causal Rule Forest: Toward Interpretable and Precise Treatment Effect Estimation
- Author
-
Hsu, Chan, Wu, Jun-Ting, and Kang, Yihuang
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence - Abstract
Understanding and inferencing Heterogeneous Treatment Effects (HTE) and Conditional Average Treatment Effects (CATE) are vital for developing personalized treatment recommendations. Many state-of-the-art approaches achieve inspiring performance in estimating HTE on benchmark datasets or simulation studies. However, the indirect predicting manner and complex model architecture reduce the interpretability of these approaches. To mitigate the gap between predictive performance and heterogeneity interpretability, we introduce the Causal Rule Forest (CRF), a novel approach to learning hidden patterns from data and transforming the patterns into interpretable multi-level Boolean rules. By training the other interpretable causal inference models with data representation learned by CRF, we can reduce the predictive errors of these models in estimating HTE and CATE, while keeping their interpretability for identifying subgroups that a treatment is more effective. Our experiments underscore the potential of CRF to advance personalized interventions and policies, paving the way for future research to enhance its scalability and application across complex causal inference challenges., Comment: The 25th IEEE International Conference on Information Reuse and Integration for Data Science (IRI 2024)
- Published
- 2024
16. Theory of Molecular Emission Power Spectra. III. Multichromophoric Systems Coupled with Polaritons
- Author
-
Wang, Siwei and Hsu, Liang-Yan
- Subjects
Physics - Chemical Physics - Abstract
Based on our previous study [S. Wang $\textit{et al}$. J. Chem. Phys. $\textbf{153}$, 184102 (2020)], we generalize the theory of molecular emission power spectra from single molecules to multichromophoric systems in the framework of macroscopic quantum electrodynamics. This generalized theory is applicable to ensembles of molecules in arbitrary inhomogeneous, dispersive, and absorbing media. In the far-field region, the emission power spectra can be decomposed into products of \textit{electromagnetic environment factors} and \textit{lineshape functions}. To demonstrate the polaritonic effect on multichromophoric systems, we numerically simulate the emission power spectra of one to three molecules above a silver surface. The peak position redshifts as the number of the molecules increases, consistent with Kasha's model. However, surprisingly, the peak height does not increase with the number of molecules. To understand this unusual phenomenon, we derive analytical expressions for lineshape functions and find that the peak heights are associated to the imaginary part of dipole-dipole interactions, which stem from the absorption of the silver surface. It is worth noting that our theory not only covers the key results derived from Kasha's model, but also can predict the lineshape functions of molecules in complex dielectric environments. This study offers one alternative approach to directly analyze the hybrid-state dynamics of multichromophoric systems coupled with polariton., Comment: 16 pages, 4 figures, submitted to The Journal of Chemical Physics
- Published
- 2024
17. One-layer transformers fail to solve the induction heads task
- Author
-
Sanford, Clayton, Hsu, Daniel, and Telgarsky, Matus
- Subjects
Computer Science - Machine Learning ,Statistics - Machine Learning - Abstract
A simple communication complexity argument proves that no one-layer transformer can solve the induction heads task unless its size is exponentially larger than the size sufficient for a two-layer transformer.
- Published
- 2024
18. Improving GNSS Positioning in Challenging Urban Areas by Digital Twin Database Correction
- Author
-
Lian, Jiarong, Zhou, Jiayi, Zhang, Guohao, and Hsu, Li-Ta
- Subjects
Computer Science - Robotics - Abstract
Accurate positioning technology is the foundation for industry and business applications. Although indoor and outdoor positioning techniques have been well studied separately, positioning performance in the intermediate period of changing the positioning environment is still challenging. This paper proposed a digital twin-aided positioning correction method for seamless positioning focusing on improving the receiver's outdoor positioning performance in urban areas, where the change of the positioning environment usually happens. The proposed algorithm will simulate the positioning solution for virtual receivers in a grid-based digital twin. Based on the simulated positioning solutions, a statistical model will be used to study the positioning characteristics and generate a correction information database for real receivers to improve their positioning performance. This algorithm has a low computation load on the receiver side and does not require a specially designed antenna, making it implementable for small-sized devices., Comment: 7 pages conference paper in indoor positioning and indoor navigation 2024
- Published
- 2024
19. InSpaceType: Dataset and Benchmark for Reconsidering Cross-Space Type Performance in Indoor Monocular Depth
- Author
-
Wu, Cho-Ying, Gao, Quankai, Hsu, Chin-Cheng, Wu, Te-Lin, Chen, Jing-Wen, and Neumann, Ulrich
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Machine Learning - Abstract
Indoor monocular depth estimation helps home automation, including robot navigation or AR/VR for surrounding perception. Most previous methods primarily experiment with the NYUv2 Dataset and concentrate on the overall performance in their evaluation. However, their robustness and generalization to diversely unseen types or categories for indoor spaces (spaces types) have yet to be discovered. Researchers may empirically find degraded performance in a released pretrained model on custom data or less-frequent types. This paper studies the common but easily overlooked factor-space type and realizes a model's performance variances across spaces. We present InSpaceType Dataset, a high-quality RGBD dataset for general indoor scenes, and benchmark 13 recent state-of-the-art methods on InSpaceType. Our examination shows that most of them suffer from performance imbalance between head and tailed types, and some top methods are even more severe. The work reveals and analyzes underlying bias in detail for transparency and robustness. We extend the analysis to a total of 4 datasets and discuss the best practice in synthetic data curation for training indoor monocular depth. Further, dataset ablation is conducted to find out the key factor in generalization. This work marks the first in-depth investigation of performance variances across space types and, more importantly, releases useful tools, including datasets and codes, to closely examine your pretrained depth models. Data and code: https://depthcomputation.github.io/DepthPublic/, Comment: BMVC 2024. This version supersedes 2309.13516
- Published
- 2024
20. Technology and Performance Benchmarks of IQM's 20-Qubit Quantum Computer
- Author
-
Abdurakhimov, Leonid, Adam, Janos, Ahmad, Hasnain, Ahonen, Olli, Algaba, Manuel, Alonso, Guillermo, Bergholm, Ville, Beriwal, Rohit, Beuerle, Matthias, Bockstiegel, Clinton, Calzona, Alessio, Chan, Chun Fai, Cucurachi, Daniele, Dahl, Saga, Davletkaliyev, Rakhim, Fedorets, Olexiy, Frieiro, Alejandro Gomez, Gao, Zheming, Guldmyr, Johan, Guthrie, Andrew, Hassel, Juha, Heimonen, Hermanni, Heinsoo, Johannes, Hiltunen, Tuukka, Holland, Keiran, Hotari, Juho, Hsu, Hao, Huhtala, Antti, Hyyppä, Eric, Hämäläinen, Aleksi, Ikonen, Joni, Inel, Sinan, Janzso, David, Jaakkola, Teemu, Jenei, Mate, Jolin, Shan, Juliusson, Kristinn, Jussila, Jaakko, Khalid, Shabeeb, Kim, Seung-Goo, Koistinen, Miikka, Kokkoniemi, Roope, Komlev, Anton, Ockeloen-Korppi, Caspar, Koskinen, Otto, Kotilahti, Janne, Kuisma, Toivo, Kukushkin, Vladimir, Kumpulainen, Kari, Kuronen, Ilari, Kylmälä, Joonas, Lamponen, Niclas, Lamprich, Julia, Landra, Alessandro, Leib, Martin, Li, Tianyi, Liebermann, Per, Lintunen, Aleksi, Liu, Wei, Luus, Jürgen, Marxer, Fabian, de Griend, Arianne Meijer-van, Mitra, Kunal, Moqadam, Jalil Khatibi, Mrożek, Jakub, Mäkynen, Henrikki, Mäntylä, Janne, Naaranoja, Tiina, Nappi, Francesco, Niemi, Janne, Ortega, Lucas, Palma, Mario, Papič, Miha, Partanen, Matti, Penttilä, Jari, Plyushch, Alexander, Qiu, Wei, Rath, Aniket, Repo, Kari, Riipinen, Tomi, Ritvas, Jussi, Romero, Pedro Figueroa, Ruoho, Jarkko, Räbinä, Jukka, Saarinen, Sampo, Sagar, Indrajeet, Sargsyan, Hayk, Sarsby, Matthew, Savola, Niko, Savytskyi, Mykhailo, Selinmaa, Ville, Smirnov, Pavel, Suárez, Marco Marín, Sundström, Linus, Słupińska, Sandra, Takala, Eelis, Takmakov, Ivan, Tarasinski, Brian, Thapa, Manish, Tiainen, Jukka, Tosto, Francesca, Tuorila, Jani, Valenzuela, Carlos, Vasey, David, Vehmaanperä, Edwin, Vepsäläinen, Antti, Vienamo, Aapo, Vesanen, Panu, Välimaa, Alpo, Wesdorp, Jaap, Wurz, Nicola, Wybo, Elisabeth, Yang, Lily, and Yurtalan, Ali
- Subjects
Quantum Physics - Abstract
Quantum computing has tremendous potential to overcome some of the fundamental limitations present in classical information processing. Yet, today's technological limitations in the quality and scaling prevent exploiting its full potential. Quantum computing based on superconducting quantum processing units (QPUs) is among the most promising approaches towards practical quantum advantage. In this article the basic technological approach of IQM Quantum Computers is described covering both the QPU and the rest of the full-stack quantum computer. In particular, the focus is on a 20-qubit quantum computer featuring the Garnet QPU and its architecture, which we will scale up to 150 qubits. We also present QPU and system-level benchmarks, including a median 2-qubit gate fidelity of 99.5% and genuinely entangling all 20 qubits in a Greenberger-Horne-Zeilinger (GHZ) state.
- Published
- 2024
21. Exploring the Feasibility of Automated Data Standardization using Large Language Models for Seamless Positioning
- Author
-
Lee, Max J. L., Lin, Ju, and Hsu, Li-Ta
- Subjects
Electrical Engineering and Systems Science - Signal Processing ,Computer Science - Artificial Intelligence ,Computer Science - Networking and Internet Architecture - Abstract
We propose a feasibility study for real-time automated data standardization leveraging Large Language Models (LLMs) to enhance seamless positioning systems in IoT environments. By integrating and standardizing heterogeneous sensor data from smartphones, IoT devices, and dedicated systems such as Ultra-Wideband (UWB), our study ensures data compatibility and improves positioning accuracy using the Extended Kalman Filter (EKF). The core components include the Intelligent Data Standardization Module (IDSM), which employs a fine-tuned LLM to convert varied sensor data into a standardized format, and the Transformation Rule Generation Module (TRGM), which automates the creation of transformation rules and scripts for ongoing data standardization. Evaluated in real-time environments, our study demonstrates adaptability and scalability, enhancing operational efficiency and accuracy in seamless navigation. This study underscores the potential of advanced LLMs in overcoming sensor data integration complexities, paving the way for more scalable and precise IoT navigation solutions., Comment: Accepted at IPIN 2024. To be published in IEEE Xplore
- Published
- 2024
22. MagicDec: Breaking the Latency-Throughput Tradeoff for Long Context Generation with Speculative Decoding
- Author
-
Chen, Jian, Tiwari, Vashisth, Sadhukhan, Ranajoy, Chen, Zhuoming, Shi, Jinyuan, Yen, Ian En-Hsu, and Chen, Beidi
- Subjects
Computer Science - Computation and Language - Abstract
Large Language Models (LLMs) have become more prevalent in long-context applications such as interactive chatbots, document analysis, and agent workflows, but it is challenging to serve long-context requests with low latency and high throughput. Speculative decoding (SD) is a widely used technique to reduce latency without sacrificing performance but the conventional wisdom suggests that its efficacy is limited to small batch sizes. In MagicDec, we show that surprisingly SD can achieve speedup even for a high throughput inference regime for moderate to long sequences. More interestingly, an intelligent drafting strategy can achieve better speedup with increasing batch size based on our rigorous analysis. MagicDec first identifies the bottleneck shifts with increasing batch size and sequence length, and uses these insights to deploy speculative decoding more effectively for high throughput inference. Then, it leverages draft models with sparse KV cache to address the KV bottleneck that scales with both sequence length and batch size. This finding underscores the broad applicability of speculative decoding in long-context serving, as it can enhance throughput and reduce latency without compromising accuracy. For moderate to long sequences, we demonstrate up to 2x speedup for LLaMA-2-7B-32K and 1.84x speedup for LLaMA-3.1-8B when serving batch sizes ranging from 32 to 256 on 8 NVIDIA A100 GPUs. The code is available at https://github.com/Infini-AI-Lab/MagicDec/.
- Published
- 2024
23. Multiple Topology Replica Exchange of Expanded Ensembles (MT-REXEE) for Multidimensional Alchemical Calculations
- Author
-
Friedman, Anika J., Hsu, Wei-Tse, and Shirts, Michael R.
- Subjects
Physics - Chemical Physics ,Physics - Computational Physics - Abstract
Relative free energy calculations are now widely used in academia and industry, but the accuracy is often limited by poor sampling of the complexes conformational ensemble. To address this, we have developed a novel method termed Multi-Topology Replica Exchange of Expanded Ensembles (MT-REXEE). This method enables parallel expanded ensemble calculations, facilitating iterative relative free energy computations while allowing conformational exchange between parallel transformations. These iterative transformations are adaptable to any set of systems with a common backbone or central substructure. We demonstrate that the MT-REXEE method maintains thermodynamic cycle closure to the same extent as standard expanded ensemble for both solvation free energy and relative binding free energy. The transformations tested involve simple systems that incorporate diverse heavy atoms and multi-site perturbations of a small molecule core resembling multi-site $\lambda$ dynamics, without necessitating modifications to the MD code, which in our initial implementation is GROMACS. We outline a systematic approach for topology set-up and provide instructions on how to perform inter-replicate coordinate modifications. This work shows that MT-REEXE can be used to perform accurate and reproducible free energy estimates and prompts expansion to more complex test systems and other molecular dynamics simulation infrastructures.
- Published
- 2024
24. YSO Jets Magnetocentrifugally Driven by Reconnecting Atmospheric Avalanche Accretion Streams Above Inner Circumstellar Disks
- Author
-
Tu, Yisheng, Li, Zhi-Yun, Zhu, Zhaohuan, Hu, Xiao, and Hsu, Chun-Yen
- Subjects
Astrophysics - Solar and Stellar Astrophysics ,Astrophysics - Astrophysics of Galaxies ,Astrophysics - High Energy Astrophysical Phenomena - Abstract
Fast, collimated jets are ubiquitous features of young stellar objects (YSOs). They are generally thought to be powered by disk accretion, but the details are debated. Through 2D (axisymmetric) MHD simulations, we find that a fast ($>100$~km/s) collimated bipolar jet is continuously driven along the north and south poles of the circumstellar disk that is initially magnetized by a large-scale open poloidal field and contains a thermally ionized inner magnetically active zone surrounded by a dead zone. The fast jet is primarily driven magneto-centrifugally by the release of the gravitational binding energy of the so-called ``avalanche accretion streams" near the boundary of an evacuated poloidal field-dominated polar region and a thick disk atmosphere raised by a toroidal magnetic field. Specifically, the fast outflow is driven along the upper (open) branch of the highly pinched poloidal field lines threading the (strongly magnetically braked) accretion streams where the density is relatively low so that the lightly loaded material can be accelerated magneto-centrifugally along the open field line to a high speed. The highly pinched poloidal magnetic fields threading the avalanche accretion streams tend to reconnect, enabling mass to accrete to the center without dragging along the poloidal magnetic flux with it. The reconnection provides a potential heating source for producing chondrules and calcium- and aluminum-rich inclusions (CAIs).
- Published
- 2024
25. RV measurements of directly imaged brown dwarf GQ Lup B to search for exo-satellites
- Author
-
Horstman, Katelyn, Ruffio, Jean-Baptiste, Batygin, Konstantin, Mawet, Dimitri, Baker, Ashley, Hsu, Chih-Chun, Wang, Jason J., Wang, Ji, Blunt, Sarah, Xuan, Jerry W., Xin, Yinzi, Liberman, Joshua, Agrawal, Shubh, Konopacky, Quinn M., Blake, Geoffrey A., O, Clarissa R. Do, Bartos, Randall, Bond, Charlotte Z., Calvin, Benjamin, Cetre, Sylvain, Delorme, Jacques-Robert, Doppmann, Greg, Echeverri, Daniel, Finnerty, Luke, Fitzgerald, Michael P., Jovanovic, Nemanja, Lopez, Ronald, Martin, Emily C., Morris, Evan, Pezzato, Jacklyn, Ruane, Garreth, Sappey, Ben, Schofield, Tobias, Skemer, Andrew, Venenciano, Taylor, Wallace, J. Kent, Wallack, Nicole L., and Wizinowich, Peter
- Subjects
Astrophysics - Earth and Planetary Astrophysics ,Astrophysics - Solar and Stellar Astrophysics - Abstract
GQ Lup B is one of the few substellar companions with a detected cicumplanetary disk, or CPD. Observations of the CPD suggest the presence of a cavity, possibly formed by an exo-satellite. Using the Keck Planet Imager and Characterizer (KPIC), a high contrast imaging suite that feeds a high resolution spectrograph (1.9-2.5 microns, R$\sim$35,000), we present the first dedicated radial velocity (RV) observations around a high-contrast, directly imaged substellar companion, GQ Lup B, to search for exo-satellites. Over 11 epochs, we find a best and median RV error of 400-1000 m/s, most likely limited by systematic fringing in the spectra due to transmissive optics within KPIC. With this RV precision, KPIC is sensitive to exomoons 0.6-2.8% the mass of GQ Lup B ($\sim 30 M_{\text{Jup}}$) at separations between the Roche limit and $65 R_{\text{Jup}}$, or the extent of the cavity inferred within the CPD detected around GQ Lup B. Using simulations of HISPEC, a high resolution infrared spectrograph planned to debut at W.M. Keck Observatory in 2026, we estimate future exomoon sensitivity to increase by over an order of magnitude, providing sensitivity to less massive satellites potentially formed within the CPD itself. Additionally, we run simulations to estimate the amount of material that different masses of satellites could clear in a CPD to create the observed cavity. We find satellite-to-planet mass ratios of $q > 2 \times 10^{-4}$ can create observable cavities and report a maximum cavity size of $\sim 51 \, R_{\text{Jup}}$ carved from a satellite., Comment: 15 pages, 5 figures
- Published
- 2024
26. Fringing analysis and forward modeling of Keck Planet Imager and Characterizer (KPIC) spectra
- Author
-
Horstman, Katelyn A., Ruffio, Jean-Baptiste, Wang, Jason J., Hsu, Chih-Chun, Baker, Ashley, Finnerty, Luke, Xuan, Jerry, Echeverri, Daniel, Mawet, Dimitri, Blake, Geoffrey A., Bartos, Randall, Bond, Charlotte Z., Calvin, Benjamin, Cetre, Sylvain, Delorme, Jacques-Robert, Doppmann, Greg, Fitzgerald, Michael P., Jovanovic, Nemanja, Lopez, Ronald, Martin, Emily C., Morris, Evan, Pezzato, Jacklyn, Ruane, Garreth, Sappey, Ben, Schofield, Tobias, Skemer, Andrew, Venenciano, Taylor, Wallace, J. Kent, Wang, Ji, and Wizinowich, Peter
- Subjects
Astrophysics - Earth and Planetary Astrophysics ,Astrophysics - Instrumentation and Methods for Astrophysics - Abstract
The Keck Planet Imager and Characterizer (KPIC) combines high contrast imaging with high resolution spectroscopy (R$\sim$35,000 in K band) to study directly imaged exoplanets and brown dwarfs in unprecedented detail. KPIC aims to spectrally characterize substellar companions through measurements of planetary radial velocities, spins, and atmospheric composition. Currently, the dominant source of systematic noise for KPIC is fringing, or oscillations in the spectrum as a function of wavelength. The fringing signal can dominate residuals by up to 10% of the continuum for high S/N exposures, preventing accurate wavelength calibration, retrieval of atmospheric parameters, and detection of planets with flux ratios less than 1% of the host star. To combat contamination from fringing, we first identify its three unique sources and adopt a physically informed model of Fabry-P\'{e}rot cavities to apply to post-processed data. We find this strategy can effectively model the fringing in observations of A0V/F0V stars, reducing the residual systematics caused by fringing by a factor of 2. Next, we wedge two of the transmissive optics internal to KPIC to eliminate two sources of fringing and confirm the third source as the entrance window to the spectrograph. Finally, we apply our previous model of the Fabry-P\'{e}rot cavity to new data taken with the wedged optics to reduce the amplitude of the residuals by a factor of 10., Comment: 13 pages, 6 figures
- Published
- 2024
- Full Text
- View/download PDF
27. PanoSent: A Panoptic Sextuple Extraction Benchmark for Multimodal Conversational Aspect-based Sentiment Analysis
- Author
-
Luo, Meng, Fei, Hao, Li, Bobo, Wu, Shengqiong, Liu, Qian, Poria, Soujanya, Cambria, Erik, Lee, Mong-Li, and Hsu, Wynne
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence - Abstract
While existing Aspect-based Sentiment Analysis (ABSA) has received extensive effort and advancement, there are still gaps in defining a more holistic research target seamlessly integrating multimodality, conversation context, fine-granularity, and also covering the changing sentiment dynamics as well as cognitive causal rationales. This paper bridges the gaps by introducing a multimodal conversational ABSA, where two novel subtasks are proposed: 1) Panoptic Sentiment Sextuple Extraction, panoramically recognizing holder, target, aspect, opinion, sentiment, rationale from multi-turn multi-party multimodal dialogue. 2) Sentiment Flipping Analysis, detecting the dynamic sentiment transformation throughout the conversation with the causal reasons. To benchmark the tasks, we construct PanoSent, a dataset annotated both manually and automatically, featuring high quality, large scale, multimodality, multilingualism, multi-scenarios, and covering both implicit and explicit sentiment elements. To effectively address the tasks, we devise a novel Chain-of-Sentiment reasoning framework, together with a novel multimodal large language model (namely Sentica) and a paraphrase-based verification mechanism. Extensive evaluations demonstrate the superiority of our methods over strong baselines, validating the efficacy of all our proposed methods. The work is expected to open up a new era for the ABSA community, and thus all our codes and data are open at https://PanoSent.github.io/, Comment: Accepted by ACM MM 2024 (Oral)
- Published
- 2024
28. MoDeGPT: Modular Decomposition for Large Language Model Compression
- Author
-
Lin, Chi-Heng, Gao, Shangqian, Smith, James Seale, Patel, Abhishek, Tuli, Shikhar, Shen, Yilin, Jin, Hongxia, and Hsu, Yen-Chang
- Subjects
Computer Science - Machine Learning ,Computer Science - Computation and Language ,Statistics - Machine Learning ,15A23 (Primary) ,I.2.7 - Abstract
Large Language Models (LLMs) have reshaped the landscape of artificial intelligence by demonstrating exceptional performance across various tasks. However, substantial computational requirements make their deployment challenging on devices with limited resources. Recently, compression methods using low-rank matrix techniques have shown promise, yet these often lead to degraded accuracy or introduce significant overhead in parameters and inference latency. This paper introduces \textbf{Mo}dular \textbf{De}composition (MoDeGPT), a novel structured compression framework that does not need recovery fine-tuning while resolving the above drawbacks. MoDeGPT partitions the Transformer block into modules comprised of matrix pairs and reduces the hidden dimensions via reconstructing the module-level outputs. MoDeGPT is developed based on a theoretical framework that utilizes three well-established matrix decomposition algorithms -- Nystr\"om approximation, CR decomposition, and SVD -- and applies them to our redefined transformer modules. Our comprehensive experiments show MoDeGPT, without backward propagation, matches or surpasses previous structured compression methods that rely on gradient information, and saves 98% of compute costs on compressing a 13B model. On \textsc{Llama}-2/3 and OPT models, MoDeGPT maintains 90-95% zero-shot performance with 25-30% compression rates. Moreover, the compression can be done on a single GPU within a few hours and increases the inference throughput by up to 46%., Comment: 31 pages, 9 figures
- Published
- 2024
29. High-Q Slow-Wave Coplanar Waveguides
- Author
-
Hsu, Heng-Chia, Dasgupta, Kaushik, Neihart, Nathan M., Shekhar, Sudip, Walling, Jeffrey S., and Allstot, David J.
- Subjects
Physics - Applied Physics ,Condensed Matter - Materials Science - Abstract
A comprehensive study of methods of maximizing Q for slow-wave coplanar waveguides is described. In addition to the widths of the signal conductor and coplanar ground lines and the distance between them, the length, spacing and stacking of the metal layers of the substrate shield strips are also shown to be critical in maximizing performance. Measured results from more than 50 different devices show that a 7X increase in the quality factor (e.g., Q > 70 at 24 GHz in 0.18 {\mu}m CMOS) is achievable using the optimum topology with optimum dimensions., Comment: 14 pages, 17 figures
- Published
- 2024
30. Online SLA Decomposition: Enabling Real-Time Adaptation to Evolving Systems
- Author
-
Hsu, Cyril Shih-Huan, De Vleeschauwer, Danny, and Papagianni, Chrysa
- Subjects
Computer Science - Networking and Internet Architecture ,Computer Science - Artificial Intelligence ,Computer Science - Machine Learning - Abstract
When a network slice spans multiple domains, each domain must uphold the End-to-End (E2E) Service Level Agreement (SLA) associated with the slice. This requires decomposing the E2E SLA into partial SLAs for each domain. In a two-level network slicing management system with an E2E orchestrator and local controllers, we propose an online learning-decomposition framework that dynamically updates risk models using recent feedback. This approach utilizes online gradient descent and FIFO memory buffers to enhance stability and robustness. Our empirical study shows the proposed framework outperforms state-of-the-art static methods, offering more accurate and resilient SLA decomposition under varying conditions and sparse data., Comment: The paper has been submitted to IEEE Networking Letters
- Published
- 2024
31. General-purpose Clothes Manipulation with Semantic Keypoints
- Author
-
Deng, Yuhong and Hsu, David
- Subjects
Computer Science - Robotics ,Computer Science - Artificial Intelligence - Abstract
We have seen much recent progress in task-specific clothes manipulation, but generalizable clothes manipulation is still a challenge. Clothes manipulation requires sequential actions, making it challenging to generalize to unseen tasks. Besides, a general clothes state representation method is crucial. In this paper, we adopt language instructions to specify and decompose clothes manipulation tasks, and propose a large language model based hierarchical learning method to enhance generalization. For state representation, we use semantic keypoints to capture the geometry of clothes and outline their manipulation methods. Simulation experiments show that the proposed method outperforms the baseline method in terms of success rate and generalization for clothes manipulation tasks.
- Published
- 2024
32. One Year of SN 2023ixf: Breaking Through the Degenerate Parameter Space in Light-Curve Models with Pulsating Progenitors
- Author
-
Hsu, Brian, Smith, Nathan, Goldberg, Jared A., Bostroem, K. Azalee, Hosseinzadeh, Griffin, Sand, David J., Pearson, Jeniveve, Hiramatsu, Daichi, Andrews, Jennifer E., Beasor, Emma R., Dong, Yize, Farah, Joseph, Galbany, LluÍs, Gomez, Sebastian, Gonzalez, Estefania Padilla, Gutiérrez, Claudia P., Howell, D. Andrew, Könyves-Tóth, Réka, McCully, Curtis, Newsome, Megan, Shrestha, Manisha, Terreran, Giacomo, Villar, V. Ashley, and Wang, Xiaofeng
- Subjects
Astrophysics - High Energy Astrophysical Phenomena ,Astrophysics - Solar and Stellar Astrophysics - Abstract
We present and analyze the extensive optical broadband photometry of the Type II SN 2023ixf up to one year after explosion. We find that, when compared to two pre-existing model grids, the pseudo-bolometric light curve is consistent with drastically different combinations of progenitor and explosion properties. This may be an effect of known degeneracies in Type IIP light-curve models. We independently compute a large grid of ${\tt MESA+STELLA}$ single-star progenitor and light-curve models with various zero-age main-sequence masses, mass-loss efficiencies, and convective efficiencies. Using the observed progenitor variability as an additional constraint, we select stellar models consistent with the pulsation period and explode them according to previously established scaling laws to match plateau properties. Our hydrodynamic modeling indicates that SN 2023ixf is most consistent with a moderate-energy ($E_{\rm exp}\approx7\times10^{50}$ erg) explosion of an initially high-mass red supergiant progenitor ($\gtrsim 17\ M_{\odot}$) that lost a significant amount of mass in its prior evolution, leaving a low-mass hydrogen envelope ($\lesssim 3\ M_{\odot}$) at the time of explosion, with a radius $\gtrsim 950\ R_{\odot}$ and a synthesized $^{56}$Ni mass of $0.07\ M_{\odot}$. We posit that previous mass transfer in a binary system may have stripped the envelope of SN 2023ixf's progenitor. The analysis method with pulsation period presented in this work offers a way to break degeneracies in light-curve modeling in the future, particularly with the upcoming Vera C.~Rubin Observatory Legacy Survey of Space and Time, when a record of progenitor variability will be more common., Comment: 18 pages, 7 figures, submitted to ApJ. Comments welcome
- Published
- 2024
33. Ensemble architecture in polyp segmentation
- Author
-
Hsu, Hao-Yun, Cheng, Yi-Ching, and Huang, Guan-Hua
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Artificial Intelligence ,Computer Science - Machine Learning - Abstract
In this research, we revisit the architecture of semantic segmentation and evaluate the models excelling in polyp segmentation. We introduce an integrated framework that harnesses the advantages of different models to attain an optimal outcome. More specifically, we fuse the learned features from convolutional and transformer models for prediction, and we view this approach as an ensemble technique to enhance model performance. Our experiments on polyp segmentation reveal that the proposed architecture surpasses other top models, exhibiting improved learning capacity and resilience. The code is available at https://github.com/HuangDLab/EnFormer.
- Published
- 2024
34. Theorem-Carrying-Transaction: Runtime Certification to Ensure Safety for Smart Contract Transactions
- Author
-
Bjørner, Nikolaj S., Chen, Ashley J., Chen, Shuo, Chen, Yang, Guo, Zhongxin, Hsu, Tzu-Han, Liu, Peng, and Luo, Nanqing
- Subjects
Computer Science - Cryptography and Security ,Computer Science - Programming Languages - Abstract
Security bugs and trapdoors in smart contracts have been impacting the Ethereum community since its inception. Conceptually, the 1.45-million Ethereum's contracts form a single "gigantic program" whose behaviors are determined by the complex reference-topology between the contracts. Can the Ethereum community be assured that this gigantic program conforms to its design-level safety properties, despite unforeseeable code-level intricacies? Static code verification is inadequate due to the program's gigantic scale and high polymorphism. In this paper, we present a viable technological roadmap for the community toward this ambitious goal. Our technology, called Theorem-Carrying-Transaction (TCT), combines the benefits of concrete execution and symbolic proofs. Under the TCT protocol, every transaction carries a theorem that proves its adherence to the specified properties in the invoked contracts, and the runtime system checks the theorem before executing the transaction. Once a property is specified in a contract, it can be treated confidently as an unconditional guarantee made by the contract. As case studies, we demonstrate that TCT secures token contracts without foreseeing code-level intricacies like integer overflow and reentrancy. TCT is also successfully applied to a Uniswap codebase, showcasing a complex decentralized finance (DeFi) scenario. Our prototype incurs a negligible runtime overhead, two orders of magnitude lower than a state-of-the-art approach.
- Published
- 2024
35. Syntax-Guided Automated Program Repair for Hyperproperties
- Author
-
Beutner, Raven, Hsu, Tzu-Han, Bonakdarpour, Borzoo, and Finkbeiner, Bernd
- Subjects
Computer Science - Logic in Computer Science ,Computer Science - Programming Languages - Abstract
We study the problem of automatically repairing infinite-state software programs w.r.t. temporal hyperproperties. As a first step, we present a repair approach for the temporal logic HyperLTL based on symbolic execution, constraint generation, and syntax-guided synthesis of repair expression (SyGuS). To improve the repair quality, we introduce the notation of a transparent repair that aims to find a patch that is as close as possible to the original program. As a practical realization, we develop an iterative repair approach. Here, we search for a sequence of repairs that are closer and closer to the original program's behavior. We implement our method in a prototype and report on encouraging experimental results using off-the-shelf SyGuS solvers., Comment: CAV 2024
- Published
- 2024
36. Interaction- and phonon-induced topological phase transitions in double helical liquids
- Author
-
Hsu, Chen-Hsuan
- Subjects
Condensed Matter - Mesoscale and Nanoscale Physics - Abstract
Helical liquids, formed by time-reversal pairs of interacting electrons in topological edge channels, provide a platform for stabilizing topological superconductivity upon introducing local and nonlocal pairings through the proximity effect. Here, we investigate the effects of electron-electron interactions and phonons on the topological superconductivity in two parallel channels of such helical liquids. Interactions between electrons in different channels tend to reduce nonlocal pairing, suppressing the topological regime. Additionally, electron-phonon coupling breaks the self duality in the electronic subsystem and renormalizes the pairing strengths. Notably, while earlier perturbative calculations suggested that longitudinal phonons have no effect on helical liquids themselves to the leading order, our nonperturbative analysis shows that phonons can induce transitions between topological and trivial superconductivity, thereby weakening the stability of topological zero modes. Our findings highlight practical limitations in realizing topological zero modes in various systems hosting helical channels, including quantum spin Hall insulators, higher-order topological insulators, and their fractional counterparts recently observed in twisted bilayer systems., Comment: 7 pages, 4 figures
- Published
- 2024
- Full Text
- View/download PDF
37. Modeling Athermal Phonons in Novel Materials using the G4CMP Simulation Toolkit
- Author
-
Hernandez, Israel, Linehan, Ryan, Khatiwada, Rakshya, Anyang, Kester, Baxter, Daniel, Bratrud, Grace, Figueroa-Feliciano, Enectali, Hsu, Lauren, Kelsey, Mike, and Temples, Dylan
- Subjects
Physics - Instrumentation and Detectors ,Condensed Matter - Materials Science ,High Energy Physics - Experiment ,Quantum Physics - Abstract
Understanding phonon and charge propagation in superconducting devices plays an important role in both performing low-threshold dark matter searches and limiting correlated errors in superconducting qubits. The Geant4 Condensed Matter Physics (G4CMP) package, originally developed for the Cryogenic Dark Matter Search (CDMS) experiment, models charge and phonon transport within silicon and germanium detectors and has been validated by experimental measurements of phonon caustics, mean charge-carrier drift velocities, and heat pulse propagation times. In this work, we present a concise framework for expanding the capabilities for phonon transport to a number of other novel substrate materials of interest to the dark matter and quantum computing communities, including sapphire (Al$_{2}$O$_{3}$), gallium arsenide (GaAs), lithium fluoride (LiF), calcium tungstate (CaWO$_{4}$), and calcium fluoride (CaF$_{2}$). We demonstrate the use of this framework in generating phonon transport properties of these materials and compare these properties with experimentally-determined values where available., Comment: 18 pages, 13 figures, 6 Tables
- Published
- 2024
38. Large positive magnetoconductance in carbon nanoscrolls
- Author
-
Zhong, Yu-Jie, Huang, Xuan-Fu, Chen, Ting-Zhen, Zhang, Jia-Ren, Li, Jia-Cheng, Huang, Angus, Hsu, Hsiu-Chuan, Ortix, Carmine, and Chang, Ching-Hao
- Subjects
Condensed Matter - Mesoscale and Nanoscale Physics ,Condensed Matter - Disordered Systems and Neural Networks ,Condensed Matter - Materials Science ,Quantum Physics - Abstract
We theoretically demonstrate that carbon nanoscrolls -- spirally wrapped graphene layers with open endpoints -- can be characterized by a large positive magnetoconductance. We show that when a carbon nanoscroll is subject to an axial magnetic field of ~ 10T, the ballistic conductance at low carrier densities of the nanoscroll has an increase of about 200%. Importantly, we find that this positive magnetoconductance is not only preserved but can be even enhanced in the presence of on-site disorder. We prove that the positive magnetoconductance comes about the emergence of magnetic field-induced zero energy modes, specific of rolled-up geometries. Our results establish curved graphene systems as a new material platform displaying sizable magnetoresistive phenomena., Comment: 13 pages, 4 figures
- Published
- 2024
39. Sub-Resolution mmWave FMCW Radar-based Touch Localization using Deep Learning
- Author
-
Rao, Raghunandan M., Kachroo, Amit, Manjunatha, Koushik A., Hsu, Morris, and Kumar, Rohit
- Subjects
Electrical Engineering and Systems Science - Signal Processing - Abstract
Touchscreen-based interaction on display devices are ubiquitous nowadays. However, capacitive touch screens, the core technology that enables its widespread use, are prohibitively expensive to be used in large displays because the cost increases proportionally with the screen area. In this paper, we propose a millimeter wave (mmWave) radar-based solution to achieve subresolution error performance using a network of four mmWave radar sensors. Unfortunately, achieving this is non-trivial due to inherent range resolution limitations of mmWave radars, since the target (human hand, finger etc.) is 'distributed' in space. We overcome this using a deep learning-based approach, wherein we train a deep convolutional neural network (CNN) on range-FFT (range vs power profile)-based features against ground truth (GT) positions obtained using a capacitive touch screen. To emulate the clutter characteristics encountered in radar-based positioning of human fingers, we use a metallic finger mounted on a metallic robot arm as the target. Using this setup, we demonstrate subresolution position error performance. Compared to conventional signal processing (CSP)-based approaches, we achieve a 2-3x reduction in positioning error using the CNN. Furthermore, we observe that the inference time performance and CNN model size support real-time integration of our approach on general purpose processor-based computing platforms., Comment: 7 pages, 9 figures and 2 tables. To appear in the 100th Vehicular Technology Conference (VTC-Fall 2024)
- Published
- 2024
40. Two-dimensional Keldysh theory for non-resonant strong-field ionization of monolayer 2D materials
- Author
-
Her, Tsing-Hua, Chang, Che-Hao, Darden, Kenan, Chang, Tsun-Hsu, and Yao, Hsin-Yu
- Subjects
Physics - Optics ,Condensed Matter - Mesoscale and Nanoscale Physics - Abstract
The Keldysh theory of photoionization for solids is generalized to atomically thin two-dimensional semiconductors. We derive a closed-form formula and its asymptotic forms for a two-band model with a Kane dispersion. These formulas exhibit characteristically different behaviors from their bulk counterparts which are attributed to the scaling of the 2D density of states. We validate our formulas by comparing them to recent strong-field ionization experiments in monolayer MoS2 with good agreement. Our work is expected to find a wide range of applications in intense light - 2D material interaction., Comment: 16 pages, 7 figures
- Published
- 2024
41. Discovery of Dynamical Heterogeneity in a Supercooled Magnetic Monopole Fluid
- Author
-
Dasini, Jahnatta, Carroll, Chaia, Hsu, Chun-Chih, Takahashi, Hiroto, Murphy, Jack, Sharma, Sudarshan, Dawson, Catherine, Jerzembeck, Fabian, Blundell, Stephen J., Luke, Graeme, Davis, J. C. Séamus, and Ward, Jonathan
- Subjects
Condensed Matter - Strongly Correlated Electrons - Abstract
Dynamical heterogeneity in which transitory local fluctuations occur in the conformation and dynamics of constituent particles, is essential for evolution of supercooled liquids into the glass state. Yet its microscopic spatiotemporal phenomenology has remained unobservable in virtually all supercooled glass forming liquids. Recent theoretical advances predict that corresponding dynamical heterogeneity could also occur in supercooled magnetic monopole fluids. Motivated thus, we searched for dynamical heterogeneity when entering the supercooled monopole fluid of Dy2Ti2O7. By measuring microsecond-resolved spontaneous magnetization noise M(t,T) at temperatures between 15 mK
- Published
- 2024
42. DD-rPPGNet: De-interfering and Descriptive Feature Learning for Unsupervised rPPG Estimation
- Author
-
Huang, Pei-Kai, Chen, Tzu-Hsien, Chan, Ya-Ting, Chen, Kuan-Wen, and Hsu, Chiou-Ting
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Remote Photoplethysmography (rPPG) aims to measure physiological signals and Heart Rate (HR) from facial videos. Recent unsupervised rPPG estimation methods have shown promising potential in estimating rPPG signals from facial regions without relying on ground truth rPPG signals. However, these methods seem oblivious to interference existing in rPPG signals and still result in unsatisfactory performance. In this paper, we propose a novel De-interfered and Descriptive rPPG Estimation Network (DD-rPPGNet) to eliminate the interference within rPPG features for learning genuine rPPG signals. First, we investigate the characteristics of local spatial-temporal similarities of interference and design a novel unsupervised model to estimate the interference. Next, we propose an unsupervised de-interfered method to learn genuine rPPG signals with two stages. In the first stage, we estimate the initial rPPG signals by contrastive learning from both the training data and their augmented counterparts. In the second stage, we use the estimated interference features to derive de-interfered rPPG features and encourage the rPPG signals to be distinct from the interference. In addition, we propose an effective descriptive rPPG feature learning by developing a strong 3D Learnable Descriptive Convolution (3DLDC) to capture the subtle chrominance changes for enhancing rPPG estimation. Extensive experiments conducted on five rPPG benchmark datasets demonstrate that the proposed DD-rPPGNet outperforms previous unsupervised rPPG estimation methods and achieves competitive performances with state-of-the-art supervised rPPG methods.
- Published
- 2024
43. Atmospheric characterization of the super-Jupiter HIP 99770 b with KPIC
- Author
-
Zhang, Yapeng, Xuan, Jerry W., Mawet, Dimitri, Wang, Jason J., Hsu, Chih-Chun, Ruffio, Jean-Bapiste, Knutson, Heather A., Inglis, Julie, Blake, Geoffrey A., Chachan, Yayaati, Horstman, Katelyn, Baker, Ashley, Bartos, Randall, Calvin, Benjamin, Cetre, Sylvain, Delorme, Jacques-Robert, Doppmann, Greg, Echeverri, Daniel, Finnerty, Luke, Fitzgerald, Michael P., Jovanovic, Nemanja, Liberman, Joshua, López, Ronald A., Morris, Evan, Pezzato, Jacklyn, Sappey, Ben, Schofield, Tobias, Skemer, Andrew, Wallace, J. Kent, Wang, Ji, and Ó, Clarissa R. Do
- Subjects
Astrophysics - Earth and Planetary Astrophysics ,Astrophysics - Solar and Stellar Astrophysics - Abstract
Young, self-luminous super-Jovian companions discovered by direct imaging provide a challenging test of planet formation and evolution theories. By spectroscopically characterizing the atmospheric compositions of these super-Jupiters, we can constrain their formation histories. Here we present studies of the recently discovered HIP 99770 b, a 16 MJup high-contrast companion on a 17 au orbit, using the fiber-fed high-resolution spectrograph KPIC (R~35,000) on the Keck II telescope. Our K-band observations led to detections of H2O and CO in the atmosphere of HIP 99770 b. We carried out free retrieval analyses using petitRADTRANS to measure its chemical abundances, including the metallicity and C/O ratio, projected rotation velocity (vsini), and radial velocity (RV). We found that the companion's atmosphere has C/O=0.55(-0.04/+0.06) and [M/H]=0.26(-0.23/+0.24) (1{\sigma} confidence intervals), values consistent with those of the Sun and with a companion formation via gravitational instability or core accretion. The projected rotation velocity < 7.8 km/s is small relative to other directly imaged companions with similar masses and ages. This may imply a near pole-on orientation or effective magnetic braking by a circumplanetary disk. In addition, we added the companion-to-primary relative RV measurement to the orbital fitting and obtained updated constraints on orbital parameters. Detailed characterization of super-Jovian companions within 20 au like HIP 99770 b is critical for understanding the formation histories of this population., Comment: 18 pages, 5 figures, accepted to AJ
- Published
- 2024
- Full Text
- View/download PDF
44. Multivariable Extremum Seeking Control for Dynamic Maps through Sliding Modes and Periodic Switching Function
- Author
-
Aminde, Nerito Oliveira, Oliveira, Tiago Roux, and Hsu, Liu
- Subjects
Mathematics - Optimization and Control ,Electrical Engineering and Systems Science - Systems and Control ,93B52, 93C40, 93D30 - Abstract
This paper presents the design of an extremum seeking controller based on sliding modes and cyclic search for real-time optimization of non-linear multivariable dynamic systems. These systems have arbitrary relative degree, compensated by the technique of time-scaling. The resulting approach guarantees global convergence of the system output to a small neighborhood of the optimum point. To corroborate with the theoretical results, numerical simulations are presented considering a system with two inputs and one output, which rapidly converges to the optimal parameters of the objective function., Comment: 6 pages, 5 figures
- Published
- 2024
45. Uncertainty Quantification under Noisy Constraints, with Applications to Raking
- Author
-
Ducellier, Ariane, Hsu, Alexander, Kendrick, Parkes, Gustafson, Bill, Dwyer-Lindgren, Laura, Murray, Christopher, Zheng, Peng, and Aravkin, Aleksandr
- Subjects
Statistics - Methodology ,Mathematics - Numerical Analysis ,Statistics - Applications ,Statistics - Computation - Abstract
We consider statistical inference problems under uncertain equality constraints, and provide asymptotically valid uncertainty estimates for inferred parameters. The proposed approach leverages the implicit function theorem and primal-dual optimality conditions for a particular problem class. The motivating application is multi-dimensional raking, where observations are adjusted to match marginals; for example, adjusting estimated deaths across race, county, and cause in order to match state all-race all-cause totals. We review raking from a convex optimization perspective, providing explicit primal-dual formulations, algorithms, and optimality conditions for a wide array of raking applications, which are then leveraged to obtain the uncertainty estimates. Empirical results show that the approach obtains, at the cost of a single solve, nearly the same uncertainty estimates as computationally intensive Monte Carlo techniques that pass thousands of observed and of marginal draws through the entire raking process.
- Published
- 2024
46. Determination of $|V_{ub}|$ from simultaneous measurements of untagged $B^0\to\pi^- \ell^+ \nu_{\ell}$ and $B^+\to\rho^0 \ell^+\nu_{\ell}$ decays
- Author
-
Belle II Collaboration, Adachi, I., Aggarwal, L., Aihara, H., Akopov, N., Aloisio, A., Althubiti, N., Ky, N. Anh, Asner, D. M., Atmacan, H., Aushev, T., Aushev, V., Aversano, M., Ayad, R., Babu, V., Bae, H., Bahinipati, S., Bambade, P., Banerjee, Sw., Bansal, S., Barrett, M., Baudot, J., Bauer, M., Baur, A., Beaubien, A., Becherer, F., Becker, J., Bennett, J. V., Bernlochner, F. U., Bertacchi, V., Bertemes, M., Bertholet, E., Bessner, M., Bettarini, S., Bhuyan, B., Bianchi, F., Bierwirth, L., Bilka, T., Biswas, D., Bobrov, A., Bodrov, D., Bolz, A., Borah, J., Boschetti, A., Bozek, A., Bračko, M., Branchini, P., Briere, R. A., Browder, T. E., Budano, A., Bussino, S., Campagna, Q., Campajola, M., Cao, L., Casarosa, G., Cecchi, C., Cerasoli, J., Chang, M. -C., Chang, P., Cheaib, R., Cheema, P., Cheon, B. G., Chilikin, K., Chirapatpimol, K., Cho, H. -E., Cho, K., Cho, S. -J., Choi, S. -K., Choudhury, S., Corona, L., Cui, J. X., Dattola, F., De La Cruz-Burelo, E., De La Motte, S. A., De Nardo, G., De Nuccio, M., De Pietro, G., de Sangro, R., Destefanis, M., Dey, S., Dhamija, R., Di Canto, A., Di Capua, F., Dingfelder, J., Doležal, Z., Jiménez, I. Domínguez, Dong, T. V., Dorigo, M., Dorner, D., Dort, K., Dossett, D., Dreyer, S., Dubey, S., Dugic, K., Dujany, G., Ecker, P., Eliachevitch, M., Feichtinger, P., Ferber, T., Fillinger, T., Finck, C., Finocchiaro, G., Fodor, A., Forti, F., Frey, A., Fulsom, B. G., Gabrielli, A., Garcia-Hernandez, M., Garg, R., Gaudino, G., Gaur, V., Gaz, A., Gellrich, A., Ghevondyan, G., Ghosh, D., Ghumaryan, H., Giakoustidis, G., Giordano, R., Giri, A., Glazov, A., Gobbo, B., Godang, R., Gogota, O., Goldenzweig, P., Granderath, S., Greenwald, D., Gruberová, Z., Gu, T., Gudkova, K., Haide, I., Halder, S., Han, Y., Hara, T., Harris, C., Hayasaka, K., Hayashii, H., Hazra, S., Hearty, C., Hedges, M. T., Heidelbach, A., de la Cruz, I. Heredia, Villanueva, M. Hernández, Higuchi, T., Hoek, M., Hohmann, M., Horak, P., Hsu, C. -L., Humair, T., Iijima, T., Inami, K., Ipsita, N., Ishikawa, A., Itoh, R., Iwasaki, M., Jackson, P., Jacobs, W. W., Jang, E. -J., Jia, S., Jin, Y., Johnson, A., Joo, K. K., Junkerkalefeld, H., Kalita, D., Kaliyar, A. B., Kandra, J., Kang, K. H., Kang, S., Karyan, G., Kawasaki, T., Keil, F., Kiesling, C., Kim, C. -H., Kim, D. Y., Kim, K. -H., Kim, Y. -K., Kindo, H., Kinoshita, K., Kodyš, P., Koga, T., Kohani, S., Kojima, K., Konno, T., Korobov, A., Korpar, S., Kovalenko, E., Kowalewski, R., Križan, P., Krokovny, P., Kuhr, T., Kulii, Y., Kumar, J., Kumar, M., Kumar, R., Kumara, K., Kunigo, T., Kuzmin, A., Kwon, Y. -J., Lacaprara, S., Lalwani, K., Lam, T., Lanceri, L., Lange, J. S., Laurenza, M., Lautenbach, K., Leboucher, R., Diberder, F. R. Le, Lee, M. J., Leo, P., Lemettais, C., Levit, D., Lewis, P. M., Li, L. K., Li, S. X., Li, Y., Li, Y. B., Libby, J., Liptak, Z., Liu, M. H., Liu, Q. Y., Liu, Z. Q., Liventsev, D., Longo, S., Lueck, T., Lyu, C., Ma, Y., Maggiora, M., Maharana, S. P., Maiti, R., Maity, S., Mancinelli, G., Manfredi, R., Manoni, E., Mantovano, M., Marcantonio, D., Marcello, S., Marinas, C., Martellini, C., Martens, A., Martini, A., Martinov, T., Massaccesi, L., Masuda, M., Matvienko, D., Maurya, S. K., McKenna, J. A., Mehta, R., Meier, F., Merola, M., Metzner, F., Miller, C., Mirra, M., Mitra, S., Miyabayashi, K., Mizuk, R., Mohanty, G. B., Mondal, S., Moneta, S., Moser, H. -G., Mrvar, M., Mussa, R., Nakamura, I., Nakao, M., Nakazawa, Y., Charan, A. Narimani, Naruki, M., Narwal, D., Natkaniec, Z., Natochii, A., Nayak, L., Nayak, M., Nazaryan, G., Neu, M., Niiyama, M., Nishida, S., Ogawa, S., Onishchuk, Y., Ono, H., Pakhlova, G., Pardi, S., Parham, K., Park, H., Park, J., Park, S. -H., Paschen, B., Passeri, A., Patra, S., Paul, S., Pedlar, T. K., Peschke, R., Pestotnik, R., Piccolo, M., Piilonen, L. E., Angioni, G. Pinna, Podesta-Lerma, P. L. M., Podobnik, T., Pokharel, S., Praz, C., Prell, S., Prencipe, E., Prim, M. T., Prudiiev, I., Purwar, H., Rados, P., Raeuber, G., Raiz, S., Rauls, N., Reif, M., Reiter, S., Remnev, M., Reuter, L., Ripp-Baudot, I., Rizzo, G., Robertson, S. H., Roehrken, M., Roney, J. M., Rostomyan, A., Rout, N., Sanders, D. A., Sandilya, S., Santelj, L., Sato, Y., Savinov, V., Scavino, B., Schmitt, C., Schneider, S., Schnepf, M., Schwanda, C., Seino, Y., Selce, A., Senyo, K., Serrano, J., Sevior, M. E., Sfienti, C., Shan, W., Sharma, C., Shen, C. P., Shi, X. D., Shillington, T., Shimasaki, T., Shiu, J. -G., Shtol, D., Sibidanov, A., Simon, F., Singh, J. B., Skorupa, J., Sobie, R. J., Sobotzik, M., Soffer, A., Sokolov, A., Solovieva, E., Spataro, S., Spruck, B., Starič, M., Stavroulakis, P., Stefkova, S., Stroili, R., Sumihama, M., Sumisawa, K., Sutcliffe, W., Suwonjandee, N., Svidras, H., Takahashi, M., Takizawa, M., Tamponi, U., Tanaka, S., Tanida, K., Tenchini, F., Thaller, A., Tittel, O., Tiwary, R., Tonelli, D., Torassa, E., Trabelsi, K., Uchida, M., Ueda, I., Uglov, T., Unger, K., Unno, Y., Uno, K., Uno, S., Ushiroda, Y., Vahsen, S. E., van Tonder, R., Varvell, K. E., Veronesi, M., Vinokurova, A., Vismaya, V. S., Vitale, L., Vobbilisetti, V., Volpe, R., Vossen, A., Wach, B., Wakai, M., Wallner, S., Wang, E., Wang, M. -Z., Wang, Z., Warburton, A., Watanabe, M., Watanuki, S., Wessel, C., Won, E., Xu, X. P., Yabsley, B. D., Yamada, S., Yang, S. B., Yelton, J., Yin, J. H., Yook, Y. M., Yoshihara, K., Yuan, C. Z., Zani, L., Zeng, F., Zhang, B., Zhilich, V., Zhou, J. S., Zhou, Q. D., Zhou, X. Y., Zhukova, V. I., and Žlebčík, R.
- Subjects
High Energy Physics - Experiment - Abstract
We present a measurement of $|V_{ub}|$ from a simultaneous study of the charmless semileptonic decays $B^0\to\pi^- \ell^+ \nu_{\ell}$ and $B^+\to\rho^0 \ell^+\nu_{\ell}$, where $\ell = e, \mu$. This measurement uses a data sample of 387 million $B\overline{B}$ meson pairs recorded by the Belle~II detector at the SuperKEKB electron-positron collider between 2019 and 2022. The two decays are reconstructed without identifying the partner $B$ mesons. We simultaneously measure the differential branching fractions of $B^0\to\pi^- \ell^+ \nu_{\ell}$ and $B^+\to\rho^0 \ell^+\nu_{\ell}$ decays as functions of $q^2$ (momentum transfer squared). From these, we obtain total branching fractions $B(B^0\to\pi^- \ell^+ \nu_{\ell}) = (1.516 \pm 0.042 (\mathrm{stat}) \pm 0.059 (\mathrm{syst})) \times 10^{-4}$ and $B(B^+\to\rho^0 \ell^+\nu_{\ell}) = (1.625 \pm 0.079 (\mathrm{stat}) \pm 0.180 (\mathrm{syst})) \times 10^{-4}$. By fitting the measured $B^0\to\pi^- \ell^+ \nu_{\ell}$ partial branching fractions as functions of $q^2$, together with constraints on the non-perturbative hadronic contribution from lattice QCD calculations, we obtain $|V_{ub}|$ = $(3.93 \pm 0.09 \pm 0.13 \pm 0.19) \times 10^{-3}$. Here, the first uncertainty is statistical, the second is systematic, and the third is theoretical.
- Published
- 2024
47. TOM: A Development Platform For Wearable Intelligent Assistants
- Author
-
Janaka, Nuwan, Zhao, Shengdong, Hsu, David, Wen, Sherisse Tan Jing, and Keat, Koh Chun
- Subjects
Computer Science - Human-Computer Interaction ,Computer Science - Artificial Intelligence - Abstract
Advanced digital assistants can significantly enhance task performance, reduce user burden, and provide personalized guidance to improve users' abilities. However, the development of such intelligent digital assistants presents a formidable challenge. To address this, we introduce TOM, a conceptual architecture and software platform (https://github.com/TOM-Platform) designed to support the development of intelligent wearable assistants that are contextually aware of both the user and the environment. This system was developed collaboratively with AR/MR researchers, HCI researchers, AI/Robotic researchers, and software developers, and it continues to evolve to meet the diverse requirements of these stakeholders. TOM facilitates the creation of intelligent assistive AR applications for daily activities and supports the recording and analysis of user interactions, integration of new devices, and the provision of assistance for various activities. Additionally, we showcase several proof-of-concept assistive services and discuss the challenges involved in developing such services., Comment: 14 pages, 6 figures, 2 tables
- Published
- 2024
- Full Text
- View/download PDF
48. The Bicameral Cache: a split cache for vector architectures
- Author
-
Rebolledo, Susana, Perez, Borja, Bosque, Jose Luis, and Hsu, Peter
- Subjects
Computer Science - Hardware Architecture ,Computer Science - Performance - Abstract
The Bicameral Cache is a cache organization proposal for a vector architecture that segregates data according to their access type, distinguishing scalar from vector references. Its aim is to avoid both types of references from interfering in each other's data locality, with a special focus on prioritizing the performance on vector references. The proposed system incorporates an additional, non-polluting prefetching mechanism to help populate the long vector cache lines in advance to increase the hit rate by further exploiting the spatial locality on vector data. Its evaluation was conducted on the Cavatools simulator, comparing the performance to a standard conventional cache, over different typical vector benchmarks for several vector lengths. The results proved the proposed cache speeds up performance on stride-1 vector benchmarks, while hardly impacting non-stride-1's. In addition, the prefetching feature consistently provided an additional value., Comment: 10 pages, 5 figures
- Published
- 2024
49. CHIME: LLM-Assisted Hierarchical Organization of Scientific Studies for Literature Review Support
- Author
-
Hsu, Chao-Chun, Bransom, Erin, Sparks, Jenna, Kuehl, Bailey, Tan, Chenhao, Wadden, David, Wang, Lucy Lu, and Naik, Aakanksha
- Subjects
Computer Science - Computation and Language - Abstract
Literature review requires researchers to synthesize a large amount of information and is increasingly challenging as the scientific literature expands. In this work, we investigate the potential of LLMs for producing hierarchical organizations of scientific studies to assist researchers with literature review. We define hierarchical organizations as tree structures where nodes refer to topical categories and every node is linked to the studies assigned to that category. Our naive LLM-based pipeline for hierarchy generation from a set of studies produces promising yet imperfect hierarchies, motivating us to collect CHIME, an expert-curated dataset for this task focused on biomedicine. Given the challenging and time-consuming nature of building hierarchies from scratch, we use a human-in-the-loop process in which experts correct errors (both links between categories and study assignment) in LLM-generated hierarchies. CHIME contains 2,174 LLM-generated hierarchies covering 472 topics, and expert-corrected hierarchies for a subset of 100 topics. Expert corrections allow us to quantify LLM performance, and we find that while they are quite good at generating and organizing categories, their assignment of studies to categories could be improved. We attempt to train a corrector model with human feedback which improves study assignment by 12.6 F1 points. We release our dataset and models to encourage research on developing better assistive tools for literature review., Comment: 2024 ACL Findings
- Published
- 2024
50. Evidence-Based Temporal Fact Verification
- Author
-
Barik, Anab Maulana, Hsu, Wynne, and Lee, Mong Li
- Subjects
Computer Science - Information Retrieval - Abstract
Automated fact verification plays an essential role in fostering trust in the digital space. Despite the growing interest, the verification of temporal facts has not received much attention in the community. Temporal fact verification brings new challenges where cues of the temporal information need to be extracted and temporal reasoning involving various temporal aspects of the text must be applied. In this work, we propose an end-to-end solution for temporal fact verification that considers the temporal information in claims to obtain relevant evidence sentences and harness the power of large language model for temporal reasoning. Recognizing that temporal facts often involve events, we model these events in the claim and evidence sentences. We curate two temporal fact datasets to learn time-sensitive representations that encapsulate not only the semantic relationships among the events, but also their chronological proximity. This allows us to retrieve the top-k relevant evidence sentences and provide the context for a large language model to perform temporal reasoning and outputs whether a claim is supported or refuted by the retrieved evidence sentences. Experiment results demonstrate that the proposed approach significantly enhances the accuracy of temporal claim verification, thereby advancing current state-of-the-art in automated fact verification.
- Published
- 2024
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.