• Title/Summary/Keyword: A level-set method

Search Result 1,385, Processing Time 0.029 seconds

A Linearization Method for Constrained Mechanical System (구속된 다물체시스템의 선형화에 관한 연구)

  • Bae, Dae-Sung;Yang, Seong-Ho;Seo, Jun-Seok
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.8
    • /
    • pp.1303-1308
    • /
    • 2003
  • This research proposes an implementation method of linearized equations of motion for multibody systems with closed loops. The null space of the constraint Jacobian is first pre-multiplied to the equations of motion to eliminate the Lagrange multiplier and the equations of motion are reduced down to a minimum set of ordinary differential equations. The resulting differential equations are functions of ail relative coordinates, velocities, and accelerations. Since the coordinates, velocities, and accelerations are tightly coupled by the position, velocity, and acceleration level constraints, direct substitution of the relationships among these variables yields very complicated equations to be implemented. As a consequence, the reduced equations of motion are perturbed with respect to the variations of all coordinates, velocities, and accelerations, which are coupled by the constraints. The position, velocity and acceleration level constraints are also perturbed to obtain the relationships between the variations of all relative coordinates, velocities, and accelerations and variations of the independent ones. The perturbed constraint equations are then simultaneously solved for variations of all coordinates, velocities, and accelerations only in terms of the variations of the independent coordinates, velocities, and accelerations. Finally, the relationships between the variations of all coordinates, velocities, accelerations and these of the independent ones are substituted into the variational equations of motion to obtain the linearized equations of motion only in terms of the independent coordinate, velocity, and acceleration variations.

Performance Analysis of Bandwidth-Aware Bus Arbitration (밴드위스 고려 버스중재방식의 성능분석)

  • Lee, Kook-Pyo;Yoon, Yung-Sup
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.48 no.9
    • /
    • pp.50-57
    • /
    • 2011
  • Conventional bus system architectures are composed of several components such as master, arbiter, decoder and slave modules. The arbiter plays a role in bus arbitration according to the selected arbitration method, since several masters cannot use the bus concurrently. Typical priority strategies used in high performance arbiters include static priority, round robin, TDMA and lottery. Typical arbitration algorithms always consider the bus priority primarily, while the bus utilization is always ignored. In this paper, we propose an arbitration method using bus utilization for the operating block of each master. We verify the performance compared with the other arbitration methods through the TLM(Transaction Level Model). Based on the performance verification, the conventional fixed priority and round-robin arbitration methods cannot set the bus utilization. Whereas, in the case of the conventional TDMA and lottery arbitration methods, more than 100,000 cycles of bus utilization can be set by the user, exhibiting differences of actual bus utilization up to 50% and 70%, respectively. On the other hand, we confirm that for the proposed arbitration method, the matched bus utilization set by the user was above 99% using approximately 1,000 cycles.

