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

International Conference on Artificial Intelligence and Computational Intelligence (AICI)

作者： Partha Pakray Sivaji Bandyopadhyay Alexander Gelbukh Computer Science & Engineering Department Jadavpur University Kolkata India Center of Computing Research National Polytechnic Institute Mexicali Mexico

The development of a parser based textual entailment system that is based on comparing the dependency relations in both the text and the hypothesis has been reported. The textual entailment system uses the CCG Parser and the Stanford Parser. The Dependency Parser has been run on the 2-way Parser Training and Evaluation (PETE) (SemEval-2010 Evaluation Exercises on Semantic Evaluation Task 12 Parser Evaluation using Textual Entailment) trial set and the dependency relations obtained for a text and hypothesis pair has been compared. Some of the important comparisons are: subject-verb comparison, subject-subject comparison, object-verb comparison and cross subject-verb comparison. Each of the matches is assigned some weight learned from the PETE trial set corpus. A threshold has been set on the fraction of matching hypothesis relations for YES entailment decision based on the PETE trial set. The threshold score has been applied on the PETE test set using the same methods of dependency parsing followed by comparisons. Evaluation scores for Run 1 (CCG Parser output), obtained on the test set show 58.19% precision and 45.51% recall for YES decisions and 52.51% precision and 64.82% recall for NO decisions. Evaluation scores for Run 2 (Stanford Parser output), obtained on the test set show 55.68% precision and 59.61% recall for YES decisions and 52.23% precision and 48.61% recall for NO decisions. Evaluation scores for Run 3 (combining the output from CCG parser and Stanford Parser), obtained on the test set show 57.14% precision and 74.35% recall for YES decisions and 59.18% precision and 40% recall for NO decisions.

关键词： Syntactics Semantics Conferences Training Text analysis Feature extraction Skeleton

来源：评论

学校读者我要写书评

暂无评论

A hybrid textual entailment system using lexical and syntactic features

A hybrid textual entailment system using lexical and syntact...

引用

IEEE International Conference on Cognitive Informatics

A two-way textual entailment (TE) recognition system that uses lexical and syntactic features has been described in this paper. The hybrid TE system is based on the Support Vector Machine that uses twenty three features for lexical similarity and the output tag from a rule based syntactic two-way TE system as another feature. The important lexical features that are used in the present system are: WordNet based unigram match, bigram match, longest common subsequence, skip-gram, stemming, named entity matching and lexical distance. In the syntactic TE system, the important features used are: subject-subject comparison, subject-verb comparison, object-verb comparison and cross subject-verb comparison. The hybrid system has been developed using the collection of RTE-2 test annotated set, RTE-3 development set and RTE-3 test gold set that includes 2400 text-hypothesis pairs. Evaluation scores obtained on the RTE-4 test set (includes 1000 text-hypothesis pairs) show 55.30% precision and 58.40% recall for YES decisions and 55.93% precision and 52.80% recall for NO decisions.

关键词： Syntactics Support vector machines Accuracy Semantics Measurement Databases NIST

来源：评论

学校读者我要写书评

暂无评论

Automatic Answer Validation System on English language

Automatic Answer Validation System on English language

引用

International Conference on Advanced computer Theory and Engineering, ICACTE

作者： Partha Pakray Santanu Pal Sivaji Bandyopadhyay Alexander Gelbukh Computer Science & Engineering Department Jadavpur University Kolkata India Center of Computing Research National Polytechnic Institute Mexicali Mexico

We present an Answer Validation System (AV) based on Textual Entailment and Question Answering. The important features used to develop the AV system are Named Entity Recognition, Textual Entailment, Question-Answer type Analysis and Chunk Boundary and Dependency relations. Separate AV modules have been developed for each of these features. We first combine the question and the answer into Hypothesis (H) and the Supporting Text as Text (T) to check the entailment relation as either “VALIDATED” or “REJECTED”. The important lexical features used for the Textual Entailment Module in the present system are: WordNet based unigram match, bigram match and skip-gram. The results obtained from the four answer validation modules are integrated using a voting technique. Evaluation scores obtained on the AVE 2008 test set show 67% precision for “VALIDATED” decisions.

关键词： Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

Memory access mechanism in embedded real-time Java processor

Memory access mechanism in embedded real-time Java processor

引用

International Conference on computer and Automation Engineering, ICCAE

作者： Guang Hu Zhilei Chai Shiliang Tu Department of Computer Science and Engineering Department of Computer Science Shanghai International Studies University Shanghai China Center of Intelligent and High Performance Computing School of Information Technology Jiangnan University Wuxi China Department of Computer Science and Engineering Fudan University Shanghai China

