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

Structured Decompositions and Efficient Algorithms 2008

作者： Dahlke, Stephan Daubechies, Ingrid Elad, M. Kutyniok, Gitta Teschke, Gerd Philipps-Universität Marburg FB12 Mathematik und Informatik Hans-Meerwein Straße Lahnberge Marburg35032 Germany Princeton University Program in Applied and Computational Mathematics Fine Hall Washington Road PrincetonNJ08544-1000 United States Technion Computer Science Department Haifa Technion City32000 Israel Universität Osnabrück Institute of Mathematics Osnabrück49069 Germany Hochschule Neubrandenburg University of Applied Sciences Institute for Computational Mathematics in Science and Technology Brodaer Str. 2 Neubrandenburg17033 Germany

New emerging technologies such as high-precision sensors or new MRI machines drive us towards a challenging quest for new, more effective, and more daring mathematical models and algorithms. Therefore, in the last few years researchers have started to investigate different methods to efficiently represent or extract relevant information from complex, high dimensional and/or multimodal data. Efficiently in this context means a representation that is linked to the features or characteristics of interest, thereby typically providing a sparse expansion of such. Besides the construction of new and advanced ansatz systems the central question is how to design algorithms that are able to treat complex and high dimensional data and that efficiently perform a suitable approximation of the signal. One of the main challenges is to design new sparse approximation algorithms that would ideally combine, with an adjustable tradeoff, two properties: a provably good 'quality' of the resulting decomposition under mild assumptions on the analyzed sparse signal, and numerically efficient design. The topic is driven by applications as well as by theoretical questions. Therefore, the aim of this seminar was to bring together a good mixture of scientists with different backgrounds in order to discuss recent progress as well as new challenging perspectives. In particular, it was intended to strengthen the interaction of mathematicians and computer scientists. © 2009 Dagstuhl Seminar Proceedings. All Rights Reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Learning a nonlinear color distance metric for the identification of skin immunohistochemical staining

Learning a nonlinear color distance metric for the identific...

引用

2009 22nd IEEE International Symposium on computer-Based Medical Systems, CBMS 2009

作者： Sobieranski, Antonio Carlos Neto, Sylvio Luiz Mantelli Coser, Leandro Comunello, Eros Von Wangenheim, Aldo Cargnin-Ferreira, Eduardo Di Giunta, Gabriella LAPIX Laboratory of Image Processing and Computer Graphics UFSC Federal University of Santa Catarina Brazil CPTEC Center for Weather Forecasts and Environment Studies INPE - Brazilian Institute for Space Research Brazil EGC Knowledge Engineering Department UFSC - Federal University of Santa Catarina Brazil MCA Graduate Program in Applied Computer Science UNIVALI - Itajai Valley University Brazil Laboratory of Histological Markers Department of Biology Embriology and Genetics UFSC - Federal University of Santa Catarina Brazil Pathology Service UFSC - Federal University of Santa Catarina Brazil

ISBN: (纸本)9781424448784

This paper presents a semiautomatic method for the identification of immunohistochemical (IHC) staining in digitized samples. The user trains the system by selecting on a sample image some typical positive stained regions that will be used as a reference for the construction of a distance metric. In this learning process, the global optimum is obtained by induction employing higher polynomial terms of the Mahalanobis distance, extracting nonlinear features of the IHC pattern distributions. The results of the proposed method showed a high correlation to a pathologist's manual analysis, which was used as a golden standard, presenting a more robust discrimination between stained and non-stained areas with little bias. © 2009 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Certified Trust Model

IFIP Advances in Information and Communication Technology

引用

IFIP Advances in Information and Communication Technology 2009年 296卷 41-49页

