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

International Conference on information Science, Signal Processing and Their Applications

作者： Chin, Y.S. Wasito, Ito Mohd Hashim, S.Z. Department of Software Engineering Faculty of Computer Science and Information Systems University Technology Malaysia Skudai Johor Bahru Malaysia Faculty of Computer Science University of Indonesia Jakarta Indonesia

ISBN: (纸本)9781424471676

In this research, we have extended the use of Kernel Dimensionality Reduction (KDR) in the context of semi supervised learning in particular for micro-array DNA clustering application. We have proposed a new model call K-means-KDR for survival analysis which we aimed to improve the genes classification performance and study the dimension of effective subspaces in cancer patient survival analysis. KDR method was extended and combined with the K-means clustering technique, Cox's proportional hazards regression model and log rank test where KDR contributes in gene classification to determine subgroups from the patient's group. Results from the experiments have indicated that our model has outperformed Support Vector Machines (SVM) in gene classification. We also observed that the best value for dimension of effective subspaces (K) for microarray DNA data is between 10%-20% of the total patients. © 2010 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Communication issues in parallel Conjugate Gradient method using a star-based network

Communication issues in parallel Conjugate Gradient method u...

引用

IEEE Conference on Open Systems

作者： Ismail, Leila Faculty of Information Technology Computer Science and Software Engineering UAE University P.O. Box 17551 Al-Ain United Arab Emirates

ISBN: (纸本)9781424490554

Conjugate Gradient (CG) method is an iterative linear solver which is used by many scientific and engineering applications to solve a linear system of algebraic equations. CG generates a heavy load of computation and therefore it slows the performance of the applications using it. Parallelizing CG is considered as a way to increase its performance. However, CG suffers from communication dependencies among its divisible loads. Most of the studies to parallelize CG concentrate on parallelizing its matrix-vector multiplication. In this paper, we answer the following questions: 1) what are the divisible loads in the CG, and 2) where is communication involved in the parallel CG. To answer 1), we highlight the different divisible data blocks in CG. To answer 2), we introduce a dependency graph among the different data blocks. We conduct experiments on a parallel CG implementation and evaluate communication cost. © 2010 IEEE.

关键词： Conjugate gradient method

来源：评论

学校读者我要写书评

暂无评论

Content-based news recommendation 1

引用

作者： Kompan, Michal Bieliková, Mária Institute of Informatics and Software Engineering Faculty of Informatics and Information Technologies Slovak University of Technology Ilkovičova 3 842 16 Bratislava 4 Slovakia

ISBN: (数字)9783642152085

ISBN: (纸本)3642152074

The information overloading is one of the serious problems nowadays. We can see it in various domains including business. Especially news represent area where information overload currently prevents effective information gathering on daily basis. This is more significant in connection to the web and news web-based portals, where the quality of the news portal is commonly measured mainly by the amount of news added to the site. Then the most renowned news portals add hundreds of new articles daily. The classical solution usually used to solve the information overload is a recommendation, especially personalized recommendation. In this paper we present an approach for fast content-based news recommendation based on cosine-similarity search and effective representation of the news. We experimented with proposed method in an environment of largest electronic Slovakia newspaper and present results of the experiments. © 2010 Springer-Verlag Berlin Heidelberg.

关键词： Portals

来源：评论

学校读者我要写书评

暂无评论

Compressing string data in a database by using q-grams

Compressing string data in a database by using q-grams

引用

2010 2nd International Conference on Computer engineering and technology, ICCET 2010

作者： Danesh, Amir Seyed Ahy, Abdollatif Department of Software Engineering Faculty of Computer Science and Information Technology University of Malaya 50603 Kuala Lumpur Malaysia Department of Computer Science and Engineering University of Guilan-Iran Iran

ISBN: (纸本)9781424463503

String data is ubiquitous, and its management has a particular importance. Managing string data, especially in databases is really prominent, for we see a large amount of this kind of data in usual databases and this issue persuade us to think about ways for compressing data with a good management. We can do this by using varied kinds of algorithms that nowadays we have. In this paper we present a new algorithm for compressing string data that based on approximate string processing. Commercial databases do not support approximate string queries directly, and it is a challenge to implement this functionality efficiently with user-defined functions. To do this we use small parts of each string that we call them q-gram, and processing them using standard methods available in the DBMS. We can implement this functionality on top of commercial databases by exploiting facilities already available in them. © 2010 IEEE.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Assessment of NER solutions against the first and second CALBC Silver Standard Corpus

引用

Journal of Biomedical Semantics 2011年第5期2卷 1-12页

