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

10th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2008

作者： Lakshmanan, K. Anand, M. Krithivasan, Kamala School of Computing Sciences VIT University Vellore - 632 014 India Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai - 600 036 India

ISBN: (纸本)9780919013568

Several complexity measures and levels of ambiguity were defined for internal contextual grammars. In this paper, we consider the following trade-off between ambiguity and measures of these grammars. When a minimal complexity measure M1 is chosen for a language L, the corresponding grammar is ambiguous. Conversely, when an unambiguous grammar is chosen for L, the grammar is not minimal in M1. We introduce a new notion in formal language theory, named pseudo inherently ambiguous languages.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

SVM ranking with backward search for feature selection in type II diabetes databases

SVM ranking with backward search for feature selection in ty...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Sarojini Balakrishnan Ramaraj Narayanaswamy Nickolas Savarimuthu Rita Samikannu Department of Computer Applications K.L.N. College of Information Technology Madurai India Department of Computer Science & Engineering GKM College of Engineering and Technology Chennai India Department of Computer Applications National Institute of Technology Tiruchirappalli India VIT Business School Vellore of Institute of Technology Vellore India

Clinical databases have accumulated large quantities of information about patients and their clinical history. Data mining is the search for relationships and patterns within this data that could provide useful knowledge for effective decision-making. Classification analysis is one of the widely adopted data mining techniques for healthcare applications to support medical diagnosis, improving quality of patient care, etc. Usually medical databases are high dimensional in nature. If a training dataset contains irrelevant features (i.e., attributes), classification analysis may produce less accurate results. Data pre-processing is required to prepare the data for data mining and machine learning to increase the predictive accuracy. Feature selection is a preprocessing technique commonly used on high-dimensional data and its purposes include reducing dimensionality, removing irrelevant and redundant features, reducing the amount of data needed for learning, improving algorithms' predictive accuracy, and increasing the constructed models' comprehensibility. Much research work in data mining has gone into improving the predictive accuracy of the classifiers by applying the techniques of feature selection. The importance of feature selection in medical data mining is appreciable as the diagnosis of the disease could be done in this patient-care activity with minimum number of features. Feature selection may provide us with the means to reduce the number of clinical measures made while still maintaining or even enhancing accuracy and reducing false negative rates. In medical diagnosis, reduction in false negative rate can, literally, be the difference between life and death. In this paper we propose a feature selection approach for finding an optimum feature subset that enhances the classification accuracy of Naive .Bayes classifier. Experiments were conducted on the Pima Indian Diabetes Dataset to assess the effectiveness of our approach. The results confirm that SVM Rank

关键词： Support vector machines Diabetes Spatial databases Data mining Accuracy Support vector machine classification Medical diagnosis Medical diagnostic imaging History Decision making

来源：评论

学校读者我要写书评

暂无评论

Application of Parallelism SQL in Fuzzy Relational Databases

Application of Parallelism SQL in Fuzzy Relational Databases

引用

International Conference on computer science and Information technology (CSIT)

作者： Hrudaya Ku Tripathy B.K. Tripathy Pradip K. Das Saraju Pr. Khadanga Department of Computer Science & Engineering Institute of Advanced Computer & Research RAYAGADA ORISSA INDIA Department of Computer Science & Engineering Institute of Advanced Computer and Research Rayagada Orissa India School of Computing Sciences VIT University Vellore Tamil Nadu India Department of Computer Science & Engineering Indian Institute of Technology Guwahati North Guwahati Assam INDIA Department of Computer Science & Engineering Indian Institute of Technology Guwahati North Guwahati Assam India

Recently, new applications have emerged that require database management systems with uncertainty capabilities. Many of the existing approaches to modeling uncertainty in database management systems are based on the theory of fuzzy sets. This paper introduces basic parallelism in fuzzy relational databases and its queries. Article describes basic characteristics of fuzzy relational databases and their properties, compares fuzzy logic with Boolean one in connection with fuzzy relational databases. Deal with data classification and form of storage fuzzy data in database systems. Paper describes fuzzy queries and parallelism in queries from view of today's systems and their connection to SQL language and its extension fuzzy SQL. Discuss about pipeline parallelism of query operators and its benefits.

关键词： Databases Relational databases Parallel processing Database systems Fuzzy sets Humans Database languages

来源：评论

学校读者我要写书评

暂无评论

Modeling multimedia workflow patterns using dynamic petri nets and orc

Modeling multimedia workflow patterns using dynamic petri ne...

引用

2007 2nd International Conference on Digital Information Management, ICDIM

作者： Elias, Susan Palaniappan, V. Easwarakumar, K.S. Mathew, Lisa Chbeir, Richard Department of Computer Science and Engineering Sri Venkateswara College of Engineering Chennai - 602 105 India Department of Computer Science and Engineering Anna University Chennai - 600 025 India Department of Mathematics Vellore Institute of Technology Vellore 632014 India CS Department LE2I - Bourgogne University Dijon France

