Search

In rating systems like Epinions and Amazon's product review systems, users rate items on different topics to yield item scores. Traditionally, item scores are estimated by averaging all the ratings with equal weights. To improve the accuracy of estimated item scores, user reputation [a.k.a., user reputation (UR)] is incorporated. The existing algorithms on UR, however, have underplayed the role of topics in rating systems. In this paper, we first reveal that UR is topic-biased from our empirical investigation. However, existing algorithms cannot capture this characteristic in rating systems. To address this issue, we propose a topic-biased model (TBM) to estimate UR in terms of different topics as well as item scores. With TBM, we develop six topic-biased algorithms, which are subsequently evaluated with experiments using both real-world and synthetic data sets. Results of the experiments demonstrate that the topic-biased algorithms effectively estimate UR across different topics and produce more robust item scores than previous reputation-based algorithms, leading to potentially more robust rating systems. [ABSTRACT FROM AUTHOR]

In this article we present methods and algorithms for constructing an efficient IDE in the sense that the processing costs of reanalyzing source code after change is minimal. Moreover, we show that these methods and algorithms can be designed in a way that they support iterative realization, hence, they fit better to the current trends of iterative software development life-cycle. We also show how these algorithms can be built into an existing system and we show measurements on performance benefits. The proposed methods were validated in the telecommunication area for compiling TTCN-3 code. [ABSTRACT FROM AUTHOR]

A liberal amount of software applications are in market for generating a sketch out of an image, the vice-versa though is unacquainted. Whereas such an implementation will prove to be purposive to the crime investigation departments. Such a youthful approach for generating an image from a sketch is suggested in this paper by following a process of, breaking down the sketch into constituent or component of face, matching or comparing these features with the available database, selecting the best match followed by registering or pasting these image components on a blank face image, performing filtering algorithm in order to perform smoothening of image. [ABSTRACT FROM AUTHOR]

The verification of embedded software has become an important subject over the last years. However, neither standalone verification approaches, like simulation-based/formal verification, nor state-of-the-art semiformal verification approaches are able to verify large and complex embedded software with or without hardware dependencies. This work presents a scalable hybrid verification approach for the verification of embedded software using a semiformal algorithm optimized with static parameter assignment (SPA). These algorithms and methodologies like SPA and counterexample guided simulation are used to combine simulation-based and formal verification in a new way. SPA offers a method to interact between dynamic and static verification approaches based on an automated ranking determination of possible function parameters according to the impact on the model size. Furthermore, SPA inserts initialization code for specific function parameters into the source code under test and supports model building and optimization algorithms to reduce the state space. We have successfully applied this optimized hybrid verification methodology to embedded software applications: Motorola's Powerstone Benchmark suite and a complex automotive industrial embedded software. The results show that our approach scales better than standalone software model checkers to reach deep state spaces. [ABSTRACT FROM AUTHOR]

A code is presented which offers a simple clean way to get output that is very easy to read. Special support is given for the output of error messages which are a part of an application package or subprogram library. The code uses many of the features in Fortran 2003, and the "NEWUNIT=" in an open statement from Fortran 2008. The latter can easily be replaced with "UNIT=99". One goal here is to illustrate some of the nice features in recent incarnations of Fortran. [ABSTRACT FROM AUTHOR]

To improve the performance of indoor positioning system, this paper proposed a three-dimensional positioning algorithm. It acquired the distance between RFID antenna and target tag by RSSI, then acquired the location of the target tag based on the gradient decent method. Experiment results of a warehouse positioning network show that the proposed algorithm can gradually approach the actual location of the target tag and improve the three-dimensional positioning effectively, so it has strong practicability in warehouse management system. [ABSTRACT FROM AUTHOR]

We present a new algorithm for realtime face tracking on commodity RGB-D sensing devices. Our method requires no user-specific training or calibration, or any other form of manual assistance, thus enabling a range of new applications in performance-based facial animation and virtual interaction at the consumer level. The key novelty of our approach is an optimization algorithm that jointly solves for a detailed 3D expression model of the user and the corresponding dynamic tracking parameters. Realtime performance and robust computations are facilitated by a novel subspace parameterization of the dynamic facial expression space. We provide a detailed evaluation that shows that our approach significantly simplifies the performance capture workflow, while achieving accurate facial tracking for realtime applications. [ABSTRACT FROM AUTHOR]

At present, methods of face modelling are not satisfactory, requiring high costs and a complex algorithm. We present an algorithm for 3D specific face modelling from a front view image of a person's face. First, we globally reshape the 3D neutral face model by constructing s linear elasticity model grid. Then, local deformation is performed on the facial feature vertices to obtain a more realistic 3D model for the person. Finally, we apply texture mapping to the deformed face model with cylindrical projection to produce a realistic 3D specific face. [ABSTRACT FROM AUTHOR]