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

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

来源：评论

学校读者我要写书评

暂无评论

Fast SimRank computation over disk-resident graphs

Fast SimRank computation over disk-resident graphs

引用

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

作者： Zhang, Yinglong Li, Cuiping Chen, Hong Sheng, Likun Key Lab of Data Engineering and Knowledge Engineering of Ministry of Education And Department of Computer Science Renmin University of China China JiangXi Agricultural University China

ISBN: (纸本)9783642374494

There are many real-world applications based on similarity between objects, such as clustering, similarity query processing, information retrieval and recommendation systems. SimRank is a promising measure of similarity based on random surfers model. However, the computational complexity of SimRank is high and several optimization techniques have been proposed. In the paper optimization issue of Sim-Rank computation in disk-resident graphs is our primary focus. First we suggest a new approach to compute *** we propose optimization techniques that improve the time cost of the new approach from O (kN2 D2) to O (kNL), where k is the number of iteration, N is the number of nodes, L is the number of edges, and D is the average degree of nodes. Meanwhile, a threshold sieving method is presented to reduce storage and computational cost. On this basis, an external algorithm computing SimRank in disk-resident graphs is introduced. In the experiments, our algorithm outperforms its opponent whose computation complexity also is O (kNL). © Springer-Verlag 2013.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

ExerSync: Facilitating interpersonal synchrony in social exergames 13

ExerSync: Facilitating interpersonal synchrony in social exe...

引用

2013 2nd ACM Conference on computer Supported Cooperative Work, CSCW 2013

作者： Park, Taiwoo Lee, Uichin Lee, Bupjae Lee, Haechan Son, Sanghun Song, Seokyoung Song, Junehwa Department of Computer Science KAIST Daejeon 305-701 Korea Republic of Department of Knowledge Service Engineering KAIST Daejeon 305-701 Korea Republic of

ISBN: (纸本)9781450313315

Social exergames provide immersive experiences of social interaction via online multiplayer games, ranging from simple group exercises (e.g., virtual cycling/rowing) to more structured multiplayer games (e.g., cooperative boat racing). In exergame design, interpersonal synchrony plays an important role as it enhances social rapport and prosocial behavior. In this paper, we build ExerSync platform that supports various assistive mechanisms for facilitating interpersonal synchrony even with heterogeneous exercise modalities. We consider a rhythm of body movements in repetitive aerobic exercises and explore the design space of incorporating rhythm into exergames. We build a prototype system and comparatively evaluate the effectiveness of various assistive mechanisms. The experiment results show that rhythm significantly lowers the perceived workloads and provides better competence and engagement, but the accuracy of interpersonal synchrony is not dependent on the use of rhythm. Copyright 2013 ACM.

关键词： Interactive computer systems

来源：评论

学校读者我要写书评

暂无评论

Semantic interpretation of mobile phone records exploiting background knowledge 12

Semantic interpretation of mobile phone records exploiting b...

引用

12th International Semantic Web Conference, ISWC 2013

作者： Dashdorj, Zolzaya Serafini, Luciano Semantic and Knowledge Innovation Lab. Telecom Italia Italy Department of Information Engineering and Computer Science University of Trento Italy Data and Knowledge Management Unit Fondazione Bruno Kessler Italy

The increasing availability of massive mobile phone call data records (CDR) has opened new opportunities for analyzing and understanding real-life social phenomena and human dynamics. In order to better interpret this enormous amount of data it is useful to contextualize them with information about the circumstances under which they has been generated. Nowadays, linked open data initiative provide access to a huge amount of geo-time referenced knowledge about territory and events that happen in the territory. These informations can be used to characterize the aforementioned context. The aim of this Ph.D is to investigate on the intercorrelations between CDR, contexts, and human behaviors. The ultimate goal is to build a stochastic model, that can be used to predict semantic (qualitative) behavioral patterns on the basis of CDR traffic and context and identify and explain anomalous situations on the basis of deviations from standard CDR patterns.

关键词： knowledge management

来源：评论

学校读者我要写书评

暂无评论

Convergence of Monte Carlo tree search in simultaneous move games

Convergence of Monte Carlo tree search in simultaneous move ...

引用

27th Annual Conference on Neural Information Processing Systems, NIPS 2013

作者： Lisý, Viliam Kovařík, Vojtěch Lanctot, Marc Bošanský, Branislav Agent Technology Center Dept. of Computer Science and Engineering FEE Czech Technical University in Prague Czech Republic Department of Knowledge Engineering Maastricht University Netherlands

We study Monte Carlo tree search (MCTS) in zero-sum extensive-form games with perfect information and simultaneous moves. We present a general template of MCTS algorithms for these games, which can be instantiated by various selection methods. We formally prove that if a selection method is Ε-Hannan consistent in a matrix game and satisfies additional requirements on exploration, then the MCTS algorithm eventually converges to an approximate Nash equilibrium (NE) of the extensive-form game. We empirically evaluate this claim using regret matching and Exp3 as the selection methods on randomly generated games and empirically selected worst case games. We confirm the formal result and show that additional MCTS variants also converge to approximate NE on the evaluated games.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：