• Title/Summary/Keyword: Time-interval constraint

Search Result 22, Processing Time 0.026 seconds

Estimation of the Actual Working Time by Interval Linear Regression Models with Constraint Conditions (제약부 구간 선형 회귀모델에 의한 실동시간의 견적)

  • Hwang, S. G.;Seo, Y. J.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.14 no.2
    • /
    • pp.105-114
    • /
    • 1989
  • The actual working time of jobs, in general, is different to the standard time of jobs. In this paper, in order to analyze the actual working time of each job in production, we use the total production amount and the encessary total working time. The method which analyzes the actual working time is as follows. In this paper, we propose the interval regression analysis for obtaining an interval linear regression model with constraint conditions with respect to interval parameters. The merits of this method are the following.1) it is easy to obtain an interval linear model by solving a LP problem to which the formulation of proposed regression analysis is reduced, 2) it is easy to add constraint conditions about interval parameters, which are a sort of expert knowledge. As an application, within a case which has given certain data, the actual working time of jobs and the number of workers in a future plan are estimated through the real data obtianed from the operation of processing line in a heavy industry company. It results from the proposed method that the actual working time and the number of workers can be estimated as intervals by the interval regression model.

  • PDF

A Study on the Improvement a Lateral Resolution of the Ultrasound Imaging System (초음파 영상장치에서 측방향 해상도 향상에 관한 연구)

  • 이후정;이행세
    • Journal of Biomedical Engineering Research
    • /
    • v.9 no.1
    • /
    • pp.87-92
    • /
    • 1988
  • In this paper, a new focusing method, to be called the pipelined sampled delay focusing (PSDF), is implemented. This method improves the lateral resolution in ultrasound imaging system. In PSDF, the analog belay lines are no longer necessary because sampling sum process can replace the conventional delay sum process. Also, the method offers continuous dynamic focusing on the resolution pixel basis, and eliminates the constraint that the maximum delay time is less than the sampling interval. Second order sampling is adopted in order to extend the sampling interval.

  • PDF

Mining Interesting Sequential Pattern with a Time-interval Constraint for Efficient Analyzing a Web-Click Stream (웹 클릭 스트림의 효율적 분석을 위한 시간 간격 제한을 활용한 관심 순차패턴 탐색)

  • Chang, Joong-Hyuk
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.16 no.2
    • /
    • pp.19-29
    • /
    • 2011
  • Due to the development of web technologies and the increasing use of smart devices such as smart phone, in recent various web services are widely used in many application fields. In this environment, the topic of supporting personalized and intelligent web services have been actively researched, and an analysis technique on a web-click stream generated from web usage logs is one of the essential techniques related to the topic. In this paper, for efficient analyzing a web-click stream of sequences, a sequential pattern mining technique is proposed, which satisfies the basic requirements for data stream processing and finds a refined mining result. For this purpose, a concept of interesting sequential patterns with a time-interval constraint is defined, which uses not on1y the order of items in a sequential pattern but also their generation times. In addition, A mining method to find the interesting sequential patterns efficiently over a data stream such as a web-click stream is proposed. The proposed method can be effectively used to various computing application fields such as E-commerce, bio-informatics, and USN environments, which generate data as a form of data streams.

A Reporting Interval Adaptive, Sensor Control Platform for Energy-saving Data Gathering in Wireless Sensor Networks

  • Choi, Wook;Lee, Yong;Kim, Sang-Chul
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.2
    • /
    • pp.247-268
    • /
    • 2011
  • Due to the application-specific nature of wireless sensor networks, the sensitivity to such a requirement as data reporting interval varies according to the type of application. Such considerations require an application-specific, parameter tuning paradigm allowing us to maximize energy conservation prolonging the operational network lifetime. In this paper, we propose a reporting interval adaptive, sensor control platform for energy-saving data gathering in wireless sensor networks. The ultimate goal is to extend the network lifetime by providing sensors with high adaptability to application-dependent or time-varying, reporting interval requirements. The proposed sensor control platform is based upon a two phase clustering (TPC) scheme which constructs two types of links within each cluster - namely, direct link and relay link. The direct links are used for control and time-critical, sensed data forwarding while the relay links are used only for multi-hop data reporting. Sensors opportunistically use the energy-saving relay link depending on the user reporting, interval constraint. We present factors that should be considered in deciding the total number of relay links and how sensors are scheduled for sensed data forwarding within a cluster for a given reporting interval and link quality. Simulation and implementation studies demonstrate that the proposed sensor control platform can help individual sensors save a significant amount of energy in reporting data, particularly in dense sensor networks. Such saving can be realized by the adaptability of the sensor to the reporting interval requirements.

