Transportation Problem is an important problem which has been widely studied in Operations Research domain. It has been often used to simulate different real life problems. In particular, application of this Problem in NP Hard Problems has a remarkable significance. In this Paper, we present the closed, bounded and non empty feasible region of the transportation problem using fuzzy trapezoidal numbers which ensures the existence of an optimal solution to the balanced transportation problem. The multivalued nature of Fuzzy Sets allows handling of uncertainty and vagueness involved in the cost values of each cells in the transportation table. For finding the initial solution of the transportation problem we use the Fuzzy Vogel Approximation Method and for determining the optimality of the obtained solution Fuzzy Modified Distribution Method is used. The fuzzification of the cost of the transportation problem is discussed with the help of a numerical example. Finally, we discuss the computational complexity involved in the problem. To the best of our knowledge, this is the first work on obtaining the solution of the transportation problem using fuzzy trapezoidal numbers.

Transportation Problem is an important aspect which has been widely studied in Operations Research domain. It has been studied to simulate different real life problems. In particular, application of this Problem in NP- Hard Problems has a remarkable significance. In this Paper, we present a comparative study of Transportation Problem through Probabilistic and Fuzzy Uncertainties. Fuzzy Logic is a computational paradigm that generalizes classical two-valued logic for reasoning under uncertainty. In order to achieve this, the notation of membership in a set needs to become a matter of degree. By doing this we accomplish two things viz., (i) ease of describing human knowledge involving vague concepts and (ii) enhanced ability to develop cost-effective solution to real-world problem. The multi-valued nature of Fuzzy Sets allows handling uncertain and vague information. It is a model-less approach and a clever disguise of Probability Theory. We give comparative simulation results of both approaches and discuss the Computational Complexity. To the best of our knowledge, this is the first work on comparative study of Transportation Problem using Probabilistic and Fuzzy Uncertainties.

Ensemble methods have been shown to be an effective tool for solving multi-label classification tasks. In the RAndom k-labELsets (RAKEL) algorithm, each member of the ensemble is associated with a small randomly-selected subset of k labels. Then, a single label classifier is trained according to each combination of elements in the subset. In this paper we adopt a similar approach, however, instead of randomly choosing subsets, we select the minimum required subsets of k labels that cover all labels and meet additional constraints such as coverage of inter-label correlations. Construction of the cover is achieved by formulating the subset selection as a minimum set covering problem (SCP) and solving it by using approximation algorithms. Every cover needs only to be prepared once by offline algorithms. Once prepared, a cover may be applied to the classification of any given multi-label dataset whose properties conform with those of the cover. The contribution of this paper is two-fold. First, we introduce SCP as a general framework for constructing label covers while allowing the user to incorporate cover construction constraints. We demonstrate the effectiveness of this framework by proposing two construction constraints whose enforcement produces covers that improve the prediction performance of random selection. Second, we provide theoretical bounds that quantify the probabilities of random selection to produce covers that meet the proposed construction criteria. The experimental results indicate that the proposed methods improve multi-label classification accuracy and stability compared with the RAKEL algorithm and to other state-of-the-art algorithms.

Coming with the ever growing computational power of mobile devices, mobile visual search have undergone an evolution in techniques and applications. A significant trend is low bit rate visual search, where compact visual descriptors are extracted directly over a mobile and delivered as queries rather than raw images to reduce the query transmission latency. In this article, we introduce our work on low bit rate mobile landmark search, in which a compact yet discriminative landmark image descriptor is extracted by using location context such as GPS, crowd-sourced hotspot WLAN, and cell tower locations. The compactness originates from the bag-of-words image representation, with an offline learning from geotagged photos from online photo sharing websites including Flickr and Panoramio. The learning process involves segmenting the landmark photo collection by discrete geographical regions using Gaussian mixture model, and then boosting a ranking sensitive vocabulary within each region, with an “entropy” based descriptor compactness feedback to refine both phases iteratively. In online search, when entering a geographical region, the codebook in a mobile device are downstream adapted to generate extremely compact descriptors with promising discriminative ability. We have deployed landmark search apps to both HTC and iPhone mobile phones, working over the database of million scale images in typical areas like Beijing, New York, and Barcelona, and others. Our descriptor outperforms alternative compact descriptors (Chen et al. 2009; Chen et al., 2010; Chandrasekhar et al. 2009a; Chandrasekhar et al. 2009b) with significant margins. Beyond landmark search, this article will summarize the MPEG standarization progress of compact descriptor for visual search (CDVS) (Yuri et al. 2010; Yuri et al. 2011) towards application interoperability.

