Relevant bibliographies by topics / Online problems

Academic literature on the topic 'Online problems'

Author: Grafiati
Published: 8 June 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Online problems.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Journal articles on the topic "Online problems":

1

ANDREESCU, Prof Cristina Veronica. "ONLINE EDUCATION - PROBLEMS AND SOLUTIONS." Pro Edu. International Journal of Educational Sciences 3, no. 4 (January 27, 2021): 49–61. http://dx.doi.org/10.26520/peijes.2021.4.3.49-61.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
The online platforms have been in a continuous development since the beginning of their appearance, being classified according to the field of activity. This article discusses some features of the online educational platforms, that serve the distance learning adopted during this pandemic period by the majority of nations on the planet, to continue the educational progress, at all levels of learning. The article is intended exclusively for the platforms used at the pre-university level of education and illustrates theoretical notions about them, represented by typologies, characteristics, and the features that platforms have been applying. The online platforms, as any other software device, possess advantages and also limitations of the available functions, and this article illustrates their approach in the context of the formative type of assessments, as well as of the summative ones. The effects of using these platforms are highlighted by using the questionnaire survey. This has the final aim to identify the perceptions of the respondents on the use of the online educational platforms for conveying the school information and also to identify the psycho-social aspects that this approach entails. At the end of the article the results of students' attendance at the online courses are presented, results that were collected based on the monitoring study conducted on a sample of students.
2

Chrobak, Marek. "Online aggregation problems." ACM SIGACT News 45, no. 1 (March 17, 2014): 91–102. http://dx.doi.org/10.1145/2596583.2596603.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Downey, Rodney G., and Catherine McCartin. "Online promise problems with online width metrics." Journal of Computer and System Sciences 73, no. 1 (February 2007): 57–72. http://dx.doi.org/10.1016/j.jcss.2006.08.002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cherednichenko, Maria, Ekaterina Efimova, and Viktor Krasnitskiy. "Online stores taxation problems." Proceedings of the Kuban State Agrarian University 1, no. 63 (2016): 47–52. http://dx.doi.org/10.21515/1999-1703-63-47-52.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Abler, Barbara M. "Analytical problems — online solutions☆." TrAC Trends in Analytical Chemistry 6, no. 3 (March 1987): IV—IX. http://dx.doi.org/10.1016/0165-9936(87)87017-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

NISTOR, Denisa-Georgiana, and Ioana STĂNCESCU. "ONLINE SCHOOL BETWEEN PROBLEMS AND SOLUTIONS. THE STUDENTS’ PERSPECTIVE." Pro Edu. International Journal of Educational Sciences 4, no. 7 (June 27, 2022): 28–45. http://dx.doi.org/10.26520/peijes.2022.7.4.28-45.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
The pandemic situation brought significant changes regarding the teaching activities, led to the emergency transition to the online system and with it, multiple challenges, both for teachers and students.The students, the main beneficiaries of the online lectures and seminar activities, understood that they have a greater responsibility in learning than before they had and that if they are not fully involved in teaching activities, they will not be able to achieve the desired results. In this context, we considered it necessary to identify and analyze the students' perspective in relation to their experience related to the online school. Thus, a micro-research was carried out, the purpose of which is to analyze the students' opinions regarding the lectures, respectively the online seminars during the pandemic, related to the following aspects: the vertical and horizontal educational relations; the teaching strategies used during classes, the seminars; the students 'access to support materials, the emotional feelings and students' motivation, the difficulties encountered during the period in which the lectures and seminars took place online. The main research method was the questionnaire survey. The target group consisted of students from Valahia University of Târgoviște, Faculty of Political Sciences, Letters and Communication, from all years of study, undergraduate and master's degree programs. The results show that students are aware of both the limits of online teaching activities (stress, numerous tasks and homework, connection issues, etc.), but also their benefits (quick and easy access to information resources, development of digital skills, participation in teaching activities from the comfort of your own home, etc.).
7

Bampis, Evripidis, Bruno Escoffier, Kevin Schewior, and Alexandre Teiller. "Online Multistage Subset Maximization Problems." Algorithmica 83, no. 8 (May 25, 2021): 2374–99. http://dx.doi.org/10.1007/s00453-021-00834-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

