Pub Date : 2006-05-07DOI: 10.1109/CCECE.2006.277384
Dounia Habhouba, A. Desrochers, S. Cherkaoui
Engineering change management of mechanical products is a critical task which poses many challenges for industrials. Both the integration of the various tools intervening in the life cycle of a product and the management of the communication between the various multidisciplinary teams working on a product are difficult tasks. The communication between disciplines is currently performed mostly using message exchange. The approval process of an engineering change can be achieved only if experts representing the various disciplines meet and agree on the change, which can require a lot of time. This paper proposes an agent-based approach that ensures the propagation of an engineering change towards the external systems concerned. It also checks if the engineering change proposed for a mechanical product does not create any inconsistency with the constraints from the various disciplines involved. Each discipline is represented by an expert agent. When an inconsistency is discovered, a negotiation process is launched
{"title":"Engineering Change Management and Decision-Making Assistance using Software Agent","authors":"Dounia Habhouba, A. Desrochers, S. Cherkaoui","doi":"10.1109/CCECE.2006.277384","DOIUrl":"https://doi.org/10.1109/CCECE.2006.277384","url":null,"abstract":"Engineering change management of mechanical products is a critical task which poses many challenges for industrials. Both the integration of the various tools intervening in the life cycle of a product and the management of the communication between the various multidisciplinary teams working on a product are difficult tasks. The communication between disciplines is currently performed mostly using message exchange. The approval process of an engineering change can be achieved only if experts representing the various disciplines meet and agree on the change, which can require a lot of time. This paper proposes an agent-based approach that ensures the propagation of an engineering change towards the external systems concerned. It also checks if the engineering change proposed for a mechanical product does not create any inconsistency with the constraints from the various disciplines involved. Each discipline is represented by an expert agent. When an inconsistency is discovered, a negotiation process is launched","PeriodicalId":212110,"journal":{"name":"2006 Canadian Conference on Electrical and Computer Engineering","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114666003","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 : 2006-05-07DOI: 10.1109/CCECE.2006.277834
Abdul-Rafeeq Abdul-Shakoor, V. Szwarc
This paper presents a configurable 3-bit soft decision Viterbi decoder implementation that meets the requirements for WLAN and broadband applications. The programmable design supports a constraint length K=7 soft decision Viterbi decoder (SDVD) realization with a code rate (R) of 1/2 and traceback lengths (TBL) of 35 and 50 symbols. To assure a throughput of 155 Mbps, an architecture incorporating 32 add compare select (ACS) units operating in parallel has been selected. The design incorporates a built-in self-test for operation at the rated throughput. The VHDL simulation results are verified against a functional model of the Viterbi decoder reflecting the hardware architecture in the Matlab simulation environment. The decoder architecture is defined in VHDL and the circuit is simulated, synthesized, and implemented on a Xilinx XC2VP100-1704ff-5 FPGA device
{"title":"A High Performance Soft Decision Viterbi Decoder for Wlan and Broadband Applications","authors":"Abdul-Rafeeq Abdul-Shakoor, V. Szwarc","doi":"10.1109/CCECE.2006.277834","DOIUrl":"https://doi.org/10.1109/CCECE.2006.277834","url":null,"abstract":"This paper presents a configurable 3-bit soft decision Viterbi decoder implementation that meets the requirements for WLAN and broadband applications. The programmable design supports a constraint length K=7 soft decision Viterbi decoder (SDVD) realization with a code rate (R) of 1/2 and traceback lengths (TBL) of 35 and 50 symbols. To assure a throughput of 155 Mbps, an architecture incorporating 32 add compare select (ACS) units operating in parallel has been selected. The design incorporates a built-in self-test for operation at the rated throughput. The VHDL simulation results are verified against a functional model of the Viterbi decoder reflecting the hardware architecture in the Matlab simulation environment. The decoder architecture is defined in VHDL and the circuit is simulated, synthesized, and implemented on a Xilinx XC2VP100-1704ff-5 FPGA device","PeriodicalId":212110,"journal":{"name":"2006 Canadian Conference on Electrical and Computer Engineering","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124281110","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 : 2006-05-07DOI: 10.1109/CCECE.2006.277598
B. Pelletier, B. Champagne
Multiuser detection (MUD) techniques are known to improve the performance of CDMA cellular communication systems. This performance improvement usually comes at a large computational cost. To reduce the complexity, it has been proposed recently to exploit the spatial dimension by grouping users in clusters and apply MUD individually to each group. This approach leads to a potentially significant complexity reduction, at a marginal cost in performance. In this work we propose a new space-time receiver structure based on the group-optimal MMSE linear detector. The numerical results show that the proposed technique performs close to the optimal full space-time linear MMSE MUD receiver but with a significantly lower complexity
{"title":"Group-Optimal Linear Space-Time Multiuser Detection","authors":"B. Pelletier, B. Champagne","doi":"10.1109/CCECE.2006.277598","DOIUrl":"https://doi.org/10.1109/CCECE.2006.277598","url":null,"abstract":"Multiuser detection (MUD) techniques are known to improve the performance of CDMA cellular communication systems. This performance improvement usually comes at a large computational cost. To reduce the complexity, it has been proposed recently to exploit the spatial dimension by grouping users in clusters and apply MUD individually to each group. This approach leads to a potentially significant complexity reduction, at a marginal cost in performance. In this work we propose a new space-time receiver structure based on the group-optimal MMSE linear detector. The numerical results show that the proposed technique performs close to the optimal full space-time linear MMSE MUD receiver but with a significantly lower complexity","PeriodicalId":212110,"journal":{"name":"2006 Canadian Conference on Electrical and Computer Engineering","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127495014","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 : 2006-05-07DOI: 10.1109/CCECE.2006.277495
J. Carter, W. B. Gardner
To help programmers of high-performance computing (HPC) systems avoid communication-related errors, we employ a formal process algebra, communicating sequential processes (CSP), which has a strict semantics for interprocess communication and synchronization. Verification tools are available for CSP-specified programs to prove the absence of failures such as deadlock, and to explore potential multiprocess interactions. By introducing a CSP abstraction layer on top of the popular MPI message-passing primitives, we create a framework, called CSP4MPI, designed to largely hide the complexity of parallel programming for HPC. CSP4MPI is comprised of a C++ class library that provides a CSP-based process model, and a "cookbook" of candidate solutions for HPC programmers not trained in CSP. Developers can prototype their systems using CSP, and use verification tools to examine possible points of failure before implementing via the CSP4MPI library. Alternatively, they may choose an existing, verified solution from a number of common parallel application archetypes. By using CSP4MPI, HPC developers leverage the benefits of formal specification and verification in their work, in addition to obtaining an alternate method to developing HPC applications
{"title":"A Formal CSP Framework for Message-Passing HPC Programming","authors":"J. Carter, W. B. Gardner","doi":"10.1109/CCECE.2006.277495","DOIUrl":"https://doi.org/10.1109/CCECE.2006.277495","url":null,"abstract":"To help programmers of high-performance computing (HPC) systems avoid communication-related errors, we employ a formal process algebra, communicating sequential processes (CSP), which has a strict semantics for interprocess communication and synchronization. Verification tools are available for CSP-specified programs to prove the absence of failures such as deadlock, and to explore potential multiprocess interactions. By introducing a CSP abstraction layer on top of the popular MPI message-passing primitives, we create a framework, called CSP4MPI, designed to largely hide the complexity of parallel programming for HPC. CSP4MPI is comprised of a C++ class library that provides a CSP-based process model, and a \"cookbook\" of candidate solutions for HPC programmers not trained in CSP. Developers can prototype their systems using CSP, and use verification tools to examine possible points of failure before implementing via the CSP4MPI library. Alternatively, they may choose an existing, verified solution from a number of common parallel application archetypes. By using CSP4MPI, HPC developers leverage the benefits of formal specification and verification in their work, in addition to obtaining an alternate method to developing HPC applications","PeriodicalId":212110,"journal":{"name":"2006 Canadian Conference on Electrical and Computer Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125901493","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 : 2006-05-07DOI: 10.1109/CCECE.2006.277684
Shaochun Xu, Xuhui Chen, Jianxin Mai
Incremental software development is a process in which programmers add one program property at a time. During the process, programmers deal with large volume of knowledge, such as domain concepts and design decisions. This knowledge can be useful for software maintenance and debugging process. However, due to the fact that it is evolvable, it cannot be fully recovered from the final source code or documentation. Therefore, a tool is needed to document this knowledge during incremental software development. KRecorder is a prototype tool built on the Eclipse platform, and based on the cognitive activities recognized: absorption, reorganization, denial and expulsion. It allows users to record the domain concepts and design decisions on the fly while they are implementing an application. The ASTParser in the Eclipse is used to parse the source code and extract all necessary information. With KRecorder, the design and implementation process of an application can be well documented and displayed, and therefore, can be used during maintenance and debugging
{"title":"Krecorder: An Eclipse Plug-in Tool for Incremental Software Development","authors":"Shaochun Xu, Xuhui Chen, Jianxin Mai","doi":"10.1109/CCECE.2006.277684","DOIUrl":"https://doi.org/10.1109/CCECE.2006.277684","url":null,"abstract":"Incremental software development is a process in which programmers add one program property at a time. During the process, programmers deal with large volume of knowledge, such as domain concepts and design decisions. This knowledge can be useful for software maintenance and debugging process. However, due to the fact that it is evolvable, it cannot be fully recovered from the final source code or documentation. Therefore, a tool is needed to document this knowledge during incremental software development. KRecorder is a prototype tool built on the Eclipse platform, and based on the cognitive activities recognized: absorption, reorganization, denial and expulsion. It allows users to record the domain concepts and design decisions on the fly while they are implementing an application. The ASTParser in the Eclipse is used to parse the source code and extract all necessary information. With KRecorder, the design and implementation process of an application can be well documented and displayed, and therefore, can be used during maintenance and debugging","PeriodicalId":212110,"journal":{"name":"2006 Canadian Conference on Electrical and Computer Engineering","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126048714","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 : 2006-05-07DOI: 10.1109/CCECE.2006.277639
E. Ghafar-Zadeh, M. Sawan
In this paper, a charge-based capacitive sensor with embedded electrodes inside microchannel is described for precision and reliable bioparticle detection. Also, a highly accurate switching calibration technique for this capacitive sensor is presented. The simulation results are demonstrated to support the discussed objectives throughout the paper
{"title":"CMOS based bioparticle capacitive sensor integrated with direct-write microfluidic devices","authors":"E. Ghafar-Zadeh, M. Sawan","doi":"10.1109/CCECE.2006.277639","DOIUrl":"https://doi.org/10.1109/CCECE.2006.277639","url":null,"abstract":"In this paper, a charge-based capacitive sensor with embedded electrodes inside microchannel is described for precision and reliable bioparticle detection. Also, a highly accurate switching calibration technique for this capacitive sensor is presented. The simulation results are demonstrated to support the discussed objectives throughout the paper","PeriodicalId":212110,"journal":{"name":"2006 Canadian Conference on Electrical and Computer Engineering","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123262014","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 : 2006-05-07DOI: 10.1109/CCECE.2006.277737
Yunfeng Peng, Derui Kong, F. Zhou
A novel high linear sampling switch suitable for low-voltage operation is proposed. It not only eliminates the nonlinearity introduced by the gate-source voltage variation, but also reduces the nonlinearity resulting from the threshold voltage variation which is not solved in the earlier low-voltage sampling switch. This is achieved by adopting a replica transistor which has the same threshold voltage as the sampling transistor. The effectiveness of this technique has been demonstrated by a prototype design of a sampling switch in 0.35 mum. Simulations show that the sampling switch has a more constant on-conductance and a significant higher SFDR. This method is especially useful for low-voltage, high resolution ADCs, which is one of the hot topics nowadays
{"title":"A Low-Voltage Sampling Switch with Improved Linearity","authors":"Yunfeng Peng, Derui Kong, F. Zhou","doi":"10.1109/CCECE.2006.277737","DOIUrl":"https://doi.org/10.1109/CCECE.2006.277737","url":null,"abstract":"A novel high linear sampling switch suitable for low-voltage operation is proposed. It not only eliminates the nonlinearity introduced by the gate-source voltage variation, but also reduces the nonlinearity resulting from the threshold voltage variation which is not solved in the earlier low-voltage sampling switch. This is achieved by adopting a replica transistor which has the same threshold voltage as the sampling transistor. The effectiveness of this technique has been demonstrated by a prototype design of a sampling switch in 0.35 mum. Simulations show that the sampling switch has a more constant on-conductance and a significant higher SFDR. This method is especially useful for low-voltage, high resolution ADCs, which is one of the hot topics nowadays","PeriodicalId":212110,"journal":{"name":"2006 Canadian Conference on Electrical and Computer Engineering","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123298742","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 : 2006-05-07DOI: 10.1109/CCECE.2006.277421
G. Ngantchaha, C. Tadj, A. Ramdane-Cherif
In spite of the rapid development of pervasive computing technologies, and their demonstrated usefulness in many area, it's seems difficult to take them out of academics laboratories to real life. One of the reasons behind their slow adoption and acceptance concern their capacity of being context-aware. This feature is of a big impact on privacy right. Being also aware of that, we propose in this paper new paradigm to implement in context-aware systems, and must of all, join ethnographic studies to the development of these systems. Their include mapping and classifying the pervasive area, and enabling user control on context information collection. The paradigms are integrated in the system through intelligent agents
{"title":"Contextguard: a multiagent system for controlling context","authors":"G. Ngantchaha, C. Tadj, A. Ramdane-Cherif","doi":"10.1109/CCECE.2006.277421","DOIUrl":"https://doi.org/10.1109/CCECE.2006.277421","url":null,"abstract":"In spite of the rapid development of pervasive computing technologies, and their demonstrated usefulness in many area, it's seems difficult to take them out of academics laboratories to real life. One of the reasons behind their slow adoption and acceptance concern their capacity of being context-aware. This feature is of a big impact on privacy right. Being also aware of that, we propose in this paper new paradigm to implement in context-aware systems, and must of all, join ethnographic studies to the development of these systems. Their include mapping and classifying the pervasive area, and enabling user control on context information collection. The paradigms are integrated in the system through intelligent agents","PeriodicalId":212110,"journal":{"name":"2006 Canadian Conference on Electrical and Computer Engineering","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126869508","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 : 2006-05-07DOI: 10.1109/CCECE.2006.277368
Xiaodong Liang, Y. Luy
Two types of harmonics are investigated for induction motors: space harmonics and time harmonics. Space harmonics are generated due to the different phase windings interaction when the power supply is sinusoidal and they can be reduced by applying a proper machine design. As an example, the electromagnetic field and corresponding harmonics of an electrical machine are calculated using the finite element method, the harmonic winding factors show how the space harmonics can be reduced significantly by good winding design. Because of the wide application of variable frequency drives, time harmonics have become a main concern related to motor performance in field operations. The harmonic equivalent circuits are presented in this paper for both space and time harmonics and they are powerful tools to calculate the motor parameters such as harmonic currents and torques. The formulas to calculate the harmonic slips and torques are derived, and the torque characteristics for both types of harmonics are compared
{"title":"Harmonic Analysis for Induction Motors","authors":"Xiaodong Liang, Y. Luy","doi":"10.1109/CCECE.2006.277368","DOIUrl":"https://doi.org/10.1109/CCECE.2006.277368","url":null,"abstract":"Two types of harmonics are investigated for induction motors: space harmonics and time harmonics. Space harmonics are generated due to the different phase windings interaction when the power supply is sinusoidal and they can be reduced by applying a proper machine design. As an example, the electromagnetic field and corresponding harmonics of an electrical machine are calculated using the finite element method, the harmonic winding factors show how the space harmonics can be reduced significantly by good winding design. Because of the wide application of variable frequency drives, time harmonics have become a main concern related to motor performance in field operations. The harmonic equivalent circuits are presented in this paper for both space and time harmonics and they are powerful tools to calculate the motor parameters such as harmonic currents and torques. The formulas to calculate the harmonic slips and torques are derived, and the torque characteristics for both types of harmonics are compared","PeriodicalId":212110,"journal":{"name":"2006 Canadian Conference on Electrical and Computer Engineering","volume":"474 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116523669","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 : 2006-05-07DOI: 10.1109/CCECE.2006.277351
M. Zaremba, F. Gougeon
A major shift in the forest inventory and management paradigm toward the use of semi-automated analysis realized on an individual tree crown basis has been made possible by recent developments in high-resolution remote sensing. This paper discusses issues related to the fusion of high-resolution satellite imagery and LIDAR (light detection and ranging) data and their application in the classification of individual trees for precision forest management. The proposed methodological approach consists in the combination of spatial filtering object detection and reconstruction methods with a rule-based individual tree crown (ITC) system. Examples using QuickBird imagery combined with LIDAR data from an Alberta site (both boreal and mixed forest) demonstrate the advantages of the proposed fusion approach
{"title":"Fusion of High-Resolution Satellite and Lidar Data for Individual Tree Recognition","authors":"M. Zaremba, F. Gougeon","doi":"10.1109/CCECE.2006.277351","DOIUrl":"https://doi.org/10.1109/CCECE.2006.277351","url":null,"abstract":"A major shift in the forest inventory and management paradigm toward the use of semi-automated analysis realized on an individual tree crown basis has been made possible by recent developments in high-resolution remote sensing. This paper discusses issues related to the fusion of high-resolution satellite imagery and LIDAR (light detection and ranging) data and their application in the classification of individual trees for precision forest management. The proposed methodological approach consists in the combination of spatial filtering object detection and reconstruction methods with a rule-based individual tree crown (ITC) system. Examples using QuickBird imagery combined with LIDAR data from an Alberta site (both boreal and mixed forest) demonstrate the advantages of the proposed fusion approach","PeriodicalId":212110,"journal":{"name":"2006 Canadian Conference on Electrical and Computer Engineering","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122670507","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
扫码关注我们
求助内容：
应助结果提醒方式：