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

作者： Xing, Yulong Shu, Chi-Wang Noelle, Sebastian Computer Science and Mathematics Division Oak Ridge National Laboratory Oak Ridge TN 37831 United States Department of Mathematics University of Tennessee Knoxville TN 37996 United States Division of Applied Mathematics Brown University Providence RI 02912 United States Institute for Geometry and Applied Mathematics RWTH Aachen University Aachen 52056 Germany

This note aims at demonstrating the advantage of moving-water well-balanced schemes over still-water well-balanced schemes for the shallow water equations. We concentrate on numerical examples with solutions near a moving-water equilibrium. For such examples, still-water well-balanced methods are not capable of capturing the small perturbations of the moving-water equilibrium and may generate significant spurious oscillations, unless an extremely refined mesh is used. On the other hand, moving-water well-balanced methods perform well in these tests. The numerical examples in this note clearly demonstrate the importance of utilizing moving-water well-balanced methods for solutions near a moving-water equilibrium. © 2010 Springer science+Business Media, LLC.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

Optimal partitions of data in higher dimensions

Optimal partitions of data in higher dimensions

引用

NASA Conference on Intelligent Data Understanding, CIDU 2010

作者： Jackson, Bradley W. Scargle, Jeffrey D. Cusanza, Chris Barnes, David Kanygin, Dennis Sarmiento, Russell Subramaniam, Sowmya Chuang, Tzu-Wang Department of Mathematics San Jose State University United States Space Science Division NASA Ames Research Center United States San Jose State University Center for Applied Mathematics and Computer Science United States

Consider piece-wise constant approximations to a function of several parameters, and the problem of finding the best such approximation from measurements at a set of points in the parameter space. We find good approximate solutions to this problem in two steps: (1) partition the parameter space into cells, one for each of the N data points, and (2) collect these cells into blocks, such that within each block the function is constant to within measurement uncertainty. We describe a branch-and-bound algorithm for finding the optimal partition into connected blocks, as well as an O(N2) dynamic programming algorithm that finds the exact global optimum over this exponentially large search space, in a data space of any dimension. This second solution relaxes the connectivity constraint, and requires additivity and convexity conditions on the block fitness function, but in practice none of these items cause problems. From the wide variety of intelligent data understanding applications (including cluster analysis, classification, and anomaly detection) we demonstrate two: partitioning of the State of California (2D) and the Universe (3D). Copyright © 2010 Bradley W. Jackson, Jeffrey D. Scargle, Chris Cusanza, David Barnes, Dennis Kanygin, Russel Sarmiento, Sowmya Subramaniam, and Tzu-Wang Chuang.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Adaptive bandwidth allocation method for long range dependence traffic

引用

6th IEEE International Workshop on IP Operations and Management, IPOM 2006

作者： Kim, Bong Joo Hwang, Gang Uk Division of Applied Mathematics Telecommunication Program Korea Advanced Institute of Science and Technology 373-1 Guseong-dong Yuseong-gu Taejeon 305-701 Korea Republic of

ISBN: (纸本)3540477012

In this paper, we propose a new method to allocate bandwidth adaptively according to the amount of input traffic volume for a long range dependent traffic requiring Quality of Service (QoS). In the proposed method, we divide the input process, which is modelled by an M/G/∞ input process, into two sub-processes, called a long time scale process and a short time scale process. For the long time scale process we estimate the required bandwidth using the linear prediction. Since the long time scale process varies (relatively) slowly, the required bandwidth doesn't need to be estimated frequently. On the other hand, for the short time scale process, we use the large deviation theory to estimate the effective bandwidth of the short time scale process based on the required QoS of the input traffic. By doing this we can capture the short time scale fluctuation by a buffer and the long time scale fluctuation by increasing or decreasing the bandwidth adaptively. Through simulations we verify that our proposed method performs well to satisfy the required QoS. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Frequency allocation

来源：评论

学校读者我要写书评

暂无评论

Modelling, computation and optimization in information systems and management sciences: Proceedings of the 3rd international conference on modelling, computation and optimization in information systems and management sciences - MCO 2015 - part II 3rd

引用

3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management sciences, MCO 2015

作者： Le Thi, Hoai An Dinh, Tao Pham Nguyen, Ngoc Thanh Laboratory of Theoretical and Applied Computer Science University of Lorraine - Metz France Laboratory of Mathematics National Institute for Applied Sciences - Rouen France Division of Knowledge Management Systems Wroclaw University of Technology Poland

来源：评论

学校读者我要写书评

暂无评论

Biomedical data and AI

引用

science China Life sciences 2025年第5期68卷 1536-1540页