作者： Rebholz-Schuhmann, Dietrich Yepes, Antonio Jimeno Li, Chen Kafkas, Senay Lewin, Ian Kang, Ning Corbett, Peter Milward, David Buyko, Ekaterina Beisswanger, Elena Hornbostel, Kerstin Kouznetsov, Alexandre Witte, René Laurila, Jonas B Baker, Christopher JO Kuo, Cheng-Ju Clematide, Simone Rinaldi, Fabio Farkas, Richárd Móra, György Hara, Kazuo Furlong, Laura I Rautschka, Michael Neves, Mariana Lara Pascual-Montano, Alberto Wei, Qi Collier, Nigel Chowdhury, Md Faisal Mahbub Lavelli, Alberto Berlanga, Rafael Morante, Roser Van Asch, Vincent Daelemans, Walter Marina, José Luís van Mulligen, Erik Kors, Jan Hahn, Udo European Bioinformatics Institute EMBL Outstation Hinxton Cambridge CB10 1SD United Kingdom Erasmus University Medical Center Dept. of Medical Informatics Rotterdam Netherlands St. John's Innovation Centre Linguamatics Ltd Cambridge United Kingdom Friedrich-Schiller-Universität Language and Information Engineering (JULIE) Lab Jena Germany University of New Brunswick Dept. of Computer Science and Applied Statistics Canada Concordia University Dept. of Computer Science and Software Engineering Montreal Canada Academia Sinica Institute of Information Science Taipei 115 Taiwan University of Zürich Switzerland Hungarian Academy of Sciences Research Group on Artificial Intelligence Hungary Nara Institute of Science and Technology Nara Japan IMIM (Hospital del Mar Research Institute) Universitat Pompeu Fabra Research Programme on Biomedical Informatics (GRIB) Barcelona Spain National Center for Biotechnology-CSIC Madrid Spain National Institute of Informatics Tokyo Japan Fondazione Bruno Kessler Trento Italy Universitat Jaume I Spain University of Antwerp CLiPS Belgium Complutense University of Madrid Spain

Background: Competitions in text mining have been used to measure the performance of automatic text processing solutions against a manually annotated gold standard corpus (GSC). The preparation of the GSC is time-consuming and costly and the final corpus consists at the most of a few thousand documents annotated with a limited set of semantic groups. To overcome these shortcomings, the CALBC project partners (PPs) have produced a large-scale annotated biomedical corpus with four different semantic groups through the harmonisation of annotations from automatic text mining solutions, the first version of the Silver Standard Corpus (SSC-I). The four semantic groups are chemical entities and drugs (CHED), genes and proteins (PRGE), diseases and disorders (DISO) and species (SPE). This corpus has been used for the First CALBC Challenge asking the participants to annotate the corpus with their text processing solutions. Results: All four PPs from the CALBC project and in addition, 12 challenge participants (CPs) contributed annotated data sets for an evaluation against the SSC-I. CPs could ignore the training data and deliver the annotations from their genuine annotation system, or could train a machine-learning approach on the provided pre-annotated data. In general, the performances of the annotation solutions were lower for entities from the categories CHED and PRGE in comparison to the identification of entities categorized as DISO and SPE. The best performance over all semantic groups were achieved from two annotation solutions that have been trained on the SSC-I. The data sets from participants were used to generate the harmonised Silver Standard Corpus II (SSC-II), if the participant did not make use of the annotated data set from the SSC-I for training purposes. The performances of the participants' solutions were again measured against the SSC-II. The performances of the annotation solutions showed again better results for DISO and SPE in comparison to CHED and P

关键词： Chemical Entity Cosine Similarity Semantic Type Semantic Group Annotate Corpus

来源：评论

学校读者我要写书评

暂无评论

An extension to data-flow-oriented formal specification language for specifying concurrent software systems

An extension to data-flow-oriented formal specification lang...

引用

10th International Conference on Quality software, QSIC 2010

作者： Chen, Yuting Liu, Shaoying Wang, Linzhang School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai 200240 China Faculty of Computer and Information Sciences Hosei University Tokyo Japan State Key Lab. for Novel Software Technology Nanjing University China

ISBN: (纸本)9780769541310

Data-flow-oriented formal specification languages, such as SOFL, bridge formal methods to industrial applications, allowing software developers to effectively use formal methods in developing practical software systems. In this paper, we introduce an extension to SOFL specification language for specifying concurrent software systems. SOFL is designed by integrating different notations and techniques on the basis that they are all needed to work together effectively in a coherent manner for specification constructions and verifications. We mainly introduce two notions, region and channel, to the SOFL language so that concurrency can be specified both graphically and formally, thus making SOFL specifications both intuitive and precise. © 2010 IEEE.

