2006 IEEE International Conference on Information Reuse & Integration最新文献

筛选
英文 中文
Using Pseudo Gradient Search for Solving Nonlinear Multiregression Based on 2-Additive Measures 基于2-加性测度的非线性多元回归问题的伪梯度搜索
2006 IEEE International Conference on Information Reuse & Integration Pub Date : 2006-12-04 DOI: 10.1109/IRI.2006.252449
P. Mahasukhon, H. Sharif, Zhenyuan Wang
{"title":"Using Pseudo Gradient Search for Solving Nonlinear Multiregression Based on 2-Additive Measures","authors":"P. Mahasukhon, H. Sharif, Zhenyuan Wang","doi":"10.1109/IRI.2006.252449","DOIUrl":"https://doi.org/10.1109/IRI.2006.252449","url":null,"abstract":"In an optimization problem, when the objective function is not differentiate, such as nonlinear multiregressions based on the generalized Choquet integral, the traditional gradient search fails. In this case, we may replace gradient with a pseudo gradient to determine the optimal search direction. Nonetheless, the complexity of the algorithm is very high. When a nonlinear integral with respect to signed fuzzy measure is used in multiregression, people encounter the problem that, comparing to the number of variables, there are exponentially many unknown parameters in the model. However, in real-world problems, the higher-order interactions among the variables can be omitted, and then only second-order one with an acceptable small error in the results. Thus, a 2-additive measure based on the Mobius transformation and its inverse can be used to replace the signed fuzzy measure. In such a way, the complexity of the computation will be significantly reduced","PeriodicalId":402255,"journal":{"name":"2006 IEEE International Conference on Information Reuse & Integration","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117066005","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
Redesigning Product Families using Heuristics and Shared Ontological Component Information 利用启发式和共享本体组件信息重新设计产品族
2006 IEEE International Conference on Information Reuse & Integration Pub Date : 2006-12-04 DOI: 10.1109/IRI.2006.252435
H. Thevenot, Jyotirmaya Nanda, T. Simpson
{"title":"Redesigning Product Families using Heuristics and Shared Ontological Component Information","authors":"H. Thevenot, Jyotirmaya Nanda, T. Simpson","doi":"10.1109/IRI.2006.252435","DOIUrl":"https://doi.org/10.1109/IRI.2006.252435","url":null,"abstract":"Many of today's manufacturing companies are using platform-based product development to realize families of products with sufficient variety to meet customers' demands while keeping costs relatively low. Although the benefits of commonality are widely known, many companies are still not taking full advantage of it when developing new products or redesigning existing ones. One reason is the lack of appropriate methods to retrieve and reuse relevant information when re/designing products. In this paper, we propose a framework to (1) collect information on product families, (2) store it using ontology, (3) retrieve relevant information on a product family using graph query, (4) reuse this information to redesign a product family using a genetic algorithm-based optimizer and (5) represent the redesigned product family using a product family concept lattice, which we call a networked bill of material (NBOM). Besides increasing the understanding of the interaction between components in a product family, the framework explicitly captures the redesign process for improving commonality using formal concept analysis. As an example, a family of staplers is redesigned using the proposed framework","PeriodicalId":402255,"journal":{"name":"2006 IEEE International Conference on Information Reuse & Integration","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117334024","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
Aspectizing Database Connection Pooling for Improved Run-Time Performance Measures in Web Applications 在Web应用程序中对数据库连接池进行aspect化以改进运行时性能度量
2006 IEEE International Conference on Information Reuse & Integration Pub Date : 2006-12-04 DOI: 10.1109/IRI.2006.252469
Lamya A. Othman, H. Hosny, S. Aly
{"title":"Aspectizing Database Connection Pooling for Improved Run-Time Performance Measures in Web Applications","authors":"Lamya A. Othman, H. Hosny, S. Aly","doi":"10.1109/IRI.2006.252469","DOIUrl":"https://doi.org/10.1109/IRI.2006.252469","url":null,"abstract":"This paper addresses the positive dynamic effects of the aspect-oriented implementation of database connection pooling in a Web application, through simulated experiments. In addition to the static positive effects of aspect-oriented programming (AOP) in yielding a robust design by ensuring encapsulation, reusability, efficiency, and extensibility, the dynamic positive effects of AOP in our experiments are emphasized and demonstrated elaborately in terms of some selected run-time performance measures. The latter issue is the main concern of our ongoing research work","PeriodicalId":402255,"journal":{"name":"2006 IEEE International Conference on Information Reuse & Integration","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115869526","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}
引用次数: 3
Role Based Access Control in Enterprise Application - Security Administration and User Management 企业应用程序安全管理和用户管理中基于角色的访问控制
2006 IEEE International Conference on Information Reuse & Integration Pub Date : 2006-12-04 DOI: 10.1109/IRI.2006.252397
Vinith Bindiganavale, J. Ouyang
{"title":"Role Based Access Control in Enterprise Application - Security Administration and User Management","authors":"Vinith Bindiganavale, J. Ouyang","doi":"10.1109/IRI.2006.252397","DOIUrl":"https://doi.org/10.1109/IRI.2006.252397","url":null,"abstract":"One of the most challenging problems in managing large Web-applications is the complexity of security administration and user-profile management. Role based access control (RBAC) has become the predominant model for advanced access control due to the reduced complexity and cost of administration. Under RBAC, security administration is greatly simplified by using roles, hierarchies and privileges, and user management is uncomplicated by using LDAP API specification within the J2EE application. System administrators create roles according to the job functions performed in an organization, grant permissions to those roles, and then assign users to the roles on the basis of their specific job responsibilities and qualifications. We introduce in this paper RBAC in a typical J2EE enterprise application and present architectural details, along with security administration and user-profile management for RBAC. Netegrity SiteMinder provides the RBAC foundation, and J2EE framework serves as the reference model for administration in the application. Then we emphasize the design and implementation of a custom RBAC-model, and the possibilities of optimization of this model","PeriodicalId":402255,"journal":{"name":"2006 IEEE International Conference on Information Reuse & Integration","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129707071","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}
引用次数: 12
Some Metaheuristic Approaches for the Clustering Problem with an Application to Failure Detection 聚类问题的一些元启发式方法及其在故障检测中的应用
2006 IEEE International Conference on Information Reuse & Integration Pub Date : 2006-12-04 DOI: 10.1109/IRI.2006.252452
Adriana Marcucci Bustos, A. Sellier
{"title":"Some Metaheuristic Approaches for the Clustering Problem with an Application to Failure Detection","authors":"Adriana Marcucci Bustos, A. Sellier","doi":"10.1109/IRI.2006.252452","DOIUrl":"https://doi.org/10.1109/IRI.2006.252452","url":null,"abstract":"Clustering is a relevant problem that takes place in many practical environments. This paper presents some meta-heuristic approaches as an alternative to the traditional clustering techniques, like K-means or C-means. They are based on some metaheuristic optimization algorithms as tabu search, simulated annealing, genetic algorithms and ant colony. The developed techniques have the advantage that they could escape more efficiently from local minima. Additionally, an application on failure detection in a hydraulic system was developed and the obtained results are competitive with some well known techniques","PeriodicalId":402255,"journal":{"name":"2006 IEEE International Conference on Information Reuse & Integration","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116162306","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
Investigations into Relatedness-based Interestingness of Association Rules: A Transaction-driven Analysis 基于相关性的关联规则兴趣度研究:一个事务驱动的分析
2006 IEEE International Conference on Information Reuse & Integration Pub Date : 2006-12-04 DOI: 10.1109/IRI.2006.252468
B. Shekar, R. Natarajan
{"title":"Investigations into Relatedness-based Interestingness of Association Rules: A Transaction-driven Analysis","authors":"B. Shekar, R. Natarajan","doi":"10.1109/IRI.2006.252468","DOIUrl":"https://doi.org/10.1109/IRI.2006.252468","url":null,"abstract":"An important problem in association rule (AR) mining is the identification of interesting ARs. In a retail market basket context, items may be related through various relationships like mutual interaction, 'substitutability' and 'complementarity'. We define them and present a classification of these relationships. We propose 'item-relatedness' of an item-pair as a composite of these relationships. We then present a structural decomposition of the relatedness of an item pair, based on its co-occurring transactions, co-occurring and non co-occurring item-neighborhoods. We identify those relationships that can be discerned solely from transaction data analysis. ARs that contain unrelated or weakly related item-pairs are likely to be interesting. The structural decomposition helps in clarifying components of relatedness. We finally analyze a typical scenario that contains objects revealing various shades of relatedness","PeriodicalId":402255,"journal":{"name":"2006 IEEE International Conference on Information Reuse & Integration","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116371889","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
Efficient 3-D Visualization of Cellular Structures through Reuse of Multi-focal 2-D Images 通过重用多焦点二维图像实现细胞结构的高效三维可视化
2006 IEEE International Conference on Information Reuse & Integration Pub Date : 2006-12-04 DOI: 10.1109/IRI.2006.252429
S. Kockara, N. Ali, S. Dagtas
{"title":"Efficient 3-D Visualization of Cellular Structures through Reuse of Multi-focal 2-D Images","authors":"S. Kockara, N. Ali, S. Dagtas","doi":"10.1109/IRI.2006.252429","DOIUrl":"https://doi.org/10.1109/IRI.2006.252429","url":null,"abstract":"The inherent imaging properties of a light microscope used in visualization of cellular structures result in images characterized by low resolution and magnification. The images are obtained by using the microscope parameters (typically the focal setting), and are taken from a single point of view. We report a novel mutual information based image clearance (MIBIC) algorithm to refine a set of 2D images taken in a light microscope at different focal settings each representing a cross sectional view at the focal plane level and combining the most informative features from each level to produce a single image. The results illustrate that the MIBIC algorithm produces an image with enhanced visualization of cellular structures than that obtained by the best focus leveled image and thus offers a viable alternative to enhance images produced by a traditional light microscope. The results illustrate that our proposed layer separation method using multiple focus levels is an effective and efficient way for 3D imaging of translucent objects with a common light microscope","PeriodicalId":402255,"journal":{"name":"2006 IEEE International Conference on Information Reuse & Integration","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129185627","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
Reconstructing Polyhedral Swept Volumes from a Single-View Sketch 从单视图草图重建多面体扫描体
2006 IEEE International Conference on Information Reuse & Integration Pub Date : 2006-12-04 DOI: 10.1109/IRI.2006.252479
Y. Suh
{"title":"Reconstructing Polyhedral Swept Volumes from a Single-View Sketch","authors":"Y. Suh","doi":"10.1109/IRI.2006.252479","DOIUrl":"https://doi.org/10.1109/IRI.2006.252479","url":null,"abstract":"Solids-based computer-aided design (CAD) systems are essential tools for detailed designs of mechanical components and assemblies. At the conceptual design stage, however, designers still prefer freehand sketches on paper. Sketch-based computer interfaces can be an alternative tool bridging the gap, and many attempts have been made to reconstruct 3D models from 2D sketches or drawings. Among the reconstruction methods, inflating cubic corners is one of attractive tools due to its simple and analytic nature. However, it can only handle limited regular polyhedrons whose planes are all mutually perpendicular. An extended cubic corner algorithm is developed so that linear swept volumes of arbitrary polygonal profiles can be reconstructed. The recognized swept volumes can be easily converted to feature-based parametric CAD models for further detailed designs","PeriodicalId":402255,"journal":{"name":"2006 IEEE International Conference on Information Reuse & Integration","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133603953","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
Logo Drawing System applying Interactive Genetic Algorithms 应用交互式遗传算法的标志绘制系统
2006 IEEE International Conference on Information Reuse & Integration Pub Date : 2006-12-04 DOI: 10.1109/IRI.2006.252419
M. Yamada, T. Onisawa
{"title":"Logo Drawing System applying Interactive Genetic Algorithms","authors":"M. Yamada, T. Onisawa","doi":"10.1109/IRI.2006.252419","DOIUrl":"https://doi.org/10.1109/IRI.2006.252419","url":null,"abstract":"This paper describes a logo drawing system applying interactive genetic algorithms in order to reflect user's logos image. One logo is expressed as a chromosome, which has information on its components' sizes, positions, and colors. The system draws logos by repeating the system generation of logos and user's evaluation of them as follows. First the system generates logos in form of chromosomes and presents them to the user. The user evaluates these logos by 5-point scale, based on his/her logos image. Then the system generates the next generation chromosomes reflecting the user's evaluation. The procedures of generation and evaluation are repeated, until the user finally obtains satisfying logos. This paper also performs subjects experiments, in order to confirm the validity of the proposed system. From the experiment results, its problems and solutions are discussed","PeriodicalId":402255,"journal":{"name":"2006 IEEE International Conference on Information Reuse & Integration","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134184780","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}
引用次数: 8
A Component-Based Service Creation Framework for Mobile Applications 基于组件的移动应用服务创建框架
2006 IEEE International Conference on Information Reuse & Integration Pub Date : 2006-12-04 DOI: 10.1109/IRI.2006.252431
M. Jiang, Zhihui Yang
{"title":"A Component-Based Service Creation Framework for Mobile Applications","authors":"M. Jiang, Zhihui Yang","doi":"10.1109/IRI.2006.252431","DOIUrl":"https://doi.org/10.1109/IRI.2006.252431","url":null,"abstract":"The design and development of mobile data services is a complex undertaking that demands expertise from system architecture, software design, wireless communication protocols, to the integration of legacy systems. Service designers have to deal with various aspects and issues at both system and application levels where the complexity and heterogeneity of the network infrastructure have to be considered. This paper describes a component-based service creation framework to simplify the design and development of mobile data services. With high level design abstraction, constraints of application domains, and the guidance of domain rules, a component-based framework enables rapid creation of mobile data services. Case studies which show the development and deployment of mobile applications are presented","PeriodicalId":402255,"journal":{"name":"2006 IEEE International Conference on Information Reuse & Integration","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128625571","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信