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

31st Annual CHI Conference on Human Factors in Computing Systems:, CHI EA 2013

作者： Oh, Jeungmin Kim, Daehoon Lee, Uichin Lee, Jae-Gil Song, Junehwa Department of Knowledge Service Engineering KAIST Daejeon Korea Republic of Department of Knowledge Service Engineering KAIST Daejeon Korea Republic of Department of Knowledge Service Engineering KAIST Daejeon Korea Republic of Department of Knowledge Service Engineering KAIST Daejeon Korea Republic of Department of Computer Science KAIST Daejeon Korea Republic of

ISBN: (纸本)9781450318990

As users are interacting with a large of mobile apps under various usage contexts, user involvements in an app design process has become a critical issue. Despite this fact, existing apps or app store platforms only provide a limited form of user involvements such as posting app reviews and sending email reports. While building a unified platform for facilitating user involvements with various apps is our ultimate goal, we present our preliminary work on handling developers’ information overload attributed to a large number of app comments. To address this issue, we first perform a simple content analysis on app reviews from the developer’s standpoint. We then propose an algorithm that automatically identifies informative reviews reflecting user involvements. The preliminary evaluation results document the efficiency of our algorithm.

关键词： User centered design

来源：评论

学校读者我要写书评

暂无评论

A Seed-Based Inter-Domain Supervised Framework to Cluster Mixed Data Types

A Seed-Based Inter-Domain Supervised Framework to Cluster Mi...

引用

4th International Joint Conference on knowledge Discovery, knowledge engineering and knowledge Management, IC3K 2012

作者： Abdullin, Artur Nasraoui, Olfa Knowledge Discovery and Web Mining Lab Department of Computer Engineering and Computer Science University of Louisville Louisville KY United States

ISBN: (纸本)9783642541049

We propose a Seed-based Inter-Domain Supervised (IDS) framework to handle possibly diverse data formats, mixed-type attributes and different sources of data. This approach can be used for combining diverse representations of the data, in particular where data comes from different sources, some of which may be unreliable or uncertain, or for exploiting optional external concept set labels to guide the clustering of the main data set in its original domain. Unlike semi-supervised clustering, our approach exploits the synergy between different domains instead of external labels. Also ensemble clustering and our proposed IDS clustering are different mechanisms with distinct goals: (i) the former aims to combine independent clustering results from many independent subsets sampled from the same data set or from different clustering algorithm results on the same data set, into one consensus, (ii) while the latter (IDS) aims to exploit a mutual synergy between different data domains or sources to guide the clustering in these different domains or sources. Our preliminary results in clustering data with mixed numerical and categorical attributes show that the proposed IDS framework gives better clustering results in the categorical domain. Thus the seeds or the constraints obtained from clustering the numerical domain give an additional knowledge to the categorical clustering algorithm. Additional results show that our approach outperforms clustering either domain on its own or clustering both domains converted to the same target domain. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Prediction of multiple sequence alignment based on an improved particle swarm optimization

引用

Journal of Bionanoscience 2013年第1期7卷 92-96页

作者： Gao, Yu-Xi Wang, Yan-Min Pei, Zhi-Li Department of Computer Science Jilin Business and Technology College China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University China College of Computer Science and Technology Inner Mongolia University for the Nationalities Tongliao 028000 China

In this paper we use an improved Particle Swarm Optimization algorithm to solve Multiple Sequence Alignment (MSA). MSA is a key problem in bioinformatics. The thesis starts with the theory of Particle swarm optimization algorithm and the design an improved algorithm for Multiple Sequence Alignment. The simulated experiments show that the improved algorithm surpasses existing algorithms in performance. Copyright © 2013 American Scientific Publishers.

关键词： Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

Distance-based feature selection from probabilistic data

Distance-based feature selection from probabilistic data

引用

14th International Conference on Web-Age Information Management, WAIM 2013

作者： Zhao, Tingting Pei, Bin Zhao, Suyun Chen, Hong Li, Cuiping Key Lab of Data Engineering and Knowledge Engineering Ministry of Education China Department of Computer Science Renmin University of China China

ISBN: (纸本)9783642385612