作者： Hao Xu Shibo Zhou Zefeng Zhu Vincenzo Vitelli Liangyi Chen Ziwei Dai Ning Yang Luhua Lai Shengyong Yang Sergey Ovchinnikov Zhuoran Qiao Sirui Liu Chen Song Jianfeng Pei Han Wen Jianfeng Feng Yaoyao Zhang Zhengwei Xie Yang-Yu Liu Zhiyuan Li Fulai Jin Hao Li Mohammad Lotfollahi Xuegong Zhang Ge Yang Shihua Zhang Ge Gao Pulin Li Qi Liu Jing-Dong Jackie Han Peking-Tsinghua Center for Life Sciences (CLS) Academy for Advanced Interdisciplinary StudiesPeking University Center for Quantitative Biology (CQB) Academy for Advanced Interdisciplinary StudiesPeking University Peking University-Tsinghua University-National Institute of Biological Sciences Joint Graduate Program Academy for Advanced Interdisciplinary StudiesPeking University Department of Physics University of Chicago School of Life Sciences Southern University of Science and Technology Peking University Chengdu Academy for Advanced Interdisciplinary Biotechnologies College of Chemistry and Molecular Engineering Peking University Department of Biotherapy Cancer Center and State Key Laboratory of BiotherapyWest China HospitalSichuan University Department of Biology Massachusetts Institute of Technology Lambic Therapeutics Inc. Changping Laboratory Al for Science Institute Key Laboratory of Computational Neuroscience and Brain-Inspired Intelligence Fudan University Department of Obstetrics and Gynecology West China Second University HospitalSichuan University Peking University International Cancer Institute and Peking University-Yunnan Baiyao International Medical Institute and State Key Laboratory of Natural and Biomimetic Drugs Department of Molecular and Cellular PharmacologySchool of Pharmaceutical SciencesPeking University Health Science CenterPeking University Channing Division of Network Medicine Department of MedicineBrigham and Women's Hospital and Harvard Medical School Center for Artificial Intelligence and Modeling the Carl R.Woese Institute for Genomic BiologyUniversity of Illinois Urbana-Champaign Department of Genetics and Genome Sciences School of Medicine and Department of Computer and Data Sciences and Department of Population and Quantitative Health SciencesCase Western Reserve University Department of Biochemistry and Biophysics University of California Sanger Institute Department of Automation Tsinghua University State Key Laboratory of Multimodal Artificial Intelligence Systems I

The development of artificial intelligence(AI) and the mining of biomedical data complement each other. From the direct use of computer vision results to analyze medical images for disease screening, to now integrating biological knowledge into models and even accelerating the development of new AI based on biological discoveries, the boundaries of both are constantly expanding, and their connections are becoming closer.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Graph morphology

引用

Journal of Visual Communication and Image Representation 1992年第1期3卷 24-24页

作者： Heijmans, H.J.A. Nacken, P. Toet, A. Vincent, L. Centre for Mathematics and Computer Science P.O. Box 4079 1009 AB Amsterdam The Netherlands Institute for Perception TNO Kampweg 5 3769 DE Soesterberg The Netherlands Division of Applied Sciences Harvard University Cambridge Massachusetts 02138 USA

This paper presents a systematic theory for the construction of morphological operators on graphs. Graph morphology extracts structural information from graphs using predefined test probes called structuring graphs. Structuring graphs have a simple structure and are relatively small compared to the graph that is to be transformed. A neighborhood function on the set of vertices of a graph is constructed by relating individual vertices to each other whenever they belong to a local instantiation of the structuring graph. This function is used to construct dilations and erosions. The concept of the structuring graph is also used to define openings and closings. The resulting morphological operators are invariant under symmetries of the graph. Graph morphology resembles classical morphology (which uses structuring elements to obtain translation-invariant operators) to a large extent. However, not all results from classical morphology have analogues in graph morphology because the local graph structure may be different at different vertices.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Terahertz Cavity Phonon Polaritons in Lead Telluride in the Deep-Strong Coupling Regime

arXiv

引用

arXiv 2025年

作者： Baydin, Andrey Manjappa, Manukumara Mishra, Sobhan Subhra Xu, Hongjing Doumani, Jacques Tay, Fuyang Kim, Dasom Rappl, Paulo H.O. Abramof, Eduardo Singh, Ranjan Hernandez, Felix G.G. Kono, Junichiro Department of Electrical and Computer Engineering Rice University HoustonTX77005 United States Smalley–Curl Institute Rice University HoustonTX77005 United States Rice Advanced Materials Institute Rice University HoustonTX77005 United States Instrumentation and Applied Physics Department Indian Institute of Science Bangalore560012 India Center for Disruptive Photonic Technologies The Photonics Institute Nanyang Technological University 639798 Singapore Department of Physics and Astronomy Rice University HoustonTX77005 United States Applied Physics Graduate Program Smalley–Curl Institute Rice University HoustonTX77005 United States Group of Research and Development in Materials and Plasma National Institute for Space Research São José dos Campos São Paulo12201-970 Brazil Division of Physics and Applied Physics School of Physical and Mathematical Sciences Nanyang Technological University 637371 Singapore Instituto de Física Universidade de São Paulo São Paulo05508-090 Brazil Department of Material Science and NanoEngineering Rice University HoustonTX77005 United States