ISBN: (纸本)1424414768

In distributed multimedia presentation systems, a workflow is defined to specify which activities need to be executed and in which order. Workflows need to be modeled and verified for effective synchronisation during playout. To model several of these workflows, high-level petri nets have been commonly used. However, petri nets are not suitable for distributed applications and most of them are limited in their capability in modeling workflows having multiple instances with or without a priori runtime knowledge. In this paper, we address the modeling of complex workflow patterns and propose a new approach able to both represent complex distributed multimedia presentation using Dynamic Petri Nets(DPNs) and to translate a verified set of specifications into the new deterministic programming language Orc. DPNs are programmable petri nets that can: efficiently model user interactions and synchronised iterative playouts, and ensure that they represent consistent presentations, while Orc allows providing easy implementations using a set of powerful constructs. ©2007 IEEE.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Internal contextual grammars for mildly context-sensitive languages

引用

Research on Language and Computation 2007年第2期5卷 181-197页

作者： Kuppusamy, Lakshmanan Krishna, Shankara Narayanan Raghavan, Rama Martin-Vide, Carlos School of Technology and Computer Science Tata Institute of Fundamental Research Mumbai 400 005 Homi Bhabha Road India School of Computing Sciences VIT University Vellore 632 014 India Department of Computer Science and Engineering Indian Institute of Technology Bombay Powai Mumbai 400 076 India Department of Mathematics Indian Institute of Technology Madras Chennai 600 036 India Research Group on Mathematical Linguistics Rovira i Virgili University Tarragona 43005 Pl. Imperial Tarraco 1 Spain

Contextual grammars were introduced by Marcus (Revue Roumaine de Mathematiques Pures et Appliquees 14:525-1534, 1969) based on the basic phenomenon in descriptive linguistics, that of acceptance of a word by a context or conversely. In this paper we present some results which are of interest for the potential application of contextual grammars to natural languages. We introduce some classes of internal contextual grammars, viz. maximum depth-first grammars, maximum lengthwise depth-first grammars, and absorbing right context grammars. The study of these classes is motivated by their potential linguistic relevance for natural languages. In particular, we analyze these variants with respect to the properties of mildly context-sensitive languages. With this aim, we first show that the three basic non-context-free constructions in natural languages can be realized upon using all such variants. Secondly, we state that the membership problem for the family of absorbing right context contextual languages is decidable by a polynomial time algorithm. Finally, we show that absorbing right context grammars produce semilinear languages only. Besides, we show that the non-marked duplication language can be generated by absorbing right context grammars, which is a unique feature not present in any other variant of contextual grammars. © 2007 Springer science+Business Media B.V.

关键词： Contextual grammars Mildly context-sensitive languages Natural languages Non-context-free languages Semilinearity

来源：评论

学校读者我要写书评

暂无评论

Modeling multimedia workflow patterns using Dynamic Petri Nets and Orc

Modeling multimedia workflow patterns using Dynamic Petri Ne...

引用

International Conference on Digital Information Management (ICDIM)

作者： Susan Elias Palaniappan V K. S. Easwarakumar Lisa Mathew Richard Chbeir Department of Computer Science and Engineering Sri Venkateswara College of Engineering Chennai India Department of Computer Science and Engineering Anna University Chennai India Department of Mathematics Vellore Institute of Technology Vellore India CS Department LE2l - Bourgogne University Dijon France

In distributed multimedia presentation systems, a workflow is defined to specify which activities need to be executed and in which order. Workflows need to be modeled and verified for effective synchronisation during playout. To model several of these workflows, high-level petri nets have been commonly used. However, petri nets are not suitable for distributed applications and most of them are limited in their capability in modeling workflows having multiple instances with or without a priori runtime knowledge. In this paper, we address the modeling of complex workflow patterns and propose a new approach able to both represent complex distributed multimedia presentation using dynamic petri nets(DPNs) and to translate a verified set of specifications into the new deterministic programming language Orc. DPNs are programmable petri nets that can: efficiently model user interactions and synchronised iterative playouts, and ensure that they represent consistent presentations, while Orc allows providing easy implementations using a set of powerful constructs.

关键词： Petri nets computer science Educational institutions Mathematical model Mathematics

来源：评论

学校读者我要写书评

暂无评论

Providing support for interaction with consistent multimedia presentations

Providing support for interaction with consistent multimedia...

引用

作者： Elias, Susan Easwarakumar, K.S. Mathew, Lisa Chbeir, Richard Department of Computer Science and Engineering Sri Venkateswara College of Engineering Chennai- 602 105 India Department of Computer Science and Engineering Anna University Chennai - 600 025 India School of Science and Humanities Vellore Institute of Technology Vellore - 632 014 India Computer Science Department LE21-Bourgogne University BP 47870 21078 Dijon Cedex France

