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

International Joint Conference on Neural Networks (IJCNN)

作者： S. Edelman H.H. Bulthoff Department of Applied Mathematics and Computer Science Weizmann Institute of Science Rehovot Israel Dept. of Appl. Math. & Comput. Sci. Weizmann Inst. of Sci. Rehovot Israel

The topics discussed here are network models of object recognition; a computational theory of recognition; psychophysical support for a view-interpolation model: and an open issue, features of recognition. The authors survey a successful replication of central characteristics of performance in 3-D object recognition by a computational model based on interpolation among a number of stored views of each object. Network models of 3-D object recognition based on interpolation among specific stored views behave in several respects similarly to human observers in a number of recognition tasks. Even closer replication of human performance in recognition should be expected, once the issue of the features used to represent object views is resolved.< >

关键词： Humans Object recognition Image recognition computer networks Biology computing mathematics computer science mathematical model Interpolation Image resolution

来源：评论

学校读者我要写书评

暂无评论

Data-intensive spatial filtering in large numerical simulation datasets 12

Data-intensive spatial filtering in large numerical simulati...

引用

Supercomputing Conference

作者： Kalin Kanov Randal Burns Greg Eyink Charles Meneveau Alexander Szalay Department of Computer Science Johns Hopkins University USA Department of Applied Math and Statistics Johns Hopkins University USA Department of Mechanical Engineering Johns Hopkins University USA Department of Physics and Astronomy Johns Hopkins University USA

ISBN: (纸本)9781467308045

We present a query processing framework for the efficient evaluation of spatial filters on large numerical simulation datasets stored in a data-intensive cluster. Previously, filtering of large numerical simulations stored in scientific databases has been impractical owing to the immense data requirements. Rather, filtering is done during simulation or by loading snapshots into the aggregate memory of an HPC cluster. Our system performs filtering within the database and supports large filter widths. We present two complementary methods of execution: I/O streaming computes a batch filter query in a single sequential pass using incremental evaluation of decomposable kernels, summed volumes generates an intermediate data set and evaluates each filtered value by accessing only eight points in this dataset. We dynamically choose between these methods depending upon workload characteristics. The system allows us to perform filters against large data sets with little overhead: query performance scales with the cluster's aggregate I/O throughput.

关键词： Kernel Computational modeling mathematical model Numerical simulation Spatial databases Numerical models

来源：评论

学校读者我要写书评

暂无评论

INFLUENCE OF THE DISCRETIZATION STEP ON THE POSITIVITY OF CONFORMABLE FRACTIONAL LINEAR SYSTEMS

引用

UPB Scientific Bulletin, Series A: applied mathematics and Physics 2023年第1期85卷 77-86页

作者： Benuettou, Kamel Ghezzar, Mohammed Amine Bougada, Djillali Abdelhamid Ibn Badis University Mostaganem ACSY Team-Laboratory of Pure and Applied Math-ematics Department of Mathematics and Computer Science Faculty SEI BP 227/118 Mostaganem27000 Algeria National Higher School of Mathematics ACSY Team-Laboratory of Pure and Applied Mathematics Algeria

The effectiveness of this work lies in the influence of the discretization step on the positivity of the one-dimensional conformable fractional linear systems. A piecewise constant approximation method which converts a continuous fractional order derivative into a discrete time equation is presented as an alternative approach. It aims at investigating whether, how and when this step affects the positive continuous times models. To accomplish this research, a new test was developed and implemented in which the positivity conditions of the considered system was examined both before and after being exposed to the sampling step. i.e., under which conditions the one-dimensional discrete-time linear system obtained by discretization from the one-dimensional continuous time linear systems will be also positive if the one-dimensional continuous time linear system is positive. The new method presented is suggested to test the influence of the discretization step on the positivity of this class of systems. Finally, we discuss some numerical examples to illustrate the validity of the provided results. © 2023, Politechnica University of Bucharest. All rights reserved.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

Energy grid management system with anomaly detection and Q-learning decision modules

引用

computers and Electrical Engineering 2023年 107卷

作者： Syu, Jia-Hao Srivastava, Gautam Fojcik, Marcin Cupek, Rafal Lin, Jerry Chun-Wei Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan Department of Mathematics and Computer Science Brandon University Brandon Canada Research Center for Interneural Computing China Medical University Taichung Taiwan Department of Computer Science and Math Lebanese American University Beirut Lebanon Department of Computer Science Electrical Engineering and Mathematical Sciences Western Norway University of Applied Sciences Bergen Norway Department of Distributed Systems and Informatic Devices Silesian University of Technology Gliwice Poland

