On Providing Quality of Service in Grid Computing through Multi-objective Swarm-Based Knowledge Acquisition in Fuzzy Schedulers

Nowadays, Grid computing is increasingly showing a service-oriented tendency and as a result, providing quality of service (QoS) has raised as a relevant issue in such highly dynamic and non-dedicated systems. In this sense, the role of scheduling strategies is critical and new proposals able to deal with the inherent uncertainty of the grid state are needed in a way that QoS can be offered. Fuzzy rule-based schedulers are emerging scheduling schemas in Grid computing based on the efficient management of grid resources imprecise state and expert knowledge application to achieve an efficient workload distribution. Given the diverse and usually conflicting nature of the scheduling optimization objectives in grids considering both users and administrators requirements, these strategies can benefit from multi-objective strategies in their knowledge acquisition process greatly. This work suggests the QoS provision in the grid scheduling level with fuzzy rule-based schedulers through multi-objective knowledge acquisition considering multiple optimization criteria. With this aim, a novel learning strategy for the evolution of fuzzy rules based on swarm intelligence, Knowledge Acquisition with a Swarm Intelligence Approach (KASIA) is adapted to the multi-objective evolution of an expert grid meta-scheduler founded on Pareto general optimization theory and its performance with respect to a well-known genetic strategy is analyzed. In addition, the fuzzy scheduler with multi-objective learning results are compared to those of classical scheduling strategies in Grid computing.     

An interactive approach for Bayesian network learning using domain/expert knowledge

Using domain/expert knowledge when learning Bayesian networks from data has been considered a promising idea since the very beginning of the field. However, in most of the previously proposed approaches, human experts do not play an active role in the learning process. Once their knowledge is elicited, they do not participate any more. The interactive approach for integrating domain/expert knowledge we propose in this work aims to be more efficient and effective. In contrast to previous approaches, our method performs an active interaction with the expert in order to guide the search based learning process. This method relies on identifying the edges of the graph structure which are more unreliable considering the information present in the learning data. Another contribution of our approach is the integration of domain/expert knowledge at different stages of the learning process of a Bayesian network: while learning the skeleton and when directing the edges of the directed acyclic graph structure.     

Dynamic hyperbolic geometry: building intuition and understanding mediated by a Euclidean model

This paper explores a deep transformation in mathematical epistemology and its consequences for teaching and learning. With the advent of non-Euclidean geometries, direct, iconic correspondences between physical space and the deductive structures of mathematical inquiry were broken. For non-Euclidean ideas even to become thinkable the mathematical community needed to accumulate over twenty centuries of reflection and effort: a precious instance of distributed intelligence at the cultural level. In geometry education after this crisis, relations between intuitions and geometrical reasoning must be established philosophically, rather than taken for granted. One approach seeks intuitive supports only for Euclidean explorations, viewing non-Euclidean inquiry as fundamentally non-intuitive in nature. We argue for moving beyond such an impoverished approach, using dynamic geometry environments to develop new intuitions even in the extremely challenging setting of hyperbolic geometry. Our efforts reverse the typical direction, using formal structures as a source for a new family of intuitions that emerge from exploring a digital model of hyperbolic geometry. This digital model is elaborated within a Euclidean dynamic geometry environment, enabling a conceptual dance that re-configures Euclidean knowledge as a support for building intuitions in hyperbolic space—intuitions based not directly on physical experience but on analogies extending Euclidean concepts.     

Bayesian network approach to multinomial parameter learning using data and expert judgments

One of the hardest challenges in building a realistic Bayesian Network (BN) model is to construct the node probability tables (NPTs). Even with a fixed predefined model structure and very large amounts of relevant data, machine learning methods do not consistently achieve great accuracy compared to the ground truth when learning the NPT entries (parameters). Hence, it is widely believed that incorporating expert judgments can improve the learning process. We present a multinomial parameter learning method, which can easily incorporate both expert judgments and data during the parameter learning process. This method uses an auxiliary BN model to learn the parameters of a given BN. The auxiliary BN contains continuous variables and the parameter estimation amounts to updating these variables using an iterative discretization technique. The expert judgments are provided in the form of constraints on parameters divided into two categories: linear inequality constraints and approximate equality constraints. The method is evaluated with experiments based on a number of well-known sample BN models (such as Asia, Alarm and Hailfinder) as well as a real-world software defects prediction BN model. Empirically, the new method achieves much greater learning accuracy (compared to both state-of-the-art machine learning techniques and directly competing methods) with much less data. For example, in the software defects BN for a sample size of 20 (which would be considered difficult to collect in practice) when a small number of real expert constraints are provided, our method achieves a level of accuracy in parameter estimation that can only be matched by other methods with much larger sample sizes (320 samples required for the standard machine learning method, and 105 for the directly competing method with constraints).     