Multimedia presentations are generally specified in terms of spatial and temporal relations between the media objects involved. Creation of these presentations, and interactions with them during their play-out, require an effective mechanism for handling the specifications dynamically. These specifications could result in inconsistencies, which need to be checked and resolved. Moreover, consistent presentations could become inconsistent due to interactions during the playout. Our main contribution is the design of an algorithm which aids in resolving these consistency issues dynamically and efficiently. The other salient features of our approach are a new composite spatio-temporal operator and an effective relaxation policy. We have developed a prototype which helps to study the effectiveness of the proposed approach. Thus, this paper presents an interactive multimedia presentation mechanism, which maintains a consistent and complete set of constraints during authoring and play-out of the presentation.

关键词： Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

Impact of IPSec Overhead on Web Application Servers

Impact of IPSec Overhead on Web Application Servers

引用

International Conference on Advanced Computing and Communications (ADCOM)

作者： S. P. Meenakshi S. V. Raghavan School of Computing Sciences Vellore of Institute of Technology Vellore India Network Systems Laboratory Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai India

IPSec provides Maturity solutions to various network based applications i.e., web applications. Implementing the, IPSec in network layer includes significant bandwidth and processing time, overhead to application traffic. The upperlayer protocols such as TCP and UDP behaviour is also influenced by these overheads. In war work, we have studied the impact of IPSee on the metrics: Round Trip Time, Average Burst Size and Available Bandwidth for IPv4 and IPv6 network ***-MD5 authentication algorithm, advanced encryption standard encryption algorithm, and deflate comperession algorithm are used for the protocols of IPSec. From the characterized metrics and computed overheads we analyze tile impact of IPSec on connection handling capacity of web application servers by considering the user behaviour on web page requests.

关键词： Protocols Bandwidth Telecommunication traffic Authentication Traffic control Network servers Cryptography Web pages Time measurement Application software

来源：评论

学校读者我要写书评

暂无评论

Consistency checking for interactive multimedia presentations

Consistency checking for interactive multimedia presentation...

引用

1st IEEE International Conference on Signal-Image technology and Internet-Based Systems, SITIS 2005

作者： Elias, Susan Easwarakumar, K.S. Mathew, Lisa Chbeir, Richard Department of Computer Science and Engineering Sri Venkateswara College of Engineering Chennai - 602 105 India Department of Computer Science and Engineering Anna University Chennai - 600 025 India Department of Mathematics Vellore Institute of Technology Vellore - 632 014 India Computer Science Department LE2I Bourgogne University BP 47870 21078 Dijon Cedex France

Multimedia presentations are generally specified in terms of spatial and temporal relations between the media objects involved. Creation of these presentations, and interactions with them during their play-out, require an effective mechanism for handling the specifications dynamically. Further, these specifications could result in inconsistencies, which need to be checked and resolved. Our main contribution is the design of an algorithm which aids in resolving these consistency issues dynamically and efficiently. The other salient features of our approach are a new composite spatio-temporal operator and an effective relaxation policy. Thus, this paper presents an interactive multimedia presentation mechanism, which maintains a consistent and complete set of constraints during authoring and play-out of the presentation. © IEEE SITIS 2005.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Software complexity assessment using statistical technique: Towards software testing effort estimation

Software complexity assessment using statistical technique: ...

引用

2nd Indian International Conference on Artificial Intelligence, IICAI 2005

作者： Dhavachelvan, P. Sivakumar, N. Cailassame, N.S.N. Sampath Kumar, S. Venkatachalapathy, V.S.K. Department of Information Technology and Computer Science and Engineering Sri Manakula Vinayagar Engineering College Pondicherry India Department of Electronics and Communication Engineering Vellore Institute of Technology Tamilnadu India Department of Mechanical Engineering Sri Manakula Vinayagar Engineering College Pondicherry India

ISBN: (纸本)0972741216

Although there are an increasing number of deployed software com plexity estimation methodologies, there is no systematic analysis precisely what makes the complexity assessment paradigm effective, when to use it and what type of applications can get use of it. The informal interpretations of qualitative and quantitative complexity theories are not sufficient to quantify the testing complexity of the software. On looking towards a single metric of complexity that will both fulfill all the properties of a desirable metric and still have practical utility in measuring software complexity, the research on the software complexity measure still in progress. A fuzzy-based statistical frame work is being developed for estimating the software complexity in a different approach, which has not previously done. The geometrical approach proposed here is to offer a definition for encompassing to cover the software testing complexity issues, based on agents, at the preliminary level, yet sufficiently tight that it can rule out the complexity estimation methodologies that are clearly not mathematical model-based. Copyright © IICAI 2005.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：