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

Towards a collaborative learning environment for children's pain management: Leveraging an online discussion forum

Health informatics Journal 2005年第1期11卷 19-31页

作者： Curran-Smith, Janet Raza Abidi, Syed Sibte Forgeron, Paula Health Informatics Lab. Faculty of Computer Science Dalhousie University Halifax NS Canada Children's Health Program IWK Health Centre Halifax NS Canada

Effective management of pediatric pain requires proactive and effective collaboration between health practitioners from a variety of health disciplines. This article investigates the merits of a collaborative learning environment to address the knowledge gaps experienced by a community of pediatric pain practitioners. We present a knowledge management solution that leverages an online discussion forum as a collaborative learning environment rooted in team members sharing experiences, offering support to solve problems, guiding members to information/knowledge resources, informing peers about clinical practice guidelines, and simply seeking advice on matters pertaining to pediatric pain management. Team interactions, via the discussion forum, will be captured and represented as a social network to provide useful insights into the dynamics of team collaboration and to identify the patterns of knowledge flow amongst the team members. Copyright © 2005 SAGE Publications.

关键词： Canada Collaborative learning Community of practice Medical training Online discussion forum Pediatric pain management Social networks

来源：评论

学校读者我要写书评

暂无评论

Relevancy based access control of versioned XML documents 05

Relevancy based access control of versioned XML documents

引用

SACMAT 2005: Proceedings of 10th ACM Symposium on Access Control Models and Technologies

作者： Iwaihara, Mizuho Chatvichienchai, Somchai Anutariya, Chutiporn Wuwongse, Vilas Dept. Social Informatics Kyoto University Kyoto 606-8501 Japan Dept. Info.-Media Siebold University of Nagasaki Nagasaki 851-2195 Japan Computer Science Program Shinawatra University Pathumthani 12160 Thailand Computer Science and Information Management Program Asian Institute of Technology Pathumthani 12120 Thailand

ISBN: (纸本)9781595930453

Integration of version and access control of XML documents has the benefit of regulating access to rapidly growing archives of XML documents. Versioned XML documents provide us with valuable informations on dependencies between document nodes, but at the same time presenting the risk of undesirable data disclosure. In this paper we introduce the notion of relevancy-based access control, which realizes protection of versioned XML documents by various types of relevancy, such as version dependencies, schema similarities and temporal proximity. We define a new path query language XVerPath over XML document versions, which can be utilized for specifying relevancy-based access control policies. We also introduce the notion of relevancy class, for collectively and compactly specifying relevancy-based policies. Copyright 2005 ACM.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

Edge detection using clustering algorithms

引用

WSEAS Transactions on computers 2005年第5期4卷 417-423页

作者： Sirin, Tuba Saglam, Mehmet Izzet Erer, Isin Gokmen, Muhittin Informatics Institute Advanced Technologies in Engineering Computer Science and Engineering Istanbul Technical University Istanbul 34469 Turkey Informatics Institute Advanced Technologies in Engineering Satellite Communication and Remote Sensing Program Istanbul Technical University Istanbul 34469 Turkey Faculty of Electrical and Electronic Engineering Electronics and Communication Department Istanbul Technical University Istanbul 34469 Turkey Faculty of Electrical and Electronic Engineering Computer Engineering Department Istanbul Technical University Istanbul 34469 Turkey

Edge detection is an important topic in image processing and a main tool in pattern recognition and image segmentation. Many edge detection techniques are available in the literature. 'A number of recent edge detectors are multiscale and include three main processing steps: smoothing, differentiation and labeling' (Ziau and Tabbone, 1997). This paper, presents a proposed method which is suitable for edge detection in images. This method is based on the use of the clustering algorithms (Self-Organizing Map (SOM), K-Means) and a gray scale edge detector (Canny, Generalized Edge Detector (GED)). It is shown that using the grayscale edge detectors may miss some parts of the edges which can be found using the proposed method.

关键词： Edge detection

来源：评论

学校读者我要写书评

暂无评论

Handling missing attribute values in preterm birth data sets

引用

10th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, RSFDGrC 2005

作者： Grzymala-Busse, Jerzy W. Goodwin, Linda K. Grzymala-Busse, Witold J. Zheng, Xinqun Department of Electrical Engineering and Computer Science University of Kansas Lawrence KS 66045 United States Institute of Computer Science Polish Academy of Sciences 01-237 Warsaw Poland Nursing Informatics Program Duke University Durham NC 27710 United States Filterlogix Lawrence KS 66049 United States

ISBN: (纸本)3540286608

