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

6th International Conference on Neural Information Processing, ICONIP 1999

作者： Veliev, Raouf Rubinov, Alex Stranieri, Andrew Sch. of Inf. Technol. and Math. Sci. Ballarat Univ. VIC Australia Donald Berman Laboratory for Information Technology and Law Department of Computer Science and Computer Engineering La Trobe Univ. BundooraVIC Australia

ISBN: (纸本)0780358716

Knowledge discovery techniques have not been widely used with macroeconomic data despite the social and political importance inherent in accurate economic forecasting. Rather, economic forecasting is currently performed with the use of models that rely heavily on theoretical assumptions. Economic assumptions are invariably contentious and model predictions are often rejected or accepted based on subjective perceptions about assumptions. We present an application of KDD (knowledge discovery in databases) that generates a forecasting model that avoids economic assumptions by focusing entirely on existing data. Although association rules are typically used for finding interesting patterns in data, this is not a strategy we employed. Our approach differs in that all possible association rules between variables representing the current state of an economy in a quarter and the state in the next quarter are generated to form a matrix. A metric based on the support, confidence and expected probability of each rule is then derived. The system has been used to perform economic analyses of existing and future government policies. The system has been developed using data from the US economy over the last 30 years. © 1999 IEEE.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

Comparative study of the algorithms for the weighted rectilinear min-sum facility location problem

Comparative study of the algorithms for the weighted rectili...

引用

International Conference on Computational Intelligence and Software Engineering

作者： Wang, Xiaodong Wang, Lei Wu, Yingjie College of Math. and Computing Quanzhou Normal University Quanzhou 362000 China College of Computing Georgia Institute of Technology Atlanta GA 30332 United States Computer Science Department Fuzhou University Fuzhou 350002 China

ISBN: (纸本)9781424453924

Given a set of n points in Rd with nonnegative weights, we consider the weighted rectilinear min-sum facility problem to minimize the sum of weighted rectilinear distance between the given points and a new added point. We present four simple algorithms for the weighted rectilinear min-sum facility location problem. The computational experiments demonstrate that the achieved results are not only of theoretical interest, but also that the techniques developed may actually lead to considerably faster algorithms. ©2010 IEEE.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Flip Graphs of Bounded-Degree Triangulations

引用

Electronic Notes in Discrete math.matics 2009年 34卷 509-513页

作者： Aichholzer, O. Hackl, T. Orden, D. Ramos, P. Rote, G. Schulz, A. Speckmann, B. Institute for Software Technology TU Graz Austria Dep. de Matemáticas Univ. de Alcalá Spain Institut für Informatik Freie Universität Berlin Germany Computer Science Department Smith College United States Dep. of Math. and Computer Science TU Eindhoven Netherlands

We study flip graphs of triangulations whose maximum vertex degree is bounded by a constant k. Specifically, we consider triangulations of sets of n points in convex position in the plane and prove that their flip graph is connected if and only if k > 6;the diameter of the flip graph is O (n ²). We also show that for general point sets, flip graphs of triangulations with degree ≤k can be disconnected for any k. © 2009 Elsevier B.V. All rights reserved.

关键词： degree bound flip graph flipping distance triangulation

来源：评论

学校读者我要写书评

暂无评论

Formalizing UML Models and OCL Constraints in PVS

Formalizing UML Models and OCL Constraints in PVS

引用

作者： Kyas, Marcel Fecher, Harald De Boer, Frank S. Jacob, Joost Hooman, Jozef Van Der Zwaag, Mark Arons, Tamarah Kugler, Hillel Inst. for Comp. Sci. and Appl. Math. Chrstn.-Albrechts-Univ. Zu Kiel Germany CWI Amsterdam Netherlands Computer Science Department University of Nijmegen Netherlands Weizmann Institute of Science Rehovot Israel

The Object Constraint Language (OCL) is the established language for the specification of properties of objects and object structures in UML models. One reason that it is not yet widely adopted in industry is the lack of proper and integrated tool support for OCL. Therefore, we present a prototype tool, which analyzes the syntax and semantics of OCL constraints together with a UML model and translates them into the language of the theorem prover PVS. This defines a formal semantics for both UML and OCL, and enables the formal verification of systems modeled in UML. We handle the problematic fact that OCL is based on a three-valued logic, whereas PVS is only based on a two valued one. © 2004 Elsevier B.V.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

A novel optimized subdivision algorithm for modeling and animation

A novel optimized subdivision algorithm for modeling and ani...

引用

Proceedings of the Fifteenth IASTED Internatinal Conference on Modeling and Simulation

作者： El-Zahar, Mohamed H. Hussein, Hussein Karam Ghaleb, Fayed M. Abd El-Latif, Yasser M. Ain Shams University Faculty of Science Math. and Comp. Sc. Dept. Abbassia Cairo Egypt University of Bahrain College of Information Technology Department of Computer Science Isa Town P.O. Box 32038 Manama

Subdivision surfaces are rapidly gaining popularity in computer graphics, modeling, simulation and animation. Existing of subdivision algorithms is suffer from the lack of precise definition of the schemes with guaranteed behavior for a sufficiently general type of control meshes, non-smoothness due to the existence of regular and non-regular face types during the subdivision process and incapability of optimizing mesh subdivision up to user-controlled criteria. This paper proposes a new algorithm for unifying surface types and optimizing the surface continuity consequently increases the smoothness of the generated mesh surface. Comparisons with existing techniques are included;advantages of our proposed technique over previous algorithms are examined. Our approach is supported by discussions and illustrations of some experimental results.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

The Reproducibility Assessment of Black-White Pixels Ratio In Transcranial B-images of Medial Temporal Lobe in Application for Detectable Feature of Alzheimer’s Disease

The Reproducibility Assessment of Black-White Pixels Ratio I...

引用

International Conference on Biomedical Innovations and Applications (BIA)

作者： Jiri Blahuta Tomas Soukup The Institute of Computer Science Silesian University in Opava Opava Czech Republic Computer Science and Applied Math. Moravian Business College Olomouc Olomouc Czech Republic

ISBN: (数字)9781728170732

ISBN: (纸本)9781728170749

The aim of this paper is analysis the black-white pixels ratio in medial temporal lobe (MTL) brain structure in digitized transcranial B-images using own developed software BMODE Assist. This ratio could be a corresponding marker with the echogenicity grade. In transcranial sonography, the MTL in B-image is anechogenic structure but increased echogenicity of surrounding cortex is detectable in the case of MTL atrophy which predicts Alzheimer's Disease. Totally of 97 B-images were analyzed. The goal is to verify the reproducibility in two. Firstly, between two observers and to show that the ratio is not significantly different between original image and a magnified segment. In parallel in the case of constant brightness increasing. The ratio should be independent on image resolution and brightness. To select MTL, a 20mm square-shaped Region of Interest is used. The correlation coefficient r =0.69 was achieved between two independent, non-experienced observers. Between two non-experienced observers the error of 27.95 % was achieved and between the measurements from the same observer the error was only 11.2 %. Meanwhile, the variance and the range were computed, both almost equal. These results have been judged by an experienced sonographer. In the future, the ratio could be an usable value to determine the MTL atrophy risk using the ratio value and possibility to create a rule-based expert system as a software tool to evaluate probability of Alzheimer's Disease using transcranial sonography.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Web-based Procurement New Roles for Intermediaries

引用

Information Systems Frontiers 2000年第1期2卷 19-30页

作者： Klein, Stefan Teubner, Rolf Alexander Department of Information Systems University of Muenster D-48149 Muenster Steinfurter Strasse 109 Germany University of Koblenz Landau Germany Gesell. fur Math. Datenverarbeitung Natl. Res. Ctr. for Computer Science Cologne Germany

The electronic markets vs. electronic hierarchies debate initiated by (Malone et al. 1987) has been superseded by the discussion about dis- or reintermediation in the electronic marketplace. Many of the arguments given for either side are equally correct - because the arguments have been applied to different domains in different situations from specific perspectives - and yet the debate falls short of covering the complexity and dynamics of the ongoing market structure change. The goal of this paper is therefore to develop a more differentiated framework that facilitates the understanding of chances and threats resulting from inter- and cybermediation. The framework suggests to distinguish roles, opportunities and threats for cybermediaries in different situations. While the framework is meant to structure the debate in general, we will focus on public sector procurement to show its application.

关键词： Cybermediary Cybermediation Dis- Electronic procurement Hierarchy Intermediary Market Network Public procurement Re-

来源：评论

学校读者我要写书评

暂无评论

