<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/165">
    <title>DSpace Collection:</title>
    <link>http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/165</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/310" />
        <rdf:li rdf:resource="http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/309" />
        <rdf:li rdf:resource="http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/307" />
        <rdf:li rdf:resource="http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/305" />
      </rdf:Seq>
    </items>
    <dc:date>2026-05-22T23:30:49Z</dc:date>
  </channel>
  <item rdf:about="http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/310">
    <title>A program anomaly intrusion detection scheme based on fuzzy inference</title>
    <link>http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/310</link>
    <description>Title: A program anomaly intrusion detection scheme based on fuzzy inference
Authors: Hoang, Dau Xuan; Nguyen, Minh Ngoc
Abstract: A major problem of existing anomaly intrusion detection approaches is that they tend to&#xD;
produce excessive false alarms. One reason for this is that the normal and abnormal behaviour of&#xD;
a monitored object can overlap or be very close to each other, which makes it difficult to define a&#xD;
clear boundary between the two. In this paper, we present a fuzzy-based scheme for program&#xD;
anomaly intrusion detection using system calls. Instead of using crisp conditions, or fixed&#xD;
thresholds, fuzzy sets are used to represent the parameter space of the program sequences of&#xD;
system calls. In addition, fuzzy rules are used to combine multiple parameters of each sequence,&#xD;
using fuzzy reasoning, in order to determine the sequence status. Experimental results showed that&#xD;
the proposed fuzzy-based detection scheme reduced false positive alarms by 48%, compared to the&#xD;
normal database scheme.</description>
    <dc:date>2008-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/309">
    <title>Finding upper bounds of component instances with deallocation beyond local scope</title>
    <link>http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/309</link>
    <description>Title: Finding upper bounds of component instances with deallocation beyond local scope
Authors: Hoang, A. Truong
Abstract: We develop an abstract component language and a static type system that can tells us&#xD;
the maximum resources a program may use. We prove that the upper resource bound is sharp and&#xD;
we point out a polynomial algorithm that can infer the sharp bound. Knowing the maximal&#xD;
resources a program may request allows us to adjust resource usage of the program and to prevent&#xD;
it from raising exceptions or behaving unexpectedly on systems that do not have enough resources.&#xD;
This work extends our previous works in one crucial point: the deallocation primitive can free an&#xD;
instance beyond its local scope. This semantics makes the language much closer to practical ones.</description>
    <dc:date>2008-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/307">
    <title>Checking the conformability in CORBA component model specifications</title>
    <link>http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/307</link>
    <description>Title: Checking the conformability in CORBA component model specifications
Authors: Tran, Thi Mai Thuong; Vo, Van Thanh; Truong, Ninh Thuan
Abstract: We proposed in this paper an approach for checking the conformability in CORBA&#xD;
component model specifications. In software engineering, it is demonstrated that discovering bugs&#xD;
in earlier phases is much more economical than later phases. We focused thus on verifying&#xD;
components by their ports specification. In order to do this, firstly we determined constraints on&#xD;
kinds of port as well as on types of port which the connection between ports must satisfy, and then&#xD;
formalized them to be able to prove automatically using formal prover tools. Here, we proposed to&#xD;
use the B method for verifying components in a CCM specification</description>
    <dc:date>2008-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/305">
    <title>Conflicting chip firing games on graphs and on trees</title>
    <link>http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/305</link>
    <description>Title: Conflicting chip firing games on graphs and on trees
Authors: Pham, Tra An; Phan, Thi Ha Duong; Tran, Thi Thu Huong
Abstract: Chip Firing Games on (directed) graph are widely used in theoretical computer science&#xD;
and many other sciences. In this model, chips are fired from one vertex to all of its neighbors at the&#xD;
same time. The purpose of our paper is to study an extended version of this model, the Conflicting&#xD;
Chip Firing Game, by considering that chips can be fired from one vertex to one of its neighbors at&#xD;
each time. Our main results are obtained when the support graph of this game is a rooted tree. In&#xD;
this case, we give the characterization of its reachable configurations and of its fixed points.&#xD;
Moreover we show the local lattice structure of its configuration space</description>
    <dc:date>2008-01-01T00:00:00Z</dc:date>
  </item>
</rdf:RDF>