MARTYNENKO, ELENA. "SOME PROBLEMS OF ONLINE EDUCATION." World of academia: Culture, Education, no. 5 (July 7, 2021): 85–89. http://dx.doi.org/10.18522/2658-6983-2021-5-85-89.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Paolini, Christopher, Subrata Bhattacharjee, William F. Coleman, and Edward W. Fedosky. "Solving Chemical Equilibrium Problems Online." Journal of Chemical Education 87, no. 4 (April 2010): 456. http://dx.doi.org/10.1021/ed800134r.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bonifaci, Vincenzo, and Leen Stougie. "Online k-Server Routing Problems." Theory of Computing Systems 45, no. 3 (February 14, 2008): 470–85. http://dx.doi.org/10.1007/s00224-008-9103-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources
You might also be interested in the extended bibliographies on the topic 'Online problems' for particular source types:
Journal articles Dissertations / Theses Books

Dissertations / Theses on the topic "Online problems":

1

Lu, Xin Ph D. Massachusetts Institute of Technology Operations Research Center. "Online optimization problems." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/82724.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2013.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 149-153).
In this thesis, we study online optimization problems in routing and allocation applications. Online problems are problems where information is revealed incrementally, and decisions must be made before all information is available. We design and analyze algorithms for a variety of online problems, including traveling salesman problems with rejection options, generalized assignment problems, stochastic matching problems, and resource allocation problems. We use worst case competitive ratios to analyze the performance of proposed algorithms. We begin our study with online traveling salesman problems with rejection options where acceptance/rejection decisions are not required to be explicitly made. We propose an online algorithm in arbitrary metric spaces, and show that it is the best possible. We then consider problems where acceptance/rejection decisions must be made at the time when requests arrive. For dierent metric spaces, we propose dierent online algorithms, some of which are asymptotically optimal. We then consider generalized online assignment problems with budget constraints and resource constraints. We first prove that all online algorithms are arbitrarily bad for general cases. Then, under some assumptions, we propose, analyze, and empirically compare two online algorithms, a greedy algorithm and a primal dual algorithm. We study online stochastic matching problems. Instances with a fixed number of arrivals are studied first. A novel algorithm based on discretization is proposed and analyzed for unweighted problems. The same algorithm is modified to accommodate vertex-weighted cases. Finally, we consider cases where arrivals follow a Poisson Process. Finally, we consider online resource allocation problems. We first consider the problems with free but fixed inventory under certain assumptions, and present near optimal algorithms. We then relax some unrealistic assumptions. Finally, we generalize the technique to problems with flexible inventory with non-decreasing marginal costs.
by Xin Lu.
Ph.D.
2

San, Felice Mário César 1985. "Online facility location and Steiner problems = Problemas online de localização de instalações e de Steiner." [s.n.], 2015. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275552.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Orientador: Orlando Lee
Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação
Made available in DSpace on 2018-08-27T12:18:11Z (GMT). No. of bitstreams: 1 SanFelice_MarioCesar_D.pdf: 1457706 bytes, checksum: 4813f4ed44c52462656d56537d73d5dc (MD5) Previous issue date: 2015
Resumo: Nesta tese estudamos problemas online das famílias de localização de instalações e de Steiner, através da abordagem de análise competitiva. O objetivo nestes problemas é construir uma rede de custo mínimo para atender a uma determinada demanda. Nós apresentamos resultados conhecidos para o problema Online da Localização de Instalações (OFL), o problema Online da Árvore de Steiner (OST) e o problema Online Single-Source Rent-or-Buy (OSRoB). O OFL consiste em atender a um conjunto de clientes, através da abertura de algumas instalações e da conexão de cada cliente com uma instalação aberta. O OST tem por objetivo conectar um conjunto de terminais utilizando uma árvore, que pode conter vértices não terminais, chamados vértices de Steiner. O OSRoB é uma versão rent-or-buy do OST, onde todos os terminais devem ser conectados a um nó especial chamado raíz. Os algoritmos e técnicas que apresentamos para estes problemas são importantes no desenvolvimento dos nossos algoritmos para os problemas que consideramos. Apresentamos novos resultados para o problema Online da Localização de Instalações com Coleta de Prêmios (OPFL), o problema Online da Árvore Estrela de Steiner (OSTS), e o problema Online da Localização de Instalações Conectadas (OCFL). O OPFL é uma generalização do OFL, em que alguns clientes podem ficar desconectados mediante o pagamento de penalidades. O OSTS é uma variante do OST, em que os vértices possuem custos não negativos. O OCFL é uma combinação do OFL e do OST, em que um conjunto de clientes precisa ser atendido através da abertura de algumas instalações, da conexão de cada cliente com uma instalação aberta, e da construção de uma árvore, mais custosa, que conecta as instalações abertas
Abstract: In this thesis we study online problems from the facility location and Steiner families, through the point of view of competitive analysis. The goal in these problems is to build a minimum cost network to attend a certain demand. We present known results for the Online Facility Location problem (OFL), the Online Steiner Tree problem (OST) and the Online Single-Source Rent-or-Buy problem (OSRoB). The OFL consists of serving a set of clients by opening some facilities and by connecting each client to a facility. The OST aims to connect a set of terminals in order to create a tree network, that may contain nonterminals, called Steiner nodes. The OSRoB is a rent-or-buy version of the OST, in which all terminals must be connected to a special node called root. The algorithms and techniques that we present for these problems play an important role in the design of our algorithms for the problems we consider. We present new results for the Online Prize-Collecting Facility Location problem (OPFL), the Online Steiner Tree Star problem (OSTS), and the Online Connected Facility Location problem (OCFL). The OPFL is a generalization of the OFL, in which some clients may be left unconnected by paying a penalty. The OSTS is a variant of the OST, in which the nodes have non-negative costs. The OCFL is a combination of the OFL and the OST, in which a set of clients needs to be served by opening some facilities, by connecting each client to a facility, and by creating a more expensive tree network that connects the open facilities
Doutorado
Ciência da Computação
Doutor em Ciência da Computação
3

Winter, Thomas. "Online and real-time dispatching problems." [S.l. : s.n.], 1999. http://deposit.ddb.de/cgi-bin/dokserv?idn=958326584.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Asan, N. Evren. "Offline And Online Disk Scheduling Problems." Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607909/index.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
This thesis considers the disk scheduling problem. The problem is investigated in two types of settings: offline and online. We first adopt the traveling salesman problem with time windows in the scheduling literature for solving the offline problem. Then we develop a decision epoch scheme in which offline problems are iteratively used in solving the online problem. We perform an experimental study for our approach and two well-known disk scheduling algorithms, and compare them according to several performance criteria.
5

Charalambous, George. "Online and verification problems under uncertainty." Thesis, University of Leicester, 2016. http://hdl.handle.net/2381/38096.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
In the under uncertainty setting we study problems with imprecise input data for which precise data can be obtained. There exists an underlying problem with a feasible solution, but is computable only if the input is precise enough. We are interested in measuring how much of the imprecise input data has to be updated in order to be precise enough. We look at the problem for both the online and the offline (verification) cases. In the verification under uncertainty setting an algorithm is given imprecise input data and also an assumed set of precise input data. The aim of the algorithm is to update the smallest number of input data such that if the updated input data is the same as the corresponding assumed input data (i.e. verified), a solution for the underlying problem can be calculated. In the online adaptive under uncertainty setting the task is similar except the assumed set of precise data is not given to the algorithm, and the performance of the algorithm is measured by comparing the number of input data that have been updated against the result obtained in the verification setting of the same problem. We have studied these settings for a few geometric and graph problems and found interesting results. Geometric problems include several variations of the maximal points problem where, in its classical form, given a set of points in the plane we want to compute the set of all points that are maximal. The uncertain element here is the actual location of each point. Graph problems include a few variations of the graph diameter problem where, in its classical form, given a graph we want to calculate a farthest pair of vertices. The uncertain element is the weight of each edge.
6

Clements, Andrea D., and Steve Cockerham. "Problems (and solutions) in Online Teaching." Digital Commons @ East Tennessee State University, 2001. https://dc.etsu.edu/etsu-works/7310.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kobayashi, Koji. "Competitive Analysis of Online Problems on Networks." 京都大学 (Kyoto University), 2009. http://hdl.handle.net/2433/123835.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kleinberg, Robert David. "Online decision problems with large strategy sets." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/33092.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2005.
Includes bibliographical references (p. 165-171).
In an online decision problem, an algorithm performs a sequence of trials, each of which involves selecting one element from a fixed set of alternatives (the "strategy set") whose costs vary over time. After T trials, the combined cost of the algorithm's choices is compared with that of the single strategy whose combined cost is minimum. Their difference is called regret, and one seeks algorithms which are efficient in that their regret is sublinear in T and polynomial in the problem size. We study an important class of online decision problems called generalized multi- armed bandit problems. In the past such problems have found applications in areas as diverse as statistics, computer science, economic theory, and medical decision-making. Most existing algorithms were efficient only in the case of a small (i.e. polynomial- sized) strategy set. We extend the theory by supplying non-trivial algorithms and lower bounds for cases in which the strategy set is much larger (exponential or infinite) and the cost function class is structured, e.g. by constraining the cost functions to be linear or convex. As applications, we consider adaptive routing in networks, adaptive pricing in electronic markets, and collaborative decision-making by untrusting peers in a dynamic environment.
by Robert David Kleinberg.
Ph.D.
9

Daly, Katharine M. "Hand-drawn graph problems in online education." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/100303.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 104-106).
Machine-gradable assessments in online education platforms are currently limited to questions that require only keyboard or mouse input, and grading efforts generally focus only on final answers. Some types of problems in the science, technology, engineering, and math (STEM) domain, however, are most naturally answered through sketches drawn with a pen. We introduce a simple graph problem type that accepts solutions drawn using a stylus as a proof-of-concept extension to online education platforms. Simple graphs have a small number of components (vertices, arrows, and edges only), and we describe a three-step recognition process consisting of segmentation, symbol classication, and domain interpretation for converting users' pen strokes into a simple graph object representation. An experiment run on Mechanical Turk demonstrates the usability of our trained, recognition-driven drawing interface, and examples of simple graph problems illustrate how course developers can not only check students' final answers but also provide students with intermediate feedback.
by Katharine M. Daly.
M. Eng.
10

Korolko, Nikita (Nikita E. ). "A robust optimization approach to online problems." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/112013.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2017.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 149-155).
In this thesis, we consider online optimization problems that are characterized by incrementally revealed input data and sequential irrevocable decisions that must be made without complete knowledge of the future. We employ a combination of mixed integer optimization (MIO) and robust optimization (RO) methodologies in order to design new efficient online algorithms that outperform state-of-the-art methods for many important practical applications. We empirically demonstrate that RO-based algorithms are computationally tractable for instances of practical size, generate more cost-effective decisions and can simultaneously model a large class of similar online problems due to exceptional modeling power of MIO. In Part I, we consider the well-known K-server problem from the perspective of robust adaptive optimization. We propose a new tractable mixed integer linear formulation of the K-server problem that incorporates both information from the past and uncertainty about the future. By combining ideas from classical online algorithms developed in the computer science literature and robust and adaptive optimization developed in the operations research literature we propose a new method that (a) is computationally tractable, (b) almost always outperforms all other methods in numerical experiments, and (c) is stable with respect to potential errors in the assumptions about the future. In Part II, we consider several extensions of the asset-based weapon-to-target assignment problem whose objective is to protect ships in a fleet from incoming threats. We demonstrate that the new highly nonlinear MIO formulation (a) can be combined with lazy constraints techniques allowing the system designer to find optimal solutions in real time, (b) can be extended to the multi-period setting, and (c) admits a decentralized solution with limited loss of optimality. In Part III, we present a novel covariate-adaptive optimization algorithm for online allocation in clinical trials. The new approach leveraging MIO and RO techniques (a) guarantees a better between-group covariate balance in comparison with state-of- the-art methods, (b) yields statistical power at least as high as, and sometimes significantly higher than, randomization-based algorithms, and (c) is well protected against selection, investigator and accidental bias.
by Nikita Korolko.
Ph. D.
More sources

Books on the topic "Online problems":

1

Young, Paul R. Organic chemistry online. Pacific Grove, CA: Brooks/Cole Pub. Co., 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wang, Xinshang. Online Algorithms for Dynamic Resource Allocation Problems. [New York, N.Y.?]: [publisher not identified], 2017.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kendall, Diana Elizabeth. Social problems in a diverse society online. Boston: Allyn and Bacon, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Greg, Francis, Neath Ian 1965-, and Sternberg Robert J, eds. CogLab: Online with access code, version 2.0. Australia: Thomson/Wadsworth, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

1955-, Roberts Tim S., ed. Student plagiarism in an online world: Problems and solutions. Hershey, PA: Information Science Reference, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

J, Sternberg Robert, ed. Cognitive psychology: CogLab : Wadsworth online laboratory - student manual. 2nd ed. Australia: Thomson/Wadsworth, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Polding, Liz. LPC skills online. Oxford: Oxford Institute of Legal Practice, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Polding, Liz. LPC skills online. Oxford: Oxford Institute of Legal Practice, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Organisation for Economic Co-operation and Development., ed. Promise and problems of e-democracy: Challenges of online citizen engagement. Paris: OECD, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bridges, John C. The illusion of intimacy: Problems in the world of online dating. Santa Barbara, Calif: Praeger, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Online problems":

