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

Conference of the North American Fuzzy Information Processing Society - NAFIPS

作者： S. Moazeni Applied Math Department of Mathematics and Computer Science Tehran Polytechnic Amirkabir University of Technology슠 Tehran Iran

We discuss the problem of finding the shortest paths from a fixed origin to all nodes on a network not necessarily acyclic, with each arc length represented as positive fuzzy quantity with finite support. At first, we show that the only existing paper on this problem, Klein's algorithm, in some cases lead to a dominated path in the sense of extension principle and then we introduce a new algorithm for the problem. The proposed algorithm is on the basis of the multiple labeling methods of Hansen and Dijkstra's shortest path algorithm.

关键词： Shortest path problem Fuzzy sets Labeling mathematics computer science Costs Set theory Terminology

来源：评论

学校读者我要写书评

暂无评论

XP/Agile education and training

XP/Agile education and training

引用

6th International Conference on Extreme Programming and Agile Processes in Software Engineering

作者： Martin, A Fraser, S Davies, R Holcombe, M Mugridge, R Pierce, D Poppendieck, T Succi, G Qualcomm's Learning Center Victoria University of Wellington New Zealand Agile Experience Ltd. Department of Computer Science University of Sheffield United Kingdom British Computer Society Inst. Math. and Its Applications United Kingdom Extreme Tuesday Club (XTC) Department of Tenure Free University of Bolzano Bozen Italy Center for Applied Software Engineering Italy

ISBN: (纸本)3540262776

XP/Agile education and training remains a challenge from the perspective of determining relevant content;identifying effective methods for delivery;and maintaining the focus and motivation of students. This panel brings together academic and industry professionals to share their perspectives and experiences. Anticipated points for discussion include: education/training delivery strategies, curriculum definition, certification challenges, marketing issues, collaboration strategies to engage industry sponsorship, value assessments for students and sponsoring organizations, and program success stories. This will be a highly interactive panel and the audience should come prepared to both ask and answer questions. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Education

来源：评论

学校读者我要写书评

暂无评论

Counting Homomorphisms to Sparse Graphs

引用

Electronic Notes in Discrete mathematics 2009年 34卷 393-397页

作者： Nešetřil, Jaroslav de Mendez, Patrice Ossona Department of Applied Mathematics Institute for Theoretical Computer Science Charles University Prague Czech Republic Centre d'Analyse et de Mathématique Sociales C.N.R.S. E.H.E.S.S. Paris France

We define nowhere dense and somewhere dense classes by means of counting of homomorphisms from test graphs. This seems to be bridging the gap between existential and counting theorems (for graph homomorphisms) and it ... 详细信息

关键词： boolean query counting graph homomorphism nowhere dense class tree-depth

来源：评论

学校读者我要写书评

暂无评论

Dynamic and recursive oil-reservoir proxy using Elman neural networks

Dynamic and recursive oil-reservoir proxy using Elman neural...

引用

2016 IEEE ANDESCON, ANDESCON 2016

作者： Tupac, Yvan Talavera, Alvaro Rivero, Cristian Rodriguez Computer Science School Universidad Católica San Pablo Arequipa Peru Department of Engineering Universidad Del Pacífico Lima Peru Math Research Laboratory Applied to Control Universidad Nacional de Córdoba Córdoba Argentina

ISBN: (纸本)9781509025312

In this work, a reservoir simulation approximation model (proxy) based on recurrent artificial neural networks is proposed. This model is intended to obtain rates of oil, gas and water production at time t+1 from the respective production rates, average pressure and water cut at t time and the well operation points to be applied in t + 1. Also, this model is able to follow the dynamics of the reservoir system applying online learning from real production observed values. Also, this model allows perform fast and accurate production forecasting for several steps using a recursive mechanism. This model will be inserted into an oil-production control tool to find the optimal operation conditions within a forecast horizon. The obtained outcomes over the approximation tests indicate the methodology is adequate to perform production forecasts. © 2016 IEEE.

关键词： Production control

来源：评论

学校读者我要写书评

暂无评论

Arbitrary source models and Bayesian codebooks in rate-distortion theory

Arbitrary source models and Bayesian codebooks in rate-disto...

引用

IEEE International Symposium on Information Theory

作者： L. Kontoyiannis Junshan Zhang Division of Applied Math & Department of Computer Science Brown University USA Department of Electrical Engineering Arizona State University USA

We give a development of universal lossy data compression based on a lossy version of the Kraft inequality. As an application, we evaluate the performance of universal mixture codebooks.

关键词： Bayesian methods Rate-distortion Distortion measurement Decoding World Wide Web Loss measurement computer science Data compression Application software Probability distribution

来源：评论

学校读者我要写书评

暂无评论

Model based corner detection

Model based corner detection

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： C.M. Orange F.C.A. Groen Department of Applied Physics Technical University Delft Delft Netherlands Department of Math and Computer Science University of Amsterdam Amsterdam Netherlands

