LAGE is a systematic framework developed in Java. The motivation of LAGE is to provide a scalable and parallel solution to reconstruct Gene Regulatory Networks (GRNs) from continuous gene expression data for very large amount of genes. The basic idea of our framework is motivated by the philosophy of divideand-conquer. Specifically, LAGE recursively partitions genes into multiple overlapping communities with much smaller sizes, learns intra-community GRNs respectively before merge them altogether. Besides, the complete information of overlapping communities serves as the byproduct, which could be used to mine meaningful functional modules in biological networks.

In this paper secured wireless communication using fuzzy logic based high speed public key cryptography (FLHSPKC) has been proposed by satisfying the major issues likes computational safety, power management and restricted usage of memory in wireless communication. Wireless Sensor Network (WSN) has several major constraints likes inadequate source of energy, restricted computational potentiality and limited memory. Though conventional Elliptic Curve Cryptography (ECC) which is a sort of public key cryptography used in wireless communication provides equivalent level of security like other existing public key algorithm using smaller parameters than other but this traditional ECC does not take care of all these major limitations in WSN. In conventional ECC consider Elliptic curve point p, an arbitrary integer k and modulus m, ECC carry out scalar multiplication kP mod m, which takes about 80% of key computation time on WSN. In this paper proposed FLHSPKC scheme provides some novel strategy including novel soft computing based strategy to speed up scalar multiplication in conventional ECC and which in turn takes shorter computational time and also satisfies power consumption restraint, limited usage of memory without hampering the security level. Performance analysis of the different strategies under FLHSPKC scheme and comparison study with existing conventional ECC methods has been done.

In English, “puns” are usually perceived as a subclass of “jokes”. In Japanese, however, this is not necessarily true. In this paper we investigate whether Japanese native speakers perceive dajare (puns) as jooku (jokes). We first summarize existing research in the field of computational humor, both in English and Japanese, focusing on the usage of these two terms. This shows that in works of Japanese native speakers, puns are not commonly treated as jokes. Next we present some dictionary definitions of dajare and jooku, which show that they may actually be used in a similar manner to English. In order to study this issue, we conducted a survey, in which we asked Japanese participants three questions: whether they like jokes (jooku), whether they like puns (dajare) and whether dajare are jooku. The results showed that there is no common agreement regarding dajare being a genre of jokes. We analyze the outcome of this experiment and discuss them from different points of view.

This study extends humor theory to explain puns originating from orthographic conversion in Japanese computer-mediated communication (CMC). Standard word-processing software converts Romanized input to appropriate orthographic output consisting of phono-graphic kana and ideographic kanji . Such software may produce an output often semantically incongruent with the intended output, which can be humorous. The dataset analyzed here consists of 492 online submissions to the “Humorous Misconversion Contest” held by the Japan Kanji Aptitude Testing Foundation. Since not all misconversions are funny, the study accounts for how misconversions satisfy funniness conditions of the Semantic Script Theory of Humor. The study finds that script interpretability, as the basis of script compatibility, and script opposition are of most importance in humor perception. It also finds that script oppositeness resides not only within texts but also in outer contexts. As yet, very few academic studies have discussed humor in Japanese CMC. Since a majority of verbal humor is researched on alphabet-based languages, the observations here are expected to enrich and broaden our knowledge of humor.

We are interested in aggregating forecasts of multinomial problems elicited from multiple experts. A common approach is to assign a weight to each expert, then form a weighted sum over their forecasts. Theoretical studies suggest that an important factor in such weighting is the diversity among experts. However, diversity is intrinsically a pairwise measure over experts, and does not lend itself naturally to a single weight that can be applied to an expert’s forecast in a weighted average. We suggest a way to take advantage of such pairwise measures in aggregating forecasts.

List of organizers of the AAAI Fall Symposium on Robots Learning Interactively from Human Teachers.

Statistical models almost always yield predictions that are more accurate than those of human experts. However, humans are better at data acquisition and at recognizing atypical circumstances. We use prediction markets to combine predictions from groups of humans and artificial-intelligence agents and show that they are more robust than those from groups of humans or agents alone.

In this article some formal, content-related and procedural considerations towards the sense of humor are articulated and the analysis of both everyday humor behavior and of comic styles leads to the initial proposal of a four factor-model of humor (4FMH). This model is tested in a new dataset and it is also examined whether two forms of comic styles (benevolent humor and moral mockery) do fit in. The model seems to be robust but further studies on the structure of the sense of humor as a personality trait are required.

This exercise in metatheory presents what any theory consists of and what properties it should have. It, then, adjust the general recipe to a theory of humor and computational humor. In this light, it reviews the state of the art in computational humor and suggests the main lines of development.

Relational data representations have become an increasingly important topic due to the recent proliferation of network datasets (e.g., social, biological, information networks) and a corresponding increase in the application of Statistical Relational Learning (SRL) algorithms to these domains. In this article, we examine and categorize techniques for transforming graph-based relational data to improve SRL algorithms. In particular, appropriate transformations of the nodes, links, and/or features of the data can dramatically affect the capabilities and results of SRL algorithms. We introduce an intuitive taxonomy for data representation transformations in relational domains that incorporates link transformation and node transformation as symmetric representation tasks. More specifically, the transformation tasks for both nodes and links include (i) predicting their existence, (ii) predicting their label or type, (iii) estimating their weight or importance, and (iv) systematically constructing their relevant features. We motivate our taxonomy through detailed examples and use it to survey competing approaches for each of these tasks. We also discuss general conditions for transforming links, nodes, and features. Finally, we highlight challenges that remain to be addressed.