1

Kalyanasundaram, Bala, and Kirk Pruhs. "On-line network optimization problems." In Online Algorithms, 268–80. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0029573.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Csirik, János, and Gerhard J. Woeginger. "On-line packing and covering problems." In Online Algorithms, 147–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0029568.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Krumke, Sven O., Rob van Stee, and Stephan Westphal. "Online Job Admission." In Fundamental Problems in Computing, 435–54. Dordrecht: Springer Netherlands, 2009. http://dx.doi.org/10.1007/978-1-4020-9688-4_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

El-Yaniv, Ran. "Competitive solutions for on-line financial problems." In Online Algorithms, 326–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0029576.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Panigrahi, Debmalya. "Online Node-Weighted Problems." In Encyclopedia of Algorithms, 1455–57. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_761.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Iwama, Kazuo, and Shiro Taketomi. "Removable Online Knapsack Problems." In Automata, Languages and Programming, 293–305. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45465-9_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Flammini, Michele, and Gaia Nicosia. "On Multicriteria Online Problems." In Algorithms - ESA 2000, 191–201. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-45253-2_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Panigrahi, Debmalya. "Online Node-Weighted Problems." In Encyclopedia of Algorithms, 1–4. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_761-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hřebíček, Jiří, and Jan Pešl. "Portfolio Problems — Solved Online." In Solving Problems in Scientific Computing Using Maple and MATLAB®, 451–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-642-18873-2_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Hillman, Daniel, Robert Schudy, and Anatoly Temkin. "Resolving technical problems in online courses." In Winning Online Instruction, 126–30. New York: Routledge, 2022. http://dx.doi.org/10.4324/9781003161288-13.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Online problems":

1

Zimakova, E. "LEARNING GERMAN ONLINE." In GERMAN IN BASHKORTOSTAN: PROBLEMS AND PROSPECTS. Baskir State University, 2022. http://dx.doi.org/10.33184/nyvb2022-2022-04-29.21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tiunova, M. "ONLINE MATHEMATICAL LOGIC TOOLS." In Modern problems of physics education. Baskir State University, 2021. http://dx.doi.org/10.33184/mppe-2021-11-10.154.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Vostrukhina, N. V. "COACHING AS SCIENTIFIC KNOWLEDGE: OVERVIEW ACTUAL PROBLEMS." In SCIENTIFIC AND PRACTICAL ONLINE CONFERENCE. Знание-М, 2020. http://dx.doi.org/10.38006/907345-57-7.45.49.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
в статье обсуждается вопрос отнесения коучинга к науке. Рассматриваются проблемы предмета, объекта, метода и методологии коучинга. Анализируются уже присущие коучингу характеристики, позволяющие отнести его к знанию научному. Обнаруживается предполагаемая зона ближайшего развития коучинга как молодой формирующейся науки.
4

Burt, Donald M. "PROBLEMS WITH TERRESTRIAL ANALOGS FOR IMPACT SEDIMENTATION ON MARS." In GSA 2020 Connects Online. Geological Society of America, 2020. http://dx.doi.org/10.1130/abs/2020am-350791.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Matamoros, Javier. "Asynchronous online ADMM for consensus problems." In 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2017. http://dx.doi.org/10.1109/icassp.2017.7953283.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ueoka, Yutaro, Kota Tsubouchi, and Nobuyuki Shimizu. "Tackling Cannibalization Problems for Online Advertisement." In UMAP '20: 28th ACM Conference on User Modeling, Adaptation and Personalization. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3340631.3394875.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Radhika, A. "Problems and prospects of online education." In CHEMISTRY BEYOND BORDERS: INTERNATIONAL CONFERENCE ON PHYSICAL CHEMISTRY: The 1st Annual Meeting of the Physical Chemistry Division of the Indonesian Chemical Society. AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0166325.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Vostrukhina, N. V. "PROBLEMS OF COACHING METHODOLOGY. SPEECH AS METHOD: SPECIFICATIONS, FEATURES." In SCIENTIFIC AND PRACTICAL ONLINE CONFERENCE. Знание-М, 2020. http://dx.doi.org/10.38006/907345-57-7.50.53.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
статья посвящена анализу проблем методологии коучинга, а также речи как метода коучинга, ее специфике и особенностям. Обсуждаются вопросы методологии гуманитарных наук, к коим коучинг относится. Раскрывается связь между речью в процессе коучинга и ожидаемыми результатами коучингового взаимодействия. Центральное место отведено анализу предпосылок применения различных речевых инструментов в коучинге.
9

