Information technology has become an indispensable part of the business world today. Organizations have been dependent to information it more than ever. Such dependency has been followed by its own information security issues. Specialists have highlighted the critical role of human and organizational factors. The employees should be creative in relation with information security. In this way, c...

This paper presents a new statistical Japanese dependency parser which models a relative preference of dependency. Most conventional Japanese dependency parsers are based on binary classifications where all possible pairs of segments are classified into positive (dependent) or negative (non-dependent) examples. However, such methods are not suitable for dependency parsing, since the goal of thi...

There is a well-known algorithm for determining when a decomposition ˆ {R1,R2, . . . ,Rm} of a database relation scheme has a lossless join with respect to a set of functional dependencies. We ®rst present a reformulation of this algorithm in terms of set closures. For the special case of mˆ 2, there is a well-known explicit condition for losslessness. Our formulation extends this result for ge...

ID-logic uses ideas from logic programming to extend classical logic with non-monotone inductive definitions. Here, we study the structure of definitions expressed in this formalism. We define the fundamental concept of a dependency relation, both in an abstract, algebraic context and in the concrete setting of ID-logic. We also characterize dependency relations in a more constructive way. Our ...

This paper describes NTT DATA’s recognizing textual entailment(RTE) systems for NTCIR10 RITE2. We participate in four Japanese tasks, BC Subtask, Unit Test, Exam BC and Exam Search[5]. Our approach uses a ratio with the same semantic relations between words. It is necessary to recognize two semantic viewpoints, which are the semantic relation and the meaning between words in a sentence, in orde...

The focus of this paper is the description of the surface syntax relations in the simple clause in Old French and the way they can be described in a dependency grammar. The declension system of Old French is not reliable enough to cope with the identification of the dependents of the main verb, but it remains true that related grammatical markers are still observable and obey rules that forbid ...

We propose a new algorithm for precisely deciding a control state reachability (CSR) problem in runtime verification of concurrent programs, where the trace provides only limited observability of the execution. Under the assumption of limited observability, we know only the type of each event (read, write, lock, unlock, etc.) and the associated shared object, but not the concrete values of thes...