The main aim of the course advising system is to build a course recommendation path for students to help them plan courses to successfully graduate on time. The recommendation path displays the list of courses a student can take in each quarter from the first quarter after admission until the graduation quarter. The courses are filtered as per the student’s interest obtained from a questionnaire asked to the student. The business logic involves building the recommendation algorithm. Also, the application is functionality-tested end-to-end by using nightwatch.js which is built on top of node.js. Test cases are written for every module and implemented while building the application.

Thesis (MA. Agricultural Management (Animal Production)) -- University of Limpopo, 2014. / Body measurements have been used in animals to estimate body weight especially in rural areas where scales are not readily available. The study was conducted in Sekhukhune District of the Limpopo province, South Africa where the goats between the ages of 20 and 30 months were used. Body weight and four morphological traits were taken on each goat in the morning before they were released for grazing in a total of 613 indigenous goats of both sexes (62 male and 551 female). Body weight was measured in kilogram (kg) using a balance scale, hip height and shoulder height measurement (cm) were done using a graduated measuring stick and the body length and heart girth were measured in centimetre (cm) using a tape rule. Means, standard deviations (SD) and coefficients of variation (CV) of body weight and morphological traits were calculated. Pair wise correlations among body weight and morphological traits were also determined and range from 0.81-0.91 for male and 0.72-0.89 for female goats, respectively and were significant (P<0.01). The direct effect of heart girth on body weight was the strongest in both sexes (path coefficient of 0.58 and 0.62 in males and females, respectively). Body length (males) and body length and hip height (females) also positively (P<0.05) influenced body weight. The direct effects of other linear type traits on body weight in both sexes were non-significant as revealed by t-test. These traits were indirectly realized mostly via heart girth. Thus, they were removed from the final regression equations to obtain much more simplified prediction models. The optimum multiple regression equation for male goats included heart girth and body length, In female goats, however, the v variables included in the final prediction model were heart girth, body length and shoulder height. The forecast indices obtained in this study could aid in weight estimation, selection and breeding programmes

The work of this thesis focuses primarily on non-commutative algebras and actions of Hopf algebras. Specifically, we study the possible H-module algebra structures which can be imposed on path algebras of quivers, for a variety of Hopf algebras, H, and then given a possible action, classify the invariant ring. A Hopf algebra is a bialgebra (H, μ, η, ∆, ε) together with an antipode S : H → Hop which is compatible with the counit, ε, of H. A quiver is a directed graph, and the path algebra kQ of a quiver Q is a vector space where all the paths of the quiver form a basis, and multiplication is given by concatenation of paths whenever possible, and zero otherwise. In their paper, [9], Kinser and Walton classify Hopf actions of a specific family of Hopf algebras called a Taft algebras, T(n), on path algebras of loopless, finite, Schurian quivers. In this thesis, we extend their result to path algebras of any finite quiver and classify the invariant subring, kQT(n), in the case where the group like element g ∈ T(n) acts transitively on Q0. In the future, we hope that the ideas presented in this work extend to a classification of quantum groups, such as uq(sl2), acting on path algebras of finite quivers.

Engineering activities by nature are collaborative endeavors. Single-user applications like CAD, CAE, and CAM force a strictly serial design process, which ultimately lengthens time to market. New multi-user applications such as NXConnect address the issue during the design stage of the product development process by enabling users to work in parallel. Multi-user collaborative tool path planning software addresses the same serial limitations in tool path planning, thereby decreasing cost and increasing the quality of manufacturing processes. As part complexity increases, lead times are magnified by serial workflows. Multi-user tool path planning can shorten the process planning time. But, to be effective, it must be possible to intelligently decompose the manufacturing sequence and distribute path planning assignments among several users. A new method of process decomposition is developed and described in this research. A multi-user CAM (MUCAM) prototype was developed to test the method. The decomposition process and MUCAM prototype together were used to manufacture a part to verify the method.

優美圖是圖論中較有趣的研究課題。在本文中，我們將對C_n⊕S_m的圖形提供一套優美的標法。 / Graceful graph is a more interesting research problem in the graph theory. In this paper, we will give a graceful labeling to the gragh C_n⊕S_m.

<p>The reform of the European Commission has been on the EU agenda for more than three decades. The attempts to introduce an overhaul of the Commission’s institutional structure has been motivated predominantly by the fact that the efficiency of the functioning of the European Commission has been in decline. Despite the striking need to restore the Commission's efficiency, which has become even more urgent in the last decade, the attempts to improve its modus operandi have been marked by many obstacles, difficulties and delays.</p><p>This thesis aims to analyze and explain why the process of reforming the European Commission has been so problematic. In order to achieve this goal, the theoretical framework of historical institutionalism has been utilized. More precisely, we mainly build on the work of Paul Pierson, whose concepts help us understand the reasons behind the failure of a number of reform plans regarding the Commission and clarify why the institutional structure of the European Commission is characterized by a high degree of stability.</p>

The calculation of path travel times is an essential component for the dynamic traffic assignment and equilibrium problems. This paper presents a simulation method for calculating actual path travel times for the traffic network with dynamic demands. The method is based on a path-based macroscopic simulation model of network traffic dynamics. There is no need to explicitly model intersection delays in this method. Discontinuity in the travel time caused by traffic light control can be captured by this method. It's flexible in terms that the model is not limited to a specific velocity-density relationship. Some numerical results for signalized and unsignalized networks are reported. / Singapore-MIT Alliance (SMA)

Cavity balancing is the process of altering the flow front within a cavity through thickness and design changes such that the desired fill pattern is achieved. The 2 dimensional (2D) cavity-balancing algorithm, developed by Lam and Seow [1] can only handle 2D geometry. This represents a major drawback as most, if not all of the practical injected parts are not 2D parts. To overcome this difficulty, the present investigation has developed a 2.5 dimensional (2.5D) cavity balancing optimization routine implemented within a 2.5 D finite elements domain. The aim of the automated cavity balancing routine is to reduce product development time and to improve product quality. This will lower the level of prerequisite expert knowledge necessary for successful mold and part design. The automated cavity balancing routine has been developed using the concept of flow paths. The hill-climbing algorithm of Lam and Seow is utilized but modified for the generation of flow paths for 2.5D parts. The algorithm has been implemented in a computer program running as an external loop to the MOLDFLOW software. Case studies are provided to demonstrate the efficiency of this routine. / Singapore-MIT Alliance (SMA)

We describe a method called Visible Decomposition for computing collision-free paths in real time through a planar environment with a large number of obstacles. This method divides space into local visibility graphs, ensuring that all operations are local. The search time is kept low since the number of regions is proved to be small. We analyze the computational demands of the algorithm and the quality of the paths it produces. In addition, we show test results on a large simulation testbed.

Francine B.M. Zerbib and Adrian Segall. / Bibliography: p. 29. / "June, 1981." / U.S. Department of Defense contract No. N00014-75-C-1183 Office of Naval Research Contract ONR/N00014-77-C-0532