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

Malaysian Conference in Software Engineering (MySEC)

作者： Rusli Abdullah Zeti Darleena Eri Amir Mohamed Talib Faculty of Computer Science & IT Information System Department Universiti Putra Malaysia Serdang Selangor Darul Ehsan Malaysia Faculty of Computer & Mathematical Sciences Universiti Technology MARA Shah Alam Selangor Darul Ehsan Malaysia Faculty of Computer Science & IT Information System Department University of Putra Malaysia Serdang Selangor Darul Ehsan Malaysia

Software testing is the process on how to identify and deliver the software as a product based on the specification that has been given and required by the users. In order to ensure that the product is working based on the user specification, there are many people who are working together for that purposes as a community of practice (CoP). The CoP in software testing environment is including the system designer, programmer, and system tester as well as the user by himself. Based on this scenario of working together or collaboratively in order to avoid a lot of mistake or errors and causes the software failure, which may be found during the processes of software testing process, so that there is a need for CoP to have a tool called knowledge management system (KMS) in managing the knowledge of best practice and lesson learnt. The paper will discuss the concept on how the KMS is offering of its processes through knowledge life cycle which starting from knowledge acquisition, knowledge storing, knowledge dissemination, and knowledge application. Therefore, by using the model of KMS in managing knowledge of software testing, CoP can utilize the knowledge in KMS and it will reduces the mistake or errors, so that they can delivered a good product besides to enhance the quality of software of the particular users.

关键词： Software testing Knowledge management Software Knowledge engineering Organizations computers

来源：评论

学校读者我要写书评

暂无评论

Ontology-based knowledge model for virtual communities profile

Ontology-based knowledge model for virtual communities profi...

引用

Malaysian Conference in Software Engineering (MySEC)

作者： Zeti Darleena Eri Rusli Abdullah Marzanah A. Jabar Masrah Azrifah Azmi Murad Faculty of Computer & Mathematical Sciences Universiti Technology MARA Shah Alam Selangor Darul Ehsan Malaysia Faculty of of Computer Science & IT Information System Department Universiti Putra Malaysia Serdang Selangor Darul Ehsan Malaysia Faculty of of Computer Science & IT Information System Department University of Putra Malaysia Serdang Selangor Darul Ehsan Malaysia

Knowledge management (KM) system is develop to support the organizational knowledge process of knowledge acquisition, knowledge organization, knowledge dissemination and knowledge application. The KM system must be able to support virtual communities (VC) of an organization. In order to determine the potential member of VC, the KM system should define, identify and structure VC based on its profile and knowledge. The process of VC classification based on knowledge and profile are not an easy process. The ontology based knowledge model will become essential in classifying and structuring knowledge of VC in an organization and many organizations has recognized that knowledge is a powerful asset. The aim of the paper is to analyze and promote the ontology based knowledge model VC profile in KM system so that the process of VC classification can be done. And later, the ontology based knowledge model VC profile can be use to standardize the classification of VC in KM system. The model can be reused and shared for other purposes. The knowledge models were developed and applied in the research and development (R&D) as a case study. Finally, the study will provide a holistic view that combines both usability and sociability factors in which often isolated when developing a KM system.

关键词： Communities Ontologies Organizations Standards organizations Knowledge management Knowledge acquisition

来源：评论

学校读者我要写书评

暂无评论

Assessing of Physiological Arousal and Cognitive Anxiety toward Academic Performance: The Application of Catastrophe Model

引用

Procedia - Social and Behavioral Sciences 2011年 30卷 615-619页

作者： Prima Vitasari Muhammad Nubli Abdul Wahab Tutut Herawan Suriya Kumar Sinnadurai Ahmad Othman Muhamad Ghani Awang Faculty of Manufacturing Engineering and Technology Management Center of Modern Language and Human Science Faculty of Computer System and Software Engineering Universiti Malaysia Pahang Lebuhraya Tun Razak 26300 Kuantan Pahang Malaysia

The Catastrophe model in which the theory attempts to explain the interaction of physiological arousal cognitive anxiety affect on sport's performance. The model is important to understand the influence of anxiety upon performance. This research proposes a model to understand the effect of anxiety upon academic performance. The research consists with finding on the Catastrophe model of anxiety upon sport's performance. A total 135 students were participated in this study conducted during 2 nd semester. The physiological arousal was measured using heart rate sensor and respiration sensor. Meanwhile, cognitive anxiety was measure using State Trait Anxiety Inventory (STAI) and Study Anxiety Scale (SAS). Furthermore, Grade Point Average (GPA) is employed to predict students’ academic performance. For assessment, the Pearson correlation was used to assess the physiological arousal and cognitive anxiety toward academic performance. The finding shows that high level of physiological arousal and cognitive anxiety is a significant factor that creates low academic performance. Based on the finding, it is concluded that the model can be use to comprehend of relationship between anxiety toward academic performance.

关键词： physiological arousal cognitive anxiety student catastrophe academic performance

来源：评论

学校读者我要写书评

暂无评论

