With the increasing popularity of social network, more and more people tend to store and transmit information in visual format, such as image and video. However, the cost of this convenience brings about a shock to tr...
详细信息
With the increasing popularity of social network, more and more people tend to store and transmit information in visual format, such as image and video. However, the cost of this convenience brings about a shock to traditional video servers and expose them under the risk of overloading. Among the huge amount of online videos, there are quite a number of Near-Duplicate Videos (NDVs). Although many works have been proposed to detect NDVs, few researches are investigated to compress these NDVs in a more effective way than independent compression. In this work, we utilize the data redundancy of NDVs and propose a video coding method to jointly compress NDVs. In order to employ the proposed video coding method, a number of pre-processing functions are designed to explore the correlation of visual information among NDVs and to suit the video coding requirements. Experimental results verify that the proposed video coding method is able to effectively compress NDVs and thus save video data storage.
We attack the sensor network deployment problem. We define the deployment problem as the problem of deciding how many sensor nodes should be deployed in the sensor field over how many phases during its lifetime. We ta...
详细信息
We attack the sensor network deployment problem. We define the deployment problem as the problem of deciding how many sensor nodes should be deployed in the sensor field over how many phases during its lifetime. We target the optimal deployment strategy that meets user-defined availability requirement with minimum total cost taking into consideration node failures and changing field trip to sensor node cost ratio. We model WSN availability and total cost as functions of the deployment plan, then, we formalize the deployment problem as a 2D optimization problem. Our modeling enables us to explore cost-benefit tradeoffs, we believe, this is a solid step toward bringing cost as an explicit dimension in the design space of WSN protocols. We compare the performance of the optimized solution (denoted as pro-active) to more ad-hoc solutions: on-demand and at-front. The former strategy schedules future deployments only on demand. The latter strategy deploys all nodes at front with no later field trips. Using extensive simulations, we show that proactive outperforms at-front and on-demand in terms of total cost per availability unit in all application scenarios. For example, using pro-active costs $7 compared to $40 and $280 per total uptime in case of on-demand and at-front, respectively.
Designing and deriving effective model-based reinforcement learning (MBRL) algorithms with a performance improvement guarantee is challenging, mainly attributed to the high coupling between model learning and policy o...
详细信息
A primary challenge for visual-based Reinforcement Learning (RL) is to generalize effectively across unseen environments. Although previous studies have explored different auxiliary tasks to enhance generalization, fe...
详细信息
This paper introduces an automatic Web service composition method based on logical inference of Horn clauses and Petri nets. The Web service composition problem is transformed into the logical inference problem of Hor...
详细信息
One of the most promising advantages of Web service technology is the possibility of creating value-added services by combining existing ones. A major challenge is how to discover and select concrete service according...
详细信息
One of the most promising advantages of Web service technology is the possibility of creating value-added services by combining existing ones. A major challenge is how to discover and select concrete service according to user requirements. This paper addresses the topic of service discovery composite Web services. The main feature is that we take the process model as well as service profile into account. Firstly, the process models of Web services are translated into Petri nets. Based on this, we propose a service matchmaking algorithm, via comparing the functionality compatibility and process consistency, thus leading to more accurate matchmaking.
Illumination, occlusion, pose and expression variations are the most common challenging problems for face recognition in many real-world applications. However, existing face recognition methods are proposed to handle ...
详细信息
Designing and deriving effective model-based reinforcement learning (MBRL) algorithms with a performance improvement guarantee is challenging, mainly attributed to the high coupling between model learning and policy o...
Designing and deriving effective model-based reinforcement learning (MBRL) algorithms with a performance improvement guarantee is challenging, mainly attributed to the high coupling between model learning and policy optimization. Many prior methods that rely on return discrepancy to guide model learning ignore the impacts of model shift, which can lead to performance deterioration due to excessive model updates. Other methods use performance difference bound to explicitly consider model shift. However, these methods rely on a fixed threshold to constrain model shift, resulting in a heavy dependence on the threshold and a lack of adaptability during the training process. In this paper, we theoretically derive an optimization objective that can unify model shift and model bias and then formulate a fine-tuning process. This process adaptively adjusts the model updates to get a performance improvement guarantee while avoiding model over-fitting. Based on these, we develop a straightforward algorithm USB-PO (Unified model Shift and model Bias Policy Optimization). Empirical results show that USB-PO achieves state-of-the-art performance on several challenging benchmark tasks. Code: https://***/betray12138/***
To improve the availability of data in the cloud and avoid vendor lock-in risk, multi-cloud storage is attracting more and more attentions. However, accessing data from the cloud usually has some disadvantages such as...
详细信息
Central pattern generator (CPG) plays an important role in rhythmic activities of animals and this mechanism is an important inspiration source for the motion control of legged robots. In this paper, by using CPGs and...
详细信息
ISBN:
(纸本)9780889868595
Central pattern generator (CPG) plays an important role in rhythmic activities of animals and this mechanism is an important inspiration source for the motion control of legged robots. In this paper, by using CPGs and function mapping mechanism, a high-efficiency distributed CPG control network is constructed to realize the locomotion control of biped NAO robot. To realize stable and coordinated locomotion, the parameters of the CPG network are evolved by multi-object genetic algorithm (MOGA). Simulations with Webots validate the feasibility and efficiency of the presented CPG-based control method.
暂无评论