Suriayati Chuprat

University of North Carolina at Chapel Hill, North Carolina, United States

Are you Suriayati Chuprat?

Claim your profile

Publications (13)0 Total impact

  • Source
    Saman Hedayatpour · Nazri Kama · Suriayati Chuprat
    [Show abstract] [Hide abstract]
    ABSTRACT: Real random values have wide range of application in different field of computer science such as cryptography, network security and communication, computer simulation, statistical sampling, etc. In purpose of generating real random values, need for a natural noisy source refers to the main challenge where a source of noise may be reliable for using in random number generator if and only if be derived from physical environment. In this work, we address this requirement by using DNA computing concepts where the molecular motion behavior of DNA molecular provides a pure source of physical noise that may be used for generating high quality real random values. Since one of the main factor for evaluating quality of real random values refer to expectation for generating approximately same amount of 0s and 1s, in this article we model a DNA-based random number generator in sticker mode with ability of generating equal numbers of 0 and 1. After using molecular motion behavior of DNA molecular as the natural source of noise into the proposed DNA-based random number generator, the generated value were subjected to frequency, run, and serial tests which are proposed by National Institute of Standards and Technology (NIST) for randomness evaluation. Obtained result from this evaluation shows that beside the achieving high scores in run and serial tests, the values generated by our DNA-based random number generator pass frequency test with 100% success.
    Preview · Article · Jul 2014 · International Journal of Security and its Applications
  • [Show abstract] [Hide abstract]
    ABSTRACT: A biometric system is a pattern-recognition system that recognizes a person based on either physiological or behavioral characteristics. This kind of system is used to provide access control to some valuable assets. In this paper, we proposed a behavioral biometric system that used random mouse movement in identifying a user. We developed a prototype of the proposed system and experiment it with a number of users. The experiment produced 14 matching or equal to 46.67% of successful matching. The results can be a preliminary result in observing the behavior of a user when the user was interacting with a random application by using a mouse.
    No preview · Conference Paper · Nov 2011
  • [Show abstract] [Hide abstract]
    ABSTRACT: A biometric system is a pattern-recognition system that recognizes a person based on either physiological or behavioral characteristics. This kind of system is used to provide access control to some valuable assets. In this paper, we proposed a behavioral biometric system that used random mouse movement in identifying a user. We developed a prototype of the proposed system and experiment it with a number of users. The experiment produced 14 matching or equal to 46.67% of successful matching. The results can be a preliminary result in observing the behavior of a user when the user was interacting with a random application by using a mouse.
    No preview · Article · Nov 2011
  • Suriayati Chuprat · Sanjoy Baruah
    [Show abstract] [Hide abstract]
    ABSTRACT: We extend the current state of the art in real-time divisible load theory (RT-DLT), by considering the problems of scheduling a real-time divisible job on computing clusters in which different processing nodes have different computing capabilities, as well as different costs associated with executing on them. We seek to minimize the cost of executing a job while also meeting its deadline.
    No preview · Article · Aug 2011
  • S. Hedayatpour · Suriayati Chuprat
    [Show abstract] [Hide abstract]
    ABSTRACT: In modern cryptosystems, real random numbers play critical roles in most key management systems to make sure that the generated key is able to provide high level of security in order to protect the sensitive information and assets in highly secured information systems. One of the main challenges in generating random values is the needs for special noisy source such as nuclear decay, brownian motion, analog circuit and quantum mechanics for producing the random values. Beside the cost, complexity and difficulty of using these special noisy sources as the source of random number generator, there is also the need for additional hardware devices to communicate with these sources. In this paper, we proposed an inexpensive and less complicated method to generate true random values without any need for especial noisy sources. We explain how we use hash functions in combining two data extractors to transform normal image data and make it suitable as the source of random number generator.
    No preview · Conference Paper · Jan 2011
  • [Show abstract] [Hide abstract]
    ABSTRACT: Nurses are the main players in healthcare organization who provide services to the community round the clock. Thus, nurse duty roster is one of the most important components in healthcare to make sure a hospital or clinic provides satisfaction to their patient. In usual practice, the duty roster is built manually or partly-automated, and the fairness criteria are often neglected. These situations may lead to dissatisfaction among nurses. In this paper, we report the results of our investigation upon the process of nurse scheduling done in few Malaysian public hospitals. We also conducted a survey to collect a list of the most desired fairness criteria in building the schedule. Results of survey are presented and discussed.
    No preview · Article · Jan 2011
  • Suriayati Chuprat
    [Show abstract] [Hide abstract]
    ABSTRACT: Recent research in real-time scheduling had applied workload models from Divisible Load Theory (DLT) to real-time workloads. The resulting theory, referred to as Real-time Divisible Load Theory (RT-DLT), hold great promise for modeling an emergent class of massively parallel real-time workloads. However, the theory needs strong formal foundations before it can be widely used for the design and analysis of real-time systems. In this paper, we report our current findings on RT-DLT as part of our on-going research effort to develop such formal foundations. Specifically, we have extended an algorithm based on Linear Programming to schedule a divisible real-time workload upon heterogeneous clusters. A series of simulations have been conducted and a set of significant results are presented.
    No preview · Conference Paper · Jun 2010
  • [Show abstract] [Hide abstract]
    ABSTRACT: Healthcare organization is very important for community in delivering a healthy life. Nurse is the person in charge that will handle the healthcare organization wisely. The nurses should get their duty roster with a wide hand to deliver a good service. There are some issue related to that needs to be classified such as the modes of operation and constraints. The most desirable environment for the nurses is the balance workload roster that will consider any preferences from them that is possible to achieve due to aim to give a respect and care about. Besides that, the solution approach that can be applied in their field must be clarified. In this paper, we will discuss the entire thing about the nurse rostering problem such as its constraints, the modes of operation, the process to complete a roster and the solution approach to this problem.
    No preview · Article · Jan 2010
  • Suriayati Chuprat · Shaharuddin Salleh · Steve Goddard
    [Show abstract] [Hide abstract]
    ABSTRACT: Current real-time application systems demand complex functionality and are increasingly coming to be implemented upon multiprocessor platforms, with complex synchronization, data-sharing and parallelism requirements. However, the formal models for representing real-time workloads have traditionally been designed in the context of uniprocessor environments; hence, they are often not able to accurately represent relevant features of multiprocessor real-time systems. Researchers have recently addressed this shortcoming by applying workload models from Divisible Load Theory (DLT) to real-time systems. The resulting theory, referred to as Real-time Divisible Load Theory (RT-DLT), holds great promise for modeling an emergent class of massively parallel real-time workloads. However, the theory needs strong formal foundations before it can be widely used for the design and analysis of real-time systems. In this paper, we briefly describe our current findings on RT-DLT and ongoing research efforts at extending this work to develop such formal foundations.
    No preview · Article · Sep 2009
  • Source
    SURIAYATI BT CHUPRAT

    Preview · Article · Jan 2009
  • Suriayati Chuprat · Shaharuddin Salleh · Sanjoy K. Baruah
    [Show abstract] [Hide abstract]
    ABSTRACT: Recent research in real-time divisible load theory (RT-DLT) has addressed the problem of distributing arbitrarily parallelizable real-time workloads among processors which become available at different instants. In prior work [1], we proposed a Linear Programming based formulation of the problem of computing the completion time of a real-time workload on a given collection of processors. In this paper, we show via extensive experimental evaluation that this LP based formulation significantly improves on the heuristic approximations [8,9] that were the only techniques previously known for solving these problems.
    No preview · Conference Paper · Sep 2008
  • Suriayati Chuprat · Sanjoy Baruah
    [Show abstract] [Hide abstract]
    ABSTRACT: Recent research in real-time divisible load theory (RT-DLT) has addressed the problem of distributing arbitrarily parallelizable real-time workloads among processors which become available at different instants in the future. Given a real-time job and the times as which the processors become available, we devise exact efficient algorithms to solve two important problems: (i) determine the smallest number of processors needed to complete this job by its deadline; and (ii) given a specific number of processors, determine the earliest completion time for the job on these processors.
    No preview · Conference Paper · Sep 2008
  • Suriayati Chuprat · Sanjoy K. Baruah

    No preview · Conference Paper · Jan 2007