<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>DSpace Community:</title>
    <link>http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/1801</link>
    <description />
    <pubDate>Sun, 17 May 2026 23:01:50 GMT</pubDate>
    <dc:date>2026-05-17T23:01:50Z</dc:date>
    <item>
      <title>Security of information processing based on grid environment</title>
      <link>http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/1999</link>
      <description>Title: Security of information processing based on grid environment
Authors: Huey-Ming, Lee; Tsang-Yean, Lee; Lily, Lin
Abstract: Grid computing architecture was defined to be a complete physical layer. Based on the grid computing architecture, we divided grid nodes into supervisor grid node and execute grid nod. The data transfer in network must be in secure. In this study, we propose the encryption and decryption algorithm in each grid node to keep information processing in security. We create user information database both in supervisor and execute grid nodes. We use them to verify user processing in system. When these algorithms install in all grid nodes, we can keep processing be secure in all system.</description>
      <pubDate>Tue, 01 Jan 2008 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/1999</guid>
      <dc:date>2008-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Ranking objective interestingness measures with sensitivity values</title>
      <link>http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/1982</link>
      <description>Title: Ranking objective interestingness measures with sensitivity values
Authors: Huỳnh, Xuân Hiệp; Fabrice, Guillet; Lê, Quyết Thắng; Henri, Briand
Abstract: In this paper, we propose a new approach to evaluate the behavior of objective interestingness measures on association rules. The objective interestingness measures are ranked according to the most significant interestingness interval calculated from an inversely cumulative distribution. The sensitivity values are determined by this interval in observing the rules having the highest interestingness values. The results will help the user (a data analyst) to have an insight view on the behaviors of objective interestingness measures and as a final purpose, to select the hidden knowledge in a rule set or a set of rule sets represented in the form of the most interesting rules.</description>
      <pubDate>Tue, 01 Jan 2008 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/1982</guid>
      <dc:date>2008-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Moving parabolic approximation model  of point clouds and its application</title>
      <link>http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/1955</link>
      <description>Title: Moving parabolic approximation model  of point clouds and its application
Authors: Zhouwang, Yang; Tae-wan, Kim
Abstract: We propose the moving parabolic approximation (MPA) model to reconstruct an improved point-based surface implied by an unorganized point cloud, while also estimating the differential properties of the underlying surface. We present examples which show that our reconstructions of the surface, and estimates of normal and curvature information, are accurate for precise point clouds and robust in the presence of noise. As an application, our proposed model is used to generate triangular meshes approximating point clouds.</description>
      <pubDate>Tue, 01 Jan 2008 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/1955</guid>
      <dc:date>2008-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Learning approaches to support dynamics in communication networks</title>
      <link>http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/1926</link>
      <description>Title: Learning approaches to support dynamics in communication networks
Authors: Abdelhamid, Mellouk; Saïd, Hoceïni; Saida, Ziane; Malika, Bourennane
Abstract: In the context of modern high-speed communication networks, decision reactivity is often complicated by the notion of guaranteed Quality of Service (QoS), which can either be related to time, packet loss or bandwidth requirements: constraints related to various types of QoS make some algorithms not acceptable. Due to emerging real-time and multimedia applications, efficient routing of information packets in dynamically changing communication network requires that as the load levels, traffic patterns and topology of the network change, the decision policy also adapts. We focused in this paper on QoS based mechanisms by developing a neuro-dynamic programming to construct dynamic state-dependent policies. In this paper, we present an accurate description of the current state- of-the-art and give an overview of our work in the use of reinforcement learning concepts focused on communications networks. We focus our attention by developing a system based on this paradigm and study the use of reinforcement learning approaches in three different communication networking domains: wired networks, mobile ad hoc networks, and packet router’s scheduling networks.</description>
      <pubDate>Tue, 01 Jan 2008 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/1926</guid>
      <dc:date>2008-01-01T00:00:00Z</dc:date>
    </item>
  </channel>
</rss>