Linguistic indexicality in algebra discussions

In discussion-oriented classrooms, students create mathematical ideas through conversations that reflect growing collective knowledge. Linguistic forms known as indexicals assist in the analysis of this collective, negotiated understanding. Indexical words and phrases create meaning through reference to the physical, verbal and ideational context. While some indexicals such as pronouns and demonstratives (e.g. this, that) are fairly well-known in mathematics education research, other structures play significant roles in math discussions as well. We describe students’ use of entailing and presupposing indexicality, verbs of motion, and poetic structures to express and negotiate mathematical ideas and classroom norms including pedagogical responsibility, conjecturing, evaluating and expressing reified mathematical knowledge. The multiple forms and functions of indexical language help describe the dynamic and emergent nature of mathematical classroom discussions. Because interactive learning depends on linguistically established connections among ideas, indexical language may prove to be a communicative resource that makes collaborative mathematical learning possible.     

Behavioral modeling in weight loss interventions

Designing systems with human agents is difficult because it often requires models that characterize agents’ responses to changes in the system’s states and inputs. An example of this scenario occurs when designing treatments for obesity. While weight loss interventions through increasing physical activity and modifying diet have found success in reducing individuals’ weight, such programs are difficult to maintain over long periods of time due to lack of patient adherence. A promising approach to increase adherence is through the personalization of treatments to each patient. In this paper, we make a contribution toward treatment personalization by developing a framework for predictive modeling using utility functions that depend upon both time-varying system states and motivational states evolving according to some modeled process corresponding to qualitative social science models of behavior change. Computing the predictive model requires solving a bilevel program, which we reformulate as a mixed-integer linear program (MILP). This reformulation provides the first (to our knowledge) formulation for Bayesian inference that uses empirical histograms as prior distributions. We study the predictive ability of our framework using a data set from a weight loss intervention, and our predictive model is validated by comparison to standard machine learning approaches. We conclude by describing how our predictive model could be used for optimization, unlike standard machine learning approaches that cannot.     

Effective learning in the presence of adaptive counterparts

Adaptive learning algorithms (ALAs) is an important class of agents that learn the utilities of their strategies jointly with the maintenance of the beliefs about their counterparts' future actions. In this paper, we propose an approach of learning in the presence of adaptive counterparts. Our Q-learning based algorithm, called Adaptive Dynamics Learner (ADL), assigns Q-values to the fixed-length interaction histories. This makes it capable of exploiting the strategy update dynamics of the adaptive learners. By so doing, ADL usually obtains higher utilities than those of equilibrium solutions. We tested our algorithm on a substantial representative set of the most known and demonstrative matrix games. We observed that ADL is highly effective in the presence of such ALAs as Adaptive Play Q-learning, Infinitesimal Gradient Ascent, Policy Hill-Climbing and Fictitious Play Q-learning. Further, in self-play ADL usually converges to a Pareto efficient average utility.     

分类问题的在线顺序双并联快速学习机

双并联前馈神经网络模型是单层感知机和单隐层前馈神经网络的混合结构,本文构造了一种双并联快速学习机算法,与其他类似算法比较,提出的算法能利用较少的隐层单元及更少的待定参数,获得近似的学习性能.数值实验表明,对很多实际分类问题,提出的算法具备更佳的泛化能力,因而可以作为快速学习机算法的有益补充.     

Learning about teaching for understanding through the study of tutoring

In this study, we conducted a fine-grained analysis of an expert tutor's (Nancy Mack) tutorial actions as she attempted, successfully, to help students learn fractions with understanding. Our analysis revealed that, as Mack tutored students in two different research studies, she took two types of tutorial actions previously unrecorded in the literature. By analyzing her actions using a methodology involving production rules, we suggest how her content knowledge, pedagogical content knowledge, and her knowledge of her students were interrelated and how they impacted on her instructional decisions and teaching actions. We also provide an example of how using production rules can be useful to discern some of the complexities involved in teaching and tutoring.     

Student achievement effects of technology-supported remediation of understanding of fractions

Students have difficulty learning fractions, and problems in understanding fractions persist into adulthood, with moderate to severe consequences for everyday and occupational decision-making. Remediation of student misconceptions is hampered by deficiencies in teachers’ knowledge of the discipline and pedagogical content knowledge. We theorized that a technology resource could provide the sequencing and scaffolding that teachers might have difficulty providing. Five sets of learning objects, called CLIPS (Critical Learning Instructional Paths Supports), were developed to provide remediation on fraction concepts. In this article, we describe one stage in a research program to develop, implement and evaluate CLIPS. Two studies were conducted. In Study 1, 14 grade 7–10 classrooms were randomly assigned, within schools, to early and late treatment conditions. A pre-post, delayed treatment design found that CLIPS had no effect on achievement for the Early Treatment group due to unforeseen implementation problems. These hardware and software issues were mitigated in the late treatment in which CLIPS contributed to student achievement (Cohen's d = 0.30). Study 2 was a pre-post, single group replication involving 18 grade 7 classrooms. The independent variable was the number of CLIPS completed. Completion of all five CLIPS contributed to higher student achievement: Cohen's d = 0.53, compared to students who completed none (d = 0.00) or 1–4 CLIPS (d = 0.02). The two studies indicate that a research-based set of learning objects is effective when the full program is implemented. Incomplete sequences deprive students of instruction in one or more constructs linked to other key ideas in the conceptual map and reduce the amount of practice required to remediate student misconceptions.     

Searching for knowledge in a world flooded with facts

The wide availability of computer technology and large electronic storage media has led to an enormous proliferation of databases in almost every area of human endeavour. This naturally creates an intense demand for powerful methods and tools for data analysis. Current methods and tools are primarily oriented toward extracting numerical and statistical data characteristics. While such characteristics are very important and useful, they are often insufficient. A decision maker typically needs an interpretation of these findings, and this has to be done by a data analyst. With the growth in the amount and complexity of the data, making such interpretations is an increasingly difficult problem. As a potential solution, this paper advocates the development of methods for conceptual data analysis. Such methods aim at semi-automating the processes of determining high-level data interpretations, and discovering qualitative patterns in data. It is argued that these methods could be built on the basis of algorithms developed in the area of machine learning. An exemplary system utilizing such algorithms, INLEN, is discussed. The system integrates machine learning and statistical analysis techniques with database and expert system technologies. Selected capabilities of the system are illustrated by examples from implemented modules.     

Collective Intelligence and its Implementation on the Web: Algorithms to Develop a Collective Mental Map

Collective intelligence is defined as the ability of a group to solve more problems than its individual members. It is argued that the obstacles created by individual cognitive limits and the difficulty of coordination can be overcome by using a collective mental map (CMM). A CMM is defined as an external memory with shared read/write access, that represents problem states, actions and preferences for actions. It can be formalized as a weighted, directed graph. The creation of a network of pheromone trails by ant colonies points us to some basic mechanisms of CMM development: averaging of individual preferences, amplification of weak links by positive feedback, and integration of specialised subnetworks through division of labor. Similar mechanisms can be used to transform the World-Wide Web into a CMM, by supplementing it with weighted links. Two types of algorithms are explored: 1) the co-occurrence of links in web pages or user selections can be used to compute a matrix of link strengths, thus generalizing the technique of &201C;collaborative filtering&201D;; 2) learning web rules extract information from a user&2018;s sequential path through the web in order to change link strengths and create new links. The resulting weighted web can be used to facilitate problem-solving by suggesting related links to the user, or, more powerfully, by supporting a software agent that discovers relevant documents through spreading activation.     

Comparing reinforcement learning approaches for solving game theoretic models: a dynamic airline pricing game example

Games can be easy to construct but difficult to solve due to current methods available for finding the Nash Equilibrium. This issue is one of many that face modern game theorists and those analysts that need to model situations with multiple decision-makers. This paper explores the use of reinforcement learning, a standard artificial intelligence technique, as a means to solve a simple dynamic airline pricing game. Three different reinforcement learning approaches are compared: SARSA, Q-learning and Monte Carlo Learning. The pricing game solution is surprisingly sophisticated given the game's simplicity and this sophistication is reflected in the learning results. The paper also discusses extra analytical benefit obtained from applying reinforcement learning to these types of problems.     

A comparative analysis of machine learning techniques and fuzzy analytic hierarchy process to determine the tacit knowledge criteria

Knowledge management is widely considered as a strategic tool to increase firm performance by enabling the reuse of organizational knowledge. Although many have studied knowledge management in a variety of business settings, the concept of tacit knowledge, especially the individual one, has not been explored in due detail. The objective of this study is to identify and prioritize individual tacit knowledge criteria and to explain their effects on firm performance. In the proposed methodology, first, the most prevalent individual tacit knowledge variables are identified by means of knowledge elicitation and feature selection methods. Then, the extracted variables were prioritized using machine learning methods and fuzzy Analytic Hierarchy Process (AHP). Support vector machine (SVM), logistic regression, and artificial neural networks are used as the first approach, followed by fuzzy AHP as the second approach. Based on the comparative analysis results, SVM (as the best-performed machine-learning technique) and fuzzy AHP methods were identified for the subsequent analysis. The results showed that both SVM and fuzzy AHP determined time efficiency of employees, communication between employees and supervisors, and innovative capability of employees as the most important tacit knowledge criteria. These findings are mostly supported by the extant literature, and collectively shows the synergistic nature of the utilized analytics approaches in determining individual tacit knowledge criteria.

     

