Добірка наукової літератури з теми "Assignment period"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Assignment period".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Assignment period":
Eash, Ronald. "Time Period and Vehicle Class Highway Assignment for Air Quality Conformity Evaluation." Transportation Research Record: Journal of the Transportation Research Board 1641, no. 1 (January 1998): 66–72. http://dx.doi.org/10.3141/1641-08.
Basuki, Slamet. "Model Penugasan Belajar di Rumah Yang Menyenangkan Bagi Siswa di Masa Pandemi Covid 19." JURNAL PENDIDIKAN DASAR NUSANTARA 6, no. 1 (September 7, 2020): 199–210. http://dx.doi.org/10.29407/jpdn.v6i1.14754.
Zhang, Xinhui, and Jonathan F. Bard. "A multi-period machine assignment problem." European Journal of Operational Research 170, no. 2 (April 2006): 398–415. http://dx.doi.org/10.1016/j.ejor.2004.07.051.
Diponegoro, Ahmad. "Enhancement method for assignments of staff in multiple events." SHS Web of Conferences 49 (2018): 02005. http://dx.doi.org/10.1051/shsconf/20184902005.
Pavic, Ivan, and Hrvoje Dzapo. "Optimal Harmonic Period Assignment With Constrained Number of Distinct Period Values." IEEE Access 8 (2020): 175697–712. http://dx.doi.org/10.1109/access.2020.3025159.
Bhadury, J., and Z. Radovilsky. "Job rotation using the multi-period assignment model." International Journal of Production Research 44, no. 20 (October 15, 2006): 4431–44. http://dx.doi.org/10.1080/00207540500057621.
Kim, Hyoung Yuk, and Hong Seong Park. "Period And Priority Assignment Method For Dcs Design." Asian Journal of Control 5, no. 3 (October 22, 2008): 422–32. http://dx.doi.org/10.1111/j.1934-6093.2003.tb00136.x.
Cervin, Anton, Manel Velasco, Pau Marti, and Antonio Camacho. "Optimal Online Sampling Period Assignment: Theory and Experiments." IEEE Transactions on Control Systems Technology 19, no. 4 (July 2011): 902–10. http://dx.doi.org/10.1109/tcst.2010.2053205.
Smith, Marolee Beaumont. "BUSINESS MANAGEMENT DISTANCE EDUCATION RESEARCH ON YEAR MARK ASSESSMENT POLICY AT THE UNIVERSITY OF SOUTH AFRICA." Asian Association of Open Universities Journal 1, no. 1 (September 1, 2005): 20–37. http://dx.doi.org/10.1108/aaouj-01-01-2005-b003.
Arif H, M. Agus, Budi Santoso W, Ahmadi Ahmadi, and Okol S Suharyo. "SCHEDULING OPTIMIZATION OF KRI ASSIGNMENTS WITH BINARY INTEGER PROGRAMMING TO SECURE THE KOARMATIM SEA AREA." JOURNAL ASRO 9, no. 1 (April 23, 2018): 86. http://dx.doi.org/10.37875/asro.v9i1.70.
Дисертації з теми "Assignment period":
Maamar, Manel. "Modélisation et optimisation bi-objectif et multi-période avec anticipation d’une place de marché de prospects Internet : adéquation offre/demande." Thesis, Université Paris-Saclay (ComUE), 2015. http://www.theses.fr/2015SACLC025/document.
The work that we present in this thesis focuses on the assignment problem in a marketplace of Internet prospects. More precisely, this work aims to address the problem of matching offers and demands in a context characterized by a continuous flows. These latter evolve inreal time the set of available offers and demands to satisfy. To do this, we propose initially a mono-period model which optimizes the assignment problem at a given instant and taking into account asingle period of time while allowing the instantaneous consideration of new offers and demands and their adequacy in real time. This model considers two objectives to optimize, namely: maximization of turnover as well as clients satisfaction.Thereafter, we propose to extend this model over several future time periods in order to take into account the real time aspect of the marketplace activity and so the fact that a continuous flows evolve in real time the set of offers en demands. The objective is to take advantage of knowledge about this evolution, through the integration of a forecasting model in a multi-period optimization model. Thus,we propose a multi-period optimization model for considering at agiven instant assignments over several future time periods. Also, we propose a forecasting model for new flows while considering the characteristics of the multi-period optimization model.Building a forecasting model requires defining the data before considering any forecasting method. In other words, we have to choose the parameters of the forecasting model, namely the appropriate historical data, the forecasting time step and the forecasting horizon. The challenge is to define the parameters of the forecasting model which agree with the functioning the multi-period optimization model.Furthermore, a feature of the marketplace is the temporality of its system. Thus, we propose an algorithm ensuring real-time aspect and so the fact that assignments are made every minute. The proposed algorithm works continuously all day long while optimizing every instant the offer/demand adequacy of Internet prospects and instantly considering the continuous flux of Internet prospects as well as the regular updating demand. Finally, in order to show the efficiency and the benefits that the marketplace can reap by the use of the proposed models, we conducted tests and various experiments on real data. These tests have allowed us to validate the proposed models and evaluate the quality of the results.The aim is twofold, giving a strong and formal framework to address the issue of the marketplace of Internet prospects but also proposing a generic framework to solve any problem similar to that of the marketplace of Internet prospects
Karabulut, Ozlem. "Multi Resource Agent Bottleneck Generalized Assignment Problem." Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/3/12611790/index.pdf.
#945
approximation algorithm. Our computational results have revealed that these procedures can find high quality solutions to large sized instances very quickly.
Hjorth, Christoffer. "Revisors uppdragstid och dess betydelse för en revisors oberoendeställning i mindre bolag : En kvalitativ studie om revisorns oberoendeställning." Thesis, Högskolan i Skövde, Institutionen för handel och företagande, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-20555.
In Sweden, general and public companies' total assignment time for an auditor is limited through a several of legal provisions and continuous auditors and agency rotations. However, smaller limited companies in Sweden often end up outside these regulations, which results in the individual auditor needs to be largely based on principle-based regulations for difficult trade-offs. The principle-based regulations have been the subject of change in recent years, as assignment times are usually considerably longer in smaller companies towards large companies. This creates a space for maneuver that places higher demands that the auditor acts along a moral level that fits the profession to fulfill the integrity and objectivity to which the profession requires, as well as to avoid the fact that the independence is affected or criticized by society. The purpose of the study was to qualitatively investigate how different auditors perceive the problem of independence, which is associated with the mission time. Resultatet visar att det finns vissa skillnader i hur revisorer ser på problematiken gällande oberoende förknippad till uppdragstiden, eftersom de som ingick i studien resonerade utifrån olika etiska perspektiv samt olika nivåer av moral. Men i slutändan hade de liknande uppfattningar kring detta område. By identifying auditors' individual perceptions of integrity, objectivity and their independence has done it possible to analyses what kind of affections their ethical perspective and level of moral has, by other words does this study explains how auditors' independence can getting affected by designed assignment time in smaller companies. The result shows that there are some differences in how auditors look at the problems regarding independence associated to designed assignment time for smaller companies, since the auditors' that were included in this study reasoned based on different ethical perspective and levels of morality. But in the end did they have similar perceptions regarding this area.
Freeman, Tommie Austin. "Development and application of a multi-period project selection and engineering staffing model including options for alternative assignments and personnel reductions." Ann Arbor, Mich. : ProQuest, 2008. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3303586.
Title from PDF title page (viewed Mar. 16, 2009). Source: Dissertation Abstracts International, Volume: 69-03, Section: B, page: 1872. Adviser: Jeffery L. Kennington. Includes bibliographical references.
Petersen, Petra Elisabeth. "An investigation of genetic and reproductive differences between Faroe Plateau and Faroe Bank cod (Gadus morhua L.)." Thesis, University of Stirling, 2014. http://hdl.handle.net/1893/21613.
Chen, Guo Long, and 陳國龍. "Priority assignment period and control in ATM network." Thesis, 1995. http://ndltd.ncl.edu.tw/handle/01724316690651694139.
Chen, Kuo-lung, and 陳國龍. "PRIORITY ASSIGNMENT PERIOD AND CONTROL IN ATM NETWORK." Thesis, 1995. http://ndltd.ncl.edu.tw/handle/98445152806963162464.
國立交通大學
資訊工程研究所
83
The asynchronous transfer mode (ATM) network will provide a wide range of multimedia services with diversified traffic flow; such as text, image, voice and video etc. As the QOS requirements of these traffic type are all different, it is an important subject how to quarantee the QOS and promote the link utilization, where the QOS is mainly measured in maximum delay time and maximum cell lose rate. The thesis develops a chapter to survey the principle of flow control and to understand the processing scheme of flow control in ATM network. Besides, a QOS control method named priority assignment control scheme is presented, and it is used to quarantee the QOS and to improve the link utilization. Under a required condition of maximum delay time for various traffic type, the effect of different priority assignment period on the cell lose probability is the major studing scope in the thesus and finally a method for priority scheduling in each cell slot named golden ratio scheduling scheme is developed.
Sung, Je-Yi, and 宋哲毅. "A Multi-Project Selections, Multi-Period Assignment Model with a Case Study of NTC." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/29222054059017402566.
國立中央大學
資訊管理研究所
97
In contemporary business era, organizations’ information service departments (IT departments) often deal with tremendous and continuous requests of ad-hoc information systems and maintenance. With limited human resources how to effectively select projects and assign human resources to selected projects has become a critical issue to IT departments. Unlike one-time, single project planning, IT departments also need to re-plan project assignments for not only the new projects of current period and the accumulated effects of existing projects from previous periods. In this regard, this research proposes a decision support model, named MPP model, to help IT departments handle multi-projects selection with multi-periods re-planning. The MPP contains a decision process that applies and implements the DAR from CMMI for guiding the entire project selection and assignment. MPP also includes a binary-integer OR programming optimization algorithm for stakeholders to effectively handling multi-periods re-planning issue. To demonstrate the proposed work, this research reports a business case as a real use of MPP in the IT department of Nanya Technology Corporation, Taiwan. Several use cases and analyses are provided in this study. Validity examinations for the real company case and the limitations due to the current development of MPP are discussed as well.
Jiang, Shuhua, and 姜淑華. "The Problem of Optimal Time Period Assignment in TDMA Multihop Ad Hoc Networks and Its Solutions." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/78010748906485312509.
長庚大學
資訊工程研究所
94
This article discuss an issue that how to make a good decision of allocation of optimal time period. According to the mean data arrival rate and the number of nodes which limited in the finite buffer, the produced and consumed packets of all nodes are considered. However, the slots could be reused by the nodes without three hops from the transmitter. By these consideration, the suitable time period for nodes within three hops can be calculated. Finally, the analysis and the simulation could show that the time period suits the nodes within three hops and reach the better performance.
Yang, Jr-Wei, and 楊志偉. "Pole Assignment Problem for Discrete-Time Descriptor Systems with Period 3 by Derivative and Proportional State Feedback." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/57534156790815869435.
國立清華大學
數學系
91
In this paper we investigate the pole assignment problem for discrete-time descriptor systems with period 3 by derivative and proportional state feedback. The results in this paper are quote from [3], [8] and [16], respectively. In section 1 we review the definitions and results of the descriptor system with period 1. In section 2 we introduce the definitions of the descriptor systems with period 3. In section 3 we introduce some notations and examine how the response of the periodic descriptor systems depend on the eigenstructure of the associated periodic matrix pairs {(E_j,A_j)}_{j=1}^{3}, that is (2.3). Definitions of complete and strong reachability are given and the significance of these conditions are discussed. In section 4 we present an algorithm to reduce the periodic matrix triples {E_j,A_j,B_j}_{j=1}^{3} into canonical forms by using orthogonal and elementary matrix transformations. In section 5 we shown that a periodic descriptor systems that is strongly reachable can be transformed into a regular systems and of index at most 1 by derivative and proportional state feedback. In section 6 applications to the pole assignment problem are discussed, this is our main result of this paper. The extend to which the poles can be assigned by derivative and proportional state feedback whilst retaining regularity is examined under the different reachability conditions.
Книги з теми "Assignment period":
Pradhan, Eva. An assignment on factors influencing care seeking and the choice of health service providers during pregnancy, delivery, and postnatal period among rural women. Udaipur: Health Unit, Seva Mandir, 2005.
United States. National Aeronautics and Space Administration., ed. Short period Type II Cepheids: Final report for contract NAS5-32081, task assignment 4109. [Washington, DC: National Aeronautics and Space Administration, 1996.
United States. National Aeronautics and Space Administration., ed. Short period Type II Cepheids: Final report for contract NAS5-32081, task assignment 4109. [Washington, DC: National Aeronautics and Space Administration, 1996.
Pascal, Pichonnaz. Ch.8 Set-off, Introduction to Chapter 8 of the PICC. Oxford University Press, 2015. http://dx.doi.org/10.1093/law/9780198702627.003.0163.
Francesca, Mazza. Ch.9 Assignment of rights, transfer of obligations, assignment of contracts, s.3: Assignment of contracts, Art.9.3.1. Oxford University Press, 2015. http://dx.doi.org/10.1093/law/9780198702627.003.0193.
Francesca, Mazza. Ch.9 Assignment of rights, transfer of obligations, assignment of contracts, s.1: Assignment of rights, Art.9.1.12. Oxford University Press, 2015. http://dx.doi.org/10.1093/law/9780198702627.003.0181.
Marcus, Smith, and Leslie Nico. Part IV Intangible Property that is Incapable of Transfer, 23 The Assignment of Bare Rights to Litigate: Champerty and Maintenance. Oxford University Press, 2018. http://dx.doi.org/10.1093/law/9780198748434.003.0023.
Caps, John. Stolen Moments. University of Illinois Press, 2017. http://dx.doi.org/10.5406/illinois/9780252036736.003.0015.
Boyd Maunsell, Jerome. My life being so difficult a one to live. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198789369.003.0008.
Francesca, Mazza. Ch.9 Assignment of rights, transfer of obligations, assignment of contracts, s.2: Transfer of obligations, Art.9.2.1. Oxford University Press, 2015. http://dx.doi.org/10.1093/law/9780198702627.003.0185.
Частини книг з теми "Assignment period":
Mabed, Hakim, Alexandre Caminada, and Jin-Kao Hao. "Multi-period Channel Assignment." In Personal Wireless Communications, 541–54. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-39867-7_53.
Ackermann, Jürgen. "Controllability, Choice of Sampling Period and Pole Assignment." In Sampled-Data Control Systems, 173–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/978-3-642-82554-5_4.
Ryu, Minsoo, and Seongsoo Hong. "A Period Assignment Algorithm for Real-Time System Design." In Tools and Algorithms for the Construction and Analysis of Systems, 34–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-49059-0_3.
Morito, Susumu, Yuho Takehi, Jun Imaizumi, and Takayuki Shiina. "Optimization Models for Multi-period Railway Rolling Stock Assignment." In Lecture Notes in Computer Science, 393–402. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-45587-7_34.
Zhu, F., J. Li, and G. Li. "An Efficient Deadline and Period Assignment Scheme for Maintaining Temporal Consistency Under EDF." In Proceedings of the International Conference on Human-centric Computing 2011 and Embedded and Multimedia Computing 2011, 351–64. Dordrecht: Springer Netherlands, 2011. http://dx.doi.org/10.1007/978-94-007-2105-0_32.
Hlaoittinun, Onanong, Eric Bonjour, and Maryvonne Dulmet. "Managing the Competencies of Team Members in Design Projects through Multi-period Task Assignment." In IFIP Advances in Information and Communication Technology, 338–45. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15961-9_40.
Ghali, M. O., and M. J. Smith. "Approximation to Optimal Dynamic Traffic Assignment of Peak Period Traffic to a Congested City Network." In Urban Traffic Networks, 251–69. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/978-3-642-79641-8_10.
Levin, Carole. "T-shirt Day, Utopia and Henry VIII’s Dating Service: Using Creative Assignments to Teach Early Modern History." In Teaching the Early Modern Period, 218–21. London: Palgrave Macmillan UK, 2011. http://dx.doi.org/10.1057/9780230307483_19.
"Written Assignment for Work Placement Period 2." In Inside the New University: Prerequisites for a Contemporary Knowledge Production, edited by Anders Eklann and Bengt Kjellén, 238–39. BENTHAM SCIENCE PUBLISHERS, 2013. http://dx.doi.org/10.2174/9781608057269113010016.
Lott, Jessica L., and Jennifer L. Sullivan. "Authentic learning in cultural anthropology: Editing Wikipedia for real-world impact." In Wikipedia and Academic Libraries. Michigan Publishing, 2021. http://dx.doi.org/10.3998/mpub.11778416.ch5.en.
Тези доповідей конференцій з теми "Assignment period":
Verhaegh, Wim F. J., Emile H. L. Aarts, and Paul C. N. van Gorp. "Period assignment in multidimensional periodic scheduling." In the 1998 IEEE/ACM international conference. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/288548.289090.
Bini, Enrico, and Anton Cervin. "Delay-Aware Period Assignment in Control Systems." In 2008 IEEE 29th Real-Time Systems Symposium (RTSS). IEEE, 2008. http://dx.doi.org/10.1109/rtss.2008.45.
Moraes, Vitor M., Marc Jungers, Ubirajara F. Moreno, and Eugenio B. Castelan. "Sampling period assignment: A cooperative design approach." In 2014 IEEE 53rd Annual Conference on Decision and Control (CDC). IEEE, 2014. http://dx.doi.org/10.1109/cdc.2014.7040069.
Bhattacharya, Subhrajit, Sujit Dey, and Franc Brglez. "Clock period optimization during resource sharing and assignment." In the 31st annual conference. New York, New York, USA: ACM Press, 1994. http://dx.doi.org/10.1145/196244.196346.
Luo, L., Z. Zhang, and Y. Yin. "Seru loading with worker-operation assignment in single period." In 2016 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). IEEE, 2016. http://dx.doi.org/10.1109/ieem.2016.7798039.
Fadda, Edoardo, Dario Mana, Guido Perboli, and Roberto Tadei. "Multi Period Assignment Problem for Social Engagement and Opportunistic IoT." In 2017 IEEE 41st Annual Computer Software and Applications Conference (COMPSAC). IEEE, 2017. http://dx.doi.org/10.1109/compsac.2017.173.
Kim, Jeaong-ah, Yeong-ho Jean, and Hong-seong Park. "Period Assignment and Optimal Scheduling for Zigbee-based sensor networs." In 2006 SICE-ICASE International Joint Conference. IEEE, 2006. http://dx.doi.org/10.1109/sice.2006.315744.
Roy, Abhishek, Hakan Aydin, and Dakai Zhu. "On Task Period Assignment in Multiprocessor Real-Time Control Systems." In RTNS '16: 24th International Conference on Real-Time Networks and Systems. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2997465.2997469.
Niyizamwiyitira, Christine, and Lars Lundberg. "Period assignment in real-time scheduling of multiple virtual machines." In MEDES '15: The 7th International Conference on Management of computational and collective IntElligence in Digital EcoSystems. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2857218.2857262.
Liu, Jiankang, Yunzhong Fu, Chuanwei Chen, and Hongya Fu. "A Period Assignment Method for Fixed Priority Preemptive Real-time Systems." In the 2016 8th International Conference. New York, New York, USA: ACM Press, 2016. http://dx.doi.org/10.1145/3012258.3012275.
Звіти організацій з теми "Assignment period":
Beuermann, Diether, Nicolas L. Bottan, Bridget Hoffmann, C. Kirabo; Jackson, and Diego A. Vera-Cossio. Does Education Prevent Job Loss during Downturns?: Evidence from Exogenous Schools Assignments and COVID-19 in Barbados. Inter-American Development Bank, September 2021. http://dx.doi.org/10.18235/0003624.