scholarly journals A Fuzzy Drift Correlation Matrix for Multiple Data Stream Regression

Author(s):  
Yiliao Song ◽  
Guangquan Zhang ◽  
Haiyan Lu ◽  
Jie Lu
Author(s):  
Brian A. Weiss ◽  
Jared Kaplan

Abstract Manufacturing processes have become increasingly sophisticated leading to greater usage of robotics. Sustaining successful manufacturing robotic operations requires a strategic maintenance program. Maintenance can be very costly, especially when some manufacturers unnecessarily spend resources (i.e., time, money) to maintain their equipment. To reduce maintenance costs, manufacturers are exploring how they can assess the health of their robot workcell operations to enhance their maintenance strategies. Effective health assessment relies upon capturing appropriate data and generating intelligence from the workcell. Multiple data streams relevant to a robot workcell may be available including robot controller data, a supervisory programmable logic controller data, maintenance logs, process/part quality data, and equipment/process fault and/or failure data. This data can be extremely informative, yet the extreme volume and complexity of this data can be both overwhelming, confusing, and paralyzing. Researchers at the National Institute of Standards and Technology have developed a test method and companion sensor to assess the health of robot workcells, which will yield an additional and unique data stream. The intent is that this data stream can either serve as a surrogate for larger data volumes to reduce the data collection and analysis burden on the manufacturer or add more intelligence to assessing robot workcell health. This article will present the immediate effort focused on verifying the companion sensor. Results of the verification test process are discussed along with preliminary results of the sensor’s performance during verification testing.


2011 ◽  
Vol 7 (4) ◽  
pp. 1-20 ◽  
Author(s):  
Reem Al-Mulla ◽  
Zaher Al Aghbari

In recent years, new applications emerged that produce data streams, such as stock data and sensor networks. Therefore, finding frequent subsequences, or clusters of subsequences, in data streams is an essential task in data mining. Data streams are continuous in nature, unbounded in size and have a high arrival rate. Due to these characteristics, traditional clustering algorithms fail to effectively find clusters in data streams. Thus, an efficient incremental algorithm is proposed to find frequent subsequences in multiple data streams. The described approach for finding frequent subsequences is by clustering subsequences of a data stream. The proposed algorithm uses a window model to buffer the continuous data streams. Further, it does not recompute the clustering results for the whole data stream at every window, but rather it builds on clustering results of previous windows. The proposed approach also employs a decay value for each discovered cluster to determine when to remove old clusters and retain recent ones. In addition, the proposed algorithm is efficient as it scans the data streams once and it is considered an Any-time algorithm since the frequent subsequences are ready at the end of every window.


Author(s):  
Reem Al-Mulla ◽  
Zaher Al Aghbari

In recent years, new applications emerged that produce data streams, such as stock data and sensor networks. Therefore, finding frequent subsequences, or clusters of subsequences, in data streams is an essential task in data mining. Data streams are continuous in nature, unbounded in size and have a high arrival rate. Due to these characteristics, traditional clustering algorithms fail to effectively find clusters in data streams. Thus, an efficient incremental algorithm is proposed to find frequent subsequences in multiple data streams. The described approach for finding frequent subsequences is by clustering subsequences of a data stream. The proposed algorithm uses a window model to buffer the continuous data streams. Further, it does not recompute the clustering results for the whole data stream at every window, but rather it builds on clustering results of previous windows. The proposed approach also employs a decay value for each discovered cluster to determine when to remove old clusters and retain recent ones. In addition, the proposed algorithm is efficient as it scans the data streams once and it is considered an Any-time algorithm since the frequent subsequences are ready at the end of every window.


2021 ◽  
Author(s):  
Daniel Cardoso Braga ◽  
Mohammadreza Kamyab ◽  
Brian Harclerode ◽  
Deep Joshi

Abstract During drilling, surveys to determine the wellbore trajectory are performed at every drilling connection. However, due to the offset between the survey instrument and the bit (typically between 30-100 ft), this survey represents the sensor's position which is lagged compared to the bit. This paper describes a method to automatically calculate projections to the bit in real-time utilizing multiple data sources: WITSML stream, BHA components and rotary trend analysis while rotary drilling. The projection to the bit calculation routine is performed in real time every 30 seconds. This paper presents results of projections for four horizontal unconventional wells drilled in West Texas. Nearly 75,000 projections were generated on the four wells, validated with 839 survey stations, with median divergence of the projections from the nearest survey stations being less than one foot.


Sign in / Sign up

Export Citation Format

Share Document