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ę "assignment" wg kryterium: Temat


Tytuł:
Frequency planning and ramifications of coloring
Autorzy:
Eisenblätter, Andreas
Grötschel, Martin
Koster, Arie
Powiązania:
https://bibliotekanauki.pl/articles/743541.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
frequency assignment
graph coloring
Opis:
This paper surveys frequency assignment problems coming up in planning wireless communication services. It particularly focuses on cellular mobile phone systems such as GSM, a technology that revolutionizes communication. Traditional vertex coloring provides a conceptual framework for the mathematical modeling of many frequency planning problems. This basic form, however, needs various extensions to cover technical and organizational side constraints. Among these ramifications are T-coloring and list coloring. To model all the subtleties, the techniques of integer programming have proven to be very useful.The ability to produce good frequency plans in practice is essential for the quality of mobile phone networks. The present algorithmic solution methods employ variants of some of the traditional coloring heuristics as well as more sophisticated machinery from mathematical programming. This paper will also address this issue.Finally, this paper discusses several practical frequency assignment problems in detail, states the associated mathematical models, and also points to public electronic libraries of frequency assignment problems from practice. The associated graphs have up to several thousand vertices and range form rather sparse to almost complete.
Źródło:
Discussiones Mathematicae Graph Theory; 2002, 22, 1; 51-88
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization on permutations: related structures, problems interrelation, heuristic compositions, applications
Autorzy:
Miatselski, M.
Powiązania:
https://bibliotekanauki.pl/articles/298118.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Warmińsko-Mazurski w Olsztynie
Tematy:
heuristic algorithm
heuristics composition
optimization on permutations
assignment problem
quadratic assignment problem
Opis:
A heuristics based approach to practical solving theoretically intractable combinatory and network problems is discussed. Compound heuristics (heuristics compositions) are suggested to be more efficient procedures for real size problem instances. Some aspects of the heuristics compositions topic are illustrated by optimum permutation problems. We describe a uniform presentation of the chief types of the problems and their interrelations, including the relation “to be a special case of a problem”. We consider a number of algebraic structures and combinatory constructions on permutation sets and present an inclusion chain of these constructions. The chain enables us to establish and clarify many interrelations for the minimum permutation problems, with algorithmic and complexity aspects taken into account. We also concern the applications of some problems as well.
Źródło:
Technical Sciences / University of Warmia and Mazury in Olsztyn; 2018, 21(1); 37-47
1505-4675
2083-4527
Pojawia się w:
Technical Sciences / University of Warmia and Mazury in Olsztyn
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some Aspects of the Application of Genetic Algorithm for Solving the Assignment Problem of Tasks to Resources in a Transport Company
Autorzy:
Izdebski, Mariusz
Jacyna, Marianna
Powiązania:
https://bibliotekanauki.pl/articles/504281.pdf
Data publikacji:
2014
Wydawca:
Międzynarodowa Wyższa Szkoła Logistyki i Transportu
Tematy:
assignment problem
genetic algorithm
optimization
Opis:
The article defines the assignment problem of tasks to resources in a transport company. The paper describes mathematical model of a transport system taking into account the assignment of vehicles to the tasks. It also provides stages of creation of the genetic algorithm for solving the assignment problem in the transport company.
Źródło:
Logistics and Transport; 2014, 21, 1; 13-20
1734-2015
Pojawia się w:
Logistics and Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ant algorithm for AP-N aimed at optimization of complex systems
Autorzy:
Mikulik, J.
Zajdel, M.
Powiązania:
https://bibliotekanauki.pl/articles/375987.pdf
Data publikacji:
2010
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
assignment problem
ant algorithm
optimization
Opis:
Assignment Problem (AP), which is well known combinatorial problem, has been studied extensively in the course of many operational and technical researches. It has been shown to be NP-hard for three or more dimensions and a few non-deterministic methods have been proposed to solve it. This paper pays attention on new heuristic search method for the n-dimensional assignment problem, based on swarm intelligence and comparing results with those obtained by other scientists. It indicates possible direction of solutions of problems and presents a way of behaviour using ant algorithm for multidimensional optimization complex systems. Results of researches in the form of computational simulations outcomes are presented.
Źródło:
Decision Making in Manufacturing and Services; 2010, 4, 1-2; 29-36
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Location of Processor Allocator and Job Scheduler and Its Impact on CMP Performance
Autorzy:
Zydek, D.
Chma, G.
Shawky, A.
Selvaraj, H.
Powiązania:
https://bibliotekanauki.pl/articles/227230.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
CMP
PA
JS
energy
assignment
Opis:
High Performance Computing (HPC) architectures are being developed continually with an aim of achieving exascale capability by 2020. Processors that are being developed and used as nodes in HPC systems are Chip Multiprocessors (CMPs) with a number of cores. In this paper, we continue our effort towards a better processor allocation process. The Processor Allocator (PA) and Job Scheduler (JS) proposed and implemented in our previous works are explored in the context of its best location on the chip. We propose a system, where all locations on a chip can be analyzed, considering energy used by Network-on-Chip (NoC), PA and JS, and processing elements. We present energy models for the researched CMP components, mathematical model of the system, and experimentation system. Based on experimental results, proper placement of PA and JS on a chip can provide up to 45% NoC energy savings.
Źródło:
International Journal of Electronics and Telecommunications; 2012, 58, 1; 9-14
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hamiltonicity and the 3-Opt procedure for the traveling Salesman problem
Autorzy:
Sierksma, Gerard
Powiązania:
https://bibliotekanauki.pl/articles/1340570.pdf
Data publikacji:
1994
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
Assignment Polytope
Traveling Salesman Polytope
Opis:
The 3-Opt procedure deals with interchanging three edges of a tour with three edges not on that tour. For n≥6, the 3-Interchange Graph is a graph on 1/2(n-1)! vertices, corresponding to the hamiltonian tours in K_n; two vertices are adjacent iff the corresponding hamiltonian tours differ in an interchange of 3 edges; i.e. the tours differ in a single 3-Opt step. It is shown that the 3-Interchange Graph is a hamiltonian subgraph of the Symmetric Traveling Salesman Polytope. Upper bounds are derived for the diameters of the 3-Interchange Graph and the union of the 2- and the 3-Interchange Graphs. Finally, some new adjacency properties for the Asymmetric Traveling Salesman Polytope and the Assignment Polytope are given.
Źródło:
Applicationes Mathematicae; 1993-1995, 22, 3; 351-358
1233-7234
Pojawia się w:
Applicationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of Factoring in Business Operations
Autorzy:
Baranowski, Bartosz
Powiązania:
https://bibliotekanauki.pl/articles/23050964.pdf
Data publikacji:
2023
Wydawca:
Fundacja Instytut Nauki o Polityce
Tematy:
assignment of receivables
factoring
financial liquidity
Opis:
Assignment of receivables as an institution of current civil law is rooted in ancient legal systems. The abovementioned institution was introduced to the Polish legal system under the Code of Obligations of 27 October 1933. This solution occurs in various specific forms serving various legal and economic goals, beginning with the satisfaction of claims of individuals, to securing a claim, to improvement of financial liquidity of the assignor. Thanks to the constant development of the above legal institution it functions in numerous legal systems and constitutes a real support in securing business transactions and making them more efficient.
Źródło:
Polish Journal of Political Science; 2023, 9, 2; 22-32
2391-3991
Pojawia się w:
Polish Journal of Political Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Tabu Search for target-radar assignment
Autorzy:
Hindsberger, M.
Vidal, R.
Powiązania:
https://bibliotekanauki.pl/articles/205568.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
assignment
combinatorial optimization
metaheuristics
tabu search
Opis:
In this paper the problem of assigning air-defense illumination radars to enemy targets is presented. A Tabu Search metaheuristic solution is described and the results achieved are compared to those of other heuristic approaches. Implementation and experimental aspects are discussed. It is argued that Tabu Search could be used in near realtime decision making systems.
Źródło:
Control and Cybernetics; 2000, 29, 3; 701-724
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multidimensional personnel selection through combination of TOPSIS and Hungary assignment algorithm
Autorzy:
Safari, H.
Cruz-Machado, V.
Sarraf, A. Z.
Maleki, M.
Powiązania:
https://bibliotekanauki.pl/articles/406851.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
TOPSIS
Hungary assignment
personnel selection
NGT
Opis:
This paper proposes an effective solution based on combined TOPSIS and Hungary assignment approach to help companies that need to assign personnel to different departments. An extension of TOPSIS (technique for order performance by similarity to ideal solution) combined by Hungary assignment algorithm is represented for this purpose. According to decrease resistance of employee opposite of recruitment of new employee, Decision criteria are obtained from the nominal group technique (NGT) and managers of each departments has been involved in decision making process. In the presented solution, managers of four departments have been involved in evaluating four candidates for their department and data is analyzed by TOPSIS and at the end, an effective fit between personnel and their corresponding department is presented.
Źródło:
Management and Production Engineering Review; 2014, 5, 1; 42-50
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Zbywanie roszczeń o naprawienie szkody wyrządzonej czynem niedozwolonym. Ratio legis, treść normatywna oraz przyszłość uregulowania art. 449 k.c.
Assignability of Claims for Personal Injuries Caused by Torts. Ratio Legis, Present and Future of the Regulation
Autorzy:
Strugała, Radosław
Powiązania:
https://bibliotekanauki.pl/articles/519072.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Jagielloński. Fundacja Utriusque Iuris
Tematy:
assignment
personal injuries
claims for damages
Opis:
The aim of the paper is to present an alternative interpretation of the article 449 of the Polish Civil Code. In contrast to the most common, literal interpretation thereof, the paper offers a purposive interpretation taking into account ratio legis of the provision at stake. This tool enables to cast away some interpretative doubts which are constantly raised in the literarure. For inastance, it leads to the conclusion that the acknowledgement of debt which (according to the article 449 of the Polish Civil Code) renders the claims for damages assignable shall be limited to the acknowledgement in the strict meaning of the term, that is to the acknowledgement understood as a contract between creditor and debtor, and shall determine a sum of the acknowledged claim. The paper concludes that the article 449 of the Polish Civil Code, thanks to its purposive interpretation, may effectively protect assignors from assigning their claims for damages for the price which is far lower than the value of damages to which the assignor was entitled. This conclusion put in the context of ongoing works on the new law regulating the compensation agencies makes the article 9 of this law (which exludes the possibility of assignement of claims for damages) redundant.
Źródło:
Forum Prawnicze; 2019, 4 (54); 38-49
2081-688X
Pojawia się w:
Forum Prawnicze
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Umowa przelewu wierzytelności a podatek dochodowy od osób prawnych
Autorzy:
Bocheńska, Justyna
Powiązania:
https://bibliotekanauki.pl/articles/617600.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
taxation
assignment
receivables
cesja
wierzytelność
podatek
Opis:
Taxation of assignment of receivables with corporate income tax does not have the legislation applied in a uniform manner. Situation is variable due to the subject. The Act of Corporate Income Tax forms different regulations for objects whose assignment of receivables is a subject of business activity and for those whose not. This subject matter become an object of contrary judicial decision and tax interpretations due to incomplete regulations in Polish legal system.
Zagadnienia dotyczące opodatkowania umowy przelewu wierzytelności podatkiem dochodowym od osób prawnych należą do kwestii bardzo istotnych. Sytuacja jest jednak różna w zależności od podmiotów. W przypadku podmiotów, których przedmiotem działalności gospodarczej jest obrót wierzytelnościami, najważniejszą regulacją na gruncie ustawy o podatku dochodowym od osób prawnych, dotyczącą sposobu powstania przychodu, jest art. 12 ust. 3 i 3a, natomiast w przypadku tych, które zbywają wierzytelności własne i nie prowadzą działalności gospodarczej w tym zakresie, jest to art. 14 ust. 1. Tematyka ta jest przedmiotem niejednokrotnie sprzecznych ze sobą orzeczeń i interpretacji sądów administracyjnych, dlatego można uznać, że zagadnienia te, choć istotne, nadal nie są w pełni uregulowane w polskim systemie prawnym.
Źródło:
Studenckie Zeszyty Naukowe; 2016, 19, 31
1506-8285
Pojawia się w:
Studenckie Zeszyty Naukowe
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Observer state feedback control of discrete-time systems with state equality constraints
Autorzy:
Filasova, A.
Krokavec, D.
Powiązania:
https://bibliotekanauki.pl/articles/229818.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
equality constraints
eigenstructure assignment
state feedback
Opis:
Design conditions for existence of observer-based memory-less feedback control for stabilization of discrete-time systems with equality constraints given on the state variables are presented in the paper. These conditions are associated with eigenstructure assignment based on the singular value decomposition principle. The validity of the proposed method is demonstrated by a numerical example with the equality constraint tying together all state variables.
Źródło:
Archives of Control Sciences; 2010, 20, 3; 253-266
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Personality in project management methods
Autorzy:
Szwarc, E.
Szkatuła, K.
Bzdyra, K.
Powiązania:
https://bibliotekanauki.pl/articles/118189.pdf
Data publikacji:
2009
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
Project management
job assignment problem
personality
Opis:
High work efficiency is required by today’s organizations. Besides of other factors it depends on the right allocation of employed workers to their duties. Assigning employees to the right activities isn’t an easy task, because the job efficiency and differences in human nature have to be considered simultaneously. Usually, the decision undertaken by the human resource (HR) manager is based on his subjective experience. In several cases, such solution results in negative reactions of employees, and may lead to conflicts occurrence. In order to avoid them the problem of allocation of the properly selected team (taking into account workers’ personality) to the project’s activity is of crucial importance. Its right solution can decrease risk of activity execution delay. So, it is assumed the project’s completion time depends both on physical and psychological features of employed workers. Experimental results presented illustrate this approach.
Źródło:
Applied Computer Science; 2009, 5, 2; 68-79
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Performance of IP address auto-configuration protocols in Delay and Disruptive Tolerant Networks
Autorzy:
Schoeneich, R. O.
Sutkowski, P.
Powiązania:
https://bibliotekanauki.pl/articles/227276.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
address assignment
auto configuration
MANET
DTN
Opis:
At this moment there is a lack of research respecting Mobile Ad-hoc Networks (MANET) address assignment methods used in Delay Tolerant Networks (DTN). The goal of this paper is to review the SDAD, WDAD and Buddy methods of IP address assignment known from MANET in difficult environment of Delay and Disruptive Tolerant Networks. Our research allows us for estimating the effectiveness of the chosen solution and, therefore, to choose the most suitable one for specified conditions. As a part of the work we have created a tool which allows to compare these methods in terms of capability of solving address conflicts and network load. Our simulator was created from scratch in Java programming language in such a manner, that implementation of new features and improvements in the future will be as convenient as possible.
Źródło:
International Journal of Electronics and Telecommunications; 2016, 62, 2; 173-178
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An effective method of channels assignment for third generation cellular system
Autorzy:
Amanowicz, M.
Gajewski, P.
Krygier, J.
Powiązania:
https://bibliotekanauki.pl/articles/309331.pdf
Data publikacji:
2003
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
WCDMA
dynamic channel assignment
3G
Opis:
An original hybrid method of channels assignment for DS-CDMA system is discussed in the paper. This method combines standard PN codes assignment policy and dynamic channel assignment procedure that minimise the cost of channel assignment. OPNET simulation model DS-CDMA system was used for assessment of the hybrid method. The results of simulation presented in the paper confirmed that the proposed method importantly improves the quality of services in the third generation cellular system.
Źródło:
Journal of Telecommunications and Information Technology; 2003, 4; 74-78
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Modelling and simulation methodology for dynamic resources assignment system in container terminal
Autorzy:
Lu, B.
Powiązania:
https://bibliotekanauki.pl/articles/260155.pdf
Data publikacji:
2016
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
container terminal
resources assignment system
modelling
simulation
Opis:
As the competition among international container terminals has become increasingly fierce, every port is striving to maintain the competitive edge and provide satisfactory services to port users. By virtue of information technology enhancement, many efforts to raise port competitiveness through an advanced operation system are actively being made, and judging from the viewpoint of investment effect, these efforts are more preferable than infrastructure expansion and additional equipment acquisition. Based on simulation, this study has tried to prove that RFID-based real-time location system (RTLS) data collection and dynamic operation of transfer equipment brings a positive effect on the productivity improvement and resource utilization enhancement. Moreover, this study on the demand for the real-time data for container terminal operation have been made, and operation processes have been redesigned along with the collection of related data, and based on them, simulations have been conducted. As a result of them, much higher productivity improvement could be expected.
Źródło:
Polish Maritime Research; 2016, S 1; 97-103
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Kasusveränderungen im gegenwärtigen Deutschen
Autorzy:
Vater, Heinz
Powiązania:
https://bibliotekanauki.pl/articles/700407.pdf
Data publikacji:
2015
Wydawca:
Stowarzyszenie Germanistów Polskich
Tematy:
language change, syntax, case assignment, apposition, coordination
Opis:
In detailed investigations of the use of cases in present-day German, caused by Sebastian Sick‘s book Der Dativ ist dem Genitiv sein Tod, I discovered that the statements by Sick (2004) present only half of the truth (or even less), since the replacement of the genitive by the dative is only part of more extensive changes: the dative is also replaced by the genitive (especially after prepositions), dative and accusative are exchanged, and all three oblique cases are exchanged by the nominative. My initial findings concerned cases assigned by verbs and prepositions as well as cases in appositives. Meanwhile, I noticed that you can find case changes also in conjoined NPs like den Leichen von Generalbundesanwalt Buback und seines Fahrers (rather than: seinem Fahrer). In my article many examples for case changes are presented and interpreted. They show the increasing uncertainty of speakers of German in their use of cases in all of the three affected areas (government by nouns and prepositions, apposition and coordination). We can draw the conclusion that the case system of German has become instable, that it is changing and might possibly be given up altogether − a change that already has taken place in all other Germanic languages except Islandic.
Źródło:
Zeitschrift des Verbandes Polnischer Germanisten; 2015, 4, 3
2353-656X
2353-4893
Pojawia się w:
Zeitschrift des Verbandes Polnischer Germanisten
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Processes for understanding sustainability as a goal and practice
Autorzy:
Oxenswärdh, Anette
Powiązania:
https://bibliotekanauki.pl/articles/1201880.pdf
Data publikacji:
2017-08-30
Wydawca:
Uniwersytet Gdański. Instytut Geografii
Tematy:
sustainability
organizational learning
collective learning
responsibility
assignment
Opis:
The concept of sustainability has become one of today’s most widely used and controversial concepts. It is therefore important to develop activities within organizational context in order to increase co-workers understanding of the goals for more sustainable practice. To produce goods and services, e.g. that is to meet our needs and still remain within the limits of the carrying capacity of nature and the ecological integrity and contributes to society’s well-being, is a big challenge for all organizations. One way to start to deal with the problem and define sustainability at the operational level is to discuss goals and meaning of them in groups. While discussing we shape our understanding of the meaning of the goals and this in turn even shapes our understanding of assignment in whole. Most importantly do this collective learning even shape our understanding of responsibilities in working towards more sustainable practise. This paper aims to study how co-workers through collective learning processes and discussions together can create more sustainable practice.
Źródło:
Journal of Geography, Politics and Society; 2017, 7, 3; 5-11
2084-0497
2451-2249
Pojawia się w:
Journal of Geography, Politics and Society
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The present participle and gender assignment in Swedish
Autorzy:
Skrzypek, Dominika
Powiązania:
https://bibliotekanauki.pl/articles/2086726.pdf
Data publikacji:
2021-12-30
Wydawca:
Uniwersytet im. Adama Mickiewicza w Poznaniu
Tematy:
present participle
gender assignment
Swedish
language change
Opis:
The paper considers gender assignment of deverbal nouns, originally present participles, in Swedish. The perspective is diachronic. The corpus consists of a choice of Swedish texts from 1225-1732. The results show that nouns denoting entities ranking higher in the Animacy hierarchy show tendencies to be placed in the utrum gender (originally masculine and feminine genders) and nouns denoting mass, collective or abstract referents to be assigned neuter gender. This tendency is visible throughout the history of the Swedish language.
Źródło:
Folia Scandinavica Posnaniensia; 2021, 31; 15-22
1230-4786
2299-6885
Pojawia się w:
Folia Scandinavica Posnaniensia
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cyclic flow shop scheduling problem with two-machine cells
Autorzy:
Bożejko, W.
Gnatowski, A.
Idzikowski, R.
Wodecki, M.
Powiązania:
https://bibliotekanauki.pl/articles/229393.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
job shop
cyclic scheduling
multi-machine
assignment
Opis:
In the paper a variant of cyclic production with setups and two-machine cell is considered. One of the stages of the problem solving consists of assigning each operation to the machine on which it will be carried out. The total number of such assignments is exponential. We propose a polynomial time algorithm finding the optimal operations to machines assignment.
Źródło:
Archives of Control Sciences; 2017, 27, 2; 151-167
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The SEKO assignment : efficient and fair assignment of students to multiple seminars
Autorzy:
Hoßfeld, Tobias
Powiązania:
https://bibliotekanauki.pl/articles/27315331.pdf
Data publikacji:
2023
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
assignment problem
limited capacity
utilization
at least on seminar ratio
ALOS ratio
fairness
integer linear programming
ILP
first-in first-out assignment
FIFO assignment
random selection using key objectives
SEKO
Opis:
Seminars are offered to students for education in various disciplines. The seminars may be limited in terms of the maximum number of participants, e.g., to have lively interactions. Due to capacity limitations, those seminars are often offered several times to serve the students’ demands. Still, some seminars are more popular than others and it may not be possible to grant access to all interested students due to capacity limitations. In this paper, a simple, but efficient random selection using key objectives (SEKO) assignment strategy is proposed which achieves the following goals: (i) efficiency by utilizing all available seminar places, (ii) satisfying all students by trying to assign at least one seminar to each student, and (iii) fairness by considering the number of assigned seminars per student. We formulate various theoretical optimization models using integer linear programming (ILP) and compare their solutions to the SEKO assignment based on a real-world data set. The real-world data set is also used as the basis for generating large data sets to investigate the scalability in terms of demand and number of seminars. Furthermore, the first-in first-out (FIFO) assignment, as a typical implementation of fair assignments in practice, is compared to SEKO in terms of utilization and fairness. The results show that the FIFO assignment suffers in realworld situations regarding fairness, while the SEKO assignment is close to the optimum and scales regarding computational time in contrast to the ILP.
Źródło:
Operations Research and Decisions; 2023, 33, 3; 1--25
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Hybrid NSGA-II Algorithm for Multiobjective Quadratic Assignment Problems
Autorzy:
Kamisli Ozturk, Z.
Uluel, M.
Powiązania:
https://bibliotekanauki.pl/articles/1031470.pdf
Data publikacji:
2017-09
Wydawca:
Polska Akademia Nauk. Instytut Fizyki PAN
Tematy:
Hybrid NSGA-II
Multiobjective Quadratic Assignment
Conic Scalarization
Opis:
In this study, we propose a novel hybrid multiobjective evolutionary algorithm for solving multiobjective quadratic assignment problems. During the last decade, the researchers gave increasing attention to the multiobjective structure of quadratic assignment problems and developed and/or used several multi objective metaheuristics. The nondominated sorting genetic algorithm (NSGA-II) has been shown to solve various multiobjective problems much better than other recently-proposed constraint handling approaches. Besides, the effectiveness of conic scalarization method was also proven for solution of multiobjective problems, that have non-linear structure. Here, a hybrid multiobjective evolutionary algorithm (cNSGA-II) featured with NSGA-II and conic scalarization's Pareto solutions is developed to obtain as much Pareto points, as possible. To test the performance of the algorithm we have selected the test problems from the literature and compared the performances by well-known diameter metric. It has been shown that cNSGA-II is effective in solving multiobjective quadratic assignment problems.
Źródło:
Acta Physica Polonica A; 2017, 132, 3; 959-962
0587-4246
1898-794X
Pojawia się w:
Acta Physica Polonica A
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A competency-driven staff assignment approach to improving employee scheduling robustness
Autorzy:
Bocewicz, Grzegorz
Szwarc, Eryk
Wikarek, Jaroslaw
Nielsen, Peter
Banaszak, Zbigniew
Powiązania:
https://bibliotekanauki.pl/articles/1841794.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
competency assignment
competency framework
personnel scheduling
robustness measures
Opis:
Presented paper concerns the competency-driven staff assignment and scheduling approach to the management of project portfolios subject to perturbations caused by employee absences and/or unexpected arrival of high priority jobs. Proactive strategy is considered, which exploits the concept of employee substitutability to improve the robustness of personnel allocation in the case of occurrence of specific types of disruptions. Solutions obtained using the model of a constraint satisfaction problem developed in this study are validated in series quantitative and qualitative experiments. With a view to future implementation in a Decision Support Systems dedicated to prototyping of proactive personnel allocation, a methodology employing the concept of a competency framework-based robustness measure is proposed. Implemented in a declarative framework, the proposed approach allows one to find a redundant competency framework robust to a given set of disruptions.
Źródło:
Eksploatacja i Niezawodność; 2021, 23, 1; 117-131
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Peculiarities of the self-presentation of preschool children
Cechy autoprezentacji dziecka w wieku przedszkolnym
Autorzy:
Zhuravleva, Inna
Powiązania:
https://bibliotekanauki.pl/articles/1388018.pdf
Data publikacji:
2016-03-31
Wydawca:
Uniwersytet Gdański. Wydawnictwo Uniwersytetu Gdańskiego
Tematy:
assignment
identification
isolation
child’s personality
self-presentation
Opis:
The results of a study on self-presentation in the light of the history of mankind and culture are presented. A definition of self-presentation as a phenomenon closely related to child development is given. The peculiarities of self-presentation are shown by an analysis of the structure of preschoolers’ self-consciousness. A typology of preschool children’s self-presentation is presented.
Źródło:
Problemy Wczesnej Edukacji; 2016, 32, 1; 113-125
1734-1582
2451-2230
Pojawia się w:
Problemy Wczesnej Edukacji
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A competency-driven staff assignment approach to improving employee scheduling robustness
Autorzy:
Bocewicz, Grzegorz
Szwarc, Eryk
Wikarek, Jaroslaw
Nielsen, Peter
Banaszak, Zbigniew
Powiązania:
https://bibliotekanauki.pl/articles/1841770.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
competency assignment
competency framework
personnel scheduling
robustness measures
Opis:
Presented paper concerns the competency-driven staff assignment and scheduling approach to the management of project portfolios subject to perturbations caused by employee absences and/or unexpected arrival of high priority jobs. Proactive strategy is considered, which exploits the concept of employee substitutability to improve the robustness of personnel allocation in the case of occurrence of specific types of disruptions. Solutions obtained using the model of a constraint satisfaction problem developed in this study are validated in series quantitative and qualitative experiments. With a view to future implementation in a Decision Support Systems dedicated to prototyping of proactive personnel allocation, a methodology employing the concept of a competency framework-based robustness measure is proposed. Implemented in a declarative framework, the proposed approach allows one to find a redundant competency framework robust to a given set of disruptions.
Źródło:
Eksploatacja i Niezawodność; 2021, 23, 1; 117-131
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Swedish Special Needs Teachers’ Views on Their Work and Collaborations in Education for Students with Intellectual Disabilities
Autorzy:
Anderson, Lotta
Östlund, Daniel
Powiązania:
https://bibliotekanauki.pl/articles/1967572.pdf
Data publikacji:
2019-09-30
Wydawca:
Wydawnictwo Adam Marszałek
Tematy:
collaboration
intellectual disability
special needs teacher
school assignment
Opis:
The aim is to analyze what characterizes the work of special needs teachers and what collaborations they engage in in schools for students with intellectual disability. Special needs teachers with degrees from three different universities in southern Sweden participated in the survey. The results show that a majority of the respondents had long experience before they started the special needs training program and they describe the direct encounters with students in the classroom as an important part of their work. Supervision and subject-development also exist, but not to the same extent as classroom teaching.
Źródło:
The New Educational Review; 2019, 57; 225-235
1732-6729
Pojawia się w:
The New Educational Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The priority assignment for detected targets in multifunction radar
Autorzy:
Komorniczak, W.
Kuczerski, T.
Pietrasiński, J.F.
Powiązania:
https://bibliotekanauki.pl/articles/309112.pdf
Data publikacji:
2001
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
multifunction radar
target identification
priority assignment
resources management
Opis:
In a multifunction radar there is necessity to manage its very limited resources. This management should concern, among others, detected targets importance description. So information of those with lower priority will be refreshed more rarely. Presented paper describes system that assigns ranks for all detected objects in real time and then puts targets in order of priority. The system is based on structure of artificial neuron. Methods of neuron learning are discussed.
Źródło:
Journal of Telecommunications and Information Technology; 2001, 4; 30-32
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization and Pole Assignment in Control System Design
Autorzy:
Chu, E. K.
Powiązania:
https://bibliotekanauki.pl/articles/908060.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
optymalizacja
matematyka
condition number
linear feedback
pole assignment
robustness
Opis:
Some elementary optimization techniques, together with some not so well-known robustness measures and condition numbers, will be utilized in pole assignment. In particular, "Method 0" by Kautsky et al. (1985) for optimal selection of vectors is shown to be convergent to a local minimum, with respect to the condition number 1/2 ||X||_F^2 - ln |det X|. This contrasts with the misconception by Kautsky et al. that the method diverges, or the recent discovery by Yang and Tits (1995) that the method converges to stationary points.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2001, 11, 5; 1035-1053
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Coloring rectangular blocks in 3-space
Autorzy:
Magnant, Colton
Martin, Daniel
Powiązania:
https://bibliotekanauki.pl/articles/743845.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
chromatic number
channel assignment problem
3 dimensional rectangular blocks
Opis:
If rooms in an office building are allowed to be any rectangular solid, how many colors does it take to paint any configuration of rooms so that no two rooms sharing a wall or ceiling/floor get the same color? In this work, we provide a new construction which shows this number can be arbitrarily large.
Źródło:
Discussiones Mathematicae Graph Theory; 2011, 31, 1; 161-170
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Defining a storage-assignment strategy for precedence-constrained order picking
Autorzy:
Trindade, Maria A. M.
Sousa, Paulo S. A.
Moreira, Maria R. A.
Powiązania:
https://bibliotekanauki.pl/articles/2099652.pdf
Data publikacji:
2021
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
storage location assignment problem
SLAP
correlated policy
precedence constrains
Opis:
A zero-one quadratic assignment model has been proposed for dealing with the storage location assignment problem when there are weight constraints. Our analysis shows that operations can be improved using our model. When comparing the strategy currently used in a real-life company with the designed model, we found that the new placement of products allowed a reduction of up to 22% on the picking distance. This saving is higher than that achieved with the creation of density zones, a procedure commonly used to deal with weight constraints, according to the literature.
Źródło:
Operations Research and Decisions; 2021, 31, 2; 147--160
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Synteza logiczna układów sekwencyjnych realizowanych w strukturach CPLD opisanych za pomocą języka VHDL
Logic synthesis of sequential automata implemented in CPLDs, and described in VHDL
Autorzy:
Czerwiński, R.
Kania, D.
Powiązania:
https://bibliotekanauki.pl/articles/155712.pdf
Data publikacji:
2007
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
automaty sekwencyjne
kodowanie stanów
CPLD
VHDL
FSM
state assignment
Opis:
W artykule przedstawiono problem kodowania stanów wewnętrznych automatów sekwencyjnych ukierunkowany na realizację układu w strukturze matrycowej typu PAL. Opracowano sposób uwzględniania elementów dwupoziomowej minimalizacji oraz elementów dopasowania już na etapie kodowania stanów wewnętrznych. Sporo miejsca poświęcono problemowi opisu automatu w języku opisu sprzętu VHDL pod kątem efektywnego przeprowadzenia syntezy logicznej w systemie Quartus II. Skuteczność metod kodowania i opracowanego opisu potwierdzają uzyskane wyniki eksperymentów.
The paper concerns the problem of state assignment for finite state machines (FSM), targeting at PAL-based CPLDs implementations. The main feature of a PAL-based cell is a limited number of product terms (k AND-gates) that are connected to a single sum (OR-gate). Methods, that do not take into account this limited number of product terms in the process of state assignment, usually lead to multi-cell and multi-level structures. To make allowance for number of product terms the elements of two-level minimization and elements of technology mapping must be taken into account in the process of state assignment. This is possible thanks to Primary and Secondary Merging Conditions and Implicants Distribution Table. The problem of the sequential automata VHDL design is also considered. The VHDL design description of the FSM for Quartus II is proposed. Experimental results consider the efficiency of the proposed methods.
Źródło:
Pomiary Automatyka Kontrola; 2007, R. 53, nr 7, 7; 45-47
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dynamic decoupling of left-invertible MIMO LTI plants
Autorzy:
Dworak, P.
Powiązania:
https://bibliotekanauki.pl/articles/229937.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
dynamic decoupling
left-invertible
pole assignment
polynomial matrix equations
Opis:
In the paper problems with dynamic decoupling of the left-invertible multi-input multi-output dynamic (MIMO) linear time invariant (LTI) plants are considered. It is presented an universal and efficient algorithm for synthesis of control system for proper, square, right and left invertible plants which can be both unstable and/or non-minimumphase.
Źródło:
Archives of Control Sciences; 2011, 21, 4; 443-459
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The application of genetic algorithm in the assignment problems in the transportation company
Autorzy:
Izdebski, M.
Jacyna, M.
Powiązania:
https://bibliotekanauki.pl/articles/247149.pdf
Data publikacji:
2018
Wydawca:
Instytut Techniczny Wojsk Lotniczych
Tematy:
assignment problem
genetic algorithm
multi-criterion optimization
transportation company
Opis:
The article presents the problem of the task assignment of the vehicles for the transportation company, which deals with the transport of the cargo in the full truckload system. The presented problem is a complex decision making issue which has not been analysed in the literature before. There must be passed through two stages in order to solve the task assignment problem of the vehicles for the transportation company. The first stage is to designate the tasks, the other one is to determine the number of the vehicles that perform these tasks. The task in the analysed problem is defined as transporting the cargo from the suppliers to the recipients. The transportation routes of the cargo must be determined. In order to solve the task assignment problem of the vehicles, the genetic algorithm has been developed. The construction stages of this algorithm are presented. The algorithm has been developed to solve the multi-criteria decision problem. What is more, the algorithm is verified by the use of the real input data.
Źródło:
Journal of KONES; 2018, 25, 4; 133-140
1231-4005
2354-0133
Pojawia się w:
Journal of KONES
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An efficient genetic algorithm for the uncapacitated multiple allocation p-hub median problem
Autorzy:
Stanimirovic, Z.
Powiązania:
https://bibliotekanauki.pl/articles/970612.pdf
Data publikacji:
2008
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
p-hub problem
genetic algorithms
discrete location and assignment
Opis:
In this paper the Uncapacitated Multiple Allocation p-hub Median Problem (the UMApHMP) is considered. A new heuristic method based on a genetic algorithm approach (GA) for solving UMApHMP is proposed. The described GA uses binary representation of the solutions. Genetic operators which keep the feasibility of individuals in the population are designed and implemented. The mutation operator with frozen bits is used to increase the diversibility of the genetic material. The running time of the GA is improved by caching technique. Proposed GA approach is bench-marked on the well known CAB and AP data sets and compared with the existing methods for solving the UMApHMP. Computational results show that the GA quickly reaches all previously known optimal solutions, and also gives results on large scale AP instances (up to n=200, p=20) that were not considered in the literature so far.
Źródło:
Control and Cybernetics; 2008, 37, 3; 669-692
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Umowa przelewu wierzytelności a podatek dochodowy od osób fizycznych
Autorzy:
Głowacka, Karolina
Powiązania:
https://bibliotekanauki.pl/articles/617380.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
assignment of receivables
transfer of the debt
assignment
personal income tax
umowa przelewu wierzytelności
przelew wierzytelności
cesja
podatek dochodowy od osób fizycznych
Opis:
Purchase and sale of receivables has certain effects in the area of civil law and also tax law. Transfer of the debt is an agreement, which may bring to the purchaser, in the future, certain income. In the other hand, an income tax is a tax imposed on individuals or entities that varies with the income or profits of the taxpayer. The article is focused on the analysis of issues related to the taxation of income from assignment of receivables with personal income tax, as well as issues of including the expense on purchase of receivables to costs of earning income.
Obrót wierzytelnościami rodzi określone skutki zarówno w sferze prawa cywilnego, jak i prawa podatkowego. Przelew wierzytelności to umowa, która może przynieść nabywcy w przyszłości pewien przychód, dlatego takie zdarzenie jest objęte zakresem przedmiotowym podatku dochodowego od osób fizycznych. Artykuł jest poświęcony analizie zagadnień związanych z opodatkowaniem podatkiem dochodowym od osób fizycznych przychodów z umowy przelewu wierzytelności. Szczegółowo została przedstawiona problematyka momentu powstania obowiązku podatkowego z tytułu uzyskania przez nabywcę przychodów z przelewu wierzytelności oraz kwestia zaliczenia wydatku na nabycie wierzytelności do kosztów uzyskania przychodu.
Źródło:
Studenckie Zeszyty Naukowe; 2016, 19, 31
1506-8285
Pojawia się w:
Studenckie Zeszyty Naukowe
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Opodatkowanie umowy przelewu wierzytelności podatkiem od czynności cywilnoprawnych
Autorzy:
Barszczewska, Karolina
Powiązania:
https://bibliotekanauki.pl/articles/617338.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
assignment of receivables
tax on civil law transactions
taxation of assignment
opodatkowanie umowy przelewu wierzytelności
podatek od czynności cywilnoprawnych
cesja wierzytelności
PCC
Opis:
The article explores tax consequences of assignment of receivables based on tax on civil law transactions in Polish legal system. Taxation of assignment rises a number of concerns in terms of value added taxes, including VAT and tax on civil law transations. The issue is important mainly on the grounds of entieties taking part in trading i.e. assignee and assignor. Their ignorance, caused by lack of transparency of the current regulations, might lead to tax arreas. The difficulty in determining of tax consequences has been taken up by doctrine of law and decisions of administrative courts, which still analyse current legal environment.
W artykule zostało poruszone zagadnienie konsekwencji podatkowych umowy przelewu wierzytelności na gruncie podatku od czynności cywilnoprawnych. Opodatkowanie cesji budzi wiele wątpliwości w zakresie podatków obrotowych, a więc podatku od towarów i usług oraz podatku od czynności cywilnoprawnych. Problematyka jest istotna głównie ze względu na sytuację podmiotów dokonujących obrotu, czyli cesjonariusza i cedenta. W tym zakresie ważnym problemem jest określenie skutków podatkowych.
Źródło:
Studenckie Zeszyty Naukowe; 2016, 19, 31
1506-8285
Pojawia się w:
Studenckie Zeszyty Naukowe
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On total vertex irregularity strength of graphs
Autorzy:
Muthu Guru Packiam, K.
Kathiresan, Kumarappan
Powiązania:
https://bibliotekanauki.pl/articles/743655.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph labeling
irregularity strength
total assignment
vertex irregular total labeling
Opis:
Martin Bača et al. [2] introduced the problem of determining the total vertex irregularity strengths of graphs. In this paper we discuss how the addition of new edge affect the total vertex irregularity strength.
Źródło:
Discussiones Mathematicae Graph Theory; 2012, 32, 1; 39-45
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Spatial Distribution of Flows in Transportation Networks. A Model Based on Bounded Rationality Assumption
Autorzy:
Dorosiewicz, Sławomir
Powiązania:
https://bibliotekanauki.pl/articles/504417.pdf
Data publikacji:
2012
Wydawca:
Międzynarodowa Wyższa Szkoła Logistyki i Transportu
Tematy:
transportation networks
dynamic traffic assignment problem model of traffic flows
Opis:
This paper refers to a Dynamic Traffic Assignment Problem. A consecutive dynamic model of traffic flows is formulated. Some of its dynamical properties (including existence of chaotic solutions and bifurcations) are examined in two special cases.
Źródło:
Logistics and Transport; 2012, 14, 1; 73-80
1734-2015
Pojawia się w:
Logistics and Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Romania: university and politics in the 1980s. Case study: the University of Bucharest, the 1980s
Autorzy:
Rotaru, Mirela
Powiązania:
https://bibliotekanauki.pl/articles/628363.pdf
Data publikacji:
2015
Wydawca:
Fundacja Pro Scientia Publica
Tematy:
Admission exam; competition; assignment to production units; migrant families; mergers
Opis:
The presentation I am submitting to your attention focuses on how the University of Bucharest operated during the 1980’s, a very difficult period for Romania.  As to be expected,  the University of Bucharest, like the entire Romanian education system, took the full blow of communist experimental policies, reflecting quite accurately the general developments of the political system in Romania in the 1980s. The structure of Bucharest University, the curriculum, acceptance of the students via admission exams as well as the process of assignment of graduates from University of Bucharest to production units in the 1980’s, are aspects of university life which were all affected by profound changes during the period subject to the research, leading to a   genuine phenomenon in the Romanian society. The way these changes were reflected in the cultural mindset and the traumas generated by them are all points of interest addressed in my presentation.
Źródło:
Journal of Education Culture and Society; 2015, 6, 2; 359-369
2081-1640
Pojawia się w:
Journal of Education Culture and Society
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Metoda wyznaczania współrzędnych położenia węzłów bezprzewodowej sieci sensorycznej zbudowanej w oparciu o standard IEEE 802.15.4
A method of assigning coordinates of IEEE 802.15.4 wireless sensor network
Autorzy:
Wawryszczuk, M.
Powiązania:
https://bibliotekanauki.pl/articles/210034.pdf
Data publikacji:
2010
Wydawca:
Wojskowa Akademia Techniczna im. Jarosława Dąbrowskiego
Tematy:
sieci sensoryczne
wyznaczanie współrzędnych
RSSI
ESD
sensor networks
coordinates assignment
Opis:
Artykuł przedstawia zaproponowany przez autora sposób identyfikacji współrzędnych położenia węzłów sieci sensorycznej. Zakłada się, że sieć zbudowana będzie w oparciu o nieskomplikowane urządzenia Chipcon CC2420, posiadające wbudowany stos protokołów IEEE 802.15.4. Węzły sieci nie znają swoich współrzędnych położenia, a do ich określenia wykorzystuje się węzły referencyjne, znające swoje współrzędne. W referacie przyjęto pomiar poziomu mocy odebranego sygnału (Received Signal Strength - RSS) jako parametr służący do wyznaczania odległości od danego węzła do węzła referencyjnego. Następnie współrzędne szacowane są w oparciu o rozszerzoną metodę największego spadku (Enchanced Steepest Descent - ESD). W artykule wykazano również, że parametr RSSI (Received Signal Strength Indicator) jest dobrą metryką wyznaczania odległości w propagacji przyziemnej na niezabudowanym, płaskim terenie.
This paper presents a concept of building wireless sensor network, using simple devices Chipcon CC2420, with built-in IEEE 802.15.4 protocols stack. It is assumed that the nodes do not know their coordinates and they can calculate them using referential nodes (which know their position). Nodes measure the distance to the referential nodes using Received Signal Strength Indicator (RSSI) parameter and after that acquire their coordinates involving Enhanced Steepest Descent optimization method. In the article, it is shown that RSSI parameter can be a good estimator of the distance measurement in uniform area, in ground-level propagation model.
Źródło:
Biuletyn Wojskowej Akademii Technicznej; 2010, 59, 3; 407-420
1234-5865
Pojawia się w:
Biuletyn Wojskowej Akademii Technicznej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Minimum-Spanning-Tree-Inspired Algorithm for Channel Assignment in 802.11 Networks
Autorzy:
Dolińska, I.
Jakubowski, M.
Masiukiewicz, A.
Rządkowski, G.
Piórczyński, K.
Powiązania:
https://bibliotekanauki.pl/articles/226434.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
channel selection
channel assignment
802.11 home networks
greedy algorithm
Opis:
Channel assignment in 2.4 GHz band of 802.11 standard is still important issue as a lot of 2.4 GHz devices are in use. This band offers only three non-overlapping channels, so in crowded environment users can suffer from high interference level. In this paper, a greedy algorithm inspired by the Prim’s algorithm for finding minimum spanning trees (MSTs) in undirected graphs is considered for channel assignment in this type of networks. The proposed solution tested for example network distributions achieves results close to the exhaustive approach and is, in many cases, several orders of magnitude faster.
Źródło:
International Journal of Electronics and Telecommunications; 2016, 62, 4; 379-388
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Функції пасивних конструкцій в українській та німецькій мовах
Autorzy:
Cymbalista, Lidia
Powiązania:
https://bibliotekanauki.pl/articles/1789763.pdf
Data publikacji:
2018-04-18
Wydawca:
Uniwersytet Warszawski. Wydawnictwa Uniwersytetu Warszawskiego
Tematy:
passive voice
passive construction
function
clausal topic assignment
impersonalization
detransitivation
Opis:
The article deals with passive constructions in Ukrainian and German languages, their manifestation in formal syntactic and semantic structures of a sentence, researches approaches to determining the place and functions of the passive voice in texts; provides contrastive analysis of clausal topic assignment, impersonalization and detransitivation in passive constructions of various types as exemplifi ed by the material of modern fi ction. The article also describes and illustrates reasons behind an agent defocusing, proves that agent reduction and detransitivation are common features for both languages. Although clausal topic assignment is considered to be the most important function of passive voice in German, its role in Ukrainian is rather dull in comparison, which is in part caused by diff erent syntactic organization of languages under research.
Źródło:
Studia Ucrainica Varsoviensia; 2018, 6; 37-44
2299-7237
Pojawia się w:
Studia Ucrainica Varsoviensia
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Poles and zeros assignment by state feedbacks in positive linear systems
Autorzy:
Kaczorek, Tadeusz
Powiązania:
https://bibliotekanauki.pl/articles/1845519.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
assignment
pole
zero
transfer matrix
linear
positive
system
state feedback
Opis:
Poles and zeros assignment problem by state feedbacks in positive continuous-time and discrete-time systems is analyzed. It is shown that in multi-input multi-output positive linear systems by state feedbacks the poles and zeros of the transfer matrices can be assigned in the desired positions. In the positive continuous-time linear systems the feedback gain matrix can be chosen as a monomial matrix so that the poles and zeros of the transfer matrices have the desired values if the input matrix B is monomial. In the positive discrete-time linear systems to solve the problem the matrix B can be chosen monomial if and only if in every row and every column of the n × n system matrix A the sum of n−1 its entries is less than one.
Źródło:
Archives of Control Sciences; 2021, 31, 3; 593-605
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Poles and zeros assignment by state feedbacks in positive linear systems
Autorzy:
Kaczorek, Tadeusz
Powiązania:
https://bibliotekanauki.pl/articles/1845533.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
assignment
pole
zero
transfer matrix
linear
positive
system
state feedback
Opis:
Poles and zeros assignment problem by state feedbacks in positive continuous-time and discrete-time systems is analyzed. It is shown that in multi-input multi-output positive linear systems by state feedbacks the poles and zeros of the transfer matrices can be assigned in the desired positions. In the positive continuous-time linear systems the feedback gain matrix can be chosen as a monomial matrix so that the poles and zeros of the transfer matrices have the desired values if the input matrix B is monomial. In the positive discrete-time linear systems to solve the problem the matrix B can be chosen monomial if and only if in every row and every column of the n × n system matrix A the sum of n−1 its entries is less than one.
Źródło:
Archives of Control Sciences; 2021, 31, 3; 593-605
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Eigenvalue assignment in fractional descriptor discrete-time linear systems
Autorzy:
Kaczorek, T.
Borawski, K.
Powiązania:
https://bibliotekanauki.pl/articles/229985.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
eigenvalue assignment
fractional
descriptor
discrete time linear system
gain matrix
Opis:
The problem of eigenvalue assignment in fractional descriptor discrete-time linear systems is considered. Necessary and sufficient conditions for the existence of a solution to the problem are established. A procedure for computation of the gain matrices is given and illustrated by a numerical example.
Źródło:
Archives of Control Sciences; 2017, 27, 1; 119-128
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Flow-capture location model with link capacity constraint over a mixed traffic network
Autorzy:
Liu, Ping
Cao, Jinde
Luo, Yiping
Guo, Jianhua
Huang, Wei
Powiązania:
https://bibliotekanauki.pl/articles/2147143.pdf
Data publikacji:
2022
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
traffic assignment problem
link capacity constraint
charging location
pathmdistance constraint
Opis:
This paper constructs and settles a charging facility location problem with the link capacity constraint over a mixed traffic network. The reason for studying this problem is that link capacity constraint is mostly insufficient or missing in the studies of traditional user equilibrium models, thereby resulting in the ambiguous of the definition of road traffic network status. Adding capacity constraints to the road network is a compromise to enhance the reality of the traditional equilibrium model. In this paper, we provide a two-layer model for evaluating the efficiency of the charging facilities under the condition of considering the link capacity constraint. The upper level model in the proposed bi-level model is a nonlinear integer programming formulation, which aims to maximize the captured link flows of the battery electric vehicles. Moreover, the lower level model is a typical traffic equilibrium assignment model except that it contains the link capacity constraint and driving distance constraint of the electric vehicles over the mixed road network. Based on the Frank-Wolfe algorithm, a modified algorithm framework is adopted for solving the constructed problem, and finally, a numerical example is presented to verify the proposed model and solution algorithm.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2022, 12, 3; 223--234
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optymalizacja przydziału zadań transportowych
Optimization of transportation task assignment
Autorzy:
Kisielewski, P.
Powiązania:
https://bibliotekanauki.pl/articles/257247.pdf
Data publikacji:
2007
Wydawca:
Sieć Badawcza Łukasiewicz - Instytut Technologii Eksploatacji - Państwowy Instytut Badawczy
Tematy:
zadania transportowe
plan przydziału zadań
grafik służb kierowców
optymalizacja przydziału zadań
transportation tasks
plan of task assignment
diver/crew rostering
optimization of task assignment
Opis:
W pracy przedstawiono problemu przydziału kierowców do zdefiniowanych zadań transportowych z celem minimalizacji kosztów operacyjnych dużej floty pojazdów. Zadanie w sensie matematycznym jest zagadnieniem optymalnego pokrycia zbiorów z uwzględnieniem ograniczeń wynikających z charakteru zadań, specyfiki przedsiębiorstwa i licznych przepisów prawa. W artykule omówiono etapy realizacji procesu przydziału ze szczególnym uwzględnieniem problemu optymalizacji. Zaproponowane dwie metody optymalizacyjne i przedstawiono wyniki przeprowadzonych dla nich testów na danych rzeczywistych przedsiębiorstw komunikacyjnych.
The problem of assigning transportation tasks to drivers, while minimizing the operational costs of a large vehicle fleet, is presented in the paper. In a mathematical sense the issue presents a so called 'optimal set covering problem' taking into consideration constraints resulting from task characteristics, company profile and numerous law regulations. The stages of the assignment process have been presented with particular emphasis on the optimization problem. Two optimization methods are proposed and the results of their tests are presented on real data from existing large urban transportation companies.
Źródło:
Problemy Eksploatacji; 2007, 2; 55-63
1232-9312
Pojawia się w:
Problemy Eksploatacji
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A High Capacity Energy Efficient Approach for Traffic Transmission in Cellular Networks
Autorzy:
Esmaeilifard, M.
Rahbar, A. G.
Powiązania:
https://bibliotekanauki.pl/articles/958113.pdf
Data publikacji:
2015
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
cellular networks
energy efficiency
frequency assignment
interference avoidance
transmission power control
Opis:
The efficiency of cellular networks can be improved in various aspects such as energy consumption, network capacity and interference between neighboring cells. This paper proposes a high capacity energy efficient scheme (HCEE) for data transmission in cellular networks in a country area. In this paper, the authors obtain a new equation to characterize the minimal required output power for traffic transmission between a base station (BS) and a mobile user (MU) based on the MU distance from the BS. Also, the cells boundaries (the boundary of overlapping areas of neighboring cells) by two static and dynamic approaches are specified. This work helps for better frequency allocation to MUs and allows increasing network capacity. In this paper, the analytical modeling in order to formulate the HCEE algorithm and evaluate its performance is used. The performance evaluation results show the simplicity of the HCEE algorithm and its effect on energy consumption decline, network capacity enhancement and the interference reduction.
Źródło:
Journal of Telecommunications and Information Technology; 2015, 3; 5-12
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fixed channel assignment in cellular communication systems considering the whole set of packed patterns. An investigation based on metaheuristics
Autorzy:
Borges, P.
Vidal, R.
Powiązania:
https://bibliotekanauki.pl/articles/206293.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
channel allocation
channel assignment
heuristics
mobile communication systems
patterns
search methods
Opis:
This paper addresses the problem of fixed channel assignment in cellular communication systems with nonuniform traffic distribution. The objective of the channel assignment is to minimise the average blocking probability. Methods for finding a good allocation can be based on first building a number of sets of cochannel cells or allocation patterns and then assigning them to channels. This usually implies that only a subset of the feasible region is attainable. The approach suggested in this paper uses the concept of packed pattern, since all patterns in an optimal solution will be of that kind. With a constructive method, the entire set of packed patterns is built and used in the optimisation process. The complexity (large-scale and nonlinearity) of the resulting problem suggested the use of general search procedures (local search, tabu search, simulated annealing, etc.), which have the further advantage of flexibility when dealing with extensions to the problem. A neighbouring structure was used, that facilitated the calculations while still allowing for the search in the entire solution space. A summary of extensive numerical experiments is presented. The outcome is an improvement over previous results.
Źródło:
Control and Cybernetics; 2000, 29, 3; 685-700
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Relationship Between the Infinite Eigenvalue Assignment for Singular Systems and the Solvability of Polynomial Matrix Equations
Autorzy:
Kaczorek, T.
Powiązania:
https://bibliotekanauki.pl/articles/908199.pdf
Data publikacji:
2003
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
automatyka
robotyka
assignment
infinite eigenvalue
singular
polynomial matrix equation
system
reliationship
Opis:
Two related problems, namely the problem of the infinite eigenvalue assignment and that of the solvability of polynomial matrix equations are considered. Necessary and sufficient conditions for the existence of solutions to both the problems are established. The relationships between the problems are discussed and some applications from the field of the perfect observer design for singular linear systems are presented.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2003, 13, 2; 161-167
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
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