The Black-White Pixels Ratio in Medial Temporal Lobe Brain Structure in Transcranial B-Images as a Measurable Marker of Alzheimer’s Disease Probability: The Reproducibility Overview

The Black-White Pixels Ratio in Medial Temporal Lobe Brain S...

引用

International Conference on Software, Telecommunications and computer Networks (SoftCOM)

作者： Jiri Blahuta Tomas Soukup Lukas Pavlik Computer Science and Applied Math. Moravian Business College Olomouc Olomouc Czech Republic Computer Science and Informatics Silesian University in Opava Opava Czech Republic

ISBN: (数字)9789532900996

ISBN: (纸本)9781728175386

The objective of the presented study is to introduce analysis the black-white pixels ratio in medial temporal lobe (MTL) brain structure in digitized transcranial B-images using our developed software B-MODE Assist. This ratio could be a significant marker related to the echogenicity grade. In B-image, the MTL is stable anechogenic structure but increased echogenicity of surrounding cortex is detectable in the case of MTL atrophy; the atrophy predicts Alzheimer's Disease. Within this study, a set of 97 B-images is used. There are two key goals of this pilot study; verify the reproducibility of the ratio between two observers and to show that the ratio is not much different in the case of original image in comparison with a magnified segment and using constant brightness increasing; the ratio should be independent on image resolution and brightness. To select medial temporal lobe structure, a 20mm square-shaped Region of Interest is used. The correlation coefficient r=0.69 was achieved between two independent, non-experienced observers. The error does not exceed 28 % between 2 non-experienced observers and does not exceed 12 % between the measurements from the same observer. Also, the variance and the range were computed. Achieved results have been judged by an experienced sonographer. In the future, the ratio could be an effective value to determine the MTL atrophy based on the ratio value and possibility to create a rule-based expert system which should help evaluate probability of Alzheimer's Disease based on the cortex echogenicity grade. In general, this approach could be a reliable way to detect risk of Alzheimer's Disease using neurosonological imaging.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Hot-potato worm routing is almost as easy as store-and-forward packet routing

Hot-potato worm routing is almost as easy as store-and-forwa...

引用

Israel Symposium on the Theory of Computing and Systems

作者： I. Newman A. Schuster Math. and Computer Sci. Haifa University Computer Science Department Technion-Israel Institute of Technology Israel

The theory of worm routing (rather than packet routing) recently attracts an increased attention as an abstraction of the underlying communication mechanisms in many parallel machines. Routing the worms in the hot-potato style is a desired form of communication in high-speed optical interconnection networks. The authors develop a simple method for the design of parallel hot-potato worm routing algorithms. The basic approach is to simulate known packet routing algorithms, so that in each step worms are moved around instead of packets. For hot-potato permutation routing of worms of size k the authors have the following results. They get a O(k/sup 2.5/n) algorithm for the n*n mesh, and a O(k/sup 1.5/n) algorithm for the corresponding offline problem. For the 2/sup n/-nodes hypercube they get a O(k/sup 3/n log /sup 2/n) deterministic algorithm, and a O(k/sup 3/n) randomized algorithm. Although the results are given for permutation routing on the mesh and the hypercube, the general method can be applied to many other networks and to more general communication patterns as well. Moreover, once better routing algorithms are found for the underlying network, the worm routing algorithm improves, too.< >

关键词： Routing computer worms Parallel machines Optical interconnections Hypercubes Algorithm design and analysis computer networks Concurrent computing Hardware System recovery

来源：评论

学校读者我要写书评

暂无评论

On lines avoiding unit balls in three dimensions

On lines avoiding unit balls in three dimensions

引用

Proceedings of the Twentieth Annual Symposium on Computational Geometry (SCG'04)

作者： Agarwal, Pankaj K. Aronov, Boris Koltun, Vladlen Sharir, Micha Department of Computer Science Duke University Durham NC 27708-0129 United States Department of Computer Science Polytechnic University Brooklyn NY 11201-3840 United States Computer Science Division University of California Berkeley CA 94720-1776 United States School of Computer Science Tel Aviv University Tel Aviv 69978 Israel Courant Inst. of Math. Sciences New York University New York NY 10012 United States

Let B be a set of n unit balls in 3. We show that the combinatorial complexity of the space of lines in 3 that avoid all the balls of B is O(n3+Ε), for any Ε > 0. This result has connections to problems in visibi... 详细信息

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：