Kudriashova, Malvina Valer'evna. "Current Problems of Justice Court’s Jurisdiction Over Civil Cases." In Internationa Extra-murral Online Conference. TSNS Interaktiv Plus, 2020. http://dx.doi.org/10.21661/r-497440.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pereselkina, Victoria Igorevna, and Evgeny Mikhailovich Zak. "Premises of appearing and development of socio-psychological and economical problems among students." In InternationalExtra-murral Online-conference. TSNS Interaktiv Plus, 2016. http://dx.doi.org/10.21661/r-113088.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Online problems":

1

Means, Barbara, and Julie Neisler. Unmasking Inequality: STEM Course Experience During the COVID-19 Pandemic. Digital Promise, August 2020. http://dx.doi.org/10.51388/20.500.12265/102.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
This report describes the experiences of over 600 undergraduates who were taking STEM courses with in-person class meetings that had to shift to remote instruction in spring 2020 because of COVID-19. Internet connectivity issues were serious enough to interfere with students’ ability to attend or participate in their STEM course at least occasionally for 46% of students, with 15% of students experiencing such problems often or very often. A large majority of survey respondents reported some difficulty with staying motivated to work on their STEM courses after they moved online, with 45% characterizing motivation as a major problem. A majority of STEM students also reported having problems knowing where to get help with the course content after it went online, finding a quiet place to work on the course, and fitting the course in with other family or home responsibilities. Overall, students who reported experiencing a greater number of major challenges with continuing their course after it went online expressed lower levels of satisfaction with their course after COVID-19. An exception to this general pattern, though, was found for students from minoritized race/ethnicity groups, females, and lower-income students. Despite experiencing more challenges than other students did with respect to continuing their STEM courses remotely, these students were more likely to rate the quality of their experiences when their STEM course was online as just as good as, or even better than, when the course was meeting in person.
2

Kitsa, Mariana, and Iryna Mudra. THE TOPIC OF WAR ON THE PAGES OF WOMEN’S ONLINE MEDIA (DUE TO THE RESULTS OF THE CONTENT ANALYSIS OF THE MATERIALS “UKRAINKA”, “4 MAMA”, “WONDER UKRAINE”, “SLUTCH.UA” AND “DIVOCHE. MEDIA”). Ivan Franko National University of Lviv, March 2024. http://dx.doi.org/10.30970/vjo.2024.54-55.12162.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Main objectives of the study. Women’s online media make up a significant part of the Ukrainian media market. There are online magazines, online newspapers, online sites of printed women’s publications on the Internet, and there are those resources that simply call themselves sites for women, but by all indications we can classify them as online media. The content of women’s mass media is mainly characterized by narrow thematic content, gender orientation, light and positive content. But on February 24, 2022, Russian troops invaded the territory of Ukraine on a full scale, and the content of many Ukrainian women’s online media also underwent changes. The topic of war appeared in the content of online media for women. However, some women’s online media haven`t changed their content and main topics. The purpose of the study is to show how women’s online media publish war-related material on their pages. The set goal involves solving the following tasks: to find out how are women’s Ukrainian online media functioning in 2022-2023; select those whose pages contain materials about the war; to analyze military-themed publications in women’s online media. The subject of the research is materials related to the Russian-Ukrainian war in women’s online media (“Ukrainki”, “4 Mama”, “Wonder Ukraine”, “Clutch.ua”, “Divoche. Media”) for 2022-2023. The novelty of the study is that for the first time the content of women’s online media (“Ukrainki”, “4 Mama”, “Wonder Ukraine”, “Clutch.ua”, “Divoche. Media”) on the topic of the war for 2022-2023 was investigated. Findings. It was examined that the genre palette of materials is diverse, but informational materials still predominate. In terms of topics, the following prevail: social and everyday problems, psychological problems, volunteering, military, activities of showbiz stars during the war, migration (refugees), occupation, stories from life, news of events from the life of the country and the world. Keywords: women’s magazines, online media for women, Russian-Ukrainian war, content, topic.
3