The Sixth Conference on Artificial held in cooperation with AAAI. Fifth Biannual Humaine Association ICWSM-13 will be held July 8-11, 2013 IJCAI-13 will be held August 3-Conference on Affective Computing at MIT, Cambridge, MA USA 9, 2013 in Beijing, China and Intelligent Interaction. IC3K 2013 will be held on Enterprise Information Systems. September 19-22, 2013 in Vilamoura, ICEIS 2013 will be held July 3-7, 2013 Algarve, Portugal Ninth AAAI Conference on Digital in Angers, France Entertainment. CI 2013 will be held September 20-22, Based Reasoning.

According to Daniel Kahneman, there are two systems that drive the human decision making process: The intuitive system that performs the fast thinking, and the deliberative system that does more logical and slower thinking. Inspired by this model, we propose a framework for implementing human activity recognition on mobile devices. In this area, the mobile app is usually always-on and the general challenge is how to balance accuracy and energy consumption. However, among existing approaches, those based on cellular IDs consume little power but are less accurate; those based on GPS/WiFi sampling are accurate often at the costs of battery drainage; moreover, previous methods in general do not improve over time. To address these challenges, our framework consists of two modes: In the deliberation mode, the system learns cell ID patterns that are trained by existing GPS/WiFi based methods; in the intuition mode, only the learned cell ID patterns are used for activity recognition, which is both accurate and energy-efficient; system parameters are learned to control the transition from deliberation to intuition, when sufficient confidence is gained, and the transition from intuition to deliberation, when more training is needed. For the scope of this paper, we first elaborate our framework in a subproblem in activity recognition, trip detection, which recognizes significant places and trips between them. For evaluation, we collected real-life traces of six participants over five months. Our experiments demonstrated consistent results across different participants in terms of accuracy and energy efficiency, and, more importantly, its fast improvement on energy efficiency over time due to regularities in human daily activities.

In this article, we investigate the possibility of cross-language communication using a synergy of words and pictures on mobile devices. Communicating with only pictures is in itself a very powerful strategy, but is limited in expressiveness. On the other hand, words can express everything you could wish to say, but they are cumbersome to work with on mobile devices, and need to be translated in order for their meaning to be understood. Automatic translations can contain errors that pervert the communication process, and this may undermine the users’ confidence when expressing themselves across language barriers. Our idea is to create a user interface for cross-language communication that uses pictures as the primary mode of input, and words to express the detailed meaning. This interface creates a visual process of communication that occurs on two heterogeneous channels that can support each other. We implemented this user interface as application on the Apple iPad tablet, and performed a set of experiments to determine its usefulness as a translation aid for travellers.

Rank minimization has attracted a lot of attention due to its robustness in data recovery. To overcome the computational difficulty, rank is often replaced with nuclear norm. For several rank minimization problems, such a replacement has been theoretically proven to be valid, i.e., the solution to nuclear norm minimization problem is also the solution to rank minimization problem. Although it is easy to believe that such a replacement may not always be valid, no concrete example has ever been found. We argue that such a validity checking cannot be done by numerical computation and show, by analyzing the noiseless latent low rank representation (LatLRR) model, that even for very simple rank minimization problems the validity may still break down. As a by-product, we find that the solution to the nuclear norm minimization formulation of LatLRR is non-unique. Hence the results of LatLRR reported in the literature may be questionable.

Complexity of the text has been developed with varying degrees of success, [2][3]. This work devised a novel measure based on L-system [1] that can compute the structural complexity of a text sequence. Given a text, we first transform it into a binary string. Then, use L-system to model the tree structure of this string and get its structural complexity. We will introduce how to use L-system to model the string in this section. The measure of complexity for the text sequence is included in the next section.

We consider the traffic data reconstruction problem. Suppose we have the traffic data of an entire city that are incomplete because some road data are unobserved. The problem is to reconstruct the unobserved parts of the data. In this paper, we propose a new method to reconstruct incomplete traffic data collected from various traffic sensors. Our approach is based on Markov random field modeling of road traffic. The reconstruction is achieved by using mean-field method and a machine learning method. We numerically verify the performance of our method using realistic simulated traffic data for the real road network of Sendai, Japan.