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

ASYMPTOTIC BEHAVIORS OF SOLUTIONS OF FRUSTRATED NEURAL NETWORKS WITH MCCULLOCH-PITTS NONLINEARITY

Annals of Differential Equations 2003年第3期19卷 352-361页

作者：刘开宇钱祥征张弘强 College of Math. and Econometrics Hunan University Changsha 410082 Dept. of Inform. and Comput. Sci. Changsha Comm. Universiiy Changsha 410076

This paper is concerned with a delay differential equation x=-x + f(y(t-r)), y=-y-f(x(t-r)), where delay r is a positive constant, and f is a signal transmission function of McCulloch-Pitts *** obtain some sufficient and necessary conditions for the asymptotic behavior of network (*) with σ ≤-1 .The results obtained show that the large time behaviors of solutions of (*) are dependent of r if σ= -1. These results improve the corresponding theorems in [3] by removing the restriction of the initial conditions.

关键词： asymptotic behavior delay differential equation osci.lation neural network

来源：评论

学校读者我要写书评

暂无评论

Entropy and the law of small numbers

Entropy and the law of small numbers

引用

IEEE International Symposium on Information Theory

作者： I. Konotoyiannis P. Harremoes Div. of Appl. Math. & Comput. Sci. Dept. Brown Univ. Providence RI USA Department of Mathematics University of Copenhagen København Denmark

In this paper, we give an elementary information theoretic proof of some Poisson approximation inequalities for sums of discrete random variables. These can be thought of as "maximum entropy" statements in that, under suitable conditions, the distribution of the sum converges to the distribution which has "maximal entropy" within an appropriate class. We also outline a general method for obtaining corresponding bounds when approximating the distribution of a sum of general discrete random variables by an infinitely divisible distribution.

关键词： Entropy Random variables Tin Information theory Data processing Calculus US Department of Agriculture math.matics

来源：评论

学校读者我要写书评

暂无评论

Three-phase simulated annealing algorithms for exam scheduling

Three-phase simulated annealing algorithms for exam scheduli...

引用

ACS/IEEE International Conference on comput.r Systems and Applications

作者： N. Mansour A. Tarhini V. Ishakian Computer Science Program Lebanese American University Lebanon Lebanese American University Beirut Beirut LB Comput. Sci. Program Lebanese American Univ. Beirut Lebanon

Summary form only given. Scheduling of final exam usually results in conflicts and inconvenience. Conflicts occur when simultaneous exams are scheduled for the same student, and inconvenience to a student refers to consecutive exams or more than two exams on the same day. A good exam schedule should aim to minimize conflicts and the two inconvenience factors based on weight that are user-assigned to these three factors and subject to some constraints such as the number and capacities of classrooms. Scheduling final exams for large numbers of courses and students in universities is an intractable problem. We decompose the problem into three phases and propose simulated annealing algorithms for these phases. Hence, we refer to our solution methods as 3-phase simulated annealing (3PSA). We empirically compare 3PSA with a 4-phase clustering-based heuristic algorithm using realistic data. Our experimental results show that 3PSA produces good exam schedules, which are better than those of the clustering heuristic procedure.

关键词： Simulated annealing Scheduling algorithm Processor scheduling comput.tional modeling comput.r sci.nce Electronic mail Clustering algorithms Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

More reliable protein NMR peak assignment via improved 2-interval scheduling

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in comput.r sci.nce (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2003年 2832卷 580-592页

作者： Chen, Zhi-Zhong Jiang, Tao Lin, Guohui Rizzi, Romeo Wen, Jianjun Xu, Dong Xu, Ying Dept. of Math. Sci. Tokyo Denki Univ. Hatoyama Saitama 350-0394 Japan Dept. of Comput. Sci. Univ. of California Riverside CA 92521 United States Dept. of Comput. Sci. Univ. of Alberta Edmonton Alta. T6G 2E8 Canada Dipartimento di Informatica e Telecomunicazioni Università di Trento Italy Life Sciences Division Oak Ridge National Lab. Oak Ridge TN 37831 United States

来源：评论

学校读者我要写书评

暂无评论

WETICE 2003 Evaluating Collaborative Enterprises workshop report

WETICE 2003 Evaluating Collaborative Enterprises workshop re...

引用

IEEE International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET ICE)

