DSpace Community: Faculty of Mathematics and InformaticsFaculty of Mathematics and Informaticshttp://hdl.handle.net/10506/62024-02-24T00:23:30Z2024-02-24T00:23:30ZWild Programming – One Unintended Experiment with Inquiry Based LearningBoytchev, Pavelhttp://hdl.handle.net/10506/23652019-10-29T09:15:39Z2011-10-01T00:00:00ZTitle: Wild Programming – One Unintended Experiment with Inquiry Based Learning
Authors: Boytchev, Pavel
Abstract: This paper describes one unplanned experiment of a 6th grade student writing her first computer program for 3D graphics before learning any programming language. Some intriguing aspects in her program are analyzed, especially the emerging understanding of key concepts like enumeration, naming conventions of variables and symmetry in 3D space. The paper also identifies two main directions of mental processes. The first direction is actively supported by the school. It is based on presenting and using knowledge in a distilled error-free way. The other direction encompasses techniques needed to identify wrong solutions and to find a way to overcome problems and reach a correct solution. This direction in underrepresented in the educational system and as a result, it is left uncultivated. Students are expected to develop such skills by themselves.2011-10-01T00:00:00ZDescription Logic with part restrictions: PSPACE-complete expressivenessYanchev, Mitkohttp://hdl.handle.net/10506/13572015-07-21T07:56:18Z2014-01-01T00:00:00ZTitle: Description Logic with part restrictions: PSPACE-complete expressiveness
Authors: Yanchev, Mitko
Abstract: In this paper syntactic objects-concept constructors, called part restrictions-are considered in Description Logics (DLs). Being able to convey statements about a part of a set of successors, part restrictions essentially enrich the expressive capabilities of DLs. An extension of DL ALCQR with part restrictions is examined, and its PSPACE completeness is proven, what shows that the new expressiveness brings no extra cost to the complexity of reasoning in ALCQR. The proof uses completion calculus based on tableaux technique.
Description: Presented at CiE2014 as contributed talk.2014-01-01T00:00:00ZDSpace courseTodorov, Toshkohttp://hdl.handle.net/10506/13562015-07-21T07:52:07Z2015-07-21T00:00:00ZTitle: DSpace course
Authors: Todorov, Toshko2015-07-21T00:00:00ZRecommendations in social networks: an extra feature or an essential needChechev, MilenIvan, Koychevhttp://hdl.handle.net/10506/12132014-08-04T23:00:07Z2014-08-04T00:00:00ZTitle: Recommendations in social networks: an extra feature or an essential need
Authors: Chechev, Milen; Ivan, Koychev
Abstract: This paper analyzes user’s need of content recommendation at the social network Facebook. It presents results from a survey on real social net-work’s users. The results shows that Facebook users need better interface for news feed browsing. It have to provide better information filtering options, rec-ommendation system and options for manual refinement of the results from it. The collected information from the survey is used to determine features which an application has to provide as social network news feed browser and to re-ceive user’s trust. Further some implementation details and faced difficulties are presented.2014-08-04T00:00:00Z