Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year

Articles 5311 - 5340 of 5707

Full-Text Articles in Entire DC Network

An Empirical Investigation On End-Users’ Acceptance Of Enterprise Systems, Fiona Fui-Hoon Nah, Xin Tan, Soon Hing Teh Jul 2004

An Empirical Investigation On End-Users’ Acceptance Of Enterprise Systems, Fiona Fui-Hoon Nah, Xin Tan, Soon Hing Teh

Research Collection School Of Computing and Information Systems

Despite the huge investments by organizations in ERP implementation, maintenance, and user training, ERP implementation failures and less-than-satisfactory productivity improvements are common. End-users’ reluctance or unwillingness to adopt or use the newly implemented ERP system is often cited as one of the main reasons for ERP failures. To examine factors leading to the lack of end-user acceptance of ERP systems, we reviewed the literature on user adoption of IT in mandatory contexts, developed hypotheses to explain ERP user acceptance, and conducted a survey study to test the hypotheses. In particular, we examined end-users’ attitudes toward system use and symbolic adoption, …

Go to article

Taking Dcop To The Real World: Efficient Complete Solutions For Distributed Event Scheduling, Rajiv Maheswaran, Milind Tambe, Emma Bowring, Jonathan Pearce, Pradeep Varakantham Jul 2004

Taking Dcop To The Real World: Efficient Complete Solutions For Distributed Event Scheduling, Rajiv Maheswaran, Milind Tambe, Emma Bowring, Jonathan Pearce, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Distributed Constraint Optimization (DCOP) is an elegant formalism relevant to many areas in multiagent systems, yet complete algorithms have not been pursued for real world applications due to perceived complexity. To capably capture a rich class of complex problem domains, we introduce the Distributed Multi-Event Scheduling (DiMES) framework and design congruent DCOP formulations with binary constraints which are proven to yield the optimal solution. To approach real-world efficiency requirements, we obtain immense speedups by improving communication structure and precomputing best case bounds. Heuristics for generating better communication structures and calculating bound in a distributed manner are provided and tested on …

Go to article

Notes On Equilibria In Symmetric Games, Shih-Fen Cheng, Daniel M. Reeves, Yevgeniy Vorobeychik, Michael P. Wellman Jul 2004

Notes On Equilibria In Symmetric Games, Shih-Fen Cheng, Daniel M. Reeves, Yevgeniy Vorobeychik, Michael P. Wellman

Research Collection School Of Computing and Information Systems

In a symmetric game, every player is identical with respect to the game rules. We show that a symmetric 2strategy game must have a pure-strategy Nash equilibrium. We also discuss Nash’s original paper and its generalized notion of symmetry in games. As a special case of Nash’s theorem, any finite symmetric game has a symmetric Nash equilibrium. Furthermore, symmetric infinite games with compact, convex strategy spaces and continuous, quasiconcave utility functions have symmetric pure-strategy Nash equilibria. Finally, we discuss how to exploit symmetry for more efficient methods of finding Nash equilibria.

Go to article

An Interactive Learning Environment For A Dynamic Educational Digital Library, Ee Peng Lim, Dion Hoe-Lian Goh, Yin-Leng Theng, Eng-Kai Suen Jul 2004

An Interactive Learning Environment For A Dynamic Educational Digital Library, Ee Peng Lim, Dion Hoe-Lian Goh, Yin-Leng Theng, Eng-Kai Suen

Research Collection School Of Computing and Information Systems

GeogDL is a digital library of geography examination resources designed to assist students in preparing for a national geography examination in Singapore. We describe an interactive learning environment built into GeogDL that consists of four major components. The practice and review module allows students to attempt individual examination questions, the mock exam provides a simulation of the actual geography examination, the trends analysis tool provides an overview of the types of questions asked in previous examinations, while the contributions module allows students and teachers to create and share knowledge within the digital library.

Go to article

A Rate-Distortion Framework For Information-Theoretic Mobility Management, Abhishek Roy, Archan Misra, Sajal K. Das Jun 2004

A Rate-Distortion Framework For Information-Theoretic Mobility Management, Abhishek Roy, Archan Misra, Sajal K. Das

Research Collection School Of Computing and Information Systems