ISBN: (纸本)9781424455690

Currently, Java has been gradually applied in such areas as robotics, industrial control, and other embedded real-time applications owning to its advantages like platform independence, robustness, security, etc. In order to improve the performance of Java's execution engine for embedded real-time applications, an embedded real-time Java processor JPOR-32 (32-bit Java Processor Optimized for RTSJ) is designed. In this paper, the memory access mechanism of JPOR-32 is presented. In JPOR-32, the optimized memory organization structure is designed to implement the runtime data areas of the Java virtual machine (JVM). Based on it, with the preprocessing operation, the memory access instructions optimization is implemented as well. The preprocessing operation enables the JVM's runtime operations involving dynamic loading, verification, preparation, resolution, etc. to be handled in advance. It not only provides an efficient and convenient way to implement memory access, but also makes the contribution to the WCET predictability. As to the memory management, in accordance with the Real-Time Specification for Java (RTSJ), garbage collection (GC) is not allowed in the immortal memory as well as the scoped memory, and in the heap, JPOR-32 adopts improved GC scheme suitable for embedded real-time Java environment. Besides, with the architectural support of the pipelined datapath, JPOR-32 provides effective supports for efficient and predictable memory access.

关键词： Java Memory management Design optimization Runtime Service robots Industrial control Robust control Security Engines Virtual machining

来源：评论

学校读者我要写书评

暂无评论

Distributed power management and control system for sustainable computing environments

Distributed power management and control system for sustaina...

引用

International Green computing Conference

作者： Krzysztof Kurowski Ariel Oleksiak Michał Witkowski Jarek Nabrzyski Applications Department Poznań Supercomputing and Networking Center Poznan Poland Center of Research Computing and Department of Computer Science and Engineering University of Notre Dame Notre Dame USA

ISBN: (纸本)9781424476121

As the notion of Green computing becomes more popular in the IT world, new power saving features start to appear in both computer hardware and software. The difficulty of leveraging existing means of power management and control increases with the scale of operations, making a networked approach to the problem a necessity. In this paper we present the SMOA Devices architecture, a distributed solution for monitoring and management of power consumption in computer systems. We discuss its features and characteristics, and explain what makes it suitable for a broad range of power saving and management applications.

关键词： Power management XMPP Power consumption Energy efficiency Distributed systems

来源：评论

学校读者我要写书评

暂无评论

Cognitive virtual microscopy: a cognition-driven visual explorer for histopathology – the MICO ANR TecSan 2010 initiative

引用

BMC Proceedings 2011年第1期5卷 1-1页

作者： Daniel Racoceanu Nicolas Loménie Ludovic Roux French National Center for Scientific Research – IPAL UMI CNRS Singapore 138632 Republic of Singapore Department of Computer Science School of Computing National University of Singapore Singapore 117417 Republic of Singapore University Paris Descartes 75270 Paris Cedex 06 France University Joseph Fourier 38041 Grenoble Cedex 9 France

来源：评论

学校读者我要写书评

暂无评论

Efficient Broadcast on Random Geometric Graphs 10

Efficient Broadcast on Random Geometric Graphs

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete Algorithms

作者： Milan Bradonjic Robert Elsaesser Tobias Friedrich Thomas Sauerwald Alexandre Stauffer Theoretical Division and Center for Nonlinear Studies Los Alamos National Laboratory Department of Computer Science University of Paderborn Department 1: Algorithms and Complexity School of Computing Science Simon Fraser University Computer Science Division University of California

ISBN: (纸本)9780898717013

A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, {the square root of}n]~2 and creating edges between every pair of nodes having Euclidean distance at most r, for some prescribed r. We analyze the following randomized broadcast algorithm on RGGs. At the beginning, only one node from the largest connected component of the RGG is informed. Then, in each round, each informed node chooses a neighbor independently and uniformly at random and informs it. We prove that with probability 1 - O(n~(-1)) this algorithm informs every node in the largest connected component of an RGG within O({the square root of}n/r＋log n) rounds. This holds for any value of r larger than the critical value for the emergence of a connected component with Ω(n) nodes. In order to prove this result, we show that for any two nodes sufficiently distant from each other in [0, {the square root of}n]~2, the length of the shortest path between them in the RGG, when such a path exists, is only a constant factor larger than the optimum. This result has independent interest and, in particular, gives that the diameter of the largest connected component of an RGG is {direct}({the square root of}/r), which surprisingly has been an open problem so far.

关键词： connected component Square root Random Ganglia Line of nodes shortest path Euclidean distance

