• 제목/요약/키워드: piecewise linear representation

검색결과 5건 처리시간 0.018초

시맨틱 웹 환경에서의 부분선형 제약지식표현을 위한 SWCL의 확장 (SWCL Extension for Knowledge Representation of Piecewise linear Constraints on the Semantic Web)

  • 이명진;김우주;김학진
    • 한국경영과학회지
    • /
    • 제37권4호
    • /
    • pp.19-35
    • /
    • 2012
  • The Semantic Web technology, purporting to share, to reuse and to process by machines data stored in the Web environment, incessantly evolves to help human decision making; in particular, decision making based on data, or quantitative decision making. This trend drives researchers to fill the gap with strenuous efforts between the current state of the technology and the terminus of this evolution. The Semantic Web Constraint Language (SWCL) together with SWRL is one of these endeavors to achieve the goal. This paper focuses particularly on how to express the piecewise linear form in the context of SWCL. The importance of this ingredient can be fortified by the fact that any nonlinear expression can be approximated in the piecewise linear form. This paper will also provide the information of how it will work in the decision making process through an example of the Internet shopping mall problem.

정규 구간선형 방정식을 갖는 저항성 회로의 효율적인 해석 (Efficient Alalysis of Resistive Networks With Canonical Piecewise-Linear Equations)

  • 조준영;조진국;권용세;김영환
    • 전자공학회논문지A
    • /
    • 제31A권12호
    • /
    • pp.142-151
    • /
    • 1994
  • This paper proposes new algorithms to solve canonical piecewise-linear equations with linear partitions and illustrates their efficiency through the analysis of resistive network. The basic idea of the proposed algorithm is to find the best next guess, closest to the actual solution, at each Newton-Raphson (N-R) iteration by comparing the images of nest guess candidates and that of the actual solution. The proposed algorithm can reduce the number of the N-R iterations rquired for convergence greatly, compared to the actual solution, at each Newton-Raphson (N-R) iteration by comparing the images of next guess candidates and that of the actual solution. The proposed algorithm can reduce the number of the N-R iterations required for convergence greatly, compared to the Katzenelson algorithm. When applied to analyzing test circuits, the proposed algorithm required 8 to 20 times fewer N-R iterations and 5 to 10 times less CPU time than the Katzenelson algorithm, depending on the size of the circuits. The experimental results also exhibit that the efficiency of the proposed algorithm over the Katzenelson algorithm increases as the number of the piecewise-linear regions for the representation of the circuit.

  • PDF

B-spline 곡선을 power 기저형태의 구간별 다항식으로 바꾸는 Direct Expansion 알고리듬 (A Direct Expansion Algorithm for Transforming B-spline Curve into a Piecewise Polynomial Curve in a Power Form.)

  • 김덕수;류중현;이현찬;신하용;장태범
    • 한국CDE학회논문집
    • /
    • 제5권3호
    • /
    • pp.276-284
    • /
    • 2000
  • Usual practice of the transformation of a B-spline curve into a set of piecewise polynomial curves in a power form is done by either a knot refinement followed by basis conversions or applying a Taylor expansion on the B-spline curve for each knot span. Presented in this paper is a new algorithm, called a direct expansion algorithm, for the problem. The algorithm first locates the coefficients of all the linear terms that make up the basis functions in a knot span, and then the algorithm directly obtains the power form representation of basis functions by expanding the summation of products of appropriate linear terms. Then, a polynomial segment of a knot span can be easily obtained by the summation of products of the basis functions within the knot span with corresponding control points. Repeating this operation for each knot span, all of the polynomials of the B-spline curve can be transformed into a power form. The algorithm has been applied to both static and dynamic curves. It turns out that the proposed algorithm outperforms the existing algorithms for the conversion for both types of curves. Especially, the proposed algorithm shows significantly fast performance for the dynamic curves.

  • PDF

A Pattern-based Query Strategy in Wireless Sensor Network

  • Ding, Yanhong;Qiu, Tie;Jiang, He;Sun, Weifeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권6호
    • /
    • pp.1546-1564
    • /
    • 2012
  • Pattern-based query processing has not attracted much attention in wireless sensor network though its counterpart has been studied extensively in data stream. The methods used for data stream usually consume large memory and much energy. This conflicts with the fact that wireless sensor networks are heavily constrained by their hardware resources. In this paper, we use piece wise representation to represent sensor nodes' collected data to save sensor nodes' memory and to reduce the energy consumption for query. After getting data stream's and patterns' approximated line segments, we record each line's slope. We do similar matching on slope sequences. We compute the dynamic time warping distance between slope sequences. If the distance is less than user defined threshold, we say that the subsequence is similar to the pattern. We do experiments on STM32W108 processor to evaluate our strategy's performance compared with naive method. The results show that our strategy's matching precision is less than that of naive method, but our method's energy consumption is much better than that of naive approach. The strategy proposed in this paper can be used in wireless sensor network to process pattern-based queries.

Multi-mode cable vibration control using MR damper based on nonlinear modeling

  • Huang, H.W.;Liu, T.T.;Sun, L.M.
    • Smart Structures and Systems
    • /
    • 제23권6호
    • /
    • pp.565-577
    • /
    • 2019
  • One of the most effective countermeasures for mitigating cable vibration is to install mechanical dampers near the anchorage of the cable. Most of the dampers used in the field are so-called passive dampers where their parameters cannot be changed once designed. The parameters of passive dampers are usually determined based on the optimal damper force obtained from the universal design curve for linear dampers, which will provide a maximum additional damping for the cable. As the optimal damper force is chosen based on a predetermined principal vibration mode, passive dampers will be most effective if cable undergoes single-mode vibration where the vibration mode is the same as the principal mode used in the design. However, in the actual engineering practice, multi-mode vibrations are often observed for cables. Therefore, it is desirable to have dampers that can suppress different modes of cable vibrations simultaneously. In this paper, MR dampers are proposed for controlling multi-mode cable vibrations, because of its ability to change parameters and its adaptability of active control without inquiring large power resources. Although the highly nonlinear feature of the MR material leads to a relatively complex representation of its mathematical model, effective control strategies can still be derived for suppressing multi-mode cable vibrations based on nonlinear modelling, as proposed in this paper. Firstly, the nonlinear Bouc-wen model is employed to accurately portray the salient characteristics of the MR damper. Then, the desired optimal damper force is determined from the universal design curve of friction dampers. Finally, the input voltage (current) of MR damper corresponding to the desired optimal damper force is calculated from the nonlinear Bouc-wen model of the damper using a piecewise linear interpolation scheme. Numerical simulations are carried out to validate the effectiveness of the proposed control algorithm for mitigating multi-mode cable vibrations induced by different external excitations.