关键词： Specification languages

来源：评论

学校读者我要写书评

暂无评论

On Well-Formedness Rules for UML Use Case Diagram

引用

International Conference on Web information Systems and Mining

作者： Ibrahim, Noraini Ibrahim, Rosziati Saringat, Mohd Zainuri Mansor, Dzahar Herawan, Tutut Department of Software Engineering Faculty of Information Technology and Multimedia Universiti Tun Hussein Onn Malaysia Microsoft Malaysia Department of Mathematics Eduction Universitas Ahmad Dahlan Yogyakarta 55166 Indonesia

ISBN: (纸本)9783642165146

A software model is a widely used technique to specify software. A UML model may contain different diagrams and a diagram is built from different elements. Each element is restraint to certain constraint or well-formedness rules (WFR). Assurance to these WFR is important to ensure the quality of UML diagrams produced. Even though, the formal definition to UML elements is rapidly increased;there is still lack of formalization of WFR. Therefore, this paper will define the WFR for use case diagrams as it is ranked as one of the most used diagram among UML practitioners. The formalization is based on set theory by logic and quantification. Based on an example of a use case diagram, we show how the diagram satisfied the WFR. Then, the elements involved in the well-formedness problem are detected and formally reasoned.

关键词： UML Well-formedness rules Use case diagram Set Theory

来源：评论

学校读者我要写书评

暂无评论

Research on camera controlling driving simulator

Research on camera controlling driving simulator

引用

International Conference on information engineering and Computer Science

作者： Liu, Youquan Cui, Yu Xiao, Jie Wu, Enhua School of Information Engineering Chang'an University Xi'an China Institute of Software Chinese Academy of Sciences Beijing China Faculty of Science and Technology University of Macau China

ISBN: (纸本)9781424479412

This paper presents a vehicle driving simulator system with a traffic oriented visual modeler and a novel humancomputer interaction way. Especially, the driving is based on mixed reality technology which is equipped with a webcam and a paper printed with controlling markers. Then the paper is used as the virtual wheel to control the motion of the vehicle. At such low cost, many people can enjoy the virtual driving;it also provides an easy and interesting way for driving video games with promising business values. ©2010 IEEE.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

WIFI-based indoor positioning system

WIFI-based indoor positioning system

引用

2nd International Conference on Computer and Network technology, ICCNT 2010

作者： Lashkari, Arash Habibi Parhizkar, Behrang Ngan, Mike Ng Ah Kuala Lumpur Malaysia Faculty of Information Communication and Technology LIMKOKWING University of Creative Technology CYBERJAYA Selangor Malaysia Department of Software Engineering with Multimedia LIMKOKWING University of Creative Technology CYBERJAYA Selangor Malaysia

ISBN: (纸本)9780769540429

The easy access and availability of wireless technologies and mobile computing and internet have lead to new opportunities in developing mobile applications which purpose is to make people's life more easier. Nowadays, a person can possess more than one mobile device intend for different usage such as communication, entertainment, office works. This paper proposes a mobile application which will be able to estimate the position of a user within a building by using WIFI technology. © 2010 IEEE.

关键词： Indoor positioning systems

来源：评论

学校读者我要写书评

暂无评论

Interpretative key management (IKM), A novel framework

Interpretative key management (IKM), A novel framework

引用

2nd International Conference on Computer Research and Development, ICCRD 2010

作者： Chaeikar, Saman Shojae Razak, Shukor Abd Honarbakhsh, Shohreh Zeidanloo, Hossein Rouhani Zamani, Mazdak Jaryani, Farhang Centre for Advanced Software Engineering University Technology Malaysia 54100 Kuala Lumpur Malaysia Faculty of Computer Science and Information System University Technology Malaysia 54100 Kuala Lumpur Malaysia

ISBN: (纸本)9780769540436

Nowadays, we use cryptography keys to secure our communications. One of the common ways for securing data exchanging is via the use of symmetric keys to encipher transmitted data over network. Today's practices for managing keys face many issues in key generation, distribution, and revocation. In this paper we propose interpretative key management method which is simpler than the current practices. Eliminating the need for key storage, the need for key distribution, automatic key revocation, and unique key per session are the main features of the new proposed key management method. Deletion of some steps and replacing some others with new ones helped us to dominate many issues faced with common practices of key management. © 2010 IEEE.

关键词： Electronic data interchange

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：