In the real world, a realistic setting for computer vision or multimedia recognition problems is that we have some classes containing lots of training data and many classes contain a small amount of training data. Therefore, how to use frequent classes to help learning rare classes for which it is harder to collect the training data is an open question. Learning with Shared Information is an emerging topic in machine learning, computer vision and multimedia analysis. There are different level of components that can be shared during concept modeling and machine learning stages, such as sharing generic object parts, sharing attributes, sharing transformations, sharing regularization parameters and sharing training examples, etc. Regarding the specific methods, multi-task learning, transfer learning and deep learning can be seen as using different strategies to share information. These learning with shared information methods are very effective in solving real-world large-scale problems. This special issue aims at gathering the recent advances in learning with shared information methods and their applications in computer vision and multimedia analysis. Both state-of-the-art works, as well as literature reviews, are welcome for submission. Papers addressing interesting real-world computer vision and multimedia applications are especially encouraged. Topics of interest include, but are not limited to:  • Multi-task learning or transfer learning for large-scale computer vision and multimedia analysis • Deep learning for large-scale computer vision and multimedia analysis • Multi-modal approach for large-scale computer vision and multimedia analysis • Different sharing strategies, e.g., sharing generic object parts, sharing attributes, sharing transformations, sharing regularization parameters and sharing training examples, • Real-world computer vision and multimedia applications based on learning with shared information, e.g., event detection, object recognition, object detection, action recognition, human head pose estimation, object tracking, location-based services, semantic indexing. • New datasets and metrics to evaluate the benefit of the proposed sharing ability for the specific computer vision or multimedia problem. • Survey papers regarding the topic of learning with shared information.  Authors who are unsure whether their planned submission is in scope may contact the guest editors prior to the submission deadline with an abstract, in order to receive feedback.

IEEE transactions on pattern analysis and machine intelligence

Formally we have arrived at the middle of the book. So you may need a pause for recovering, a pause which we want to fill up by some fixed point theorems supplementing those which you already met or which you will meet in later chapters. The first group of results centres around Banach’s fixed point theorem. The latter is certainly a nice result since it contains only one simple condition on the map F, since it is so easy to prove and since it nevertheless allows a variety of applications. Therefore it is not astonishing that many mathematicians have been attracted by the question to which extent the conditions on F and the space Ω can be changed so that one still gets the existence of a unique or of at least one fixed point. The number of results produced this way is still finite, but of a statistical magnitude, suggesting at a first glance that only a random sample can be covered by a chapter or even a book of the present size. Fortunately (or unfortunately?) most of the modifications have not found applications up to now, so that there is no reason to write a cookery book about conditions but to write at least a short outline of some ideas indicating that this field can be as interesting as other chapters. A systematic account of more recent ideas and examples in fixed point theory should however be written by one of the true experts. Strange as it is, such a book does not seem to exist though so many people are puzzling out so many results.

Fixed Point Theory

หนงสอ Behavioral Game Theory: Experiments in Strategic Interaction เขยนโดย Colin F. Camerer มวตถประสงคเพอนำเสนอหลกฐานเชงประจกษจากผลการวจยจำนวนมากมายทยนยนอทธพลของปจจยทางจตวทยาทมผลตอการตดสนใจตามทฤษฎเกม หนงสอ เลมนไดนำเสนอแนวคดทฤษฎทเพมความสามารถในการอธบายพฤตกรรมการตดสนใจตามทฤษฎเกม (Game theory) ซง von Neumann; & Morgenstern ไดเสนอไวในป ค.ศ. 1944 โดยชใหเหนวา ปจจยทางจตวทยามอทธพลทำใหการตดสนใจทเกดขนจรงคลาดเคลอนจากการคาดการณของทฤษฎเกม

Behavioral Game Theory: Experiments in Strategic Interaction

Modern Graph Theory

Want to get experience? Want to get any ideas to create new things in your life? Read methods of numerical integration now! By reading this book as soon as possible, you can renew the situation to get the inspirations. Yeah, this way will lead you to always think more and more. In this case, this book will be always right for you. When you can observe more about the book, you will know why you need this.

Methods of Numerical Integration

Wireless rechargeable sensor networks (WRSNs) have emerged as an alternative to solving the challenges of size and operation time posed by traditional battery-powered systems. In this paper, we study a WRSN built from the industrial wireless identification and sensing platform (WISP) and commercial off-the-shelf RFID readers. The paper-thin WISP tags serve as sensors and can harvest energy from RF signals transmitted by the readers. This kind of WRSNs is highly desirable for indoor sensing and activity recognition and is gaining attention in the research community. One fundamental question in WRSN design is how to deploy readers in a network to ensure that the WISP tags can harvest sufficient energy for continuous operation. We refer to this issue as the energy provisioning problem. Based on a practical wireless recharge model supported by experimental data, we investigate two forms of the problem: point provisioning and path provisioning. Point provisioning uses the least number of readers to ensure that a static tag placed in any position of the network will receive a sufficient recharge rate for sustained operation. Path provisioning exploits the potential mobility of tags (e.g., those carried by human users) to further reduce the number of readers necessary: mobile tags can harvest excess energy in power-rich regions and store it for later use in power-deficient regions. Our analysis shows that our deployment methods, by exploiting the physical characteristics of wireless recharging, can greatly reduce the number of readers compared with those assuming traditional coverage models.