作者： N. Julian E.M. Raybourn J.P.H. Huang Sch. of Comput. & Math. Sci. Glasgow Caledonian Univ. UK Fraunhofer FIT Sankt Augustin Germany Fraunhofer FIT Sankt Augstin Germany School of Computing and Mathematical Sciences Glasgow Caledonian University Glasgow UK

This paper summarizes the fourth Evaluating Collaborative Enterprises (ECE) workshop, held as part of the 12th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaboration conference (WETICE 2003), at the Johann Keppler University, Linz, Austria. This paper introduces the seven papers presented and summarizes the presentations and ensuing discussions of the participants of the ECE workshop. In addition to the discussions following the papers, a panel session was held. This report sets the scene by summarizing the development of the Evaluation workshops over the past four years, and assesses the current state of practice in Evaluation of Collaborative Enterprises. Paper topics in this workshop addressed evaluation at different stages of the development process and evaluation methodologies at groupware evaluation. Discussion addressed effectiveness measurement, selection of appropriate instruments and different perspectives from group members.

关键词： Collaborative work Software engineering Software performance

来源：评论

学校读者我要写书评

暂无评论

More reliable protein NMR peak assignment via improved 2-interval scheduling

More reliable protein NMR peak assignment via improved 2-int...

引用

11th Annual European Symposium on Algorithms, ESA 2003

作者： Chen, Zhi-Zhong Jiang, Tao Lin, Guohui Rizzi, Romeo Wen, Jianjun Xu, Dong Xu, Ying Dept. of Math. Sci Tokyo Denki Univ Hatoyama Saitama350-0394 Japan Dept. of Comput. Sci Univ. of California RiversideCA92521 United States Dept of Comput Sci Univ of Alberta EdmontonABT6G 2E8 Canada Dipartimento di Informatica e Telecomunicazioni Università di Trento Italy Life Sciences Division Oak Ridge National Lab Oak RidgeTN37831 United States

ISBN: (纸本)3540200649

Protein NMR peak assignment refers to the process of assigning a group of "spin systems" obtained experimentally to a protein sequence of amino acids. The automation of this process is still an unsolved and challenging problem in NMR protein structure determination. Recently, protein backbone NMR peak assignment has been formulated as an interval scheduling problem, where a protein sequence P of amino acids is viewed as a discrete time interval I (the amino acids on P one-to-one correspond to the time units of I), each subset S of spin systems that are known to originate from consecutive amino acids of P is viewed as a "job" jS, the preference of assigning S to a subsequence P of consecutive amino acids on P is viewed as the profit of executing job jS in the subinterval of I corresponding to P, and the goal is to maximize the total profit of executing the jobs (on a single machine) during I. The interval scheduling problem is Max SNP-hard in general. Typically the jobs that require one or two consecutive time units are the most difficult to assign/schedule. To solve these most difficult assignments, we present an efficient (Formula Presented)-approximation algorithm. Combining this algorithm with a greedy filtering strategy for handling long jobs (i.e. Jobs that need more than two consecutive time units), we obtained a new efficient heuristic for protein NMR peak assignment. Our study using experimental data shows that the new heuristic produces the best peak assignment in most of the cases, compared with the NMR peak assignment algorithms in the literature. The (Formula Presented)-approximation algorithm is also the first approximation algorithm for a nontrivial case of the classical (weighted) interval scheduling problem that breaks the ratio 2 barrier. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Amino acids

来源：评论

学校读者我要写书评

暂无评论

Construction of finite-dimensional nonlinear filter via ODEs

Construction of finite-dimensional nonlinear filter via ODEs

引用

American Control Conference (ACC)

作者： S.S.-T. Yau Ning Jing Changlin Yan Department of Mathematics Statistics and Computer Science University of Illinois Chicago Chicago IL USA Department of Mathematics Statistics and Computer Science Chicago IL Army Research Office East China Normal University University of Chicago Chicago IL US Dept. of Math. Stat. & Comput. Sci. Chicago Univ. IL USA Department of Mathematics Statistics and Computer Science Chicago IL USA

Consider the robust Duncan-Mortensen-Zakai (DMZ) equation arising from Yau filtering system which includes Kalman-Bucy filtering system and Benes filtering. The main problem of nonlinear filtering is to solve this robust DMZ equation in real time. It is shown that this equation can be solved explicitly with an arbitrary initial condition by solving a linear system of ODEs and a Kolmogorov-type equation. Furthermore, it is shown that the Kolmogorov-type equation can be solved via the Riccati-type system of ODEs. Thus the robust DMZ equation arising from Yau's filtering system is shown to be solvable in real time.

关键词： Nonlinear filters Filtering Riccati equations Algebra Robustness Nonlinear equations Polynomials Vectors math.matics Statistics

来源：评论

学校读者我要写书评

暂无评论

LEVERRIER-LAGUERRE ALGORITHM FOR THE MATRIX POLYNOMIAL OF DEGREE TWO

引用

Numerical math.matics A Journal of Chinese Universities(English Series) 2002年第2期11卷 226-234页

作者：吴筑筑郑兵王国荣 Dept. of Comput. Dept. of comput. Institute of Math. Sci.

An algorithm for simultaneous comput.tion of the adjoint G(s) and determinant d(s) of the matrix polynomial s2J-sA 1-A 2 is presented, where J is a singular matrix. Both G(s) and d(s) are expressed relative to a basis... 详细信息

关键词： adjoint, determinant, inverse matrix, orthogonal polynomial.

来源：评论

学校读者我要写书评

暂无评论

BM3D: motion estimation in time dependent volume data

BM3D: motion estimation in time dependent volume data

引用

IEEE Conference on Visualization

作者： W. de Leeuw R. van Liere Center for Math. & Comput. Sci. CWI Amsterdam Netherlands Center for Mathematics and Computer Science CWI Amsterdam Netherlands

This paper describes BM3D: a method for the analysis of motion in time dependent volume data. From a sequence of volume data sets a sequence of vector data sets representing the movement of the data is comput.d. A block matching technique is used for the reconstruction of data movement. The derived vector field can be used for the visualization of time dependent volume data. The method is illustrated in two applications.

关键词： Motion estimation Data visualization Optical mixing Image motion analysis Video compression comput.r graphics Optical comput.ng math.matics comput.r sci.nce Motion analysis

来源：评论

学校读者我要写书评

暂无评论

Spontaneous branching of negative streamers

Spontaneous branching of negative streamers

引用

IEEE International Conference on Plasma sci.nce (ICOPS)

作者： U. Ebert M. Arrayas A. Rocco W. Hundsdorfer Universiteit van Amsterdam Amsterdam Noord-Holland NL Center for Math. & Comput. Sci. Amsterdam Univ. Netherlands

Summary form only given, as follows. Non-ionized media subject to strong electric fields can become ionized by penetrating streamers: rapidly extending space charge dominated, nonlinear structures. We study negative streamers in homogeneous fields in a simple mean field approximation for the reaction-drift-diffusion process. In our simulations, we observe that for sufficiently large fields. the streamer tip can split spontaneously. We discuss that this happens at a certain stage in which the streamer becomes susceptible to a Laplacian instability quite like viscous fingers. For further analytical progress, our stability analysis of ionization fronts identifies the screening length as a regularization mechanism. We also discuss experiments and compare with stochastic dielectric breakdown models.

关键词： Streaming media Space charge Laplace equations Fingers Stability analysis Ionization Stochastic processes Dielectric breakdown

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：