Master of Science / Department of Computing and Information Sciences / William H. Hsu / Entity search has been proposed as a search method for domain-specific Internet applications. It differs from the classical approaches used by search engines which give a "page-view result": listing the URLs of web pages containing the desired keywords. Entity search returns more structured results listing the specific information that a user seeks, such as an email address or a phone number. It not only provides the URL links to targets, but also attributes of target entities (e.g., email address, phone number, etc.). Compared to classical search methods, entity search is a more direct and user-friendly method for searching through a large volume of web documents. After the user submits a query, the extracted entities are ordered by their relevance to the query. While previous work has proposed various complex formulas for entity ranking, it has not been shown whether such complexity is needed. In this research I explore the problem of whether a simpler method can achieve reasonable results. I have designed an entity-search and ranking algorithm using a formula that simply combines a page’s PageRank and an entity's distance to the query keywords to produce a metric for ranking discovered entities. My research goal is to answer the question of whether effective entity ranking can be performed by an algorithm that computes matching scores specific to the entity search domain, and what improvements are necessary to refine the result. My approach takes into account the entity's proximity to the keywords in the query as well as the quality of the page where it is contained. I implemented a system based on the algorithm and perform experiments to show that in most cases the result is consistent with the user's desired outcome.

As the volume of data on the Web or in databases increases, data integration is becoming more expensive and challenging than ever before. One of the challenges is entity resolution when integrating data from different sources. References with different representations but referring to the same underlying entity need to be resolved. And, references with similar descriptions but referring to different entities need to be distinguished from one another. Correctly de-duplicating and disambiguating these entities is an essential task in preparing high quality data. Traditional approaches mainly focus on the attribute similarity of references, but they do not always work for datasets with insufficient information. However, in relational datasets like social networks, references are always associated with one or more relationships and these relationships can provide additional information for identifying duplicates. In this thesis, we solve the entity resolution problem by using relationships in the relational datasets. We implement a relational entity resolution algorithm to resolve entities based on an existing algorithm, greatly improving its efficiency and performance. Also, we generalize the single-type entity resolution algorithm to a multi-type entity resolution algorithm for applications that require to resolve multiple types of reference simultaneously and demonstrate its advantage over the single-type entity resolution algorithm. To improve the efficiency of the entity resolution process, we implement two blocking approaches to reduce the number of redundant comparisons performed by other methods. In addition, we implement a disk-based clustering algorithm that addresses the scalability problem, and apply it on a large academic social network dataset.

No description available.

Title: Dynamic Maintenance of Entities Author: Jiří Mizera Department: The Department of Software Engineering Supervisor: doc. Ing. Karel Richta CSc. Supervisor's e-mail address: richta@ksi.mff.cuni.cz Abstract: The aim of my master thesis is to create a tool for dynamical administration of entities and modules. Common application consists of modules operating with certain data. The user experience shows the need of changing the data structure or changing and adding the modules. Propose a solution which enables such dynamical administration and demonstrate it on the prototype. This system should generate fields for inputing, editing or deleting new entries automatically, also including control of individual attributes. At the same time the system considers also losing saved data and the possibility of data transformation to the new version of the system. Keywords: entity, maintenance, module, data

The Australian tax policy of assessing trusts and their beneficiaries has been buffeted by changes that have occurred over the last 10 years or so, chiefly in the rules that equity has adopted and applied in its restatement of the rights and interests that a beneficiary has in a trust. Broadly, the scheme of div 6 of Part III of the Income Tax Assessment Act 1936 ?? the general provisions for assessing trustees and beneficiaries ?? has remained largely unaltered, its machinery has now become ill-suited to equity??s new jurisprudence concerning beneficiaries' interests in trusts. This thesis examines the rules that seek to identify in a beneficiary an interest that she or he has in a trust??s subject matter, and it questions whether the tax legislation is still adequate to work its policies in the light of changes in the rules of equity. Most pressing amongst them is the concept of present entitlement to income as a criterion for assessing beneficiaries of trusts on incomes derived by their trustees ?? at least before the income is physically paid or dealt with by the trustees so that there is some actual or constructive receipt by the beneficiary of that income. In addition to this, the thesis points to other difficulties that have arisen ?? largely because of changing jurisprudence ?? that portend the unworkability of the current tax policy. The proposition is that the only way to correct the present and forthcoming problems, and the tensions they will cause in the Australian tax system, is to abandon the conventional policy of seeking primarily to assess a beneficiary on a mere present entitlement, and instead to assess tax on physical distributions. Under this proposition, a beneficiary will no longer be assessed on anticipated distributions: she or he will now be assessed only on those distributions that are actually made thereto. Naturally enough, a number of other trust assessing issues are affected by the proposal, and the changes to them ?? largely in a way that makes them simpler ?? are proposed and submitted.

