• Research in Mathematical Education
• /
• 제16권3호
• /
• pp.155-176
• /
• 2012

It is an important issue to explore classroom environments which are conducive to developing students' mathematical performance. This study explores the effects of different classroom environments (solution-demand and corresponding-time setting) on mathematical performances. Fourteen and eighteen prospective teachers were required to prove a task under different conditions respectively: a) Cognitive demand of multiple-solution corresponding time of three hours, and b) Cognitive demand of a right solution corresponding time of 20 minutes. We used SOLO as the assessment tool for mathematical performance from quality perspective. Significant differences were found in the quantity and quality of mathematical performance. The regular environment focusing on speed and accuracy were found to be directly linked to low levels of performance. The findings above provide implications to the cognitive benefits of multiple-solution demand and corresponding time setting.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권4호
• /
• pp.1100-1122
• /
• 2023

Scheduling user-submitted cloud tasks to the appropriate virtual machine (VM) in cloud computing is critical for cloud providers. However, as the demand for cloud resources from user tasks continues to grow, current evolutionary algorithms (EAs) cannot satisfy the optimal solution of large-scale cloud task scheduling problems. In this paper, we first construct a large- scale multi-objective cloud task problem considering the time and cost functions. Second, a multi-objective optimization algorithm based on multi-factor optimization (MFO) is proposed to solve the established problem. This algorithm solves by decomposing the large-scale optimization problem into multiple optimization subproblems. This reduces the computational burden of the algorithm. Later, the introduction of the MFO strategy provides the algorithm with a parallel evolutionary paradigm for multiple subpopulations of implicit knowledge transfer. Finally, simulation experiments and comparisons are performed on a large-scale task scheduling test set on the CloudSim platform. Experimental results show that our algorithm can obtain the best scheduling solution while maintaining good results of the objective function compared with other optimization algorithms.

• Journal of Information Processing Systems
• /
• 제17권3호
• /
• pp.441-452
• /
• 2021

Federated learning provides an efficient integrated model for distributed data, allowing the local training of different data. Meanwhile, the goal of multi-task learning is to simultaneously establish models for multiple related tasks, and to obtain the underlying main structure. However, traditional federated multi-task learning models not only have strict requirements for the data distribution, but also demand large amounts of calculation and have slow convergence, which hindered their promotion in many fields. In our work, we apply the rank constraint on weight vectors of the multi-task learning model to adaptively adjust the task's similarity learning, according to the distribution of federal node data. The proposed model has a general framework for solving optimal solutions, which can be used to deal with various data types. Experiments show that our model has achieved the best results in different dataset. Notably, our model can still obtain stable results in datasets with large distribution differences. In addition, compared with traditional federated multi-task learning models, our algorithm is able to converge on a local optimal solution within limited training iterations.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• 제29B권3호
• /
• pp.6-15
• /
• 1992

This paper proposes a method for the global optimization of redundancy over the whole task period for a kinematically redundant robot. The necessary conditions based on the calculus of variations for an integral type cost criterion result in a second-order differential equation. For a cyclic task, the periodic boundary conditions due to conservativity requirements are discussed. We refine the two-point boundary value problem to an initial value adjustment problem and suggest a numerical search method for providing the conservative global optimal solution using the gradient projection method. Since the initial joint velocity is parameterized with the number of the redundancy, we only search the parameter value in the space of as many dimensions as the number of degrees of redundancy. We show through numerical examples that multiple nonhomotopic extremal solutions and the generality of the proposed method by considering the dynamics of a robot.

• Journal of Institute of Control, Robotics and Systems
• /
• 제10권10호
• /
• pp.930-939
• /
• 2004

In this paper, both dynamic constraints and kinematic constraints are considered for the analysis of manipulability of robotic systems comprised of multiple cooperating arms. Given bounds on the torques of each Joint actuator for every robot, the purpose of this study is to drive the bounds of task-space acceleration of object carried by the system. Bounds on each joint torque, described as a polytope, is transformed to the task-space acceleration through matrices related with robot dynamics, robot kinematics, object dynamics, grasp conditions, and contact conditions. A series of mathematical manipulations including the procedure calculating minimum infinite-norm solution of linear equation is applied to get the reachable acceleration bounds from given actuator dynamic constrains. Several examples including two robot systems as well as three robot system are shown with the assumptions of complete-constraint contact model(or' very soft contact') and insufficient or proper degree of freedom robot.