A practical information theoretic framework is developed for studying the optimal tradeoff between location update and paging costs in cellular networks. The framework envisions the quantization of location information into a registration area (RA) level granularity, followed by the use of an entropy-coding technique to decrease the location update rate. The rate distortion theory of the lossy quantization is identified as an appropriate measure for capturing the optimal tradeoff between a mobile's update rate and its location uncertainty. Based on LZ-78 compression, two different RA-level location update algorithms (RA-LeZi and LeZi-RA) have been developed, both of which asymptotically approach this …

Go to article

Proprietary And Open Systems Adoption In E-Procurement: A Risk-Augmented Transactions Cost Perspective, Robert J. Kauffman, Hamid Mohtadi Jun 2004

Proprietary And Open Systems Adoption In E-Procurement: A Risk-Augmented Transactions Cost Perspective, Robert J. Kauffman, Hamid Mohtadi

Research Collection School Of Computing and Information Systems

We present an economic model that enables the study of incentives for business-to-business (B2B) e-procurement systems investments that permit inventory coordination and improved operational control. We focus on the information technology adoption behavior of firms in the presence of transaction costs, agency costs and information uncertainty. We conclude that it is appropriate to rethink the prior theory and develop an extended transaction-cost theory perspective that incorporates the possibility of shocks. We distinguish among three kinds of B2B e-procurement systems platforms. Proprietary platform procurement systems involve traditional electronic data interchange (EDI) technologies. Open platform procurement systems are associated with e-market Web …

Go to article

The Complexity Of Uml: Differentiating Practical And Theoretical Complexity, J. Erickson, Keng Siau Jun 2004

The Complexity Of Uml: Differentiating Practical And Theoretical Complexity, J. Erickson, Keng Siau

Research Collection School Of Computing and Information Systems

UML (Unified Modeling Language) has been criticized for its complexity, relating to users, and those learning to use it. Using Rossi and Brinkkemper’s [9] complexity metrics, Siau and Cao [10] completed a complexity analysis of UML and 36 other modeling techniques, finding that UML is indeed more complex than other techniques. Siau, Erickson and Lee [11] argued that Rossi and Brinkkemper’s metrics present the theoretical maximum complexity, as opposed to a practitioner-based complexity, that must be less than the theoretical maximum. The current research proposes that a subset of UML (a kernel) composed of the most commonly used constructs, would …

Go to article

Furthering The Understanding Of Practical Complexity: Identifying A Kernel Of Uml, J. Erickson, Keng Siau Jun 2004

Furthering The Understanding Of Practical Complexity: Identifying A Kernel Of Uml, J. Erickson, Keng Siau

Research Collection School Of Computing and Information Systems

The Unified Modeling Language (UML) was adopted by the Object Management Group as the standard visual modeling language for OO systems development. However, UML has been criticized in the literature for its complexity, inconsistent semantics, and ambiguous constructs. A set of complexity indices for UML in aggregate, and the nine diagramming techniques individually, was compiled recently. Since this set of metrics is based on inclusion of all possible constructs in UML, it thus provides an indication of the theoretical (maximum) complexity of the modeling methods. This paper contends that in practice, developers do not use all of the possible diagrams …

Go to article

Steganographic Schemes For File System And B-Tree, Hwee Hwa Pang, Kian-Lee Tan, Xuan Zhou Jun 2004

Steganographic Schemes For File System And B-Tree, Hwee Hwa Pang, Kian-Lee Tan, Xuan Zhou

Research Collection School Of Computing and Information Systems

While user access control and encryption can protect valuable data from passive observers, these techniques leave visible ciphertexts that are likely to alert an active adversary to the existence of the data. We introduce StegFD, a steganographic file driver that securely hides user-selected files in a file system so that, without the corresponding access keys, an attacker would not be able to deduce their existence. Unlike other steganographic schemes proposed previously, our construction satisfies the prerequisites of a practical file system in ensuring the integrity of the files and maintaining efficient space utilization. We also propose two schemes for implementing …

Go to article

Tournament Versus Fitness Uniform Selection, Shane Legg, Marcus Hutter, Akshat Kumar Jun 2004

Tournament Versus Fitness Uniform Selection, Shane Legg, Marcus Hutter, Akshat Kumar

Research Collection School Of Computing and Information Systems