Optimized Medium Access Probability for Networked Control Systems (네트워크 제어 시스템을 위한 최적화된 매체 접근 확률)

  • Park, Pangun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.10
    • /
    • pp.2457-2464
    • /
    • 2015
  • Distributed Networked Control Systems (NCSs) through wireless networks have a tremendous potential to improve the efficiency of various control systems. In this paper, we define the State Update Interval (SUI) as the elapsed time between successful state vector reports derived from the NCSs. A simple expression of the SUI is derived to characterize the key interactions between the control and communication layers. This performance measure is used to formulate a novel optimization problem where the objective function is the probability to meet the SUI constraint and the decision parameter is the channel access probability. We prove the existence and uniqueness of the optimal channel access probability of the optimization problem. Furthermore, the optimal channel access probability for NCSs is lower than the channel access probability to maximize the throughput. Numerical results indicate that the improvement of the success probability to meet the SUI constraint using the optimal channel access probability increases as the number of nodes increases with respect to that using the channel access probability to maximize the throughput.

The Property of Software Optimal Release Time Based on Log Poission Execution Time Model Using Interval Failure Times (고장 간격 수명 시간을 이용한 로그 포아송 실행 시간 모형의 소프트웨어 최적방출시간 특성에 관한 연구)

  • Sin, Hyun-Cheul;Kim, Hee-Cheul
    • Convergence Security Journal
    • /
    • v.10 no.1
    • /
    • pp.55-61
    • /
    • 2010
  • It is of great practical interest to deciding when to stop testing a software system in development phase and transfer it to the user. This decision problem called an optimal release policies. In this paper, because of the possibility of introducing new faults when correcting or modifying the software, we were researched release comparative policies which based on infinite failure NHPP model and types of interval failure times. The policies which minimize a total average software cost of development and maintenance under the constraint of satisfying a software reliability requirement can optimal software release times. In a numerical example, applied data which were patterns, if intensity function constant or increasing, decreasing, estimated software optimal release time.

Automatic velocity analysis using bootstrapped differential semblance and global search methods (고해상도 속도스펙트럼과 전역탐색법을 이용한 자동속도분석)

  • Choi, Hyung-Wook;Byun, Joong-Moo;Seol, Soon-Jee
    • Geophysics and Geophysical Exploration
    • /
    • v.13 no.1
    • /
    • pp.31-39
    • /
    • 2010
  • The goal of automatic velocity analysis is to extract accurate velocity from voluminous seismic data with efficiency. In this study, we developed an efficient automatic velocity analysis algorithm by using bootstrapped differential semblance (BDS) and Monte Carlo inversion. To estimate more accurate results from automatic velocity analysis, the algorithm we have developed uses BDS, which provides a higher velocity resolution than conventional semblance, as a coherency estimator. In addition, our proposed automatic velocity analysis module is performed with a conditional initial velocity determination step that leads to enhanced efficiency in running time of the module. A new optional root mean square (RMS) velocity constraint, which prevents picking false peaks, is used. The developed automatic velocity analysis module was tested on a synthetic dataset and a marine field dataset from the East Sea, Korea. The stacked sections made using velocity results from our algorithm showed coherent events and improved the quality of the normal moveout-correction result. Moreover, since our algorithm finds interval velocity ($\nu_{int}$) first with interval velocity constraints and then calculates a RMS velocity function from the interval velocity, we can estimate geologically reasonable interval velocities. Boundaries of interval velocities also match well with reflection events in the common midpoint stacked sections.