Energy Provisioning in Wireless Rechargeable Sensor Networks

Coprime array offers a larger array aperture than uniform linear array with the same number of physical sensors, and has a better spatial resolution with increased degrees of freedom However, when it comes to the problem of adaptive beamforming, the existing adaptive beamforming algorithms designed for the general array cannot take full advantage of coprime feature offered by the coprime array In this paper, we propose a novel coprime array adaptive beamforming algorithm, where both robustness and efficiency are well balanced Specifically, we first decompose the coprime array into a pair of sparse uniform linear subarrays and process their received signals separately According to the property of coprime integers, the direction-of-arrival (DOA) can be uniquely estimated for each source by matching the super-resolution spatial spectra of the pair of sparse uniform linear subarrays Further, a joint covariance matrix optimization problem is formulated to estimate the power of each source The estimated DOAs and their corresponding power are utilized to reconstruct the interference-plus-noise covariance matrix and estimate the signal steering vector Theoretical analyses are presented in terms of robustness and efficiency, and simulation results demonstrate the effectiveness of the proposed coprime array adaptive beamforming algorithm

A Robust and Efficient Algorithm for Coprime Array Adaptive Beamforming

Wireless rechargeable sensor networks (WRSNs) have emerged as an alternative to solving the challenges of size and operation time posed by traditional battery-powered systems. In this paper, we study a WRSN built from the industrial wireless identification and sensing platform (WISP) and commercial off-the-shelf RFID readers. The paper-thin WISP tags serve as sensors and can harvest energy from RF signals transmitted by the readers. This kind of WRSNs is highly desirable for indoor sensing and activity recognition, and is gaining attention in the research community. One fundamental question in WRSN design is how to deploy readers in a network to ensure that the WISP tags can harvest sufficient energy for continuous operation. We refer to this issue as the energy provisioning problem. Based on a practical wireless recharge model supported by experimental data, we investigate two forms of the problem: point provisioning and path provisioning. Point provisioning uses the least number of readers to ensure that a static tag placed in any position of the network will receive a sufficient recharge rate for sustained operation. Path provisioning exploits the potential mobility of tags (e.g., those carried by human users) to further reduce the number of readers necessary: mobile tags can harvest excess energy in power-rich regions and store it for later use in power-deficient regions. Our analysis shows that our deployment methods, by exploiting the physical characteristics of wireless recharging, can greatly reduce the number of readers compared with those assuming traditional coverage models.

Energy provisioning in wireless rechargeable sensor networks

Crowdsensing offers an efficient approach to meet the demand in large scale sensing applications In crowdsensing, it is of great interest to find the optimal task allocation, which is challenging since sensing tasks with different requirements of quality of sensing are typically associated with specific locations and mobile users are constrained by time budgets We show that the allocation problem is NP hard We then focus on approximation algorithms, and devise an efficient local ratio based algorithm (LRBA) Our analysis shows that the approximation ratio of the aggregate rewards obtained by the optimal allocation to those by LRBA is 5 This reveals that LRBA is efficient, since a lower (but not tight) bound on the approximation ratio is 4 We also discuss about how to decide the fair prices of sensing tasks to provide incentives since mobile users tend to decline the tasks with low incentives We design a pricing mechanism based on bargaining theory, in which the price of each task is determined by the performing cost and market demand (ie, the number of mobile users who intend to perform the task) Extensive simulation results are provided to demonstrate the advantages of our proposed scheme

http://informationnet.asu.edu/pub/infocom14shibo.pdf

Toward Optimal Allocation of Location Dependent Tasks in Crowdsensing

In rechargeable sensor networks (RSNs), energy harvested by sensors should be carefully allocated for data sensing and data transmission to optimize data gathering due to time-varying renewable energy arrival and limited battery capacity. Moreover, the dynamic feature of network topology should be taken into account, since it can affect the data transmission. In this paper, we strive to optimize data gathering in terms of network utility by jointly considering data sensing and data transmission. To this end, we design a data gathering optimization algorithm for dynamic sensing and routing (DoSR), which consists of two parts. In the first part, we design a balanced energy allocation scheme (BEAS) for each sensor to manage its energy use, which is proven to meet four requirements raised by practical scenarios. Then in the second part, we propose a distributed sensing rate and routing control (DSR2C) algorithm to jointly optimize data sensing and data transmission, while guaranteeing network fairness. In DSR2C, each sensor can adaptively adjust its transmit energy consumption during network operation according to the amount of available energy, and select the optimal sensing rate and routing, which can efficiently improve data gathering. Furthermore, since recomputing the optimal data sensing and routing strategies upon change of energy allocation will bring huge communications for information exchange and computation, we propose an improved BEAS to manage the energy allocation in the dynamic environments and a topology control scheme to reduce computational complexity. Extensive simulations are performed to demonstrate the efficiency of the proposed algorithms in comparison with existing algorithms.

Shibo He

Papers

Energy Provisioning in Wireless Rechargeable Sensor Networks

A Robust and Efficient Algorithm for Coprime Array Adaptive Beamforming

Energy provisioning in wireless rechargeable sensor networks

Toward Optimal Allocation of Location Dependent Tasks in Crowdsensing

Data gathering optimization by dynamic sensing and routing in rechargeable sensor networks