Équations différentielles issues des vecteurs singuliers des représentations de l'algèbre de Virasoro

Mémoire numérisé par la Division de la gestion de documents et des archives de l'Université de Montréal

Polynômes de Kazhdan-Lusztig et cohomologie d'intersection des variétés de drapeaux

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

Polynômes de Kazhdan-Lusztig et cohomologie d'intersection des variétés de drapeaux

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

Virasoro Action on Imaginary Verma Modules and the Operator Form of the KZ-Equation

We define the Virasoro algebra action on imaginary Verma modules for affine and construct an analogue of the Knizhnik-Zamolodchikov equation in the operator form. Both these results are based on a realization of imaginary Verma modules in terms of sums of partial differential operators.

Mixed multiplicities and the minimal number of generator of modules

Let (R, m) be a d-dimensional Noetherian local ring. In this work we prove that the mixed Buchsbaum-Rim multiplicity for a finite family of R-submodules of R(p) of finite colength coincides with the Buchsbaum-Rim multiplicity of the module generated by a suitable superficial sequence, that is, we generalize for modules the well-known Risler-Teissier theorem. As a consequence, we give a new proof of a generalization for modules of the fundamental Rees` mixed Multiplicity theorem, which was first proved by Kirby and Rees in (1994, [8]). We use the above result to give an upper bound for the minimal number of generators of a finite colength R-submodule of R(p) in terms of mixed multiplicities for modules, which generalize a similar bound obtained by Cruz and Verma in (2000, [5]) for m-primary ideals. (C) 2009 Elsevier B.V. All rights reserved.

Enhancing pathways for ACE learners : Building the capacity of Adult and Community Education (ACE) providers to offer non-accredited courses and VET modules with pathways into VET programs.

This report presents findings from a project that considered a) the current capacity of Adult and Community Education (ACE) providers to offer non-accredited courses and single modules of accredited learning that provide pathways into full scale accredited VET programs, and b) the factors that aid and inhibit this from occurring. Based on the findings, suggestions are made as to what needs to be done to extend this capacity and thereby to achieve the goals outlined in the 2008 Ministerial Declaration on Adult Community Education.

Realisation of ternary sigma-delta modulated arithmetic processing modules

Sigma-delta modulated systems have a number of very appealing properties and are, therefore, heavily used in analog to digital converters, amplifiers, and modulators. This paper presents new results which indicate that they may also have significant potential for general purpose arithmetic processing.

Evaluation of an intervention to promote protective infant feeding practices to prevent childhood obesity : outcomes of the NOURISH RCT at 14 months of age and 6 months post the first of two intervention modules

OBJECTIVE: To evaluate a universal obesity prevention intervention, which commenced at infant age 4-6 months, using outcome data assessed 6-months after completion of the first of two intervention modules and 9 months from baseline. DESIGN: Randomised controlled trial of a community-based early feeding intervention. SUBJECTS AND METHODS: 698 first-time mothers (mean age 30±5 years) with healthy term infants (51% male) aged 4.3±1.0 months at baseline. Mothers and infants were randomly allocated to self-directed access to usual care or to attend two group education modules, each delivered over three months, that provided anticipatory guidance on early feeding practices. Outcome data reported here were assessed at infant age 13.7±1.3 months. Anthropometrics were expressed as z-scores (WHO reference). Rapid weight gain was defined as change in weight-for-age z-score (WAZ) > +0.67. Maternal feeding practices were assessed via self-administered questionnaire. RESULTS: There were no differences according to group allocation on key maternal and infant characteristics. At follow up (n=598 [86%]) the intervention group infants had lower BMIZ (0.42±0.85 vs 0.23±0.93, p=0.009) and infants in the control group were more likely to show rapid weight gain from baseline to follow up (OR=1.5 CI95%1.1-2.1, p=0.014). Mothers in the control group were more likely to report using non- responsive feeding practices that fail to respond to infant satiety cues such as encouraging eating by using food as a reward (15% vs 4%, p=0.001) or using games ( 67% vs 29%, p<0.001). CONCLUSIONS: These results provide early evidence that anticipatory guidance targeting the ‘when, what and how’ of solid feeding can be effective in changing maternal feeding practices and, at least in the short term, reducing anthropometric indicators of childhood obesity risk. Analyses of outcomes at later ages are required to determine if these promising effects can be sustained.

Cascaded DC-DC converter connection of photovoltaic modules

New residential scale photovoltaic (PV) arrays are commonly connected to the grid by a single dc-ac inverter connected to a series string of pv panels, or many small dc-ac inverters which connect one or two panels directly to the ac grid. This paper proposes an alternative topology of nonisolated per-panel dc-dc converters connected in series to create a high voltage string connected to a simplified dc-ac inverter. This offers the advantages of a "converter-per-panel" approach without the cost or efficiency penalties of individual dc-ac grid connected inverters. Buck, boost, buck-boost, and Cu´k converters are considered as possible dc-dc converters that can be cascaded. Matlab simulations are used to compare the efficiency of each topology as well as evaluating the benefits of increasing cost and complexity. The buck and then boost converters are shown to be the most efficient topologies for a given cost, with the buck best suited for long strings and the boost for short strings. While flexible in voltage ranges, buck-boost, and Cu´k converters are always at an efficiency or alternatively cost disadvantage.

Cascaded DC-DC converter connection of photovoltaic modules

New residential scale photovoltaic (PV) arrays are commonly connected to the grid by a single DC-AC inverter connected to a series string of PV modules, or many small DC-AC inverters which connect one or two modules directly to the AC grid. This paper shows that a "converter-per-module" approach offers many advantages including individual module maximum power point tracking, which gives great flexibility in module layout, replacement, and insensitivity to shading; better protection of PV sources, and redundancy in the case of source or converter failure; easier and safer installation and maintenance; and better data gathering. Simple nonisolated per-module DC-DC converters can be series connected to create a high voltage string connected to a simplified DC-AC inverter. These advantages are available without the cost or efficiency penalties of individual DC-AC grid connected inverters. Buck, boost, buck-boost and Cuk converters are possible cascadable converters. The boost converter is best if a significant step up is required, such as with a short string of 12 PV modules. A string of buck converters requires many more modules, but can always deliver any combination of module power. The buck converter is the most efficient topology for a given cost. While flexible in voltage ranges, buck-boost and Cuk converters are always at an efficiency or alternatively cost disadvantage

Predicting fault-prone software modules with rank sum classification

The detection and correction of defects remains among the most time consuming and expensive aspects of software development. Extensive automated testing and code inspections may mitigate their effect, but some code fragments are necessarily more likely to be faulty than others, and automated identification of fault prone modules helps to focus testing and inspections, thus limiting wasted effort and potentially improving detection rates. However, software metrics data is often extremely noisy, with enormous imbalances in the size of the positive and negative classes. In this work, we present a new approach to predictive modelling of fault proneness in software modules, introducing a new feature representation to overcome some of these issues. This rank sum representation offers improved or at worst comparable performance to earlier approaches for standard data sets, and readily allows the user to choose an appropriate trade-off between precision and recall to optimise inspection effort to suit different testing environments. The method is evaluated using the NASA Metrics Data Program (MDP) data sets, and performance is compared with existing studies based on the Support Vector Machine (SVM) and Naïve Bayes (NB) Classifiers, and with our own comprehensive evaluation of these methods.

Privacy enhancements for hardware-based security modules

The increasing growth in the use of Hardware Security Modules (HSMs) towards identification and authentication of a security endpoint have raised numerous privacy and security concerns. HSMs have the ability to tie a system or an object, along with its users to the physical world. However, this enables tracking of the user and/or an object associated with the HSM. Current systems do not adequately address the privacy needs and as such are susceptible to various attacks. In this work, we analyse various security and privacy concerns that arise when deploying such hardware security modules and propose a system that allow users to create pseudonyms from a trusted master public-secret key pair. The proposed system is based on the intractability of factoring and finding square roots of a quadratic residue modulo a composite number, where the composite number is a product of two large primes. Along with the standard notion of protecting privacy of an user, the proposed system offers colligation between seemingly independent pseudonyms. This new property when combined with HSMs that store the master secret key is extremely beneficial to a user, as it offers a convenient way to generate a large number of pseudonyms using relatively small storage requirements.

Design and fabrication of linear pixel arrays for organic photovoltaic modules to achieve scalable power output

We describe a design and fabrication method to enable simpler manufacturing of more efficient organic solar cell modules using a modified flat panel deposition technique. Many mini-cell pixels are individually connected to each other in parallel forming a macro-scale solar cell array. The pixel size of each array is optimized through experimentation to maximize the efficiency of the whole array. We demonstrate that integrated organic solar cell modules with a scalable current output can be fabricated in this fashion and can also be connected in series to generate a scalable voltage output.

A study of placement algorithms through trial interchange of logic modules

Based on trial interchanges, this paper develops three algorithms for the solution of the placement problem of logic modules in a circuit. A significant decrease in the computation time of such placement algorithms can be achieved by restricting the trial interchanges to only a subset of all the modules in a circuit. The three algorithms are simulated on a DEC 1090 system in Pascal and the performance of these algorithms in terms of total wirelength and computation time is compared with the results obtained by Steinberg, for the 34-module backboard wiring problem. Performance analysis of the first two algorithms reveals that algorithms based on pairwise trial interchanges (2 interchanges) achieve a desired placement faster than the algorithms based on trial N interchanges. The first two algorithms do not perform better than Steinberg's algorithm1, whereas the third algorithm based on trial pairwise interchange among unconnected pairs of modules (UPM) and connected pairs of modules (CPM) performs better than Steinberg's algorithm, both in terms of total wirelength (TWL) and computation time.