Context Prediction Using Right and Wrong Patterns to Improve Sequential Matching Performance for More Accurate Dynamic Context-Aware Recommendation (보다 정확한 동적 상황인식 추천을 위해 정확 및 오류 패턴을 활용하여 순차적 매칭 성능이 개선된 상황 예측 방법)

  • Kwon, Oh-Byung
    • Asia pacific journal of information systems
    • /
    • v.19 no.3
    • /
    • pp.51-67
    • /
    • 2009
  • Developing an agile recommender system for nomadic users has been regarded as a promising application in mobile and ubiquitous settings. To increase the quality of personalized recommendation in terms of accuracy and elapsed time, estimating future context of the user in a correct way is highly crucial. Traditionally, time series analysis and Makovian process have been adopted for such forecasting. However, these methods are not adequate in predicting context data, only because most of context data are represented as nominal scale. To resolve these limitations, the alignment-prediction algorithm has been suggested for context prediction, especially for future context from the low-level context. Recently, an ontological approach has been proposed for guided context prediction without context history. However, due to variety of context information, acquiring sufficient context prediction knowledge a priori is not easy in most of service domains. Hence, the purpose of this paper is to propose a novel context prediction methodology, which does not require a priori knowledge, and to increase accuracy and decrease elapsed time for service response. To do so, we have newly developed pattern-based context prediction approach. First of ail, a set of individual rules is derived from each context attribute using context history. Then a pattern consisted of results from reasoning individual rules, is developed for pattern learning. If at least one context property matches, say R, then regard the pattern as right. If the pattern is new, add right pattern, set the value of mismatched properties = 0, freq = 1 and w(R, 1). Otherwise, increase the frequency of the matched right pattern by 1 and then set w(R,freq). After finishing training, if the frequency is greater than a threshold value, then save the right pattern in knowledge base. On the other hand, if at least one context property matches, say W, then regard the pattern as wrong. If the pattern is new, modify the result into wrong answer, add right pattern, and set frequency to 1 and w(W, 1). Or, increase the matched wrong pattern's frequency by 1 and then set w(W, freq). After finishing training, if the frequency value is greater than a threshold level, then save the wrong pattern on the knowledge basis. Then, context prediction is performed with combinatorial rules as follows: first, identify current context. Second, find matched patterns from right patterns. If there is no pattern matched, then find a matching pattern from wrong patterns. If a matching pattern is not found, then choose one context property whose predictability is higher than that of any other properties. To show the feasibility of the methodology proposed in this paper, we collected actual context history from the travelers who had visited the largest amusement park in Korea. As a result, 400 context records were collected in 2009. Then we randomly selected 70% of the records as training data. The rest were selected as testing data. To examine the performance of the methodology, prediction accuracy and elapsed time were chosen as measures. We compared the performance with case-based reasoning and voting methods. Through a simulation test, we conclude that our methodology is clearly better than CBR and voting methods in terms of accuracy and elapsed time. This shows that the methodology is relatively valid and scalable. As a second round of the experiment, we compared a full model to a partial model. A full model indicates that right and wrong patterns are used for reasoning the future context. On the other hand, a partial model means that the reasoning is performed only with right patterns, which is generally adopted in the legacy alignment-prediction method. It turned out that a full model is better than a partial model in terms of the accuracy while partial model is better when considering elapsed time. As a last experiment, we took into our consideration potential privacy problems that might arise among the users. To mediate such concern, we excluded such context properties as date of tour and user profiles such as gender and age. The outcome shows that preserving privacy is endurable. Contributions of this paper are as follows: First, academically, we have improved sequential matching methods to predict accuracy and service time by considering individual rules of each context property and learning from wrong patterns. Second, the proposed method is found to be quite effective for privacy preserving applications, which are frequently required by B2C context-aware services; the privacy preserving system applying the proposed method successfully can also decrease elapsed time. Hence, the method is very practical in establishing privacy preserving context-aware services. Our future research issues taking into account some limitations in this paper can be summarized as follows. First, user acceptance or usability will be tested with actual users in order to prove the value of the prototype system. Second, we will apply the proposed method to more general application domains as this paper focused on tourism in amusement park.

A Comparative Study Between Light Extinction and Direct Sampling Methods for Measuring Volume Fractions of Twin-Hole Sprays Using Tomographic Reconstruction

  • Lee, Choong-Hoon
    • Journal of Mechanical Science and Technology
    • /
    • v.17 no.12
    • /
    • pp.1986-1993
    • /
    • 2003
  • The spatially resolved spray volume fractions from both line-of-sight data of direct measuring cells and a laser diffraction particle analyzer (LDPA) are tomographically reconstructed by the Convolution Fourier transformation, respectively. Asymmetric sprays generated from a twin-hole injector are tested with 12 equiangular projections of measurements. For each projection angle, a line-of-sight integrated injection rate was measured using a direct sampling method and also a liquid volume fraction from a set of line-of-sight Fraunhofer diffraction measurements was measured using a light extinction method. Interpolated data between the projection angles effectively increase the number of projections, significantly enhancing the signal-to-noise level in the reconstructed data. The reconstructed volume fractions from the direct sampling cells were used as reference data for evaluating the accuracy of the volume fractions from the LDPA.

