10,326,305 results on '"Liu, A"'
Search Results
2. Devotion Poem
- Author
-
Liu, Anni
- Published
- 2024
- Full Text
- View/download PDF
3. Less Is More: The Causal Effect of Four-Day School Weeks on Employee Turnover. EdWorkingPaper No. 24-1035
- Author
-
Annenberg Institute for School Reform at Brown University, Aaron J. Ainsworth, Emily K. Penner, and Yujia Liu
- Abstract
The use of four-day school weeks (4dsw) in the United States has expanded rapidly over the past two decades. Previous work examines the impact of 4dsw on student outcomes, but little research to date examines the effect on school employees even though schools in some locales have adopted 4dsw to recruit and retain staff. This paper examines the effect of 4dsw adoption in Oregon, a state with widespread 4dsw use, on teacher and other school staff retention by leveraging a staggered roll-out of the schedule using a difference-in-differences design. We find that adopting a four-day week increased turnover among teachers, but that turnover among non-teaching staff was largely unaffected. The findings suggest that policymakers interested in implementing 4dsw for improved school employee retention should exercise caution and be attentive to the full set of incentives offered to staff.
- Published
- 2024
4. A Quantitative Study of Mathematical Language in Upper Elementary Classrooms. EdWorkingPaper No. 24-1029
- Author
-
Annenberg Institute for School Reform at Brown University, Zachary Himmelsbach, Heather C. Hill, Jing Liu, and Dorottya Demszky
- Abstract
This study provides the first large-scale quantitative exploration of mathematical language use in upper elementary U.S. classrooms. Our approach employs natural language processing techniques to describe variation in teachers' and students' use of mathematical language in 1,657 fourth and fifth grade lessons in 317 classrooms in four districts over three years. Students' exposure to mathematical language varies substantially across lessons and between teachers. Results suggest that teacher modeling, defined as the density of mathematical terms in teacher talk, does not substantially cause students to uptake mathematical language, but that teachers may encourage student use of mathematical vocabulary by means other than mere modeling or exposure. However, we also find that teachers who use more mathematical language are more effective at raising student test scores. These findings reveal that teachers who use more mathematical vocabulary are more effective math teachers.
- Published
- 2024
5. The Impact of Dual Enrollment on College Application Choice and Admission Success. EdWorkingPaper No. 24-1018
- Author
-
Annenberg Institute for School Reform at Brown University, Vivian Yuen Ting Liu, Veronica Minaya, and Di Xu
- Abstract
Dual enrollment (DE) is one of the fastest growing programs that support the high school-to-college transition. Yet, there is limited empirical evidence about its impact on either students' college application choices or admission outcomes. Using a fuzzy regression discontinuity approach on data from two cohorts of ninth-grade students in one anonymous state, we found that taking DE credits increased the likelihood of applying to highly selective in-state four-year institutions. Attempting DE credits also increased the probability of gaining admission to a highly selective in-state four-year college. Heterogeneous analysis further indicates that the gains were extended across Black, Latinx, and white student populations.
- Published
- 2024
6. A Comparison of Students' Preferences for Face-to-Face and Online Laboratory Sessions: Insights from Students' Perception of Their Learning Experiences in an Immunology Course
- Author
-
Chin Wen Png, Lih Ing Goh, Yuanxiang Kenneth Chen, Huimin Yeo, and Haiyan Liu
- Abstract
The COVID-19 global pandemic has prompted educators in universities to reconsider their teaching methods, mainly due to the social distancing measures imposed within the classroom settings. On the other hand, the growing importance of continuing education opportunities for adult learners after graduation has seen the need to transform traditional teaching modes that primarily depend on face-to-face interaction into virtual modes, which are deemed more time- and cost-efficient. These major shifts in social and economic developments have a significant impact on the evolution of curriculum planning in higher education. Education that has scientific inquiry components inevitably comes into question, as conventional beliefs that experiments should be hands-on and will not be as effective if conducted virtually cast doubts on the move to the online space. This paper discusses the background of an impending shift in a university's approach to more online-based laboratory classes in an immunology course, as well as the exploration of the potential of conducting online laboratory experiments based on student perceptions.
- Published
- 2024
7. Interim Report 2 on the Implementation, Impact, and Cost Effectiveness of Developmental Education Reform in California's Community Colleges
- Author
-
Research for Action (RFA), Texas Education Research Center, Kri Burkander, Dae Kim, Mark Duffy, Lindsey Liu, Taylor Stenley, Keerthanya Rajesh, and Sean Vannata
- Abstract
Research for Action (RFA) in partnership with the University of Texas at Austin is engaged in a five-year mixed-methods study of the reforms associated with California AB 705. Over the course of the study, our team will assess the implementation, impact, and cost effectiveness of reforms associated with the law. This second interim report, presented at the conclusion of year three of the study, focuses on gaining a deeper understanding of on-campus implementation through a faculty survey administered to math and English departments across our study sample, an Interrupted Time Series analysis with nine cohorts of FTIC student data, and preliminary data collection for our cost effectiveness study. Collectively, these data highlight significant changes that colleges have made on campus regarding shifting enrollments from developmental education into transfer-level coursework in both English and math, and providing additional supports to students to promote retention and completion. We find that AB 705 has demonstrated notable successes in improving enrollment and completion rates in transfer-level courses, particularly in math, among FTIC students in California's community colleges. While our survey results suggest that faculty believe additional resources and supports would be helpful, most faculty report that implementation supports have been adequate.
- Published
- 2024
8. A facile route to synthesize cubic gauche polymeric nitrogen
- Author
-
Chen, Runteng, Zhang, Jun, Wang, Zelong, Lu, Ke, Peng, Yi, Zhao, Jianfa, Liu, Xiaodong, Feng, Shaomin, Liu, Ruibin, Xiao, Chuan, and Jin, Changqing
- Subjects
Condensed Matter - Materials Science ,Condensed Matter - Superconductivity ,Physics - Chemical Physics - Abstract
In this work, the long-sought cg-N with N-N single bond has been synthesized for the first time by a thermal-driven-only chemical route at ambient conditions. The successful synthesis of cg-N was achieved by first creating a solution of azides, which was then pretreated under vacuum conditions. Following the pretreatment, the resultant concentrated azide was heated at temperatures ranging from 260{\deg}C to 330{\deg}C for a reaction time of 3 hours, ultimately leading to the formation of cg-N. The emergent intense Raman peak characterized of cg-N provides solid evidence that the double bonded nitrogen-nitrogen transforms into a single bond form, which agrees well with cg-N structure. To date, this is the only work achieving the quantity of cg-N synthesized at ambient conditions by a facile route that can be further developed for the scalable synthesis and applications of polymerized nitrogen-based materials as high energy density materials., Comment: 13 pages, 5 figures, 1 table, accepted for publication in Science Bulletin
- Published
- 2024
- Full Text
- View/download PDF
9. MDHP-Net: Detecting Injection Attacks on In-vehicle Network using Multi-Dimensional Hawkes Process and Temporal Model
- Author
-
Liu, Qi, Liu, Yanchen, Li, Ruifeng, Cao, Chenhong, Li, Yufeng, Li, Xingyu, Wang, Peng, and Feng, Runhan
- Subjects
Computer Science - Cryptography and Security ,Computer Science - Machine Learning ,Computer Science - Networking and Internet Architecture - Abstract
The integration of intelligent and connected technologies in modern vehicles, while offering enhanced functionalities through Electronic Control Unit and interfaces like OBD-II and telematics, also exposes the vehicle's in-vehicle network (IVN) to potential cyberattacks. In this paper, we consider a specific type of cyberattack known as the injection attack. As demonstrated by empirical data from real-world cybersecurity adversarial competitions(available at https://mimic2024.xctf.org.cn/race/qwmimic2024 ), these injection attacks have excitation effect over time, gradually manipulating network traffic and disrupting the vehicle's normal functioning, ultimately compromising both its stability and safety. To profile the abnormal behavior of attackers, we propose a novel injection attack detector to extract long-term features of attack behavior. Specifically, we first provide a theoretical analysis of modeling the time-excitation effects of the attack using Multi-Dimensional Hawkes Process (MDHP). A gradient descent solver specifically tailored for MDHP, MDHP-GDS, is developed to accurately estimate optimal MDHP parameters. We then propose an injection attack detector, MDHP-Net, which integrates optimal MDHP parameters with MDHP-LSTM blocks to enhance temporal feature extraction. By introducing MDHP parameters, MDHP-Net captures complex temporal features that standard Long Short-Term Memory (LSTM) cannot, enriching temporal dependencies within our customized structure. Extensive evaluations demonstrate the effectiveness of our proposed detection approach.
- Published
- 2024
10. Constraints on the photon polarisation in $b \to s \gamma$ transitions using $B_s^0 \rightarrow \phi e^+e^-$ decays
- Author
-
LHCb collaboration, Aaij, R., Abdelmotteleb, A. S. W., Beteta, C. Abellan, Abudinén, F., Ackernley, T., Adefisoye, A. A., Adeva, B., Adinolfi, M., Adlarson, P., Agapopoulou, C., Aidala, C. A., Ajaltouni, Z., Akar, S., Akiba, K., Albicocco, P., Albrecht, J., Alessio, F., Alexander, M., Aliouche, Z., Cartelle, P. Alvarez, Amalric, R., Amato, S., Amey, J. L., Amhis, Y., An, L., Anderlini, L., Andersson, M., Andreianov, A., Andreola, P., Andreotti, M., Andreou, D., Anelli, A., Ao, D., Archilli, F., Argenton, M., Cuendis, S. Arguedas, Artamonov, A., Artuso, M., Aslanides, E., Da Silva, R. Ataíde, Atzeni, M., Audurier, B., Bacher, D., Perea, I. Bachiller, Bachmann, S., Bachmayer, M., Back, J. J., Rodriguez, P. Baladron, Balagura, V., Baldini, W., Balzani, L., Bao, H., Leite, J. Baptista de Souza, Pretel, C. Barbero, Barbetti, M., Barbosa, I. R., Barlow, R. J., Barnyakov, M., Barsuk, S., Barter, W., Bartolini, M., Bartz, J., Basels, J. M., Bashir, S., Bassi, G., Batsukh, B., Battista, P. B., Bay, A., Beck, A., Becker, M., Bedeschi, F., Bediaga, I. B., Behling, N. A., Belin, S., Bellee, V., Belous, K., Belov, I., Belyaev, I., Benane, G., Bencivenni, G., Ben-Haim, E., Berezhnoy, A., Bernet, R., Andres, S. Bernet, Bertolin, A., Betancourt, C., Betti, F., Bex, J., Bezshyiko, Ia., Bhom, J., Bieker, M. S., Biesuz, N. V., Billoir, P., Biolchini, A., Birch, M., Bishop, F. C. R., Bitadze, A., Bizzeti, A., Blake, T., Blanc, F., Blank, J. E., Blusk, S., Bocharnikov, V., Boelhauve, J. A., Garcia, O. Boente, Boettcher, T., Bohare, A., Boldyrev, A., Bolognani, C. S., Bolzonella, R., Bondar, N., Bordelius, A., Borgato, F., Borghi, S., Borsato, M., Borsuk, J. T., Bouchiba, S. A., Bovill, M., Bowcock, T. J. V., Boyer, A., Bozzi, C., Rodriguez, A. Brea, Breer, N., Brodzicka, J., Gonzalo, A. Brossa, Brown, J., Brundu, D., Buchanan, E., Buonaura, A., Buonincontri, L., Burke, A. T., Burr, C., Butter, J. S., Buytaert, J., Byczynski, W., Cadeddu, S., Cai, H., Caillet, A. C., Calabrese, R., Ramirez, S. Calderon, Calefice, L., Cali, S., Calvi, M., Gomez, M. Calvo, Magalhaes, P. Camargo, Bouzas, J. I. Cambon, Campana, P., Perez, D. H. Campora, Quezada, A. F. Campoverde, Capelli, S., Capriotti, L., Caravaca-Mora, R., Carbone, A., Salgado, L. Carcedo, Cardinale, R., Cardini, A., Carniti, P., Carus, L., Vidal, A. Casais, Caspary, R., Casse, G., Cattaneo, M., Cavallero, G., Cavallini, V., Celani, S., Cervenkov, D., Cesare, S., Chadwick, A. J., Chahrour, I., Charles, M., Charpentier, Ph., Chatzianagnostou, E., Chefdeville, M., Chen, C., Chen, S., Chen, Z., Chernov, A., Chernyshenko, S., Chiotopoulos, X., Chobanova, V., Cholak, S., Chrzaszcz, M., Chubykin, A., Chulikov, V., Ciambrone, P., Vidal, X. Cid, Ciezarek, G., Cifra, P., Clarke, P. E. L., Clemencic, M., Cliff, H. V., Closier, J., Toapaxi, C. Cocha, Coco, V., Cogan, J., Cogneras, E., Cojocariu, L., Collins, P., Colombo, T., Colonna, M., Comerma-Montells, A., Congedo, L., Contu, A., Cooke, N., Corredoira, I., Correia, A., Corti, G., Meldrum, J. J. Cottee, Couturier, B., Craik, D. C., Torres, M. Cruz, Rivera, E. Curras, Currie, R., Da Silva, C. L., Dadabaev, S., Dai, L., Dai, X., Dall'Occo, E., Dalseno, J., D'Ambrosio, C., Daniel, J., Danilina, A., d'Argent, P., Davidson, A., Davies, J. E., Davis, A., Francisco, O. De Aguiar, De Angelis, C., De Benedetti, F., de Boer, J., De Bruyn, K., De Capua, S., De Cian, M., Da Graca, U. De Freitas Carneiro, De Lucia, E., De Miranda, J. M., De Paula, L., De Serio, M., De Simone, P., De Vellis, F., de Vries, J. A., Debernardis, F., Decamp, D., Dedu, V., Dekkers, S., Del Buono, L., Delaney, B., Dembinski, H. -P., Deng, J., Denysenko, V., Deschamps, O., Dettori, F., Dey, B., Di Nezza, P., Diachkov, I., Didenko, S., Ding, S., Dittmann, L., Dobishuk, V., Docheva, A. D., Dong, C., Donohoe, A. M., Dordei, F., Reis, A. C. dos, Dowling, A. D., Duan, W., Duda, P., Dudek, M. W., Dufour, L., Duk, V., Durante, P., Duras, M. M., Durham, J. M., Durmus, O. D., Dziurda, A., Dzyuba, A., Easo, S., Eckstein, E., Egede, U., Egorychev, A., Egorychev, V., Eisenhardt, S., Ejopu, E., Eklund, L., Elashri, M., Ellbracht, J., Ely, S., Ene, A., Eschle, J., Esen, S., Evans, T., Fabiano, F., Falcao, L. N., Fan, Y., Fang, B., Fantini, L., Faria, M., Farmer, K., Fazzini, D., Felkowski, L., Feng, M., Feo, M., Casani, A. Fernandez, Gomez, M. Fernandez, Fernez, A. D., Ferrari, F., Rodrigues, F. Ferreira, Ferrillo, M., Ferro-Luzzi, M., Filippov, S., Fini, R. A., Fiorini, M., Firlej, M., Fischer, K. L., Fitzgerald, D. S., Fitzpatrick, C., Fiutowski, T., Fleuret, F., Fontana, M., Foreman, L. F., Forty, R., Foulds-Holt, D., Lima, V. Franco, Sevilla, M. Franco, Frank, M., Franzoso, E., Frau, G., Frei, C., Friday, D. A., Fu, J., Führing, Q., Fujii, Y., Fulghesu, T., Gabriel, E., Galati, G., Galati, M. D., Torreira, A. Gallas, Galli, D., Gambetta, S., Gandelman, M., Gandini, P., Ganie, B., Gao, H., Gao, R., Gao, T. Q., Gao, Y., Martin, L. M. Garcia, Moreno, P. Garcia, Pardiñas, J. García, Garg, K. G., Garrido, L., Gaspar, C., Geertsema, R. E., Gerken, L. L., Gersabeck, E., Gersabeck, M., Gershon, T., Ghizzo, S., Ghorbanimoghaddam, Z., Giambastiani, L., Giasemis, F. I., Gibson, V., Giemza, H. K., Gilman, A. L., Giovannetti, M., Gioventù, A., Girardey, L., Gironell, P. Gironella, Giugliano, C., Giza, M. A., Gkougkousis, E. L., Glaser, F. C., Gligorov, V. V., Göbel, C., Golobardes, E., Golubkov, D., Golutvin, A., Fernandez, S. Gomez, Gomulka, W., Abrantes, F. Goncalves, Goncerz, M., Gong, G., Gooding, J. A., Gorelov, I. V., Gotti, C., Grabowski, J. P., Cardoso, L. A. Granado, Graugés, E., Graverini, E., Grazette, L., Graziani, G., Grecu, A. T., Greeven, L. M., Grieser, N. A., Grillo, L., Gromov, S., Gu, C., Guarise, M., Guerry, L., Guittiere, M., Guliaeva, V., Günther, P. A., Guseinov, A. -K., Gushchin, E., Guz, Y., Gys, T., Habermann, K., Hadavizadeh, T., Hadjivasiliou, C., Haefeli, G., Haen, C., Haimberger, J., Hajheidari, M., Hallett, G., Halvorsen, M. M., Hamilton, P. M., Hammerich, J., Han, Q., Han, X., Hansmann-Menzemer, S., Hao, L., Harnew, N., Hartmann, M., Hashmi, S., He, J., Hemmer, F., Henderson, C., Henderson, R. D. L., Hennequin, A. M., Hennessy, K., Henry, L., Herd, J., Gascon, P. Herrero, Heuel, J., Hicheur, A., Mendizabal, G. Hijano, Hill, D., Horswill, J., Hou, R., Hou, Y., Howarth, N., Hu, J., Hu, W., Hu, X., Huang, W., Hulsbergen, W., Hunter, R. J., Hushchyn, M., Hutchcroft, D., Idzik, M., Ilin, D., Ilten, P., Inglessi, A., Iniukhin, A., Ishteev, A., Ivshin, K., Jacobsson, R., Jage, H., Elles, S. J. Jaimes, Jakobsen, S., Jans, E., Jashal, B. K., Jawahery, A., Jevtic, V., Jiang, E., Jiang, X., Jiang, Y., Jiang, Y. J., John, M., Rajan, A. John Rubesh, Johnson, D., Jones, C. R., Jones, T. P., Joshi, S., Jost, B., Castella, J. Juan, Jurik, N., Juszczak, I., Kaminaris, D., Kandybei, S., Kane, M., Kang, Y., Kar, C., Karacson, M., Karpenkov, D., Kauniskangas, A., Kautz, J. W., Kazanecki, M. K., Keizer, F., Kenzie, M., Ketel, T., Khanji, B., Kharisova, A., Kholodenko, S., Khreich, G., Kirn, T., Kirsebom, V. S., Kitouni, O., Klaver, S., Kleijne, N., Klimaszewski, K., Kmiec, M. R., Koliiev, S., Kolk, L., Konoplyannikov, A., Kopciewicz, P., Koppenburg, P., Korolev, M., Kostiuk, I., Kot, O., Kotriakhova, S., Kozachuk, A., Kravchenko, P., Kravchuk, L., Kreps, M., Krokovny, P., Krupa, W., Krzemien, W., Kshyvanskyi, O., Kubis, S., Kucharczyk, M., Kudryavtsev, V., Kulikova, E., Kupsc, A., Kutsenko, B. K., Lacarrere, D., Gonzalez, P. Laguarta, Lai, A., Lampis, A., Lancierini, D., Gomez, C. Landesa, Lane, J. J., Lane, R., Lanfranchi, G., Langenbruch, C., Langer, J., Lantwin, O., Latham, T., Lazzari, F., Lazzeroni, C., Gac, R. Le, Lee, H., Lefèvre, R., Leflat, A., Legotin, S., Lehuraux, M., Cid, E. Lemos, Leroy, O., Lesiak, T., Lesser, E. D., Leverington, B., Li, A., Li, C., Li, H., Li, K., Li, L., Li, M., Li, P., Li, P. -R., Li, Q., Li, S., Li, T., Li, Y., Lian, Z., Liang, X., Libralon, S., Lin, C., Lin, T., Lindner, R., Linton, H., Lisovskyi, V., Litvinov, R., Liu, F. L., Liu, G., Liu, K., Liu, S., Liu, W., Liu, Y., Liu, Y. L., Salvia, A. Lobo, Loi, A., Castro, J. Lomba, Long, T., Lopes, J. H., Huertas, A. Lopez, Soliño, S. López, Lu, Q., Lucarelli, C., Lucchesi, D., Martinez, M. Lucio, Lukashenko, V., Luo, Y., Lupato, A., Luppi, E., Lynch, K., Lyu, X. -R., Ma, G. M., Maccolini, S., Machefert, F., Maciuc, F., Mack, B., Mackay, I., Mackey, L. M., Mohan, L. R. Madhan, Madurai, M. J., Maevskiy, A., Magdalinski, D., Maisuzenko, D., Majewski, M. W., Malczewski, J. J., Malde, S., Malentacca, L., Malinin, A., Maltsev, T., Manca, G., Mancinelli, G., Mancuso, C., Escalero, R. Manera, Manganella, F. M., Manuzzi, D., Marangotto, D., Marchand, J. F., Marchevski, R., Marconi, U., Mariani, E., Mariani, S., Benito, C. Marin, Marks, J., Marshall, A. M., Martel, L., Martelli, G., Martellotti, G., Martinazzoli, L., Martinelli, M., Gomez, D. Martinez, Santos, D. Martinez, Vidal, F. Martinez, Massafferri, A., Matev, R., Mathad, A., Matiunin, V., Matteuzzi, C., Mattioli, K. R., Mauri, A., Maurice, E., Mauricio, J., Mayencourt, P., de Cos, J. Mazorra, Mazurek, M., McCann, M., Mcconnell, L., McGrath, T. H., McHugh, N. T., McNab, A., McNulty, R., Meadows, B., Meier, G., Melnychuk, D., Meng, F. M., Merk, M., Merli, A., Garcia, L. Meyer, Miao, D., Miao, H., Mikhasenko, M., Milanes, D. A., Minotti, A., Minucci, E., Miralles, T., Mitreska, B., Mitzel, D. S., Modak, A., Mohammed, R. A., Moise, R. D., Mokhnenko, S., Cardenas, E. F. Molina, Mombächer, T., Monk, M., Monteil, S., Gomez, A. Morcillo, Morello, G., Morello, M. J., Morgenthaler, M. P., Moron, J., Morris, A. B., Morris, A. G., Mountain, R., Mu, H., Mu, Z. M., Muhammad, E., Muheim, F., Mulder, M., Müller, K., Muñoz-Rojas, F., Murta, R., Naik, P., Nakada, T., Nandakumar, R., Nanut, T., Nasteva, I., Needham, M., Neri, N., Neubert, S., Neufeld, N., Neustroev, P., Nicolini, J., Nicotra, D., Niel, E. M., Nikitin, N., Niu, Q., Nogarolli, P., Nogga, P., Normand, C., Fernandez, J. Novoa, Nowak, G., Nunez, C., Nur, H. N., Oblakowska-Mucha, A., Obraztsov, V., Oeser, T., Okamura, S., Okhotnikov, A., Okhrimenko, O., Oldeman, R., Oliva, F., Olocco, M., Onderwater, C. J. G., O'Neil, R. H., Osthues, D., Goicochea, J. M. Otalora, Owen, P., Oyanguren, A., Ozcelik, O., Paciolla, F., Padee, A., Padeken, K. O., Pagare, B., Pais, P. R., Pajero, T., Palano, A., Palutan, M., Panshin, G., Paolucci, L., Papanestis, A., Pappagallo, M., Pappalardo, L. L., Pappenheimer, C., Parkes, C., Passalacqua, B., Passaleva, G., Passaro, D., Pastore, A., Patel, M., Patoc, J., Patrignani, C., Paul, A., Pawley, C. J., Pellegrino, A., Peng, J., Altarelli, M. Pepe, Perazzini, S., Pereima, D., Da Costa, H. Pereira, Castro, A. Pereiro, Perret, P., Perrevoort, A., Perro, A., Petridis, K., Petrolini, A., Pfaller, J. P., Pham, H., Pica, L., Piccini, M., Piccolo, L., Pietrzyk, B., Pietrzyk, G., Pinci, D., Pisani, F., Pizzichemi, M., Placinta, V., Casasus, M. Plo, Poeschl, T., Polci, F., Lener, M. Poli, Poluektov, A., Polukhina, N., Polyakov, I., Polycarpo, E., Ponce, S., Popov, D., Poslavskii, S., Prasanth, K., Prouve, C., Provenzano, D., Pugatch, V., Punzi, G., Qasim, S., Qian, Q. Q., Qian, W., Qin, N., Qu, S., Quagliani, R., Trejo, R. I. Rabadan, Rademacker, J. H., Rama, M., García, M. Ramírez, De Oliveira, V. Ramos, Pernas, M. Ramos, Rangel, M. S., Ratnikov, F., Raven, G., De Miguel, M. Rebollo, Redi, F., Reich, J., Reiss, F., Ren, Z., Resmi, P. K., Ribatti, R., Ricart, G. R., Riccardi, D., Ricciardi, S., Richardson, K., Richardson-Slipper, M., Rinnert, K., Robbe, P., Robertson, G., Rodrigues, E., Alvarez, A. Rodriguez, Fernandez, E. Rodriguez, Lopez, J. A. Rodriguez, Rodriguez, E. Rodriguez, Roensch, J., Rogachev, A., Rogovskiy, A., Rolf, D. L., Roloff, P., Romanovskiy, V., Vidal, A. Romero, Romolini, G., Ronchetti, F., Rong, T., Rotondo, M., Roy, S. R., Rudolph, M. S., Diaz, M. Ruiz, Fernandez, R. A. Ruiz, Vidal, J. Ruiz, Ryzhikov, A., Ryzka, J., Saavedra-Arias, J. J., Silva, J. J. Saborido, Sadek, R., Sagidova, N., Sahoo, D., Sahoo, N., Saitta, B., Salomoni, M., Sanderswood, I., Santacesaria, R., Rios, C. Santamarina, Santimaria, M., Santoro, L., Santovetti, E., Saputi, A., Saranin, D., Sarnatskiy, A., Sarpis, G., Sarpis, M., Satriano, C., Satta, A., Saur, M., Savrina, D., Sazak, H., Sborzacchi, F., Smead, L. G. Scantlebury, Scarabotto, A., Schael, S., Scherl, S., Schiller, M., Schindler, H., Schmelling, M., Schmidt, B., Schmitt, S., Schmitz, H., Schneider, O., Schopper, A., Schulte, N., Schulte, S., Schune, M. H., Schwemmer, R., Schwering, G., Sciascia, B., Sciuccati, A., Sellam, S., Semennikov, A., Senger, T., Soares, M. Senghi, Sergi, A., Serra, N., Sestini, L., Seuthe, A., Shang, Y., Shangase, D. M., Shapkin, M., Sharma, R. S., Shchemerov, I., Shchutska, L., Shears, T., Shekhtman, L., Shen, Z., Sheng, S., Shevchenko, V., Shi, B., Shi, Q., Shimizu, Y., Shmanin, E., Shorkin, R., Shupperd, J. D., Coutinho, R. Silva, Simi, G., Simone, S., Skidmore, N., Skwarnicki, T., Slater, M. W., Smallwood, J. C., Smith, E., Smith, K., Smith, M., Snoch, A., Lavra, L. Soares, Sokoloff, M. D., Soler, F. J. P., Solomin, A., Solovev, A., Solovyev, I., Sommerfeld, N. S., Song, R., Song, Y., Song, Y. S., De Almeida, F. L. Souza, De Paula, B. Souza, Norella, E. Spadaro, Spedicato, E., Speer, J. G., Spiridenkov, E., Spradlin, P., Sriskaran, V., Stagni, F., Stahl, M., Stahl, S., Stanislaus, S., Stein, E. N., Steinkamp, O., Stenyakin, O., Stevens, H., Strekalina, D., Su, Y., Suljik, F., Sun, J., Sun, L., Sundfeld, D., Sutcliffe, W., Swallow, P. N., Swientek, K., Swystun, F., Szabelski, A., Szumlak, T., Tan, Y., Tat, M. D., Terentev, A., Terzuoli, F., Teubert, F., Thomas, E., Thompson, D. J. D., Tilquin, H., Tisserand, V., T'Jampens, S., Tobin, M., Tomassetti, L., Tonani, G., Tong, X., Machado, D. Torres, Toscano, L., Tou, D. Y., Trippl, C., Tuci, G., Tuning, N., Uecker, L. H., Ukleja, A., Unverzagt, D. J., Ursov, E., Usachov, A., Ustyuzhanin, A., Uwer, U., Vagnoni, V., Cadenas, V. Valcarce, Valenti, G., Canudas, N. Valls, Van Hecke, H., van Herwijnen, E., Van Hulse, C. B., Van Laak, R., van Veghel, M., Vasquez, G., Gomez, R. Vazquez, Regueiro, P. Vazquez, Sierra, C. Vázquez, Vecchi, S., Velthuis, J. J., Veltri, M., Venkateswaran, A., Verdoglia, M., Vesterinen, M., Benet, D. Vico, Villalba, P. Vidrier, Diaz, M. Vieites, Vilasis-Cardona, X., Figueras, E. Vilella, Villa, A., Vincent, P., Volle, F. C., Bruch, D. vom, Voropaev, N., Vos, K., Vouters, G., Vrahas, C., Wagner, J., Walsh, J., Walton, E. J., Wan, G., Wang, C., Wang, G., Wang, H., Wang, J., Wang, M., Wang, N. W., Wang, R., Wang, X., Wang, X. W., Wang, Y., Wang, Y. W., Wang, Z., Ward, J. A., Waterlaat, M., Watson, N. K., Websdale, D., Wei, Y., Wendel, J., Westhenry, B. D. C., White, C., Whitehead, M., Whiter, E., Wiederhold, A. R., Wiedner, D., Wilkinson, G., Wilkinson, M. K., Williams, M., Williams, M. J., Williams, M. R. J., Williams, R., Williams, Z., Wilson, F. F., Winn, M., Wislicki, W., Witek, M., Witola, L., Wormser, G., Wotton, S. A., Wu, H., Wu, J., Wu, X., Wu, Y., Wu, Z., Wyllie, K., Xian, S., Xiang, Z., Xie, Y., Xu, A., Xu, J., Xu, L., Xu, M., Xu, Z., Yang, D., Yang, K., Yang, S., Yang, X., Yang, Y., Yang, Z., Yeroshenko, V., Yeung, H., Yin, H., Yin, X., Yu, C. Y., Yu, J., Yuan, X., Yuan, Y, Zaffaroni, E., Zavertyaev, M., Zdybal, M., Zenesini, F., Zeng, C., Zeng, M., Zhang, C., Zhang, D., Zhang, J., Zhang, L., Zhang, S., Zhang, Y., Zhang, Y. Z., Zhao, Y., Zharkova, A., Zhelezov, A., Zheng, S. Z., Zheng, X. Z., Zheng, Y., Zhou, T., Zhou, X., Zhou, Y., Zhovkovska, V., Zhu, L. Z., Zhu, X., Zhukov, V., Zhuo, J., Zou, Q., Zuliani, D., and Zunica, G.
- Subjects
High Energy Physics - Experiment - Abstract
An angular analysis of the $B_s^0 \rightarrow \phi e^+e^-$ decay is performed using the proton-proton collision dataset collected between 2011 and 2018 by the LHCb experiment, corresponding to an integrated luminosity of $9\,{\rm fb}^{-1}$ at centre-of-mass energies of 7, 8 and $13\,{\rm TeV}$. The analysis is performed in the very low dielectron invariant mass-squared region between $0.0009$ and $0.2615\,{\rm GeV}^2\!/c^4$. The longitudinal polarisation fraction of the $\phi$ meson is measured to be less than $11.5\%$ at $90\%$ confidence level. The $A_{\mathrm{T}}^{\mathcal{R}e C\!P}$ observable, which is related to the lepton forward-backward asymmetry, is measured to be $0.116 \pm 0.155 \pm 0.006$, where the first uncertainty is statistical and the second systematic. The transverse asymmetries, $A_{\mathrm{T}}^{(2)}$ and $A_{\mathrm{T}}^{\mathcal{I}m C\!P}$ , which are sensitive to the virtual photon polarisation, are found to be $-0.045 \pm 0.235 \pm 0.014$ and $0.002 \pm 0.247 \pm 0.016$, respectively. The results are consistent with Standard Model predictions., Comment: 21 pages, 4 figures. All figures and tables, along with any supplementary material and additional information, are available at https://lbfence.cern.ch/alcm/public/analysis/full-details/3433/(LHCb public pages)
- Published
- 2024
11. Self-Alignment Radio Frequency Resonant Beam System for Information and Power Transfer
- Author
-
Jiang, Qingwei, Liu, Mingqing, Xu, Mengyuan, Fang, Wen, Xiong, Mingliang, Liu, Qingwen, and Zhou, Shengli
- Subjects
Mathematics - Numerical Analysis - Abstract
Due to power attenuation, improving transmission efficiency in the radio-frequency (RF) band remains a significant challenge, which hinders advancements in various fields of the Internet of Things (IoT), such as wireless power transfer (WPT) and wireless communication. Array design and retro-directive beamforming (RD-BF) techniques offer simple and effective ways to enhance transmission efficiency. However, when the target is an array or in the near field, the RD-BF system (RD-BFS) cannot radiate more energy to the target due to phase irregularities in the target region, resulting in challenges in achieving higher efficiency. To address this issue, we propose the RF-based resonant beam system (RF-RBS), which adaptively optimizes phase and power distribution between transmitting and receiving arrays by leveraging the resonance mechanism to achieve higher transmission efficiency. We analyze the system structure and develop an analytical model to evaluate power flow and resonance establishment. Numerical analysis demonstrates that the proposed RF-RBS achieves self-alignment without beam control and provides higher transmission efficiency compared to RD-BFS, with improvements of up to 16%. This self-alignment capability allows the system to effectively transfer power and information across varying distances and offsets. The numerical results indicate the capability to transmit watt-level power and achieve 21 bps/Hz of downlink spectral efficiency in indoor settings, highlighting the advantages of RF-RBS in information and power transfer for mobile applications.
- Published
- 2024
12. Legal Evalutions and Challenges of Large Language Models
- Author
-
Wang, Jiaqi, Zhao, Huan, Yang, Zhenyuan, Shu, Peng, Chen, Junhao, Sun, Haobo, Liang, Ruixi, Li, Shixin, Shi, Pengcheng, Ma, Longjun, Liu, Zongjia, Liu, Zhengliang, Zhong, Tianyang, Zhang, Yutong, Ma, Chong, Zhang, Xin, Zhang, Tuo, Ding, Tianli, Ren, Yudan, Liu, Tianming, Jiang, Xi, and Zhang, Shu
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence - Abstract
In this paper, we review legal testing methods based on Large Language Models (LLMs), using the OPENAI o1 model as a case study to evaluate the performance of large models in applying legal provisions. We compare current state-of-the-art LLMs, including open-source, closed-source, and legal-specific models trained specifically for the legal domain. Systematic tests are conducted on English and Chinese legal cases, and the results are analyzed in depth. Through systematic testing of legal cases from common law systems and China, this paper explores the strengths and weaknesses of LLMs in understanding and applying legal texts, reasoning through legal issues, and predicting judgments. The experimental results highlight both the potential and limitations of LLMs in legal applications, particularly in terms of challenges related to the interpretation of legal language and the accuracy of legal reasoning. Finally, the paper provides a comprehensive analysis of the advantages and disadvantages of various types of models, offering valuable insights and references for the future application of AI in the legal field.
- Published
- 2024
13. \boldmath Measurement of {\boldmath $B \to K{}^{*}(892)\gamma$} decays at Belle~II
- Author
-
Belle II Collaboration, Adachi, I., Aggarwal, L., Ahmed, H., 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., Baghel, N. K., Bahinipati, S., Bambade, P., Banerjee, Sw., Bansal, S., Barrett, M., Bartl, M., Baudot, J., Baur, A., Beaubien, A., Becherer, F., Becker, J., Bennett, J. V., Bernlochner, F. U., Bertacchi, V., Bertemes, M., Bertholet, E., Bessner, M., Bettarini, S., Bhardwaj, V., Bhuyan, B., Bianchi, F., Bierwirth, L., Bilka, T., Biswas, D., Bobrov, A., Bodrov, D., Bolz, A., Bondar, 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., Chen, C., Cheon, B. G., Chilikin, K., Chirapatpimol, K., Cho, H. -E., Cho, K., Cho, S. -J., Choi, S. -K., Choudhury, S., Cochran, J., Corona, L., Cui, J. X., Dattola, F., De La Cruz-Burelo, E., De La Motte, S. A., de Marino, G., De Nardo, G., 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., Dort, K., Dossett, D., 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., Ganiev, E., 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., Gironell, P. Gironella, Glazov, A., Gobbo, B., Godang, R., Gogota, O., Goldenzweig, P., Gradl, W., Graziani, E., Greenwald, D., Gruberová, Z., Gu, T., Guan, Y., 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., Hoppe, R., 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., Kaleta, M., Kalita, D., Kaliyar, A. B., Kandra, J., Kang, K. H., Kang, S., Karyan, G., Kawasaki, T., Keil, F., Ketter, C., Kiesling, C., Kim, C. -H., Kim, D. Y., Kim, J. -Y., Kim, K. -H., Kim, Y. -K., Kim, Y. J., Kindo, H., Kinoshita, K., Kodyš, P., Koga, T., Kohani, S., Kojima, K., Korobov, A., Korpar, S., Kovalenko, E., Kowalewski, R., Križan, P., Krokovny, P., Kuhr, T., Kulii, Y., Kumar, D., Kumar, M., Kumara, K., Kunigo, T., Kuzmin, A., Kwon, Y. -J., Lacaprara, S., Lai, Y. -T., Lalwani, K., Lam, T., Lanceri, L., Lange, J. S., Lau, T. S., Laurenza, M., Leboucher, R., Diberder, F. R. Le, Lee, M. J., Lemettais, C., Leo, P., Levit, D., Lewis, P. M., Li, C., Li, L. K., Li, Q. M., Li, S. X., Li, W. Z., Li, Y., Li, Y. B., Liao, Y. P., Libby, J., Lin, J., Liptak, Z., Liu, M. H., Liu, Q. Y., Liu, Y., Liu, Z. Q., Liventsev, D., Longo, S., Lyu, C., Ma, Y., Madaan, C., 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., Matsuda, T., Matsuoka, K., Matvienko, D., Maurya, S. K., Maushart, M., 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., Naruki, M., Natkaniec, Z., Natochii, A., Nayak, M., Nazaryan, G., Neu, M., Niebuhr, C., Niiyama, M., Nishida, S., Ogawa, S., Onishchuk, Y., Ono, H., Onuki, Y., Otani, F., Pakhlov, P., Pakhlova, G., Paoloni, E., Pardi, S., Parham, K., Park, H., Park, J., Park, K., Park, S. -H., Paschen, B., Passeri, A., Patra, S., Paul, S., Pedlar, T. K., Peruzzi, I., 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., Ravindran, K., Rehman, J. U., Reif, M., Reiter, S., Remnev, M., Reuter, L., Herrmann, D. Ricalde, 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., Schwartz, A. J., 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., Shwartz, B., Sibidanov, A., Simon, F., Singh, J. B., Skorupa, J., Sobie, R. J., Sobotzik, M., Soffer, A., Sokolov, A., Solovieva, E., Song, W., Spataro, S., Spruck, B., Starič, M., Stavroulakis, P., Stefkova, S., Stroili, R., Strube, J., Sue, Y., Sumihama, M., Sumisawa, K., Sutcliffe, W., Suwonjandee, N., Svidras, H., Takahashi, M., Takizawa, M., Tamponi, U., Tanida, K., Tenchini, F., Thaller, A., Tittel, O., Tiwary, R., Torassa, E., Trabelsi, K., Tsaklidis, I., Ueda, I., Uglov, T., Unger, K., Unno, Y., Uno, K., Uno, S., Urquijo, P., 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, X. L., Wang, Z., Warburton, A., Watanabe, M., Watanuki, S., Wessel, C., Won, E., Xu, X. P., Yabsley, B. D., Yamada, S., Yan, W., Yang, S. B., Yelton, J., Yin, J. H., Yook, Y. M., Yoshihara, K., Yuan, C. Z., Yuan, J., Zani, L., Zeng, F., Zhang, B., Zhilich, V., Zhou, J. S., Zhou, Q. D., Zhukova, V. I., and Žlebčík, R.
- Subjects
High Energy Physics - Experiment - Abstract
We present measurements of $B \to K{}^{*}(892)\gamma$ decays using $365\,{\rm fb}^{-1}$ of data collected from 2019 to 2022 by the Belle~II experiment at the SuperKEKB asymmetric-energy $e^+e^-$ collider. The data sample contains $(387 \pm 6) \times 10^6$ $B\overline{B}$ events. We measure branching fractions ($\mathcal{B}$) and $C\!P$ asymmetries ($\mathcal{A}_{C\!P}$) for both $B^{0}\to K{}^{*0}\gamma$ and $B^{+}\to K{}^{*+}\gamma$ decays. The difference in $C\!P$ asymmetries ($\Delta \mathcal{A}_{C\!P}$) and the isospin asymmetry ($\Delta_{0+}$) between these neutral and charged channels are also measured. We obtain the following branching fractions and $C\!P$ asymmetries: $\mathcal{B} (B^{0} \to K{}^{*0}\gamma) = (4.14 \pm 0.10 \pm 0.11 ) \times 10^{-5}$, $\mathcal{B} (B^{+} \to K{}^{*+}\gamma) = (4.02 \pm 0.13 \pm 0.13 )\times 10^{-5}$, $\mathcal{A}_{C\!P} (B^{0} \to K{}^{*0}\gamma) = (-3.3 \pm 2.3 \pm 0.4 )\%$, and $\mathcal{A}_{C\!P} (B^{+} \to K{}^{*+}\gamma) = (-0.7 \pm 2.9 \pm 0.6 )\%$. The measured difference in $C\!P$ asymmetries is $\Delta \mathcal{A}_{C\!P} = (+2.6 \pm 3.8 \pm 0.7 )\%$, and the measured isospin asymmetry is $\Delta_{0+} = (+5.0 \pm 2.0 \pm 1.5 )\%$. The first uncertainties listed are statistical and the second are systematic. These results are consistent with world-average values and theory predictions.
- Published
- 2024
14. Step-wise Distribution Alignment Guided Style Prompt Tuning for Source-free Cross-domain Few-shot Learning
- Author
-
Xu, Huali, Liu, Yongxiang, Liu, Li, Zhi, Shuaifeng, Sun, Shuzhou, Liu, Tianpeng, and Cheng, MingMing
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Existing cross-domain few-shot learning (CDFSL) methods, which develop source-domain training strategies to enhance model transferability, face challenges with large-scale pre-trained models (LMs) due to inaccessible source data and training strategies. Moreover, fine-tuning LMs for CDFSL demands substantial computational resources, limiting practicality. This paper addresses the source-free CDFSL (SF-CDFSL) problem, tackling few-shot learning (FSL) in the target domain using only pre-trained models and a few target samples without source data or strategies. To overcome the challenge of inaccessible source data, this paper introduces Step-wise Distribution Alignment Guided Style Prompt Tuning (StepSPT), which implicitly narrows domain gaps through prediction distribution optimization. StepSPT proposes a style prompt to align target samples with the desired distribution and adopts a dual-phase optimization process. In the external process, a step-wise distribution alignment strategy factorizes prediction distribution optimization into a multi-step alignment problem to tune the style prompt. In the internal process, the classifier is updated using standard cross-entropy loss. Evaluations on five datasets demonstrate that StepSPT outperforms existing prompt tuning-based methods and SOTAs. Ablation studies further verify its effectiveness. Code will be made publicly available at \url{https://github.com/xuhuali-mxj/StepSPT}., Comment: 15 pages, 12 figures, 7 tables
- Published
- 2024
15. EyeDiff: text-to-image diffusion model improves rare eye disease diagnosis
- Author
-
Chen, Ruoyu, Zhang, Weiyi, Liu, Bowen, Chen, Xiaolan, Xu, Pusheng, Liu, Shunming, He, Mingguang, and Shi, Danli
- Subjects
Electrical Engineering and Systems Science - Image and Video Processing ,Computer Science - Artificial Intelligence ,Computer Science - Computer Vision and Pattern Recognition - Abstract
The rising prevalence of vision-threatening retinal diseases poses a significant burden on the global healthcare systems. Deep learning (DL) offers a promising solution for automatic disease screening but demands substantial data. Collecting and labeling large volumes of ophthalmic images across various modalities encounters several real-world challenges, especially for rare diseases. Here, we introduce EyeDiff, a text-to-image model designed to generate multimodal ophthalmic images from natural language prompts and evaluate its applicability in diagnosing common and rare diseases. EyeDiff is trained on eight large-scale datasets using the advanced latent diffusion model, covering 14 ophthalmic image modalities and over 80 ocular diseases, and is adapted to ten multi-country external datasets. The generated images accurately capture essential lesional characteristics, achieving high alignment with text prompts as evaluated by objective metrics and human experts. Furthermore, integrating generated images significantly enhances the accuracy of detecting minority classes and rare eye diseases, surpassing traditional oversampling methods in addressing data imbalance. EyeDiff effectively tackles the issue of data imbalance and insufficiency typically encountered in rare diseases and addresses the challenges of collecting large-scale annotated images, offering a transformative solution to enhance the development of expert-level diseases diagnosis models in ophthalmic field., Comment: 28 pages, 2 figures
- Published
- 2024
16. MagicQuill: An Intelligent Interactive Image Editing System
- Author
-
Liu, Zichen, Yu, Yue, Ouyang, Hao, Wang, Qiuyu, Cheng, Ka Leong, Wang, Wen, Liu, Zhiheng, Chen, Qifeng, and Shen, Yujun
- Subjects
Computer Science - Computer Vision and Pattern Recognition - Abstract
Image editing involves a variety of complex tasks and requires efficient and precise manipulation techniques. In this paper, we present MagicQuill, an integrated image editing system that enables swift actualization of creative ideas. Our system features a streamlined yet functionally robust interface, allowing for the articulation of editing operations (e.g., inserting elements, erasing objects, altering color) with minimal input. These interactions are monitored by a multimodal large language model (MLLM) to anticipate editing intentions in real time, bypassing the need for explicit prompt entry. Finally, we apply a powerful diffusion prior, enhanced by a carefully learned two-branch plug-in module, to process editing requests with precise control. Experimental results demonstrate the effectiveness of MagicQuill in achieving high-quality image edits. Please visit https://magic-quill.github.io to try out our system., Comment: Code and demo available at https://magic-quill.github.io
- Published
- 2024
17. An Adaptive Open-Source Dataset Generation Framework for Machine Learning Tasks in Logic Synthesis
- Author
-
Ni, Liwei, Wang, Rui, Liu, Miao, Meng, Xingyu, Lin, Xiaoze, Liu, Junfeng, Luo, Guojie, Chu, Zhufei, Qian, Weikang, Yang, Xiaoyan, Xie, Biwei, Li, Xingquan, and Li, Huawei
- Subjects
Computer Science - Artificial Intelligence - Abstract
This paper introduces an adaptive logic synthesis dataset generation framework designed to enhance machine learning applications within the logic synthesis process. Unlike previous dataset generation flows that were tailored for specific tasks or lacked integrated machine learning capabilities, the proposed framework supports a comprehensive range of machine learning tasks by encapsulating the three fundamental steps of logic synthesis: Boolean representation, logic optimization, and technology mapping. It preserves the original information in the intermediate files that can be stored in both Verilog and Graphmal format. Verilog files enable semi-customizability, allowing researchers to add steps and incrementally refine the generated dataset. The framework also includes an adaptive circuit engine to facilitate the loading of GraphML files for final dataset packaging and sub-dataset extraction. The generated OpenLS-D dataset comprises 46 combinational designs from established benchmarks, totaling over 966,000 Boolean circuits, with each design containing 21,000 circuits generated from 1000 synthesis recipes, including 7000 Boolean networks, 7000 ASIC netlists, and 7000 FPGA netlists. Furthermore, OpenLS-D supports integrating newly desired data features, making it more versatile for new challenges. The utility of OpenLS-D is demonstrated through four distinct downstream tasks: circuit classification, circuit ranking, quality of results (QoR) prediction, and probability prediction. Each task highlights different internal steps of logic synthesis, with the datasets extracted and relabeled from the OpenLS-D dataset using the circuit engine. The experimental results confirm the dataset's diversity and extensive applicability. The source code and datasets are available at https://github.com/Logic-Factory/ACE/blob/master/OpenLS-D/readme.md., Comment: 14 pages
- Published
- 2024
18. DarkSHINE Baseline Design Report: Physics Prospects and Detector Technologies
- Author
-
Chen, Jing, Chen, Ji-Yuan, Chen, Jun-Feng, Chen, Xiang, Fu, Chang-Bo, Guo, Jun, Guo, Yi-Han, Khaw, Kim Siang, Li, Jia-Lin, Li, Liang, Li, Shu, Lin, Yu-ming, Liu, Dan-Ning, Liu, Kang, Liu, Kun, Liu, Qi-Bin, Liu, Zhi, Lu, Ze-Jia, Lv, Meng, Song, Si-Yuan, Sun, Tong, Tang, Jian-Nan, Wan, Wei-Shi, Wang, Dong, Wang, Xiao-Long, Wang, Yu-Feng, Wang, Zhen, Wang, Zi-Rui, Wu, Wei-Hao, Yang, Hai-Jun, Yang, Lin, Yang, Yong, Yu, Dian, Yuan, Rui, Zhang, Jun-Hua, Zhang, Yu-Lei, Zhang, Yun-Long, Zhao, Zhi-Yu, Zhou, Bai-Hong, Zhu, Chun-Xiang, Zhu, Xu-Liang, and Zhu, Yi-Fan
- Subjects
Physics - Instrumentation and Detectors ,High Energy Physics - Experiment - Abstract
DarkSHINE is a newly proposed fixed-target experiment initiative to search for the invisible decay of Dark Photon via missing energy/momentum signatures, based on the high repetition rate electron beam to be deployed/delivered by the Shanghai High repetition rate XFEL and Extreme light facility (SHINE). This report elaborates the baseline design of DarkSHINE experiment by introducing the physics goals, experimental setups, details of each sub-detector system technical designs, signal and backgground modelings, expected search sensitivities and future prospects, which mark an important step towards the further prototyping and technical demonstrations.
- Published
- 2024
19. Measurement of $\phi(1020)$ meson production in fixed-target $\textit{p}$Ne collisions at $\sqrt{s_{NN}}$ = 68.5 GeV
- Author
-
LHCb collaboration, Aaij, R., Abdelmotteleb, A. S. W., Beteta, C. Abellan, Abudinén, F., Ackernley, T., Adefisoye, A. A., Adeva, B., Adinolfi, M., Adlarson, P., Agapopoulou, C., Aidala, C. A., Ajaltouni, Z., Akar, S., Akiba, K., Albicocco, P., Albrecht, J., Alessio, F., Alexander, M., Aliouche, Z., Cartelle, P. Alvarez, Amalric, R., Amato, S., Amey, J. L., Amhis, Y., An, L., Anderlini, L., Andersson, M., Andreianov, A., Andreola, P., Andreotti, M., Andreou, D., Anelli, A., Ao, D., Archilli, F., Argenton, M., Cuendis, S. Arguedas, Artamonov, A., Artuso, M., Aslanides, E., Da Silva, R. Ataíde, Atzeni, M., Audurier, B., Bacher, D., Perea, I. Bachiller, Bachmann, S., Bachmayer, M., Back, J. J., Rodriguez, P. Baladron, Balagura, V., Balboni, A., Baldini, W., Balzani, L., Bao, H., Leite, J. Baptista de Souza, Pretel, C. Barbero, Barbetti, M., Barbosa, I. R., Barlow, R. J., Barnyakov, M., Barsuk, S., Barter, W., Bartolini, M., Bartz, J., Basels, J. M., Bashir, S., Bassi, G., Batsukh, B., Battista, P. B., Bay, A., Beck, A., Becker, M., Bedeschi, F., Bediaga, I. B., Behling, N. A., Belin, S., Belous, K., Belov, I., Belyaev, I., Benane, G., Bencivenni, G., Ben-Haim, E., Berezhnoy, A., Bernet, R., Andres, S. Bernet, Bertolin, A., Betancourt, C., Betti, F., Bex, J., Bezshyiko, Ia., Bhom, J., Bieker, M. S., Biesuz, N. V., Billoir, P., Biolchini, A., Birch, M., Bishop, F. C. R., Bitadze, A., Bizzeti, A., Blake, T., Blanc, F., Blank, J. E., Blusk, S., Bocharnikov, V., Boelhauve, J. A., Garcia, O. Boente, Boettcher, T., Bohare, A., Boldyrev, A., Bolognani, C. S., Bolzonella, R., Bonacci, R. B., Bondar, N., Bordelius, A., Borgato, F., Borghi, S., Borsato, M., Borsuk, J. T., Bouchiba, S. A., Bovill, M., Bowcock, T. J. V., Boyer, A., Bozzi, C., Rodriguez, A. Brea, Breer, N., Brodzicka, J., Gonzalo, A. Brossa, Brown, J., Brundu, D., Buchanan, E., Buonaura, A., Buonincontri, L., Burke, A. T., Burr, C., Butter, J. S., Buytaert, J., Byczynski, W., Cadeddu, S., Cai, H., Caillet, A. C., Calabrese, R., Ramirez, S. Calderon, Calefice, L., Cali, S., Calvi, M., Gomez, M. Calvo, Magalhaes, P. Camargo, Bouzas, J. I. Cambon, Campana, P., Perez, D. H. Campora, Quezada, A. F. Campoverde, Capelli, S., Capriotti, L., Caravaca-Mora, R., Carbone, A., Salgado, L. Carcedo, Cardinale, R., Cardini, A., Carniti, P., Carus, L., Vidal, A. Casais, Caspary, R., Casse, G., Cattaneo, M., Cavallero, G., Cavallini, V., Celani, S., Cervenkov, D., Cesare, S., Chadwick, A. J., Chahrour, I., Charles, M., Charpentier, Ph., Chatzianagnostou, E., Chefdeville, M., Chen, C., Chen, S., Chen, Z., Chernov, A., Chernyshenko, S., Chiotopoulos, X., Chobanova, V., Cholak, S., Chrzaszcz, M., Chubykin, A., Chulikov, V., Ciambrone, P., Vidal, X. Cid, Ciezarek, G., Cifra, P., Clarke, P. E. L., Clemencic, M., Cliff, H. V., Closier, J., Toapaxi, C. Cocha, Coco, V., Cogan, J., Cogneras, E., Cojocariu, L., Collaviti, S., Collins, P., Colombo, T., Colonna, M. C., Comerma-Montells, A., Congedo, L., Contu, A., Cooke, N., Corredoira, I., Correia, A., Corti, G., Meldrum, J. J. Cottee, Couturier, B., Craik, D. C., Torres, M. Cruz, Rivera, E. Curras, Currie, R., Da Silva, C. L., Dadabaev, S., Dai, L., Dai, X., Dall'Occo, E., Dalseno, J., D'Ambrosio, C., Daniel, J., Danilina, A., d'Argent, P., Darze, G., Davidson, A., Davies, J. E., Davis, A., Francisco, O. De Aguiar, De Angelis, C., De Benedetti, F., de Boer, J., De Bruyn, K., De Capua, S., De Cian, M., Da Graca, U. De Freitas Carneiro, De Lucia, E., De Miranda, J. M., De Paula, L., De Serio, M., De Simone, P., De Vellis, F., de Vries, J. A., Debernardis, F., Decamp, D., Dedu, V., Dekkers, S., Del Buono, L., Delaney, B., Dembinski, H. -P., Deng, J., Denysenko, V., Deschamps, O., Dettori, F., Dey, B., Di Nezza, P., Diachkov, I., Didenko, S., Ding, S., Dittmann, L., Dobishuk, V., Docheva, A. D., Dong, C., Donohoe, A. M., Dordei, F., Reis, A. C. dos, Dowling, A. D., Duan, W., Duda, P., Dudek, M. W., Dufour, L., Duk, V., Durante, P., Duras, M. M., Durham, J. M., Durmus, O. D., Dziurda, A., Dzyuba, A., Easo, S., Eckstein, E., Egede, U., Egorychev, A., Egorychev, V., Eisenhardt, S., Ejopu, E., Eklund, L., Elashri, M., Ellbracht, J., Ely, S., Ene, A., Eschle, J., Esen, S., Evans, T., Fabiano, F., Falcao, L. N., Fan, Y., Fang, B., Fantini, L., Faria, M., Farmer, K., Fazzini, D., Felkowski, L., Feng, M., Feo, M., Casani, A. Fernandez, Gomez, M. Fernandez, Fernez, A. D., Ferrari, F., Rodrigues, F. Ferreira, Ferrillo, M., Ferro-Luzzi, M., Filippov, S., Fini, R. A., Fiorini, M., Firlej, M., Fischer, K. L., Fitzgerald, D. S., Fitzpatrick, C., Fiutowski, T., Fleuret, F., Fontana, M., Foreman, L. F., Forty, R., Foulds-Holt, D., Lima, V. Franco, Sevilla, M. Franco, Frank, M., Franzoso, E., Frau, G., Frei, C., Friday, D. A., Fu, J., Führing, Q., Fujii, Y., Fulghesu, T., Gabriel, E., Galati, G., Galati, M. D., Torreira, A. Gallas, Galli, D., Gambetta, S., Gandelman, M., Gandini, P., Ganie, B., Gao, H., Gao, R., Gao, T. Q., Gao, Y., Martin, L. M. Garcia, Moreno, P. Garcia, Pardiñas, J. García, Gardner, P., Garg, K. G., Garrido, L., Gaspar, C., Geertsema, R. E., Gerken, L. L., Gersabeck, E., Gersabeck, M., Gershon, T., Ghizzo, S., Ghorbanimoghaddam, Z., Giambastiani, L., Giasemis, F. I., Gibson, V., Giemza, H. K., Gilman, A. L., Giovannetti, M., Gioventù, A., Girardey, L., Gironell, P. Gironella, Giugliano, C., Giza, M. A., Gkougkousis, E. L., Glaser, F. C., Gligorov, V. V., Göbel, C., Golobardes, E., Golubkov, D., Golutvin, A., Fernandez, S. Gomez, Gomulka, W., Abrantes, F. Goncalves, Goncerz, M., Gong, G., Gooding, J. A., Gorelov, I. V., Gotti, C., Grabowski, J. P., Cardoso, L. A. Granado, Graugés, E., Graverini, E., Grazette, L., Graziani, G., Grecu, A. T., Greeven, L. M., Grieser, N. A., Grillo, L., Gromov, S., Gu, C., Guarise, M., Guerry, L., Guittiere, M., Guliaeva, V., Günther, P. A., Guseinov, A. -K., Gushchin, E., Guz, Y., Gys, T., Habermann, K., Hadavizadeh, T., Hadjivasiliou, C., Haefeli, G., Haen, C., Hajheidari, M., Hallett, G., Halvorsen, M. M., Hamilton, P. M., Hammerich, J., Han, Q., Han, X., Hansmann-Menzemer, S., Hao, L., Harnew, N., Harris, T. H., Hartmann, M., Hashmi, S., He, J., Hemmer, F., Henderson, C., Henderson, R. D. L., Hennequin, A. M., Hennessy, K., Henry, L., Herd, J., Gascon, P. Herrero, Heuel, J., Hicheur, A., Mendizabal, G. Hijano, Horswill, J., Hou, R., Hou, Y., Howarth, N., Hu, J., Hu, W., Hu, X., Huang, W., Hulsbergen, W., Hunter, R. J., Hushchyn, M., Hutchcroft, D., Idzik, M., Ilin, D., Ilten, P., Inglessi, A., Iniukhin, A., Ishteev, A., Ivshin, K., Jacobsson, R., Jage, H., Elles, S. J. Jaimes, Jakobsen, S., Jans, E., Jashal, B. K., Jawahery, A., Jevtic, V., Jiang, E., Jiang, X., Jiang, Y., Jiang, Y. J., John, M., Rajan, A. John Rubesh, Johnson, D., Jones, C. R., Jones, T. P., Joshi, S., Jost, B., Castella, J. Juan, Jurik, N., Juszczak, I., Kaminaris, D., Kandybei, S., Kane, M., Kang, Y., Kar, C., Karacson, M., Karpenkov, D., Kauniskangas, A., Kautz, J. W., Kazanecki, M. K., Keizer, F., Kenzie, M., Ketel, T., Khanji, B., Kharisova, A., Kholodenko, S., Khreich, G., Kirn, T., Kirsebom, V. S., Kitouni, O., Klaver, S., Kleijne, N., Klimaszewski, K., Kmiec, M. R., Koliiev, S., Kolk, L., Konoplyannikov, A., Kopciewicz, P., Koppenburg, P., Korolev, M., Kostiuk, I., Kot, O., Kotriakhova, S., Kozachuk, A., Kravchenko, P., Kravchuk, L., Kreps, M., Krokovny, P., Krupa, W., Krzemien, W., Kshyvanskyi, O., Kubis, S., Kucharczyk, M., Kudryavtsev, V., Kulikova, E., Kupsc, A., Kutsenko, B. K., Lacarrere, D., Gonzalez, P. Laguarta, Lai, A., Lampis, A., Lancierini, D., Gomez, C. Landesa, Lane, J. J., Lane, R., Lanfranchi, G., Langenbruch, C., Langer, J., Lantwin, O., Latham, T., Lazzari, F., Lazzeroni, C., Gac, R. Le, Lee, H., Lefèvre, R., Leflat, A., Legotin, S., Lehuraux, M., Cid, E. Lemos, Leroy, O., Lesiak, T., Lesser, E. D., Leverington, B., Li, A., Li, C., Li, H., Li, K., Li, L., Li, M., Li, P., Li, P. -R., Li, Q., Li, S., Li, T., Li, Y., Lian, Z., Liang, X., Libralon, S., Lin, C., Lin, T., Lindner, R., Linton, H., Lisovskyi, V., Litvinov, R., Liu, F. L., Liu, G., Liu, K., Liu, S., Liu, W., Liu, Y., Liu, Y. L., Salvia, A. Lobo, Loi, A., Long, T., Lopes, J. H., Huertas, A. Lopez, Soliño, S. López, Lu, Q., Lucarelli, C., Lucchesi, D., Martinez, M. Lucio, Lukashenko, V., Luo, Y., Lupato, A., Luppi, E., Lynch, K., Lyu, X. -R., Ma, G. M., Maccolini, S., Machefert, F., Maciuc, F., Mack, B., Mackay, I., Mackey, L. M., Mohan, L. R. Madhan, Madurai, M. J., Maevskiy, A., Magdalinski, D., Maisuzenko, D., Majewski, M. W., Malczewski, J. J., Malde, S., Malentacca, L., Malinin, A., Maltsev, T., Manca, G., Mancinelli, G., Mancuso, C., Escalero, R. Manera, Manganella, F. M., Manuzzi, D., Marangotto, D., Marchand, J. F., Marchevski, R., Marconi, U., Mariani, E., Mariani, S., Benito, C. Marin, Marks, J., Marshall, A. M., Martel, L., Martelli, G., Martellotti, G., Martinazzoli, L., Martinelli, M., Gomez, D. Martinez, Santos, D. Martinez, Vidal, F. Martinez, Granollers, A. Martorell i, Massafferri, A., Matev, R., Mathad, A., Matiunin, V., Matteuzzi, C., Mattioli, K. R., Mauri, A., Maurice, E., Mauricio, J., Mayencourt, P., de Cos, J. Mazorra, Mazurek, M., McCann, M., Mcconnell, L., McGrath, T. H., McHugh, N. T., McNab, A., McNulty, R., Meadows, B., Meier, G., Melnychuk, D., Meng, F. M., Merk, M., Merli, A., Garcia, L. Meyer, Miao, D., Miao, H., Mikhasenko, M., Milanes, D. A., Minotti, A., Minucci, E., Miralles, T., Mitreska, B., Mitzel, D. S., Modak, A., Mohammed, R. A., Moise, R. D., Mokhnenko, S., Cardenas, E. F. Molina, Mombächer, T., Monk, M., Monteil, S., Gomez, A. Morcillo, Morello, G., Morello, M. J., Morgenthaler, M. P., Moron, J., Morren, W., Morris, A. B., Morris, A. G., Mountain, R., Mu, H., Mu, Z. M., Muhammad, E., Muheim, F., Mulder, M., Müller, K., Muñoz-Rojas, F., Murta, R., Naik, P., Nakada, T., Nandakumar, R., Nanut, T., Nasteva, I., Needham, M., Neri, N., Neubert, S., Neufeld, N., Neustroev, P., Nicolini, J., Nicotra, D., Niel, E. M., Nikitin, N., Niu, Q., Nogarolli, P., Nogga, P., Normand, C., Fernandez, J. Novoa, Nowak, G., Nunez, C., Nur, H. N., Oblakowska-Mucha, A., Obraztsov, V., Oeser, T., Okamura, S., Okhotnikov, A., Okhrimenko, O., Oldeman, R., Oliva, F., Olocco, M., Onderwater, C. J. G., O'Neil, R. H., Osthues, D., Goicochea, J. M. Otalora, Owen, P., Oyanguren, A., Ozcelik, O., Paciolla, F., Padee, A., Padeken, K. O., Pagare, B., Pais, P. R., Pajero, T., Palano, A., Palutan, M., Pan, X., Panshin, G., Paolucci, L., Papanestis, A., Pappagallo, M., Pappalardo, L. L., Pappenheimer, C., Parkes, C., Parmar, D., Passalacqua, B., Passaleva, G., Passaro, D., Pastore, A., Patel, M., Patoc, J., Patrignani, C., Paul, A., Pawley, C. J., Pellegrino, A., Peng, J., Altarelli, M. Pepe, Perazzini, S., Pereima, D., Da Costa, H. Pereira, Castro, A. Pereiro, Perret, P., Perrevoort, A., Perro, A., Peters, M. J., Petridis, K., Petrolini, A., Pfaller, J. P., Pham, H., Pica, L., Piccini, M., Piccolo, L., Pietrzyk, B., Pietrzyk, G., Pinci, D., Pisani, F., Pizzichemi, M., Placinta, V., Casasus, M. Plo, Poeschl, T., Polci, F., Lener, M. Poli, Poluektov, A., Polukhina, N., Polyakov, I., Polycarpo, E., Ponce, S., Popov, D., Poslavskii, S., Prasanth, K., Prouve, C., Provenzano, D., Pugatch, V., Punzi, G., Qasim, S., Qian, Q. Q., Qian, W., Qin, N., Qu, S., Quagliani, R., Trejo, R. I. Rabadan, Rademacker, J. H., Rama, M., García, M. Ramírez, De Oliveira, V. Ramos, Pernas, M. Ramos, Rangel, M. S., Ratnikov, F., Raven, G., De Miguel, M. Rebollo, Redi, F., Reich, J., Reiss, F., Ren, Z., Resmi, P. K., Ribatti, R., Ricart, G. R., Riccardi, D., Ricciardi, S., Richardson, K., Richardson-Slipper, M., Rinnert, K., Robbe, P., Robertson, G., Rodrigues, E., Alvarez, A. Rodriguez, Fernandez, E. Rodriguez, Lopez, J. A. Rodriguez, Rodriguez, E. Rodriguez, Roensch, J., Rogachev, A., Rogovskiy, A., Rolf, D. L., Roloff, P., Romanovskiy, V., Vidal, A. Romero, Romolini, G., Ronchetti, F., Rong, T., Rotondo, M., Roy, S. R., Rudolph, M. S., Diaz, M. Ruiz, Fernandez, R. A. Ruiz, Vidal, J. Ruiz, Ryzhikov, A., Ryzka, J., Saavedra-Arias, J. J., Silva, J. J. Saborido, Sadek, R., Sagidova, N., Sahoo, D., Sahoo, N., Saitta, B., Salomoni, M., Sanderswood, I., Santacesaria, R., Rios, C. Santamarina, Santimaria, M., Santoro, L., Santovetti, E., Saputi, A., Saranin, D., Sarnatskiy, A., Sarpis, G., Sarpis, M., Satriano, C., Satta, A., Saur, M., Savrina, D., Sazak, H., Sborzacchi, F., Smead, L. G. Scantlebury, Scarabotto, A., Schael, S., Scherl, S., Schiller, M., Schindler, H., Schmelling, M., Schmidt, B., Schmitt, S., Schmitz, H., Schneider, O., Schopper, A., Schulte, N., Schulte, S., Schune, M. H., Schwemmer, R., Schwering, G., Sciascia, B., Sciuccati, A., Segal, I., Sellam, S., Semennikov, A., Senger, T., Soares, M. Senghi, Sergi, A., Serra, N., Sestini, L., Seuthe, A., Shang, Y., Shangase, D. M., Shapkin, M., Sharma, R. S., Shchemerov, I., Shchutska, L., Shears, T., Shekhtman, L., Shen, Z., Sheng, S., Shevchenko, V., Shi, B., Shi, Q., Shimizu, Y., Shmanin, E., Shorkin, R., Shupperd, J. D., Coutinho, R. Silva, Simi, G., Simone, S., Skidmore, N., Skwarnicki, T., Slater, M. W., Smallwood, J. C., Smith, E., Smith, K., Smith, M., Snoch, A., Lavra, L. Soares, Sokoloff, M. D., Soler, F. J. P., Solomin, A., Solovev, A., Solovyev, I., Sommerfeld, N. S., Song, R., Song, Y., Song, Y. S., De Almeida, F. L. Souza, De Paula, B. Souza, Norella, E. Spadaro, Spedicato, E., Speer, J. G., Spiridenkov, E., Spradlin, P., Sriskaran, V., Stagni, F., Stahl, M., Stahl, S., Stanislaus, S., Stein, E. N., Steinkamp, O., Stenyakin, O., Stevens, H., Strekalina, D., Su, Y., Suljik, F., Sun, J., Sun, L., Sundfeld, D., Sutcliffe, W., Swallow, P. N., Swientek, K., Swystun, F., Szabelski, A., Szumlak, T., Tan, Y., Tang, Y., Tat, M. D., Terentev, A., Terzuoli, F., Teubert, F., Thomas, E., Thompson, D. J. D., Tilquin, H., Tisserand, V., T'Jampens, S., Tobin, M., Tomassetti, L., Tonani, G., Tong, X., Machado, D. Torres, Toscano, L., Tou, D. Y., Trippl, C., Tuci, G., Tuning, N., Uecker, L. H., Ukleja, A., Unverzagt, D. J., Urbach, B., Ursov, E., Usachov, A., Ustyuzhanin, A., Uwer, U., Vagnoni, V., Cadenas, V. Valcarce, Valenti, G., Canudas, N. Valls, Van Hecke, H., van Herwijnen, E., Van Hulse, C. B., Van Laak, R., van Veghel, M., Vasquez, G., Gomez, R. Vazquez, Regueiro, P. Vazquez, Sierra, C. Vázquez, Vecchi, S., Velthuis, J. J., Veltri, M., Venkateswaran, A., Verdoglia, M., Vesterinen, M., Benet, D. Vico, Villalba, P. Vidrier, Diaz, M. Vieites, Vilasis-Cardona, X., Figueras, E. Vilella, Villa, A., Vincent, P., Volle, F. C., Bruch, D. vom, Voropaev, N., Vos, K., Vrahas, C., Wagner, J., Walsh, J., Walton, E. J., Wan, G., Wang, C., Wang, G., Wang, H., Wang, J., Wang, M., Wang, N. W., Wang, R., Wang, X., Wang, X. W., Wang, Y., Wang, Y. W., Wang, Z., Ward, J. A., Waterlaat, M., Watson, N. K., Websdale, D., Wei, Y., Wendel, J., Westhenry, B. D. C., White, C., Whitehead, M., Whiter, E., Wiederhold, A. R., Wiedner, D., Wilkinson, G., Wilkinson, M. K., Williams, M., Williams, M. J., Williams, M. R. J., Williams, R., Williams, Z., Wilson, F. F., Winn, M., Wislicki, W., Witek, M., Witola, L., Wormser, G., Wotton, S. A., Wu, H., Wu, J., Wu, X., Wu, Y., Wu, Z., Wyllie, K., Xian, S., Xiang, Z., Xie, Y., Xu, A., Xu, J., Xu, L., Xu, M., Xu, Z., Yang, K., Yang, S., Yang, X., Yang, Y., Yang, Z., Yeroshenko, V., Yeung, H., Yin, H., Yin, X., Yu, C. Y., Yu, J., Yuan, X., Yuan, Y, Zaffaroni, E., Zavertyaev, M., Zdybal, M., Zenesini, F., Zeng, C., Zeng, M., Zhang, C., Zhang, D., Zhang, J., Zhang, L., Zhang, S., Zhang, Y., Zhang, Y. Z., Zhao, Y., Zharkova, A., Zhelezov, A., Zheng, S. Z., Zheng, X. Z., Zheng, Y., Zhou, T., Zhou, X., Zhou, Y., Zhovkovska, V., Zhu, L. Z., Zhu, X., Zhukov, V., Zhuo, J., Zou, Q., Zuliani, D., and Zunica, G.
- Subjects
High Energy Physics - Experiment ,Nuclear Experiment - Abstract
The first measurement of $\phi(1020)$ meson production in fixed-target $p$Ne collisions at $\sqrt{s_{NN}}=68.5$ GeV is presented. The $\phi(1020)$ mesons are reconstructed in their $K^{+}K^{-}$ decay in a data sample consisting of proton collisions on neon nuclei at rest, corresponding to an integrated luminosity of $21.7 \pm 1.4$ nb$^{-1}$, collected by the LHCb detector at CERN. The $\phi(1020)$ production cross-section in the centre-of-mass rapidity range of $-1.8
- Published
- 2024
20. StreamAdapter: Efficient Test Time Adaptation from Contextual Streams
- Author
-
Muhtar, Dilxat, Shen, Yelong, Yang, Yaming, Liu, Xiaodong, Lu, Yadong, Liu, Jianfeng, Zhan, Yuefeng, Sun, Hao, Deng, Weiwei, Sun, Feng, Zhang, Xueliang, Gao, Jianfeng, Chen, Weizhu, and Zhang, Qi
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence - Abstract
In-context learning (ICL) allows large language models (LLMs) to adapt to new tasks directly from the given demonstrations without requiring gradient updates. While recent advances have expanded context windows to accommodate more demonstrations, this approach increases inference costs without necessarily improving performance. To mitigate these issues, We propose StreamAdapter, a novel approach that directly updates model parameters from context at test time, eliminating the need for explicit in-context demonstrations. StreamAdapter employs context mapping and weight absorption mechanisms to dynamically transform ICL demonstrations into parameter updates with minimal additional parameters. By reducing reliance on numerous in-context examples, StreamAdapter significantly reduce inference costs and allows for efficient inference with constant time complexity, regardless of demonstration count. Extensive experiments across diverse tasks and model architectures demonstrate that StreamAdapter achieves comparable or superior adaptation capability to ICL while requiring significantly fewer demonstrations. The superior task adaptation and context encoding capabilities of StreamAdapter on both language understanding and generation tasks provides a new perspective for adapting LLMs at test time using context, allowing for more efficient adaptation across scenarios and more cost-effective inference, Comment: 22 Pages, 9 Figures
- Published
- 2024
21. A Multi-Label EEG Dataset for Mental Attention State Classification in Online Learning
- Author
-
Liu, Huan, Zhang, Yuzhe, Liu, Guanjian, Du, Xinxin, Wang, Haochong, and Zhang, Dalin
- Subjects
Computer Science - Human-Computer Interaction - Abstract
Attention is a vital cognitive process in the learning and memory environment, particularly in the context of online learning. Traditional methods for classifying attention states of online learners based on behavioral signals are prone to distortion, leading to increased interest in using electroencephalography (EEG) signals for authentic and accurate assessment. However, the field of attention state classification based on EEG signals in online learning faces challenges, including the scarcity of publicly available datasets, the lack of standardized data collection paradigms, and the requirement to consider the interplay between attention and other psychological states. In light of this, we present the Multi-label EEG dataset for classifying Mental Attention states (MEMA) in online learning. We meticulously designed a reliable and standard experimental paradigm with three attention states: neutral, relaxing, and concentrating, considering human physiological and psychological characteristics. This paradigm collected EEG signals from 20 subjects, each participating in 12 trials, resulting in 1,060 minutes of data. Emotional state labels, basic personal information, and personality traits were also collected to investigate the relationship between attention and other psychological states. Extensive quantitative and qualitative analysis, including a multi-label correlation study, validated the quality of the EEG attention data. The MEMA dataset and analysis provide valuable insights for advancing research on attention in online learning. The dataset is publicly available at \url{https://github.com/GuanjianLiu/MEMA}.
- Published
- 2024
22. InterFormer: Towards Effective Heterogeneous Interaction Learning for Click-Through Rate Prediction
- Author
-
Zeng, Zhichen, Liu, Xiaolong, Hang, Mengyue, Liu, Xiaoyi, Zhou, Qinghai, Yang, Chaofei, Liu, Yiqun, Ruan, Yichen, Chen, Laming, Chen, Yuxin, Hao, Yujia, Xu, Jiaqi, Nie, Jade, Liu, Xi, Zhang, Buyun, Wen, Wei, Yuan, Siyang, Wang, Kai, Chen, Wen-Yen, Han, Yiping, Li, Huayu, Yang, Chunzhi, Long, Bo, Yu, Philip S., Tong, Hanghang, and Yang, Jiyan
- Subjects
Computer Science - Information Retrieval ,Computer Science - Artificial Intelligence ,Computer Science - Machine Learning - Abstract
Click-through rate (CTR) prediction, which predicts the probability of a user clicking an ad, is a fundamental task in recommender systems. The emergence of heterogeneous information, such as user profile and behavior sequences, depicts user interests from different aspects. A mutually beneficial integration of heterogeneous information is the cornerstone towards the success of CTR prediction. However, most of the existing methods suffer from two fundamental limitations, including (1) insufficient inter-mode interaction due to the unidirectional information flow between modes, and (2) aggressive information aggregation caused by early summarization, resulting in excessive information loss. To address the above limitations, we propose a novel module named InterFormer to learn heterogeneous information interaction in an interleaving style. To achieve better interaction learning, InterFormer enables bidirectional information flow for mutually beneficial learning across different modes. To avoid aggressive information aggregation, we retain complete information in each data mode and use a separate bridging arch for effective information selection and summarization. Our proposed InterFormer achieves state-of-the-art performance on three public datasets and a large-scale industrial dataset., Comment: 10 pages, 6 figures
- Published
- 2024
23. AEAKA: An Adaptive and Efficient Authentication and Key Agreement Scheme for IoT in Cloud-Edge-Device Collaborative Environments
- Author
-
Liu, Kexian, Guan, Jianfeng, Hu, Xiaolong, Zhang, Jing, Liu, Jianli, and Zhang, Hongke
- Subjects
Computer Science - Cryptography and Security - Abstract
To meet the diverse needs of users, the rapid advancement of cloud-edge-device collaboration has become a standard practice. However, this complex environment, particularly in untrusted (non-collaborative) scenarios, presents numerous security challenges. Authentication acts as the first line of defense and is fundamental to addressing these issues. Although many authentication and key agreement schemes exist, they often face limitations, such as being tailored to overly specific scenarios where devices authenticate solely with either the edge or the cloud, or being unsuitable for resource-constrained devices. To address these challenges, we propose an adaptive and efficient authentication and key agreement scheme (AEAKA) for Cloud-Edge-Device IoT environments. This scheme is highly adaptive and scalable, capable of automatically and dynamically initiating different authentication methods based on device requirements. Additionally, it employs an edge-assisted authentication approach to reduce the load on third-party trust authorities. Furthermore, we introduce a hash-based algorithm for the authentication protocol, ensuring a lightweight method suitable for a wide range of resource-constrained devices while maintaining security. AEAKA ensures that entities use associated authentication credentials, enhancing the privacy of the authentication process. Security proofs and performance analyses demonstrate that AEAKA outperforms other methods in terms of security and authentication efficiency., Comment: 17 pages,14 figures,submitted to Transactions on Dependable and Secure Computing in 30-May-2024
- Published
- 2024
24. Efficient and Secure Cross-Domain Data-Sharing for Resource-Constrained Internet of Things
- Author
-
Liu, Kexian, Guan, Jianfeng, Hu, Xiaolong, Liu, Jianli, and Zhang, Hongke
- Subjects
Computer Science - Cryptography and Security - Abstract
The growing complexity of Internet of Things (IoT) environments, particularly in cross-domain data sharing, presents significant security challenges. Existing data-sharing schemes often rely on computationally expensive cryptographic operations and centralized key management, limiting their effectiveness for resource-constrained devices. To address these issues, we propose an efficient, secure blockchain-based data-sharing scheme. First, our scheme adopts a distributed key generation method, which avoids single point of failure. This method also allows independent pseudonym generation and key updates, enhancing authentication flexibility while reducing computational overhead. Additionally, the scheme provides a complete data-sharing process, covering data uploading, storage, and sharing, while ensuring data traceability, integrity, and privacy. Security analysis shows that the proposed scheme is theoretically secure and resistant to various attacks, while performance evaluations demonstrate lower computational and communication overhead compared to existing solutions, making it both secure and efficient for IoT applications., Comment: 15 pages,10 figures, submitted to Transactions on Information Forensics & Security in 19-Sep-2024
- Published
- 2024
25. ALMA Survey of Orion Planck Galactic Cold Clumps (ALMASOP): Nested Morphological and Kinematic Structures of Outflows Revealed in SiO and CO Emission
- Author
-
Liu, Chun-Fan, Shang, Hsien, Johnstone, Doug, Ai, Tsung-Han, Lee, Tsz Ming, Krasnopolsky, Ruben, Hirano, Naomi, Dutta, Somnath, Hsu, Shih-Ying, López-Vázquez, Jesús Alejandro, Liu, Sheng-Yuan, Liu, Tie, Tatematsu, Ken'ichi, Zhang, Qizhou, Rawlings, Mark G., Eden, David, Ren, Zhiyuan, Sanhueza, Patricio, Kwon, Woojin, Lee, Chang Won, Kuan, Yi-Jehng, Bandopadhyay, Somdeb, Väisälä, Miikka S., Lee, Chin-Fei, and Das, Indrani
- Subjects
Astrophysics - Solar and Stellar Astrophysics ,Astrophysics - Astrophysics of Galaxies - Abstract
The Atacama Large Millimeter/submillimeter Array Survey of Orion Planck Galactic Cold Clumps (ALMASOP) reveals complex nested morphological and kinematic features of molecular outflows through the CO (J = 2 - 1) and SiO (J = 5 - 4) emission. We characterize the jet and outflow kinematics of the ALMASOP sample in four representative sources (HOPS 10, 315, 358, and G203.21-11.20W2) through channel maps and position-velocity diagrams (PVDs) parallel and transverse to the outflow axes. The combined CO and SiO emission exhibits the coexistence of the conventional extremely-high-velocity (EHV) jets and shell-like low-velocity (LV) cavity walls and new features. More complex, nested bubble-like and filamentary structures in the images and channel maps, triangle-shaped regions near the base of the parallel PVDs, and regions composed of rhombus/oval shapes in the transverse PVDs, are also evident. Such features find natural explanations within the bubble structure of the unified model of jet, wind, and ambient medium. The reverse shock cavity is revealed on the PVD base regions, and other features naturally arise within the dynamic postshock region of magnetic interaction. The finer nested shells observed within the compressed wind region reveal previously unnoticed shocked emission between the jet and the conventional large cavity walls. These pseudopulse-produced filamentary features connect to the jet-like knotty blobs, creating an impression of episodicity in mass ejection. SiO emission is enhanced downstream of the reverse shock boundary, with jet-like excitation conditions. Combined, these observed features reveal the extended structures induced by the magnetic interplay between a jet-bearing magnetized wide-angle wind and its ambient magnetized surrounding medium., Comment: 27 pages, 11 figures, accepted by ApJ
- Published
- 2024
26. UNSCT-HRNet: Modeling Anatomical Uncertainty for Landmark Detection in Total Hip Arthroplasty
- Author
-
Wan, Jiaxin, Liu, Lin, Wang, Haoran, Li, Liangwei, Li, Wei, Kou, Shuheng, Li, Runtian, Tang, Jiayi, Liu, Juanxiu, Zhang, Jing, Du, Xiaohui, and Hao, Ruqian
- Subjects
Electrical Engineering and Systems Science - Image and Video Processing ,Computer Science - Computer Vision and Pattern Recognition - Abstract
Total hip arthroplasty (THA) relies on accurate landmark detection from radiographic images, but unstructured data caused by irregular patient postures or occluded anatomical markers pose significant challenges for existing methods. To address this, we propose UNSCT-HRNet (Unstructured CT - High-Resolution Net), a deep learning-based framework that integrates a Spatial Relationship Fusion (SRF) module and an Uncertainty Estimation (UE) module. The SRF module, utilizing coordinate convolution and polarized attention, enhances the model's ability to capture complex spatial relationships. Meanwhile, the UE module which based on entropy ensures predictions are anatomically relevant. For unstructured data, the proposed method can predict landmarks without relying on the fixed number of points, which shows higher accuracy and better robustness comparing with the existing methods. Our UNSCT-HRNet demonstrates over a 60% improvement across multiple metrics in unstructured data. The experimental results also reveal that our approach maintains good performance on the structured dataset. Overall, the proposed UNSCT-HRNet has the potential to be used as a new reliable, automated solution for THA surgical planning and postoperative monitoring.
- Published
- 2024
27. LSH-MoE: Communication-efficient MoE Training via Locality-Sensitive Hashing
- Author
-
Nie, Xiaonan, Liu, Qibin, Fu, Fangcheng, Zhu, Shenhan, Miao, Xupeng, Li, Xiaoyang, Zhang, Yang, Liu, Shouda, and Cui, Bin
- Subjects
Computer Science - Distributed, Parallel, and Cluster Computing - Abstract
Larger transformer models always perform better on various tasks but require more costs to scale up the model size. To efficiently enlarge models, the mixture-of-experts (MoE) architecture is widely adopted, which consists of a gate network and a series of experts and keep the training cost constant by routing the input data to a fixed number of experts instead of all. In existing large-scale MoE training systems, experts would be distributed among different GPUs for parallelization, and thus input data requires additional all-to-all communications to access the target experts and conduct corresponding computations. However, upon evaluating the training process of three mainstream MoE models on commonly used GPU clusters, we found that the all-to-all communication ratio averaged around 45%, which significantly hinders the efficiency and scalability of training MoE models. In this paper, we propose LSH-MoE, a communication-efficient MoE training framework using locality-sensitive hashing (LSH). We first present the problems of scaling MoE training in existing systems and highlight the potential of exploiting token similarity to facilitate data compression. Then, we introduce an efficient LSH-based compression technique, which utilizes the cross-polytope hashing for rapid clustering and implements a residual-based error compensation scheme to alleviate the adverse impact of compression. To verify the effectiveness of our methods, we conduct experiments on both language models (e.g., RoBERTa, GPT, and T5) and vision models (e.g., Swin) for pre-training and fine-tuning tasks. The results demonstrate that our method substantially outperforms its counterparts across different tasks by 1.28x - 2.2x of speedup., Comment: Accepted by NeurIPS 2024
- Published
- 2024
28. Study of the light scalar $a_{0}(980)$ through the decay $D^{0} \to a_{0}(980)^-e^{+} \nu_{e}$ with $a_{0}(980)^- \to \eta \pi^-$
- Author
-
BESIII Collaboration, Ablikim, M., Achasov, M. N., Adlarson, P., Afedulidis, O., Ai, X. C., Aliberti, R., Amoroso, A., An, Q., Bai, Y., Bakina, O., Balossino, I., Ban, Y., Bao, H. -R., Batozskaya, V., Begzsuren, K., Berger, N., Berlowski, M., Bertani, M., Bettoni, D., Bianchi, F., Bianco, E., Bortone, A., Boyko, I., Briere, R. A., Brueggemann, A., Cai, H., Cai, X., Calcaterra, A., Cao, G. F., Cao, N., Cetin, S. A., Chai, X. Y., Chang, J. F., Che, G. R., Che, Y. Z., Chelkov, G., Chen, C., Chen, C. H., Chen, Chao, Chen, G., Chen, H. S., Chen, H. Y., Chen, M. L., Chen, S. J., Chen, S. L., Chen, S. M., Chen, T., Chen, X. R., Chen, X. T., Chen, Y. B., Chen, Y. Q., Chen, Z. J., Chen, Z. Y., Choi, S. K., Cibinetto, G., Cossio, F., Cui, J. J., Dai, H. L., Dai, J. P., Dbeyssi, A., de Boer, R. E., Dedovich, D., Deng, C. Q., Deng, Z. Y., Denig, A., Denysenko, I., Destefanis, M., De Mori, F., Ding, B., Ding, X. X., Ding, Y., Dong, J., Dong, L. Y., Dong, M. Y., Dong, X., Du, M. C., Du, S. X., Duan, Y. Y., Duan, Z. H., Egorov, P., Fan, Y. H., Fang, J., Fang, S. S., Fang, W. X., Fang, Y., Fang, Y. Q., Farinelli, R., Fava, L., Feldbauer, F., Felici, G., Feng, C. Q., Feng, J. H., Feng, Y. T., Fritsch, M., Fu, C. D., Fu, J. L., Fu, Y. W., Gao, H., Gao, X. B., Gao, Y. N., Gao, Yang, Garbolino, S., Garzia, I., Ge, L., Ge, P. T., Ge, Z. W., Geng, C., Gersabeck, E. M., Gilman, A., Goetzen, K., Gong, L., Gong, W. X., Gradl, W., Gramigna, S., Greco, M., Gu, M. H., Gu, Y. T., Guan, C. Y., Guo, A. Q., Guo, L. B., Guo, M. J., Guo, R. P., Guo, Y. P., Guskov, A., Gutierrez, J., Han, K. L., Han, T. T., Hanisch, F., Hao, X. Q., Harris, F. A., He, K. K., He, K. L., Heinsius, F. H., Heinz, C. H., Heng, Y. K., Herold, C., Holtmann, T., Hong, P. C., Hou, G. Y., Hou, X. T., Hou, Y. R., Hou, Z. L., Hu, B. Y., Hu, H. M., Hu, J. F., Hu, Q. P., Hu, S. L., Hu, T., Hu, Y., Huang, G. S., Huang, K. X., Huang, L. Q., Huang, X. T., Huang, Y. P., Huang, Y. S., Hussain, T., Hölzken, F., Hüsken, N., der Wiesche, N. in, Jackson, J., Janchiv, S., Jeong, J. H., Ji, Q., Ji, Q. P., Ji, W., Ji, X. B., Ji, X. L., Ji, Y. Y., Jia, X. Q., Jia, Z. K., Jiang, D., Jiang, H. B., Jiang, P. C., Jiang, S. S., Jiang, T. J., Jiang, X. S., Jiang, Y., Jiao, J. B., Jiao, J. K., Jiao, Z., Jin, S., Jin, Y., Jing, M. Q., Jing, X. M., Johansson, T., Kabana, S., Kalantar-Nayestanaki, N., Kang, X. L., Kang, X. S., Kavatsyuk, M., Ke, B. C., Khachatryan, V., Khoukaz, A., Kiuchi, R., Kolcu, O. B., Kopf, B., Kuessner, M., Kui, X., Kumar, N., Kupsc, A., Kühn, W., Lavezzi, L., Lei, T. T., Lei, Z. H., Lellmann, M., Lenz, T., Li, C., Li, C. H., Li, Cheng, Li, D. M., Li, F., Li, G., Li, H. B., Li, H. J., Li, H. N., Li, Hui, Li, J. R., Li, J. S., Li, K., Li, K. L., Li, L. J., Li, L. K., Li, Lei, Li, M. H., Li, P. R., Li, Q. M., Li, Q. X., Li, R., Li, S. X., Li, T., Li, W. D., Li, W. G., Li, X., Li, X. H., Li, X. L., Li, X. Y., Li, X. Z., Li, Y. G., Li, Z. J., Li, Z. Y., Liang, C., Liang, H., Liang, Y. F., Liang, Y. T., Liao, G. R., Liao, Y. P., Libby, J., Limphirat, A., Lin, C. C., Lin, C. X., Lin, D. X., Lin, T., Liu, B. J., Liu, B. X., Liu, C., Liu, C. X., Liu, F., Liu, F. H., Liu, Feng, Liu, G. M., Liu, H., Liu, H. B., Liu, H. H., Liu, H. M., Liu, Huihui, Liu, J. B., Liu, J. Y., Liu, K., Liu, K. Y., Liu, Ke, Liu, L., Liu, L. C., Liu, Lu, Liu, M. H., Liu, P. L., Liu, Q., Liu, S. B., Liu, T., Liu, W. K., Liu, W. M., Liu, X., Liu, Y., Liu, Y. B., Liu, Z. A., Liu, Z. D., Liu, Z. Q., Lou, X. C., Lu, F. X., Lu, H. J., Lu, J. G., Lu, X. L., Lu, Y., Lu, Y. P., Lu, Z. H., Luo, C. L., Luo, J. R., Luo, M. X., Luo, T., Luo, X. L., Lyu, X. R., Lyu, Y. F., Ma, F. C., Ma, H., Ma, H. L., Ma, J. L., Ma, L. L., Ma, L. R., Ma, M. M., Ma, Q. M., Ma, R. Q., Ma, T., Ma, X. T., Ma, X. Y., Ma, Y. M., Maas, F. E., MacKay, I., Maggiora, M., Malde, S., Mao, Y. J., Mao, Z. P., Marcello, S., Meng, Z. X., Messchendorp, J. G., Mezzadri, G., Miao, H., Min, T. J., Mitchell, R. E., Mo, X. H., Moses, B., Muchnoi, N. Yu., Muskalla, J., Nefedov, Y., Nerling, F., Nie, L. S., Nikolaev, I. B., Ning, Z., Nisar, S., Niu, Q. L., Niu, W. D., Niu, Y., Olsen, S. L., Ouyang, Q., Pacetti, S., Pan, X., Pan, Y., Pathak, A., Pei, Y. P., Pelizaeus, M., Peng, H. P., Peng, Y. Y., Peters, K., Ping, J. L., Ping, R. G., Plura, S., Prasad, V., Qi, F. Z., Qi, H., Qi, H. R., Qi, M., Qi, T. Y., Qian, S., Qian, W. B., Qiao, C. F., Qiao, X. K., Qin, J. J., Qin, L. Q., Qin, L. Y., Qin, X. P., Qin, X. S., Qin, Z. H., Qiu, J. F., Qu, Z. H., Redmer, C. F., Ren, K. J., Rivetti, A., Rolo, M., Rong, G., Rosner, Ch., Ruan, M. Q., Ruan, S. N., Salone, N., Sarantsev, A., Schelhaas, Y., Schoenning, K., Scodeggio, M., Shan, K. Y., Shan, W., Shan, X. Y., Shang, Z. J., Shangguan, J. F., Shao, L. G., Shao, M., Shen, C. P., Shen, H. F., Shen, W. H., Shen, X. Y., Shi, B. A., Shi, H., Shi, H. C., Shi, J. L., Shi, J. Y., Shi, Q. Q., Shi, S. Y., Shi, X., Song, J. J., Song, T. Z., Song, W. M., Song, Y. J., Song, Y. X., Sosio, S., Spataro, S., Stieler, F., Su, S. S, Su, Y. J., Sun, G. B., Sun, G. X., Sun, H., Sun, H. K., Sun, J. F., Sun, K., Sun, L., Sun, S. S., Sun, T., Sun, W. Y., Sun, Y., Sun, Y. J., Sun, Y. Z., Sun, Z. Q., Sun, Z. T., Tang, C. J., Tang, G. Y., Tang, J., Tang, M., Tang, Y. A., Tao, L. Y., Tao, Q. T., Tat, M., Teng, J. X., Thoren, V., Tian, W. H., Tian, Y., Tian, Z. F., Uman, I., Wan, Y., Wang, S. J., Wang, B., Wang, B. L., Wang, Bo, Wang, D. Y., Wang, F., Wang, H. J., Wang, J. J., Wang, J. P., Wang, K., Wang, L. L., Wang, M., Wang, N. Y., Wang, S., Wang, T., Wang, T. J., Wang, W., Wang, W. P., Wang, X., Wang, X. F., Wang, X. J., Wang, X. L., Wang, X. N., Wang, Y., Wang, Y. D., Wang, Y. F., Wang, Y. H., Wang, Y. L., Wang, Y. N., Wang, Y. Q., Wang, Yaqian, Wang, Yi, Wang, Z., Wang, Z. L., Wang, Z. Y., Wang, Ziyi, Wei, D. H., Weidner, F., Wen, S. P., Wen, Y. R., Wiedner, U., Wilkinson, G., Wolke, M., Wollenberg, L., Wu, C., Wu, J. F., Wu, L. H., Wu, L. J., Wu, X., Wu, X. H., Wu, Y., Wu, Y. H., Wu, Y. J., Wu, Z., Xia, L., Xian, X. M., Xiang, B. H., Xiang, T., Xiao, D., Xiao, G. Y., Xiao, S. Y., Xiao, Y. L., Xiao, Z. J., Xie, C., Xie, X. H., Xie, Y., Xie, Y. G., Xie, Y. H., Xie, Z. P., Xing, T. Y., Xu, C. F., Xu, C. J., Xu, G. F., Xu, H. Y., Xu, M., Xu, Q. J., Xu, Q. N., Xu, W., Xu, W. L., Xu, X. P., Xu, Y., Xu, Y. C., Xu, Z. S., Yan, F., Yan, L., Yan, W. B., Yan, W. C., Yan, X. Q., Yang, H. J., Yang, H. L., Yang, H. X., Yang, J. H., Yang, T., Yang, Y., Yang, Y. F., Yang, Y. X., Yang, Z. W., Yao, Z. P., Ye, M., Ye, M. H., Yin, J. H., Yin, Junhao, You, Z. Y., Yu, B. X., Yu, C. X., Yu, G., Yu, J. S., Yu, M. C., Yu, T., Yu, X. D., Yu, Y. C., Yuan, C. Z., Yuan, J., Yuan, L., Yuan, S. C., Yuan, Y., Yuan, Z. Y., Yue, C. X., Zafar, A. A., Zeng, F. R., Zeng, S. H., Zeng, X., Zeng, Y., Zeng, Y. J., Zhai, X. Y., Zhai, Y. C., Zhan, Y. H., Zhang, A. Q., Zhang, B. L., Zhang, B. X., Zhang, D. H., Zhang, G. Y., Zhang, H., Zhang, H. C., Zhang, H. H., Zhang, H. Q., Zhang, H. R., Zhang, H. Y., Zhang, J., Zhang, J. J., Zhang, J. L., Zhang, J. Q., Zhang, J. S., Zhang, J. W., Zhang, J. X., Zhang, J. Y., Zhang, J. Z., Zhang, Jianyu, Zhang, L. M., Zhang, Lei, Zhang, P., Zhang, Q. Y., Zhang, R. Y., Zhang, S. H., Zhang, Shulei, Zhang, X. M., Zhang, X. Y, Zhang, X. Y., Zhang, Y., Zhang, Y. T., Zhang, Y. H., Zhang, Y. M., Zhang, Yan, Zhang, Z. D., Zhang, Z. H., Zhang, Z. L., Zhang, Z. Y., Zhang, Z. Z., Zhao, G., Zhao, J. Y., Zhao, J. Z., Zhao, L., Zhao, Lei, Zhao, M. G., Zhao, N., Zhao, R. P., Zhao, S. J., Zhao, Y. B., Zhao, Y. X., Zhao, Z. G., Zhemchugov, A., Zheng, B., Zheng, B. M., Zheng, J. P., Zheng, W. J., Zheng, Y. H., Zhong, B., Zhong, X., Zhou, H., Zhou, J. Y., Zhou, L. P., Zhou, S., Zhou, X., Zhou, X. K., Zhou, X. R., Zhou, X. Y., Zhou, Y. Z., Zhou, Z. C., Zhu, A. N., Zhu, J., Zhu, K., Zhu, K. J., Zhu, K. S., Zhu, L., Zhu, L. X., Zhu, S. H., Zhu, T. J., Zhu, W. D., Zhu, Y. C., Zhu, Z. A., Zou, J. H., and Zu, J.
- Subjects
High Energy Physics - Experiment - Abstract
Using 7.93 ${\rm fb^{-1}}$ of $e^+e^-$ collision data collected at a center-of-mass energy of 3.773 ${\rm GeV}$ with the BESIII detector, we present an analysis of the decay $D^{0} \to \eta \pi^- e^+ \nu_{e}$. The branching fraction of the decay $D^{0} \to a_{0}(980)^{-} e^+ \nu_{e}$ with $a_{0}(980)^{-} \to \eta \pi^{-}$ is measured to be $(0.86\pm0.17_{\text{stat}}\pm0.05_{\text{syst}})\times 10^{-4}$. The decay dynamics of this process is studied with a single-pole parameterization of the hadronic form factor and the Flatt\'e formula describing the $a_0(980)$ line shape in the differential decay rate. The product of the form factor $f^{ a_0}_{+}(0)$ and the Cabibbo-Kobayashi-Maskawa matrix element $|V_{cd}|$ is determined for the first time with the result $f^{ a_0}_+(0)|V_{cd}|=0.126\pm0.013_{\rm stat}\pm0.003_{\rm syst}$.
- Published
- 2024
29. World Models: The Safety Perspective
- Author
-
Zeng, Zifan, Zhang, Chongzhe, Liu, Feng, Sifakis, Joseph, Zhang, Qunli, Liu, Shiming, and Wang, Peng
- Subjects
Computer Science - Artificial Intelligence - Abstract
With the proliferation of the Large Language Model (LLM), the concept of World Models (WM) has recently attracted a great deal of attention in the AI research community, especially in the context of AI agents. It is arguably evolving into an essential foundation for building AI agent systems. A WM is intended to help the agent predict the future evolution of environmental states or help the agent fill in missing information so that it can plan its actions and behave safely. The safety property of WM plays a key role in their effective use in critical applications. In this work, we review and analyze the impacts of the current state-of-the-art in WM technology from the point of view of trustworthiness and safety based on a comprehensive survey and the fields of application envisaged. We provide an in-depth analysis of state-of-the-art WMs and derive technical research challenges and their impact in order to call on the research community to collaborate on improving the safety and trustworthiness of WM., Comment: 8 pages, 3 figures, accepted at the International Workshop on Dependability Modeling and Design (WDMD) during the IEEE International Symposium on Software Reliability Engineering (ISSRE)
- Published
- 2024
30. Wafer-scale Semiconductor Grafting: Enabling High-Performance, Lattice-Mismatched Heterojunctions
- Author
-
Zhou, Jie, Zhang, Qiming, Gong, Jiarui, Lu, Yi, Liu, Yang, Abbasi, Haris, Qiu, Haining, Kim, Jisoo, Lin, Wei, Kim, Donghyeok, Li, Yiran, Ng, Tien Khee, Jang, Hokyung, Liu, Dong, Wang, Haiyan, Ooi, Boon S., and Ma, Zhenqiang
- Subjects
Physics - Applied Physics ,Condensed Matter - Materials Science - Abstract
Semiconductor heterojunctions are foundational to many advanced electronic and optoelectronic devices. However, achieving high-quality, lattice-mismatched interfaces remains challenging, limiting both scalability and device performance. Semiconductor grafting offers a promising solution by directly forming electrically active, lattice-mismatched heterojunctions between dissimilar materials. However, its scalability and uniformity at the wafer level have yet to be demonstrated. This work demonstrates the achievement of highly uniform, reproducible results across silicon, sapphire, and gallium nitride (GaN) substrates using wafer-scale semiconductor grafting. To illustrate this scalability, we conducted an in-depth study of a grafted Si/GaN heterojunction, examining band alignment through X-ray photoelectron spectroscopy and confirming crystallinity and interfacial integrity with scanning transmission electron microscopy. The resulting p-n diodes exhibit significantly enhanced electrical performance and wafer-scale uniformity compared to conventional approaches. This work establishes wafer-scale semiconductor grafting as a versatile and scalable technology, bridging the gap between laboratory-scale research and industrial manufacturing for heterogeneous semiconductor integration, and paving the way for novel, high-performance electronic and optoelectronic devices., Comment: 23 pages, 6 figures
- Published
- 2024
31. SDDBench: A Benchmark for Synthesizable Drug Design
- Author
-
Liu, Songtao, Tu, Zhengkai, Dai, Hanjun, and Liu, Peng
- Subjects
Computer Science - Machine Learning ,Quantitative Biology - Quantitative Methods - Abstract
A significant challenge in wet lab experiments with current drug design generative models is the trade-off between pharmacological properties and synthesizability. Molecules predicted to have highly desirable properties are often difficult to synthesize, while those that are easily synthesizable tend to exhibit less favorable properties. As a result, evaluating the synthesizability of molecules in general drug design scenarios remains a significant challenge in the field of drug discovery. The commonly used synthetic accessibility (SA) score aims to evaluate the ease of synthesizing generated molecules, but it falls short of guaranteeing that synthetic routes can actually be found. Inspired by recent advances in top-down synthetic route generation, we propose a new, data-driven metric to evaluate molecule synthesizability. Our approach directly assesses the feasibility of synthetic routes for a given molecule through our proposed round-trip score. This novel metric leverages the synergistic duality between retrosynthetic planners and reaction predictors, both of which are trained on extensive reaction datasets. To demonstrate the efficacy of our method, we conduct a comprehensive evaluation of round-trip scores alongside search success rate across a range of representative molecule generative models. Code is available at https://github.com/SongtaoLiu0823/SDDBench.
- Published
- 2024
32. NVCiM-PT: An NVCiM-assisted Prompt Tuning Framework for Edge LLMs
- Author
-
Qin, Ruiyang, Ren, Pengyu, Yan, Zheyu, Liu, Liu, Liu, Dancheng, Nassereldine, Amir, Xiong, Jinjun, Ni, Kai, Hu, Sharon, and Shi, Yiyu
- Subjects
Computer Science - Machine Learning ,Computer Science - Emerging Technologies - Abstract
Large Language Models (LLMs) deployed on edge devices, known as edge LLMs, need to continuously fine-tune their model parameters from user-generated data under limited resource constraints. However, most existing learning methods are not applicable for edge LLMs because of their reliance on high resources and low learning capacity. Prompt tuning (PT) has recently emerged as an effective fine-tuning method for edge LLMs by only modifying a small portion of LLM parameters, but it suffers from user domain shifts, resulting in repetitive training and losing resource efficiency. Conventional techniques to address domain shift issues often involve complex neural networks and sophisticated training, which are incompatible for PT for edge LLMs. Therefore, an open research question is how to address domain shift issues for edge LLMs with limited resources. In this paper, we propose a prompt tuning framework for edge LLMs, exploiting the benefits offered by non-volatile computing-in-memory (NVCiM) architectures. We introduce a novel NVCiM-assisted PT framework, where we narrow down the core operations to matrix-matrix multiplication, which can then be accelerated by performing in-situ computation on NVCiM. To the best of our knowledge, this is the first work employing NVCiM to improve the edge LLM PT performance., Comment: Accepted by DATE 2025
- Published
- 2024
33. JanusFlow: Harmonizing Autoregression and Rectified Flow for Unified Multimodal Understanding and Generation
- Author
-
Ma, Yiyang, Liu, Xingchao, Chen, Xiaokang, Liu, Wen, Wu, Chengyue, Wu, Zhiyu, Pan, Zizheng, Xie, Zhenda, Zhang, Haowei, yu, Xingkai, Zhao, Liang, Wang, Yisong, Liu, Jiaying, and Ruan, Chong
- Subjects
Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Artificial Intelligence ,Computer Science - Computation and Language - Abstract
We present JanusFlow, a powerful framework that unifies image understanding and generation in a single model. JanusFlow introduces a minimalist architecture that integrates autoregressive language models with rectified flow, a state-of-the-art method in generative modeling. Our key finding demonstrates that rectified flow can be straightforwardly trained within the large language model framework, eliminating the need for complex architectural modifications. To further improve the performance of our unified model, we adopt two key strategies: (i) decoupling the understanding and generation encoders, and (ii) aligning their representations during unified training. Extensive experiments show that JanusFlow achieves comparable or superior performance to specialized models in their respective domains, while significantly outperforming existing unified approaches across standard benchmarks. This work represents a step toward more efficient and versatile vision-language models.
- Published
- 2024
34. The Dependence of Dark Matter Halo Properties on the Morphology of Their Central Galaxies from Weak Lensing
- Author
-
Liu, Zhenjie, Xu, Kun, Zhang, Jun, Wang, Wenting, and Liu, Cong
- Subjects
Astrophysics - Astrophysics of Galaxies ,Astrophysics - Cosmology and Nongalactic Astrophysics - Abstract
Xu & Jing (2022) reported a monotonic relationship between host halo mass $M_h$ and the morphology of massive central galaxies, characterized by the S\'ersic index $n$, at fixed stellar mass, suggesting that morphology could serve as a good secondary proxy for halo mass. Since their results were derived using the indirect abundance matching method, we further investigate the connection between halo properties and central galaxy morphology using weak gravitational lensing. We apply galaxy-galaxy lensing to measure the excess surface density around CMASS central galaxies with stellar masses in the range of $11.3 < \log M_*/{\rm M_\odot} < 11.7$, using the HSC shear catalog processed through the Fourier\_Quad pipeline. By dividing the sample based on $n$, we confirm a positive correlation between $n$ and $M_h$, and observe a possible evidence of the positive correlation of $n$ and halo concentration. After accounting for color, we find that neither color nor morphology alone can determine halo mass, suggesting that a combination of both may serve as a better secondary proxy. In comparison to hydrodynamic simulations, we find that TNG300 produce much weaker correlations between $M_h$ and $n$. Furthermore, disabling jet-mode active galactic nuclei feedback in SIMBA simulations results in the disappearance of the positive $n-M_h$ relationship, suggesting that the star formation history influenced by black holes may be a contributing factor., Comment: 14 pages, 10 figures. Submitted to ApJ
- Published
- 2024
35. Charge Density Wave Coexisting with Amplified Nematicity in the Correlated Kagome Metal CsCr3Sb5
- Author
-
Liu, Liangyang, Li, Yidian, Tan, Hengxin, Liu, Yi, Shi, Ying, Zhai, Yuxin, Lin, Hao, Cao, Guanghan, Yan, Binghai, Zhang, Guang-Ming, and Yang, Luyi
- Subjects
Condensed Matter - Strongly Correlated Electrons - Abstract
The correlated phenomena of flat bands have been extensively studied in twisted systems. However, the emergent ordered states arising from interactions in intrinsic multi-orbital flat bands in kagome lattice materials remain largely unexplored. In contrast to the vanadium-based AV3Sb5 (A = K, Rb, Cs), the newly discovered kagome metal CsCr3Sb5, featuring pressurized superconductivity, antiferromagnetism, structural phase transition, and density wave orders, provides a rich platform for investigating strong electron correlations in multi-orbital flat bands at the Fermi surface. Here, using ultrafast optical techniques, we reveal the gap opening and the emergence of a distinct 1x4 charge density wave (CDW) at low temperatures in CsCr3Sb5. We also find that this CDW reduces the rotational symmetry to three inequivalent nematic domains, and the exotic nematicity is further amplified by the degeneracy lifting of the multi-orbital flat bands, similar to some iron-based superconductors. Surprisingly, both CDW and orbital nematicity appear concurrently with spin and structural orders at the same temperature, indicating that a single characteristic energy scale governs the low-energy flat band physics. Our study thus pioneers the investigation of ultrafast dynamics in flat band systems at the Fermi surface, offering new insights into the interactions between multiple elementary excitations in strongly correlated systems.
- Published
- 2024
36. MaDiNet: Mamba Diffusion Network for SAR Target Detection
- Author
-
Zhou, Jie, Xiao, Chao, Peng, Bowen, Liu, Tianpeng, Liu, Zhen, Liu, Yongxiang, and Liu, Li
- Subjects
Electrical Engineering and Systems Science - Image and Video Processing - Abstract
The fundamental challenge in SAR target detection lies in developing discriminative, efficient, and robust representations of target characteristics within intricate non-cooperative environments. However, accurate target detection is impeded by factors including the sparse distribution and discrete features of the targets, as well as complex background interference. In this study, we propose a \textbf{Ma}mba \textbf{Di}ffusion \textbf{Net}work (MaDiNet) for SAR target detection. Specifically, MaDiNet conceptualizes SAR target detection as the task of generating the position (center coordinates) and size (width and height) of the bounding boxes in the image space. Furthermore, we design a MambaSAR module to capture intricate spatial structural information of targets and enhance the capability of the model to differentiate between targets and complex backgrounds. The experimental results on extensive SAR target detection datasets achieve SOTA, proving the effectiveness of the proposed network. Code is available at \href{https://github.com/JoyeZLearning/MaDiNet}{https://github.com/JoyeZLearning/MaDiNet}.
- Published
- 2024
37. Chinese SimpleQA: A Chinese Factuality Evaluation for Large Language Models
- Author
-
He, Yancheng, Li, Shilong, Liu, Jiaheng, Tan, Yingshui, Wang, Weixun, Huang, Hui, Bu, Xingyuan, Guo, Hangyu, Hu, Chengwei, Zheng, Boren, Lin, Zhuoran, Liu, Xuepeng, Sun, Dekai, Lin, Shirong, Zheng, Zhicheng, Zhu, Xiaoyong, Su, Wenbo, and Zheng, Bo
- Subjects
Computer Science - Computation and Language - Abstract
New LLM evaluation benchmarks are important to align with the rapid development of Large Language Models (LLMs). In this work, we present Chinese SimpleQA, the first comprehensive Chinese benchmark to evaluate the factuality ability of language models to answer short questions, and Chinese SimpleQA mainly has five properties (i.e., Chinese, Diverse, High-quality, Static, Easy-to-evaluate). Specifically, first, we focus on the Chinese language over 6 major topics with 99 diverse subtopics. Second, we conduct a comprehensive quality control process to achieve high-quality questions and answers, where the reference answers are static and cannot be changed over time. Third, following SimpleQA, the questions and answers are very short, and the grading process is easy-to-evaluate based on OpenAI API. Based on Chinese SimpleQA, we perform a comprehensive evaluation on the factuality abilities of existing LLMs. Finally, we hope that Chinese SimpleQA could guide the developers to better understand the Chinese factuality abilities of their models and facilitate the growth of foundation models.
- Published
- 2024
38. Scaling Mesh Generation via Compressive Tokenization
- Author
-
Weng, Haohan, Zhao, Zibo, Lei, Biwen, Yang, Xianghui, Liu, Jian, Lai, Zeqiang, Chen, Zhuo, Liu, Yuhong, Jiang, Jie, Guo, Chunchao, Zhang, Tong, Gao, Shenghua, and Chen, C. L. Philip
- Subjects
Computer Science - Graphics ,Computer Science - Computer Vision and Pattern Recognition - Abstract
We propose a compressive yet effective mesh representation, Blocked and Patchified Tokenization (BPT), facilitating the generation of meshes exceeding 8k faces. BPT compresses mesh sequences by employing block-wise indexing and patch aggregation, reducing their length by approximately 75\% compared to the original sequences. This compression milestone unlocks the potential to utilize mesh data with significantly more faces, thereby enhancing detail richness and improving generation robustness. Empowered with the BPT, we have built a foundation mesh generative model training on scaled mesh data to support flexible control for point clouds and images. Our model demonstrates the capability to generate meshes with intricate details and accurate topology, achieving SoTA performance on mesh generation and reaching the level for direct product usage., Comment: Homepage: https://whaohan.github.io/bpt , Code: https://github.com/whaohan/bpt
- Published
- 2024
39. UniHR: Hierarchical Representation Learning for Unified Knowledge Graph Link Prediction
- Author
-
Liu, Zhiqiang, Chen, Mingyang, Hua, Yin, Chen, Zhuo, Liu, Ziqi, Liang, Lei, Chen, Huajun, and Zhang, Wen
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence - Abstract
Beyond-triple fact representations including hyper-relational facts with auxiliary key-value pairs, temporal facts with additional timestamps, and nested facts implying relationships between facts, are gaining significant attention. However, existing link prediction models are usually designed for one specific type of facts, making it difficult to generalize to other fact representations. To overcome this limitation, we propose a Unified Hierarchical Representation learning framework (UniHR) for unified knowledge graph link prediction. It consists of a unified Hierarchical Data Representation (HiDR) module and a unified Hierarchical Structure Learning (HiSL) module as graph encoder. The HiDR module unifies hyper-relational KGs, temporal KGs, and nested factual KGs into triple-based representations. Then HiSL incorporates intra-fact and inter-fact message passing, focusing on enhancing the semantic information within individual facts and enriching the structural information between facts. Experimental results across 7 datasets from 3 types of KGs demonstrate that our UniHR outperforms baselines designed for one specific kind of KG, indicating strong generalization capability of HiDR form and the effectiveness of HiSL module. Code and data are available at https://github.com/Lza12a/UniHR.
- Published
- 2024
40. Safe Planner: Empowering Safety Awareness in Large Pre-Trained Models for Robot Task Planning
- Author
-
Li, Siyuan, Ma, Zhe, Liu, Feifan, Lu, Jiani, Xiao, Qinqin, Sun, Kewu, Cui, Lingfei, Yang, Xirui, Liu, Peng, and Wang, Xun
- Subjects
Computer Science - Robotics - Abstract
Robot task planning is an important problem for autonomous robots in long-horizon challenging tasks. As large pre-trained models have demonstrated superior planning ability, recent research investigates utilizing large models to achieve autonomous planning for robots in diverse tasks. However, since the large models are pre-trained with Internet data and lack the knowledge of real task scenes, large models as planners may make unsafe decisions that hurt the robots and the surrounding environments. To solve this challenge, we propose a novel Safe Planner framework, which empowers safety awareness in large pre-trained models to accomplish safe and executable planning. In this framework, we develop a safety prediction module to guide the high-level large model planner, and this safety module trained in a simulator can be effectively transferred to real-world tasks. The proposed Safe Planner framework is evaluated on both simulated environments and real robots. The experiment results demonstrate that Safe Planner not only achieves state-of-the-art task success rates, but also substantially improves safety during task execution. The experiment videos are shown in https://sites.google.com/view/safeplanner ., Comment: 9 pages, 6 figures
- Published
- 2024
41. LongSafetyBench: Long-Context LLMs Struggle with Safety Issues
- Author
-
Huang, Mianqiu, Liu, Xiaoran, Zhou, Shaojun, Zhang, Mozhi, Tan, Chenkun, Wang, Pengyu, Guo, Qipeng, Xu, Zhe, Li, Linyang, Lei, Zhikai, Li, Linlin, Liu, Qun, Zhou, Yaqian, Qiu, Xipeng, and Huang, Xuanjing
- Subjects
Computer Science - Computation and Language ,Computer Science - Artificial Intelligence ,Computer Science - Machine Learning - Abstract
With the development of large language models (LLMs), the sequence length of these models continues to increase, drawing significant attention to long-context language models. However, the evaluation of these models has been primarily limited to their capabilities, with a lack of research focusing on their safety. Existing work, such as ManyShotJailbreak, has to some extent demonstrated that long-context language models can exhibit safety concerns. However, the methods used are limited and lack comprehensiveness. In response, we introduce \textbf{LongSafetyBench}, the first benchmark designed to objectively and comprehensively evaluate the safety of long-context models. LongSafetyBench consists of 10 task categories, with an average length of 41,889 words. After testing eight long-context language models on LongSafetyBench, we found that existing models generally exhibit insufficient safety capabilities. The proportion of safe responses from most mainstream long-context LLMs is below 50\%. Moreover, models' safety performance in long-context scenarios does not always align with that in short-context scenarios. Further investigation revealed that long-context models tend to overlook harmful content within lengthy texts. We also proposed a simple yet effective solution, allowing open-source models to achieve performance comparable to that of top-tier closed-source models. We believe that LongSafetyBench can serve as a valuable benchmark for evaluating the safety capabilities of long-context language models. We hope that our work will encourage the broader community to pay attention to the safety of long-context models and contribute to the development of solutions to improve the safety of long-context LLMs.
- Published
- 2024
42. Learning Uniformly Distributed Embedding Clusters of Stylistic Skills for Physically Simulated Characters
- Author
-
Liu, Nian, Liu, Libin, Zhang, Zilong, Wang, Zi, Xie, Hongzhao, Liu, Tengyu, Tong, Xinyi, Yang, Yaodong, and He, Zhaofeng
- Subjects
Computer Science - Graphics - Abstract
Learning natural and diverse behaviors from human motion datasets remains challenging in physics-based character control. Existing conditional adversarial models often suffer from tight and biased embedding distributions where embeddings from the same motion are closely grouped in a small area and shorter motions occupy even less space. Our empirical observations indicate this limits the representational capacity and diversity under each skill. An ideal latent space should be maximally packed by all motion's embedding clusters. In this paper, we propose a skill-conditioned controller that learns diverse skills with expressive variations. Our approach leverages the Neural Collapse phenomenon, a natural outcome of the classification-based encoder, to uniformly distributed cluster centers. We additionally propose a novel Embedding Expansion technique to form stylistic embedding clusters for diverse skills that are uniformly distributed on a hypersphere, maximizing the representational area occupied by each skill and minimizing unmapped regions. This maximally packed and uniformly distributed embedding space ensures that embeddings within the same cluster generate behaviors conforming to the characteristics of the corresponding motion clips, yet exhibiting noticeable variations within each cluster. Compared to existing methods, our controller not only generates high-quality, diverse motions covering the entire dataset but also achieves superior controllability, motion coverage, and diversity under each skill. Both qualitative and quantitative results confirm these traits, enabling our controller to be applied to a wide range of downstream tasks and serving as a cornerstone for diverse applications.
- Published
- 2024
43. Improved scaling of the scrape-off layer particle flux width by the Bayes theorem on EAST
- Author
-
Liu, D. C., Liu, X., Wang, L., and Zheng, X. F.
- Subjects
Physics - Plasma Physics - Abstract
The scaling of scrape-off layer (SOL) power width ({\lambda}q) is essential for advancing the understanding of particle and heat transport in the SOL. Due to the sparse layout of divertor Langmuir probes (Div-LPs) and probe erosion during long-pulse, high-performance operations on EAST, estimating SOL particle flux width ({\lambda}js, used to approximate {\lambda}q) from the ion saturation current density profile (js) often incurs substantial uncertainty. This study presents a maximum a posteriori (MAP) estimation method based on Bayes' theorem, achieving approximately 30% improvement in fitting accuracy over traditional ordinary least squares. Using this method and the FreeGS equilibrium code, we updated databases from Liu et al., Nucl. Fusion 64 (2024). Revised {\lambda}js scalings for L-mode and H-mode in deuterium and helium plasmas demonstrate better regression quality and slightly altered regression results. Unified L-mode and H-mode scalings in deuterium and helium are: {\lambda}_js^L = 0.11 L_c^1.06 n_e^0.35 Z^0.32 P_SOL^0.25 p^(-0.26) and {\lambda}_js^H = 0.11 L_c^1.28 n_e^0.56 Z^0.36 P_SOL^0.30, where L_c is the average SOL connection length, n_e the line-averaged electron density, Z the charge number, PSOL the power crossing the last closed flux surface, and p the core-averaged plasma pressure. Key findings include: (i) {\lambda}js strongly depends on SOL connection length, indicating a machine size dependence absent in the Eich scaling, and (ii) helium {\lambda}js is slightly larger than deuterium {\lambda}js. Extrapolated scalings suggest {\lambda}q ~ 6 mm for ITER L-mode (Ip = 12 MA) and ~13 mm for H-mode (Ip = 15 MA).
- Published
- 2024
44. Elliptic and quadrangular flow of protons in the high baryon density region
- Author
-
Lan, Shaowei, Liu, Zuowen, Liu, Like, and Shi, Shusu
- Subjects
Nuclear Theory - Abstract
The collective flow is crucial for understanding the anisotropic expansion of particles produced in heavy-ion collisions and is sensitive to the equation of state of nuclear matter in high baryon density regions. In this paper, we use the hadronic transport model SMASH to study the elliptic flow ($v_2$), quadrangular flow ($v_4$), and their ratio ($v_{4}/v_{2}^{2}$) in Au+Au collisions at high baryon density. Our results show that the inclusion of baryonic mean-field potential in the model successfully reproduces experimental data from the HADES experiment, indicating that baryonic interactions play an important role in shaping anisotropic flow. In addition to comparing the transverse momentum ($p_T$), rapidity, and centrality dependence of $v_{4}/v_{2}^{2}$ between HADES data and model calculations, we also explore its time evolution and energy dependence from $\sqrt{s_{NN}} =$ 2.4 to 4.5 GeV. We find that the ratio $v_{4}/v_{2}^{2}$ is close to 0.5, as expected from hydrodynamic behavior. These results suggest that the early-stage evolution in the high baryon density region resembles ideal fluid behavior.
- Published
- 2024
45. Alleviating Hyperparameter-Tuning Burden in SVM Classifiers for Pulmonary Nodules Diagnosis with Multi-Task Bayesian Optimization
- Author
-
Chi, Wenhao, Liu, Haiping, Dong, Hongqiao, Liang, Wenhua, and Liu, Bo
- Subjects
Electrical Engineering and Systems Science - Image and Video Processing ,Computer Science - Computer Vision and Pattern Recognition ,Computer Science - Machine Learning ,Statistics - Machine Learning - Abstract
In the field of non-invasive medical imaging, radiomic features are utilized to measure tumor characteristics. However, these features can be affected by the techniques used to discretize the images, ultimately impacting the accuracy of diagnosis. To investigate the influence of various image discretization methods on diagnosis, it is common practice to evaluate multiple discretization strategies individually. This approach often leads to redundant and time-consuming tasks such as training predictive models and fine-tuning hyperparameters separately. This study examines the feasibility of employing multi-task Bayesian optimization to accelerate the hyperparameters search for classifying benign and malignant pulmonary nodules using RBF SVM. Our findings suggest that multi-task Bayesian optimization significantly accelerates the search for hyperparameters in comparison to a single-task approach. To the best of our knowledge, this is the first investigation to utilize multi-task Bayesian optimization in a critical medical context., Comment: 12 pages, 4 figures, 37 references
- Published
- 2024
46. Quantum causal inference via scattering circuits in NMR
- Author
-
Liu, Hongfeng, Liu, Xiangjing, Chen, Qian, Qiu, Yixian, Vedral, Vlatko, Nie, Xinfang, Dahlsten, Oscar, and Lu, Dawei
- Subjects
Quantum Physics - Abstract
We report NMR scattering circuit experiments that reveal causal structure. The scattering circuit involves interacting a probe qubit with the system of interest and finally measuring the probe qubit. The scattering circuit thereby implements a coarse-grained projective measurement. Causal structure refers to which events influence others and in the quantum case corresponds to different quantum circuit structures. In classical scenarios, intervention is commonly used to infer causal structure. In this quantum scenario of a bipartite system at two times, we demonstrate via scattering circuit experiments that coarse-grained measurements alone suffice for determining the causal structure. The experiment is undertaken by manipulating the nuclear spins of four Carbon-13 atoms in crotonic acid. The data analysis determines the compatibility of the data with given causal structures via representing the data as a pseudo density matrix (PDM) and analysing properties of the PDM. We demonstrate the successful identification of the causal structure for partial swap channels and fully decohering channels., Comment: 10 pages,10 figures, a companion paper appeared the same day, comments are welcome!
- Published
- 2024
47. Experimental demonstration of quantum causal inference via noninvasive measurements
- Author
-
Liu, Hongfeng, Liu, Xiangjing, Chen, Qian, Qiu, Yixian, Vedral, Vlatko, Nie, Xinfang, Dahlsten, Oscar, and Lu, Dawei
- Subjects
Quantum Physics - Abstract
We probe the foundations of causal structure inference experimentally. The causal structure concerns which events influence other events. We probe whether causal structure can be determined without intervention in quantum systems. Intervention is commonly used to determine causal structure in classical scenarios, but in the more fundamental quantum theory, there is evidence that measurements alone, even coarse-grained measurements, can suffice. We demonstrate the experimental discrimination between several possible causal structures for a bipartite quantum system at two times, solely via coarse-grained projective measurements. The measurements are implemented by an approach known as scattering circuits in a nuclear magnetic resonance platform. Using recent analytical methods the data thus gathered is sufficient to determine the causal structure. Coarse-grained projective measurements disturb the quantum state less than fine-grained projective measurements and much less than interventions that reset the system to a fixed state., Comment: 6 pages, 4 figures, a companion paper appeared the same day. Comments are Welcome!
- Published
- 2024
48. A Picture is Worth A Thousand Numbers: Enabling LLMs Reason about Time Series via Visualization
- Author
-
Liu, Haoxin, Liu, Chenghao, and Prakash, B. Aditya
- Subjects
Computer Science - Machine Learning ,Computer Science - Artificial Intelligence - Abstract
Large language models (LLMs), with demonstrated reasoning abilities across multiple domains, are largely underexplored for time-series reasoning (TsR), which is ubiquitous in the real world. In this work, we propose TimerBed, the first comprehensive testbed for evaluating LLMs' TsR performance. Specifically, TimerBed includes stratified reasoning patterns with real-world tasks, comprehensive combinations of LLMs and reasoning strategies, and various supervised models as comparison anchors. We perform extensive experiments with TimerBed, test multiple current beliefs, and verify the initial failures of LLMs in TsR, evidenced by the ineffectiveness of zero shot (ZST) and performance degradation of few shot in-context learning (ICL). Further, we identify one possible root cause: the numerical modeling of data. To address this, we propose a prompt-based solution VL-Time, using visualization-modeled data and language-guided reasoning. Experimental results demonstrate that Vl-Time enables multimodal LLMs to be non-trivial ZST and powerful ICL reasoners for time series, achieving about 140% average performance improvement and 99% average token costs reduction.
- Published
- 2024
49. MIPD: A Multi-sensory Interactive Perception Dataset for Embodied Intelligent Driving
- Author
-
Li, Zhiwei, Zhang, Tingzhen, Zhou, Meihua, Tang, Dandan, Zhang, Pengwei, Liu, Wenzhuo, Yang, Qiaoning, Shen, Tianyu, Wang, Kunfeng, and Liu, Huaping
- Subjects
Computer Science - Robotics - Abstract
During the process of driving, humans usually rely on multiple senses to gather information and make decisions. Analogously, in order to achieve embodied intelligence in autonomous driving, it is essential to integrate multidimensional sensory information in order to facilitate interaction with the environment. However, the current multi-modal fusion sensing schemes often neglect these additional sensory inputs, hindering the realization of fully autonomous driving. This paper considers multi-sensory information and proposes a multi-modal interactive perception dataset named MIPD, enabling expanding the current autonomous driving algorithm framework, for supporting the research on embodied intelligent driving. In addition to the conventional camera, lidar, and 4D radar data, our dataset incorporates multiple sensor inputs including sound, light intensity, vibration intensity and vehicle speed to enrich the dataset comprehensiveness. Comprising 126 consecutive sequences, many exceeding twenty seconds, MIPD features over 8,500 meticulously synchronized and annotated frames. Moreover, it encompasses many challenging scenarios, covering various road and lighting conditions. The dataset has undergone thorough experimental validation, producing valuable insights for the exploration of next-generation autonomous driving frameworks., Comment: Data, development kit and more details will be available at https://github.com/BUCT-IUSRC/Dataset MIPD
- Published
- 2024
50. On Differentially Private String Distances
- Author
-
Hu, Jerry Yao-Chieh, Liu, Erzhi, Liu, Han, Song, Zhao, and Zhang, Lichen
- Subjects
Computer Science - Data Structures and Algorithms ,Computer Science - Artificial Intelligence ,Computer Science - Cryptography and Security ,Computer Science - Machine Learning ,Statistics - Machine Learning - Abstract
Given a database of bit strings $A_1,\ldots,A_m\in \{0,1\}^n$, a fundamental data structure task is to estimate the distances between a given query $B\in \{0,1\}^n$ with all the strings in the database. In addition, one might further want to ensure the integrity of the database by releasing these distance statistics in a secure manner. In this work, we propose differentially private (DP) data structures for this type of tasks, with a focus on Hamming and edit distance. On top of the strong privacy guarantees, our data structures are also time- and space-efficient. In particular, our data structure is $\epsilon$-DP against any sequence of queries of arbitrary length, and for any query $B$ such that the maximum distance to any string in the database is at most $k$, we output $m$ distance estimates. Moreover, - For Hamming distance, our data structure answers any query in $\widetilde O(mk+n)$ time and each estimate deviates from the true distance by at most $\widetilde O(k/e^{\epsilon/\log k})$; - For edit distance, our data structure answers any query in $\widetilde O(mk^2+n)$ time and each estimate deviates from the true distance by at most $\widetilde O(k/e^{\epsilon/(\log k \log n)})$. For moderate $k$, both data structures support sublinear query operations. We obtain these results via a novel adaptation of the randomized response technique as a bit flipping procedure, applied to the sketched strings.
- Published
- 2024
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.