Feature selection is a powerful tool of dimension reduction from datasets. In the last decade, more and more researchers have paid attentions on feature selection. Further, some researchers begin to focus on feature selection from probabilistic datasets. However, in the existing method of feature selection from probabilistic data, the distance hidden in probabilistic data is neglected. In this paper, we design a new distance measure to select informative feature from probabilistic databases, in which both the distance and randomness in the data are considered. And then, we propose a feature selection algorithm based on the new distance and develop two accelerative algorithms to boost the computation. Furthermore, we introduce a parameter into the distance to reduce the sensitivity to noise. Finally, the experimental results verify the effectiveness of our algorithms. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Random processes

来源：评论

学校读者我要写书评

暂无评论

Internet of Things Enabled Energy Efficient Green Communication on FPGA

Internet of Things Enabled Energy Efficient Green Communicat...

引用

International Conference on Computational Intelligence and Communication Networks (CICN)

作者： Karandeep Kaur Bishwajeet Pandey Jagdish Kumar Abhishek Jain Parminder Kaur Department of Electronics and Communication Chitkara University Punjab India Chitkara University Innovation Network Punjab India National Knowledge Network Lab Indian Institute of Information Technology Gwalier India Department of Computer Science and Engineering Chitkara University Department of M.Tech D.A.V University Jalandhar India

ISBN: (纸本)9781479969302

In this paper, we observed the vast effect of internet on our lives. Internet has acquired a space in our everyday work and we are in a way dependent on it. This paper inspired by Internet of Things concept and presents a way through which electronic circuits and other devices can have a small key integrated with them. The key will be a sort of address for the device. To accomplish this task, we have designed a Fibonacci generator in Xilinx software. The Fibonacci Generator is energy efficient and its role is to generate the key for the communication to take place. The generated key will act as a code for that device. Our analysis records dynamic power consumed for various frequencies by various I/O standards including SSTL18_I, SSTL18_II, HSTL_I and HSTL_II. Then these standards are compared and the best one is selected for making our design of Fibonacci generator to possess green communication and energy efficient.

关键词： Standards Generators Energy efficiency Power demand Internet of things Clocks Green products

来源：评论

学校读者我要写书评

暂无评论

Dynamic Time Division Multiple Access Algorithm for Industrial Wireless Hierarchical Sensor Networks

引用

China Communications 2013年第5期10卷 137-145页

作者：杨彦红张晓彤罗琼李文超 School of Computer and Communication Engineering University of Science and Technology Beijing Department of Computer Science and Engineering Lehigh University Beijing Key Laboratory of Knowledge Engineering for Materials Science

Industrial wireless sensor networks adopt a hierarchical structure with large numbers of sensors and routers. Time Division Multiple Access (TDMA) is regarded as an efficient method to reduce the probability of confliction. In the intra-cluster part, the random color selection method is effective in reducing the retry times in an application. In the inter-cluster part, a quick assign algorithm and a dynamic maximum link algorithm are proposed to meet the quick networking or minimum frame size requirements. In the simulation, the dynamic maximum link algorithm produces higher reductions in the frame length than the quick assign algorithm. When the number of routers is 140, the total number of time slots is reduced by 25%. However, the first algorithm needs more control messages, and the average difference in the number of control messages is 3 410. Consequently, the dynamic maximum link algorithm is utilized for adjusting the link schedule to the minimum delay with a relatively high throughput rate, and the quick assign algorithm is utilized for speeding up the networking process.

关键词： TDMA wireless sensor network industrial wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

Improving EHR and patient empowerment based on dynamic knowledge assets 43

Improving EHR and patient empowerment based on dynamic knowl...

引用

43. Jahrestagung der Gesellschaft fur Informatik e.V. ,GI, Informatik Angepasst an Mensch, Organisation und Umwelt, Informatik 2013 - 43rd Annual Meeting of the German Informatics Society (GI), computer science Adapting to Individuals, Organizations and Environment, Informatics 2013

作者： Nasiri, Sara Dornhöfer, Mareike Fathi, Madjid Institute of Knowledge Based Systems & Knowledge Management Department of Electrical Engineering & Computer Science University of Siegen Hölderlinstr. 3 Siegen57076 Germany

