Abstract:
Using of the Internet technology and the field of Fuzzy expert systems has proposed new branches of sharing and distributing knowledge. However, there has been a general lack of investigation in the area of web-based Fuzzy expert systems (FES). In this paper the issues associated with the design, development, and use of web-based FES from a standpoint of the benefits and challenges of developing and using them. The original theory and concepts in conventional FES were reviewed and a knowledge engineering framework for developing them was revisited. Student in an educational place need an educational advisor for solve problems. Some of educational circulars order changing because advisor must update information away. The student's request is linguistic and crisp Expert System cannot solve problems completely. In my approach we build Web-Based Fuzzy Expert System for Student Education Advisor (FES-SEA) and stays in university portal. This system implemented with ASP.NET, SQL-SERVER 2008.

Abstract:
Adaptive learning is a new approach for e-learning systems. In comparison to traditional e-learning systems, which present same things for all learners, these systems automatically adapt with learner characteristics. In this paper, we are going to propose a new method for Adaptive learning, and consider adaptation from three viewpoints: 1) learner learning style, 2) learner’s knowledge level, 3) learner’s score. Due to similarity between learning objects graph and petri net, and In order to provide adaptive learning, we use an approach based on a high level petri net (HLPN).Also we propose a method to evaluate performance in this system. We compare our system with a non adaptive system, through our performance evaluating method. The results show response time for our system is less than non adaptive system and learners finish course in a relatively shorter period of time. Since our proposed system considers individual features of learner, we can be sure that learner would not be confused in learning materials.

Abstract:
Using of the Internet technology and the field of Fuzzy Expert Systems has proposed new branches of sharing and distributing knowledge. However, there has been a general lack of investigation in the area of web-based Fuzzy Expert Systems (FES). In this study, the issues associated with the design, development and use of web-based FES from a standpoint of the benefits and challenges of developing and using them. The original theory and concepts in conventional FES were reviewed and a knowledge engineering framework for developing them was revisited. Student in an educational place need an educational advisor for solve problems. Some of educational circulars order changing because advisor must update information away. The student s request is Linguistic and Crisp Expert System cannot solve problems completely. In my approach we build Web-Based Fuzzy Expert System for Student Education Advisor (FES-SEA) and stays in university portal. This system implemented with ASP.NET, SQL-SERVER 2008.

Abstract:
Heterogeneous Wireless Networks are considered nowadays as one of the potential areas in research and development. The traffic management’s schemes that have been used at the fusion points between the different wireless networks are classical and conventional. This paper is focused on developing a novel scheme to overcome the problem of traffic congestion in the fusion point router interconnected the heterogeneous wireless networks. The paper proposed an EF-AQM algorithm which provides an efficient and fair allocation of bandwidth among different established flows. Finally, the proposed scheme developed, tested and validated through a set of experiments to demonstrate the relative merits and capabilities of a proposed scheme

Abstract:
We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property, and it depends on new criteria ensuring all iterates of f are irreducible. In particular when F is a number field in which the ideal (2) is not a square, we construct infinitely many families of quadratic f such that every iterate f^n is irreducible over F, but f^n is reducible modulo all primes of F for n at least 2. We also give an example for each n of a quadratic f with integer coefficients whose iterates are all irreducible over the rationals, whose (n-1)st iterate is irreducible modulo some primes, and whose nth iterate is reducible modulo all primes. From the perspective of Galois theory, this suggests that a well-known rigidity phenomenon for linear Galois representations does not exist for Galois representations obtained by polynomial iteration. Finally, we study the number of primes P for which a given quadratic f defined over a global field has f^n irreducible modulo P for all n.

Abstract:
The theory of complete surfaces of (nonzero) constant mean curvature in $\RR^3$ has progressed markedly in the last decade. This paper surveys a number of these developments in the setting of Alexandrov embedded surfaces; the focus is on gluing constructions and moduli space theory, and the analytic techniques on which these results depend. The last section contains some new results about smoothing the moduli space and about CMC surfaces in asymptotically Euclidean manifolds.

Abstract:
We consider integer recurrences of the form a_n = f(a_{n-1}), where f is a quadratic polynomial with integer coefficients. We show, for four infinite families of f, that the set of primes dividing at least one term of such a sequence must have density zero, regardless of choice of a_0. The proof relies on tools from group theory and probability theory to develop a zero-density criterion in terms of arithmetic properties of the forward orbit of the critical point of f. This provides an analogy to results in real and complex dynamics, where analytic properties of the forward orbit of the critical point determine many global dynamical properties of f. The article also includes apparently new work on the irreducibility of iterates of quadratic polynomials.

Abstract:
The iterated monodromy group of a post-critically finite complex polynomial of degree d \geq 2 acts naturally on the complete d-ary rooted tree T of preimages of a generic point. This group, as well as its pro-finite completion, act on the boundary of T, which is given by extending the branches to their "ends" at infinity. We show that for nearly all polynomials, elements that have fixed points on the boundary are rare, in that they belong to a set of Haar measure zero. The exceptions are those polynomials linearly conjugate to multiples of Chebyshev polynomials and a case that remains unresolved, where the polynomial has a non-critical fixed point with many critical pre-images. The proof involves a study of the finite automaton giving the action of generators of the iterated monodromy group, and an application of a martingale convergence theorem. Our result is motivated in part by applications to arithmetic dynamics, where iterated monodromy groups furnish the "geometric part" of certain Galois extensions encoding information about densities of dynamically interesting sets of prime ideals.

Abstract:
Given a global field K and a rational function phi defined over K, one may take pre-images of 0 under successive iterates of phi, and thus obtain an infinite rooted tree T by assigning edges according to the action of phi. The absolute Galois group of K acts on T by tree automorphisms, giving a subgroup G(phi) of the group Aut(T) of all tree automorphisms. Beginning in the 1980s with work of Odoni, and developing especially over the past decade, a significant body of work has emerged on the size and structure of this Galois representation. These inquiries arose in part because knowledge of G(phi) allows one to prove density results on the set of primes of K that divide at least one element of a given orbit of phi. Following an overview of the history of the subject and two of its fundamental questions, we survey cases where G(phi) is known to have finite index in Aut(T). While it is tempting to conjecture that such behavior should hold in general, we exhibit four classes of rational functions where it does not, illustrating the difficulties in formulating the proper conjecture. Fortunately, one can achieve the aforementioned density results with comparatively little information about G(phi), thanks in part to a surprising application of probability theory. Underlying all of this analysis are results on the factorization into irreducibles of the numerators of iterates of phi, which we survey briefly. We find that for each of these matters, the arithmetic of the forward orbits of the critical points of phi proves decisive, just as the topology of these orbits is decisive in complex dynamics.

Abstract:
This paper examines a composite implication of human
capital theory and knowledge-based economy literature with regard to export
performance of Iranian industries. It is expected that education particularly
in higher levels contributes to the expansion of export. This is the hypothesis
that is tested by underlying the Branson’s export function and using a panel
data of industries with two-digit codes in 2003-2013. Results show that
education only in MA (MS) and PhD levels has positive and significant effect on
export but lower levels of education have no effect. The coefficients indicate
that a 1 percent increase in completion of MA (MS) and PhD degrees will
increase the export of industry by 0.18 (0.15) percent respectively. It seems
that education contributes to export in higher levels but has no important role
in lower levels. It is indicated that the results are somewhat in contrast to
filter theory proposed by Arrow (1973).