Panchenko, Liubov F., and Ivan O. Muzyka. Analytical review of augmented reality MOOCs. [б. в.], February 2020. http://dx.doi.org/10.31812/123456789/3750.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
The aim of the article is to provide an analytical review of the content of massive open online courses about augmented reality and its use in education with the further intent to create a special course for the professional development system for the research and teaching personnel in postgraduate education. The object of research is massive open online courses. The subject of the study is the structure and content of augmented reality MOOCs which are offered by acclaimed providers of the world. The methods of research are: the analysis of publications on the problem; the analysis of MOOCs’ content, including observation; systematization and generalization of research information in order to design a special course about augmented reality for the system of professional training and retraining for educators in postgraduate education. The results of the research are the following: the content and program of specialized course “Augmented Reality as a Storytelling Tool” for the professional development of teachers. The purpose of the specialized course is to consider and discuss the possibilities of augmented reality as a new direction in the development of educational resources, to identify its benefits and constraints, as well as its components and the most appropriate tools for educators, to discuss the problems of teacher and student co-creation on the basis of the use of augmented reality, and to provide students with personal experience in designing their own stories and methodical tools in the form of augmented books and supplementary training aids with the help of modern digital services.
4

Filiz, Ibrahim, Jan René Judek, Marco Lorenz, and Markus Spiwoks. Einhorn, Yeti, Nessie und der neoklassische Markt – Legenden und empirische Evidenz. Sonderforschungsgruppe Institutionenanalyse, 2022. http://dx.doi.org/10.46850/sofia.9783947850020.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
The neoclassical market model still has a decisive influence on important economic policy decisions today. A central role in this model is played by the formation of equilibrium prices, where aggregate supply functions and aggregate demand functions meet. We examine whether equilibrium prices are actually formed. For this purpose, we analyse 2,217 prices for homogeneous products that were collected by students between October 2020 and May 2022 in stationary and online retail. In 143 of 146 cases, no equilibrium price is found. The percentage price range is regularly over 100%. The presumed steering function of an equilibrium price does not materialise. The establishment of market mechanisms for the efficient solution of economic problems must therefore be questioned.
5

Liu, Xian-Liang, Tao Wang, Daniel Bressington, Bróna Nic Giolla Easpaig, Lolita Wikander, and Jing-Yu (Benjamin) Tan. Influencing factors and barriers to retention among regional and remote undergraduate nursing students in Australia: A systematic review of current research evidence. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, June 2022. http://dx.doi.org/10.37766/inplasy2022.6.0087.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Review question / Objective: To explore the attrition problems, influencing factors and barriers to retention among regional and remote nursing students who enrolled in the undergraduate programs in Australia. Condition being studied: Student retention concerns an individual’s commitment to an learning goal. Low student retention has been a long-standing issue for nursing programs and it is an important threat to the future nursing workforce. Attrition is measured by the number of students enrolled in the first year who do not complete their study in the following year. With the growth of online programs, the issue of high attrition raises concern for students enrolled in these programs. Moreover, the social context of students may influence positive motivation and affect their decision to stay in their nursing programs.
6

Backus, Matthew, Tom Blake, Dimitriy Masterov, and Steven Tadelis. Is Sniping A Problem For Online Auction Markets? Cambridge, MA: National Bureau of Economic Research, February 2015. http://dx.doi.org/10.3386/w20942.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Brown, Nicholas, Hannah Macdonell, Emilie Stewart-Jones, and Stephan Gruber. Permafrost Data Systems: RCOP 2021 Data Workshop Report. NSERC/Carleton University, November 2021. http://dx.doi.org/10.22215/pn/10121001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
NSERC PermafrostNet hosted a data systems workshop at the 2021 Regional Conference on Permafrost, held online in October 2021. The workshop featured invited speakers Ashley Rudy from the Northwest Territories Geological Survey and Jeanette Nötzli from the Swiss Permafrost Monitoring Network (PERMOS). Attendees participated in breakout rooms and plenary discussion to identify current problems and limitations with permafrost data systems and to recommend how efforts can be better connected or coordinated. The final report summarizes the conclusions and provides a record of the interactions and discussions that occurred. The workshop follows the 2020 Permafrost Data Workshop, which highlighted the importance of a community of practice and ongoing communication to improve the interoperability of permafrost data. In addition to the concrete objectives of identifying challenges and recommendations, the 2021 workshop was a way for members of the permafrost community to share ideas, and to cross-pollinate knowledge between sectors and disciplines of permafrost science.
8

