1,720,962 research outputs found
Silicon 5 Code Generator
No full textThe goal of the project was to extend an already existing code generator that automatically generates web applications. The company Fenêtre develops complex web solutions with their in-house developed framework, called the Silicon Framework. The code generator generates basic functionality and a user interface for database maintenance screens, like view-, create-, edit-, list- and list-edit screens. This saves a lot of time for the developers of Fenêtre, because these screens are always required for new web applications. These screens, however, were not enough and that iswhy the generator needs to be extended. Sometimes, database changes are made after a web application has already been generated. Manual appending of new code is required at many different places in the application which is a very time-consuming and error-prone process. Automatically generating this new code at the right places in an existing project is a challenge, but favours the developer enormously. Additionally, in many cases representing the relations data alone, is not enough to get a good overview of the data in the interface of a database maintenance application. For example, a category table could have a relationship with the products table in a database. It would make a lot of sense that in a database maintenance screen, a category can be viewed with all of its products on the same screen and maybe edit products immediately. The challenge here is that automatic generation of code for this kind of relationships requires a lot of information to correctly represent this information in the user interface. The final product is a fully functional code generator that is able to generate screens which represent relations and its relationships data in an intuitive way. In addition, the generator also automatically appends screens, relationships screens and database changes to an existing project. Along theway, other compatibility issues were fixed with the always improving Silicon framework. Remaining possibilities and wishes are listed in the recommendation chapter. Finally, the code generator will be extended even more in the future while the advantages are becoming clearer.Electrical Engineering, Mathematics and Computer ScienceSoftware TechnologyTI380
Widget Dashboard
No full textDuring the ten week project the implementation of a Widget Dashboard was made for the company Fenêtre. Fenêtre is a company that provides online solutions like web applications and consultancy. The dashboard displays different existing pages in the form of widgets which are freely movable and resizable by the user of the dashboard and give the user a high level of personalization. The Dashboard is made using the Gridstack framework. This framework provides the functionality to move and resize the widgets. The choice made on using this framework took place in a three week research phase at the start of the project, where multiple different dashboard frameworks and examples were investigated. Gridstack was chosen because it gave the most freedom in implementing the dashboard around the existing features. Other frameworks gave too much of a restriction on implementation. To make sure that an unauthorized user cannot view confidential content the existing authentication of Fenêtre is used to only load widgets that meet the rights of the user. During the development stage of the project, scrum was used to organise the project team. Using the scrum methodology made it easier to recognize the different tasks which needed to be done. However, since the product team consisted of 2 people scrum made things sometimes more tedious than it has to be. During the development phase of the project we have learned a lot about working in an company environment, the importance of a good planning and asking questions early to get a complete overview of what needs to be done during the project.Electrical Engineering, Mathematics and Computer ScienceSoftware Technolog
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Get PDF“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Get PDFWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Route Recommendation Engine: Relive your outdoor adventures
No full textThis report describes the Bachelor End Project, a compulsory course for the Bachelor Computer Science at Delft University of Technology. This course has a group of 4 students complete a project for a real-world company (the client). The client for this project was Relive, a company that has a tracker for outdoor activities with a focus on the experience of the activity. They wanted a route recommendation engine for their users, in particular users that are unfamiliar with the area. The specific task from Relive was to use the Relive database to find popular, dissimilar routes to recommend within an area, and then find context for those recommended routes. The first attempt to find these routes was using a heatmap to see which routes were popular, and then clustering routes to find dissimilar routes to recommend. This had some problems with unwanted biases towards cities, so the second attempt switched it around by first clustering on general area to make sure recommendations are dissimilar, and then using clustering and finding big clusters to see which routes are popular. This last approach worked decently: it can recommend 73% of the expected routes. One of the key problems for now is the long waiting times. There were two kinds of context that were considered: keywords and photos. Keywords can be extracted by processing titles from nearby routes with significant search. Photos are added to routes by the users but may not be relevant as context. Examples of such useless photos are selfies, which also bring privacy concerns. Due to time constraints, giving context was not integrated into the final product. The final product is a web application client and a server for that client. The users interact with the web application, and the recommendation algorithm is run on the server.Computer Scienc
Dispelling the Myths Behind First-author Citation Counts
Get PDFWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
Bi-VAKs: Bi-Temporal Versioning Approach for Knowledge Graphs
No full textOver time Linked Data collections are continuously subject to change because of numerous reasons. Users could insert new observations, or they could rectify erroneous statements in these knowledge graphs. In order not to lose historically import information, this trend of evolving Linked Data collections increases the need to version these collections. Furthermore, retrieving prior versions and their in-between changes could provide Linked Data users relevant information. However, for some changes to these collections we should record both their transaction time and their valid time. To address these two problems of versioning Linked Data collections and having bi-temporal changes, we introduce the Bi-Temporal Versioning Approach for Knowledge graphs (Bi-VAKs): a prototypical bi-temporal change-based Version Control System for an arbitrary RDF dataset. Bi-VAKs registers both the transaction time and the valid time of a set of modified quads, and therefore, it allows for coupled historical and retrospective SPARQL queries. In addition, in order to enhance collaboration between its users Bi-VAKs also keeps track on provenance data; it supports diverged states; and provide a standard data access interface. However, since the standard RDF data model is atemporal, defining such a set of modifications (update) in RDF poses difficult challenges. Firstly, to indicate this transaction time and the valid time of an update Bi-VAKs divides a revision or version into a transaction revision and a valid revision. And hence it directly separates the metadata from the actual data. Secondly, to denote and retrieve the modified triples/quads within a update Bi-VAKs uses RDF-star and SPARQL-star. In order to connect these revisions we develop three reference strategies: the explicit, the implicit, and the combined reference strategy. These strategies let a transaction revision either refer explicitly to its corresponding valid revision(s) or implicitly by the same revision number and branch index. Based on these strategies we initiate some different approaches to query the updates from the revision-store. And, we propose some different methods to construct a (prior) version. However, to evaluate these different design decision we cannot use the existing uni-temporal benchmarks for our bi-temporal versioning approach. Therefore, we expand the BEAR benchmark to a bi-temporal benchmark (Bi-BEAR). By means of this benchmark we demonstrate that all three reference strategies have about the same storage size. We notice that the usage of a snapshot and retrieval of all updates worsen the version materialisation (VM), delta materialisation (DM), and version (VQ) query performance. In addition, the VM query look up time considerably decreases if only the matching updates are queried. And modified updates, branches, and more updates in the revision-store slightly lower the VM, DM, and VQ query performance. In addition, for the implicit and combined reference strategy the query time is rather the same, and sometimes even better if we sort the updates instead of aggregating them directly. Overall, the implicit reference strategy is performing best, and is quickly followed by the combined reference strategy.Computer Science | Data Science and Technolog
- …