In evolutionary algorithms a critical parameter that must be tuned is that of selection pressure. If it is set too low then the rate of convergence towards the optimum is likely to be slow. Alternatively if the selection pressure is set too high the system is likely to become stuck in a local optimum due to a loss of diversity in the population. The recent Fitness Uniform Selection Scheme (FUSS) is a conceptually simple but somewhat radical approach to addressing this problem - rather than biasing the selection towards higher fitness, FUSS biases selection towards sparsely populated fitness levels. In …

Go to article

Modified Art 2a Growing Network Capable Of Generating A Fixed Number Of Nodes, Ji He, Ah-Hwee Tan, Chew-Lim Tan May 2004

Modified Art 2a Growing Network Capable Of Generating A Fixed Number Of Nodes, Ji He, Ah-Hwee Tan, Chew-Lim Tan

Research Collection School Of Computing and Information Systems

This paper introduces the Adaptive Resonance Theory under Constraint (ART-C 2A) learning paradigm based on ART 2A, which is capable of generating a user-defined number of recognition nodes through online estimation of an appropriate vigilance threshold. Empirical experiments compare the cluster validity and the learning efficiency of ART-C 2A with those of ART 2A, as well as three closely related clustering methods, namely online K-Means, batch K-Means, and SOM, in a quantitative manner. Besides retaining the online cluster creation capability of ART 2A, ART-C 2A gives the alternative clustering solution, which allows a direct control on the number of output …

Go to article

Performance Planning, Quality-Of-Service, And Pricing Under Competition, Corinne Touati, Parijat Dube, Laura Wynter May 2004

Performance Planning, Quality-Of-Service, And Pricing Under Competition, Corinne Touati, Parijat Dube, Laura Wynter

Research Collection School Of Computing and Information Systems

In this work we model the relationship between the capacity and the Quality of Service (QoS) offered by the firm in a competitive scenario of two firm’s working to maximize their profits. Using simple queueing theoretic models we study the sensitivity of a firm’s market share to price, capacity and market size. Our preliminary studies yield important properties of the equilibrium solution which may further provide important “engineering” guidelines for performance planning and pricing strategies.

Go to article

A Stage Model For E-Government Implementation, Keng Siau, Y. Long May 2004

A Stage Model For E-Government Implementation, Keng Siau, Y. Long

Research Collection School Of Computing and Information Systems

With the advancement of wired and wireless technologies in recent years, the concept of an e-government has attracted increasing interests from both researchers and practitioners. The E-Government Act of 2002 was signed into law by President Bush to encourage government agencies to efficiently and effectively serve their customers over the Web. E-government presents a way for government agencies to use new technologies, such as the Internet, to provide citizens, businesses, and other governments with a more convenient access to government information and services, to improve the quality of services, and to provide greater opportunities for citizens to participate in democratic …

Go to article

Multi-Period Multi-Dimensional Knapsack Problem And Its Application To Available-To-Promise, Hoong Chuin Lau, M. K. Lim May 2004

Multi-Period Multi-Dimensional Knapsack Problem And Its Application To Available-To-Promise, Hoong Chuin Lau, M. K. Lim

Research Collection School Of Computing and Information Systems

This paper is motivated by a recent trend in logistics scheduling, called Available-to-Promise. We model this problem as the multi-period multi-dimensional knapsack problem. We provide some properties for a special case of a single-dimensional problem. Based on insights obtained from these properties, we propose a two-phase heuristics for solving the multi-dimensional problem. We also propose a novel time-based ant colony optimization algorithm. The quality of the solutions generated is verified through experiments, where we demonstrate that the computational time is superior compared with integer programming to achieve solutions that are within a small percentage of the upper bounds.

Go to article

The Evolution Of Research On Information Systems: A Fiftieth Year Survey Of The Literature In Management Science, Rajiv D. Banker, Robert J. Kauffman Mar 2004

The Evolution Of Research On Information Systems: A Fiftieth Year Survey Of The Literature In Management Science, Rajiv D. Banker, Robert J. Kauffman

Research Collection School Of Computing and Information Systems

The development of the information systems (IS) literature in Management Science during the past 50 years reflects the inception, growth, and maturation of several different research streams. The five research streams we identify incorporate different definitions of the managerial problems that relate to IS, the alternate theoretical perspectives and different methodological paradigms to study them, and the levels of the organization at which their primary results impact managerial practice. The decision support and design science research stream studies the application of computers in decision support, control, and managerial decision making. The value of information research stream reflects relationships established based …

Go to article

Prediction Of Rna-Binding Proteins From Primary Sequence By A Support Vector Machine Approach., Lian Yi Han, Cong Zhong Cai, Siaw Ling Lo, Maxey Chung, Yu Zong Chen Mar 2004

Prediction Of Rna-Binding Proteins From Primary Sequence By A Support Vector Machine Approach., Lian Yi Han, Cong Zhong Cai, Siaw Ling Lo, Maxey Chung, Yu Zong Chen

Research Collection School Of Computing and Information Systems

Elucidation of the interaction of proteins with different molecules is of significance in the understanding of cellular processes. Computational methods have been developed for the prediction of protein-protein interactions. But insufficient attention has been paid to the prediction of protein-RNA interactions, which play central roles in regulating gene expression and certain RNA-mediated enzymatic processes. This work explored the use of a machine learning method, support vector machines (SVM), for the prediction of RNA-binding proteins directly from their primary sequence. Based on the knowledge of known RNA-binding and non-RNA-binding proteins, an SVM system was trained to recognize RNA-binding proteins. A total …

Go to article

Knowledge-Based Support In A Group Decision-Making Context: An Expert-Novice Comparison, Fiona Fui-Hoon Nah, I. Benbasat Mar 2004

Knowledge-Based Support In A Group Decision-Making Context: An Expert-Novice Comparison, Fiona Fui-Hoon Nah, I. Benbasat

Research Collection School Of Computing and Information Systems

This research examines the use of knowledge-based and explanation facilities to support group decision making of experts versus novices. Consistent with predictions from the persuasion literature, our results show that experts exhibit a higher level of criticality and involvement in their area of expertise; this not only decreases their likelihood of being persuaded by a knowledge-based system, but also accounts for a lower group consensus among experts as compared to novices. Novices are more easily persuaded by the system and find the system to be more useful than experts do. This research integrates theories from the persuasion literature to understand …

Go to article

A Smart-Card-Enabled Privacy Preserving E-Prescription System, Yanjiang Yang, Xiaoxi Han, Feng Bao, Robert H. Deng Mar 2004

A Smart-Card-Enabled Privacy Preserving E-Prescription System, Yanjiang Yang, Xiaoxi Han, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

Within the overall context of protection of health care information, privacy of prescription data needs special treatment. First, the involvement of diverse parties, especially nonmedical parties in the process of drug prescription complicates the protection of prescription data. Second, both patients and doctors have privacy stakes in prescription, and their privacy should be equally protected. Third, the following facts determine that prescription should not be processed in a truly anonymous manner: certain involved parties conduct useful research on the basis of aggregation of prescription data that are linkable with respect to either the patients or the doctors; prescription data has …

Go to article

An Automated Algorithm For Extracting Website Skeleton, Zehua Liu, Wee-Keong Ng, Ee Peng Lim Mar 2004

An Automated Algorithm For Extracting Website Skeleton, Zehua Liu, Wee-Keong Ng, Ee Peng Lim

Research Collection School Of Computing and Information Systems

The huge amount of information available on the Web has attracted many research efforts into developing wrappers that extract data from webpages. However, as most of the systems for generating wrappers focus on extracting data at page-level, data extraction at site-level remains a manual or semi-automatic process. In this paper, we study the problem of extracting website skeleton, i.e. extracting the underlying hyperlink structure that is used to organize the content pages in a given website. We propose an automated algorithm, called the Sew algorithm, to discover the skeleton of a website. Given a page, the algorithm examines hyperlinks in …

Go to article

Security Analysis Of Some Proxy Signature, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng Mar 2004

Security Analysis Of Some Proxy Signature, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng

Research Collection School Of Computing and Information Systems

A proxy signature scheme allows an entity to delegate his/her signing capability to another entity in such a way that the latter can sign messages on behalf of the former. Such schemes have been suggested for use in a number of applications, particularly in distributed computing where delegation of rights is quite common. Followed by the first schemes introduced by Mambo, Usuda and Okamoto in 1996, a number of new schemes and improvements have been proposed. In this paper, we present a security analysis of four such schemes newly proposed. By successfully identifying several interesting forgery attacks, we show that …