Xourafi, Lydia, Polyxeni Sardi, and Anastasia Kostaki. Exploring psychological vulnerability and responses to the COVID-19 lockdown in Greece. Verlag der Österreichischen Akademie der Wissenschaften, July 2022. http://dx.doi.org/10.1553/populationyearbook2022.dat.5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
This study explores the psychosocial impact of the COVID-19 pandemic on the population in Greece during the general lockdown period. Specifically, depression, anxiety and stress scores, as well as the factors associated with vulnerability to developing mental health conditions during this period, were investigated. A total of 911 adults participated in an online survey by completing a self-reporting questionnaire that included demographic questions, DASS-42 items (anxiety, stress and depression scales) and other questions related to personal experience. Regression modelling uncovered a significant relationship between gender and DASS scores, with women having significantly higher scores than men for all mental health problems. Participants aged 20–39 years were especially vulnerable to experiencing poor mental health. Unemployed participants reported having worse mental health than others. Having more perceived psychosocial support during the pandemic was associated with lower overall scores. Thus, women, young adults and the unemployed exhibited particularly high levels of vulnerability, while individuals who received social support from relatives and friends during the lockdown were more resilient to the effects of social isolation.
9

Danylchuk, Hanna B., and Serhiy O. Semerikov. Advances in machine learning for the innovation economy: in the shadow of war. Криворізький державний педагогічний університет, August 2023. http://dx.doi.org/10.31812/123456789/7732.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
This preface introduces the selected and revised papers presented at the 10th International Conference on Monitoring, Modeling & Management of Emergent Economy (M3E2 2022), held online in Ukraine, on November 17-18, 2022. The conference aimed to bring together researchers, practitioners, and students from various fields to exchange ideas, share experiences, and discuss challenges and opportunities in applying computational intelligence and data science for the innovation economy. The innovation economy is a term that describes the emerging paradigm of economic development that is driven by knowledge, creativity, and innovation. It requires new approaches and methods for solving complex problems, discovering new opportunities, and creating value in various domains of science, business,and society. Computational intelligence and data science are two key disciplines that can provide such approaches and methods by exploiting the power of data, algorithms, models, and systems to enable intelligent decision making, learning, adaptation, optimization, and discovery. The papers in this proceedings cover a wide range of topics related to computational intelligence and data science for the innovation economy. They include theoretical foundations, novel techniques, and innovative applications. The papers were selected and revised based on the feedback from the program committe members and reviewers who ensured their high quality. We would like to thank all the authors who submitted their papers to M3E2 2022. We also appreciate the keynote speakers who shared their insights and visions on the current trends and future directions of computational intelligence and data science for the innovation economy. We acknowledge the support of our sponsors, partners, and organizers who made this conference possible despite the challenging circumstances caused by the ongoing war in Ukraine. Finally, we thank all the participants who attended the conference online and contributed to its success.
10

Kiianovska, N. M. The development of theory and methods of using cloud-based information and communication technologies in teaching mathematics of engineering students in the United States. Видавничий центр ДВНЗ «Криворізький національний університет», December 2014. http://dx.doi.org/10.31812/0564/1094.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
The purpose of the study is the analysis of the development of the theory and methods of ICT usage while teaching higher mathematics engineering students in the United States. It was determined following tasks: to analyze the problem source, to identify the state of its elaboration, to identify key trends in the development of theory and methods of ICT usage while teaching higher mathematics engineering students in the United States, the object of study – the use of ICT in teaching engineering students, the research methods are: analysis of scientific, educational, technical, historical sources; systematization and classification of scientific statements on the study; specification, comparison, analysis and synthesis, historical and pedagogical analysis of the sources to establish the chronological limits and implementation of ICT usage in educational practice of U.S. technical colleges. In article was reviewed a modern ICT tools used in learning of fundamental subjects for future engineers in the United States, shown the evolution and convergence of ICT learning tools. Discussed experience of the «best practices» using online ICT in higher engineering education at United States. Some of these are static, while others are interactive or dynamic, giving mathematics learners opportunities to develop visualization skills, explore mathematical concepts, and obtain solutions to self-selected problems. Among ICT tools are the following: tools to transmit audio and video data, tools to collaborate on projects, tools to support object-oriented practice. The analysis leads to the following conclusion: using cloud-based tools of learning mathematic has become the leading trend today. Therefore, university professors are widely considered to implement tools to assist the process of learning mathematics such properties as mobility, continuity and adaptability.

To the bibliography