• Education of Primary School Mathematics
• /
• v.20 no.3
• /
• pp.193-204
• /
• 2017

The purpose of the study was to investigate and develop a practical approach to integrating student-driven mathematical problems posing in mathematics instruction. A problem posing activity was performed during regular mathematics instruction. A total of 540 mathematical problems generated by students were recorded and analysed using systemic procedures and criteria. Of the problems, 81% were mathematically solvable problem and 18% were classified as error type problems. The Mathematically solvable problem were analysed and categorized according to the complexity level; 13% were of a high-level, 30% mid-level and 57% low-level. The error-type problem were classified as such within three categories: non-mathematical problem, statement or mathematically unsolvable problem. The error-type problem category was distributed variously according to the leaning theme and accomplishment level. The study has important implications in that it used systemic procedures and criteria to analyse problem generated by students and provided the way for integrating mathematical instruction and problem posing activity.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.217-227
• /
• 2005

Let G be a finite group and $\#$Cent(G) denote the number of centralizers of its elements. G is called n-centralizer if $\#$Cent(G) = n, and primitive n-centralizer if $\#$Cent(G) = $\#$Cent($\frac{G}{Z(G)}$) = n. In this paper we investigate the structure of finite groups with at most 21 element centralizers. We prove that such a group is solvable and if G is a finite group such that G/Z(G)$\simeq$$A_5$, then $\#$Cent(G) = 22 or 32. Moreover, we prove that As is the only finite simple group with 22 centralizers. Therefore we obtain a characterization of As in terms of the number of centralizers

• Structural Engineering and Mechanics
• /
• v.16 no.5
• /
• pp.597-612
• /
• 2003

In this paper, multi-story buildings with shear-wall structures and with narrow rectangular plane configuration are modeled as a multi-step flexural-shear plate with varying cross-section for buckling analysis. The governing differential equation of such a plate is established. Using appropriate transformations, the equation is reduced to analytically solvable equations by selecting suitable expressions of the distribution of stiffness. The exact solutions for buckling of such a one-step flexural-shear plate with variable stiffness are derived for several cases. A new exact approach that combines the transfer matrix method and closed from solution of one-step flexural-shear plate with continuously varying stiffness is presented for stability analysis of multi-step non-uniform flexural-shear plate. A numerical example shows that the present methods are easy to implement and efficient.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.77-82
• /
• 1996

This paper is concerned with how to utilize kinematic redundancy to reconstruct the inverse kinematic solution which is not attainable due to hardware limitations. By analyzing the error due to hardware limitations, we are to show that the recoverability of limitation reduces to the solvability of a reconstruction equation under the feasibility condition. It will be next shown that the reconstruction equation is solvable if the configuration is not a joint-limit singularity. The reconstruction method will be proposed based on the geometrical analysis of recoverability of hardware limitations. The method has the feature that no task motion error is induced by the hardware limitations while minimizing a possible null motion error, under the recoverability assumed.

• Transactions on Control, Automation and Systems Engineering
• /
• v.4 no.3
• /
• pp.199-204
• /
• 2002

This paper is concerned with H$_{\infty}$ controller design methods for descriptor systems with and without time-varying delays in state and control input. The sufficient condition for the existence of an H$_{\infty}$ controller and the controller design method are presented by linear matrix inequality (LMI), singular value decomposition, Schur complements, and changes of variables. Since the obtained sufficient condition can be changed to an LMI form by proper manipulations, all solutions including controller gain can be obtained at the same time. Moreover, it is shown that robust H$_{\infty}$ controller design problem for parameter uncertain descriptor systems with time-varying delays in state and control input can be solvable using the proposed method.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.1
• /
• pp.76-82
• /
• 2004

A robust fuzzy controller is designed to stabilize a class of solvable nonlinear descriptor systems with time-varying delay. First, a new modeling and control method for nonlinear descriptor systems is presented with a fuzzy descriptor model. A sufficient condition for the existence of the fuzzy controller is given in terms of a series of LMIs. Then, a less conservative fuzzy controller design approach is obtained based on the fuzzy rules and weights. This method includes the interactions of the different subsystems into one matrix. The effectiveness of the presented approach and the design procedure of the fuzzy controller are illustrated by way of an example.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.59-62
• /
• 2001

This paper discusses a data mining technique for time series analysis of traffic data, which provides useful knowledge for network configuration management. Commonly, a network designer must employ a combination of heuristic algorithms and analysis in an interactive manner until satisfactory solutions are obtained. The problem of heuristic algorithms is that it is difficult to deal with large networks and simplification or assumptions have to be made to make them solvable. Various data mining techniques are studied to gain valuable knowledge in large and complex telecommunication networks. In this paper, we propose a traffic pattern association technique among network nodes, which produces association rules of traffic fluctuation patterns among network nodes. Discovered rules can be utilized for improving network topologies and dynamic routing performance.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10b
• /
• pp.524-529
• /
• 1993

Component Cost Analysis considers any given system driven by a white noise process as an interconnection of different components, and assigns a metric called "component cost" to each component. These component costs measure the contribution of each component to a predefined quadratic cost function. One possible use of component costs is for model reduction by deleting those components that have the smallest component cost. The theory of Component Cost Analysis is extended to include finite-bandwidth colored noises. The results also apply when actuators have dynamics of their own. When the dynamics of this input are added to the plant, which is to be reduced by CCA, the algorithm for model reduction process will be called Weighted Component Cost Analysis (WCCA). Closed-form analytical expressions of component costs for continuous time case, are also derived for a mechanical system described by its modal data. This is very useful to compute the modal costs of very high order systems beyond Lyapunov solvable dimension. A numerical example for NASA's MINIMAST system is presented.presented.

• ETRI Journal
• /
• v.36 no.3
• /
• pp.506-509
• /
• 2014

This paper studies the energy efficiency power allocation for cognitive radio networks based on uplink orthogonal frequency-division multiplexing. The power allocation problem is intended to minimize the maximum energy efficiency measured by "Joule per bit" metric, under total power constraint and robust aggregate mutual interference power constraint. However, the above problem is non-convex. To make it solvable, an equivalent convex optimization problem is derived that can be solved by general fractional programming. Then, a robust energy efficiency power allocation scheme is presented. Simulation results corroborate the effectiveness of the proposed methods.

• Communications of the Korean Mathematical Society
• /
• v.10 no.3
• /
• pp.681-688
• /
• 1995

Fixed-point theory has an extension to coincidences. For a pair of maps $f,g:X_1 \to X_2$, a coincidence of f and g is a point $x \in X_1$ such that $f(x) = g(x)$, and $Coin(f,g) = {x \in X_1 $\mid$ f(x) = g(x)}$ is the coincidence set of f and g. The Nielsen coincidence number N(f,g) and the Lefschetz coincidence number L(f,g) are used to estimate the cardinality of Coin(f,g). The aspherical manifolds whose fundamental group has a normal solvable subgroup of finite index is called infrasolvmanifolds. We show that if $M_1,M_2$ are compact connected orientable infrasolvmanifolds, then $N(f,g) \geq $\mid$L(f,g)$\mid$$ for every $f,g : M_1 \to M_2$.