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

Exploiting form semantics and validation checks to improve e-form layout

International Journal of Web Engineering and Technology 2005年第1期2卷 81-96页

作者： Vassilakis, Costas Lepouras, George Rouvas, Stathls Georgiadis, Panagiotis Department of Informatics and Telecommunications E-Gov Lab University of Athens Panepistimiopolis 15784 Athens Greece Department of Computer Science and Technology University of Peloponnese Greece General Secretariat for Information Systems Ministry of Finance Greece Department of Informatics and Telecommunications University of Athens Greece E-Gov Lab Greece

On their route to the electronic era, organisations release on the web more and more complex form-based services, which require users to enter numerous data items interrelated by business rules. In such a context, it is crucial to provide optimal form layouts, in order to present the service users with interfaces that facilitate their work. This paper presents an integrated environment, which exploits data item interrelations manifested by the business rules (or validation checks), to optimise the layout of the web forms comprising a complex service. The approach is validated through its application on a tax return form e-service. Copyright © 2005 Inderscience Enterprises Ltd.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Combining Sequence Diagrams and OCL for Liveness

Combining Sequence Diagrams and OCL for Liveness

引用

作者： Cavarra, Alessandra Küster-Filipe, Juliana Computing Laboratory University of Oxford Wolfson Building Parks Rd Oxford OX13QD United Kingdom Lab. for Found. of Computer Science School of Informatics Univ. of Edinburgh King's Buildings Edinburgh EH9 3JZ United Kingdom

Sequence diagrams in UML 2.0 have been considerably extended, partially influenced by variants of Message Sequence Charts (MSCs) and Live Sequence Charts (LSCs). However, sequence diagrams cannot satisfactorily express liveness/progress properties or differentiate between necessary and possible behaviour. To address this limitation, we propose to use an OCL template for liveness and enrich sequence diagrams with constraints as needed. We argue that our extended sequence diagrams are more expressive than LSCs. Further, if automatic code generation from inter-object behaviour specifications is feasible it will lead to more realistic solutions. Additionally, we discuss several problems and ambiguities in sequence diagrams as defined in the UML 2.0 superstructure specification. We discuss directions for future work. © 2004 Elsevier B.V.

关键词： Phase diagrams

来源：评论

学校读者我要写书评

暂无评论

Knowledge Management in Pediatric Pain: Mapping On-Line Expert Discussions to Medical Literature 11

引用

11th World Congress on Medical informatics, MEDINFO 2004

作者： Abidi, Syed Sibte Raza Finley, Allen Milios, Evangelos Shepherd, Michael Zitner, David Health Informatics Lab Faculty of Computer Science Dalhousie University Halifax Canada Health Informatics Lab Faculty of Medicine Dalhousie University Halifax Canada

ISBN: (纸本)1586034448

Clinical decision-making can be vastly improved with the availability of the right medical knowledge at the right time. This concept paper presents a knowledge management research program to (a) identify, capture and organize the tacit knowledge inherent within on-line problem-solving discussions between pediatric pain practitioners;(b) establish linkages between topic-specific pediatric pain discussions and corresponding published medical literature on children's pain available at PubMed-i.e. linking tacit expert knowledge to explicit medical literature;and (c) make these knowledge resources available to pediatric pain practitioners via the WWW for timely access to various modalities of clinical knowledge. © 2004 IMIA. All rights reserved.

关键词： Pediatrics

来源：评论

学校读者我要写书评

暂无评论

Ambient wood: Designing new forms of digital augmentation for learning outdoors 04

Ambient wood: Designing new forms of digital augmentation fo...

引用

3rd International Conference on Interaction Design and Children, IDC 2004

作者： Rogers, Y. Price, S. Fitzpatrick, G. Fleck, R. Harris, E. Smith, H. Randell, C. Muller, H. O'malley, C. Stanton, D. Thompson, M. Weal, M. School of Informatics Indiana University United States Interact Lab Dept of Informatics University of Sussex United Kingdom Computer Science Dept. Bristol University United Kingdom Mixed Reality Lab Nottingham University United Kingdom Dept of Electronics and Computer Science University of Southampton United Kingdom

