Clayton State Digital Repository
Not a member yet
1706 research outputs found
Sort by
Optiman Image Based Information Hiding with One-dimensional Chaotic Systems and Dynamic Programming
Information hiding is a technology aimed at the secure hiding of important information into digital documents ormedia. In this paper, a new approach is proposed for the secure hiding of information into gray scale images. The hiding isperformed in two stages. In the first stage, the binary bits in the sequence of information are shuffled and encoded with a set ofinteger keys and a system of one-dimensional logistic mappings. In the second stage, the resulting sequence is embedded intothe gray values of selected pixels in the given image. A dynamic programming method is utilized to select the pixels thatminimize the difference between a cover image and the corresponding stego image. Experiments show that this approachoutperforms other information hiding methods by 13.1% in Peak Signal to Noise Ratio (PSNR) on average and reduces thedifference between a stego image and its cover image to 0 in some cases
The Intersection of Egalitarianism & Social Class in Determining Male Generational Shopping Enjoyment Levels
An automatic method to generate domain-specific investigator networks using PubMed abstract,
Background
Collaboration among investigators has become critical to scientific research. This includes ad hoc collaboration established through personal contacts as well as formal consortia established by funding agencies. Continued growth in online resources for scientific research and communication has promoted the development of highly networked research communities. Extending these networks globally requires identifying additional investigators in a given domain, profiling their research interests, and collecting current contact information. We present a novel strategy for building investigator networks dynamically and producing detailed investigator profiles using data available in PubMed abstracts.
Results
We developed a novel strategy to obtain detailed investigator information by automatically parsing the affiliation string in PubMed records. We illustrated the results by using a published literature database in human genome epidemiology (HuGE Pub Lit) as a test case. Our parsing strategy extracted country information from 92.1% of the affiliation strings in a random sample of PubMed records and in 97.0% of HuGE records, with accuracies of 94.0% and 91.0%, respectively. Institution information was parsed from 91.3% of the general PubMed records (accuracy 86.8%) and from 94.2% of HuGE PubMed records (accuracy 87.0). We demonstrated the application of our approach to dynamic creation of investigator networks by creating a prototype information system containing a large database of PubMed abstracts relevant to human genome epidemiology (HuGE Pub Lit), indexed using PubMed medical subject headings converted to Unified Medical Language System concepts. Our method was able to identify 70–90% of the investigators/collaborators in three different human genetics fields; it also successfully identified 9 of 10 genetics investigators within the PREBIC network, an existing preterm birth research network.
Conclusion
We successfully created a web-based prototype capable of creating domain-specific investigator networks based on an application that accurately generates detailed investigator profiles from PubMed abstracts combined with robust standard vocabularies. This approach could be used for other biomedical fields to efficiently establish domain-specific investigator networks
On Eternal domination and Vizing-type inequalities
We show sharp inequalities of Vizing-type for eternal domination. Namely, we prove that for any graphs and , , where is the eternal domination function, is the independence number, and is the strong product of graphs. This addresses a question of Klostermeyer and Mynhardt. We also show some families of graphs attaining the strict inequality where is the Cartesian product. For the eviction model of eternal domination, we show a sharp upper bound for
Abelard
The charm of Renaud Dillies strikes again: after the mouse of Bubbles and Gondola, here is another dreamer, little chick Abelard. To lure pretty Epily, Abelard sees only one solution: to catch the moon for her! So off he goes to America, the country which invented flying machines. Armed with his banjo and his proverb-sharing hat, he launches out on the country roads, meets Gypsies, then Gaston, a grumpy bear with whom he will share a good bit of his way… As opposed to dreamer Abelard, Gaston has his feet firmly planted on the ground. With this funny animal road-movie where the absurd becomes poetry, Régis Hautière and Renaud Dillies offer us another small jewel.
A BEA 2012 HOT GRAPHIC NOVE