The objective of our research was to find the best approach to handle missing attribute values in data sets describing preterm birth provided by the Duke University. Five strategies were used for filling in missing attribute values, based on most common values and closest fit for symbolic attributes, averages for numerical attributes, and a special approach to induce only certain rules from specified information using the MLEM2 approach. The final conclusion is that the best strategy was to use the global most common method for symbolic attributes and the global average method for numerical attributes. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Data handling

来源：评论

学校读者我要写书评

暂无评论

A workflow-based environment to manage software-testing process executions

A workflow-based environment to manage software-testing proc...

引用

作者： Ruiz, Duncan Dubugras A. Becker, Karin Copstein, Bernardo De Oliveira, Flavio Moreira De Oliveira, Angelina Torres Forgiarini, Gustavo Rossarolla Meneguzzi, Cristiano Rech Carvalho, Rafaela Lisboa Computer Science Post-Graduate Program Faculty of Informatics Pontifical Catholic University of RS Av. Ipiranga 6681 Predio 16 Sala 106-FACIN Porto Alegre - RS Brazil

ISBN: (纸本)972886521X

This work describes a workflow-based environment that manages the execution of software-testing processes. Testing processes require that human and computer resources be handled as dedicated resources, previously scheduled for testing activities, with no overlapping. Two striking features of this environment are: a) the efficient handling of resources by taking into account the capabilities offered by resources required by testing activities, and b) it provides a broader view of all execution steps in a software-testing plan. Hence, it enables a better planning of software-testing process executions, as well as of human and computer resources involved.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

Calculating genomic distances in parallel using OpenMP 1

引用

International Workshop on Bioinformatics Research and Applications, IWBRA 2005

作者： Kolli, Vijaya Smitha Liu, Hui He, Jieyue Pan, Michelle Hong Pan, Yi Department of Computer Science Georgia State University Atlanta GA 30303 United States Department of Computer Science Southeast University Nanjing Jiangsu China Public Health Informatics Fellow Program Career Development Division Centers for Disease Control and Prevention 1600 Clifton Rd. Atlanta GA 30333 United States

ISBN: (数字)9783540316619

ISBN: (纸本)3540294015

By finding the corresponding shortest edit distance between two signed gene permutations, we can know the smallest number of insertions, deletions, and inversions required to change on string of genes into another, where insertion, deletion and inversion are the process of genome evolutions. However, it is NP-hard problem to compute the edit distance between two genomes. Marron et al proposed a polynomial-time approximation algorithm to compute (near) minimum edit distances under inversions, deletions, and unrestricted insertions. Our work is based on Marron's et al algorithm, which carries out lots of comparisons and sorting to calculate the edit distance. These comparisons and sorting are extremely time-consuming, and they result in the decrease of the efficiency. We believe the efficiency of the algorithm can be improved by parallelizing. We parallelize their algorithm via OpenMP on Intel C++ compiler for Linux 7.1, and compare three levels of parallelism: coarse grain, fine grain and combination of both. The experiments are conducted for a varying number of threads and length of the gene sequences. The experimental results have shown that either coarse grain parallelism or fine grain parallelism alone does not improve the performance of the algorithm very much, however, the combination of both fine grain and coarse grain parallelism have improve the performance to a great extent. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Genes

来源：评论

学校读者我要写书评

暂无评论

A software tool for creating simulated outbreaks to benchmark surveillance systems

引用

BMC Medical informatics and Decision Making 2005年第1期5卷 1-7页

作者： Cassa, Christopher A. Iancu, Karin Olson, Karen L. Mandl, Kenneth D. Children's Hospital Informatics Program Informatics Program - Mandl Group Children's Hospital Boston Boston MA 02115 1 Autumn St #721 United States Clinical Decision Making Group Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge MA 02139 United States Harvard Medical School Boston MA 02115 United States Harvard/MIT Division of Health Sciences and Technology Cambridge MA 02139 United States

Background: Evaluating surveillance systems for the early detection of bioterrorism is particularly challenging when systems are designed to detect events for which there are few or no historical examples. One approach to benchmarking outbreak detection performance is to create semi-synthetic datasets containing authentic baseline patient data (noise) and injected artificial patient clusters, as signal. Methods: We describe a software tool, the AEGIS Cluster Creation Tool (AEGIS-CCT), that enables users to create simulated clusters with controlled feature sets, varying the desired cluster radius, density, distance, relative location from a reference point, and temporal epidemiological growth pattern. AEGIS-CCT does not require the use of an external geographical information system program for cluster creation. The cluster creation tool is an open source program, implemented in Java and is freely available under the Lesser GNU Public License at its Sourceforge website. Cluster data are written to files or can be appended to existing files so that the resulting file will include both existing baseline and artificially added cases. Multiple cluster file creation is an automated process in which multiple cluster files are created by varying a single parameter within a user-specified range. To evaluate the output of this software tool, sets of test clusters were created and graphically rendered. Results: Based on user-specified parameters describing the location, properties, and temporal pattern of simulated clusters, AEGIS-CCT created clusters accurately and uniformly. Conclusion: AEGIS-CCT enables the ready creation of datasets for benchmarking outbreak detection systems. It may be useful for automating the testing and validation of spatial and temporal cluster detection algorithms. © 2005 Cassa et al;licensee BioMed Central Ltd.

