• Journal of Information Processing Systems
• /
• v.19 no.2
• /
• pp.149-163
• /
• 2023

Affected by external factors, errors in time series data collected by sensors are common. Using the traditional method of constraining the speed change rate to clean the errors can get good performance. However, they are only limited to the data of stable changing speed because of fixed constraint rules. Actually, data with uneven changing speed is common in practice. To solve this problem, an online cleaning algorithm for time series data based on dynamic speed change rate constraints is proposed in this paper. Since time series data usually changes periodically, we use the extreme learning machine to learn the law of speed changes from past data and predict the speed ranges that change over time to detect the data. In order to realize online data repair, a dual-window mechanism is proposed to transform the global optimal into the local optimal, and the traditional minimum change principle and median theorem are applied in the selection of the repair strategy. Aiming at the problem that the repair method based on the minimum change principle cannot correct consecutive abnormal points, through quantitative analysis, it is believed that the repair strategy should be the boundary of the repair candidate set. The experimental results obtained on the dataset show that the method proposed in this paper can get a better repair effect.

• Transactions of Materials Processing
• /
• v.4 no.1
• /
• pp.48-58
• /
• 1995

In this study, a contact algorithm for the finite element analysis of free surface contact problem in materials forming is presented. The proposed contact algorithm consists of two parts. The first is the contact searching part, and the second, the constraint part. The contact searching algorithm does not require any a priori knowledge of the pairs of contact nodes or segments and the impenetrability constraint is satisfied using the penalty function scheme. void colsure in open-die forging was simulated to verify the accuracy and capability of the currently developed contact algorithm. The simulation results, obtained from ABAQUS simulation, were compared well to the experimental data available in the literature.

• IE interfaces
• /
• v.15 no.1
• /
• pp.49-54
• /
• 2002

A bus scheduling problem with multiple objective functions and travel time constraint is to determine the allocation of buses to customer service requests minimizing the number of buses and travel costs under the travel time restriction for each bus. For the scheduling, we first represent the scheduling problem using a graph and develop a hierarchical approach. Second, we develop a mathematical model based algorithm for the scheduling problem including heuristic methods. We tested the performance of the algorithm on instances with real data. As a result, the total number of buses and travel costs are reduced over about 10% comparing with that of current practice at the company.

• Language and Information
• /
• v.14 no.1
• /
• pp.49-65
• /
• 2010

It has been widely accepted that English object extraposition can be easily accounted for. However, recent research exhibits the fact that various cases of English object extraposition lead to many empirical and theoretical problems in generative grammar. To account for such cases, the previous lexical constraint-based analyses including Kim & Sag (2006, 2007) and Kim (2008) attempt to give an explanation on the phenomenon. They, however, seem to be unsuccessful in providing an appropriate analysis of object extraposition, mainly due to the mistaken data generalizations. Unlike the previous analyses, we claim that all verbs selecting CP objects allow object extraposition and propose a unified constraint-based analysis for the various cases of the construction. Further, it is shown that as a consequence, this analysis of object extraposition can be naturally extended to subject extraposition. Hence, this unified analysis enables us to further suggest that all verbs selecting CP allow subject and object extraposition in English.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.11
• /
• pp.9-16
• /
• 2016

The central goal of the current paper is to investigate lexical transfer between Korean and English and to identify rule-governed behavior and to provide implications for development of computer-assisted translation(CAT) software for the two languages. It will be shown that Sankoff and Poplack's Free Morpheme Constraint can not account for all the range of data. A constraint is proposed that a set of case-assigners such as verbs, INFL, prepositions, and the possessive marker may not undergo lexical transfer. The translation software is also expected to be equipped with the proposed claim that English verbs are actually borrowed as nouns or as defective verbs to escape from the direct attachment of inflectional morphemes.

• Journal of Korean Society of Forest Science
• /
• v.76 no.4
• /
• pp.361-369
• /
• 1987