作者： Botêlho, Vanderson Enembreck, Fabríco Ávila, Bráulio C De Azevedo, Hilton Scalabrin, Edson E PUCPR Pontifical Catholic University of Paraná PPGIA Graduate Program on Applied Computer Science R. Imaculada Conceição Curitiba PR1155 Brazil UTFPR Federal Technological University of Paraná PPGTE Graduate Program on Technology Av. 7 de Setembro Curitiba PR3165 Brazil

This paper presents a certified confidence model which aims to ensure credibility for information exchanged among agents which inhabit an open environment. Generally speaking, the proposed environment shows a supplier agent b which delivers service for a customer agent a. The agent a returns to b a cryptographed evaluation r on the service delivered. The agent b will employ R as testimonial when requested to perform the same task for a distinct customer agent. Our hypotheses are: (i) control over testimonials can be distributed as they are locally stored by the assessed agents, i.e., each assessed agent is the owner of its testimonials;and (ii) testimonials, provided by supplier agents on their services, can be considered reliable since they are encapsulated with public key cryptography. This approach reduces the limitations of confidence models based, respectively, on the experience resulted from direct interaction between agents (direct confidence) and on the indirect experience obtained from reports of witnesses (propagated confidence). Direct confidence is a poor-quality measure for a customer agent a hardly has enough opportunities to interact with a supplier agent b so as to grow a useful knowledge base. Propagated confidence depends on the willingness of witnesses to share their experiences. The empiric model was tested in a multiagent system applied to the stock market, where supplier agents provide recommendations for buying or selling assets and customer agents then choose suppliers based on their reputations. Results demonstrate that the confidence model proposed enables the agents to more efficiently choose partners. © 2009, Springer New York LLC. All rights reserved.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Time Series Mining Approach for Noninvasive Intracranial Pressure Assessment: An Investigation of Different Regularization Techniques

Time Series Mining Approach for Noninvasive Intracranial Pre...

引用

computer science and Information Engineering, CSIE, WRI World Congress on FLAGGED

作者： Shaozhi Wu Peng Xu Shadnaz Asgari Marvin Bergsneider Xiao Hu Biomedical Engineering Graduate Program Henry Samueli School of Engineering and Applied Science University of California Los Angeles USA Neural Systems and Dynamics Laboratory Department of Neurosurgery the David Geffen School of Medicine University of California Los Angeles USA School of Computer Science and Engineering University of Electronic Science and Technology Chengdu China

A data mining framework has been proposed to estimate intracranial pressure (ICP) non-invasively in our previous work. In the corresponding approach, the feature vector extracted from arterial blood pressure (ABP) and flow velocity (FV) is translated to the estimated errors by the mapping function for each entry in the database. In this paper, three different mapping function solutions, linear least squares (LLS), truncated singular value decomposition (TSVD) and standard Tikhonov regularization (STR) are systemically tested to compare the possible effects of different solutions on the non-invasive ICP estimation. The conducted comparison demonstrated that the selection of mapping function solution actually influences the estimation. Among the tested three solutions for mapping function, TSVD and STR show better ICP estimation performance with smaller ICP errors than LLS.

关键词： Cranial pressure Data mining Biomedical engineering Data engineering Spatial databases computer science Feature extraction Arterial blood pressure Biomedical measurements Laboratories

来源：评论

学校读者我要写书评

暂无评论

Connector faculty: A friendly face for early engineering students

Connector faculty: A friendly face for early engineering stu...

引用

2009 ASEE Annual Conference and Exposition

作者： Briedis, Daina Buch, Neeraj Collins-Eaglin, Jan Ehrlich, Nathaniel Fleming, Denise Hinds, Timothy Sticklen, Jon Urban-Lurain, Mark Wolff, Thomas Department of Chemical Engineering and Materials Science Michigan State University United States Department of Civil and Environmental Engineering Michigan State University United States Cornerstone Engineering and Residential Experience Program Michigan State University United States Michigan State University United States United States College of Engineering Michigan State University United States Michigan State University College of Engineering Undergraduate Studies Department of Mechanical Engineering United States Applied Engineering Sciences College of Engineering Michigan State University United States Computer Science and Engineering Department Michigan State University United States Division of Science and Mathematics Education College of Natural Science Michigan State University United States Engineering for Undergraduate Studies Michigan State University United States