The Australian tax policy of assessing trusts and their beneficiaries has been buffeted by changes that have occurred over the last 10 years or so, chiefly in the rules that equity has adopted and applied in its restatement of the rights and interests that a beneficiary has in a trust. Broadly, the scheme of div 6 of Part III of the Income Tax Assessment Act 1936 ?? the general provisions for assessing trustees and beneficiaries ?? has remained largely unaltered, its machinery has now become ill-suited to equity??s new jurisprudence concerning beneficiaries' interests in trusts. This thesis examines the rules that seek to identify in a beneficiary an interest that she or he has in a trust??s subject matter, and it questions whether the tax legislation is still adequate to work its policies in the light of changes in the rules of equity. Most pressing amongst them is the concept of present entitlement to income as a criterion for assessing beneficiaries of trusts on incomes derived by their trustees ?? at least before the income is physically paid or dealt with by the trustees so that there is some actual or constructive receipt by the beneficiary of that income. In addition to this, the thesis points to other difficulties that have arisen ?? largely because of changing jurisprudence ?? that portend the unworkability of the current tax policy. The proposition is that the only way to correct the present and forthcoming problems, and the tensions they will cause in the Australian tax system, is to abandon the conventional policy of seeking primarily to assess a beneficiary on a mere present entitlement, and instead to assess tax on physical distributions. Under this proposition, a beneficiary will no longer be assessed on anticipated distributions: she or he will now be assessed only on those distributions that are actually made thereto. Naturally enough, a number of other trust assessing issues are affected by the proposal, and the changes to them ?? largely in a way that makes them simpler ?? are proposed and submitted.

The entity component system architecture (ECSA) is a data-oriented composition pattern and a data-driven design pattern. Data-oriented software takes into consideration generalized knowledge of hardware. Data-driven design is a methodology used to replace inflexible code with reusable components that can be added, deleted, or modified in interactive systems and games. This thesis explores the ECSA and its alternatives and their strengths and weaknesses. The paper details the creation of an ECSA and benchmarks its performance against object-oriented architectures. The hypothesis of this thesis is that the ECSA has CPU cache performance advantages over object-oriented architectures as tested by multiple benchmarks. The results suggest that the ECSA provides superior CPU performance. These results could be valuable for interactive game developers to get higher frame rates out of their games, MMORPG server developers to process millions of entities per second, and mobile developers to create battery-efficient apps.

Information Retrieval, as a field, has long subscribed to an orthodox evaluation approach known as the Cranfield paradigm. This approach and the assumptions that underpin it have been essential to building the traditional search engine infrastructure that drives today’s modern information economy. In order to build the information economy of tomorrow, however, we must be prepared to reexamine these assumptions and create new, more sophisticated standards of evaluation to match the more complex information retrieval systems on the horizon. In this thesis, we begin this introspective process and launch our own evaluation method for one of these complex IR systems, entity-relationship recommenders. We will begin building a new user model adapted to the needs of a different user experience. To support these endeavors, we will also conduct a study with a mockup of our complex system to collect real behavior data and evaluation results. By the end of this work, we shall present a new evaluative approach for one kind of entity-relationship system and point the way for other advanced systems to come.

The focus of this master thesis is to estimate the fair value of the company Autocentrum Olomouc s.r.o., new and used cars dealership, using revenue method DCF Entity. After short introduction, strategic analysis is elaborated to assess revenue potential of the company and to estimate its future market share and future revenues. Conclusions made in strategic and financial analysis, which takes place to assess financial health, will help to verify going concern necessary for choosing revenues based valuation methods. Creating of the value generators follows, what leads to preparing of the financial plan for the following years. From these plans, it will be able to calculate free cash flow, which is needed for the valuation using DCF Entity method. Final value of the company is estimated from previous analysis at the end of the thesis.

ClueMaker (CM) is a Java desktop application used for data visualisation (via graph) by subjects like insurance companies (to unravel fraud activity), Czech organisation Hlí- dač Státu (to identify connections between subjects) or many others. This application currently uses a naive way to merge entities from different data sources (matching one field by exact string match). Goal of this thesis is to analyse, create and integrate a solution to CM, which would allow for merging entities based on entity similarity, and integrate such solution into the GUI of CM. Such solution should allow the user to merge two graph entities, show user the potentially same or very similar entities and allow for a global scan of the graph for potential merges. Furthermore, this solution should make use of data relationships within CM in addition to the attributes of entities. 1