关键词： Geographic Information System Cluster Point Syndromic Surveillance Geographic Information System Software Patient Cluster

来源：评论

学校读者我要写书评

暂无评论

A parallel implementation for determining genomic distances under deletion and insertion

A parallel implementation for determining genomic distances ...

引用

5th International Conference on Computational science - ICCS 2005

作者： Kolli, Vijaya Smitha Liu, Hui Pan, Michelle Hong Pan, Yi Department of Computer Science Georgia State University Atlanta GA 30303 United States Public Health Informatics Fellow Program Career Development Division Centers for Disease Control and Prevention 1600 Clifton Rd Atlanta GA 30333 United States

ISBN: (纸本)9783540260431

As the need for comparing genomes of different species has grown dramatically with the fast progress of the Human Genome Project, the evolution at the level of whole genomes has attracted more and more attention from both biologists and computer scientists. They are especially interested in the scenarios in which the genome evolves through insertions, deletions, and movements of genes along its chromosomes. Marron et al proposed a polynomial-time approximation algorithm to compute (near) minimum edit distances under inversions, deletions, and unrestricted insertions. Our work is based on their algorithm, which carries out lots of comparisons and sorting to calculate the edit distance. These comparisons and sorting are extremely time-consuming, and they result in decrease of computational efficiency. We believe the time of the algorithm can be improved through parallelization. We parallelize their algorithm via OpenMP using Intel C++ compiler for Linux 7.1, and compare three levels of parallelism: coarse grain, fine grain and combination of both. The experiments are conducted for a varying number of threads and different lengths of the gene sequences. The experimental results show that either coarse grain parallelism or fine grain parallelism alone does not improve the performance of the algorithm very much. However, the use of combination of both fine grain and coarse grain parallelism improves the performance of the algorithm drastically. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Genes

来源：评论

学校读者我要写书评

暂无评论

A comparative evaluation of competitive learning algorithms for edge detection enhancement

A comparative evaluation of competitive learning algorithms ...

引用

13th European Signal Processing Conference, EUSIPCO 2005

作者： Sirin, Tuba Saglam, Mehmet Izzet Erer, Isin Gokmen, Muhittin Ersoy, Okan Informatics Institute Advanced Technologies in Engineering Computer Science and Engineering Maslak Istanbul 34469 Turkey Informatics Institute Advanced Technologies in Engineering Satellite Communication and Remote Sensing Program Maslak Istanbul 34469 Turkey Faculty of Electrical and Electronic Engineering Electronics and Communication Department Maslak Istanbul 34469 Turkey Faculty of Electrical and Electronic Engineering Computer Engineering Department Istanbul Technical University Maslak Istanbul 34469 Turkey Purdue University School of Electrical and Computer Engineering West Lafayette IN United States

ISBN: (纸本)1604238216

Most edge detection algorithms include three main stages: smoothing, differentiation, and labeling. In this paper, we evaluate the performance of algorithms in which competitive learning is applied first to enhance edges, followed by an edge detector to locate the edges. In this way, more detailed and relatively more unbroken edges can be found as compared to the results when an edge detector is applied alone. The algorithms compared are K-Means, SOM and SOGR for clustering, and Canny and GED for edge detection. Perceptionally, best results were obtained with the GED-SOGR algorithm. The SOGR is also considerably simpler and faster than the SOM algorithm.

关键词： Edge detection

来源：评论

学校读者我要写书评

暂无评论

Analyzing groupware design by means of usability results

Analyzing groupware design by means of usability results

引用

International Conference on computer Supported Cooperative Work in Design

作者： P. Antunes M.R.S. Borges J.A. Pino L. Carrico Department of Informatics Universidade de Lisboa Portugal Graduate Program in Informatics Federal University of Rio de Janeiro Brazil Department of Computer Science Universidad de Chile Chile

GOMS is a well-known model that has been successfully used in predicting the performance of human-computer interaction, identifying usability problems and improving user-interface design. The focus of GOMS on the individual user, however, explains why it has not been applied in the groupware context. We were inspired by GOMS to define a model that describes collaborative tasks in a formal way. We illustrate the application of the model by applying it to the design of a collaborative tool for software engineering requirements negotiation.

关键词： Collaborative software Collaborative work Usability Humans Collaboration Collaborative tools computer architecture informatics Application software computer science

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：