The idea of multiple-use of forest land is tile one field of economics to improve the efficiency of forest land, and is the famous management technique widely used in the developed forestry country. This paper introduces the STEM and the constraint method, which is one kind of mathematical programming techniques used for multiple forest Land use, and discusses the differences between these two methods by using the hypothetical data.

• 한국경영정보학회:학술대회논문집
• /
• 2007.06a
• /
• pp.509-514
• /
• 2007

Most of the IS continuance research has assumed that IS use is activated by an intention to use, which in turn is determined by the evaluation of IS usage. Perceived usefulness is one of the evaluation variables most widely used. Typically, the past studies adopt this perceived usefulness because it views continuance as an extension of acceptance behavior. However, the literature on interpersonal relationships suggests that individuals are motivated to maintain relationships either because they genuinely want to or they believe they have no other option. The former is referred to as dedication-based relationship maintenance and the latter as constraint-based relationship maintenance. The IS continuance can be considered as the relationship maintenance situation with the existing IS that the user is currently using. The belief constructs previously used in IS continuance researches fall into the category of dedication-based ones. Additional constraint-based belief constructs are needed to explain the IS continuance behavior. In this regard, switching cost represents an important avenue for better understanding and predicting customer retention in that it can be regarded as the constraint-based motivation for relationship maintenance or IS use continuance. For an empirical exploration, 275 samples were collected from the users of a web portal site. Data analysis using Structural Equation Modeling (SEM) shows that perceived usefulness shows a significant direct effect on continuance intention while perceived switching cost significantly affects continuance usage.

• Geophysics and Geophysical Exploration
• /
• v.16 no.3
• /
• pp.131-138
• /
• 2013

We developed a method for inverting magnetic data to image 2D susceptibility models. The major difficulty in the inversion of the potential data is the nonuniqueness. Furthermore, generally the number of inversion blocks are greater than the number of the magnetic data available, and thus the magnetic inversion leads to under-determined problem, which aggravates the nonuniqueness. When the magnetic data were inverted by the general least-squares method, the anomalous susceptibility would be concentrated near the surface in the inverted section. To overcome this nonuniqueness problem, we propose a new resolution model constraint that is calculated from the parameter resolution. The model constraint imposes large penalty on the model parameter with good resolution, on the other hand small penalty on the model parameter with poor resolution. Thus, the deep-seated model parameter, generally having poor resolution, can be effectively resolved. The developed inversion algorithm is applied to the inversion of the synthetic data for typical models of magnetic anomalies and is tested on real airborne data obtained at the Okcheon belt of Korea.

• The Korean Journal of Applied Statistics
• /
• v.14 no.1
• /
• pp.137-148
• /
• 2001

Compositional data found in many practical applications consist of non-negative vectors of proportions with the constraint which the sum of the elements of each vector is unity. It is well-known that the statistical analysis of compositional data suffers from the unit-sum constraint. Moreover, the non-linear pattern frequently displayed by the data does not facilitate the application of the linear multivariate techniques such as principal component analysis. In this paper we develop new type of principal component analysis for compositional data using Box-Cox contrast transformation. Numerical illustrations are provided for comparative purpose.

• Journal of Korean Institute of Industrial Engineers
• /
• v.36 no.2
• /
• pp.138-145
• /
• 2010

In this paper, we consider the information processing system, which organizes the collected data to meaningful information when the number of data collected from multiple sources reaches to a predetermined number, and performs any action by processing the collected data, or transmits to other devices or systems. We derive an analytical model to calculate the time until it takes to process information after starting to collect data. Therefore, in order to complete the processing data within certain time constraints, we develop some design criteria to control various parameters of the information processing system. Also, we analyze the discrete time model for packet switching networks considering data with no particular arrival nor drop pattern. We analyze the relationship between the number of required packets and average information processing time through numerical examples. By this, we show that the proposed model is able to design the system to be suitable for user's requirements being complementary the quality of information and the information processing time in the system with time constraints.