来源：评论

学校读者我要写书评

暂无评论

Quality Analysis of Object Oriented Cohesion Metrics

Quality Analysis of Object Oriented Cohesion Metrics

引用

International Conference on the Quality of Information and Communications Technology (QUATIC)

作者： Padmaja Joshi Rushikesh K. Joshi Center for Development of Advanced Computing (C-DAC) Mumbai Computer Science and Engineering Department Indian Institute of Technology Bombay Mumbai India

Numerous class cohesion metrics can be found in the literature. However, they end up capturing different aspects of cohesion. Which metric is best suited for a given situation is always a critical question. This work focuses on exploring the strengths and weaknesses of each of the selected cohesion metrics. The issues of their applicability to capture varying strengths of cohesion and ability to identify disparate classes are addressed. The metrics are classified into five categories based on their computational approaches. Diversity and similarity among these metrics are brought out. The discussion demonstrates uses of cohesion metrics with the help of typical representative situations.

关键词： Measurement units Electronic mail computer science

来源：评论

学校读者我要写书评

暂无评论

Fixed-Parameter Tractable Combinatorial Algorithms for Metabolic Networks Alignments

Fixed-Parameter Tractable Combinatorial Algorithms for Metab...

引用

IEEE International Conference on Data Mining Workshops (ICDM Workshops)

作者： Qiong Cheng Jinpeng Wei Alexander Zelikovsky Mitsunori Ogihara Center of Computational Science Department of Computer Science University of Miami Coral Gables FL USA School of Computing and Information Science Florida International University Miami FL USA Department of Computer Science Georgia State University Atlanta GA USA

The accumulation of high-throughput genomic and proteomic data allows for the reconstruction of the increasingly large and complex metabolic networks. In order to analyze accumulated data and reconstructed networks, it is critical to identify network patterns and evolutionary relations between metabolic networks. But even finding similar networks is computationally challenging. Based on the property of gene duplication and function sharing in biological network, we have formulated the network alignment problem which asks the optimal vertex-to-vertex mapping allowing path contraction, vertex deletion, and vertex insertions. In this paper we present fixed parameter tractable combinatorial algorithms, which take into account the enzymes' functions and the similarity of arbitrary network topologies such as trees and arbitrary graphs wit hallowing the different types of vertex deletions. The proposed algorithms are fixed parameter tractable in the liner or square of the size of feedback vertex set respectively for the case of disallowing or allowing the deletions. We have developed the web service tool MetNetAligner which aligns metabolic networks. We evaluated our results by the randomizedP-Value computation. In the computation, we followed two standard randomization procedures and further developed two other random graph generators which keep the more stringent and consistent topology constraints. By comparing their distribution of the significant alignment pairs, we observed that the more stringent constraints in the topology the random graph generator has, the more pairs of significant alignments there exist. We also performed pair wise mapping of all pathways for four organisms and found a set of statistically significant pathway similarities. We have applied the network alignment to identifying pathway holes which are resulted by inconsistency and missing enzymes. MetNetAligner is available athttp://\\***:8080/MinePW/pages/gmapping/*** \Two rand

关键词： Heuristic algorithms Dynamic programming Proteins Runtime Network topology Topology

来源：评论

学校读者我要写书评

暂无评论

Replication-Based Highly Available Metadata Management for Cluster File Systems

Replication-Based Highly Available Metadata Management for C...

引用

IEEE International Conference on Cluster computing

作者： Zhuan Chen Jin Xiong Dan Meng Department of Computer Science University of Rochester USA Chinese Academy and Sciences China National Research Center of Intelligent Computing Systems Institute of Computing Technology Chinese Academy and Sciences China

In cluster file systems, the metadata management is critical to the whole system. Past researches mainly focus on journaling which alone is not enough to provide high-available metadata service. Some others try to use replication, but the extra latency accompanied is a main problem. To guarantee both availability and efficiency, we propose a mechanism for building highly available metadata servers based on replication, which integrates Paxos algorithm effectively into metadata service. The Packed Multi-Paxos is proposed to reduce the latency brought by replication, which is self-adaptive and can make the replication to achieve high throughput under heavy client load and low latency under light client load. By designing efficient architecture and coordination mechanism, all replica server nodes simultaneously provide metadata read-access service. This high-available mechanism could decrease the impact of server failures and there is no interruption of service. The performance results show that the latency caused by replication and redundancy is well under control, and the performance of metadata read operation gains improvement.

关键词： Servers Message systems Instruction sets Availability Redundancy Buildings Throughput

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：