|
Socially inspired search and ranking in mobile
social networking: concepts and challenges
Yufeng WANG, Akihiro NAKAO, Jianhua MA,
Front. Comput. Sci.. 2009, 3 (4): 435-444.
https://doi.org/10.1007/s11704-009-0059-6
In this paper, we provide an overview of challenges in mobile search and ranking, and envision the fundamental features that should be satisfied. We argue that two principles will help improve the relevance and quality of mobile search and ranking: the first one is to examine both intrinsic content features and context of items (usage statistics and social features, etc.); and the second one lies in that no algorithms can replace the objectivity of a human being—let users define the sites that they feel are relevant, leverage their social networks, and over time see their results become highly personalized. Specifically, wireless-virtualcommunity- based mobile search and ranking architecture is proposed in this paper, in which communities act as a first class abstraction for information sharing. Then, we introduce briefly the potential procedures of achieving high relevance and quality in mobile search and ranking based on wireless virtual community.
References |
Related Articles |
Metrics
|
|
Geometric algorithm for point projection and
inversion onto Bézier surfaces
Jinting XU, Weijun LIU, Hongyou BIAN, Lun LI, Jianhuang WU,
Front. Comput. Sci.. 2009, 3 (4): 472-476.
https://doi.org/10.1007/s11704-009-0034-2
This paper presents an accurate and efficient method for the computation of both point projection and inversion onto Bézier surfaces. First, these two problems are formulated in terms of solution of a polynomial equation with u and v variables expressed in the Bernstein basis. Then, based on subdivision of the Bézier surface and the recursive quadtree decomposition, a novel solution method is proposed. The computation of point projection is shown to be equivalent to the geometrically intuitive intersection of a surface with the u-v plane. Finally, by comparing the distances between the test point and the candidate points, the closest point is found. Examples illustrate the feasibility of this method.
References |
Related Articles |
Metrics
|
|
Security evaluation against differential and
linear cryptanalyses for Feistel ciphers
Nianping WANG, Chenhui JIN,
Front. Comput. Sci.. 2009, 3 (4): 494-502.
https://doi.org/10.1007/s11704-009-0049-8
To evaluate the security against differential and linear cryptanalyses for Feistel ciphers with substitutionpermutation network (SPN) round function, we consider the lower bounds of the number of differential and linear active s-boxes, which provides the upper bounds of the maximum differential and linear characteristic probabilities of Feistel ciphers. Concretely, using differential and linear branch numbers Bd, Bl of P transformation within the round function, we give new lower bounds of the number of active s-boxes in any consecutive rounds of Feistel ciphers, respectively. Furthermore, we show that our results are better than others by comparing these results.
References |
Related Articles |
Metrics
|
|
A bipartite model for load balancing in grid
computing environments
Wenchao JIANG, Matthias BAUMGARTEN, Yanhong ZHOU, Hai JIN,
Front. Comput. Sci.. 2009, 3 (4): 503-523.
https://doi.org/10.1007/s11704-009-0036-0
In this paper, a bipartite model for load balancing (LB) in grid computing environments, called Transverse viewpoint-based Bi-Tier model (TBT), is proposed. TBT can efficiently eliminate topology mismatching between overlay- and physical-networks during the load transfer process. As an implementation of TBT, a novel LB policy called M2ON (Min-cost and Max-flow Channel based Overlay Network) is presented. In M2ON, the communication capability is denoted as M2C (Min-cost and Max-flow Channel) which is obtained using a Labeled Tree Probing (LTP) method. The computing capacity is denoted as the Idle Factor (IF) which is obtained from the semantic overlay. The higher- and lower-level characteristics are combined into an Integrated Impacting Factor (IIF) using a Double Linear Inserting (DLI) function. Based on IIF, optimal topology matching can be achieved in the LB process. Extensive experiments and simulations have been performed and will be discussed. The results show that M2ON achieves more accurate topology matching with a minimum increment in the overall locating time yet achieving higher system performance as a whole.
References |
Related Articles |
Metrics
|
|
A new parallel scheduling system for multiple
radio wireless mesh network
Yun HU, Shoubao YANG, Qi ZHANG, Dapeng WANG, Qinwei SHEN,
Front. Comput. Sci.. 2009, 3 (4): 550-559.
https://doi.org/10.1007/s11704-009-0033-3
To enhance the capacity of wireless mesh networks, a key technique is widely investigated which is the usage of multi-radio and multi-channel diversity. In this paper, a new parallel scheduling system is proposed which exploits MAC diversities by transmitting packets on the radios opportunistically. Compared with conventional packet transmission which follows “one flow one radio”, the new system uses radio diversity to transmit the packets on different radios simultaneously. Two kernel components of this system are selection module and schedule module. A localized selecting algorithm is implemented in the selection model to choose the right radios based on the quality of wireless links; two distributed packet-scheduling algorithms are optional with the schedule component. Finally, a routing metric adapting this system is presented. We have carried out a comprehensive performance evaluation of this system using ns-2. Simulation results show that it can successfully harness diversity of multi-radio and multi-channel to provide considerable improvements over a baseline multi-channel system in several situations.
References |
Related Articles |
Metrics
|
|
Algorithm and axiomatization of rough fuzzy sets
based finite dimensional fuzzy vectors
Mingfen WU,
Front. Comput. Sci.. 2009, 3 (4): 560-568.
https://doi.org/10.1007/s11704-009-0060-0
Rough sets, proposed by Pawlak and rough fuzzy sets proposed by Dubois and Prade were expressed with the different computing formulas that were more complex and not conducive to computer operations. In this paper, we use the composition of a fuzzy matrix and fuzzy vectors in a given non-empty finite universal, constitute an algebraic system composed of finite dimensional fuzzy vectors and discuss some properties of the algebraic system about a basis and operations. We give an effective calculation representation of rough fuzzy sets by the inner and outer products that unify computing of rough sets and rough fuzzy sets with a formula. The basis of the algebraic system play a key role in this paper. We give some essential properties of the lower and upper approximation operators generated by reflexive, symmetric, and transitive fuzzy relations. The reflexive, symmetric, and transitive fuzzy relations are characterized by the basis of the algebraic system. A set of axioms, as the axiomatic approach, has been constructed to characterize the upper approximation of fuzzy sets on the basis of the algebraic system.
References |
Related Articles |
Metrics
|
14 articles
|