The Effects of 'Climbing learning Method' in the Learning of Mathematics in Elementary School (학습구조차트를 활용하는 등산학습법의 초등수학 적용과 효과에 관한 연구)

  • Baik, Min-Ho;Kim, Pan-Soo
    • Journal of Elementary Mathematics Education in Korea
    • /
    • v.11 no.2
    • /
    • pp.177-197
    • /
    • 2007
  • This study discussed the climbing learning method which studied and practiced by Professor Saito Noboru. This is the learning method which is devised to know not only the relationship of the learning factors but the systemic or structural connection of whole studying contents- affects children's math learning ability through practical class to both the lower and the higher grades. To achieve the purpose of this study, these following issues were set; A. Develop the teaching and learning course of mathematics by applying the climbing learning method. B. Execute the mathematics lesson according to the climbing learning method and analyze the learning achievement. C. Analyze the difference between application of the climbing learning method and that of the learning method by student's level in mathematics. D. Analyze what the climbing learning method gives a shift of the recognition of learning mathematics. In order to accomplish these study issues, we analyzed the text book of math not only for children but also for teachers and developed the teaching and learning course applied the climbing learning method with advice of experts. It was chosen two different homogeneous groups each, third year for lower grade group and fifth year for higher grade group. It was done the experimental group lesson applying the climbing learning method and general lesson for the control group. After then, t-test against independent samples was done depending on the result of the student's assessment(T1, T2). These two groups' students were divided into smaller groups based on result of achievement level regardless of gender. These subgroups were confirmed the difference of learning ability between upper and lower level group. As regarding the result making out grades of faith and attitude for math, t-test was used on independent sample. At the same time, experimental groups were tested using learning attitude with the learning structure chart. Through this study the following results are obtained and the conclusion was drawn. Firstly, although applying the climbing learning method to the lesson does not have significant effect to the lower grade of elementary school student's achievement it has significant influence on the higher grade student's achievement. Second, as a result of analyzing the difference between the climbing learning method and the learning method by student's level in mathematics, it is of no beneficial effect to the lower grade both upper level and lower level. However, it has appreciable effect to the higher grade classes both upper level and low level. Especially, upper level students have higher effect than low level students. Third, climbing learning method does not affect to the faith and attitude of the lower grade students positively, but it has affirmative effect to the higher grade students'. As a result of the survey of the experimental groups which were applied to the climbing loaming method, the lesson by using the learning structure chart proved to be helpful to the both the lower and higher grade. The best advantage of using the learning structure chart, children say, is easily understood whole contents of studying and is useful for review. Furthermore, using the learning structure chart is more efficient compared with previous learning method and is given the successful result to self-directed learning. In conclusion, keeping up with the current of the thought of education, we suggest a scheme as a new teaching method from the constructive learning method which emphasize the self-directed learning.

  • PDF

A Simulation Study on a Variant Policy of Inventory Replenishment for the Order Consolidation - A Case of Steel Industry (주문 집약을 위한 재고 변용 모델 연구: 제철산업의 소로트 주문 집약 활용을 중심으로)

  • Jung, Jae-Heon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.10a
    • /
    • pp.10-26
    • /
    • 2005
  • In our model, we keep inventory to satisfy uncertain demands which arrives irregularly. In this situation, we have additional two constraints. First, we need to have certain amount of order consolidation (consolidation constraint) for the orders to replenish the inventory because of production or purchase constraint. And also, if we order at a certain date which was set by administrative convenience, we have amount constraint to order the consolidated order demands (capacity constraint). We showed this variant inventory policy is needed in steel industry and note that there will be possible similar case in industry. To deal with this case, we invented a variant replenishment policy and show this policy is superior to other possible polices in the consolidation constraint case by extensive simulation. And we derive a combined solution method for dealing with the capacity constraints in addition to the consolidation constraints. For this, we suggest a combined solution method of integer programming and simulation.

  • PDF