A method is presented to correct an approximate polygonal sketch of an image object boundary by adjusting the location of each corner point in the sketch. The method is suitable for the segmentation of unknown images using interactive techniques, and for locating object boundaries in model-based segmentation. For each point, p, at which two lines meet in an open or closed polygonal sketch, a corner segmentation model is derived based on the angle, orientation and scale of the corner defined, and the image function f(x, y) in the immediate region about p. A corner template is then constructed and matched in a small neighborhood about p, thereby providing a corrected polygonal sketch. The segmentation model is correct in 95% of the cases, and the corner is accurately located.< >

关键词： Image segmentation Shape Object detection Physics Humans Hardware Detectors Solid modeling Particle measurements computer science

来源：评论

学校读者我要写书评

暂无评论

Recognition and localization of articulated objects

Recognition and localization of articulated objects

引用

IEEE Workshop on Motion of Non-Rigid and Articulated Objects

作者： Y. Hel-Or M. Werman Department of Applied Math. Weizmann Institute of Science Rehovot Israel Institute for Computer Science Hebrew University of Jerusalem Jerusalem Israel

Presents a method for the localization and interpretation of modeled objects that is general enough to cover articulated and other types of constrained models. The flexibility between components of the model are expressed as spatial constraints which are fused into the pose estimation during the interpretation process. The constraint fusion assists in obtaining a precise and stable pose of each object's component and in finding the correct interpretation. The proposed method can handle any constraint (including inequalities) between any number of different components of the model. The framework is based on Kalman filtering.< >

关键词： Kalman filters Filtering Object recognition Tracking Robot sensing systems Navigation Motion detection computer science Linearity Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Approximating Equilibria in Sequential Auctions with Incomplete Information and Multi-Unit Demand 12

Approximating Equilibria in Sequential Auctions with Incompl...

引用

Annual Conference on Neural Information Processing Systems

作者： Amy Greenwald Jiacui Li Eric Sodomka Department of Computer Science Brown University Providence RI 02912 Department of Applied Math/Economics Brown University Providence RI 02912

ISBN: (纸本)9781627480031

In many large economic markets, goods are sold through sequential auctions. Examples include eBay, online ad auctions, wireless spectrum auctions, and the Dutch flower auctions. In this paper, we combine methods from game theory and decision theory to search for approximate equilibria in sequential auction domains, in which bidders do not know their opponents' values for goods, bidders only partially observe the actions of their opponents', and bidders demand multiple goods. We restrict attention to two-phased strategies: first predict (i.e., learn); second, optimize. We use best-reply dynamics [4] for prediction (i.e., to predict other bidders' strategies), and then assuming fixed other-bidder strategies, we estimate and solve the ensuing Markov decision processes (MDP) [18] for optimization. We exploit auction properties to represent the MDP in a more compact state space, and we use Monte Carlo simulation to make estimating the MDP tractable. We show how equilibria found using our search procedure compare to known equilibria for simpler auction domains, and we approximate an equilibrium for a more complex auction domain where analytical solutions are unknown.

关键词： Markov chain cargo multicell Sequential Decision Theory Game theory state space Monte Carlo technique

来源：评论

学校读者我要写书评

暂无评论

Heuristics for finding large independent sets, with applications to coloring semi-random graphs

Heuristics for finding large independent sets, with applicat...

引用

Annual IEEE Symposium on Foundations of computer science

作者： U. Feige J. Kilian Department of Applied Math and Computer Science Weizmann Institute of Science Rehovot Israel NEC Research Institute Inc. Princeton NJ USA

We study a semi-random graph model for finding independent sets. For /spl alpha/>0, an n-vertex graph with an independent set S of site /spl alpha/n is constructed by blending random and adversarial decisions. Randomly and independently with probability p, each pair of vertices, such that one is in S and the other is not, is connected by an edge. An adversary can then add edges arbitrarily (provided that S remains an independent set). The smaller p is, the larger the control the adversary has over the semi-random graph. We design heuristics that with high probability recover S when p>(1+/spl epsiv/)ln n/|S|, for any constant /spl epsiv/>0. We show that when p

关键词： Electronic switching systems National electric code computer science Career development Polynomials Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Natural and adversarial error detection using invariance to image transformations

arXiv

引用

arXiv 2019年

作者： Bahat, Yuval Irani, Michal Shakhnarovich, Gregory Department of Applied Math and Computer Science Weizmann Institute of Science Rehovot Israel Toyoyta Technological Institute at Chicago ChicagoIL United States

We propose an approach to distinguish between correct and incorrect image classifications. Our approach can detect misclassifications which either occur unintentionally ("natural errors"), or due to intentional adversarial attacks ("adversarial errors"), both in a single unified framework. Our approach is based on the observation that correctly classified images tend to exhibit robust and consistent classifications under certain image transformations (e.g., horizontal flip, small image translation, etc.). In contrast, incorrectly classified images (whether due to adversarial errors or natural errors) tend to exhibit large variations in classification results under such transformations. Our approach does not require any modifications or retraining of the classifier, hence can be applied to any pre-trained classifier. We further use state of the art targeted adversarial attacks to demonstrate that even when the adversary has full knowledge of our method, the adversarial distortion needed for bypassing our detector is no longer imperceptible to the human eye. Our approach obtains state-of-the-art results compared to previous adversarial detection methods, surpassing them by a large margin. Copyright © 2019, The Authors. All rights reserved.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：