Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "algorithms" wg kryterium: Temat


Tytuł:
Demokratyczna debata w mediach społecznościowych – utopijne nadzieje I smutna rzeczywistość
Autorzy:
Miotk, Anna
Powiązania:
https://bibliotekanauki.pl/articles/2050370.pdf
Data publikacji:
2020-12-30
Wydawca:
Uniwersytet Rzeszowski. Wydawnictwo Uniwersytetu Rzeszowskiego
Tematy:
social media
filtering algorithms
echo chamber
filter bubble
algorithms
political polarization
Opis:
The text analyzes social media in terms of the possibility of conducting a democratic debate through them. Initially, their users had great hopes to do so. Social media were to be not only a tool for expressing opinions or presenting statements but also for disseminating the model of liberal democracy. However, the business model of these media, as well as content filtering algorithms, introduced to protect users against information overload, prevented this from happening. To prove this thesis, the author referred to Sunstein's public forum doctrine and proved that social media do not constitute its equivalent. Although the media provided a space for discussion, they did not ensure equal access for senders of messages to recipients and recipients to a variety of content. The topic of the negative impact of social media on liberal democracy is already raised in English scholarship (and is already present in Poland through its translations) and it is also gradually gaining academic currency among Polish researchers. What constitutes a novel contribution to the already available research is the presentation of social media in the context of the utopian high hopes the media initially raised.
Źródło:
Polityka i Społeczeństwo; 2020, 18, 3; 63-79
1732-9639
Pojawia się w:
Polityka i Społeczeństwo
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorithms of the Web
Autorzy:
Szews, Przemysław
Powiązania:
https://bibliotekanauki.pl/articles/649624.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
new media
algorithms
Internet
Opis:
The article tackles the problem of the existence of algorithms in selected services and Internet websites. The interfacing of media is the starting point for this discourse, aimed at presenting the processes of automation in information distribution, the individualisation of messages and profiling in websites. The threats resulting from dynamically developing enterprises aimed at providing the website user with artificial intelligence – in terms of both social networks and mobile applications – are explicated in detail. The examples presented in the article refer to Internet recommendation systems, e-mail applications, voice assistants, and mechanisms responsible for the functioning of social networks. Speculations on algorithms omnipresent on the Web lead us to reflect on how the journalism will be redefined in the future, since it seems that the role of the journalist will be to moderate discussion and select the themes to be discussed; it is quite likely, though, that the themes selected will be compiled by specialised software.
Źródło:
Acta Universitatis Lodziensis. Folia Litteraria Polonica; 2016, 35, 5
1505-9057
2353-1908
Pojawia się w:
Acta Universitatis Lodziensis. Folia Litteraria Polonica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Performance Evaluation of Preemption Algorithms in MPLS Networks
Autorzy:
Kaczmarek, S.
Nowak, K.
Powiązania:
https://bibliotekanauki.pl/articles/226477.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
MPLS
preemption
algorithms
traffic engineering
Opis:
Preemption is a traffic engineering technique in Multiprotocol Switching Network that enables creation of high priority paths when there is not enough free bandwidth left on the route. Challenging part of any preemption method is to select the best set of paths for removal. Several heuristic methods are available but no wider comparison had been published before. In this paper, we discusses the dilemmas in implementing preemption methods are presented the simulation studyof well known existing algorithms. Based on the results, we provide recommendations for deployment of preemption for the two most common evaluation criteria: number of preemption and preempted bandwidth.
Źródło:
International Journal of Electronics and Telecommunications; 2011, 57, 2; 169-175
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The recommendation algorithm for an online art gallery
Autorzy:
Karwowski, W.
Sosnowska, J.
Rusek, M.
Powiązania:
https://bibliotekanauki.pl/articles/94759.pdf
Data publikacji:
2018
Wydawca:
Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie
Tematy:
algorithms
recommender system
collaborative filtering
Opis:
The paper discusses the need for recommendations and the basic recommendation systems and algorithms. In the second part the design and implementation of the recommender system for online art gallery (photos, drawings, and paintings) is presented. The designed customized recommendation algorithm is based on collaborative filtering technique using the similarity between objects, improved by information from user profile. At the end conclusions of performed algorithm are formulated.
Źródło:
Information Systems in Management; 2018, 7, 2; 108-119
2084-5537
2544-1728
Pojawia się w:
Information Systems in Management
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Roman {2}-Domination Problem in Graphs
Autorzy:
Chen, Hangdi
Lu, Changhong
Powiązania:
https://bibliotekanauki.pl/articles/32314051.pdf
Data publikacji:
2022-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
Roman {2}-domination
domination
algorithms
Opis:
For a graph G = (V, E), a Roman {2}-dominating function (R2DF) f : V → {0, 1, 2} has the property that for every vertex v ∈ V with f(v) = 0, either there exists a neighbor u ∈ N(v), with f(u) = 2, or at least two neighbors x, y ∈ N(v) having f(x) = f(y) = 1. The weight of an R2DF f is the sum f(V) = ∑v∈V f(v), and the minimum weight of an R2DF on G is the Roman {2}-domination number γ{R2}(G). An R2DF is independent if the set of vertices having positive function values is an independent set. The independent Roman {2}-domination number i{R2}(G) is the minimum weight of an independent Roman {2}-dominating function on G. In this paper, we show that the decision problem associated with γ{R2}(G) is NP-complete even when restricted to split graphs. We design a linear time algorithm for computing the value of i{R2}(T) in any tree T, which answers an open problem raised by Rahmouni and Chellali [Independent Roman {2}-domination in graphs, Discrete Appl. Math. 236 (2018) 408–414]. Moreover, we present a linear time algorithm for computing the value of γ{R2}(G) in any block graph G, which is a generalization of trees.
Źródło:
Discussiones Mathematicae Graph Theory; 2022, 42, 2; 641-660
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorytmizacja przestrzeni internetowej
Algorithms of the Web
Autorzy:
Szews, Przemysław
Powiązania:
https://bibliotekanauki.pl/articles/967704.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
new media
algorithms
Internet
social media
Opis:
The article tackles the problem of the existence of algorithms in selected services and the Internet websites. The interfacing of media is the starting point for this discourse, aimed at presenting the processes of automatisation in information distribution, the individualisation of messages, and profiling in websites. The threats resulting from dynamically developing enterprises aimed at providing the website user with artificial intelligence – in terms of both social networks and mobile applications – are explicated in detail. The examples presented in the article refer to Internet recommendation systems, e-mail applications, voice assistants, and mechanisms responsible for the functioning of social networks. Speculations on the algorithms omnipresent on the net lead us to reflect on how the journalist’s profession will be redefined in the future, since it seems that the role of the journalist will be to moderate discussion and select the themes to be discussed; it is quite likely, though, that the themes selected will be compiled by specialised software.
Źródło:
Acta Universitatis Lodziensis. Folia Litteraria Polonica; 2015, 28, 2
1505-9057
2353-1908
Pojawia się w:
Acta Universitatis Lodziensis. Folia Litteraria Polonica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A comparison of methods solving repeatable inverse kinematics for robot manipulators
Autorzy:
Duleba, I.
Karcz-Duleba, I.
Powiązania:
https://bibliotekanauki.pl/articles/229288.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
manipulator
inverse kinematics
repeatability
optimization
algorithms
Opis:
In this paper two recent methods of solving a repeatable inverse kinematic task are compared. The methods differ substantially although both are rooted in optimization techniques. The first one is based on a paradigm of continuation methods while the second one takes advantage of consecutive approximations. The methods are compared based on a quality of provided results and other quantitative and qualitative factors. In order to get a statistically valuable comparison, some data are collected from simulations performed on pendula robots with different paths to follow, initial configurations and a degree of redundancy.
Źródło:
Archives of Control Sciences; 2018, 28, 1; 5-18
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The role of automation in financial trading companies
Autorzy:
Lenczewski Martins, Carlos Jorge
Powiązania:
https://bibliotekanauki.pl/articles/18104631.pdf
Data publikacji:
2020-01-19
Wydawca:
Szkoła Główna Handlowa w Warszawie. Kolegium Zarządzania i Finansów
Tematy:
algorithms
trading
Quant 2.0
automation
Opis:
High Frequency Trading (HFT) has significantly affected the financial market - how trade is performed, types of employees hired, technology, or even market regulations. There are arguments that important risks arrive from trade automation, especially with the use of ultra-low latency trading systems. It also gives a possibility of achieving (higher) returns more quickly with less residual losses, i.e. algorithms may lead to a lower risk of exposure than traditional ‘human' traders. A higher level of automation in trading companies is a reality, which brings important management issues. The rise in competition between algo-traders has led to the rise of the so-called Quant 2.0: the rebirth of complex algorithms and artificial intelligence to collect, extract and process information available from any source of information. im of this article is, through a literature review, to present the main issues concerning automation in financial trading companies, and how the highly probable introduction of the Blockchain technology may affect HFT and the financial market - either the general market design, or specifically, how trading is performed.
Źródło:
Journal of Management and Financial Sciences; 2019, 39; 29-42
1899-8968
Pojawia się w:
Journal of Management and Financial Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Induced acyclic tournaments in random digraphs: Sharp concentration, thresholds and algorithms
Autorzy:
Dutta, Kunal
Subramanian, C.R.
Powiązania:
https://bibliotekanauki.pl/articles/31232000.pdf
Data publikacji:
2014-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
random digraphs
tournaments
concentration
thresholds
algorithms
Opis:
Given a simple directed graph $D = (V,A)$, let the size of the largest induced acyclic tournament be denoted by $mat(D)$. Let $D ∈ \mathcal{D}(n, p)$ (with $p = p(n)$) be a random instance, obtained by randomly orienting each edge of a random graph drawn from $\mathcal{G}(n, 2p)$. We show that $mat(D)$ is asymptotically almost surely (a.a.s.) one of only 2 possible values, namely either $b^\ast$ or $b^\ast + 1$, where $b^\ast = ⌊2(log_rn) + 0.5⌋$ and $r = p^{−1}$. It is also shown that if, asymptotically, $2(log_rn) + 1$ is not within a distance of $w(n)//(ln n)$ (for any sufficiently slow $w(n) → ∞$) from an integer, then $mat(D)$ is $⌊2(log_rn) + 1⌋$ a.a.s. As a consequence, it is shown that $mat(D)$ is 1-point concentrated for all $n$ belonging to a subset of positive integers of density 1 if $p$ is independent of $n$. It is also shown that there are functions $p = p(n)$ for which $mat(D)$ is provably not concentrated in a single value. We also establish thresholds (on $p$) for the existence of induced acyclic tournaments of size i which are sharp for $i = i(n) → ∞$. We also analyze a polynomial time heuristic and show that it produces a solution whose size is at least $log_rn + Θ(\sqrt{log_rn})$. Our results are valid as long as $p ≥ 1//n$. All of these results also carry over (with some slight changes) to a related model which allows 2-cycles.
Źródło:
Discussiones Mathematicae Graph Theory; 2014, 34, 3; 467-495
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorithms and calculation scheme for planning the way of movement of trajectory point during maneuvering for anchoring
Autorzy:
Surinov, I.
Powiązania:
https://bibliotekanauki.pl/articles/2063956.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
algorithms for planning ships trajectories
planning the way of movement
algorithms
maneuvering for anchoring
route planning
ship’s trajectory planning
algorithms for ships trajectories
trajectory planning
Opis:
The analysis of the historical aspect of the development of the maneuvering during anchoring shows that during the movement there is no time to control the position by technical means, due to the speed of the process of changing the parameters of movement. The main purpose of this research is to modify the methodological basis for the preparation of flight planning during anchoring with increased accuracy to determine the coordinates along which the ship will move. The methodology of this work is based on the calculation of trajectory points of the path in combination with the method of segments on the map using the characteristics of the maneuverability of the vessel. The method is based on determining the coordinate matrices of rectilinear and curvilinear sections through which the vessel passes during maneuvering for anchoring. The calculation program is developed in Excel, and allows without the help of a micro calculator that takes into account the maneuverability of the vessel in the automatic system. Thus, the control of the center of gravity of the vessel relative to a given path line is performed. A high-precision system for automatic determination of planned coordinates by trajectory points on track and traffic control during anchoring has been developed, which is based on recently developed algorithms, calculation schemes and methods at the Maritime University, which are based on the latest meaningful models of high-precision planning movement on them. This approach automates the process of controlling safe traffic, including the use of decision support systems, including stranding prevention and collisions with other vessels. The results of the research can be used on a ship for automated planning of coordinates on waypoints and control of traffic on them for safe maneuvering, as well as for training navigators on specialized simulators to perform trajectory planning, including limited conditions.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2021, 15, 3; 629--638
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analiza porównawcza algorytmów rozwiązujących Sudoku
Comparative analysis of algorithms for solving Sudoku
Autorzy:
Wnuk, E.
Łukasik, E.
Powiązania:
https://bibliotekanauki.pl/articles/98280.pdf
Data publikacji:
2016
Wydawca:
Politechnika Lubelska. Instytut Informatyki
Tematy:
Sudoku
algorytmy
czas działania
algorithms
solving time
Opis:
Artykuł przedstawia analizę porównawczą wybranych algorytmów, służących do rozwiązywania Sudoku. Porównywane są puzzle różnej wielkości, posiadające różny poziom trudności. Sprawdzany jest wpływ tych czynników na czas działania algorytmów. Na potrzeby badań stworzono specjalną aplikację, która zawiera wszystkie potrzebne algorytmy.
The article presents a comparative analysis of selected algorithms for solving Sudoku. Puzzles of different sizes and having different levels of difficulty are compared. The impact of these factors on the duration of the algorithms is examined. For the study, a special application that contains all the necessary algorithms has been created.
Źródło:
Journal of Computer Sciences Institute; 2016, 2; 140-143
2544-0764
Pojawia się w:
Journal of Computer Sciences Institute
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Formułowanie zadań optymalizacyjnych w projektowaniu maszyn Część I. Dekompozycja i tworzenie algorytmów obliczeniowych
Formulation of optimization problems in machine design. Part I. decomposition and development of calculation algorithms
Autorzy:
Rohatyński, R.
Powiązania:
https://bibliotekanauki.pl/articles/387512.pdf
Data publikacji:
2009
Wydawca:
Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej
Tematy:
optymalizacja
dekompozycja
algorytm
optimization method
disintegration
algorithms
Opis:
W artykule przedstawiono matematyczne sformułowanie problemu optymalizacji. Następnie opisano metodę dekompozycji złożonych zadań optymalizacji za pomocą przekształcania macierzy występowania. Opisano również metodę tworzenia algorytmów obliczania elementów i zespołów maszyn.
The paper commences with presentation of fundamental principles of mathematical formulation of optimization problems. Then application of incidence matrices to decomposition of complex optimization problems has been described. Finally, a new method of development of calculation algorithms for elements and units of machines has been outlined.
Źródło:
Acta Mechanica et Automatica; 2009, 3, 2; 74-76
1898-4088
2300-5319
Pojawia się w:
Acta Mechanica et Automatica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Simplified diagnostic algorithm for classification of preoperative anaemia based on complete blood count and its application in elective gastrointestinal surgery
Autorzy:
Czempik, Piotr F
Czepczor, Kinga
Czok, Marcelina
Pluta, Michał
Krzych, Łukasz
Powiązania:
https://bibliotekanauki.pl/articles/1392148.pdf
Data publikacji:
2019
Wydawca:
Index Copernicus International
Tematy:
algorithms
anaemia
iron-deficiency
preoperative period
surgery
Opis:
Introduction: Anaemia is associated with increased morbidity, mortality, hospital length of stay, and requirement for blood transfusion. Early differential diagnosis of anaemia may expedite its treatment and improve outcomes in the perioperative setting. The aim of our study was to create a simplified diagnostic algorithm for classification of anaemia based on complete blood count and to test its applicability in an elective gastrointestinal surgical population. Material and methods: Selected clinical data and laboratory red blood cell parameters were retrieved retrospectively for the group of 442 consecutive patients scheduled for elective high-risk gastrointestinal surgery from January 2016 to August 2018. Based on pathophysiologic data we created a simplified diagnostic algorithm for classification of preoperative anaemia and applied it to the study population. Results: Using the cut-off value of 130 g L-1 for both sexes, anaemia was diagnosed in 166 patients (37.5%). As many as 29 (17.5%) anaemic patients had aetiology of anaemia accurately established using our simplified diagnostic algorithm – either iron or vitamin B12/folate deficiency. Discussion: Preoperative anaemia is common in elective gastrointestinal surgery. Simplified diagnostic algorithm based solely on complete blood count parameters is helpful in the preliminary identification of patients with iron and vitamin B12/folic acid deficiencies so haematinic supplementation can be started early in preparation for surgery.
Źródło:
Polish Journal of Surgery; 2019, 91, 4; 24-28
0032-373X
2299-2847
Pojawia się w:
Polish Journal of Surgery
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Stakeholder-accountability model for artificial intelligence projects
Autorzy:
Miller, Glorja J.
Powiązania:
https://bibliotekanauki.pl/articles/2163225.pdf
Data publikacji:
2022
Wydawca:
Uniwersytet Ekonomiczny w Katowicach
Tematy:
accountability
artificial intelligence
algorithms
project management
ethics
Opis:
Aim/purpose – This research presents a conceptual stakeholder accountability model for mapping the project actors to the conduct for which they should be held accountable in artificial intelligence (AI) projects. AI projects differ from other projects in important ways, including in their capacity to inflict harm and impact human and civil rights on a global scale. The in-project decisions are high stakes, and it is critical who decides the system’s features. Even well-designed AI systems can be deployed in ways that harm individuals, local communities, and society. Design/methodology/approach – The present study uses a systematic literature review, accountability theory, and AI success factors to elaborate on the relationships between AI project actors and stakeholders. The literature review follows the preferred reporting items for systematic reviews and meta-analyses (PRISMA) statement process. Bovens’ accountability model and AI success factors are employed as a basis for the coding framework in the thematic analysis. The study uses a web-based survey to collect data from respondents in the United States and Germany employing statistical analysis to assess public opinion on AI fairness, sustainability, and accountability. Findings – The AI stakeholder accountability model specifies the complex relationships between 16 actors and 22 stakeholder forums using 78 AI success factors to define the conduct and the obligations and consequences that characterize those relationships. The survey analysis suggests that more than 80% of the public thinks AI development should be fair and sustainable, and it sees the government and development organizations as most accountable in this regard. There are some differences between the United States and Germany regarding fairness, sustainability, and accountability. Research implications/limitations – The results should benefit project managers and project sponsors in stakeholder identification and resource assignment. The definitions offer policy advisors insights for updating AI governance practices. The model presented here is conceptual and has not been validated using real-world projects. Originality/value/contribution – The study adds context-specific information on AI to the project management literature. It defines project actors as moral agents and provides a model for mapping the accountability of project actors to stakeholder expectations and system impacts.
Źródło:
Journal of Economics and Management; 2022, 44; 446-494
1732-1948
Pojawia się w:
Journal of Economics and Management
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Opracowanie algorytmu sterowania lotem mikrosamolotu w nieznanym terenie miejskim
Study on flight control algorithm of micro aerial vehicle in unknown urban enviroment
Autorzy:
Kownacki, C.
Powiązania:
https://bibliotekanauki.pl/articles/387447.pdf
Data publikacji:
2010
Wydawca:
Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej
Tematy:
sterowanie
mikrosamolot
algorytm
control
microplane model
algorithms
Opis:
Artykuł prezentuje koncepcję algorytmu autonomicznego sterowania lotem w kanionach ulic z wykorzysta- niem dwóch laserowych czujników odległości oraz zaawansowanego układu autopilota. Czujniki laserowe zamontowane w układzie V monitorują odległość pomiędzy mikrosamolotem a budynkami tworzącymi kanion ulicy. Wbudowane w autopilota dodatkowe oprogramowanie realizujące opracowany algorytm sterowania oparty o regulatory PID przejmuje kontrolę nad lotem mikrosamolotu w momencie wykrycia zagrożenia. W celu analizy skuteczności proponowanego algorytmu opracowano symulację w środowisku MATLAB – SIMULINK, której wyniki prezentują bezkolizyjne trajektorie lotu w przykładowych kanionach ulic. Dlatego też implementacja opracowanego algorytmu pozwoli zbudować mikrosamolot zdolny do autonomicznego lotu w terenie miejskim.
The paper describes the idea of autonomous flight control of micro aerial vehicle in streets’ canyons, which is based on two laser rangefinders and advanced autopilot. The sensors are mounted so as to create plane V shape of laser beams and they are scanning distance between micro aerial vehicle and buildings creating street canyon. The additional routine realizing conducted algorithm based on PID controllers can be built in the autopilot firmware and it will take charge of flight control when critical distance is detected. To analyze effectiveness of proposed algo- rithm, the simulation experiment was prepared in MATLAB – SIMULINK software and its results present collision free flight trajectories. So the realization of proposed algorithm allows creating autonomous micro aerial vehicle which will be able to fly in urban environment.
Źródło:
Acta Mechanica et Automatica; 2010, 4, 3; 87-93
1898-4088
2300-5319
Pojawia się w:
Acta Mechanica et Automatica
Dostawca treści:
Biblioteka Nauki
Artykuł

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies