Prior research has demonstrated that the degrees and impact of customer trust on purchase intentions change with online experience. While online trust research has incorporated and built upon models and theories of interpersonal trust, swift trust, and impersonal trust, this line of research tends to examine initial and repeat online trust separately. Based on a dual processing model of persuasion — Elaboration Likelihood Model (ELM), this study attempts to provide one theoretical framework to examine customers’ formation of initial trust and repeat trust simultaneously. The model identifies motivation and ability to assess online vendor’s attributes as the key drivers to the formation of online trust attitude. These two factors, in combination, determine the salience of different information in influencing one’s trust attitude toward an e-vendor. Initial and repeat online transactions implied different levels of motivation and ability to deliberate vendor-related attributes, explaining the often observed distinct processes in initial trust and repeat trust formation. Implications and applications of such a framework are discussed.
{"title":"Modeling Initial and Repeat Online Trust in B2C E-Commerce","authors":"Wei-Chang Kong, Yu-Ting Caisy Hung","doi":"10.1109/HICSS.2006.354","DOIUrl":"https://doi.org/10.1109/HICSS.2006.354","url":null,"abstract":"Prior research has demonstrated that the degrees and impact of customer trust on purchase intentions change with online experience. While online trust research has incorporated and built upon models and theories of interpersonal trust, swift trust, and impersonal trust, this line of research tends to examine initial and repeat online trust separately. Based on a dual processing model of persuasion — Elaboration Likelihood Model (ELM), this study attempts to provide one theoretical framework to examine customers’ formation of initial trust and repeat trust simultaneously. The model identifies motivation and ability to assess online vendor’s attributes as the key drivers to the formation of online trust attitude. These two factors, in combination, determine the salience of different information in influencing one’s trust attitude toward an e-vendor. Initial and repeat online transactions implied different levels of motivation and ability to deliberate vendor-related attributes, explaining the often observed distinct processes in initial trust and repeat trust formation. Implications and applications of such a framework are discussed.","PeriodicalId":432250,"journal":{"name":"Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116550382","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}
O. Mazhelis, Jari A. Lehto, Jouni Markkula, M. Pulkkinen
The design and implementation of telecommunication systems is an incremental and iterative process, and system architectures may need to be revised and refined several times during their lifetime. Formal evaluation facilitates the identification of the weak points, where improvements are due in these architectures. In the domain of telecommunications, such evaluation can be based on the Architecture Evaluation Framework (AEF). During the evaluation, a deep understanding of the processes within a system is needed. Meanwhile, the systems being designed are usually complex systems encompassing a large number of components with an intricate pattern of interaction between them. As a result, it is extremely difficult to understand, predict and control the behavior of such systems. Theoretical studies in the field of complex systems describe potential reasons of system complexity, and explain its possible outcomes, as reflected in system structure and behavior. This knowledge may be utilized in architecture evaluation, in order to deepen the understanding of the interactions imposed by the architecture, as well as to extend the understanding of the involved architectural tradeoffs. For this, the complexity factors should be taken into account during the evaluation. However, no such factors are involved in the current version of the AEF. In this paper, the attempt is made to identify how the knowledge about properties of complex systems could be utilized for the evaluation of information system architectures. Based on the theoretical advances in the field of complex systems, a list of the complexity factors to be included in the AEF is compiled. These factors are going to be further refined, as the AEF is employed for evaluating real-world architectures.
{"title":"Defining Complexity Factors for the Architecture Evaluation Framework","authors":"O. Mazhelis, Jari A. Lehto, Jouni Markkula, M. Pulkkinen","doi":"10.1109/HICSS.2006.113","DOIUrl":"https://doi.org/10.1109/HICSS.2006.113","url":null,"abstract":"The design and implementation of telecommunication systems is an incremental and iterative process, and system architectures may need to be revised and refined several times during their lifetime. Formal evaluation facilitates the identification of the weak points, where improvements are due in these architectures. In the domain of telecommunications, such evaluation can be based on the Architecture Evaluation Framework (AEF). During the evaluation, a deep understanding of the processes within a system is needed. Meanwhile, the systems being designed are usually complex systems encompassing a large number of components with an intricate pattern of interaction between them. As a result, it is extremely difficult to understand, predict and control the behavior of such systems. Theoretical studies in the field of complex systems describe potential reasons of system complexity, and explain its possible outcomes, as reflected in system structure and behavior. This knowledge may be utilized in architecture evaluation, in order to deepen the understanding of the interactions imposed by the architecture, as well as to extend the understanding of the involved architectural tradeoffs. For this, the complexity factors should be taken into account during the evaluation. However, no such factors are involved in the current version of the AEF. In this paper, the attempt is made to identify how the knowledge about properties of complex systems could be utilized for the evaluation of information system architectures. Based on the theoretical advances in the field of complex systems, a list of the complexity factors to be included in the AEF is compiled. These factors are going to be further refined, as the AEF is employed for evaluating real-world architectures.","PeriodicalId":432250,"journal":{"name":"Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122848554","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}
Little research has examined the relevance of real options for valuation of information technology (IT) investments for prioritizing a portfolio of projects. When the effect of project interdependencies is considered, the complexity of prioritizing even a small number of projects poses several challenges in applying real options. We develop a new methodology suite which integrates the results of real options analysis within a portfolio management framework. We propose a multi-period optimization model to combine the advantages of using real options analysis with the ease of an optimization program to help IT managers make optimal funding decisions. We demonstrate advantages over traditional methods by using data from a U.S. utility company. Our contributions are: (1) integration of real options analysis with portfolio optimization methods, so projects can be prioritized across a multi-period horizon, and (2) validation of our approach by showing its superiority over traditional portfolio management models.
{"title":"Optimizing an IT Project Portfolio with Time-Wise Interdependencies","authors":"I. Bardhan, R. Kauffman, Sanjeewa Naranpanawe","doi":"10.1109/HICSS.2006.373","DOIUrl":"https://doi.org/10.1109/HICSS.2006.373","url":null,"abstract":"Little research has examined the relevance of real options for valuation of information technology (IT) investments for prioritizing a portfolio of projects. When the effect of project interdependencies is considered, the complexity of prioritizing even a small number of projects poses several challenges in applying real options. We develop a new methodology suite which integrates the results of real options analysis within a portfolio management framework. We propose a multi-period optimization model to combine the advantages of using real options analysis with the ease of an optimization program to help IT managers make optimal funding decisions. We demonstrate advantages over traditional methods by using data from a U.S. utility company. Our contributions are: (1) integration of real options analysis with portfolio optimization methods, so projects can be prioritized across a multi-period horizon, and (2) validation of our approach by showing its superiority over traditional portfolio management models.","PeriodicalId":432250,"journal":{"name":"Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122582902","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}
S. Ilarri, O. Wolfson, E. Mena, A. Illarramendi, N. Rishe
Networks of sensors arise naturally in many different fields, from industrial applications (e.g., monitoring of environmental parameters in a chemical plant) to surveillance applications (e.g., sensors that detect the presence of intruders in a private property). The common feature of these applications is the necessity of a monitoring infrastructure that analyzes continuous supplies of data streams and outputs the values that satisfy certain constraints. In this paper we present an approach to process monitoring queries in a network of sensors with prediction functions. We consider sensors that communicate their values according to a threshold policy and our query processing leverages prediction functions to compare tuples efficiently and generate answers even in the absence of new incoming tuples. We deal with two types of constraints: window-join constraints and value constraints.
{"title":"Processing of Data Streams with Prediction Functions","authors":"S. Ilarri, O. Wolfson, E. Mena, A. Illarramendi, N. Rishe","doi":"10.1109/HICSS.2006.393","DOIUrl":"https://doi.org/10.1109/HICSS.2006.393","url":null,"abstract":"Networks of sensors arise naturally in many different fields, from industrial applications (e.g., monitoring of environmental parameters in a chemical plant) to surveillance applications (e.g., sensors that detect the presence of intruders in a private property). The common feature of these applications is the necessity of a monitoring infrastructure that analyzes continuous supplies of data streams and outputs the values that satisfy certain constraints. In this paper we present an approach to process monitoring queries in a network of sensors with prediction functions. We consider sensors that communicate their values according to a threshold policy and our query processing leverages prediction functions to compare tuples efficiently and generate answers even in the absence of new incoming tuples. We deal with two types of constraints: window-join constraints and value constraints.","PeriodicalId":432250,"journal":{"name":"Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116744064","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}
Understanding the social roles of the members a group can help to understand the social context of the group. We present a method of applying social network analysis to support the task of characterizing authors in Usenet newsgroups. We compute and visualize networks created by patterns of replies for each author in selected newsgroups and find that second-degree ego-centric networks give us clear distinctions between different types of authors and newsgroups. Results show that newsgroups vary in terms of the populations of participants and the roles that they play. Newsgroups can be characterized by populations that include question and answer newsgroups, conversational newsgroups, social support newsgroups, and flame newsgroups. This approach has applications for both researchers seeking to characterize different types of social cyberspaces as well as participants seeking to distinguish interaction partners and content authors.
{"title":"You Are Who You Talk To: Detecting Roles in Usenet Newsgroups","authors":"Danyel Fisher, Marc A. Smith, Howard T. Welser","doi":"10.1109/HICSS.2006.536","DOIUrl":"https://doi.org/10.1109/HICSS.2006.536","url":null,"abstract":"Understanding the social roles of the members a group can help to understand the social context of the group. We present a method of applying social network analysis to support the task of characterizing authors in Usenet newsgroups. We compute and visualize networks created by patterns of replies for each author in selected newsgroups and find that second-degree ego-centric networks give us clear distinctions between different types of authors and newsgroups. Results show that newsgroups vary in terms of the populations of participants and the roles that they play. Newsgroups can be characterized by populations that include question and answer newsgroups, conversational newsgroups, social support newsgroups, and flame newsgroups. This approach has applications for both researchers seeking to characterize different types of social cyberspaces as well as participants seeking to distinguish interaction partners and content authors.","PeriodicalId":432250,"journal":{"name":"Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129739898","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}
This paper describes a new strategy for data gathering in wireless sensor networks that takes into account the need for both energy saving, typical of such networks, and for a reasonable tradeoff between robustness and efficiency. The proposed algorithm implements an efficient strategy for retransmission of lost packets by discovering alternative routes and making clever use of multiple paths when necessary; in order to do that we build upon the general framework presented in recent works, that provided a formulation of duplicate and order insensitive aggregation functions, and by taking advantage of some intrinsic characteristics of the wireless sensor networks, we exploit implicit acknowledgment of reception and smart caching of the data. Assuming that, unlike in an ideal scenario, data originates from only a subset of all sensors, our approach provides a better usage of the resources and a minimization of the traffic in the network, and, as a consequence, of the overall consumed energy.
{"title":"Robust and Efficient Data Gathering for Wireless Sensor Networks","authors":"L. Gatani, G. Re, M. Ortolani","doi":"10.1109/HICSS.2006.425","DOIUrl":"https://doi.org/10.1109/HICSS.2006.425","url":null,"abstract":"This paper describes a new strategy for data gathering in wireless sensor networks that takes into account the need for both energy saving, typical of such networks, and for a reasonable tradeoff between robustness and efficiency. The proposed algorithm implements an efficient strategy for retransmission of lost packets by discovering alternative routes and making clever use of multiple paths when necessary; in order to do that we build upon the general framework presented in recent works, that provided a formulation of duplicate and order insensitive aggregation functions, and by taking advantage of some intrinsic characteristics of the wireless sensor networks, we exploit implicit acknowledgment of reception and smart caching of the data. Assuming that, unlike in an ideal scenario, data originates from only a subset of all sensors, our approach provides a better usage of the resources and a minimization of the traffic in the network, and, as a consequence, of the overall consumed energy.","PeriodicalId":432250,"journal":{"name":"Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06)","volume":"2635 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129927554","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}
C. Watters, M. Shepherd, A. Abouzeid, A. Cox, M. Kellar, Hadi Kharrazi, Fengan Liu, A. Otley
Digital games have the ability to engage both children and adults alike. We are exploring the use of games for children with long term treatment regimes, where motivation for compliance is a key factor in the success of the treatment. In this paper, we describe the game framework we are building for this purpose. This framework is meant to support the long term use of a gaming world for children with three main goals: (a) provide easy and continual gaming access on a range of computing appliances including small screen devices; (b) offer games that can be personalized and are adaptable based on the child’s interests or specific illness; and (c) maintain novelty and interest in the treatment over time. This framework not only provides a benefit to the children involved, but also provides user data to the coaches, clinicians, and health researchers involved in the child’s treatment regime.
{"title":"Extending the Use of Games in Health Care","authors":"C. Watters, M. Shepherd, A. Abouzeid, A. Cox, M. Kellar, Hadi Kharrazi, Fengan Liu, A. Otley","doi":"10.1109/HICSS.2006.179","DOIUrl":"https://doi.org/10.1109/HICSS.2006.179","url":null,"abstract":"Digital games have the ability to engage both children and adults alike. We are exploring the use of games for children with long term treatment regimes, where motivation for compliance is a key factor in the success of the treatment. In this paper, we describe the game framework we are building for this purpose. This framework is meant to support the long term use of a gaming world for children with three main goals: (a) provide easy and continual gaming access on a range of computing appliances including small screen devices; (b) offer games that can be personalized and are adaptable based on the child’s interests or specific illness; and (c) maintain novelty and interest in the treatment over time. This framework not only provides a benefit to the children involved, but also provides user data to the coaches, clinicians, and health researchers involved in the child’s treatment regime.","PeriodicalId":432250,"journal":{"name":"Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128738251","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}
Today’s business environment is characterized by highly transparent markets and global competition. Technology life cycles are decreasing due to the fast pace at which development of new technologies is progressing. To compete in this environment, it is necessary to identify upcoming innovations and trends as early as possible to decrease uncertainty, implement technology leadership, and create competitive advantage. In a parallel development, the amount of information available is already vast and increasing daily. With a growing number of features for innovation in technology, each contributing a new need for analysis, technology forecasting has become increasingly challenging. The goal of our paper is to investigate to what extent knowledge management technologies support and improve the technology forecasting process to face the aforementioned problems successfully. Consequently, we will develop a characterization scheme which works as a framework for the subsequent evaluation of knowledge management technologies and apply this to a real world case.
{"title":"Evaluation of Knowledge Management Technologies for the Support of Technology Forecasting","authors":"Marc Henselewski, Stefan Smolnik, G. Riempp","doi":"10.1109/HICSS.2006.163","DOIUrl":"https://doi.org/10.1109/HICSS.2006.163","url":null,"abstract":"Today’s business environment is characterized by highly transparent markets and global competition. Technology life cycles are decreasing due to the fast pace at which development of new technologies is progressing. To compete in this environment, it is necessary to identify upcoming innovations and trends as early as possible to decrease uncertainty, implement technology leadership, and create competitive advantage. In a parallel development, the amount of information available is already vast and increasing daily. With a growing number of features for innovation in technology, each contributing a new need for analysis, technology forecasting has become increasingly challenging. The goal of our paper is to investigate to what extent knowledge management technologies support and improve the technology forecasting process to face the aforementioned problems successfully. Consequently, we will develop a characterization scheme which works as a framework for the subsequent evaluation of knowledge management technologies and apply this to a real world case.","PeriodicalId":432250,"journal":{"name":"Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06)","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128216556","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}
Although the discovery time between a pair of Bluetooth devices has been well characterized, the impact of multiple inquiring devices on the discovery time has not. Discovery time must be considered when forming or maintaining Bluetooth networks with multiple inquiring devices. The presence of a second inquiring device can significantly delay, and even preclude, the discovery of a scanning device by an inquiring node. When a scan window opens, each inquiring device does not have an equal likelihood of discovering the scanning node since one inquirer may consistently transmit on the scan frequency before the other. The discovery time probability density function with multiple inquiring devices is presented.
{"title":"Bluetooth Discovery Time with Multiple Inquirers","authors":"Brian S. Peterson, R. Baldwin, R. Raines","doi":"10.1109/HICSS.2006.76","DOIUrl":"https://doi.org/10.1109/HICSS.2006.76","url":null,"abstract":"Although the discovery time between a pair of Bluetooth devices has been well characterized, the impact of multiple inquiring devices on the discovery time has not. Discovery time must be considered when forming or maintaining Bluetooth networks with multiple inquiring devices. The presence of a second inquiring device can significantly delay, and even preclude, the discovery of a scanning device by an inquiring node. When a scan window opens, each inquiring device does not have an equal likelihood of discovering the scanning node since one inquirer may consistently transmit on the scan frequency before the other. The discovery time probability density function with multiple inquiring devices is presented.","PeriodicalId":432250,"journal":{"name":"Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129229114","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}
Cross-agency collaborations are critical to the success of e-government, which has great potential to transform the way that governments work, share information and deliver services to external and internal clients. Most prior research examining cross-agency collaborations has focused on "what" and "why" issues, thus offering only limited discussions on how to ensure effective cross-agency collaborations. In this study, we propose a framework for the institution structure critical to effective cross-agency collaborations in e-government initiatives. We then apply this framework to examine the institution (enterprise) efforts for implementing OneStop Business Registration (OSBR), a successful e-government initiative in the State of Utah. Our framework encompasses critical enablers supported by a fundamental infrastructural underpinning. Institution structures that follow the proposed framework can facilitate the horizontal integration among multiple autonomous agencies while coping with the existing bureaucratic structures without challenging each agency’s objectives, constraints, or autonomy. Our analysis and findings have important implications to e-government research and practice, which are also discussed.
{"title":"Examining Cross-Agency Collaborations in E-Government Initiatives","authors":"P. H. Hu, Dai Cui, Alan Charles Sherwood","doi":"10.1109/HICSS.2006.165","DOIUrl":"https://doi.org/10.1109/HICSS.2006.165","url":null,"abstract":"Cross-agency collaborations are critical to the success of e-government, which has great potential to transform the way that governments work, share information and deliver services to external and internal clients. Most prior research examining cross-agency collaborations has focused on \"what\" and \"why\" issues, thus offering only limited discussions on how to ensure effective cross-agency collaborations. In this study, we propose a framework for the institution structure critical to effective cross-agency collaborations in e-government initiatives. We then apply this framework to examine the institution (enterprise) efforts for implementing OneStop Business Registration (OSBR), a successful e-government initiative in the State of Utah. Our framework encompasses critical enablers supported by a fundamental infrastructural underpinning. Institution structures that follow the proposed framework can facilitate the horizontal integration among multiple autonomous agencies while coping with the existing bureaucratic structures without challenging each agency’s objectives, constraints, or autonomy. Our analysis and findings have important implications to e-government research and practice, which are also discussed.","PeriodicalId":432250,"journal":{"name":"Proceedings of the 39th Annual Hawaii International Conference on System Sciences (HICSS'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129351998","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
扫码关注我们
求助内容：
应助结果提醒方式：