检索结果-内蒙古大学图书馆

An infrastructure software perspective toward computation offloading between executable specifications and foundation models

引用

science China(Information sciences) 2025年第4期68卷 380-382页

作者： Dezhi RAN Mengzhou WU Yuan CAO Assaf MARRON David HAREL Tao XIE Key Laboratory of High Confidence Software Technologies (PKU) Ministry of Education School of Computer SciencePeking University School of Electronics Engineering and Computer Science Peking University Department of Computer Science and Applied Mathematics Weizmann Institute of Science

Foundation models(FMs) [1] have revolutionized software development and become the core components of large software systems. This paradigm shift, however, demands fundamental re-imagining of software engineering theories and methodologies [2]. Instead of replacing existing software modules implemented by symbolic logic, incorporating FMs' capabilities to build software systems requires entirely new modules that leverage the unique capabilities of ***, while FMs excel at handling uncertainty, recognizing patterns, and processing unstructured data, we need new engineering theories that support the paradigm shift from explicitly programming and maintaining user-defined symbolic logic to creating rich, expressive requirements that FMs can accurately perceive and implement.

关键词：

来源：评论

学校读者我要写书评

暂无评论

From Infants to AI: Incorporating Infant-like Learning in Models Boosts Efficiency and Generalization in Learning Social Prediction Tasks

arXiv

引用

arXiv 2025年

作者： Treger, Shify Ullman, Shimon Department of Computer Science and Applied Mathematics Weizmann Institute of Science

Early in development, infants learn a range of useful concepts, which can be challenging from a computational standpoint. This early learning comes together with an initial understanding of aspects of the meaning of concepts, e.g., their implications, causality, and using them to predict likely future events. All this is accomplished in many cases with little or no supervision, and from relatively few examples, compared with current network models. In learning about objects and human-object interactions, early acquired and possibly innate concepts are often used in the process of learning additional, more complex concepts. In the current work, we model how early-acquired concepts are used in the learning of subsequent concepts, and compare the results with standard deep network modeling. We focused in particular on the use of the concepts of animacy and goal attribution in learning to predict future events. We show that the use of early concepts in the learning of new concepts leads to better learning (higher accuracy) and more efficient learning (requiring less data). We further show that this integration of early and new concepts shapes the representation of the concepts acquired by the model. The results show that when the concepts were learned in a human-like manner, the emerging representation was more useful, as measured in terms of generalization to novel data and tasks. On a more general level, the results suggest that there are likely to be basic differences in the conceptual structures acquired by current network models compared to human learning. © 2025, CC BY.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Enhancing Missing Data Imputation for Migrants Data: A Neutrosophic Set-Based Machine Learning Approach

引用

Neutrosophic Sets and Systems 2025年 81卷 479-502页

作者： Abdo, Doaa A. Salama, A.A. Abdelmegaly, Alaa A. Mahmoud, Hanan Khadari Mahdi Applied statistics and insurance department faculty of commerce Mansoura university Mansoura Egypt Dept. of Math and Computer Sci. Faculty of Science Port Said Univ. Egypt Higher Institute of Advanced Management Sciences and Computers Al-Buhayrah Egypt Depatrment of applied statistics at the Nile Higher Institute of commercial sciences and Computer Technology in Mansoura Egypt

This study tackles the problem of missing data in migrant datasets by introducing a new framework that combines machine learning techniques with neutrosophic sets. These sets, which can represent uncertainty and ambiguity, are well-suited for managing the complex nature of missing information in sensitive fields like migration research. We test the effectiveness of KNN, SVM, decision tree, random forest, and Ada Boost algorithms on a migrant dataset, comparing their results using different imputation methods (mean/mode, model-based imputer (simple tree), and random values). Our research showed that our proposed approach, which used neutrosophic sets, improved imputation accuracy and strengthened model reliability. Our results underscored the potential of neutrosophic set-based machine learning for addressing missing data issues across various fields. © 2025, University of New Mexico. All rights reserved.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Modulo Sampling and Recovery with Unknown and Time-Varying Folding Parameter