Detection of Complex Event Patterns over Interval-based Events (기간기반 복합 이벤트 패턴 검출)

  • Kang, Man-Mo;Park, Sang-Mu;Kim, Sank-Rak;Kim, Kang-Hyun;Lee, Dong-Hyeong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.4
    • /
    • pp.201-209
    • /
    • 2012
  • The point-based complex event processing handled an instantaneous event by using one time stamp in each event. However, the activity period of the event plays the important role in the field which is the same as the finance, multimedia, medicine, and meteorology. The point-based event is insufficient for expressing the complex temporal relationship in this field. In the application field of the real-time world, the event has the period. The events more than two kinds can be temporally overlapped. In addition, one event can include the other event. The relation about the events of kind of these can not be successive like the point-based event. This thesis designs and implements the method detecting the patterns of the complex event by using the interval-based events. The interval-based events can express the overlapping relation between events. Furthermore, it can include the others. By using the end point of beginning and end point of the termination, the operator of interval-based events shows the interval-based events. It expresses the sequence of the interval-based events and can detect the complex event patterns. This thesis proposes the algorithm using the active instance stack in order to raise efficiency of detection of the complex event patterns. When comprising the event sequence, this thesis applies the window push down technique in order to reduce the number of intermediate results. It raises the utility factor of the running time and memory.

aCN-RB-tree: Constrained Network-Based Index for Spatio-Temporal Aggregation of Moving Object Trajectory

  • Lee, Dong-Wook;Baek, Sung-Ha;Bae, Hae-Young
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.5
    • /
    • pp.527-547
    • /
    • 2009
  • Moving object management is widely used in traffic, logistic and data mining applications in ubiquitous environments. It is required to analyze spatio-temporal data and trajectories for moving object management. In this paper, we proposed a novel index structure for spatio-temporal aggregation of trajectory in a constrained network, named aCN-RB-tree. It manages aggregation values of trajectories using a constraint network-based index and it also supports direction of trajectory. An aCN-RB-tree consists of an aR-tree in its center and an extended B-tree. In this structure, an aR-tree is similar to a Min/Max R-tree, which stores the child nodes' max aggregation value in the parent node. Also, the proposed index structure is based on a constrained network structure such as a FNR-tree, so that it can decrease the dead space of index nodes. Each leaf node of an aR-tree has an extended B-tree which can store timestamp-based aggregation values. As it considers the direction of trajectory, the extended B-tree has a structure with direction. So this kind of aCN-RB-tree index can support efficient search for trajectory and traffic zone. The aCN-RB-tree can find a moving object trajectory in a given time interval efficiently. It can support traffic management systems and mining systems in ubiquitous environments.

A Design Method Reducing the Effect of Zeros of a Cascaded Three-Parameters Controller: The Characteristic Ratio Assignment Approach (종속형제어기의 영점의 영향을 고려한 저차제어기의 설계: 특성비지정 접근법)

  • Hua, Jin Li;Lee, Kwan-Ho;Kim, Young-Chol
    • Proceedings of the KIEE Conference
    • /
    • 2005.10b
    • /
    • pp.158-160
    • /
    • 2005
  • This paper presents a new approach to the problem of designing a cascaded three-parameters controller for a given linear time invariant (LTD plant in unity feedback system. We consider a proportional-integral-derivative (PID) and a first-order controller with specified overshoot and settling time. This problem is difficult to solve because there may be no analytical solution due to the use of low-order controller and furthermore. the zeros of controller just appear in the zeros of feedback system. The key idea of our method is to impose a constraint on the controller parameters so that the zeros of resulting controller are distant from the dominant pole of closed-loop system to the left as far as the given interval. Two methods realizing the idea are suggested. We have employed the characteristic ratio assignment (CRA) in order to deal with the time response specifications. It is noted that the proposed methods are accomplished only in parameter space. Several illustrative examples are given.

  • PDF