[Pulp-dev] Theme of the bachelor thesis

Milan Kovacik mkovacik at redhat.com
Fri Sep 21 06:46:12 UTC 2018

On Thu, Sep 20, 2018 at 3:53 PM Dana Walker <dawalker at redhat.com> wrote:

> This sounds interesting, and a good way to explore the branching model
> suggestions in the referenced tickets
yes, that's one of the goals indeed

> I look forward to reading your thesis Vlada!
> --Dana
> Dana Walker
> Associate Software Engineer
> Red Hat
> <https://www.redhat.com>
> <https://red.ht/sig>
> On Thu, Sep 20, 2018 at 9:41 AM, Milan Kovacik <mkovacik at redhat.com>
> wrote:
>> Folks,
>> we've been discussing my proposal with Vlada recently and he's about to
>> commit officially to it at the school.
>> I'd like to poke for feedback esp. if there are concerns/doubts about the
>> sanity of my proposal.
>> Encouraging comments are of course welcome too ;)
>> Cheers,
>> milan
>> On Mon, Sep 10, 2018 at 11:25 AM Milan Kovacik <mkovacik at redhat.com>
>> wrote:
>>> Hi,
>>> I'd like to propose a comparison of Git versioning model to Pulp3
>>> versioning (and branching) model.
>>> The textual part would briefly introduce both Git and Pulp, with focus
>>> on their respective usecases, trying to identify overlapping scenarios.
>>> Next it would in detail examine the versioning models of both Git and
>>> Pulp3.
>>> The main matter would compare implementation of Git versioning model in
>>> Pulp3 (as e.g a fork) to the current versioning model.
>>> The textual part would conclude with advantages and disadvantages of
>>> both versioning models, reiterating over the usecases, comparing
>>> performance (storage and time) of both the implementations.
>>> I believe this would have a direct practical impact on Pulp3, affecting
>>> feature planning and if feasible, providing an alternative versioning
>>> implementation[1][2].
>>> --
>>> milan
>>> PS: I'm volunteering to oversee the thesis on the project part
>>> [1] https://pulp.plan.io/issues/3360
>>> [2] https://pulp.plan.io/issues/3842
>>> On Wed, Sep 5, 2018 at 9:16 PM, Austin Macdonald <austin at redhat.com>
>>> wrote:
>>>> How about reproducibility? Bihan and I presented on this topic at scipy
>>>> but there is a lot left to say/research.
>>>> https://www.youtube.com/watch?v=5czGgUG0oXA
>>>> In the scientific community, reproducibility is a hot topic (I bet grad
>>>> schools would love this!), and the computational aspect of it has been
>>>> under-emphasized in the existing literature. Our talk focused on the
>>>> fundamental problems of environmental reproducibility and how to use Pulp
>>>> to solve them. Especially since the scope was narrow, we barely scratched
>>>> the surface. There a ton of potential angles; some ideas are that you could
>>>> catalog and compare technologies or discuss academic vs industry use cases
>>>> and trends.
>>>> On Wed, Sep 5, 2018 at 5:01 AM Vladimir Dusek <vdusek at redhat.com>
>>>> wrote:
>>>>> I don't ask you for a specific assignment, we'll set up it with Milan
>>>>> later. I only need some idea on a topic.
>>>>> Scope of the work should be 40-50 standard pages. Additional
>>>>> istructions could be find here -
>>>>> http://www.fit.vutbr.cz/info/szz/pokyny_bp.php.en#pozadavky. However
>>>>> I don't think it's neccessary for you to know them.
>>>>> All bachelor theses from our university last year could be find here -
>>>>> http://www.fit.vutbr.cz/study/DP/BP.php.en. I presume most of them
>>>>> are written in Czech but there are abstracts in English which might be
>>>>> useful for inspiration.
>>>>> Random abstracts:
>>>>> Alias Analysis in C Compiler
>>>>> -------------------------------------
>>>>> This thesis is dedicated to the problem of alias analysis and
>>>>> possibilities of its improvement in the LLVM framework. The goal of this
>>>>> thesis is to improve the accuracy, which was achieved by extending the
>>>>> existing implementation of Andresen algorithm to be field sensitive. The
>>>>> terms related to alias analysis and algorithms of the alias analysis
>>>>> available in LLVM are explained. These algorithms are compared according to
>>>>> their base idea, features, and limitations. The implementation of the field
>>>>> sensitivity has been tested using compiler test suites. Its impact on
>>>>> program compilation speed and performance has been analyzed. The measured
>>>>> results show an increase in the accuracy of alias analysis in the LLVM
>>>>> framework.
>>>>> Reinforcement Learning for Starcraft Game Playing
>>>>> --------------------------------------------------------------------
>>>>> This work focuses on methods of machine learning for playing real-time
>>>>> strategy games. The thesis applies mainly methods of Q-learning based on
>>>>> reinforcement learning. The practical part of this work is implementing an
>>>>> agent for playing Starcraft II. Mine solution is based on 4 simple
>>>>> networks, that are colaborating together. Each of the network also teaches
>>>>> itself how to process all given actions optimally. Analysis of the system
>>>>> is based on experiments and statistics from played games.
>>>>> On Tue, Sep 4, 2018 at 8:27 PM Robin Chan <rchan at redhat.com> wrote:
>>>>>> Hi Vladimir,
>>>>>> I'm not familiar with what types of topics are appropriate for this
>>>>>> type of project - could you share some criteria and examples of what makes
>>>>>> a good topic?
>>>>>> Robin
>>>>>> On Mon, Sep 3, 2018 at 8:50 AM, Vladimir Dusek <vdusek at redhat.com>
>>>>>> wrote:
>>>>>>> Hi team,
>>>>>>> since September I'm in the third grade of bachelor studies and it
>>>>>>> means that I'm going to write a bachelor thesis. I haven't selected a topic
>>>>>>> yet and if it'll be possible I'd like to work on something that is relevant
>>>>>>> to Pulp. Do you have any idea?
>>>>>>> Thank you guys,
>>>>>>> Vlada
>>>>>>> _______________________________________________
>>>>>>> Pulp-dev mailing list
>>>>>>> Pulp-dev at redhat.com
>>>>>>> https://www.redhat.com/mailman/listinfo/pulp-dev
>>>>>> _______________________________________________
>>>>> Pulp-dev mailing list
>>>>> Pulp-dev at redhat.com
>>>>> https://www.redhat.com/mailman/listinfo/pulp-dev
>>>> _______________________________________________
>>>> Pulp-dev mailing list
>>>> Pulp-dev at redhat.com
>>>> https://www.redhat.com/mailman/listinfo/pulp-dev
>> _______________________________________________
>> Pulp-dev mailing list
>> Pulp-dev at redhat.com
>> https://www.redhat.com/mailman/listinfo/pulp-dev
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://listman.redhat.com/archives/pulp-dev/attachments/20180921/d892dc4f/attachment.htm>

More information about the Pulp-dev mailing list