Geographic Information Systems (GIS) often require complex Application programming Interface (API) interactions that are not easily accessible to non-technical users. This research proposes a proof-of-concept system t...
详细信息
Today, school students are first introduced to geom-etry and advanced mathematical concepts by plotting a graph in 2D and they struggle with 3D concepts since current technologies are either too difficult to grasp or ...
详细信息
This paper presents a new software module for creating 3D-printed rings. The program operates within the AutoCAD environment and automatically generates 3D objects based on user-input information via dialog boxes. The...
详细信息
This study seeks to investigate the effects of web-based computerprogramming learning, equipped with Questions and Answers, on students whose majors are not computerscience. The proposed system allows five types of ...
详细信息
ISBN:
(纸本)9781538674475
This study seeks to investigate the effects of web-based computerprogramming learning, equipped with Questions and Answers, on students whose majors are not computerscience. The proposed system allows five types of questions to be generated: essay, multiple-choice, fill-in-the-blank, true-false, and coding. It is found that spending time to complete given tasks by interacting with questions is a significant predictor. Furthermore, academic performance is significantly correlated with participating in fill-in-the-blank, essay, and coding questions. Findings are also stated that there were no differences between academic performance and engagement regarding gender.
Many educators provide introductory programming instruction that includes brief programs that seek to illuminate some aspect of programs or programming. We refer to these brief programs as ''Great Examples....
详细信息
ISBN:
(纸本)9798400705328
Many educators provide introductory programming instruction that includes brief programs that seek to illuminate some aspect of programs or programming. We refer to these brief programs as ''Great Examples.'' In this tutorial, educators will share ''Great Examples'' from their classroom, discuss challenges students face that motivate specific ''Great Examples'', and collaboratively draft heuristics for developing and evaluating new ''Great Examples''. This builds upon Colleen Lewis' co-development of fifty ''Great Examples'' for Java (https://***/3DJavaResources and available from https://***/3D). This session will discuss ''Great Examples'' for learning goals from introductory programming in any language. The existing examples were co-developed with high-school teachers, and they focus on using 3D models to address learning goals from an introductory Java course taught in high schools in the US (i.e., APCSA). The goal of the tutorial is for participants to take away (a) additional ''Great Examples'' they can use in their classroom, (b) plans for how they can use formative evaluation to improve their ''Great Examples'' and better understand students' learning, (c) insights into the strengths and weaknesses of decontextualized examples, (d) additional knowledge of conceptual challenges in intro programming and common misconceptions, and (e) community with colleagues passionate about effective teaching!
Traditional big data frameworks fail to take full advantage of the high computing power of hardware accelerators, and hardware accelerators lack the capability of big data frameworks such as Flink in terms of iterativ...
详细信息
We consider the class of disjoint bilinear programs max {x(T) y vertical bar x is an element of X, y is an element of Y} where X and Y are packing polytopes. We present an O(log log m(1)/log m(1) log log m(2)/log m(2)...
详细信息
ISBN:
(数字)9783031069017
ISBN:
(纸本)9783031069017;9783031069000
We consider the class of disjoint bilinear programs max {x(T) y vertical bar x is an element of X, y is an element of Y} where X and Y are packing polytopes. We present an O(log log m(1)/log m(1) log log m(2)/log m(2))-approximation algorithm for this problem where m(1) and m(2) are the number of packing constraints in X and Y respectively. In particular, we show that there exists a near-optimal solution (x, y) such that x and y are "near-integral". We give an LP relaxation of this problem from which we obtain the nearoptimal near-integral solution via randomized rounding. As an application of our techniques, we present a tight approximation for the two-stage adjustable robust optimization problem with covering constraints and right-hand side uncertainty where the separation problem is a bilinear optimization problem. In particular, based on the ideas above, we give an LP restriction of the two-stage problem that is an O(log n/log log n log L/log log L)-approximation where L is the number of constraints in the uncertainty set. This significantly improves over state-of-the-art approximation bounds known for this problem.
In today's dynamic and rapidly evolving business landscape, collaborative supply chain management has become a research hotspot in enterprise management. This paper aims to develop a comprehensive supply chain col...
详细信息
The Liquid Argon Time Projection Chamber (LArTPC) technology is widely used in high energy physics experiments, including the upcoming Deep Underground Neutrino Experiment (DUNE). Accurately simulating LArTPC detector...
详细信息
The Liquid Argon Time Projection Chamber (LArTPC) technology is widely used in high energy physics experiments, including the upcoming Deep Underground Neutrino Experiment (DUNE). Accurately simulating LArTPC detector responses is essential for analysis algorithm development and physics model interpretations. Accurate LArTPC detector response simulations are computationally demanding, and can become a bottleneck in the analysis workflow. Compute devices such as General-Purpose Graphics Processing Units (GPGPUs) have the potential to substantially accelerate simulations compared to traditional CPU-only processing. The software development for these compute accelerators often carries the cost of specialized code refactorization and porting to match the target hardware architecture. With the rapid evolution and increased diversity of the computer architecture landscape, it is highly desirable to have a portable solution that also maintains reasonable performance. We report our ongoing effort in evaluating Kokkos as a basis for this portable programming model using LArTPC simulations in the context of the Wire-Cell Toolkit, a C++ library for LArTPC simulations, data analysis, reconstruction and visualization.
Organizations require advanced methods to manage their business, remain competitive and maintain efficient information systems to handle constant change. The method of alignment harmonizes an information system's ...
详细信息
暂无评论