ISBN: (纸本)1581137915

Ubiquitous and mobile technologies provide opportunities for designing novel learning experiences that move out of the classroom. Information can be presented and interacted with in a variety of ways while exploring a physical environment. A key issue this raises is when, where, what and how much? Our research is concerned with the design, delivery and interaction of digital information when learning about ecology outdoors. We present a framework of the different forms of digital augmentation and the different processes by which they can be accessed. Using the framework, we designed an outdoors learning experience, aimed at encouraging students to carry out contextualized scientific enquiry and to reflect on their interactions. Pairs of 11-12 year olds explored a woodland and were presented at certain times with different forms of digital augmentation. Our study showed that this kind of exploration promoted interpretation and reflection at a number of levels of abstraction. © 2004 ACM.

关键词： Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

Generalized Model-Checking over Locally Tree-Decomposable Classes

Generalized Model-Checking over Locally Tree-Decomposable Cl...

引用

作者： Frick, Markus Lab. for Found. of Computer Science Division of Informatics University of Edinburgh Edinburgh EH9 3JZ United Kingdom

It has been proved in [16] that properties of graphs or other relational structures that are definable in first-order logic can be decided in linear time when the input structures are restricted to come from a locally tree-decomposable class of structures. Important examples of such classes are the class of planar graphs and classes of graphs of bounded degree. In this paper we consider more general computational problems than decision problems, which are induced by formulas with free variables. In this generalized setting we investigate the construction (find a satisfying assignment), listing (all satisfying assignments) and counting (compute the number of satisfying assignments) problems for formulas of first-order logic. We show that each of these problems can be solved in linear time on locally tree-decomposable classes of structures. For instance, we devise an algorithm that, given a planar graph G and a first-order logic formula φ(x¯), computes a a¯ ∈ G such that G |= φ (a¯) in time f (φ) · G for some computable function f (the construction case). Accordingly, we obtain linear time algorithms for the counting and listing cases.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Simplified access to structured databases by adapting keyword search and database selection 04

Simplified access to structured databases by adapting keywor...

引用

Applied Computing 2004 - Proceedings of the 2004 ACM Symposium on Applied Computing

作者： Hassan, Mohammad Alhajj, Reda Ridley, Mick J. Barker, Ken School of Informatics Bradford University Bradford West Yorkshire United Kingdom ADSA Lab. Dept. of Computer Science University of Calgary Calgary Alta. Canada

ISBN: (纸本)9781581138122

This paper presents a tool that enables non-technical (naive) end-users to use free-form queries in exploring distributed relational databases with simple and direct technique, in a fashion similar to using search engines to search text files on the web. This allows web designers and database developers to publish their databases for web browsers exploring. The proposed approach can be used for both Internet and Intranet application areas. Our approach depends on identifying first databases that are most likely to provide useful results to the raised query, and then search only the identified databases. In our work, we developed and extended an estimation technique to assess the usefulness measure of each database. Our technique has been borrowed from the similar techniques used for information retrieval (IR), mainly for text and document databases;it supports working smoothly with the structured information stored in relational databases. Such a usefulness measure enables nave users to make decisions about databases to search and in what order.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Efficient 3D object retrieval using depth images

Efficient 3D object retrieval using depth images

引用

MIR'04 - Proceedings of the 6th ACM SIGMM International Workshop on Multimedia Information Retrieval

作者： Vajramushti, N. Kakadiaris, I.A. Theoharis, T. Papaioannou, G. Dept. of Computer Science University of Houston Houston TX 77204-3010 United States Visual Computing Lab. Dept. of Computer Science University of Houston Houston TX 77204-3010 United States Dept. of Informatics University of Athens Athens Greece

ISBN: (纸本)1581139403

In this paper, we present a new three-dimensional object retrieval method. This method employs depth buffers for representing and comparing the objects. Specifically, multiple depth buffers per object (computed from different points of view) are compared for surface and volume similarity. Our method is easily extensible for hierarchical comparisons at multiple resolutions and is highly parallelizable. We have employed this method for both inter-class and intra-class retrieval tasks on a gallery of over 3,000 three-dimensional objects of vehicles with very encouraging results. The accuracy of the method depends on the number of depth buffers and the depth buffer resolution. Copyright 2004 ACM.

关键词： Image retrieval

来源：评论

学校读者我要写书评

暂无评论

Adaptive critics for evolutionary artists

引用

European Workshop on Applications of Evolutionary Computation, EvoWorkshops 2004: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoMUSART, and EvoSTOC

作者： Machado, Penousal Romero, Juan Santos, María Luisa Cardoso, Amílcar Manaris, Bill Centre for Informatics and Systems of the University of Coimbra Coimbra3030 Portugal Creative Computer Line RNASA Lab University of Coruña Spain Computer Science Department College of Charleston CharlestonSC29424 United States

ISBN: (纸本)9783540213789

We focus on the development of artificial art critics. These systems analyze artworks, extracting relevant features, and produce an evaluation of the perceived pieces. The ability to perform aesthetic judgments is a desirable characteristic in an evolutionary artificial artist. As such, the inclusion of artificial art critics in these systems may improve their artistic abilities. We propose artificial art critics for the domains of music and visual arts, presenting a comprehensive set of experiments in author identification tasks. The experimental results show the viability and potential of our approach. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

A performance comparative analysis between rule-induction algorithms and clustering-based constructive rule-induction algorithms. Application to rheumatoid arthritis

A performance comparative analysis between rule-induction al...

引用

5th International Symposium on Biological and Medical Data Analysis, ISBMDA 2004

作者： Sanandrés-Ledesma, J.A. Maojo, Victor Crespo, Jose García-Remesal, M. Gómez de la Cámara, A. Medical Informatics Group AI Lab School of Computer Science Polytechnical University of Madrid Spain Clinical Epidemiology Research Unit Hospital 12 de Octubre Madrid Spain

ISBN: (纸本)9783540305477

We present a performance comparative analysis between traditional rule-induction algorithms and clustering-based constructive ruleinduction algorithms. The main idea behind these methods is to find dependency relations among primitive variables and use them to generate new features. These dependencies, corresponding to regions in the space, can be represented as clusters of examples. Unsupervised clustering methods are proposed for searching for these dependencies. As a benchmark, a database of rheumatoid arthritis (RA) patients has been used. A set of clinical prediction rules for prognosis in RA was obtained by applying the most successful methods, selected according to the study outcomes. We suggest that it is possible to relate predictive features and long-term outcomes in RA. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Realistic workload scheduling policies for taming the memory bandwidth bottleneck of SMPs

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

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2004年 3296卷 286-296页

作者： Antonopoulos, Christos D. Nikolopoulos, Dimitrios S. Papatheodorou, Theodore S. Department of Computer Science College of William and Mary 118 McGlothlin-Street Hall Williamsburg VA 23187-8795 United States High Performance Information Systems Lab. Computer Engineering and Informatics Department University of Patras 26500 Patras Greece

In this paper we reformulate the thread scheduling problem on multiprogrammed SMPs. Scheduling algorithms usually attempt to maximize performance of memory intensive applications by optimally exploiting the cache hierarchy. We present experimental results indicating that - contrary to the common belief - the extent of performance loss of memory-intensive, multiprogrammed workloads is disproportionate to the deterioration of cache performance caused by interference between threads. In previous work [1] we found that memory bandwidth saturation is often the actual bottleneck that determines the performance of multiprogrammed workloads. Therefore, we present and evaluate two realistic scheduling policies which treat memory bandwidth as a first-class resource. Their design methodology is general enough and can be applied to introduce bus bandwidth-awareness to conventional scheduling policies. Experimental results substantiate the advantages of our approach. © Springer-Verlag 2004.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：