Pub Date : 2006-06-21DOI: 10.1109/SOLI.2006.329060
Zheng Jinrong, X. Fuyuan, Hou Yong
There is no strict definition of technique innovation that has been agreed upon in the world nowadays. How to define technique innovation has become the focus of controversies in the field of theory. The divergence, in particular, arises concerning the defining of technology, the definition and criterion of the successful realization of technique innovation. In order to better the understanding of technique innovation and push forward the socialization of it, this paper discusses firstly whether technique innovation is successful or not, then, based upon the comparison of economical returns and social effect between before and after technique innovation, puts forward the evaluation model for technique innovation, taking advantage of SAVAGE's theory and method of expectation utility. With the help of this model, a quantitative evaluation of the definition of technique innovation can be established so as to evaluate and define any simple technological advancement and improved method, and further, propel the development of technique innovation
{"title":"Research on an Evaluation Model of Technique Innovation","authors":"Zheng Jinrong, X. Fuyuan, Hou Yong","doi":"10.1109/SOLI.2006.329060","DOIUrl":"https://doi.org/10.1109/SOLI.2006.329060","url":null,"abstract":"There is no strict definition of technique innovation that has been agreed upon in the world nowadays. How to define technique innovation has become the focus of controversies in the field of theory. The divergence, in particular, arises concerning the defining of technology, the definition and criterion of the successful realization of technique innovation. In order to better the understanding of technique innovation and push forward the socialization of it, this paper discusses firstly whether technique innovation is successful or not, then, based upon the comparison of economical returns and social effect between before and after technique innovation, puts forward the evaluation model for technique innovation, taking advantage of SAVAGE's theory and method of expectation utility. With the help of this model, a quantitative evaluation of the definition of technique innovation can be established so as to evaluate and define any simple technological advancement and improved method, and further, propel the development of technique innovation","PeriodicalId":325318,"journal":{"name":"2006 IEEE International Conference on Service Operations and Logistics, and Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131209336","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-06-21DOI: 10.1109/SOLI.2006.329079
Y. Qian
There exist many customers in credit market that needs to be classified into distinct groups. K-means algorithm are presented, which based on the historical financial ratios, utilizing the cluster analysis technology to analyze the listed enterprises in Zhejiang province. Some indicators related to financial attributes are analyzed, and nine finance indicators are chosen. According to better valuation on the companies listed, we apply to "try and error" and choose 4 as the number of clustering. 81 samples are divided into two groups: one training group with 60 firms and other testing group with 21 samples. Testing results shows that the model trained can be available for clustering companies listed in Zhejiang province
{"title":"An Application Based on K-Means Algorithm for Clustering Companies Listed","authors":"Y. Qian","doi":"10.1109/SOLI.2006.329079","DOIUrl":"https://doi.org/10.1109/SOLI.2006.329079","url":null,"abstract":"There exist many customers in credit market that needs to be classified into distinct groups. K-means algorithm are presented, which based on the historical financial ratios, utilizing the cluster analysis technology to analyze the listed enterprises in Zhejiang province. Some indicators related to financial attributes are analyzed, and nine finance indicators are chosen. According to better valuation on the companies listed, we apply to \"try and error\" and choose 4 as the number of clustering. 81 samples are divided into two groups: one training group with 60 firms and other testing group with 21 samples. Testing results shows that the model trained can be available for clustering companies listed in Zhejiang province","PeriodicalId":325318,"journal":{"name":"2006 IEEE International Conference on Service Operations and Logistics, and Informatics","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131489666","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-06-21DOI: 10.1109/SOLI.2006.328961
Ping Dong, Jun-jun Dong, Tiansheng Huang
This paper introduces techniques of data warehouse and online analyzing processing and provides a solution to decision-making support system based on an education-related case study. The paper also discusses how to collect business data, transform and integrate these data to analyze the state of education based on OLAP and how the end user can get the information easily
{"title":"Application of Data Warehouse Technique in Educational Decision Support System","authors":"Ping Dong, Jun-jun Dong, Tiansheng Huang","doi":"10.1109/SOLI.2006.328961","DOIUrl":"https://doi.org/10.1109/SOLI.2006.328961","url":null,"abstract":"This paper introduces techniques of data warehouse and online analyzing processing and provides a solution to decision-making support system based on an education-related case study. The paper also discusses how to collect business data, transform and integrate these data to analyze the state of education based on OLAP and how the end user can get the information easily","PeriodicalId":325318,"journal":{"name":"2006 IEEE International Conference on Service Operations and Logistics, and Informatics","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131558737","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-06-21DOI: 10.1109/SOLI.2006.329027
Jianhong Luo
In today's supply chain management, organizations need to address complex interdependencies and create an extended enterprise that looks beyond its manufacturing plants, and customers increasingly expect companies, suppliers and distributors to provide real time information about their orders. These escalating customer demands are forcing corporations to adopt mobile technology to optimize and streamline the information, product and financial flows in the supply chain. But supply chain processes in companies today are desktop-centric. The focus of this paper is on the opportunities Web services can offer to improve supply chain efficiencies in the mobile environment. A three-tier architecture is described to utilize Web services for users with handheld devices in supply chains. With this architecture a mobile solution is specified to develop the next generation supply chains
{"title":"Utilizing Mobile Web Services for Supply Chains","authors":"Jianhong Luo","doi":"10.1109/SOLI.2006.329027","DOIUrl":"https://doi.org/10.1109/SOLI.2006.329027","url":null,"abstract":"In today's supply chain management, organizations need to address complex interdependencies and create an extended enterprise that looks beyond its manufacturing plants, and customers increasingly expect companies, suppliers and distributors to provide real time information about their orders. These escalating customer demands are forcing corporations to adopt mobile technology to optimize and streamline the information, product and financial flows in the supply chain. But supply chain processes in companies today are desktop-centric. The focus of this paper is on the opportunities Web services can offer to improve supply chain efficiencies in the mobile environment. A three-tier architecture is described to utilize Web services for users with handheld devices in supply chains. With this architecture a mobile solution is specified to develop the next generation supply chains","PeriodicalId":325318,"journal":{"name":"2006 IEEE International Conference on Service Operations and Logistics, and Informatics","volume":"117 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131746900","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-06-21DOI: 10.1109/SOLI.2006.328975
I. Liiv
The most common method for classifying inventory items is the annual dollar usage ranking method (ABC classification), which assumes, accordingly to the Pareto principle, that a small number of items account for a large share of the cost-volume, an intermediate category of moderate cost-volume items and a large number of low cost or usage items. However, using only one criterion for decision making, in some cases, may lead to mismanaging the assets. To reconcile these conflicts, instead of using multiple criteria with analytic hierarchy process, we look at the alternative options available for improving the classification performance. The intent of this paper is to discuss several aspects of well-known inventory classification strategies, and to propose a demand association criterion for classification enhancement. Experimental results for two warehouse datasets are included and analyzed
{"title":"Inventory classification enhancement with demand associations","authors":"I. Liiv","doi":"10.1109/SOLI.2006.328975","DOIUrl":"https://doi.org/10.1109/SOLI.2006.328975","url":null,"abstract":"The most common method for classifying inventory items is the annual dollar usage ranking method (ABC classification), which assumes, accordingly to the Pareto principle, that a small number of items account for a large share of the cost-volume, an intermediate category of moderate cost-volume items and a large number of low cost or usage items. However, using only one criterion for decision making, in some cases, may lead to mismanaging the assets. To reconcile these conflicts, instead of using multiple criteria with analytic hierarchy process, we look at the alternative options available for improving the classification performance. The intent of this paper is to discuss several aspects of well-known inventory classification strategies, and to propose a demand association criterion for classification enhancement. Experimental results for two warehouse datasets are included and analyzed","PeriodicalId":325318,"journal":{"name":"2006 IEEE International Conference on Service Operations and Logistics, and Informatics","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133516888","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-06-21DOI: 10.1109/SOLI.2006.328914
Jian Yu, Ming Yu
This paper presents a decision-support model for technology roadmapping, with an analysis of functions and design of operation process. It also presents a general index system for comprehensive evaluation of technology. This research helps to achieve the formalization and informationization of technology forecasting management
{"title":"A Decision-Support Model for Technology Roadmapping","authors":"Jian Yu, Ming Yu","doi":"10.1109/SOLI.2006.328914","DOIUrl":"https://doi.org/10.1109/SOLI.2006.328914","url":null,"abstract":"This paper presents a decision-support model for technology roadmapping, with an analysis of functions and design of operation process. It also presents a general index system for comprehensive evaluation of technology. This research helps to achieve the formalization and informationization of technology forecasting management","PeriodicalId":325318,"journal":{"name":"2006 IEEE International Conference on Service Operations and Logistics, and Informatics","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133692372","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-06-21DOI: 10.1109/SOLI.2006.329014
Yong Chen, Feilong Lin, Na Bi
By researching the enterprise manufacturing logistics system, the model of it is established based on the multi-agent. The model has eight agents including process agent, transition agent, parts agent, etc. The process agent is the most important agent in the model, so the key point is to introduce the mathematical model of process agent based on arithmetic of dynamic scheduling. This agent model can be used to judge whether to accept process tasks according to manufacturing capacity. Taking the example of flexible shop-scheduling about 4 products & 4 machines, it indicates that the modeling method based on multi-agent is useful, efficient
{"title":"Multi-agent Modeling and Shop-Scheduling of the Manufacturing Enterprise Logistics","authors":"Yong Chen, Feilong Lin, Na Bi","doi":"10.1109/SOLI.2006.329014","DOIUrl":"https://doi.org/10.1109/SOLI.2006.329014","url":null,"abstract":"By researching the enterprise manufacturing logistics system, the model of it is established based on the multi-agent. The model has eight agents including process agent, transition agent, parts agent, etc. The process agent is the most important agent in the model, so the key point is to introduce the mathematical model of process agent based on arithmetic of dynamic scheduling. This agent model can be used to judge whether to accept process tasks according to manufacturing capacity. Taking the example of flexible shop-scheduling about 4 products & 4 machines, it indicates that the modeling method based on multi-agent is useful, efficient","PeriodicalId":325318,"journal":{"name":"2006 IEEE International Conference on Service Operations and Logistics, and Informatics","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131907558","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-06-21DOI: 10.1109/SOLI.2006.329017
Liulei, Luohua, Tang Xiao-wo
Many service facilities are adopting the strategy of advertising a uniform delivery lead time to attract customers in Time Based Competition. Different kinds of customers have different sensitivities to price and time. How many money are prepared to pay for the service is also different to the customers with the same time or price sensitivity. In this typical guaranteed delivery time strategy, customer demand characteristics based on time sensitivity and reservation payment determine the relationship between demand and delivery lead time. Considering customer consume behavior facing price and lead time, a service delivery lead time model is presented. Based on the model, the impact of price and customer time sensitivity as well as differentiation in customer reservation payment on delivery time decision is analyzed. Finally, a numerical example is given to illustrate the model and gain some useful managerial insights
{"title":"Service Delivery Lead Time Model Based on Customer Demand Characteristics","authors":"Liulei, Luohua, Tang Xiao-wo","doi":"10.1109/SOLI.2006.329017","DOIUrl":"https://doi.org/10.1109/SOLI.2006.329017","url":null,"abstract":"Many service facilities are adopting the strategy of advertising a uniform delivery lead time to attract customers in Time Based Competition. Different kinds of customers have different sensitivities to price and time. How many money are prepared to pay for the service is also different to the customers with the same time or price sensitivity. In this typical guaranteed delivery time strategy, customer demand characteristics based on time sensitivity and reservation payment determine the relationship between demand and delivery lead time. Considering customer consume behavior facing price and lead time, a service delivery lead time model is presented. Based on the model, the impact of price and customer time sensitivity as well as differentiation in customer reservation payment on delivery time decision is analyzed. Finally, a numerical example is given to illustrate the model and gain some useful managerial insights","PeriodicalId":325318,"journal":{"name":"2006 IEEE International Conference on Service Operations and Logistics, and Informatics","volume":"557 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134316975","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-06-21DOI: 10.1109/SOLI.2006.329083
Zhou Hong, Wang Jian
An improved cooperative coevolutionary algorithm, which aims at solving job shop scheduling problem, is proposed in this paper. According to the number of machines, population is naturally divided into some subpopulations whose individuals encode the preference list of jobs. The proposed algorithm introduces steady-state reproduction to crossover and mutation operators, and inserts some new individuals to the subpopulation at some other generations, and uses the improved preference-list-based G&T algorithm to decode the whole solutions to calculate fitness by three types of cooperative partners, and adopts an innovative updating technique to speed up the convergence. The optimization results of numerical experiments have shown that, the proposed algorithm has outperformed traditional genetic algorithms and showed strong competition with other heuristics
{"title":"A Cooperative Coevolutionary Algorithm with Application to Job Shop Scheduling Problem","authors":"Zhou Hong, Wang Jian","doi":"10.1109/SOLI.2006.329083","DOIUrl":"https://doi.org/10.1109/SOLI.2006.329083","url":null,"abstract":"An improved cooperative coevolutionary algorithm, which aims at solving job shop scheduling problem, is proposed in this paper. According to the number of machines, population is naturally divided into some subpopulations whose individuals encode the preference list of jobs. The proposed algorithm introduces steady-state reproduction to crossover and mutation operators, and inserts some new individuals to the subpopulation at some other generations, and uses the improved preference-list-based G&T algorithm to decode the whole solutions to calculate fitness by three types of cooperative partners, and adopts an innovative updating technique to speed up the convergence. The optimization results of numerical experiments have shown that, the proposed algorithm has outperformed traditional genetic algorithms and showed strong competition with other heuristics","PeriodicalId":325318,"journal":{"name":"2006 IEEE International Conference on Service Operations and Logistics, and Informatics","volume":"1126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122924228","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-06-21DOI: 10.1109/SOLI.2006.328949
Liang Chen, Ling Jiang
This study propounds a theoretical model of relationship marketing in virtual community in China and the authors testify the model through structural equation modeling. The authors find that the sponsor's effort to foster member embeddedness has a significantly positive effect on community members' trust in the sponsor and loyalty to the sponsor. Meanwhile, the sponsor's efforts to provide quality content and keep the community Web site safe have a significantly positive effect on community members' trust in the sponsor, but the effort to encourage member interaction does not. The hypotheses that member loyalty and cooperation are outcomes of trust are also supported, and meanwhile, member loyalty has positive effect on member cooperation in virtual community. Marketing implications and further research directions are also discussed in the last section
{"title":"Relationship Marketing in Virtual Community: Antecedents and Consequences","authors":"Liang Chen, Ling Jiang","doi":"10.1109/SOLI.2006.328949","DOIUrl":"https://doi.org/10.1109/SOLI.2006.328949","url":null,"abstract":"This study propounds a theoretical model of relationship marketing in virtual community in China and the authors testify the model through structural equation modeling. The authors find that the sponsor's effort to foster member embeddedness has a significantly positive effect on community members' trust in the sponsor and loyalty to the sponsor. Meanwhile, the sponsor's efforts to provide quality content and keep the community Web site safe have a significantly positive effect on community members' trust in the sponsor, but the effort to encourage member interaction does not. The hypotheses that member loyalty and cooperation are outcomes of trust are also supported, and meanwhile, member loyalty has positive effect on member cooperation in virtual community. Marketing implications and further research directions are also discussed in the last section","PeriodicalId":325318,"journal":{"name":"2006 IEEE International Conference on Service Operations and Logistics, and Informatics","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125659685","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
扫码关注我们
求助内容：
应助结果提醒方式：