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

Proceedings of the International Conference on Information and Knowledge Engineering 2003

作者： Lu, James J. Wyss, Catharine M. Cheung, Shun Yan Akhavein, Mehdi M. Dept. of Math. and Computer Science Emory University Atlanta GA 30332-1950 United States Dept. Comp. Sci. and Sch. of Info. Indiana University Bloomington IN 47405 United States

ISBN: (纸本)1932415076

eXtensible relational database (XRDB) is a novel extension to the relational database model that integrates metadata and ordinary data within the relational model. At the core of XRDB is a rich collection of meta-datatypes. The current paper explores the management of XML sch.mas via XRDB. In particular, it is shown that a combined structure-based mapping and model-based mapping can be naturally achieved hi XRDB.

关键词： Relational database systems

来源：评论

学校读者我要写书评

暂无评论

A quadrature rule for the finite Hilbert transform via trapezoid type inequalities

引用

Journal of Applied math.matics and computing 2003年第1-2期13卷 67-84页

作者： Dragomir, N.M. Dragomir., S.S. Farrell, P.M. Baxter, G.W. Optical Technology Research Lab. School of Electrical Engineering Victoria University of Technology PO Box 14428 Melbourne City Vic. 8001 Australia Sch. of Computer Science and Math. Victoria University of Technology PO Box 14428 Melbourne City Vic. 8001 Australia ALTAMAR Networks in Melbourne Melbourne Vic. Australia

A quadrature rule for the finite Hilbert Transform via trapezoid type inequalities is obtained. Some numerical experiments for different divisions of the interval [a, b] are also presented.

关键词： Finite Hilbert transform Trapezoid inequality

来源：评论

学校读者我要写书评

暂无评论

The online set cover problem

The online set cover problem

引用

35th Annual ACM Symposium on Theory of computing

作者： Alon, Noga Awerbuch, Baruch Azar, Yossi Buchbinder, Niv Naor, Joseph Sch. of Math. and Computer Science Raymond/Beverly Sackler Fac. E.S. Tel Aviv University Tel Aviv Israel Johns Hopkins University Baltimore MD 21218 United States School of Computer Science Raymond/Beverly Sackler Fac. E.S. Tel Aviv University Tel Aviv Israel Computer Science Dept. Technion Haifa 32000 Israel

Let X = {1, 2, . . . , n} be a ground set of n elements, and let S be a family of subsets of X, |S| = m, with a positive cost cS associated with each S ∈ S. Consider the following online version of the set cover problem, described as a game between an algorithm and an adversary. An adversary gives elements to the algorithm from X one-by-one. Once a new element is given, the algorithm has to cover it by some set of S containing it. We assume that the elements of X and the members of S are known in advance to the algorithm, however, the set X′ ⊆ X of elements given by the adversary is not known in advance to the algorithm. (In general, X′ may be a strict subset of X.) The objective is to minimize the total cost of the sets chosen by the algorithm. Let C denote the family of sets in S that the algorithm chooses. At the end of the game the adversary also produces (off-line) a family of sets COPT that covers X′. The performance of the algorithm is the ratio between the cost of C and the cost of COPT. The maximum ratio, taken over all input sequences, is the competitive ratio of the algorithm. We present an O (log m log n) competitive deterministic algorithm for the problem, and establish a nearly matching Ω (log n log m/log log m+log log n) lower bound for all interesting values of m and n. The techniques used are motivated by similar techniques developed in computational learning theory for online prediction (e.g., the WINNOW algorithm) together with a novel way of converting the fractional solution they supply into a deterministic online algorithm.

关键词： Online systems

来源：评论

学校读者我要写书评

暂无评论

Optical fibre flow-sensor for composites manufacturing

引用

Advanced Composites Letters 2003年第5期12卷 211-215页

作者： Lekakou, C. Cook, S. Ang, T.W. Reed, G.T. School of Engineering University of Surrey Guildford Surrey GU2 7XH United Kingdom SCRIBA Sch. of Electron. Computing/Math. University of Surrey Guildford Surrey GU2 7XH United Kingdom

An optical fibre has been used as an intensity-based sensor for the monitoring of the fluid front infiltrating a reinforcing fibre mat in composites manufacturing. The sensor length comprised the fibre core, initially surrounded by air or vacuum and subsequently covered by the infiltrating fluid. Two configurations were tested where a step-change or a continual output signal was obtained, respectively. In the latter case, the sensor used in this study demonstrates an improvement of up to two orders of magnitude over conventional monitoring techniques used for this application. This performance is coupled with more obvious advantages of low cost, compatibility with composite fabrication, and ease of use.

关键词： Fiber optic chemical sensors

来源：评论

学校读者我要写书评

暂无评论

Properties of recoverable region and semi-global stabilization in recoverable region for linear systems subject to constraints

Properties of recoverable region and semi-global stabilizati...

引用

2003 American Control Conference

作者： Stoorvogel, Anton A. Saberi, Ali Shi, Guoyong Dept. of Math. Eindhoven Univ. of Technology Eindhoven Netherlands Dept. of Inf. Techn. Delft Univ. of Technology Delft Netherlands Sch. of Elec. Eng./Computer Science Washington State University Pullman WA 99164-2752 United States Electrical Engineering Department University of Washington Seattle WA 98195 United States

This paper investigates time-invariant linear systems subject to input and state constraints. It is shown that the recoverable region (which is the largest domain of attraction that is theoretically achievable) can be semiglobally stabilized by continuous nonlinear feedbacks while satisfying the constraints. Moreover, a reduction technique is presented which shows, when trying to compute the recoverable region, that we only need to compute the recoverable region for a system of lower dimension which generally leads to a considerable simplification in the computational effort.

