32223299
Security Techniques Based on EPC Gen2 Tag for Secure Mobile RFID Network Services
RFID (Radio Frequency Identification) technology will be a ubiquitous reality in daily life in the near future. The R&D groups in global now have paid attention to integrate RFID with mobile phone devices as well as to associate with the existing mobile telecommunication network. Such a converged technology and services would lead to make new markets and research challenges. However, privacy threats on RFID tags embedded into products has become stumbling block. Therefore, this paper propose a new security technique for mobile RFID service, which can be support to secure RFID service and uses the privacy protection in mobile RFID network services.
38600553
WIPI Mobile Platform with Secure Service for Mobile RFID Network Environment
Recently, RFID (Radio Frequency Identification) technology is practically applied to a number of logistics processes as well as asset management, and RFID is also expected to be permeated in our daily life with the name of ’Ubiquitous Computing’ or ‘Ubiquitous Network’ within the near future. The R&D groups in global now have paid attention to integrate RFID with mobile devices as well as to associate with the existing mobile telecommunication network. Such a converged technology and services would lead to make new markets and research challenges. However, the privacy violation on tagged products has become stumbling block. We propose light-weight security mechanism which is constructed by mobile RFID security mechanism based on WIPI (Wireless Internet Platform for Interoperability). WIPI-based light-weight mobile RFID security platform can be applicable to various mobile RFID services that required secure business applications in mobile environment.
6231139
Practical and Provably-Secure Multicasting over High-Delay Networks
This paper considers the problem of authenticated key exchange in a dynamic group in which members join and leave the group in an arbitrary fashion. A group key exchange scheme for such a dynamic group is designed to minimize the cost of the rekeying operations associated with group updates. Although a number of schemes have attempted for many years to address this problem, all provably-secure schemes are inadequate in dealing with a dynamic group where group members are spread across a wide area network; their communication overhead for group rekeying is significant in terms of the number of communication rounds or the number of messages, both of which are recognized as the dominant factors that severely slow down group key exchange over a wide area network. In this paper, we propose an efficient key exchange scheme for this scenario and prove its security against an active adversary under the factoring assumption. The proposed scheme requires only a constant number of rounds while achieving low message complexity.
5469426
Unraveling condition specific gene transcriptional regulatory networks in Saccharomyces cerevisiae
BackgroundGene expression and transcription factor (TF) binding data have been used to reveal gene transcriptional regulatory networks. Existing knowledge of gene regulation can be presented using gene connectivity networks. However, these composite connectivity networks do not specify the range of biological conditions of the activity of each link in the network.ResultsWe present a novel method that utilizes the expression and binding patterns of the neighboring nodes of each link in existing experimentally-based, literature-derived gene transcriptional regulatory networks and extend them in silico using TF-gene binding motifs and a compendium of large expression data from Saccharomyces cerevisiae. Using this method, we predict several hundreds of new transcriptional regulatory TF-gene links, along with experimental conditions in which known and predicted links become active. This approach unravels new links in the yeast gene transcriptional regulatory network by utilizing the known transcriptional regulatory interactions, and is particularly useful for breaking down the composite transcriptional regulatory network to condition specific networks.ConclusionOur methods can facilitate future binding experiments, as they can considerably help focus on the TFs that must be surveyed to understand gene regulation.(Supplemental material and the latest version of the MATLAB implementation of the United Signature Algorithm is available online at [1] or [see Additional files 1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
8017153
Predicting how ontologies for the semantic web will evolve
The first phase in the evolution of the semantic Web may be the development of decentralized, adaptive ontologies for software specification.
36496685
Segmentation-free printed character recognition by relaxed nearest neighbor learning of windowed operator
Segmentation is considered by many researchers as the key technology for a reliable optical character recognition (OCR) system. To accomplish sound segmentation, many alternative techniques have been recently proposed. This paper presents a new technique to recognize characters without explicit segmentation. It is based on the automatic construction of a windowed operator by relaxed nearest neighbor learning. It has been implemented, tested and yielded excellent recognition accuracy and computational performance.
558514
Missing value estimation for DNA microarray gene expression data: local least squares imputation
MOTIVATION
Gene expression data often contain missing expression values. Effective missing value estimation methods are needed since many algorithms for gene expression data analysis require a complete matrix of gene array values. In this paper, imputation methods based on the least squares formulation are proposed to estimate missing values in the gene expression data, which exploit local similarity structures in the data as well as least squares optimization process.


RESULTS
The proposed local least squares imputation method (LLSimpute) represents a target gene that has missing values as a linear combination of similar genes. The similar genes are chosen by k-nearest neighbors or k coherent genes that have large absolute values of Pearson correlation coefficients. Non-parametric missing values estimation method of LLSimpute are designed by introducing an automatic k-value estimator. In our experiments, the proposed LLSimpute method shows competitive results when compared with other imputation methods for missing value estimation on various datasets and percentages of missing values in the data.


AVAILABILITY
The software is available at http://www.cs.umn.edu/~hskim/tools.html


CONTACT
hpark@cs.umn.edu
4790058
A public-key authentication watermarking for binary images
Authentication watermarking is the process that inserts hidden data into an object (image) in order to detect any fraudulent alteration perpetrated by a malicious hacker. In the literature, quite a small number of secure authentication methods are available for binary images. This paper proposes a new secure authentication watermarking method for binary images. It can detect any visually significant alteration while maintaining good visual quality. As usual, the security of the algorithm lies on the secrecy of a private-key. Only its owner can insert the correct watermark while anyone may verify the authenticity through the corresponding public-key. A possible application of the proposed technique is in Internet fax transmission, i.e. for legal authentication of documents routed outside the phone network.