Future University Hakodate

About: Future University Hakodate is a education organization based out in Hakodate, Japan. It is known for research contribution in the topics: Network packet & Mobile ad hoc network. The organization has 485 authors who have published 1338 publications receiving 13204 citations. The organization is also known as: Mirai Daigaku (Future University) Hakodate Japan.

Delivery ratio in two-hop relay MANETs with limited message lifetime and redundancy

Abstract: A lot of work has been done to model and analyze the performances of two-hop relay algorithm and its variants. However, the delivery ratio, especially under limited message lifetime, has been largely neglected in literature, which is not only of significant importance for delay sensitive applications (where a message beyond some delay limit will typically be dropped) but also of practical interests for general MANET scenarios (where mobile nodes are usually both energy-constrained and buffer storage-limited). In this paper, we study the delivery ratio of a generalized two-hop relay with limited message lifetime and redundancy. In particular, a finite-state absorbing Markov chain-based theoretical framework is first developed to model the complicated message delivery process under the considered relay algorithm. Closed-form expressions are then derived for the message delivery ratio under any given message lifetime, where the important interference, medium contention and traffic contention issues are carefully incorporated into analysis. Finally, extensive simulations are conducted to validate the theoretical framework and corresponding delivery ratio results.

Image processing for historical newspaper archives

Abstract: This paper presents some image processing methods that could produce accurate character segmentation results for historical newspaper archives. A full text search using a word spotting technique is no doubt a promising approach in order to facilitate the utilization of digital archives. Some word spotting techniques require the target images to be segmented into character images in advance, however character segmentation is a difficult issue especially for old and degraded document images. This paper figures out the causes that make the character segmentation difficult, and removes them in order to improve the accuracy of character segmentation. We first detect the ruled lines using Hough Transform in order to segment a whole newspaper image into column-separated images. Then we remove the ruled lines as well as ruby characters and noise. The proposed system is tested for 20 column-separated images of historical newspapers, and the accuracy of character segmentation is improved to 96.3%.

Sparklry: Designing "Sparkle" of Interactive Jewelry

Abstract: At present, many projects embed smart LEDs "multiple LEDs dynamically controlled by computers" into clothes or accessories to support novel expressions or daily activities. However, most of them do not consider the "sparkle" of traditional jewelry. We propose a presentation technique for interactive jewelry called "Sparklry", which can present "sparkles" on a jewel stone using internal LEDs. These sparkles are designed by integrating (1) a traditional jewel, (2) a light shielding sheet with small slits, and (3) an LED array. We developed a prototype and several examples of jewelry to explore appropriate designs of slits and LED patterns. Moreover, we developed two prototypes.

Message delivery probability of two-hop relay with erasure coding in MANETs

Abstract: The lack of a thorough understanding of the fundamental performance limits in mobile ad hoc networks (MANETs), remains a challenging roadblock stunting the commercialization and application of such networks In this paper, we consider a MANET employing the two-hop relay algorithm and erasure coding, and focus on the message delivery probability there Specifically, a finite-state absorbing Markov chain framework is first developed to characterize the complicated message delivery process in the challenging MANETs Based on the developed framework, closed-form expressions are further derived for the message delivery probability under any given message lifetime and message size by adopting the blocking matrix technique As verified through extensive simulation studies, the new framework can be used to accurately predict the message delivery probability behavior, and characterize its relationship with the message size, replication factor and node density