Stability and security issues in energy management have become widespread research topics, in which artificial intelligence techniques are often embedded in management systems to efficiently manage the smart grid. In this paper, we propose an energy grid management system with anomaly detection and Q-learning decision modules (EMSAD). The anomaly detection module is a multitask learning network that simultaneously classifies suppliers and predicts actual supply quantities. The Q-learning decision module then determines the operating reserve and subsidies to manage the energy grid. Experimental results show that the proposed anomaly detection module has an excellent performance in classifying malicious suppliers with F1-scores from 73.3% to 100.0%. The robustness evaluation also shows that EMSAD maintains high performance even in unseen environments without fine-tuning. Thus, the simulation results demonstrate the security, efficiency, transferability, and robustness of the proposed EMSAD in smart grid energy management. © 2023 Elsevier Ltd

关键词： Energy management

来源：评论

学校读者我要写书评

暂无评论

Generalized paths and cycles in semicomplete multipartite digraphs

arXiv

引用

arXiv 2024年

作者： Bang-Jensen, Jørgen Wang, Yun Yeo, Anders Dept. of Math. and Computer Science University of Southern Denmark Odense Denmark Dept. of Math. and Computer Science University of Southern Denmark Odense Denmark School of Mathematics Shandong University Jinan250100 China Department of Mathematics and Applied Mathematics University of Johannesburg Auckland Park2006 South Africa

A digraph is semicomplete if it has no pair of non-adjacent vertices. It is complete if every pair of distinct vertices induce a 2-cycle. It is well-known and easy to show that even the following version of the directed travelling salesman problem is NP-complete: Given a strongly connected complete digraph D = (V, A), a cost function w: A → {0, 1} and a natural number K;decide whether D has a directed Hamiltonian cycle of cost at most K. We study the following variant of this problem for {0, 1}-weighted semicomplete digraphs where the set of arcs which have cost 1 form a collection of vertex-disjoint complete digraphs. A digraph is semicomplete multipartite if it can be obtained from a semicomplete digraph D by choosing a collection of vertex-disjoint subsets X1, . . ., Xc of V (D) and then deleting all arcs both of whose end-vertices lie inside some Xi. Let D be a semicomplete digraph with a cost function w as above, where w(a) = 1 precisely when a is an arc inside one of the subsets X1, . . ., Xc and let D∗ be the corresponding semicomplete multipartite digraph that we obtain by deleting all arcs inside the Xi’s. Then every cycle C of D corresponds to a generalized cycle Cg of D∗ which is either the cycle C itself if w(C) = 0 or a collection of two or more paths that we obtain by deleting all arcs of cost 1 on C. Similarly we can define a generalized path P g in a semicomplete multipartite digraph. The purpose of this paper is to study structural and algorithmic properties of generalized paths and cycles in semicomplete multipartite digraphs. This allows us to identify classes of directed {0, 1}-weighted TSP instances that can be solved in polynomial time as well as others for which we can get very close to the optimum in polynomial time. Along with these results we also show that two natural questions about properties of cycles meeting all partite sets in semicomplete multipartite digraphs are *** Codes 05C20, 05c38, 05c45, 05c85 © 2024, CC BY.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Good Quantum LDPC Codes with Linear Time Decoders

arXiv

引用

arXiv 2022年

作者： Dinur, Irit Hsieh, Min-Hsiu Lin, Ting-Chun Vidick, Thomas Department of Applied Math and Computer Science The Weizmann Institute of Science Hong Hai Research Institute Taipei Taiwan Department of Physics University of California San DiegoCA United States Department of Computing and Mathematical Sciences California Institute of Technology CA United States

We construct a new explicit family of good quantum low-density parity-check codes which additionally have linear time decoders. Our codes are based on a three-term chain pFm2*mqV ÝÑ δ0 pFm2 qE ÝÑ δ1 FF2 where V (X-checks) are the vertices, E (qubits) are the edges, and F (Z-checks) are the squares of a left-right Cayley complex, and where the maps are defined based on a pair of constant-size random codes CA, CB: Fm2 Ñ F∆2 where ∆ is the regularity of the underlying Cayley graphs. One of the main ingredients in the analysis is a proof of an essentially-optimal robustness property for the tensor product of two random codes. © 2022, CC BY.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

Minimal-cut model composition

Minimal-cut model composition

引用

International Conference on Shape Modeling and Applications

作者： T. Hassner L. Zelnik-Manor G. Leifman R. Basri Department of Computer Science & Applied Math Weizmann Institute of Science Rehovot Israel Faculty of Electrical Engineering California Institute of Technology Pasadena CA USA Faculty of Electrical Engineering Technion-Israel Institute of Technology Haifa Israel

Constructing new, complex models is often done by reusing parts of existing models, typically by applying a sequence of segmentation, alignment and composition operations. Segmentation, either manual or automatic, is rarely adequate for this task, since it is applied to each model independently, leaving it to the user to trim the models and determine where to connect them. In this paper we propose a new composition tool. Our tool obtains as input two models, aligned either manually or automatically, and a small set of constraints indicating which portions of the two models should be preserved in the final output. It then automatically negotiates the best location to connect the models, trimming and stitching them as required to produce a seamless result. We offer a method based on the graph theoretic minimal cut as a means of implementing this new tool. We describe a system intended for both expert and novice users, allowing easy and flexible control over the composition result. In addition, we show our method to be well suited for a variety of model processing applications such as model repair, hole filling, and piecewise rigid deformations.