ISBN: (纸本)9783885796145

Patients like to keep track of their health related issues and Personal Health Records can be useful for managing their health related information. On the other hand, Electronic Health Records also offer medical professionals an insight into the medical profile of the patient, based on examinations, results or treatments. This work proposes the enrichment of these records with data from Personal Health Records as well as data from a patient care social network. For supporting this conceptual approach and sustaining long-term healthcare, Dynamic knowledge Asset Management is considered. Tracking data and process changes is made possible. © 2013 Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI).

关键词： knowledge management

来源：评论

学校读者我要写书评

暂无评论

Top-k neighborhood dominating query

Top-k neighborhood dominating query

引用

18th International Conference on Database Systems for Advanced Applications, DASFAA 2013

作者： Xie, Xike Lu, Hua Chen, Jinchuan Shang, Shuo Department of Computer Science Aalborg University Denmark Key Labs of Data Engineering and Knowledge Engineering MOE Renmin University of China China

ISBN: (纸本)9783642374869

In many real-life applications, spatial objects are associated with multiple non-spatial attributes. For example, a hotel may have price and rating in addition to its geographic location. In traditional spatial databases, spatial objects are often ranked solely based on their distance to a given query location, e.g., in a nearest neighbor search. In another line of research, domination based skyline queries are used to return best objects according to multi-criteria on non-spatial attributes. In this paper, we study how to rank spatial objects with respect to their non-spatial attributes within their spatial neighborhoods. To enable a general ranking, we design a ranking function that inherits the advantages of dominance relationship and integrates them with spatial proximity. Further, we propose an effective index structure, and a branch and bound solution that executes the ranking efficiently via the index. We conduct extensive empirical studies on real and synthetic datasets. The results demonstrate the high efficiency of our proposal compared to straightforward alternatives. © Springer-Verlag 2013.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

Diagnosis of breast cancer by tissue analysis

引用

Chinese Journal of Cancer Research 2013年第1期25卷 39-45页

作者： Debnath Bhattacharyya Samir Kumar Bandyopadhyay Tai-hoon Kim Computer Science and Engineering Department NFET NSHM Knowledge Campus-Durgapur Department of Computer Science and Engineering University of Calcutta School of Computing and Information Systems University of Tasmania Australia

In this paper, we propose a technique to locate abnormal growth of cells in breast tissue and suggest further pathological test, when require. We compare normal breast tissue with malignant invasive breast tissue by a series of image processing steps. Normal ductal epithelial cells and ductal/lobular invasive carcinogenic cells also consider for comparison here in this paper. In fact, features of cancerous breast tissue （invasive） are extracted and analyses with normal breast tissue. We also suggest the breast cancer recognition technique through image processing and prevention by controlling p53 gene mutation to some extent.

关键词： Mammography drug administration edge detection epithelium

来源：评论

学校读者我要写书评

暂无评论

Collecting links between entities ranked by human association strengths

Collecting links between entities ranked by human associatio...

引用

10th International Conference on The Semantic Web: Semantics and Big Data, ESWC 2013

作者： Hees, Jörn Khamis, Mohamed Biedert, Ralf Abdennadher, Slim Dengel, Andreas Computer Science Department University of Kaiserslautern Germany Knowledge Management Department DFKI GmbH Kaiserslautern Germany Computer Science and Engineering Department German University in Cairo Egypt Tobii Technology AB Stockholm Sweden

ISBN: (纸本)9783642382871

In recent years, the ongoing adoption of Semantic Web technologies has lead to a large amount of Linked Data that has been generated. While in the early days of the Semantic Web we were fighting data scarcity, nowadays we suffer from an overflow of information. In many situations we want to restrict the amount of facts which is shown to an end-user or passed on to another system to just the most important ones. In this paper we propose to rank facts in accordance to human association strengths between concepts. In order to collect a ground truth we developed a Family Feud like web-game called knowledge Test Game. Given a Linked Data entity it collects other associated Linked Data entities from its players. We explain the game's concept, its suggestion box which maps the players' text input back to Linked Data entities and include a detailed evaluation of the game showing promising results. The collected data is published and can be used to evaluate algorithms which rank facts. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Linked data

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：