• International Journal of Control, Automation, and Systems
• /
• 제4권5호
• /
• pp.601-614
• /
• 2006

In this paper, a study on task assignment strategies for a complex real-time network system is presented. Firstly, two task assignment strategies are proposed to improve previous strategies. The proposed strategies assign tasks with meeting end-to-end real-time constraints, and also with optimizing system utilization through period modulation of the tasks. Consequently, the strategies aim at the optimizationto optimize of system performance with while still meeting real-time constraints. The proposed task assignment strategies are devised using the genetic algorithmswith heuristic real-time constraints in the generation of new populations. The strategies are differentiated by the optimization method of the two objectives-meeting end-to-end real-time constraints and optimizing system utilization: the first one has sequential genetic algorithm routines for the objectives, and the second one has one multiple objective genetic algorithm routine to find a Pareto solution. Secondly, the performances of the proposed strategies and a well-known existing task assignment strategy using the BnB(Branch and Bound) optimization are compared with one other through some simulation tests. Through the comparison of the simulation results, the most adequate task assignment strategies are proposed for some as system requirements-: the optimization of system utilization, the maximization of running tasktasks, and the minimization of the number of network node nodesnumber for a network system.

• School Mathematics
• /
• 제16권1호
• /
• pp.1-17
• /
• 2014

Mathematical creativity in school mathematics is connected with problem solving. The purpose of this study was to analyse elementary students' the mathematical creativity using multiple solution tasks which required to solve a mathematical problem in different ways. For this research, I examined and analyzed the response to four multiple solution tasks according to the evaluation system of mathematical creativity which consisted of the factors of creativity(fluency, flexibility, originality). The finding showed that mathematical creativity was different between students with greater clarity. And mathematical creativity in tasks was different. So I questioned the possibility of analysis of students' the mathematical creativity in mathematical areas. According to the evaluation system of mathematical creativity of this research, mathematical creativity was proportional to the fluency. But the high fluency and flexibility was decreasing originality because it was easy for students to solve multiple solution tasks in the same ways. So, finding of this research can be considered to make the criterion in both originality in rare and mathematical aspects.

• Journal of the Korean Operations Research and Management Science Society
• /
• 제33권3호
• /
• pp.1-16
• /
• 2008

This paper considers a scheduling problem to minimize the total tardiness in the two-stage assembly-type flowshop. The system is composed of multiple fabrication machines in the first stage and a final-assembly machine in the second stage. Each job consists of multiple tasks, each task is performed on the fabrication machine specified in advance. After all the tasks of a job are finished, the assembly task can be started on the final-assembly machine. The completion time of a job is the time that the assembly task for the job is completed. The objective of this paper is to find the optimal schedule minimizing the total tardiness of a group of jobs. In the problem analysis, we first derive three solution properties to determine the sequence between two consecutive jobs. Moreover, two lower objective bounds are derived and tested along with the derived properties within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed properties, branch-and-bound and heuristic algorithms are evaluated through numerical experiments.

• The Journal of Korea Robotics Society
• /
• 제2권1호
• /
• pp.93-102
• /
• 2007

It is essential to estimating positions of multiple robots in order to perform cooperative task in common workspace. Accordingly, we propose a new approach of cooperative localization for multiple robots utilizing correlation among GPS errors in common workspace. Assuming that GPS data of individual robot are correlated strongly as the distance among robots are close, it is confirmed that the proposed method provides improved localization accuracy. In addition, we define two operational parameters to apply proposed method in multiple robot system. With mentioned two parameters, we present a practical solution to accumulated position error in traveling long distance.

• The Transactions of the Korea Information Processing Society
• /
• 제6권9호
• /
• pp.2311-2319
• /
• 1999

We present two heuristic algorithms for the task allocation problem (NP-complete problem) in parallel computing. The problem is to find an optimal mapping of multiple communicating tasks of a parallel program onto the multiple processing nodes of a distributed-memory multicomputer. The purpose of mapping these tasks into the nodes of the target architecture is the minimization of parallel execution time without sacrificing solution quality. Many heuristic approaches have been employed to obtain satisfactory mapping. Our heuristics are based on genetic algorithms and simulated annealing. We formulate an objective function as a total computational cost for a mapping configuration, and evaluate the performance of our heuristic algorithms. We compare the quality of solutions and times derived by the random, greedy, genetic, and annealing algorithms. Our experimental findings from a simulation study of the allocation algorithms are presented.