关键词： Deformable models Application software computer graphics computer science Control systems Filling Horses Leg Shape Face

来源：评论

学校读者我要写书评

暂无评论

Robust statistics for image deconvolution

arXiv

引用

arXiv 2017年

作者： Lee, Matthias A. Budavári, Tamás White, Richard L. Gulian, Charles Department of Computer Science Johns Hopkins University BaltimoreMD21218 United States Department of Applied Math and Statistics Johns Hopkins University BaltimoreMD21218 United States Space Telescope Science Institute BaltimoreMD21218 United States

We present a blind multiframe image-deconvolution method based on robust statistics. The usual shortcomings of iterative optimization of the likelihood function are alleviated by minimizing the M-scale of the residuals, which achieves more uniform convergence across the image. We focus on the deconvolution of astronomical images, which are among the most challenging due to their huge dynamic ranges and the frequent presence of large noise-dominated regions in the images. We show that high-quality image reconstruction is possible even in super-resolution and without the use of traditional regularization terms. Using a robust ρ-function is straightforward to implement in a streaming setting and, hence our method is applicable to the large volumes of astronomy images. The power of our method is demonstrated on observations from the Sloan Digital Sky Survey (Stripe 82) and we briefly discuss the feasibility of a pipeline based on Graphical Processing Units for the next generation of telescope surveys. Copyright © 2017, The Authors. All rights reserved.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Graph Fourier MMD for Signals on Graphs

Graph Fourier MMD for Signals on Graphs

引用

2023 International Conference on Sampling Theory and Applications, SampTA 2023

作者： Leone, Samuel Venkat, Aarthi Huguet, Guillaume Tong, Alexander Wolf, Guy Krishnaswamy, Smita Applied Math Program New HavenCT United States Yale University Computational Biology & Bioinformatics Program New HavenCT United States Université de Montréal Mila - Quebec Ai Institute Dept. of Math. & Stat Montreal Canada Université de Montréal Mila-Quebec Ai Institute Dept. of Comp. Sci. & Oper. Res. Montreal Canada Yale University Department of Computer Science Department of Genetics New HavenCT United States

ISBN: (纸本)9798350328851

While numerous methods have been proposed for computing distances between probability distributions in Euclidean space, relatively little attention has been given to computing such distances for distributions on graphs. However, there has been a marked increase in data that either lies on graph (such as protein interaction networks) or can be modeled as a graph (single cell data), particularly in the biomedical sciences. Thus, it becomes important to find ways to compare signals defined on such graphs. Here, we propose Graph Fourier MMD (GFMMD), a novel distance between distributions and signals on graphs. GFMMD is defined via an optimal witness function that is both smooth on the graph and maximizes the difference in expectation between the pair of distributions on the graph. We find an analytical solution to this optimization problem as well as an embedding of distributions that results from this method. We also prove several properties of this method including scale invariance and applicability to disconnected graphs. We showcase it on graph benchmark datasets as well on single cell RNA-sequencing data analysis. In the latter, we use the GFMMD-based gene embeddings to find meaningful gene clusters. We also propose a novel type of score for gene selection called gene localization score which helps select genes for cellular state space characterization. © 2023 IEEE.

关键词： Genes

来源：评论

学校读者我要写书评

暂无评论

AN AFFINE INVARIANT EULIDEAN DISTANCE BETWEEN IMAGES

AN AFFINE INVARIANT EULIDEAN DISTANCE BETWEEN IMAGES

引用

2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

作者： MELODY Z.W.LIAO JUN-YAN WANG WU-FAN CHEN YUAN Y.TANG School of Applied Math University of Electronic Science and Technology of China Key Lab of Medical School of Communication & Information Engineering University of Electronic Science and Technology o Key Lab of Medical Imaging School of Biomedical Engineering Southern Medical University Guangzhou School of Computer Science Chongqing University Department of Computer Science Hong Kong Baptist U

In this paper, we propose a novel affine invariant Eulidean Distance of images, named annulus Eulidean Distance (AED). Unlike the traditional Eulidean distance, the AED takes into account the spatial correlation between ***, it is invariant to the scale, rotation and shift transformation for images. The method is motivated that the annulus is intuitively rotation invariant, then combined with the centralization and normalization of the images, the AED is variant to affine transformation (AT). The key advantage of this distance is that it is a simple and tractable way to measure the difference between images with some deformations. Some examples in Optical Character Recognition (OCR) and Texture Retrieval are presented to show the power of the *** results demonstrate that the AED is a simple,efficient and powerful way to measure the difference between images.

关键词： Annulus Eulidean distance Eulidean distance (ED) optical character recognition texture retrieval image metric

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：