来源：评论

学校读者我要写书评

暂无评论

Comparison of Different Approaches to ICP Dominated Pulse Extraction

Comparison of Different Approaches to ICP Dominated Pulse Ex...

引用

International Conference on Bioinformatics and Biomedical Engineering (ICBBE)

作者： Peng Xu Shaozhi Wu Shadnaz Asgari Magdalena Kasprowicz Marvin Bergsneider Xiao Hu Center of Neuroinformatics School of Life Science and Technology University of Electronic Science and Technology Chengdu China Neural Systems and Dynamics Laboratory Department of Neurosurgery the David Geffen School of Medicine University of California Los Angeles USA School of Computer Science and Engineering University of Electronic Science and Technology Chengdu China Biomedical Engineering Graduate Program Henry Samueli School of Engineering and Applied Science University of California Los Angeles USA University of California Los Angeles Los Angeles CA US

Changes of ICP waveform morphology are characterized with different patients' states like hypertension, hydrocephalus and traumatic brain injury etc. Morphological clustering and analysis of ICP pulse (MOCAIP) approach is recently developed to extract ICP morphology feature, in which hierarchical clustering is used to extract the dominated pulse. In this paper, we evaluate the feasibility of using principle component analysis (PCA) and independent component analysis (ICA) to extract dominated pulse. The comparative study among clustering, PCA and ICP based approaches shows that PCA approach may be an alternative of clustering approach to extract dominated pulse in a faster fashion when dataset is of large size.

关键词： Independent component analysis Morphology Principal component analysis Biomedical engineering Feature extraction Electrocardiography Tellurium Hypertension Data mining Laboratories

来源：评论

学校读者我要写书评

暂无评论

Improving bilateral negotiation with evolutionary learning

Improving bilateral negotiation with evolutionary learning

引用

2008 12th International Conference on computer Supported Cooperative Work in Design, CSCWD

作者： Romanhuki, Emerson Fuckner, Marcio Enembreck, Fabrício Ávila, Bráulio Scalabrin, Edson E. PUCPR Pontifical Catholic University of Parana Graduate Program on Applied Computer Science Curitiba PR Brazil

ISBN: (纸本)9781424416509

This paper proposes an approach to generate offers and counter-offers in a bilateral negotiation process between cognitive agents with the learning machine capacities. The approach is configured, as each participant of a negotiation process improve their satisfaction degree, gaining knowledge from prior experience, i.e., in the next negotiation session, each participant can individually use this knowledge to redefine the configuration parameters of strategies and tactics to generate offers and counter-offers. Each agent refines their strategies using a genetic algorithm application based on the historical offers and counter-offer exchanges dataset. This context can lead to a new dimension in CSCW System Development. This approach was tested in a simulated bilateral negotiation environment, which involved, for example, a buyer agent and a seller agent. The discussions about the results confront different negotiation sessions comparing agents provided with strategy and tactics reconfiguration capabilities and agents using static strategies and tactics. © 2008 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Diffusion maps - A probabilistic interpretation for spectral embedding and clustering algorithms

Diffusion maps - A probabilistic interpretation for spectral...

引用

作者： Nadler, Boaz Lafon, Stephane Coifman, Ronald Kevrekidis, Ioannis G. Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot 76100 Israel Google Inc. United States Department of Mathematics Yale University New Haven CT 06520-8283 United States Department of Chemical Engineering Program in Applied and Computational Mathematics Princeton University Princeton NJ 08544 United States

ISBN: (纸本)9783540737490