Modulo Sampling and Recovery with Unknown and Time-Varying F...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Yhonatan Kvich Alperen Yasar Eyyup Tasci Rabia T. Yazicigil Yonina C. Eldar Faculty of Math and Computer Science Weizmann Institute of Science Israel Electrical and Computer Engineering Department Boston University Boston MA USA

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Sampling signals with a high dynamic range (DR) poses significant challenges in analog-to-digital conversion (ADC), where the DR of the ADC must exceed that of the input signal to prevent information loss. Modulo sampling offers a promising solution to this problem by reducing the DR of the signal prior to sampling. In this paper, we address the modulo recovery problem in scenarios where the folding parameter is unknown and potentially time-varying, motivated by practical hardware limitations that make it difficult to maintain a constant and precise folding parameter. We provide a theoretical guarantee for the unique recovery of band-limited (BL) signals from modulo samples without requiring knowledge of the folding parameter. Additionally, we develop a robust recovery algorithm specifically for scenarios with a constant but unknown folding parameter. The algorithm’s performance is evaluated through simulations under various conditions, including different oversampling rates and noise levels. The results demonstrate that our method achieves high accuracy in signal recovery, even in challenging environments.

关键词： Accuracy Uncertainty Simulation Signal processing algorithms Reliability theory Hardware Robustness Noise measurement Speech processing Noise level

来源：评论

学校读者我要写书评

暂无评论

Natural averaging may complement known biological constraints in sexual reproduction’s advantages over asexual in conserving species quantitative traits

引用

Scientific Reports 2025年第1期15卷 1-13页

作者： Marron, Assaf Szekely, Smadar Cohen, Irun R. Harel, David Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot 76100 Israel Department of Immunology and Regenerative Biology Weizmann Institute of Science Rehovot 76100 Israel

Commonly recognized effects of sexual reproduction include increased diversity, improved adaptability, enabling of DNA repair, constrained accumulation of deleterious mutations, and species genotype homogenization. Additionally, there are studies that show how sexual reproduction slows down certain evolutionary responses, offering advantages in population cumulative growth and stability over time and other metrics. Here, we contribute an observation of another distinct effect of sexual reproduction, focusing on retaining a species’s key traits. In an initial mathematical analysis and simulation, we show that in an environment where copying is prone to error, quantitative polygenic traits that are shared within a parents’ generation are transmitted to future generations under sexual reproduction with less deviation than under asexual reproduction. Furthermore, the model shows that this retention of common traits (abbr. RoCT), is driven by the very nature of mixing of parental traits, and occurs even before adding effects like trait-specific reproductive advantages, DNA repair, or the raising of reproductive barriers. Since survival of ecosystems depends on the ability of individuals to replace the networked interactions and interdependencies associated with failing, dying, or absent members of the same species, RoCT helps sustain species and ecosystems. © The Author(s) 2025.

关键词： Asexual reproduction Bi-parental Clonal reproduction Probabilistic sampling Sexual reproduction

来源：评论

学校读者我要写书评

暂无评论

The Physics of Sensing and Decision-Making by Animal Groups

引用

Annual review of biophysics 2025年第1期54卷 329-351页

作者： Chase, Danielle L. Peleg, Orit BioFrontiers Institute University of Colorado Boulder Colorado USA email: Orit.Peleg@colorado.edu BioFrontiers Institute University of Colorado Boulder Colorado USA email: Danielle.Chase@colorado.edu Orit.Peleg@colorado.edu Department of Computer Science Department of Physics Department of Applied Math Department of Ecology and Evolutionary Biology University of Colorado Boulder CO United States Santa Fe Institute Santa Fe New Mexico USA

To ensure survival and reproduction, individual animals navigating the world must regularly sense their surroundings and use this information for important decision-making. The same is true for animals living in groups, where the roles of sensing, information propagation, and decision-making are distributed on the basis of individual knowledge, spatial position within the group, and more. This review highlights key examples of temporal and spatiotemporal dynamics in animal group decision-making, emphasizing strong connections between mathematical models and experimental observations. We start with models of temporal dynamics, such as reaching consensus and the time dynamics of excitation-inhibition networks. For spatiotemporal dynamics in sparse groups, we explore the propagation of information and synchronization of movement in animal groups with models of self-propelled particles, where interactions are typically parameterized by length and timescales. In dense groups, we examine crowding effects using a soft condensed matter approach, where interactions are parameterized by physical potentials and forces. While focusing on invertebrates, we also demonstrate the applicability of these results to a wide range of organisms, aiming to provide an overview of group behavior dynamics and identify new areas for exploration.

关键词： active matter collective behavior decision-making dynamical systems sensing soft matter

来源：评论

学校读者我要写书评

暂无评论

Fundamental Limit of Angular Resolution in Partly Calibrated Arrays with Position Errors

arXiv

引用

arXiv 2025年

作者： Zhang, Guangbin Wang, Yan Huang, Tianyao Eldar, Yonina C. Yangtze Delta Region Academy Beijing Institute of Technology Zhejiang Jiaxing China Radar Research Laboratory School of Information and Electronics Beijing Institute of Technology Beijing China School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China Department of Computer Science and Applied Mathematics Weizmann Institute of Science Israel