关键词： Linear control systems

来源：评论

学校读者我要写书评

暂无评论

Clinical knowledge management for healthcare

Clinical knowledge management for healthcare

引用

IEEE EMBS International Conference on Information Technology Applications in Biomedicine (ITAB)

作者： A. Dwivedi R.K. Bali R.N.G. Naguib N.S. Nassar Department Information Systems and Computing Brunel University Uxbridge UK ChorleyWood Health Centre Chorleywood UK Coventry University Coventry West Midlands GB Sch. of Math. & Inf. Sci. Coventry Univ. UK

A quiet transformation has taken place in health related research in the last twenty-five years. This transformation can be traced to the coming of age of new scientific domains like bioinformatics and cybernetics which have evolved thanks to trans-disciplinary research. The success of the human genome project is perhaps the most significant pointer of this silent transformation. We believe that in the future, as a result of synergistic interaction between bioinformatics and other paradigms, healthcare systems would have an increased interest in knowledge recycling of the collaborative learning process acquired from practices. In this context, the knowledge management (KM) paradigm could assist twenty-first century clinical practitioners to acquire proficiency in understanding and interpreting clinical information so as to attain knowledge and wisdom whilst dealing with large amounts of clinical data.

关键词： Medical services Telemedicine Medical diagnostic imaging Hospitals Information systems Collaboration Cardiology Atherosclerosis Appropriate technology Biomedical equipment

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Comparing Parallel Functional Languages: Programming and Performance

引用

Higher-Order and Symbolic Computation 2003年第3期16卷 203-251页

作者： Loidl, H.-W. Rubio, F. Scaife, N. Hammond, K. Horiguchi, S. Klusik, U. Loogen, R. Michaelson, G.J. Peña, R. Priebe, S. Rebón, A.J. Trinder, P.W. Sch. of Math. and Computer Sciences Heriot-Watt University Edinburgh EH14 4AS United Kingdom Dpto. Sistemas Informáticos Universidad Complutense de Madrid 28040 Madrid Spain Japan Adv. Inst. for Sci./Technology 1/8 Asahidai Nomigun Ishikawa 923-1211 Japan School of Computer Science University of St. Andrews Fife KY16 9SS United Kingdom Fb. Mathematik und Informatik Phlipps-Universität Marburg D-35032 Marburg Germany

This paper presents a practical evaluation and comparison of three state-of-the-art parallel functional languages. The evaluation is based on implementations of three typical symbolic computation programs, with performance measured on a Beowulf-class parallel architecture. We assess three mature parallel functional languages: PMLS, a system for implicitly parallel execution of ML programs;GpH, a mainly implicit parallel extension of Haskell;and Eden, a more explicit parallel extension of Haskell designed for both distributed and parallel execution. While all three languages employ a completely implicit approach to communication, each language takes a different approach to specifying and controlling parallelism, ranging from explicit identification of processes as language constructs (Eden) through annotation of potential parallelism (GPH) to automatic detection of parallel skeletons in sequential code (PMLS). We present detailed performance measurements of all three systems on a widely available parallel architecture: a Beowulf cluster of low-cost commodity workstations. We use three representative symbolic applications: a matrix multiplication algorithm, an exact linear system solver, and a simple ray-tracer. Our results show how moderate speedups can be achieved with little or no changes to the sequential code, and that parallel performance can be significantly improved even within our high-level model of parallel functional programming by controlling key aspects of the program such as load distribution and thread granularity.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

computing the Betti numbers of arrangements

Computing the Betti numbers of arrangements

引用

Proceedings of the 34th Annual ACM Symposium on Theory of computing

作者： Basu, Saugata Sch. of Math. and Coll. of Computing Georgia Institute of Technology Atlanta GA United States

In this paper, we consider the problem of computing the Betti numbers of an arrangement of n compact semi-algebraic sets, S1,..., Sn ⊂ k, where each Si is described using a constant number of polynomials with degrees bounded by a constant. Such arrangements are ubiquitous in computational geometry. We give an algorithm for computing -th Betti number, β(∪iSi), 0 ≤ ≤ k - 1, using O(n+2) algebraic operations. Additionally, one has to perform linear algebra on matrices of size bounded by O(n+1). All previous algorithms for computing the Betti numbers of arrangements, triangulated the arrangement giving rise to a complex of size O(n2k) in the worst case. To our knowledge this is the first algorithm for computing β(∪iSi) that does not rely on such a global triangulation, and has a graded complexity which depends on .

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

Induction of ordinal decision tree

Induction of ordinal decision tree

引用

Proceedings of 2002 International Conference on Machine Learning and Cybernetics

作者： Lee, John W.T. Liu, Da-Zhong Department of Computing Hong Kong Polytechnic University Hung Hom Hong Kong Sch. of Math. and Computer Science Hebel University Baoding China

ISBN: (纸本)0780375084

In many disciplines, such as social and behavioral sciences, we often have to do ordinal classification by assigning objects to ordinal classes. The fundamental objective of ordinal classification is to create an ordering in the universe of discourse. As such, a decision tree for ordinal classification should aim at producing an ordering which is most consistent with the implicit ordering in the input data. Ordinal classification problems are often dealt with by treating ordinal classes as nominal classes, or by representing the classes as values on a quantitative scale. Such approaches may not lead to the most desirable results since the methods do not fit the type of data, viz. ordinal data, concerned. In this paper, we propose a new measure for assessing the quality of output from an ordinal classification approach. We also propose an induction method to generate an ordinal decision tree for ordinal classification based on this quality perspective. We demonstrate the advantage of our method using results from a set of experiments.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：