Lead telluride is an important thermoelectric material due to its large Seebeck coefficient combined with its unusually low thermal conductivity that is related to the strong anharmonicity of phonons in this material. Here, we have studied the resonant and nonperturbative coupling of transverse optical phonons in lead telluride with cavity photons inside small-mode-volume metallic metasurface cavities that have photonic modes with terahertz frequencies. We observed a giant vacuum Rabi splitting on the order of the bare phonon and cavity frequencies. Through terahertz time-domain spectroscopy experiments, we systematically studied the vacuum Rabi splitting as a function of sample thickness, temperature, and cavity length. Under the strongest light–matter coupling conditions, the strength of coupling exceeded the bare phonon and cavity frequencies, putting the system into the deep-strong coupling regime. These results demonstrate that this uniquely tunable platform is promising for realizing and understanding predicted cavity-vacuum-induced ferroelectric instabilities and exploring applications of light–matter coupling in the ultrastrong and deep-strong coupling regimes in quantum technology. Copyright © 2025, The Authors. All rights reserved.

关键词： Phonons

来源：评论

学校读者我要写书评

暂无评论

Diffusion maps - A probabilistic interpretation for spectral embedding and clustering algorithms

Diffusion maps - A probabilistic interpretation for spectral...

引用

作者： Nadler, Boaz Lafon, Stephane Coifman, Ronald Kevrekidis, Ioannis G. Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot 76100 Israel Google Inc. United States Department of Mathematics Yale University New Haven CT 06520-8283 United States Department of Chemical Engineering Program in Applied and Computational Mathematics Princeton University Princeton NJ 08544 United States

ISBN: (纸本)9783540737490

Spectral embedding and spectral clustering are common methods for non-linear dimensionality reduction and clustering of complex high dimensional datasets. In this paper we provide a diffusion based probabilistic analysis of algorithms that use the normalized graph Laplacian. Given the pairwise adjacency matrix of all points in a dataset, we define a random walk on the graph of points and a diffusion distance between any two points. We show that the diffusion distance is equal to the Euclidean distance in the embedded space with all eigenvectors of the normalized graph Laplacian. This identity shows that characteristic relaxation times and processes of the random walk on the graph are the key concept that governs the properties of these spectral clustering and spectral embedding algorithms. Specifically, for spectral clustering to succeed, a necessary condition is that the mean exit times from each cluster need to be significantly larger than the largest (slowest) of all relaxation times inside all of the individual clusters. For complex, multiscale data, this condition may not hold and multiscale methods need to be developed to handle such situations.

关键词： Relaxation time

来源：评论

学校读者我要写书评

暂无评论

Approximate and Compensate: A method for risk-sensitive meta-deliberation and continual computation

Approximate and Compensate: A method for risk-sensitive meta...

引用

2001 AAAI Fall Symposium

作者： Parkes, David C. Greenwald, Lloyd G. Division of Engineering and Applied Sciences Harvard University CambridgeMA02138 United States Mathematics and Computer Science Drexel University PhiladelphiaPA19104 United States

We present a flexible procedure for a resource-bounded agent to allocate limited computational resources to on-line problem solving. Our APPROXIMATE AND COMPENSATE methodology extends a well-known greedy time-slicing approach to conditions in which performance profiles may be non-concave and there is uncertainty in the environment and/or problem-solving procedures of an agent. With this method, the agent first approximates problem-solving performance and problem parameters with standard parameterized models. Second, the agent computes a risk-management factor that compensates for the risk inherent in the approximation. The risk-management factor represents a mean-variance tradeoff that may be derived optimally off-line using any available information. Theoretical and experimental results demonstrate that APPROXIMATE AND COMPENSATE extends existing methods to new problems and expands the practical application of meta-deliberation. © 2001, AAAI (***). All rights reserved.

关键词： Risk management

来源：评论

学校读者我要写书评

暂无评论

Accounting for deficit and a known demand quantile in ABC-XYZ analysis 6

Accounting for deficit and a known demand quantile in ABC-XY...

引用

6th IEEE International Conference on Logistics Operations Management, GOL 2022

作者： Zenkova, Zhanna Andrievskaya, Anna Tarima, Sergey Institute of Applied Mathematics and Computer Science Tomsk State University Tomsk Russia Institute for Health and Equity Medical College of Wisconsin Division of Biostatistics Milwaukee United States

ISBN: (纸本)9781665469326

Product deficit typically appears as a result of inadequate planning and unforeseen supply chain disruptions. A traditional approach to demand distribution estimation does not account for possible deficit;deficit generates right censored data. If the censoring is ignored, the demand estimation becomes negatively biased. Consequently, all analytics based on the demand distribution also becomes biased. In this article, the well-known survival analysis Kaplan-Meier estimator is applied to demand data with observed deficit. In addition to the reduction of bias associated with the use of the KaplanMeier estimator, we also modify it with a known quantile of the demand distribution. Monte-Carlo simulation studies show that the use of additional information in the presence of censored observations substantially improves estimation quality. The estimators modified with quantile information led to new product grouping in the ABC-XYZ analysis. An illustrative example shows the impact of new estimators on ABC-XYZ grouping. © 2022 IEEE.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：