Go to article

Hiding Data Accesses In Steganographic File System, Xuan Zhou, Hwee Hwa Pang, Kian-Lee Tan Mar 2004

Hiding Data Accesses In Steganographic File System, Xuan Zhou, Hwee Hwa Pang, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

To support ubiquitous computing, the underlying data have to be persistent and available anywhere-anytime. The data thus have to migrate from devices local to individual computers, to shared storage volumes that are accessible over open network. This potentially exposes the data to heightened security risks. We propose two mechanisms, in the context of a steganographic file system, to mitigate the risk of attacks initiated through analyzing data accesses from user applications. The first mechanism is intended to counter attempts to locate data through updates in between snapshots - in short, update analysis. The second mechanism prevents traffic analysis - identifying …

Go to article

Effects Of Query Complexity And Learning On Novice User Query Performance With Conceptual And Logical Database Interfaces, Keng Siau, Hock Chuan Chan, Kwok Kee Wei Mar 2004

Effects Of Query Complexity And Learning On Novice User Query Performance With Conceptual And Logical Database Interfaces, Keng Siau, Hock Chuan Chan, Kwok Kee Wei

Research Collection School Of Computing and Information Systems

Users see the database interface as the database system. A good interface enables them to formulate queries better. The semantics communicated through the interface can be classified according to abstraction levels, such as the conceptual and logical levels. With the conceptual interface, interaction is in terms of real-world concepts such as entities, objects and relationships. Current user-database interaction is mainly based on the logical interface, where interaction is in terms of abstract database concepts such as relations and joins. Many researchers argue that end users will perform better with the conceptual interface. This research tested this claim, as well as …

Go to article

Group Nearest Neighbor Queries, Dimitris Papadias, Qiongmao Shen, Yufei Tao, Kyriakos Mouratidis Mar 2004

Group Nearest Neighbor Queries, Dimitris Papadias, Qiongmao Shen, Yufei Tao, Kyriakos Mouratidis

Research Collection School Of Computing and Information Systems

Given two sets of points P and Q, a group nearest neighbor (GNN) query retrieves the point(s) of P with the smallest sum of distances to all points in Q. Consider, for instance, three users at locations q1 , q2 and q3 that want to find a meeting point (e.g., a restaurant); the corresponding query returns the data point p that minimizes the sum of Euclidean distances |pqi| for 1 ≤i ≤3. Assuming that Q fits in memory and P is indexed by an R-tree, we propose several algorithms for finding the group nearest neighbors efficiently. As a second step, …

Go to article

Stochastic Analysis And Performance Evaluation Of Wireless Schedulers, R. Rom, Hwee-Pink Tan Feb 2004

Stochastic Analysis And Performance Evaluation Of Wireless Schedulers, R. Rom, Hwee-Pink Tan

Research Collection School Of Computing and Information Systems

In the last few years, wireless scheduling algorithms have been proposed by supplementing wireline scheduling algorithms with a wireless adaptation scheme. However, Quality of Service (QoS) bounds have either been derived for flows that perceive error-free conditions or a static worst-case channel condition. Such an assumption of the channel condition is unrealistic, since channel errors are known to be bursty in nature. Hence, these bounds are inadequate to characterize the scheduler's QoS performance. Our research focuses on performing an extensive analysis of wireless scheduling in order to derive statistical QoS performance bounds under realistic channel conditions. In this paper, we …

Go to article

Java-Based Digital Library Portal For Geography Education, Zehua Liu, Hai Yuan, Ee Peng Lim, Ming Yin, Dion Hoe-Lian Goh, Yin-Leng Theng, Wee-Keong Ng Jan 2004

Java-Based Digital Library Portal For Geography Education, Zehua Liu, Hai Yuan, Ee Peng Lim, Ming Yin, Dion Hoe-Lian Goh, Yin-Leng Theng, Wee-Keong Ng

Research Collection School Of Computing and Information Systems

G-Portal is a Java-based digital library system for managing the metadata of geography related resources on the Web. In addition to providing a flexible repository subsystem to accommodate metadata of different formats using XML and XML Schemas, G-Portal organizes metadata into projects and layers, and supports an integrated and synchronized classification and map-based interfaces over the stored metadata. G-Portal also includes a classification subsystem that creates category structures and classifies metadata resources into categories based on user-specified classification schemas. Furthermore, G-Portal users can annotate resources and make their annotations available to others. In this paper, we describe the design and …