A Method of Low Power VLSI Design using Modified Binary Dicision Diagram (MBDD를 이용한 저전력 VLSI설계기법)

  • Yun, Gyeong-Yong;Jeong, Deok-Jin
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.49 no.6
    • /
    • pp.316-321
    • /
    • 2000
  • In this paper, we proposed MBDD(Modified Binary Decision Diagram) as a multi-level logic synthesis method and a vertex of MBDD to NMOS transistors matching. A vertex in MBDD is matched to a set of NMOS transistors. MBDD structure can be achieved through transformation steps from BDD structure. MBDD can represent the same function with less vertices less number of NMOS transistors, consequently capacitance of the circuit can be reduced. Thus the power dissipation can be reduced. We applied MBDD to a full odder and a 4-2compressor. Comparing the 4-2compressor block with other synthesis logic, 31.2% reduction and 19.9% reduction was achieved in numbers of transistors and power dissipation respectively. In this simulation we used 0.8 ${\mu}{\textrm}{m}$ fabrication parameters.

  • PDF

A Simulation Study on a Variant Policy of Inventory Replenishment for the Order Consolidation : A Case of Steel Industry (주문 집약을 위한 재고 변용 모델 연구 : 제철산업의 소로트 주문 집약 활용을 중심으로)

  • Jung Jae-Heon
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.31 no.2
    • /
    • pp.99-112
    • /
    • 2006
  • In our model, we keep inventory to satisfy uncertain demands which arrives irregularly. In this situation, we have additional two constraints. First, we need to have certain amount of order consolidation (consolidation constraint) for the orders to replenish the inventory because of production or purchase amount constraint. And also, if we order at a certain date which was set by administrative convenience, we have capacity constraint to order the consolidated order demands (capacity constraint). We show this variant inventory policy is needed in steel industry and note that there will be possible similar case in industry. To deal with this case, we invent a variant replenishment policy and show this policy is superior to other possible polices in the consolidation constraint case by extensive simulation. And we derive a combined solution method for dealing with the capacity constraints in addition to the consolidation constraints. For this, we suggest a combined solution method of integer programming and simulation.

DEVELOPMENT OF A RESOURCE LEVELING MODEL USING OPTIMIZATION

  • Jin-Lee Kim;Ralph D. Ellis
    • International conference on construction engineering and project management
    • /
    • 2005.10a
    • /
    • pp.558-563
    • /
    • 2005
  • This paper presents a GA-based optimal algorithm for a resource leveling model that levels the resources of a set of non-critical activities experiencing conflicts simultaneously up to an assumed level of resource rates specified by the planner using a pair-wise comparison of the activities being considered. A parameter called the future float is adopted and applied as an indicator for assigning leveling priorities to the sets of activities experiencing conflicts. A construction project network example was worked out to demonstrate the performance of the proposed method. The histogram obtained using the algorithm proposed was shown to be the same as, or very close to that produced by the existing resource leveling method based on the least total float rule, which shifts non-critical activities individually.

  • PDF

A Model for Production Planning in a Multi-item Production System -Multi-item Parametric Decision Rule- (다품목(多品目) 생산체제(生産體制)의 생산계획(生産計劃)을 위한 모델)

  • Choe, Byeong-Gyu
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.1 no.2
    • /
    • pp.27-38
    • /
    • 1975
  • This paper explores a quantitative decision-making system for planning production, inventories and work-force in a multi-item production system. The Multi-item Parametric Decision Rule (MPDR) model, which assumes the existence of two types of linear feed-back rules, one for work-force level and one for production rates, is basically an extension of the existing method of Parametric Production Planning (PPP) proposed by C.H. Jones. The MPDR model, however, explicitly considers the effect of manufacturing progress and other factors such as employee turn-over, difference in work-days between month etc., and it also provides decision rules for production rates of individual items. First, the cost relations of the production system are estimated in terms of mathematical functions, and then decision rules for work-force level and production rates of individual items are establised based upon the estimated objective cost function. Finally, a direct search technique is used to find a set of parameters which minimizes the total cost of the objective function over a specified planning horizon, given estimates of future demands and initial values of inventories and work-force level. As a case problem, a hypothetical decision rule is developed for a particular firm (truck assembly factory).

  • PDF