A robust motion estimation with center-biased diamond search and its parallel architecture for motion-compensated de-interlace

For motion compensated de-interlace, the accuracy and reliability of the motion vectors have a significant impact on the performance of the motion compensated interpolation. In order to improve the robustness of motion vector, a novel motion estimation algorithm with center-biased diamond search and its parallel VLSI architecture are proposed in this paper. Experiments show that it works better than conventional motion estimation algorithms in terms of motion compensation error and robustness, and its architecture overcomes the irregular data flow and achieves high efficiency. It also efficiently reuses data and reduces the control overhead. So, it is highly suitable for HDTV applications.     

Autonomous topological modeling of a home environment and topological localization using a sonar grid map

This paper presents a method of autonomous topological modeling and localization in a home environment using only low-cost sonar sensors. The topological model is extracted from a grid map using cell decomposition and normalized graph cut. The autonomous topological modeling involves the incremental extraction of a subregion without predefining the number of subregions. A method of topological localization based on this topological model is proposed wherein a current local grid map is compared with the original grid map. The localization is accomplished by obtaining a node probability from a relative motion model and rotational invariant grid-map matching. The proposed method extracts a well-structured topological model of the environment, and the localization provides reliable node probability even when presented with sparse and uncertain sonar data. Experimental results demonstrate the performance of the proposed topological modeling and localization in a real home environment.     

Piecewise Pseudo-Maximum Likelihood Estimation for Risk Aversion Case in First-Price Sealed-Bid Auction

In the literature, more and more clues show that the bidders indeed tend to risk averse. But as a good structure estimation procedure in first-price sealed-bid auctions, the traditional PPMLE (Piecewise Pseudo-Maximum Likelihood Estimation) approach is only applicable to the risk neutrality case. This study generalizes this approach to the risk aversion case, and obtains a simple estimation procedure for the Pareto family of private costs. In the procedure, the estimation order of distribution parameters of private costs is not important, which is different from the traditional PPMLE method. Though there is no unique estimator for θ ₁ and γ, some guidance is given for real-world applications on the basis of our Monte Carlo simulation experiments. What’s more, this procedure can be reduced further, if one is only interested in estimating the private costs. Extensive simulation experimental results indicate that our approach outperforms or matches at least the traditional one in the case of risk neutrality, and is applicable to the risk aversion case.     

Gender differences in digital music distribution methods

This study examines gender differences among Greek Internet users in using digital music distribution methods. First, a Web-based questionnaire was developed and placed on most popular Greek forums. Then, 300 Greek Internet users stated their opinions regarding digital music and the following downloading methods: 1) Http downloading, 2) P2P downloading, 3) Torrent downloading, and 4) Combined iTunes method. The results revealed that P2P programs are the first choice for downloading mp3. The responders were satisfied with the P2P’s easiness of use, the variety of songs and the no need to pay. However, they worried about P2P’s safety. Gender differences were identified in several areas. Music industry managers could consider these findings in their strategies to reach the consumers. Advertising companies could use the results to target differently male or female consumers.     

Maintaining strong mutual visibility of an evader moving over the reduced visibility graph

In this paper, we address the problem of determining whether a mobile robot, called the pursuer, is able to maintain strong mutual visibility (a visibility notion between regions over a convex partition of the environment) of an antagonist agent, called the evader. We frame the problem as a non cooperative game. We consider the case in which the pursuer and the evader move at bounded speed, traveling in a known polygonal environment with or without holes, and in which there are no restrictions as to the distance that might separate the agents. Unlike our previous efforts (Murrieta-Cid et al. in Int J Robot Res 26:233–253, 2007), we give special attention to the combinatorial problem that arises when searching for a solution through visiting several locations in an environment with obstacles. In this paper we take a step further, namely, we assume an antagonistic evader who moves continuously and unpredictably, but with a constraint over its set of admissible motion policies, as the evader moves in the shortest-path roadmap, also called the reduced visibility graph (RVG). The pursuer does not know which among the possible paths over the RVG the evader will choose, but the pursuer is free to move within all the environment. We provide a constructive method to solve the decision problem of determining whether or not the pursuer is able to maintain strong mutual visibility of the evader. This method is based on an algorithm that computes the safe areas (areas that keep evader surveillance) at all times. We prove decidability of this problem, and provide a complexity measure to this evader surveillance game; both contributions hold for any general polygonal environment that might or not contain holes. All our algorithms have been implemented and we show simulation results.     

A hybrid adaptive cuckoo search optimization algorithm for the problem of chaotic systems parameter estimation

This paper introduces a novel hybrid adaptive cuckoo search (HACS) algorithm to establish the parameters of chaotic systems. In order to balance and enhance the accuracy and convergence rate of the basic cuckoo search (CS) algorithm, the adaptive parameters adjusting operation is presented to tune the parameters properly. Besides, the exploitation capability of the CS algorithm is enhanced a lot by integrating the orthogonal design strategy. The functionality of the HACS algorithm is tested through the Lorenz system under the noise-free and noise-corrupted conditions, respectively. The numerical results demonstrate that the algorithm can estimate parameters efficiently and accurately, and the capability of noise immunity is also powerful. Compared with the basic CS algorithm, genetic algorithm, and particle swarm optimization algorithm, the HACS algorithm is energy efficient and superior.     

Triggered essential reviewing: the effect of technology affordances on service experience evaluations

This paper responds to the recent call for understanding the nature and consequences of the digital mediation of everyday experiences. We do so in the context of online opinion sharing. We propose that the unique design features of mobile computing devices and the intention and purpose of their users, meld into a technology affordance we label: Triggered essential reviewing. We empirically investigate the effect of this technology affordance on opinion characteristics (i.e., timing and length), and outcomes (i.e., opinion valence and content). We find that triggered essential reviewing engenders opinions that cover a narrower range of aspects of the experience and that it produces a negative evaluative bias—a bias that mitigates over time. Our work makes two contributions to the application of affordance theory in Information Systems. First, it shows the importance of IT design in studying experiential computing. While not taking a deterministic view of technology, we validate the notion that different technology designs produce a variation of effects around a predictable central tendency. Second, it empirically demonstrates that the affordances of embodied digital experiences have an effect on actual behavior as well as on the outcome of the experience itself.