University at Buffalo

Displaying 1-40 of 40 results

  • White Papers // Jan 2012

    Acquaintance Based Soft Location Management (ABSLM) in MANET

    A major challenge faced in Mobile Ad Hoc NETworks (MANET) is locating devices for communication, especially with high node mobility and sparse node density. Present solutions provided by ad hoc routing protocols range from flooding the entire network with route requests, to deploying a separate location management scheme to maintain...

    Provided By University at Buffalo

  • White Papers // Feb 2011

    Preference Elicitation in Prioritized Skyline Queries

    Preference queries incorporate the notion of binary preference relation into relational database querying. Instead of returning all the answers, such queries return only the best answers, according to a given preference relation. Preference queries are a fast growing area of database research. Skyline queries constitute one of the most thoroughly...

    Provided By University at Buffalo

  • White Papers // Jan 2011

    Insider Threat Analysis Using Information-Centric Modeling

    Capability Acquisition Graphs (CAGs) provide a powerful framework for modeling insider threats, network attacks and system vulnerabilities. However, CAG-based security modeling systems have yet to be deployed in practice. This paper demonstrates the feasibility of applying CAGs to insider threat analysis. In particular, it describes the design and operation of...

    Provided By University at Buffalo

  • White Papers // Jan 2011

    ORBIT Mobility Framework and Orbit Based Routing (OBR) Protocol for MANET

    A major hurdle in evaluating routing protocols for a Mobile Ad hoc NETwork (MANET) is the appropriate modeling of the mobility of wireless nodes. Although the pure random nature of the Random Waypoint model lends itself for theoretical study of MANET protocols, it is not suitable for modeling the movements...

    Provided By University at Buffalo

  • White Papers // Jan 2011

    On the Use of Lexeme Features for Writer Verification

    Document examiners use a variety of features to analyze a given handwritten document for writer verification. The challenge in the automatic classification of a pair of documents to belong to the same or different writer, are both the task of proper selection and extraction of features from the handwritten document...

    Provided By University at Buffalo

  • White Papers // Jan 2011

    Scalar Aggregation in Inconsistent Databases

    The authors consider here scalar aggregation queries in databases that may violate a given set of functional dependencies. The authors define consistent answers to such queries to be greatest lowest/least upper bounds on the value of the scalar function across all (minimal) repairs of the database. They show how to...

    Provided By University at Buffalo

  • White Papers // Jan 2011

    Querying Regular Sets of XML Documents

    The authors investigate the problem of querying (regular) sets of XML documents represented with tree automata and the authors consider n-ary tree automata queries whose expressive power captures MSO on trees. Because finite automata can represent infinite sets of documents, they propose the notions of universal and existential query answers,...

    Provided By University at Buffalo

  • White Papers // Dec 2010

    Evaluation of Rarity of Fingerprints in Forensics

    A method for computing the rarity of latent fingerprints represented by minutiae is given. It allows determining the probability of finding a match for an evidence print in a database of n known prints. The probability of random correspondence between evidence and database is determined in three procedural steps. In...

    Provided By University at Buffalo

  • White Papers // Nov 2010

    Preference Queries Over Sets

    The authors propose a "Logic + SQL" framework for set preferences. Candidate best sets are represented using profiles consisting of scalar features. This reduces set preferences to tuple preferences over set profiles. The authors propose two optimization techniques: superpreference and M-relation. Superpreference targets dominated profiles. It reduces the input size...

    Provided By University at Buffalo

  • White Papers // Nov 2010

    Drivers of Information Security Search Behavior: An Investigation of Network Attacks and Vulnerability Disclosures

    More and more people use search engines to seek for various information. This study investigates the search behavior that drives the search for information security knowledge via a search engine. Based on theories in information search and information security behavior the authors examine the effects of network attacks and vulnerability...

    Provided By University at Buffalo

  • White Papers // Oct 2010

    Contracting Preference Relations for Database Applications

    The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here the authors study preference contraction: the problem of discarding selected preferences. They argue that the property of minimality and the preservation of strict partial orders are crucial for contractions. Contractions can be further...

    Provided By University at Buffalo

  • White Papers // May 2010

    Prioritized Repairing and Consistent Query Answering in Relational Databases

    A consistent query answer in an inconsistent database is an answer obtained in every (minimal) repair. The repairs are obtained by resolving all conflicts in all possible ways. Often, however, the user is able to provide a preference on how conflicts should be resolved. The authors investigate here the framework...

    Provided By University at Buffalo

  • White Papers // May 2010

    A Robust Iris Localization Method Using an Active Contour Model and Hough Transform

    Iris segmentation is one of the crucial steps in building an iris recognition system since it affects the accuracy of the iris matching significantly. This segmentation should accurately extract the iris region despite the presence of noises such as varying pupil sizes, shadows, specular reflections and highlights. Considering these obstacles,...

    Provided By University at Buffalo

  • White Papers // Mar 2010

    Assurance Seals, On‑Line Customer Satisfaction, And Repurchase Intention

    This paper explores how third-party assurance seals, a privacy service provided by vendors to mitigate customers' fears, has an impact on online customer satisfaction and repeat-purchase intention. It asks the following research questions: Do assurance seals influence online service experience? If so, how do they affect consumers' satisfaction and repeat-purchase...

    Provided By University at Buffalo

  • White Papers // Jan 2010

    A Case for Compressive Video Streaming in Wireless Multimedia Sensor Networks

    Wireless Multimedia Sensor Networks (WMSN) are self-organizing wireless systems of embedded devices deployed to retrieve, distributively process in real-time, store, correlate, and fuse multimedia streams originated from heterogeneous sources. WMSNs will enable new applications including multimedia surveillance, storage and subsequent retrieval of potentially relevant activities, and person locator services. In...

    Provided By University at Buffalo

  • White Papers // Sep 2009

    Effective Navigation of Query Results Based on Concept Hierarchies

    Search queries on biomedical databases, such as PubMed, often return a large number of results, only a small subset of which is relevant to the user. Ranking and categorization, which can also be combined, have been proposed to alleviate this information overload problem. Results categorization for biomedical databases is the...

    Provided By University at Buffalo

  • White Papers // Sep 2009

    Accelerating Techniques for Rapid Mitigation of Phishing and Spam Emails

    Spam filters that are implemented using Na?ve Bayesian learning techniques are widely deployed worldwide with email clients such as Outlook. These filters that are deployed on end user's computers and typically used to filter out spam for individual users are effective when the spam load is around 400-500 spam emails...

    Provided By University at Buffalo

  • White Papers // Aug 2009

    Data Spider: A Resilient Mobile Basestation Protocol for Efficient Data Collection in Wireless Sensor Networks

    Traditional deployments of Wireless Sensor Networks (WSNs) rely on static basestations to collect data. For applications with highly spatio-temporal and dynamic data generation, such as tracking and detection applications, static basestations suffer from communication bottlenecks and long routes, which cause reliability and lifetime to plummet. To address this problem, the...

    Provided By University at Buffalo

  • White Papers // Aug 2009

    Distributed Spectrum Sharing for Video Streaming in Cognitive Radio Ad Hoc Networks

    A distributed joint routing and spectrum sharing algorithm for video streaming applications over cognitive radio ad hoc networks is proposed in this paper. The proposed cross-layer control scheme dynamically allocates routes, spectrum and power to maximize the network throughput under the constraints posed by delay-sensitive video applications. The algorithm evaluates...

    Provided By University at Buffalo

  • White Papers // Jul 2009

    Optimistic Concurrency Control for Multi-Hop Wireless Sensor Networks

    With the inclusion of actuation capabilities, emerging wireless sensor applications are much less tolerant to inconsistencies in decisions compared to passive sensing applications. Multi-hop networks suffer from these problems more profoundly as they cannot directly utilize atomic broadcast operations for coordination. In this paper, the authors provide a lightweight single...

    Provided By University at Buffalo

  • White Papers // Jul 2009

    INPAC: An Enforceable Incentive Scheme for Wireless Networks Using Network Coding

    Wireless mesh networks have been widely deployed to provide broadband network access, and their performance can be significantly improved by using a new technology called network coding. In a wireless mesh network using network coding, selfish nodes may deviate from the protocol when they are supposed to forward packets. This...

    Provided By University at Buffalo

  • White Papers // Jul 2009

    On the Fly Learning of Mobility Profiles for Intelligent Routing in Pocket Switched Networks

    In this paper, the authors propose a novel routing protocol, PRO, for profile-based routing in pocket switched networks. Differing from previous routing protocols, PRO treats node encounters as periodic patterns and uses them to predict the times of future encounters. Exploiting the regularity of human mobility profiles, PRO achieves fast...

    Provided By University at Buffalo

  • White Papers // Jun 2009

    Challenges in Mitigating Phishing and Spam e-Mails

    A credible threat on the Internet that is more serious than spam is phishing. In phishing attacks, attackers use forged e-mails and Websites to appear as if they originate from legitimate organization to deceive users into disclosing personal, financial, or computer account information. This stolen information can then be used...

    Provided By University at Buffalo

  • White Papers // May 2009

    A Plant-and-Play Wireless Sensor Network System for Gate Monitoring

    In this paper, the authors present a practical plant-and-play wireless sensor network system for entry-exit monitoring. Their system is easily configurable and robust, making it feasible to be deployed in a wide range of entry-exit monitoring applications. At the core of their system lies a novel MAC protocol that is...

    Provided By University at Buffalo

  • White Papers // May 2009

    IDKEYMAN: An Identity-Based Key Management Scheme for Wireless Ad Hoc Body Area Networks

    Wireless Ad hoc Body Area Networks are primarily used in health-care applications for patient monitoring purposes. Publisher-Subscriber driven Body Area Networks enable publishers (Medical sensors attached to patients) to disseminate medical data to numerous mobile heterogeneous subscribers (Doctors or caregivers) through a subscription mechanism. Such an environment raises serious security...

    Provided By University at Buffalo

  • White Papers // May 2009

    Toward Dynamic Application Protocols in Heterogeneous Distributed Computing Systems

    In order to achieve the full transformational promise of Sea Power 21 and net-centric warfare, a highly efficient and adaptable Service Oriented Architecture (SOA) is required. This paper proposes an XML based language to enable heterogeneous distributed systems to dynamically modify the application-layer network protocol in an SOA at runtime...

    Provided By University at Buffalo

  • White Papers // Apr 2009

    A Holistic Solution to Pursuer-Evader Tracking in Sensor Networks

    In this paper, the authors devise a holistic solution to the pursuer-evader tracking problem taking into account the limitations of the Wireless Sensor Networks (WSNs) as well as the dynamics of both the pursuer and evader. More specifically, they present an optimal strategy for the pursuer to capture the evader...

    Provided By University at Buffalo

  • White Papers // Mar 2009

    Outsourcing, External Collaboration, and Innovation Among U.S. Firms in the Biopharmaceutical Industry

    This paper examines the outsourcing patterns of U.S. firms in the biopharmaceutical industry. Data from an exploratory survey of 86 companies suggest that the outsourcing of strategic activities such as applied research and formulary development has started to decline among firms of all sizes, though noncore activities such as manufacturing...

    Provided By University at Buffalo

  • White Papers // Feb 2009

    Consistent Query Answers in the Presence of Universal Constraints

    The framework of consistent query answers and repairs has been introduced to alleviate the impact of inconsistent data on the answers to a query. A repair is a minimally different consistent instance and an answer is consistent if it is present in every repair. In this paper the authors study...

    Provided By University at Buffalo

  • White Papers // Feb 2009

    Evaluating the Use of GPUs in Liver Image Segmentation and HMMER Database Searches

    In this paper the authors present the results of parallelizing two life sciences applications, Markov Random Fields-based (MRF) liver segmentation and HMMER's Viterbi algorithm, using GPUs. They relate the experiences in porting both applications to the GPU as well as the techniques and optimizations that are most beneficial. The unique...

    Provided By University at Buffalo

  • White Papers // Feb 2009

    On the Effectiveness of Structural Detection and Defense Against P2P-Based Botnets

    Recently, Peer-To-Peer (P2P) networks have emerged as a covert communication platform for malicious programs known as bots. As popular distributed systems, they allow bots to communicate easily while protecting the botmaster from being discovered. Existing work on P2P-based botnets mainly focuses on measurement of botnet sizes. In this paper, through...

    Provided By University at Buffalo

  • White Papers // Jan 2009

    Listen-While-Talking: A Technique for Primary User Protection

    Cognitive radios opportunistically share the spectrum with the primary users. In this paper, the authors address the problem of detecting the presence of a primary user while a secondary user is transmitting data, in order to avoid harmful interference to the primary user. They have proposed an inband spectrum sensing...

    Provided By University at Buffalo

  • White Papers // Nov 2008

    A Fault-Tolerant Strategy for Virtualized HPC Clusters

    Virtualization is a common strategy for improving the utilization of existing computing resources, particularly within data centers. However, its use for High Performance Computing (HPC) applications is currently limited despite its potential for both improving resource utilization as well as providing resource guarantees to its users. In this paper the...

    Provided By University at Buffalo

  • White Papers // Nov 2008

    Semantics and Evaluation of Top-k Queries in Probabilistic Databases

    The authors study here fundamental issues involved in top-k query evaluation in probabilistic databases. They consider simple probabilistic databases in which probabilities are associated with individual tuples, and general probabilistic databases in which, additionally, exclusivity relationships between tuples can be represented. In contrast to other recent research in this area,...

    Provided By University at Buffalo

  • White Papers // Oct 2008

    A Scalable Asynchronous Replication-Based Strategy for Fault Tolerant MPI Applications

    As computational clusters increase in size, their mean-time-to-failure reduces. Typically checkpointing is used to minimize the loss of computation. Most checkpointing techniques, however, require a central storage for storing checkpoints. This severely limits the scalability of checkpointing. The authors propose a scalable replication-based MPI checkpointing facility that is based on...

    Provided By University at Buffalo

  • White Papers // Oct 2008

    Enabling Interactive Jobs in Virtualized Data Centers (Extended Abstract)

    Existing batch schedulers are incapable of adequately addressing the need for immediate access to resources for interactive jobs. This paper describes the virtual machine-centric scheduler, UBIS that facilitates both high priority interactive jobs and traditional batch jobs. UBIS is based on preemptable job scheduling which enables rapid resource provisioning for...

    Provided By University at Buffalo

  • White Papers // Oct 2008

    Enabling Interactive Jobs in Virtualized Data Centers

    Existing batch schedulers are incapable of adequately addressing the need for immediate access to resources for interactive jobs. In this paper the authors describe the virtual machine-centric scheduler, UBIS, that facilitates both high priority interactive jobs and traditional batch jobs. UBIS is based on preemptable job scheduling which enables rapid...

    Provided By University at Buffalo

  • White Papers // Sep 2008

    Mobility Profiler: A Framework for Discovering Mobile User Profiles

    Mobility path information of cellphone users play a crucial role in a wide range of cellphone applications, including context-based search and advertising, early warning systems, citywide sensing applications such as air pollution exposure estimation and traffic planning. However, there is a disconnect between the low-level location data logs available from...

    Provided By University at Buffalo

  • White Papers // Aug 2008

    An Application of Specification-Based Design of Self-Stabilization to Tracking in Wireless Sensor Networks

    In previous work, the authors have designed a tracking protocol, Stalk, for wireless sensor networks and proved it to be self-stabilizing at the pseudo-code (I/O automata) level. However, it is very challenging to achieve and verify self-stabilization of the same protocol at the implementation (TinyOS) level due to the size...

    Provided By University at Buffalo

  • White Papers // May 2002

    Digital Redesign of Children's Toys

    Mohr's Law predicts as the price of Integrated Circuits drops, toy manufactures will add this powerful element into toys. Many mothers question whether the super powered toys have any value added compared to their traditional counterparts. Is the new generation of toys interface with their surroundings. Other constraints in the...

    Provided By University at Buffalo

  • White Papers // May 2002

    Digital Redesign of Children's Toys

    Mohr's Law predicts as the price of Integrated Circuits drops, toy manufactures will add this powerful element into toys. Many mothers question whether the super powered toys have any value added compared to their traditional counterparts. Is the new generation of toys interface with their surroundings. Other constraints in the...

    Provided By University at Buffalo

  • White Papers // Oct 2008

    Enabling Interactive Jobs in Virtualized Data Centers (Extended Abstract)

    Existing batch schedulers are incapable of adequately addressing the need for immediate access to resources for interactive jobs. This paper describes the virtual machine-centric scheduler, UBIS that facilitates both high priority interactive jobs and traditional batch jobs. UBIS is based on preemptable job scheduling which enables rapid resource provisioning for...

    Provided By University at Buffalo

  • White Papers // Sep 2009

    Accelerating Techniques for Rapid Mitigation of Phishing and Spam Emails

    Spam filters that are implemented using Na?ve Bayesian learning techniques are widely deployed worldwide with email clients such as Outlook. These filters that are deployed on end user's computers and typically used to filter out spam for individual users are effective when the spam load is around 400-500 spam emails...

    Provided By University at Buffalo

  • White Papers // Jun 2009

    Challenges in Mitigating Phishing and Spam e-Mails

    A credible threat on the Internet that is more serious than spam is phishing. In phishing attacks, attackers use forged e-mails and Websites to appear as if they originate from legitimate organization to deceive users into disclosing personal, financial, or computer account information. This stolen information can then be used...

    Provided By University at Buffalo

  • White Papers // Mar 2009

    Outsourcing, External Collaboration, and Innovation Among U.S. Firms in the Biopharmaceutical Industry

    This paper examines the outsourcing patterns of U.S. firms in the biopharmaceutical industry. Data from an exploratory survey of 86 companies suggest that the outsourcing of strategic activities such as applied research and formulary development has started to decline among firms of all sizes, though noncore activities such as manufacturing...

    Provided By University at Buffalo

  • White Papers // Mar 2010

    Assurance Seals, On‑Line Customer Satisfaction, And Repurchase Intention

    This paper explores how third-party assurance seals, a privacy service provided by vendors to mitigate customers' fears, has an impact on online customer satisfaction and repeat-purchase intention. It asks the following research questions: Do assurance seals influence online service experience? If so, how do they affect consumers' satisfaction and repeat-purchase...

    Provided By University at Buffalo

  • White Papers // May 2009

    Toward Dynamic Application Protocols in Heterogeneous Distributed Computing Systems

    In order to achieve the full transformational promise of Sea Power 21 and net-centric warfare, a highly efficient and adaptable Service Oriented Architecture (SOA) is required. This paper proposes an XML based language to enable heterogeneous distributed systems to dynamically modify the application-layer network protocol in an SOA at runtime...

    Provided By University at Buffalo

  • White Papers // Aug 2009

    Distributed Spectrum Sharing for Video Streaming in Cognitive Radio Ad Hoc Networks

    A distributed joint routing and spectrum sharing algorithm for video streaming applications over cognitive radio ad hoc networks is proposed in this paper. The proposed cross-layer control scheme dynamically allocates routes, spectrum and power to maximize the network throughput under the constraints posed by delay-sensitive video applications. The algorithm evaluates...

    Provided By University at Buffalo

  • White Papers // Jan 2010

    A Case for Compressive Video Streaming in Wireless Multimedia Sensor Networks

    Wireless Multimedia Sensor Networks (WMSN) are self-organizing wireless systems of embedded devices deployed to retrieve, distributively process in real-time, store, correlate, and fuse multimedia streams originated from heterogeneous sources. WMSNs will enable new applications including multimedia surveillance, storage and subsequent retrieval of potentially relevant activities, and person locator services. In...

    Provided By University at Buffalo

  • White Papers // Nov 2010

    Drivers of Information Security Search Behavior: An Investigation of Network Attacks and Vulnerability Disclosures

    More and more people use search engines to seek for various information. This study investigates the search behavior that drives the search for information security knowledge via a search engine. Based on theories in information search and information security behavior the authors examine the effects of network attacks and vulnerability...

    Provided By University at Buffalo

  • White Papers // Jan 2011

    Insider Threat Analysis Using Information-Centric Modeling

    Capability Acquisition Graphs (CAGs) provide a powerful framework for modeling insider threats, network attacks and system vulnerabilities. However, CAG-based security modeling systems have yet to be deployed in practice. This paper demonstrates the feasibility of applying CAGs to insider threat analysis. In particular, it describes the design and operation of...

    Provided By University at Buffalo

  • White Papers // Sep 2009

    Effective Navigation of Query Results Based on Concept Hierarchies

    Search queries on biomedical databases, such as PubMed, often return a large number of results, only a small subset of which is relevant to the user. Ranking and categorization, which can also be combined, have been proposed to alleviate this information overload problem. Results categorization for biomedical databases is the...

    Provided By University at Buffalo

  • White Papers // May 2009

    IDKEYMAN: An Identity-Based Key Management Scheme for Wireless Ad Hoc Body Area Networks

    Wireless Ad hoc Body Area Networks are primarily used in health-care applications for patient monitoring purposes. Publisher-Subscriber driven Body Area Networks enable publishers (Medical sensors attached to patients) to disseminate medical data to numerous mobile heterogeneous subscribers (Doctors or caregivers) through a subscription mechanism. Such an environment raises serious security...

    Provided By University at Buffalo

  • White Papers // Oct 2008

    A Scalable Asynchronous Replication-Based Strategy for Fault Tolerant MPI Applications

    As computational clusters increase in size, their mean-time-to-failure reduces. Typically checkpointing is used to minimize the loss of computation. Most checkpointing techniques, however, require a central storage for storing checkpoints. This severely limits the scalability of checkpointing. The authors propose a scalable replication-based MPI checkpointing facility that is based on...

    Provided By University at Buffalo

  • White Papers // Oct 2008

    Enabling Interactive Jobs in Virtualized Data Centers

    Existing batch schedulers are incapable of adequately addressing the need for immediate access to resources for interactive jobs. In this paper the authors describe the virtual machine-centric scheduler, UBIS, that facilitates both high priority interactive jobs and traditional batch jobs. UBIS is based on preemptable job scheduling which enables rapid...

    Provided By University at Buffalo

  • White Papers // Jan 2011

    ORBIT Mobility Framework and Orbit Based Routing (OBR) Protocol for MANET

    A major hurdle in evaluating routing protocols for a Mobile Ad hoc NETwork (MANET) is the appropriate modeling of the mobility of wireless nodes. Although the pure random nature of the Random Waypoint model lends itself for theoretical study of MANET protocols, it is not suitable for modeling the movements...

    Provided By University at Buffalo

  • White Papers // Jan 2012

    Acquaintance Based Soft Location Management (ABSLM) in MANET

    A major challenge faced in Mobile Ad Hoc NETworks (MANET) is locating devices for communication, especially with high node mobility and sparse node density. Present solutions provided by ad hoc routing protocols range from flooding the entire network with route requests, to deploying a separate location management scheme to maintain...

    Provided By University at Buffalo

  • White Papers // Aug 2008

    An Application of Specification-Based Design of Self-Stabilization to Tracking in Wireless Sensor Networks

    In previous work, the authors have designed a tracking protocol, Stalk, for wireless sensor networks and proved it to be self-stabilizing at the pseudo-code (I/O automata) level. However, it is very challenging to achieve and verify self-stabilization of the same protocol at the implementation (TinyOS) level due to the size...

    Provided By University at Buffalo

  • White Papers // May 2009

    A Plant-and-Play Wireless Sensor Network System for Gate Monitoring

    In this paper, the authors present a practical plant-and-play wireless sensor network system for entry-exit monitoring. Their system is easily configurable and robust, making it feasible to be deployed in a wide range of entry-exit monitoring applications. At the core of their system lies a novel MAC protocol that is...

    Provided By University at Buffalo

  • White Papers // Apr 2009

    A Holistic Solution to Pursuer-Evader Tracking in Sensor Networks

    In this paper, the authors devise a holistic solution to the pursuer-evader tracking problem taking into account the limitations of the Wireless Sensor Networks (WSNs) as well as the dynamics of both the pursuer and evader. More specifically, they present an optimal strategy for the pursuer to capture the evader...

    Provided By University at Buffalo

  • White Papers // Feb 2009

    Evaluating the Use of GPUs in Liver Image Segmentation and HMMER Database Searches

    In this paper the authors present the results of parallelizing two life sciences applications, Markov Random Fields-based (MRF) liver segmentation and HMMER's Viterbi algorithm, using GPUs. They relate the experiences in porting both applications to the GPU as well as the techniques and optimizations that are most beneficial. The unique...

    Provided By University at Buffalo

  • White Papers // Nov 2008

    A Fault-Tolerant Strategy for Virtualized HPC Clusters

    Virtualization is a common strategy for improving the utilization of existing computing resources, particularly within data centers. However, its use for High Performance Computing (HPC) applications is currently limited despite its potential for both improving resource utilization as well as providing resource guarantees to its users. In this paper the...

    Provided By University at Buffalo

  • White Papers // May 2010

    A Robust Iris Localization Method Using an Active Contour Model and Hough Transform

    Iris segmentation is one of the crucial steps in building an iris recognition system since it affects the accuracy of the iris matching significantly. This segmentation should accurately extract the iris region despite the presence of noises such as varying pupil sizes, shadows, specular reflections and highlights. Considering these obstacles,...

    Provided By University at Buffalo

  • White Papers // Jan 2009

    Listen-While-Talking: A Technique for Primary User Protection

    Cognitive radios opportunistically share the spectrum with the primary users. In this paper, the authors address the problem of detecting the presence of a primary user while a secondary user is transmitting data, in order to avoid harmful interference to the primary user. They have proposed an inband spectrum sensing...

    Provided By University at Buffalo

  • White Papers // Jan 2011

    On the Use of Lexeme Features for Writer Verification

    Document examiners use a variety of features to analyze a given handwritten document for writer verification. The challenge in the automatic classification of a pair of documents to belong to the same or different writer, are both the task of proper selection and extraction of features from the handwritten document...

    Provided By University at Buffalo

  • White Papers // Dec 2010

    Evaluation of Rarity of Fingerprints in Forensics

    A method for computing the rarity of latent fingerprints represented by minutiae is given. It allows determining the probability of finding a match for an evidence print in a database of n known prints. The probability of random correspondence between evidence and database is determined in three procedural steps. In...

    Provided By University at Buffalo

  • White Papers // Feb 2011

    Preference Elicitation in Prioritized Skyline Queries

    Preference queries incorporate the notion of binary preference relation into relational database querying. Instead of returning all the answers, such queries return only the best answers, according to a given preference relation. Preference queries are a fast growing area of database research. Skyline queries constitute one of the most thoroughly...

    Provided By University at Buffalo

  • White Papers // Oct 2010

    Contracting Preference Relations for Database Applications

    The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here the authors study preference contraction: the problem of discarding selected preferences. They argue that the property of minimality and the preservation of strict partial orders are crucial for contractions. Contractions can be further...

    Provided By University at Buffalo

  • White Papers // May 2010

    Prioritized Repairing and Consistent Query Answering in Relational Databases

    A consistent query answer in an inconsistent database is an answer obtained in every (minimal) repair. The repairs are obtained by resolving all conflicts in all possible ways. Often, however, the user is able to provide a preference on how conflicts should be resolved. The authors investigate here the framework...

    Provided By University at Buffalo

  • White Papers // Feb 2009

    Consistent Query Answers in the Presence of Universal Constraints

    The framework of consistent query answers and repairs has been introduced to alleviate the impact of inconsistent data on the answers to a query. A repair is a minimally different consistent instance and an answer is consistent if it is present in every repair. In this paper the authors study...

    Provided By University at Buffalo

  • White Papers // Nov 2008

    Semantics and Evaluation of Top-k Queries in Probabilistic Databases

    The authors study here fundamental issues involved in top-k query evaluation in probabilistic databases. They consider simple probabilistic databases in which probabilities are associated with individual tuples, and general probabilistic databases in which, additionally, exclusivity relationships between tuples can be represented. In contrast to other recent research in this area,...

    Provided By University at Buffalo

  • White Papers // Jan 2011

    Scalar Aggregation in Inconsistent Databases

    The authors consider here scalar aggregation queries in databases that may violate a given set of functional dependencies. The authors define consistent answers to such queries to be greatest lowest/least upper bounds on the value of the scalar function across all (minimal) repairs of the database. They show how to...

    Provided By University at Buffalo

  • White Papers // Nov 2010

    Preference Queries Over Sets

    The authors propose a "Logic + SQL" framework for set preferences. Candidate best sets are represented using profiles consisting of scalar features. This reduces set preferences to tuple preferences over set profiles. The authors propose two optimization techniques: superpreference and M-relation. Superpreference targets dominated profiles. It reduces the input size...

    Provided By University at Buffalo

  • White Papers // Jan 2011

    Querying Regular Sets of XML Documents

    The authors investigate the problem of querying (regular) sets of XML documents represented with tree automata and the authors consider n-ary tree automata queries whose expressive power captures MSO on trees. Because finite automata can represent infinite sets of documents, they propose the notions of universal and existential query answers,...

    Provided By University at Buffalo

  • White Papers // Sep 2008

    Mobility Profiler: A Framework for Discovering Mobile User Profiles

    Mobility path information of cellphone users play a crucial role in a wide range of cellphone applications, including context-based search and advertising, early warning systems, citywide sensing applications such as air pollution exposure estimation and traffic planning. However, there is a disconnect between the low-level location data logs available from...

    Provided By University at Buffalo

  • White Papers // Feb 2009

    On the Effectiveness of Structural Detection and Defense Against P2P-Based Botnets

    Recently, Peer-To-Peer (P2P) networks have emerged as a covert communication platform for malicious programs known as bots. As popular distributed systems, they allow bots to communicate easily while protecting the botmaster from being discovered. Existing work on P2P-based botnets mainly focuses on measurement of botnet sizes. In this paper, through...

    Provided By University at Buffalo

  • White Papers // Jul 2009

    On the Fly Learning of Mobility Profiles for Intelligent Routing in Pocket Switched Networks

    In this paper, the authors propose a novel routing protocol, PRO, for profile-based routing in pocket switched networks. Differing from previous routing protocols, PRO treats node encounters as periodic patterns and uses them to predict the times of future encounters. Exploiting the regularity of human mobility profiles, PRO achieves fast...

    Provided By University at Buffalo

  • White Papers // Jul 2009

    INPAC: An Enforceable Incentive Scheme for Wireless Networks Using Network Coding

    Wireless mesh networks have been widely deployed to provide broadband network access, and their performance can be significantly improved by using a new technology called network coding. In a wireless mesh network using network coding, selfish nodes may deviate from the protocol when they are supposed to forward packets. This...

    Provided By University at Buffalo

  • White Papers // Jul 2009

    Optimistic Concurrency Control for Multi-Hop Wireless Sensor Networks

    With the inclusion of actuation capabilities, emerging wireless sensor applications are much less tolerant to inconsistencies in decisions compared to passive sensing applications. Multi-hop networks suffer from these problems more profoundly as they cannot directly utilize atomic broadcast operations for coordination. In this paper, the authors provide a lightweight single...

    Provided By University at Buffalo

  • White Papers // Aug 2009

    Data Spider: A Resilient Mobile Basestation Protocol for Efficient Data Collection in Wireless Sensor Networks

    Traditional deployments of Wireless Sensor Networks (WSNs) rely on static basestations to collect data. For applications with highly spatio-temporal and dynamic data generation, such as tracking and detection applications, static basestations suffer from communication bottlenecks and long routes, which cause reliability and lifetime to plummet. To address this problem, the...

    Provided By University at Buffalo