A neural fuzzy control system with structure and parameter learning

A general connectionist model, called neural fuzzy control network (NFCN), is proposed for the realization of a fuzzy logic control system. The proposed NFCN is a feedforward multilayered network which integrates the basic elements and functions of a traditional fuzzy logic controller into a connectionist structure which has distributed learning abilities. The NFCN can be constructed from supervised training examples by machine learning techniques, and the connectionist structure can be trained to develop fuzzy logic rules and find membership functions. Associated with the NFCN is a two-phase hybrid learning algorithm which utilizes unsupervised learning schemes for structure learning and the backpropagation learning scheme for parameter learning. By combining both unsupervised and supervised learning schemes, the learning speed converges much faster than the original backpropagation algorithm. The two-phase hybrid learning algorithm requires exact supervised training data for learning. In some real-time applications, exact training data may be expensive or even impossible to obtain. To solve this problem, a reinforcement neural fuzzy control network (RNFCN) is further proposed. The RNFCN is constructed by integrating two NFCNs, one functioning as a fuzzy predictor and the other as a fuzzy controller. By combining a proposed on-line supervised structure-parameter learning technique, the temporal difference prediction method, and the stochastic exploratory algorithm, a reinforcement learning algorithm is proposed, which can construct a RNFCN automatically and dynamically through a reward-penalty signal (i.e., “good” or “bad” signal). Two examples are presented to illustrate the performance and applicability of the proposed models and learning algorithms.     

Finding the needles in the haystack: efficient intelligence processing

As a result of communication technologies, the main intelligence challenge has shifted from collecting data to efficiently processing it so that relevant, and only relevant, information is passed on to intelligence analysts. We consider intelligence data intercepted on a social communication network. The social network includes both adversaries (eg terrorists) and benign participants. We propose a methodology for efficiently searching for relevant messages among the intercepted communications. Besides addressing a real and urgent problem that has attracted little attention in the open literature thus far, the main contributions of this paper are two-fold. First, we develop a novel knowledge accumulation model for intelligence processors, which addresses both the nodes of the social network (the participants) and its edges (the communications). Second, we propose efficient prioritization algorithms that utilize the processor’s accumulated knowledge. Our approach is based on methods from graphical models, social networks, random fields, Bayesian learning, and exploration/exploitation algorithms.     

A Simulation and Learning Technique for Generating Knowledge about Manufacturing Systems Behavior

One of the most important difficulties when developing knowledge based systems in manufacturing scheduling or control, is finding the required knowledge. We address here the problem of acquiring knowledge about the behavior of manufacturing systems. Learning algorithms are proposed to generate, from simulation experiments, a set of production rules. This set may be considered as a simulation meta-model, and may be used either directly by the shop manager, or inserted into a knowledge base. This approach is illustrated by the use of the learning program GENREG. It generates rules related to the behavior of a simplified flow shop when different dispatching rules are applied.     

Network formation and knowledge gains

Incentive-based models for network formation link micro actions to changes in network structure. Sociologists have extended these models on a number of fronts, but there remains a tendency to treat actors as homogenous agents and to disregard social theory. Drawing upon literature on the strategic use of networks for knowledge gains, we specify models exploring the co-evolution of networks and knowledge gains. Our findings suggest that pursuing transitive ties is the most successful strategy, as more reciprocity and cycling result from this pursuit, thus encouraging learning across the network. We also discuss the role of network size, global network structure, and parameter strength in actors’ attainment of knowledge resources.     

Investment using evolutionary learning methods and technical rules

In this paper, I propose a genetic learning approach to generate technical trading systems for stock timing. The most informative technical indicators are selected from a set of almost 5000 signals by a multi-objective genetic algorithm with variable string length. Successively, these signals are combined into a unique trading signal by a learning method. I test the expert weighting solution obtained by the plurality voting committee, the Bayesian model averaging and Boosting procedures with data from the S&P 500 Composite Index, in three market phases, up-trend, down-trend and sideways-movements, covering the period 2000–2006. Computational results indicate that the near-optimal set of rules varies among market phases but presents stable results and is able to reduce or eliminate losses in down-trend periods.     

A numerical strategy to defectuous knowledge using

Knowledge-Based Systems are based on an often defectuous knowledge, be this knowledge acquired from experts or learned from examples.This paper presents a strategy designed to cope with defectuous knowledge: given a set of rules, it builds a similarity function over the work space of the problem. This similarity function together with a set of examples then enables case-based reasoning, through aK-nearest-neighbour-like process.Compared to other case-based reasoning techniques, the advantage of this approach is the following: the topology of the space is automatically induced from the given rules, instead of being explicitly provided (and tuned) by the expert.