Parallel Continuous Optimization and Distributed Mathematical Collaboration
Notice bibliographique
Résumé
This report presents work on a variety of projects related to two separate areas: Part I discusses parallel direct-search optimization algorithms, and Part II involves remote mathematical collaboration. The common thread connecting the projects in these two areas is the development within the past decade of shared computing networks, such as WestGrid in Western Canada and ACEnet in Atlantic Canada, where extensive grid-computing resources are shared between multiple academic institutions. With these networks, different academic institutions are connected more quickly, creating the possibility of bringing together more researchers and allowing for easier distributed research. However, as with any increase in access to resources and information, issues arise relating to managing this increase: different projects are competing for computing resources, and a larger distributed research network can paradoxically make it more difficult to manage research relationships by increasing the pool of potential research collaborators. Part I describes a parallel implementation of a direct-search method that is designed for use on a small number of processors, for situations where limiting the number of computing resources requested will yield a higher priority placement within the job queue. We first describe an approach to load balancing by using a particular method of partitioning the set of search directions using objects from graph decomposition and graph factorization. We then present a new algorithm which uses this partitioning of the problem into independent subproblems, with local curvature information from within each subproblem used to re-align the search directions. We also consider direct-search and evolutionary strategies, comparing these two classes of methods on several standard test problems and discussing where each of these two communities can learn lessons from the other. Part II describes three projects, designed around aiding the communication of mathematical research in an increasingly distributed research community. The first involves the Federated World Directory of Mathematicians (FWDM), an online directory of mathematical researchers designed without a database in order to conform to a wide variety of international regulations regarding the collection and use of personal data. The second project discusses the process of retro-enhancement of existing mathematical literature, in which we describe the process of adding functionality to a mathematical text given a pre-existing source file, as opposed to the standard retrodigitization approach in which the source file is created from the printed document. Finally, the third project involves the C2C seminar, a cross-country seminar designed both to highlight ongoing research at one institution to the national research community, as well as to promote the computing and communication resources available on the shared computing networks involved.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».