Go to article

Supply Chains Integration: Architecture And Enabling Technologies, Keng Siau, Yuhong Tian Jan 2004

Supply Chains Integration: Architecture And Enabling Technologies, Keng Siau, Yuhong Tian

Research Collection School Of Computing and Information Systems

An effective and efficient supply chain is vital to the competitiveness and the survival of an organization. With the emergence of the e-business era, supply chain systems need to be able to extend beyond the traditional boundaries. This paper proposes integrated supply chain architecture (SCA) that combines the benefits of Enterprise Resource Planning (ERP) and the various supply chain applications. Some necessary criteria for an integrated supply chain include completeness, security, flexibility, scalability, and interoperability. The enabling technologies for such a supply chain system include XML, DCOM, CORBA, SOAP, Net, and Semantic Web. Wireless and mobile technologies could further extend …

Go to article

Qos Routing Optimization Strategy Using Genetic Algorithm In Optical Fiber Communication Networks, Zhaoxia Wang, Zengqiang Chen, Zhuzhi Yuan Jan 2004

Qos Routing Optimization Strategy Using Genetic Algorithm In Optical Fiber Communication Networks, Zhaoxia Wang, Zengqiang Chen, Zhuzhi Yuan

Research Collection School Of Computing and Information Systems

This paper describes the routing problems in optical fiber networks, defines five constraints, induces and simplifies the evaluation function and fitness function, and proposes a routing approach based on the genetic algorithm, which includes an operator [OMO] to solve the QoS routing problem in optical fiber communication networks. The simulation results show that the proposed routing method by using this optimal maintain operator genetic algorithm (OMOGA) is superior to the common genetic algorithms (CGA). It not only is robust and efficient but also converges quickly and can be carried out simply, that makes it better than other complicated GA.

Go to article

A New Look At The Multiclass Network Equilibrium Problem, Patrice Marcotte, Laura Wynter Jan 2004

A New Look At The Multiclass Network Equilibrium Problem, Patrice Marcotte, Laura Wynter

Research Collection School Of Computing and Information Systems

The multiclass network equilibrium problem is expressed in general as a nonmonotone, asymmetric, variational inequality problem. We show that in spite of the nonmonotonicity of the cost operator, the problem may actually satisfy a weaker property, induced by the hierarchical nature of the travel cost interactions. This property allows a natural decomposition approach, not otherwise available, that admits provably convergent algorithms. We present one such algorithm, easily implementable using a solver for the single-class network equilibrium problem, together with a convergence proof.

Go to article

Evaluating The Usability Of A Group Support System Using Co-Discovery, Keng Siau Jan 2004

Evaluating The Usability Of A Group Support System Using Co-Discovery, Keng Siau

Research Collection School Of Computing and Information Systems

Group Support Systems (GSSs) have emerged as a new type of information system to aid group decision-making. With the proliferation of such systems in organizations, evaluation of GSSs is becoming increasingly important. This paper reports the evaluation of an existing GSS. Our usability framework consists of nine dimensions: visual clarity, consistency, compatibility, informative feedback, explicitness, flexibility and control, error prevention and correction, ease of learning, and ease of use. We make use of the co-discovery method where teams of two participants perform tasks together while being observed. The study involves questionnaires and interview sessions. The strengths and weaknesses of the …

Go to article

Powerful Change Part 2: Reducing The Power Demands Of Mobile Devices, Rajesh Krishna Balan Jan 2004

Powerful Change Part 2: Reducing The Power Demands Of Mobile Devices, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

Consumers expect their mobile devices to be small and light, have a decent battery lifetime, and still be powerful enough to run all their desired applications. The need to satisfy such consumer demands has driven mobile-device manufacturers to make products (such as PDAs and cell phones) that match these needs. However, this inevitably requires tradeoffs. Building smaller, lighter devices requires sacrificing the device's battery capacity because battery technology is still fairly dense and heavy, and contributes most of a mobile device's size and weight. But, mobile devices with the required resources to run useful desktop applications need additional battery power …

Go to article

First Prev Next Last