首页 > 最新文献

The Case manager最新文献

英文 中文
Time-delay estimation of ultrasonic echoes based on the physical model matching 基于物理模型匹配的超声回波时延估计
Pub Date : 2012-12-24 DOI: 10.1109/CoASE.2012.6386333
Xiaole Yan, Lichen Gu
The estimation of time of flight (TOF) is fundamental to many ultrasonic-based techniques. This paper presents a novel method for estimating time delay of ultrasonic echoes based on vibration theory and signal processing methods. The method is inspired by the physical model of ultrasonic echoes that shows the rising edge of ultrasonic echoes depends on the damping factor of the vibration part of the ultrasonic transducer. The physical model is analyzed and simulated for the understand of the time-domain characters of ultrasonic echoes. For applications, the threshold method is also considered in the method. Two traditional methods of TOF are compared with the proposed by experiment data. It is shown that the proposed method can estimate the starting point of the ultrasonic echo quickly and effectively in the real ranging system.
飞行时间(TOF)的估计是许多超声技术的基础。基于振动理论和信号处理方法,提出了一种估计超声回波时延的新方法。该方法的灵感来源于超声回波的物理模型,该模型表明超声回波的上升沿取决于超声换能器振动部分的阻尼系数。为了解超声回波的时域特性,对物理模型进行了分析和仿真。对于应用,方法中还考虑了阈值法。通过实验数据对两种传统的TOF方法进行了比较。结果表明,该方法在实际测距系统中能够快速有效地估计出超声回波的起始点。
{"title":"Time-delay estimation of ultrasonic echoes based on the physical model matching","authors":"Xiaole Yan, Lichen Gu","doi":"10.1109/CoASE.2012.6386333","DOIUrl":"https://doi.org/10.1109/CoASE.2012.6386333","url":null,"abstract":"The estimation of time of flight (TOF) is fundamental to many ultrasonic-based techniques. This paper presents a novel method for estimating time delay of ultrasonic echoes based on vibration theory and signal processing methods. The method is inspired by the physical model of ultrasonic echoes that shows the rising edge of ultrasonic echoes depends on the damping factor of the vibration part of the ultrasonic transducer. The physical model is analyzed and simulated for the understand of the time-domain characters of ultrasonic echoes. For applications, the threshold method is also considered in the method. Two traditional methods of TOF are compared with the proposed by experiment data. It is shown that the proposed method can estimate the starting point of the ultrasonic echo quickly and effectively in the real ranging system.","PeriodicalId":80307,"journal":{"name":"The Case manager","volume":"28 1","pages":"469-473"},"PeriodicalIF":0.0,"publicationDate":"2012-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83544402","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}
引用次数: 7
An adaptable vision system for the automatic inspection of surface defects in automotive headlamp lenses 汽车前照灯透镜表面缺陷自动检测的自适应视觉系统
Pub Date : 2011-10-13 DOI: 10.1109/CASE.2011.6042455
S. S. Martínez, J. Ortega, A. García, J. García
As a great part of the industrial inspection problems require specific, expensive, and highly complex solutions, there is the need to build flexible systems capable to be easily adapted to different models of a part. In this context, this paper proposes the use of a component-based methodology for designing and building flexible inspection systems for automotive headlamp lenses. Through computer vision, and taking into account the different elements that can be utilized in an industrial environment, we propose the use of a component based architecture for easily designing and building industrial inspection systems for this kind of parts. Within this architecture, each software, or hardware element, is encapsulated in a component with a predefined input/ouput layout and, later, it can be used considering the task inspection requirements. The main advantages of the proposed working philosophy are its flexibility, that the resulting machine vision can be easily adapted to any kind of headlamp lens, and that it is fully open to any new component (lighting system, process algorithm, industrial conveyor, etc.). This proposition has been successfully validated building an industrial prototype that was tested in both, the lab, and in a production line.
由于大部分工业检测问题需要特定的、昂贵的和高度复杂的解决方案,因此需要构建灵活的系统,能够轻松地适应零件的不同模型。在这种情况下,本文提出使用基于组件的方法来设计和构建灵活的汽车前照灯透镜检测系统。通过计算机视觉,并考虑到工业环境中可以使用的不同元素,我们提出使用基于组件的体系结构来轻松设计和构建此类部件的工业检测系统。在此体系结构中,每个软件或硬件元素都封装在具有预定义输入/输出布局的组件中,然后可以根据任务检查需求使用它。提出的工作理念的主要优点是它的灵活性,由此产生的机器视觉可以很容易地适应任何种类的前照灯镜头,并且它完全开放于任何新的组件(照明系统,过程算法,工业输送机等)。这个提议已经成功地验证了建立一个工业原型,在实验室和生产线上进行了测试。
{"title":"An adaptable vision system for the automatic inspection of surface defects in automotive headlamp lenses","authors":"S. S. Martínez, J. Ortega, A. García, J. García","doi":"10.1109/CASE.2011.6042455","DOIUrl":"https://doi.org/10.1109/CASE.2011.6042455","url":null,"abstract":"As a great part of the industrial inspection problems require specific, expensive, and highly complex solutions, there is the need to build flexible systems capable to be easily adapted to different models of a part. In this context, this paper proposes the use of a component-based methodology for designing and building flexible inspection systems for automotive headlamp lenses. Through computer vision, and taking into account the different elements that can be utilized in an industrial environment, we propose the use of a component based architecture for easily designing and building industrial inspection systems for this kind of parts. Within this architecture, each software, or hardware element, is encapsulated in a component with a predefined input/ouput layout and, later, it can be used considering the task inspection requirements. The main advantages of the proposed working philosophy are its flexibility, that the resulting machine vision can be easily adapted to any kind of headlamp lens, and that it is fully open to any new component (lighting system, process algorithm, industrial conveyor, etc.). This proposition has been successfully validated building an industrial prototype that was tested in both, the lab, and in a production line.","PeriodicalId":80307,"journal":{"name":"The Case manager","volume":"48 1","pages":"157-162"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83973626","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}
引用次数: 2
A MILP-based batch scheduling for two-stage hybrid flowshop with sequence-dependent setups in semiconductor assembly and test manufacturing 半导体组装和测试制造中基于milp的两阶段混合流程车间的批调度
Pub Date : 2010-10-21 DOI: 10.1109/COASE.2010.5584514
Jing Xiao, Li Zheng
In semiconductor assembly and test manufacturing, it is critical to optimize the scheduling of constraint stations to improve the system performance. This paper presents a continuous-time mixed-integer linear programming (MILP) model for the short-term batch scheduling with sequence-dependent setups in semiconductor assembly and test manufacturing to minimize the total completion time of the products. We formulate the problem of scheduling the two constraint stations and develop the MILP-based heuristic scheduling framework. The heuristic algorithm pre-determines the batch size according to the practical business rules and allocates the least flexible machines to the qualified high volume products. The system implementation at a semiconductor ATM factory demonstrates a significant reduction in total completion time compared to the traditional scheduling approach.
在半导体组装和测试制造中,优化约束工位的调度是提高系统性能的关键。针对半导体组装和测试制造中具有顺序相关设置的短期批量调度问题,提出了一个连续时间混合整数线性规划(MILP)模型,以使产品的总完成时间最小化。提出了两个约束站的调度问题,并开发了基于milp的启发式调度框架。启发式算法根据实际业务规则预先确定批量大小,并将最不灵活的机器分配给合格的大批量产品。与传统的调度方法相比,该系统在半导体ATM工厂的实现显着减少了总完成时间。
{"title":"A MILP-based batch scheduling for two-stage hybrid flowshop with sequence-dependent setups in semiconductor assembly and test manufacturing","authors":"Jing Xiao, Li Zheng","doi":"10.1109/COASE.2010.5584514","DOIUrl":"https://doi.org/10.1109/COASE.2010.5584514","url":null,"abstract":"In semiconductor assembly and test manufacturing, it is critical to optimize the scheduling of constraint stations to improve the system performance. This paper presents a continuous-time mixed-integer linear programming (MILP) model for the short-term batch scheduling with sequence-dependent setups in semiconductor assembly and test manufacturing to minimize the total completion time of the products. We formulate the problem of scheduling the two constraint stations and develop the MILP-based heuristic scheduling framework. The heuristic algorithm pre-determines the batch size according to the practical business rules and allocates the least flexible machines to the qualified high volume products. The system implementation at a semiconductor ATM factory demonstrates a significant reduction in total completion time compared to the traditional scheduling approach.","PeriodicalId":80307,"journal":{"name":"The Case manager","volume":"20 1","pages":"87-92"},"PeriodicalIF":0.0,"publicationDate":"2010-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85628561","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}
引用次数: 1
Welcome message from the general chair 主席的欢迎辞
Pub Date : 2010-01-01 DOI: 10.1109/COASE.2010.5584413
John T. Wen
{"title":"Welcome message from the general chair","authors":"John T. Wen","doi":"10.1109/COASE.2010.5584413","DOIUrl":"https://doi.org/10.1109/COASE.2010.5584413","url":null,"abstract":"","PeriodicalId":80307,"journal":{"name":"The Case manager","volume":"59 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2010-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79467554","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}
引用次数: 0
An optimal production/maintenance planning under stochastic random demand, service level and failure rate 在随机需求、服务水平和故障率下的最优生产/维修计划
Pub Date : 2009-01-01 DOI: 10.1109/COASE.2009.5234168
Z. Hajej, S. Dellagi, N. Rezg
{"title":"An optimal production/maintenance planning under stochastic random demand, service level and failure rate","authors":"Z. Hajej, S. Dellagi, N. Rezg","doi":"10.1109/COASE.2009.5234168","DOIUrl":"https://doi.org/10.1109/COASE.2009.5234168","url":null,"abstract":"","PeriodicalId":80307,"journal":{"name":"The Case manager","volume":"104 1","pages":"292-297"},"PeriodicalIF":0.0,"publicationDate":"2009-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79231833","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}
引用次数: 17
Heuristics to minimize total weighted tardiness of jobs on unrelated parallel machines 最小化不相关并行机上作业总加权延迟的启发式算法
Pub Date : 2008-09-19 DOI: 10.1109/COASE.2008.4626531
L. Mönch
In this paper, we present an efficient method to solve unrelated parallel machine total weighted tardiness (TWT) scheduling problems. We apply an ant colony optimization (ACO) approach as a heuristic to solve this NP-hard problem. A colony of artificial ants is used to construct iteratively solutions of the scheduling problem using artificial pheromone trails and heuristic information. For the computation of the heuristic information, we use the apparent tardiness cost (ATC) dispatching rule. We additionally improve the TWT value by applying a decomposition heuristic that solves a sequence of smaller scheduling problems optimally. We report on computational experiments based on stochastically generated test instances. Problems of this type arise in semiconductor manufacturing and have great practical relevance.
本文提出了一种求解不相关并行机总加权延迟调度问题的有效方法。我们采用蚁群优化(ACO)方法作为启发式方法来解决这个np困难问题。利用人工信息素轨迹和启发式信息,利用人工蚁群构造调度问题的迭代解。对于启发式信息的计算,我们使用表观延迟代价(ATC)调度规则。我们还通过应用分解启发式算法来优化解决一系列较小的调度问题,从而提高TWT值。我们报告了基于随机生成的测试实例的计算实验。这种类型的问题出现在半导体制造中,具有很大的实际意义。
{"title":"Heuristics to minimize total weighted tardiness of jobs on unrelated parallel machines","authors":"L. Mönch","doi":"10.1109/COASE.2008.4626531","DOIUrl":"https://doi.org/10.1109/COASE.2008.4626531","url":null,"abstract":"In this paper, we present an efficient method to solve unrelated parallel machine total weighted tardiness (TWT) scheduling problems. We apply an ant colony optimization (ACO) approach as a heuristic to solve this NP-hard problem. A colony of artificial ants is used to construct iteratively solutions of the scheduling problem using artificial pheromone trails and heuristic information. For the computation of the heuristic information, we use the apparent tardiness cost (ATC) dispatching rule. We additionally improve the TWT value by applying a decomposition heuristic that solves a sequence of smaller scheduling problems optimally. We report on computational experiments based on stochastically generated test instances. Problems of this type arise in semiconductor manufacturing and have great practical relevance.","PeriodicalId":80307,"journal":{"name":"The Case manager","volume":"7 1","pages":"572-577"},"PeriodicalIF":0.0,"publicationDate":"2008-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74345047","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}
引用次数: 5
Particle filter positioning and tracking based on dynamic model 基于动态模型的粒子滤波定位与跟踪
Pub Date : 2008-01-01 DOI: 10.1109/COASE.2008.4626430
Z. Tian, L. Luo
{"title":"Particle filter positioning and tracking based on dynamic model","authors":"Z. Tian, L. Luo","doi":"10.1109/COASE.2008.4626430","DOIUrl":"https://doi.org/10.1109/COASE.2008.4626430","url":null,"abstract":"","PeriodicalId":80307,"journal":{"name":"The Case manager","volume":"43 1","pages":"756-759"},"PeriodicalIF":0.0,"publicationDate":"2008-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81350368","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}
引用次数: 0
Reach out and touch us on-line 伸出手来,在线联系我们
Pub Date : 2006-11-01 DOI: 10.1016/S1061-9259(06)00412-7
{"title":"Reach out and touch us on-line","authors":"","doi":"10.1016/S1061-9259(06)00412-7","DOIUrl":"https://doi.org/10.1016/S1061-9259(06)00412-7","url":null,"abstract":"","PeriodicalId":80307,"journal":{"name":"The Case manager","volume":"17 6","pages":"Page 8"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1061-9259(06)00412-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137349223","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The drug scene 毒品场景
Pub Date : 2006-11-01 DOI: 10.1016/j.casemgr.2006.07.006
{"title":"The drug scene","authors":"","doi":"10.1016/j.casemgr.2006.07.006","DOIUrl":"https://doi.org/10.1016/j.casemgr.2006.07.006","url":null,"abstract":"","PeriodicalId":80307,"journal":{"name":"The Case manager","volume":"17 6","pages":"Pages 16-20"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.casemgr.2006.07.006","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137349290","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}
引用次数: 0
The Americans with Disabilities Act, 16 years later 16年后的《美国残疾人法案》
Pub Date : 2006-11-01 DOI: 10.1016/j.casemgr.2006.08.011
Lewis E. Vierling MS, NCC, NCCC, CRC, CCM
{"title":"The Americans with Disabilities Act, 16 years later","authors":"Lewis E. Vierling MS, NCC, NCCC, CRC, CCM","doi":"10.1016/j.casemgr.2006.08.011","DOIUrl":"10.1016/j.casemgr.2006.08.011","url":null,"abstract":"","PeriodicalId":80307,"journal":{"name":"The Case manager","volume":"17 6","pages":"Pages 24-28"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.casemgr.2006.08.011","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"26374040","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}
引用次数: 1
期刊
The Case manager
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1