<?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://localhost:8080/xmlui/handle/123456789/2154">
    <title>DSpace Collection:</title>
    <link>http://localhost:8080/xmlui/handle/123456789/2154</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="http://localhost:8080/xmlui/handle/123456789/3439" />
        <rdf:li rdf:resource="http://localhost:8080/xmlui/handle/123456789/3435" />
        <rdf:li rdf:resource="http://localhost:8080/xmlui/handle/123456789/2797" />
        <rdf:li rdf:resource="http://localhost:8080/xmlui/handle/123456789/2155" />
      </rdf:Seq>
    </items>
    <dc:date>2026-06-23T06:19:03Z</dc:date>
  </channel>
  <item rdf:about="http://localhost:8080/xmlui/handle/123456789/3439">
    <title>Efficient Embedding in B&amp;W Picture Images</title>
    <link>http://localhost:8080/xmlui/handle/123456789/3439</link>
    <description>Title: Efficient Embedding in B&amp;W Picture Images
Authors: Chhajed, Gyankamal J.; Shinde, S.A.
Abstract: This paper proposes novel method of embedding and &#xD;
extraction of data in Black and White picture images. The &#xD;
main focus of this method is on steganography in Black &amp; &#xD;
white picture image. This method embeds more number of bits &#xD;
in a block as compared to earlier methods, which are limited &#xD;
to one or two bits. &#xD;
This method suggests the searching of the block of suitable &#xD;
size and choosing it for data embedding. The selection of block &#xD;
size is dependent on the encrypted secret message pattern &#xD;
which is encrypted using a secret key shared by sender and &#xD;
receiver and the pattern of block. Here main aim is to utilize &#xD;
the image as much as possible with its own pattern of black &#xD;
and white pixel. In this method very first the encrypted &#xD;
message pattern is taken and it is matched with the block size &#xD;
of 2X2, 3X3 and like wise. The blocks which are giving &#xD;
maximum matching with the bits of the encrypted message is &#xD;
selected for the embedding. To maintain the visual quality of &#xD;
image we will only change at the maximum 2 pixels in the &#xD;
block if size is more than 2X2 and 1 pixel for 2X2 block. To &#xD;
extract the correct data we will use the odd even feature of the &#xD;
block of size 3X3, which will be utilized to keep the embedding &#xD;
information that is size of the message , block size and &#xD;
locations where data is embedded. This information is also &#xD;
encrypted with secret key for security purpose and embedding &#xD;
will start from the end of the image that is right bottom corner &#xD;
and scanning and embedding will be from right to left and &#xD;
bottom to top. This information is used to extract exact &#xD;
amount of data without the need of checking total image. The &#xD;
secret message is extracted after decoding extracted bits from &#xD;
the stego-image with secret key without using original image &#xD;
accurately. This method will prove to be good for embedding &#xD;
increased capacity of data without causing much distortion</description>
    <dc:date>2010-04-25T00:00:00Z</dc:date>
  </item>
  <item rdf:about="http://localhost:8080/xmlui/handle/123456789/3435">
    <title>Defect classification as problem classification for Quality control in the software  project management by DTL</title>
    <link>http://localhost:8080/xmlui/handle/123456789/3435</link>
    <description>Title: Defect classification as problem classification for Quality control in the software  project management by DTL
Authors: Hanchat, D.B.; Sayyad, Shabina; Shinde, S.A.
Abstract: There are various reasous and causes which lead &#xD;
to failure of software that may come right from it's starting &#xD;
point of requirement analysis up to launching of product in the &#xD;
market .One has to do the root cause analysis of software &#xD;
failure so that these failures should not be reproducible. There &#xD;
are various problems due to which the software may give the &#xD;
bugs, errors, fault and ultimately the failure. Enlisting the &#xD;
problem, analyzing the problem after reporting is must before &#xD;
the fixing of the problem and going into the root cause of the &#xD;
problem. The classification of the problem will definitely help &#xD;
us to sort out the problems and will help to go to the root of &#xD;
problem. Once problems have been reported it can be &#xD;
classified by using any classification method depending upon &#xD;
the properties and their values. We do combine the decision &#xD;
tree learning with the input as the current problems. Decision &#xD;
Tree will be trained with trainee example with similar type of &#xD;
problems, their "properties and values". The DTL will help us &#xD;
to classify the problem and ultimately give us the sorted &#xD;
problems to do analysis of problem [2]. Analysis and &#xD;
classification of the problems will also help in the quality &#xD;
control of the product. We have taken defects classification as &#xD;
an example in this paper.</description>
    <dc:date>2010-10-23T00:00:00Z</dc:date>
  </item>
  <item rdf:about="http://localhost:8080/xmlui/handle/123456789/2797">
    <title>Use of Instance Typicality for Efficient Detection of Outliers with Neural Network Classifiers</title>
    <link>http://localhost:8080/xmlui/handle/123456789/2797</link>
    <description>Title: Use of Instance Typicality for Efficient Detection of Outliers with Neural Network Classifiers
Authors: Sane, Shirish S.; Ghotal, Ashok S.
Abstract: Detection of outliers is one of the data pre-processing&#xD;
tasks. In all the applications, outliers need to be&#xD;
detected to enhance the accuracy of the classifiers.&#xD;
Several different techniques, such as statistical,&#xD;
distance-based and deviation-based outlier detection&#xD;
exist to detect outliers. Many of these techniques use&#xD;
filter method. A wrapper method using the concept of&#xD;
instance typicality may also be used to detect outliers.&#xD;
This paper deals with a new wrapper method that&#xD;
builds an initial model using neural networks and treats&#xD;
values at the output of neurons in the output layer as&#xD;
the typicality scores. Instances with lowest output&#xD;
values are treated as potential outliers. In addition, the&#xD;
method is also useful to build compact and accurate&#xD;
classifiers by selecting a few most typical instances&#xD;
resulting in significant reduction in storage space. The&#xD;
method is generic and thus can also be used for&#xD;
instance selection with any kind of classifiers. Resultant&#xD;
compact models are useful for imputation of missing&#xD;
values.</description>
    <dc:date>2006-07-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="http://localhost:8080/xmlui/handle/123456789/2155">
    <title>A novel Supervised Instance Selection algorithm</title>
    <link>http://localhost:8080/xmlui/handle/123456789/2155</link>
    <description>Title: A novel Supervised Instance Selection algorithm
Authors: Sane, Shirish S; Ghatol, Ashok
Abstract: Instance selection is often used in case of lazy classifiers. This paper&#xD;
addresses the need of instance selection in case of neural network and decision&#xD;
tree classifiers and presents a novel Supervised Instance Selection (SIS)&#xD;
algorithm. Initially, a neural network classifier is constructed using all training&#xD;
instances. The algorithm then selects a few instances using the certainty values&#xD;
of the wrapped neural network to construct a compact classifier. Empirical&#xD;
study made with standard datasets shows that SIS save on 70% of storage space&#xD;
without degrading the accuracy. It is independent of nature of the dataset and&#xD;
the tool used.</description>
    <dc:date>2007-01-11T00:00:00Z</dc:date>
  </item>
</rdf:RDF>

