Do you want to publish a course? Click here

Experimental check of model of object innovation evaluation

55   0   0.0 ( 0 )
 Added by Vladimir Ivanov
 Publication date 2021
and research's language is English
 Authors V. K. Ivanov




Ask ChatGPT about the research

The article discusses the approach for evaluating the innovation index of the products and technologies. The evaluation results can be used to create a warehouse of the object descriptions with significant innovation potential. The model of innovation index computation is based on the concepts of novelty, relevance, and implementability of the object. Formal definitions of these indicators are given and a methodology for their calculation are described. The fuzzy methods to coprocess (incomplete) data from numerous sources and to obtain probabilistic innovation assessments are used. The experimental data of the model check including the calculations of local criteria and global additive evaluation criterion are presented. The cyclical nature of dynamic changes in indicators, their interdependence was established, some general features of the products promotion were found. The obtained experimental data are consistent with expert estimates of the products under study. The analysis of the local criteria used in the research gives grounds to assert the correct use of the additive n-dimensional utility function. The adequacy of assumptions and formal expressions that are used in computational algorithms for selection information for data warehouse is confirmed.



rate research

Read More

55 - V. K. Ivanov 2021
The paper presents the results of the experiments that were conducted to confirm the main ideas of the proposed approach to determining the objects innovativeness. This approach assumed that the product life cycle of whose descriptions are placed in different data warehouses is adequate. The proposed formal model allows us to calculate the quantitative value of the additive evaluation criterion of objects innovativeness. The obtained experimental data make it possible to evaluate the adopted approach correctness.
Computing the shortest path between two given locations in a road network is an important problem that finds applications in various map services and commercial navigation products. The state-of-the-art solutions for the problem can be divided into two categories: spatial-coherence-based methods and vertex-importance-based approaches. The two categories of techniques, however, have not been compared systematically under the same experimental framework, as they were developed from two independent lines of research that do not refer to each other. This renders it difficult for a practitioner to decide which technique should be adopted for a specific application. Furthermore, the experimental evaluation of the existing techniques, as presented in previous work, falls short in several aspects. Some methods were tested only on small road networks with up to one hundred thousand vertices; some approaches were evaluated using distance queries (instead of shortest path queries), namely, queries that ask only for the length of the shortest path; a state-of-the-art technique was examined based on a faulty implementation that led to incorrect query results. To address the above issues, this paper presents a comprehensive comparison of the most advanced spatial-coherence-based and vertex-importance-based approaches. Using a variety of real road networks with up to twenty million vertices, we evaluated each technique in terms of its preprocessing time, space consumption, and query efficiency (for both shortest path and distance queries). Our experimental results reveal the characteristics of different techniques, based on which we provide guidelines on selecting appropriate methods for various scenarios.
Increasingly, business projects are ephemeral. New Business Intelligence tools must support ad-lib data sources and quick perusal. Meanwhile, tag clouds are a popular community-driven visualization technique. Hence, we investigate tag-cloud views with support for OLAP operations such as roll-ups, slices, dices, clustering, and drill-downs. As a case study, we implemented an application where users can upload data and immediately navigate through its ad hoc dimensions. To support social networking, views can be easily shared and embedded in other Web sites. Algorithmically, our tag-cloud views are approximate range top-k queries over spontaneous data cubes. We present experimental evidence that iceberg cuboids provide adequate online approximations. We benchmark several browser-oblivious tag-cloud layout optimizations.
The spatial join is a popular operation in spatial database systems and its evaluation is a well-studied problem. As main memories become bigger and faster and commodity hardware supports parallel processing, there is a need to revamp classic join algorithms which have been designed for I/O-bound processing. In view of this, we study the in-memory and parallel evaluation of spatial joins, by re-designing a classic partitioning-based algorithm to consider alternative approaches for space partitioning. Our study shows that, compared to a straightforward implementation of the algorithm, our tuning can improve performance significantly. We also show how to select appropriate partitioning parameters based on data statistics, in order to tune the algorithm for the given join inputs. Our parallel implementation scales gracefully with the number of threads reducing the cost of the join to at most one second even for join inputs with tens of millions of rectangles.
In this paper, we propose a spatially constrained clustering problem belonging to the family of p-regions problems. Our formulation is motivated by the recent developments of economic complexity on the evolution of the economic output through key interactions among industries within economic regions. The objective of this model consists in aggregating a set of geographic areas into a prescribed number of regions (so-called innovation ecosystems) such that the resulting regions preserve the most relevant interactions among industries. We formulate the p-Innovation Ecosystems model as a mixed-integer programming (MIP) problem and propose a heuristic solution approach. We explore a case involving the municipalities of Colombia to illustrate how such a model can be applied and used for policy and regional development.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا