2843157
Expectations and rankings of Web site quality features: results of two studies on user perceptions
In the emerging electronic environment, the creation of customer-centered Web sites is becoming increasingly important. We report on two exploratory studies on user perceptions of using Web sites. We first use Kano's (1984) Model of Quality to conduct an investigation of quality features in the Web environment. An independently conducted study later expands the first study by addressing several limitations. The results of both studies suggest that: the Kano quality model can be used as a framework to control Web site quality in terms of three quality types and the time transition of the quality nature; not every feature is regarded as equally important within a Web domain; and different domains have different rankings of important features, although there are certain features that are regarded as highly important among domains studied. These studies provide some empirical evidence on user perceptions of Web site quality features and lead to further theoretical investigations.
27857321
Human-computer interaction research in the management information systems discipline
Research in Human-Computer Interaction (HCI) crosses various disciplines, including Management Information Systems (MIS), Computer Science, Industrial Engineering, Information Science, Psychology, Sociology, and Anthropology (Nah et al., 2005). Recent years have witnessed a steady growth of HCI research in the MIS discipline (Zhang et al., 2002; Zhang and Dillon 2003; Zhang et al., 2004; Nah et al., 2005; Zhang and Li, 2005; Zhang et al., 2005). HCI has become an important theme at major MIS conferences while cross-disciplinary research in HCI is also increasing. In this special section, we showcase exemplary HCI research in MIS. It is our hope that the sharing of these works with the HCI community in other disciplines will help to develop more synergy across areas.
5702445
The role of moderating factors in user technology acceptance
Along with increasing investments in new technologies, user technology acceptance becomes a frequently studied topic in the information systems discipline. The last two decades have seen user acceptance models being proposed, tested, refined, extended and unified. These models have contributed to our understanding of user technology acceptance factors and their relationships. Yet they have also presented two limitations: the relatively low explanatory power and inconsistent influences of the factors across studies. Several researchers have recently started to examine the potential moderating effects that may overcome these limitations. However, studies in this direction are far from being conclusive. This study attempts to provide a systematic analysis of the explanatory and situational limitations of existing technology acceptance studies. Ten moderating factors are identified and categorized into three groups: organizational factors, technological factors and individual factors. An integrative model is subsequently established, followed by corresponding propositions pertaining to the moderating factors.
1522370
A two factor theory for Website design
This study was designed to verify whether an analogy to Herzberg's hygiene-motivational theory about workplace could be used in the Web environment. According to this analogy, the presence of hygiene factors would provide the basic functionality of a Web site, while their absence would create user dissatisfaction. Motivating factors are those that contribute to user satisfaction. They add additional value and may entice users to keep returning to a Web site. In Phase I, we identified 44 core features in the Web environment that were classified into 12 categories by subjects. In Phase II, a different group of subjects in a pilot study were asked to distinguish between the hygiene and motivational characteristics of these features and categories. The preliminary results show that 4 categories and 14 features were judged to be primarily motivational, while 3 categories and 13 features were perceived to be primarily hygiene in nature. The remaining 5 categories and 17 features were perceived to be both.
27409707
A service-based network architecture for wearable robots
We are developing a network architecture for our novel robot concept of wearable robot. Wearable robots are mobile information devices capable of supporting remote communication and intelligent interaction between networked entities. In this paper, a service-based wearable robot network architecture that involves extensions to the Jini network model is presented. We discuss three extensions to the original Jini model. The first extension involves the incorporation of a task coordinator service such that the execution of the services can be managed using a priority queue. The second extension enables the system to automatically push the required service proxy to the client intelligently based on certain system-related conditions. In the third extension, we allow the system to automatically deliver the services based on contextual information. Using a fuzzy-logic-based decision making system, the matching service can determine whether the service should be automatically delivered utilizing the information provided by the service, client, lookup service and context sensors. An application scenario has been implemented to demonstrate the feasibility of this distributed service-based robot architecture.
41611208
A Unified Approach to Detecting Spatial Outliers
Spatial outliers represent locations which are significantly different from their neighborhoods even though they may not be significantly different from the entire population. Identification of spatial outliers can lead to the discovery of unexpected, interesting, and implicit knowledge, such as local instability. In this paper, we first provide a general definition of S-outliers for spatial outliers. This definition subsumes the traditional definitions of spatial outliers. Second, we characterize the computation structure of spatial outlier detection methods and present scalable algorithms. Third, we provide a cost model of the proposed algorithms. Finally, we experimentally evaluate our algorithms using a Minneapolis-St. Paul (Twin Cities) traffic data set.
37962125
On the planarity of iterated jump graphs
Abstract For a graph G of size m⩾1 and edge-induced subgraphs F and H of size r ( 1⩽r⩽m ), the subgraph H is said to be obtained from F by an edge jump if there exist four distinct vertices u,v,w, and x in G such that uv∈E(F) , wx∈E(G)−E(F) , and H=F−uv+wx . The minimum number of edge jumps required to transform F into H is the jump distance from F to H . For a graph G of size m⩾1 and an integer r with 1⩽r⩽m , the r -jump graph J r (G) is that graph whose vertices correspond to the edge-induced subgraphs of size r of G and where two vertices of J r (G) are adjacent if and only if the jump distance between the corresponding subgraphs is 1. For k⩾2 and r⩾1 , the k th iterated r -jump graph J r k (G) is defined as J r (J r k−1 (G)) , where J r 1 (G)=J r (G) . An infinite sequence {G i } of graphs is planar if every graph G i is planar. All graphs G for which {J r k (G)} ( r=1,2 ) is planar are determined and it is shown that if the sequence {J r k (G)} is nonplanar, then lim k→∞ gen( J r k (G))=∞ , where gen (G) denotes the genus of a graph G .
44929965
On the planarity of jump graphs
Abstract For a graph G of size m⩾1 and edge-induced subgraphs F and H of size k ( 1⩽k⩽m ), the subgraph H is said to be obtained from F by an edge jump if there exist four distinct vertices u,v,w, and x in G such that uv∈E(F) , wx∈E(G)−E(F) , and H=F−uv+wx . The minimum number of edge jumps required to transform F into H is the k -jump distance from F to H . For a graph G of size m⩾1 and an integer k with 1⩽k⩽m , the k -jump graph J k (G) is that graph whose vertices correspond to the edge-induced subgraphs of size k of G and where two vertices of J k (G) are adjacent if and only if the k -jump distance between the corresponding subgraphs is 1. All connected graphs G for which J 2 (G) is planar are determined.
36753167
k-Geodomination in graphs