Hippocampal shape analysis in epilepsy using Laplace-Beltrami spectrum

Hippocampal shape analysis in epilepsy using Laplace-Beltram...

引用

作者： Shishegar, Rosita Soltanian-Zadeh, Hamid Moghadasi, Seyed Reza Faculty of Engineering School of Electrical and Computer Engineering University of Tehran Tehran 14395-515 Iran Radiology Image Analysis Laboratory Henry Ford Health System Detroit MI 48202 United States Department of Mathematics Sharif University of Technology Tehran Iran

ISBN: (纸本)9789644634284

Shape analysis plays an important role in many medical imaging studies. One of the recent shape analysis methods uses the Laplace Beltrami eigenvalues which is also used in this paper for global shape comparison of hippocampus of normal subjects and epileptic patients. Popularity of the Laplace Beltrami operator in this field is due to its isometry-invariance which avoids pre-processing steps like mapping, registration, and alignment. In addition, it is capable of revealing fine details in shapes that makes this method a good choice for deformation detecting purposes like epilepsy diagnosis. To examine capability of the proposed method, statistical analysis and two ways of classification, support vector machine (SVM) and finding out of normal range (ONR) subjects, are used. Moreover, to evaluate our classification results, K-fold cross-validation is performed. The best achieved results were true positive rate of 91.9% and false positive rate of 33.3%, yielded by ONR classifiers using 3 selected eigenvalues. © 2011 AmirKabir Univ of Tech.

关键词： Statistical methods

来源：评论

学校读者我要写书评

暂无评论

Evaluation of a new Backtrack Free path planning Algorithm for two manipulators

Evaluation of a new Backtrack Free path planning Algorithm f...

引用

International Conference on Research and Innovation in Information systems (ICRIIS)

作者： Md. Nazrul Islam J. Gallardo-Alvarado Shinsuke Tamura Faculty of Computer Science and Information System University Technology of Malaysia Skudai Johor Malaysia Graduate School of Engineering University of Fukui Fukui Japan

This paper describes a path planning algorithm for calculates collision free path of two manipulators in a populated environment for 2 or 3-dimensional workspace. In the algorithm, two manipulators are considered as a single composite one. A newly developed path planning algorithm BFA (Backtrack Free path planning Algorithm) enables the efficient generation of paths of this composite manipulator with many arms. BFA is an exact algorithm, i.e. the algorithm is backtrack free and resolution complete. Its computation time and memory space are proportional to the total number of arms in composite manipulators. Therefore paths can be calculated within practical and predetermined time even for manipulators with many arms, and it becomes possible to plan complicated motions of multi-arm manipulators in fully automated environments. The performance of BFA is evaluated for 2-dimensional environments. An additional advantage of this approach is that paths of individual manipulators can be calculated in parallel processing.

关键词： Manipulators Path planning Algorithm design and analysis Joints Real time systems Position measurement

来源：评论

学校读者我要写书评

暂无评论

Extracting highly positive association rules from students’ enrollment data

引用

Procedia - Social and Behavioral Sciences 2011年 28卷 107-111页

作者： Zailani Abdullah Tutut Herawan Noraziah Ahmad Mustafa Mat Deris Department of Computer Science Universiti Malaysia Terengganu 21030 Kuala Terengganu Terengganu Malaysia Faculty of Computer System and Software Engineering Universiti Malaysia Pahang Lebuhraya Tun Razak 26300 Kuantan Pahang Malaysia Faculty of Computer Science and Information Technology Parit Raja Batu Pahat 86400 Johor Malaysia

Association Rules Mining is one of the popular techniques used in data mining. Positive association rules are very useful in correlation analysis and decision making processes. In educational context, determine a “right” program to the students is very unclear especially when their chosen programs are not selected. In this case, normally they will be offered to other programs based on the programs availability and not according to their program's field interests. The main concern is, by assigning inappropriate program which is not reflected their overall interest; it may create serious problems such as poorly in academic commitment and academic achievement. Therefore, Therefore in this paper, we proposed a model which consists of pre-processing, mining patterns and assigning weight to discover highly positive association rules. We examined the previous chosen programs by computer science students in our university for July 2008/2009 intake. The result shows that the proposed model can mine association rules with high correlation. Moreover, for data analysis, there are existed students that have been offered in computer science program at our university but not within their program's field interests.

关键词： Positive association rules Educational Progams

来源：评论

学校读者我要写书评

暂无评论

Trust levels in peer-to-peer (P2P) vehicular network

Trust levels in peer-to-peer (P2P) vehicular network

引用

2011 11th International Conference on ITS Telecommunications, ITST 2011

作者： Sumra, Irshad Ahmed Hasbullah, Halabi Manan, J. Ab Iftikhar, Mohsan Ahmad, Iftikhar Aalsalem, Mohammed Y. Computer and Information Sciences Department Universiti Teknologi PETRONAS Bandar Seri Iskandar 31750 Tronoh Perak Malaysia Advanced Information Security Cluster MIMOS Berhad Technology Park Malaysia Kuala Lumpur Malaysia CCIS King Saud University P.O. Box 51178 Riyadh 11543 Saudi Arabia Faculty of Computer and Information System Jazan University Saudi Arabia