Spectral embedding and spectral clustering are common methods for non-linear dimensionality reduction and clustering of complex high dimensional datasets. In this paper we provide a diffusion based probabilistic analysis of algorithms that use the normalized graph Laplacian. Given the pairwise adjacency matrix of all points in a dataset, we define a random walk on the graph of points and a diffusion distance between any two points. We show that the diffusion distance is equal to the Euclidean distance in the embedded space with all eigenvectors of the normalized graph Laplacian. This identity shows that characteristic relaxation times and processes of the random walk on the graph are the key concept that governs the properties of these spectral clustering and spectral embedding algorithms. Specifically, for spectral clustering to succeed, a necessary condition is that the mean exit times from each cluster need to be significantly larger than the largest (slowest) of all relaxation times inside all of the individual clusters. For complex, multiscale data, this condition may not hold and multiscale methods need to be developed to handle such situations.

关键词： Relaxation time

来源：评论

学校读者我要写书评

暂无评论

Improving bilateral negotiation with evolutionary learning

Improving bilateral negotiation with evolutionary learning

引用

International Conference on computer Supported Cooperative Work in Design

作者： Emerson Romanhuki Marcio Fuckner Fabricio Enembreck Braulio Avila Edson E. Scalabrin PUCPR PPGIA Graduate Program on Applied Computer Science Pontifical Catholic University of Paraná Curitiba Parana Brazil

ISBN: (纸本)9781424416509

This paper proposes an approach to generate offers and counter-offers in a bilateral negotiation process between cognitive agents with the learning machine capacities. The approach is configured, as each participant of a negotiation process improve their satisfaction degree, gaining knowledge from prior experience, i.e., in the next negotiation session, each participant can individually use this knowledge to redefine the configuration parameters of strategies and tactics to generate offers and counter-offers. Each agent refines their strategies using a genetic algorithm application based on the historical offers and counter-offer exchanges dataset. This context can lead to a new dimension in CSCW system development. This approach was tested in a simulated bilateral negotiation environment, which involved, for example, a buyer agent and a seller agent. The discussions about the results confront different negotiation sessions comparing agents provided with strategy and tactics reconfiguration capabilities and agents using static strategies and tactics.

关键词： Machine learning Genetic algorithms Proposals computer science Testing Learning systems Adaptive systems Search problems Optimization methods Intelligent agent

来源：评论

学校读者我要写书评

暂无评论

Advances in tangible interaction and ubiquitous virtual reality

Advances in tangible interaction and ubiquitous virtual real...

引用

作者： Hong, Dongpyo Höllerer, Tobias Haller, Michael Takemura, Haruo Cheok, Adrian David Kim, Gerard Jounghyun Billinghurst, Mark Woo, Woontack Hornecker, Eva Jacob, Robert J.K. Hummels, Caroline Ullmer, Brygg Schmidt, Albrecht Van Den Hoven, Elise Mazalek, Ali Gwangju Institute of Science and Technology Department of Computer Science University of California Santa Barbara Upper Austria University of Applied Sciences Department of Digital Media Infomedia Education Division Osaka University Cybermedia Center National University of Singapore Mixed Reality Lab. Keio University Department of Computer Science and Engineering Korea University Gwangju Institute of Science and Technology Open University Pervasive Interaction Lab. Department of Computer Science Tufts University Eindhoven University of Technology Department of Industrial Design Department of Computer Science Louisiana State University University of Duisburg Pervasive Computing and User Interface Engineering Group Essen Digital Media Program Georgia Institute of Technology

The first article reports on context-sensitive augmented-reality research presented at the 2007 International Symposium on Ubiquitous Virtual Reality. This student-organized event explored the use of contextual information, design principles, and effective user evaluation for developing AR applications for ubiquitous computing environments. The second article reports on The International Conference on Tangible and Embedded Interaction, the first conference series worldwide to focus on tangible and embedded interaction. The conference is interdisciplinary, covering the arts, hardware design, software toolkits for prototyping, and user studies and theory development. © 2006 IEEE.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：