We consider high angular resolution detection using distributed mobile platforms implemented with so-called partly calibrated arrays, where position errors between subarrays exist and the counterparts within each subarray are ideally calibrated. Since position errors between antenna arrays affect the coherent processing of measurements from these arrays, it is commonly believed that its angular resolution is influenced. A key question is whether and how much the angular resolution of partly calibrated arrays is affected by the position errors, in comparison with ideally calibrated arrays. To address this fundamental problem, we theoretically illustrate that partly calibrated arrays approximately achieve high angular resolution. Our analysis uses a special characteristic of Cramér-Rao lower bound (CRB) w.r.t. the source separation: When the source separation increases, the CRB first declines rapidly, then plateaus out, and the turning point is close to the angular resolution limit. This means that the turning point of CRB can be used to indicate angular resolution. We then theoretically analyze the declining and plateau phases of CRB, and explain that the turning point of CRB in partly calibrated arrays is close to the angular resolution limit of distributed arrays without errors, demonstrating high resolution ability. This work thus provides a theoretical guarantee for the high-resolution performance of distributed antenna arrays in mobile platforms. Copyright © 2025, The Authors. All rights reserved.

关键词： Source separation

来源：评论

学校读者我要写书评

暂无评论

A fast randomized LOGSPACE algorithm for graph connectivity

引用

THEORETICAL computer science 1996年第2期169卷 147-160页

作者： Feige, U Department of Applied Math and Computer Science The Weizmann Institute Rehovot 76100 Israel

We study the relationship between undirected graph reachability and graph connectivity, in the context of randomized LOGSPACE algorithms. Aleluinas et al. [2] show that graph reachability (checking whether there is a path connecting vertices L and F) can be decided in logarithmic space and polynomial time, by starting a random walk at L, and checking whether F is hit within some time limit. The randomized algorithm has one-sided error (with small probability, it fails to determine that L and F are connected). The reachability algorithm may be used in order to decide (with one-sided error) whether a graph is connected, by running it n - 1 times, each time with a different target vertex F. This increases the running time by a factor of n. In this paper we give an alternative randomized LOGSPACE algorithm for graph connectivity. Its running time varies between O(n(2)) steps and O(n(3)) steps, depending on the structure of the input graph. This matches the fastest known RLOGSPACE algorithm for reachability, up to a constant factor. Our algorithm has two-sided error.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

Structure in conversation: Evidence for the vocabulary, semantics, and syntax of prosody

引用

Proceedings of the National Academy of sciences of the United States of America 2025年第17期122卷 e2403262122页

作者： Matalon, Nadav Weinreb, Eyal Freche, Dominik Volk, Erez Biron, Tirza Moses, Elisha Biron, David Department of Physics of Complex Systems Weizmann Institute of Science Rehovot 7610001 Israel Department of Linguistics Hebrew University of Jerusalem Jerusalem 9190501 Israel NeuraLight Inc. Tel Aviv 6713818 Israel Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot 7610001 Israel The Data Science Institute The University of Chicago Chicago 60637 IL United States The Department of Statistics The University of Chicago Chicago 60637 IL United States

Prosody, the musical facet of speech, is pivotal in human communication, and its structure and meaning remain subjects of ongoing research. In this study, we introduce a data-driven model for English prosody, based on large-scale analysis of spontaneous conversations. As a first step, we identify approximately 200 discernible prosodic patterns—which we view as building blocks of the prosodic vocabulary—and outline their properties and range of meanings. Next, we reveal a Markovian logic, akin to a syntax, for concatenating these elementary building blocks into coherent utterances. We identify distinct compound functions associated with pairs of consecutive patterns and show that the Markovian syntax is more prevalent in spontaneous prosody, as compared to scripted speech. These findings offer invaluable insights into the underlying mechanisms of conversational prosody: They empirically inform and refine existing theoretical concepts. The methodology we present, combining unsupervised analysis of large datasets of spontaneous speech with manual sampling of the results, could guide future research aimed at refining our model and expanding it to other languages. Copyright © 2025 the Author(s).

关键词： language prosody speech unsupervised analysis

来源：评论

学校读者我要写书评

暂无评论

A TIGHT LOWER-BOUND ON THE COVER TIME FOR RANDOM-WALKS ON GRAPHS

引用

RANDOM STRUCTURES & ALGORITHMS 1995年第4期6卷 433-438页

作者： FEIGE, U Department of Applied Math and Computer Science The Weizmann Institute Rehovot Israel

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：