ISBN: (纸本)9781612846712

Security is one of the most important issues in new life saving vehicular network, whereas trust is key component of security in vehicular applications. These applications serve users when components (user, vehicle and RSU) of the network behave in an expected manner in peer to peer vehicular communication. Whenever any component of the network unexpectedly changes their behavior then it would be harmful for other users of the network. In this paper, we are proposed three different trust levels in peer to peer vehicular network. Purpose of proposed trust levels to discuss in detail is the functionality of different component of network which circumvents the attacker and emphasizes the role of trusted users in peer to peer vehicular communication. © 2011 IEEE.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Data Gathering for Periodic Sensor Applications

Data Gathering for Periodic Sensor Applications

引用

IEEE International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)

作者： Khaled Almi'ani Mohammed Aalsalem Rafeeq Al-Hashemi Faculity of Information Technology Al-Hussein Bin Talal University Maan Jordan Faculty of Computer and Information System Jazan University Jazan Saudi Arabia

In this paper we consider the problem of data gathering in wireless sensor network using Mobile Elements. In particular, we consider the situations where the data produced by the nodes must be delivered to the sink within a pre-defined time interval. Mobile elements travel the network and collect the data of nodes, and deliver them to the sink. Each node must be visited by a mobile element, which then must deliver this node data to the sink with the given time interval. The goal is to plan the tours of the mobile elements that minimize the total travelling time. Several variations of this problem have been investigated in the literature. We propose an algorithmic solution that outperforms that best known comparable scheme for this problem by an average of 40%.

关键词： Mobile communication Clustering algorithms Mobile computing Approximation algorithms Benchmark testing Partitioning algorithms Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Improve TCP performance over mobile ad hoc network by retransmission timeout adjustment

Improve TCP performance over mobile ad hoc network by retran...

引用

International Conference on Communication Software and Networks, ICCSN

作者： Mohammad Amin Kheirandish Fard Kamalrulnizam Abu Bakar Sasan Karamizadeh Roozbeh Hojabri Foladizadeh Department of Computer system and Communication Universiti Teknologi Malaysia Johor Malaysia Faculty of Information Technology Multimedia Universiiy Cyberjaya Selangor Darul Ehsan Malaysia

Conventional TCP suffers from inability to detect frequent link failure in MANET and consequently could not adjust RTO for reconstructed route. Packet losses due to link breakage must be differentiated from congestion loss to discover link breakage. Moreover, after link breakage, retransmission timeout in standard TCP becomes too long due to successive back-off executions. Using this long RTO for rebuilt route forces sender to remain idle unnecessarily in case of future packet loss. In this paper, a new End-to-End approach which entirely works in transport layer is proposed to improve TCP performance. It distinguishes link failure loss from congestion loss based on fluctuation in history of queue usage rate. Ascending growth of queue usage value intensifies probabilities of congestion losses while averaged queue usage values around fixed value can be sign of link failure losses. After temporary link failure detected and packets from rebuilt route received, new approach compares characteristics of reestablished route with broken route in term of Relative On-way Trip Time and number of Hops. Then sender decides to increases RTO to prevent packet retransmission overhead or decreases RTO to resume transmission during unnecessary idle time. Simulation results which are done under different conditions by ns2 illustrated that new approach enhances TCP performance up to 10%.

关键词： Mobile computing Wireless networks Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Searching pareto solutions for bi-objective series k-out-of-N system component allocation problems using the breadth first search method

引用

Journal of Japan Industrial Management Association 2011年第6期61卷 355-364页

作者： Tsujimura, Yasuhiro Yamachi, Hidemi Yamamoto, Hisashi Kambayashi, Yasushi Department of Computer and Information Engineering Nippon Institute of Technology Miyashiro Saitama 345-8501 Japan Faculty of System Design Tokyo Metropolitan University Hino Tokyo 191-0065 Japan

A series-parallel system is one of the most popular redundant system models. It consists of subsystems that are connected in series and each subsystem consists of interchangeable components in parallel. There are two types of such systems: all components can work for all subsystems, or the components consisting of a certain subsystem can work only in that specific subsystem. For the first case, there are some heuristic methods to approximately solve the optimal component allocation. Yamachi et al. [9,10] proposed an algorithm that obtains the exact Pareto solutions for problems that are not so large, and a solution method that obtains approximate solutions for large problems. The method was based on an evolutional algorithm. For the second case, Yamachi et al. [13] proposed the depth first search (DFS) algorithm that obtains exact Pareto solutions using the branch and bound method. The method is made for a series k-out-of-n system, which is a system consisting of k-out-of-N subsystems that are connected in series. In this paper, we propose an alternate method for the second case;a new algorithm that employs the breadth first search (BFS) method to find Pareto solutions for a series k-out-of-n system more efficiently than the existing algorithm.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：