Pub Date : 2008-09-03DOI: 10.1109/INDIN.2008.4618104
G. Hartner, A. Gerstinger
This work covers a generic approach to fault detection for operating systems in fail-safe environments. A safety supervision layer between the application layer and the operating system interface is discussed. It is an attempt to detect operating system and hardware faults in an end-to-end way. Standard POSIX system calls are wrapped by procedures that provide fault detection features. Furthermore, potentials of an additional watchdog module on top of the operating system interface are analyzed. Applications that use the Safety Supervision Layer are notified of detected faults and deal with them by providing specific handlers to bring the fail-safe system to its safe state. The goal of the presented layer is to encapsulate the operating system and hardware layers a safety-critical application resides on, in order to detect faults produced by those and bring the system to a safe state. Advantages of such an attempt are portability, lower time-to-market, higher cost efficiency in building fail-safe systems and - most important - reduced error detection latency compared to usual periodic supervision approaches.
{"title":"Safety supervision layer","authors":"G. Hartner, A. Gerstinger","doi":"10.1109/INDIN.2008.4618104","DOIUrl":"https://doi.org/10.1109/INDIN.2008.4618104","url":null,"abstract":"This work covers a generic approach to fault detection for operating systems in fail-safe environments. A safety supervision layer between the application layer and the operating system interface is discussed. It is an attempt to detect operating system and hardware faults in an end-to-end way. Standard POSIX system calls are wrapped by procedures that provide fault detection features. Furthermore, potentials of an additional watchdog module on top of the operating system interface are analyzed. Applications that use the Safety Supervision Layer are notified of detected faults and deal with them by providing specific handlers to bring the fail-safe system to its safe state. The goal of the presented layer is to encapsulate the operating system and hardware layers a safety-critical application resides on, in order to detect faults produced by those and bring the system to a safe state. Advantages of such an attempt are portability, lower time-to-market, higher cost efficiency in building fail-safe systems and - most important - reduced error detection latency compared to usual periodic supervision approaches.","PeriodicalId":112553,"journal":{"name":"2008 6th IEEE International Conference on Industrial Informatics","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121090305","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-07-13DOI: 10.1109/INDIN.2008.4618055
D. Kim
Summary form only given. The semiconductor industry has increased the size of wafers from 150 mm to 450 mm to improve productivity. This change has necessitated the need for innovations in the sizes of FABs, equipments, and transportation systems. the increase in the size of FABs, in particular, has resulted in many changes in transportation systems. The increase in wafer sizes has led to an increase in front opening unified pod (FOUP) weight, reducing manual handling by operators and bringing to light the importance of automated material handling systems (AMHS). The transportation systems of FABs can be largely divided into intra-bay and inter-bay. The initial 150 mm FABs relied only on overhead shuttles (OHS) for automatic inter-bay transportation, while the 200 mm FABs added automatic guided vehicles (AGV) for automatic intra-bay transportation. The 300 mm FABs introduced a segregated approach where high-speed overhead hoist transports (OHT) are used for intra bay transportation and OHSpsilas are used for inter-bay transportation. The inefficiency of operating intra-bay and inter-bay transportation in a segregated manner in 300 mm FABs has recently been raised, so a unified approach where OHTpsilas are used for both intra- and inter-bay transportation has been developed. Also, side track buffers (STB) and under track buffer (UTB) have been installed on OHT rails to minimize the footprint of stockers, resulting in minimal equipment rundown and reduced turn-around time (TAT) of semiconductor production. The standard for 450 mm fabs is currently being heavily discussed within the International Sematech Manufacturing Initiative (ISMI).
{"title":"The evolution of automated material handling systems (AMHS) in semiconductor fabrication facilities","authors":"D. Kim","doi":"10.1109/INDIN.2008.4618055","DOIUrl":"https://doi.org/10.1109/INDIN.2008.4618055","url":null,"abstract":"Summary form only given. The semiconductor industry has increased the size of wafers from 150 mm to 450 mm to improve productivity. This change has necessitated the need for innovations in the sizes of FABs, equipments, and transportation systems. the increase in the size of FABs, in particular, has resulted in many changes in transportation systems. The increase in wafer sizes has led to an increase in front opening unified pod (FOUP) weight, reducing manual handling by operators and bringing to light the importance of automated material handling systems (AMHS). The transportation systems of FABs can be largely divided into intra-bay and inter-bay. The initial 150 mm FABs relied only on overhead shuttles (OHS) for automatic inter-bay transportation, while the 200 mm FABs added automatic guided vehicles (AGV) for automatic intra-bay transportation. The 300 mm FABs introduced a segregated approach where high-speed overhead hoist transports (OHT) are used for intra bay transportation and OHSpsilas are used for inter-bay transportation. The inefficiency of operating intra-bay and inter-bay transportation in a segregated manner in 300 mm FABs has recently been raised, so a unified approach where OHTpsilas are used for both intra- and inter-bay transportation has been developed. Also, side track buffers (STB) and under track buffer (UTB) have been installed on OHT rails to minimize the footprint of stockers, resulting in minimal equipment rundown and reduced turn-around time (TAT) of semiconductor production. The standard for 450 mm fabs is currently being heavily discussed within the International Sematech Manufacturing Initiative (ISMI).","PeriodicalId":112553,"journal":{"name":"2008 6th IEEE International Conference on Industrial Informatics","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115314275","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-07-13DOI: 10.1109/INDIN.2008.4618209
A. Lobov, Juha Puttonen, V. V. Herrera, Rajasekaran Andiappan, J. Lastra
The control of manufacturing systems is traditionally addresses the needs of products or product family that the system is going to manufacture. That is, the needs for the products are defined prior to the design of the production line. Although some degree of flexibility (in the terms of product family) can be implemented in the system, such systems may still have limitations in not allowing rapid reconfiguration as a new product with unforeseen needs arrives at runtime. Such a scenario usually requires (partial) reprogramming of the production line to accommodate new products. This paper presents a service-oriented orchestration framework for seamless integration of service-enabled devices to allow rapid reconfiguration and dynamic discovery of the devices abstracted as web services.
{"title":"Service oriented architecture in developing of loosely-coupled manufacturing systems","authors":"A. Lobov, Juha Puttonen, V. V. Herrera, Rajasekaran Andiappan, J. Lastra","doi":"10.1109/INDIN.2008.4618209","DOIUrl":"https://doi.org/10.1109/INDIN.2008.4618209","url":null,"abstract":"The control of manufacturing systems is traditionally addresses the needs of products or product family that the system is going to manufacture. That is, the needs for the products are defined prior to the design of the production line. Although some degree of flexibility (in the terms of product family) can be implemented in the system, such systems may still have limitations in not allowing rapid reconfiguration as a new product with unforeseen needs arrives at runtime. Such a scenario usually requires (partial) reprogramming of the production line to accommodate new products. This paper presents a service-oriented orchestration framework for seamless integration of service-enabled devices to allow rapid reconfiguration and dynamic discovery of the devices abstracted as web services.","PeriodicalId":112553,"journal":{"name":"2008 6th IEEE International Conference on Industrial Informatics","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115384375","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-07-13DOI: 10.1109/INDIN.2008.4618084
Y. Ling, Xiaoguang Xu, L. Shen, Jingmeng Liu
With the uncertainty of the multi sensor data of the fuzzy neural network fusion, the measure data from sensors is used to as the input of the fuzzy neural network and then is fuzzed. Next the data is analyzed and disposed by the neural network rule. Finally it is output after defuzzification. Confronting with the input fuzzification with uncertain membership function, we adopt the golden partition method to decide the initial center and width of membership functions of the fuzzification layer. The way of the model fuzzification and the improved BP network study rule is introduced to the network judging rule, and the judging result is output after defuzzification according to the weight rule. The article gives a general method of the multi sensor data gaining based on fuzzy neural network. The structure of network is rational and has rather quick training speed. It also has good generalization ability.
{"title":"Multi sensor data fusion method based on fuzzy neural network","authors":"Y. Ling, Xiaoguang Xu, L. Shen, Jingmeng Liu","doi":"10.1109/INDIN.2008.4618084","DOIUrl":"https://doi.org/10.1109/INDIN.2008.4618084","url":null,"abstract":"With the uncertainty of the multi sensor data of the fuzzy neural network fusion, the measure data from sensors is used to as the input of the fuzzy neural network and then is fuzzed. Next the data is analyzed and disposed by the neural network rule. Finally it is output after defuzzification. Confronting with the input fuzzification with uncertain membership function, we adopt the golden partition method to decide the initial center and width of membership functions of the fuzzification layer. The way of the model fuzzification and the improved BP network study rule is introduced to the network judging rule, and the judging result is output after defuzzification according to the weight rule. The article gives a general method of the multi sensor data gaining based on fuzzy neural network. The structure of network is rational and has rather quick training speed. It also has good generalization ability.","PeriodicalId":112553,"journal":{"name":"2008 6th IEEE International Conference on Industrial Informatics","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115723021","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-07-13DOI: 10.1109/INDIN.2008.4618138
Chanhun Park, Kyoungtaik Park
The developed dual arm robot manipulator which consists of two industrial 6-DOF arms and one 2-DOF torso is introduced. This dual arm robot manipulator is designed for the assembly automation of the automotive parts. Each industrial 6-DOF arm can be used as a stand-alone type of industrial 6-DOF robot manipulator and as a part of dual arm manipulator at the same time. These structures help the robot maker which is willing to succeed in emerging market of dual arm robot have the high competition for the current industrial robot market and emerging market of dual arm robot at the same time. The research results of the design concept and kinematics analysis will be introduced.
{"title":"Design and kinematics analysis of dual arm robot manipulator for precision assembly","authors":"Chanhun Park, Kyoungtaik Park","doi":"10.1109/INDIN.2008.4618138","DOIUrl":"https://doi.org/10.1109/INDIN.2008.4618138","url":null,"abstract":"The developed dual arm robot manipulator which consists of two industrial 6-DOF arms and one 2-DOF torso is introduced. This dual arm robot manipulator is designed for the assembly automation of the automotive parts. Each industrial 6-DOF arm can be used as a stand-alone type of industrial 6-DOF robot manipulator and as a part of dual arm manipulator at the same time. These structures help the robot maker which is willing to succeed in emerging market of dual arm robot have the high competition for the current industrial robot market and emerging market of dual arm robot at the same time. The research results of the design concept and kinematics analysis will be introduced.","PeriodicalId":112553,"journal":{"name":"2008 6th IEEE International Conference on Industrial Informatics","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124405414","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-07-13DOI: 10.1109/INDIN.2008.4618094
L. Lianzhong, Liu Peng
In the Internet-age, the geographical boundaries that have previously impinged upon inter-organization collaborations have become decreasingly important. However, ensuring secure and authorized access to remote services and information resource in a dynamic collaborative environment is a challenging task. According to some recent literatures, trust between users in different security domains or organizations is an effective method to this problem. However, only trust is not enough because of the complexity and burden of authorization. So we integrate role into our trust model to simplify the management of access control. Moreover, in order to make the dynamic collaboration between different domains more secure, we present the constraint to authorization and operations of the users in foreign domains.
{"title":"A trusted role-based access control model for dymanic collaboration in a federated environment","authors":"L. Lianzhong, Liu Peng","doi":"10.1109/INDIN.2008.4618094","DOIUrl":"https://doi.org/10.1109/INDIN.2008.4618094","url":null,"abstract":"In the Internet-age, the geographical boundaries that have previously impinged upon inter-organization collaborations have become decreasingly important. However, ensuring secure and authorized access to remote services and information resource in a dynamic collaborative environment is a challenging task. According to some recent literatures, trust between users in different security domains or organizations is an effective method to this problem. However, only trust is not enough because of the complexity and burden of authorization. So we integrate role into our trust model to simplify the management of access control. Moreover, in order to make the dynamic collaboration between different domains more secure, we present the constraint to authorization and operations of the users in foreign domains.","PeriodicalId":112553,"journal":{"name":"2008 6th IEEE International Conference on Industrial Informatics","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124262980","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Channel estimation is very important for suppressing interference and de-multiplexing signals. First, the structure of OFDM receiver system based on IEEE 802.11 a is established. Then, least square (LS) based channel estimation algorithm is mainly studied. Combing with the character of the preamble frame in IEEE 802.11a protocol, by using of the two long training symbol sequences in the frame preamble and de-noising technology with filters, a novel simple method to estimate channel is proposed. Simulations are done to the algorithm on some aspects such as the mean square error (MSE), constellation map of the demodulated data, bit error rate (BER) and the performance after de-noising with filters. Results show that this method could enhance the performance of the receiver in a certain level. At last, performances of the whole transceiver system based on IEEE 802.11a standard are simulated. It can be concluded that the performance of the OFDM receiver system is able to meet the requirement of IEEE 802.11a standard. Furthermore, the results prove the validity of our research on OFDM receiverpsilas channel estimation.
{"title":"Research on channel estimation for OFDM receiver based on IEEE 802.11a","authors":"Huimei Yuan, Yingzhuan Ling, Hao-xiang Sun, Wen Chen","doi":"10.1109/INDIN.2008.4618061","DOIUrl":"https://doi.org/10.1109/INDIN.2008.4618061","url":null,"abstract":"Channel estimation is very important for suppressing interference and de-multiplexing signals. First, the structure of OFDM receiver system based on IEEE 802.11 a is established. Then, least square (LS) based channel estimation algorithm is mainly studied. Combing with the character of the preamble frame in IEEE 802.11a protocol, by using of the two long training symbol sequences in the frame preamble and de-noising technology with filters, a novel simple method to estimate channel is proposed. Simulations are done to the algorithm on some aspects such as the mean square error (MSE), constellation map of the demodulated data, bit error rate (BER) and the performance after de-noising with filters. Results show that this method could enhance the performance of the receiver in a certain level. At last, performances of the whole transceiver system based on IEEE 802.11a standard are simulated. It can be concluded that the performance of the OFDM receiver system is able to meet the requirement of IEEE 802.11a standard. Furthermore, the results prove the validity of our research on OFDM receiverpsilas channel estimation.","PeriodicalId":112553,"journal":{"name":"2008 6th IEEE International Conference on Industrial Informatics","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116941671","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-07-13DOI: 10.1109/INDIN.2008.4618185
Shady M. K. Mohamed, S. Nahavandi
The use of Kalman filtering is very common in state estimation problems. The problem with Kalman filters is that they require full prior knowledge about the system modeling. It is also assumed that all the observations are fully received. In real applications, the previous assumptions are not true all the time. It is hard to obtain the exact system model and the observations may be lost due to communication problems. In this paper, we consider the design of a robust Kalman filter for systems subject to uncertainties in the state and white noise covariances. The systems under consideration suffer from random interruptions in the measurements process. An upper bound for the estimation error covariance is proposed. The proposed upper bound is further minimized by selection of optimal filter parameters. Simulation example shows the effectiveness of the proposed filter.
{"title":"Robust filtering for uncertain discrete-time systems with uncertain noise covariance and uncertain observations","authors":"Shady M. K. Mohamed, S. Nahavandi","doi":"10.1109/INDIN.2008.4618185","DOIUrl":"https://doi.org/10.1109/INDIN.2008.4618185","url":null,"abstract":"The use of Kalman filtering is very common in state estimation problems. The problem with Kalman filters is that they require full prior knowledge about the system modeling. It is also assumed that all the observations are fully received. In real applications, the previous assumptions are not true all the time. It is hard to obtain the exact system model and the observations may be lost due to communication problems. In this paper, we consider the design of a robust Kalman filter for systems subject to uncertainties in the state and white noise covariances. The systems under consideration suffer from random interruptions in the measurements process. An upper bound for the estimation error covariance is proposed. The proposed upper bound is further minimized by selection of optimal filter parameters. Simulation example shows the effectiveness of the proposed filter.","PeriodicalId":112553,"journal":{"name":"2008 6th IEEE International Conference on Industrial Informatics","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125740961","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-07-13DOI: 10.1109/INDIN.2008.4618378
W. Weng, S. Fujimura
The just-in-time (JIT) concept is of great importance in many manufacturing processes. JIT scheduling problems affects the performance of the whole production procedure, because early in job completion causes inventory cost while delay in job completion raises penalties paid to customers. In this paper, a memorial self evolution algorithm is proposed to solve the problem of total earliness and tardiness penalties on a machine unit with a common due date. Up to now, researches on this problem have paid no specific attention to straddling V-shaped schedules, which may be better than pure V-shaped schedules for early due date cases; and no specific discussions have been made on the start time setting of the first job in a schedule. Thus, efforts have been made on searching good straddling V-shaped schedules, and optimizing start time setting of schedules. A GHRM approach is proposed to create the initial solution for memorial self evolution. Meanwhile a database which keeps the memories of the elite solutions is introduced to deliver better initial solutions for similar problems. The performance of the proposed algorithm has been tested on 280 benchmark instances ranging from 10 to 1000 jobs. The results show that the proposed memorial self evolution algorithm delivers better results in in finding optimal or near-optimal solutions than previous researches.
{"title":"Memorial self evolution algorithm to solve JIT machine scheduling problem","authors":"W. Weng, S. Fujimura","doi":"10.1109/INDIN.2008.4618378","DOIUrl":"https://doi.org/10.1109/INDIN.2008.4618378","url":null,"abstract":"The just-in-time (JIT) concept is of great importance in many manufacturing processes. JIT scheduling problems affects the performance of the whole production procedure, because early in job completion causes inventory cost while delay in job completion raises penalties paid to customers. In this paper, a memorial self evolution algorithm is proposed to solve the problem of total earliness and tardiness penalties on a machine unit with a common due date. Up to now, researches on this problem have paid no specific attention to straddling V-shaped schedules, which may be better than pure V-shaped schedules for early due date cases; and no specific discussions have been made on the start time setting of the first job in a schedule. Thus, efforts have been made on searching good straddling V-shaped schedules, and optimizing start time setting of schedules. A GHRM approach is proposed to create the initial solution for memorial self evolution. Meanwhile a database which keeps the memories of the elite solutions is introduced to deliver better initial solutions for similar problems. The performance of the proposed algorithm has been tested on 280 benchmark instances ranging from 10 to 1000 jobs. The results show that the proposed memorial self evolution algorithm delivers better results in in finding optimal or near-optimal solutions than previous researches.","PeriodicalId":112553,"journal":{"name":"2008 6th IEEE International Conference on Industrial Informatics","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125950045","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-07-13DOI: 10.1109/INDIN.2008.4618371
Kelvin Leong, Joseph Y. H. So, Vincent Ng, Mike Li, T. T. Chee
Because of globalization, multinational firms tend to setup branches across nations for different functions, such as manufacturing lines in China, logistics in Asia, sales points in Europe etc. In order to communicate among each other, the industry has to adopt the same communication platform, use the same terms, and speak the same ldquolanguagerdquo. Therefore, in recent years, a new standardized computer language, eXtensible Business Reporting Language (XBRL), has been developing enhancing different organizations exchanging their financial data without re-enter them. XBRL is a relatively new technology. The research about XBRL instance transformation algorithm is not found yet. In this paper, we developed an algorithm to transform these data into XBRL-compliance format, so that we can take the advantages of XBRL. Our algorithm is named XBRL Transformer (XT). It includes two main modules, XT-Source2XML and XT-XML2XBRL. XT Source2XML transforms a source file, such as MS-Excel, Lotus 123, MS-Word, MS-Access, etc., to a corresponding XML file, and then it outputs the corresponding XML to the second tier, XT-XML2XBRL. After XT-XML2XBRL receives an XML file, it will transform it to XBRL instance file.
{"title":"XT algorithm for business data exchange","authors":"Kelvin Leong, Joseph Y. H. So, Vincent Ng, Mike Li, T. T. Chee","doi":"10.1109/INDIN.2008.4618371","DOIUrl":"https://doi.org/10.1109/INDIN.2008.4618371","url":null,"abstract":"Because of globalization, multinational firms tend to setup branches across nations for different functions, such as manufacturing lines in China, logistics in Asia, sales points in Europe etc. In order to communicate among each other, the industry has to adopt the same communication platform, use the same terms, and speak the same ldquolanguagerdquo. Therefore, in recent years, a new standardized computer language, eXtensible Business Reporting Language (XBRL), has been developing enhancing different organizations exchanging their financial data without re-enter them. XBRL is a relatively new technology. The research about XBRL instance transformation algorithm is not found yet. In this paper, we developed an algorithm to transform these data into XBRL-compliance format, so that we can take the advantages of XBRL. Our algorithm is named XBRL Transformer (XT). It includes two main modules, XT-Source2XML and XT-XML2XBRL. XT Source2XML transforms a source file, such as MS-Excel, Lotus 123, MS-Word, MS-Access, etc., to a corresponding XML file, and then it outputs the corresponding XML to the second tier, XT-XML2XBRL. After XT-XML2XBRL receives an XML file, it will transform it to XBRL instance file.","PeriodicalId":112553,"journal":{"name":"2008 6th IEEE International Conference on Industrial Informatics","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125951852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：