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

Computer Sciences Commons

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

2000

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 61 - 90 of 436

Full-Text Articles in Computer Sciences

Electronic Commerce Strategy – Looking Through The Lenses Of An Innovation Strategy Model, A. Fruhling, Keng Siau Aug 2000

Electronic Commerce Strategy – Looking Through The Lenses Of An Innovation Strategy Model, A. Fruhling, Keng Siau

Research Collection School Of Computing and Information Systems

The world is in the midst of a revolution in the way businesses perform commerce. Many industries who were in the past relatively low tech are now finding themselves in a situation where they must embrace technology and prepare to compete head-on using ECommerce. This paradigm shift in thinking and competition is creating opportunities and chaos. This paper examines the innovation capability of organizations in evaluating and deploying their E-Commerce strategies. An Innovation Strategy Model is used in this research as the theoretical foundation. The case study and survey research methodologies were selected. Data gathering and analysis are in progress. …


E-Commerce Systems: Architecture, Infrastructure, Model, And Development Methodology, A. Bajaj, Keng Siau Aug 2000

E-Commerce Systems: Architecture, Infrastructure, Model, And Development Methodology, A. Bajaj, Keng Siau

Research Collection School Of Computing and Information Systems

The last decade has seen tremendous growth in the world wide web (WWW) (Berners-Lee, Caillau, Luotonen, Nielsen, & Secret, 1994) and e-commerce, which now offers organizations and consumers a unique channel to deliver and purchase goods and services. E-commerce is popularly classified as B2B (business to business), B2C (business to consumer) and C2C (consumer to consumer). B2B e-commerce, which is currently the fastest growing segment of e-commerce (Fellenstein & Wood, 2000), consists of making more efficient the flow of goods and services across organizations. This efficiency is typically increased using standards for electronic data exchange, automating certain processes across organizations …


Pengkalan Web Bermaklumat Untuk Pmr (Bahasa Inggeris), Shuaid Ema Shuaida Aug 2000

Pengkalan Web Bermaklumat Untuk Pmr (Bahasa Inggeris), Shuaid Ema Shuaida

Student Works (2000-2009)

Dunia sekarang sedang menuju ke era yang lebih digital di mana teknologi maklumat menjadi satu wadah yang penting terutamanya di dalam bidang pendidikan. Bidang pendidikan juga maju setapak ke hadapan dengan penggunaan pengajaran yang berasaskan multimedia dan CD-Rom. la termasuk dengan kewujudan laman web yang berasaskan grafik dan teks yang menarik. Oleh itu, projek yang bakal dibangunkan ini iaitu Pangkalan Web Bermaklumat untuk Pelajar Penilaian Menengah Rendah (PMR), khusus untuk mata pelajaran bahasa lnggeris juga memberi banyak kemudahan dan kebaikan kepada pelajar-pelajar dan guru-guru yang memerlukannya. Objektif utama projek ini ialah untuk membangunkan pangkalan web yang menarik, padat, teliti dan …


Pakej Bantuan Pembelajaran Bagi Kanak-Kanak, Rameli Norma Aug 2000

Pakej Bantuan Pembelajaran Bagi Kanak-Kanak, Rameli Norma

Student Works (2000-2009)

Pakej Bantuan Pembelajaran Bagi Kanak-kanak Tadika(PBPKT) ini adalah merupakan satu alat bantuan yang dibangunkan dengan menggunakan perisian Director 7.0. Ia boleh menjadi alat perantara kepada para guru dan ibubapa untuk mendidik kanak-kanak dalam bentuk yang lebih menarik kerana ianya mempunyai pelbagai daya tarikan seperti bunyi, suara, gambar, animasi, lagu dan video bagi memudahkan kanak-kanak mertlahami apa yang hendak disampaikan. Selain itu juga mereka boleh berinteraksi dengan pakej ini. PBPKT ini mempunyai empat modul utama yang meliputi subjek seperti huruf, nombor, bentuk dan warna, yang mana subjek-subjek ini merupakan silibus bagi peringkat pra-sekolah. Pakej ini juga akan mendekati kanak-kanak secara psikologi. …


Webwordpro Version 2.0 The Web-Based Word Processing System, Koon How Lin Aug 2000

Webwordpro Version 2.0 The Web-Based Word Processing System, Koon How Lin

Student Works (2000-2009)

Nowadays in this era of information technology computerized word processors have become a very common and essential need to everyone. From leisure to serious manner, it is used for typing letters, assignments, reports, paperwork and etc. It also enables people to keep data and manage it in a more secure and efficient way. With the current popularity and expansion of the Internet, Web-based applications become a new platform for the evolution of business system. Well, from this point, come the idea of providing the word processing system through Internet or online. WebWordPro 2.0, which is the upgraded version of Web …


Pakej Pembelajaran Rangkaian Komputer Dan Komunikasi Data (Rangkomdata), Jusoh Noorakmal Aug 2000

Pakej Pembelajaran Rangkaian Komputer Dan Komunikasi Data (Rangkomdata), Jusoh Noorakmal

Student Works (2000-2009)

Penggunaan perisian yang berbentuk CD atau web semakin mendapat perhatian dan sambutan terutamanya dikalangan pelajar. Namun begitu pakej pembelajaran terutamanya dalam Bahasa Melayu untuk pelajar lPT masih lagi berkurangan di pasaran Menyedari hakikat inilah ia mendorong saya untuk membangunkan pakej pembelajaran bermultimedia seperti ini. Berdasarkan kepada kajian yang dijalankan, sambutan dari kalangan pelajar adalah begitu menggalakkan. Projek yang dibangunkan ini, adalah bertajuk Pakej Pembelajaran Rangkaian Komputer dan Komunikasi Data atau panggilan ringkasnya Pakej RANGKOMDATA Bermultimedia. Perisian ini adalah diharapkan dapat rnembantu proses pembelajaran para pelajar jurusan sains komputer dan teknologi maklumat yang mengikuti kurus ini. Pakej RANGKOMDATA ini adalah satu …


Internet Marketing – Marketers’ Perception Of Ethical Issues, L.. Najjar, Keng Siau Aug 2000

Internet Marketing – Marketers’ Perception Of Ethical Issues, L.. Najjar, Keng Siau

Research Collection School Of Computing and Information Systems

Many businesses have been attracted to marketing on the Internet, but little attention has been given to the potential ethical issues regarding Internet marketing. Although some ethical behavior models have been proposed, relatively few have been empirically validated. This study's main objective is to assess the perception of ethical issues on Internet marketing among a sample of 150 marketing executives from a Midwest business community. Results and recommendations regarding ethical issues related to Internet marketing are discussed.


E-Business Curriculum In Action At The University Of Nebraska-Lincoln, Keng Siau, S. Davis Aug 2000

E-Business Curriculum In Action At The University Of Nebraska-Lincoln, Keng Siau, S. Davis

Research Collection School Of Computing and Information Systems

Offering e-business/e-commerce courses no longer provides competitive advantages. They are now a competitive necessity. Schools already offering the courses are continuously refining the curriculum to keep up with the innovations in the area. Schools without these courses are frantically trying to put one together. Irrespective of whether a school is a leader or a lagger, all schools face the same problem -- how to keep the ebusiness curriculum up-to-date and relevant to industry. This article looks at the e-business curriculum at the University of Nebraska-Lincoln. It presents our curriculum objectives and the lessons learned.


Telemip: Telecommunications-Enhanced Mobile Ip Architecture For Fast Intradomain Mobility, Subir Das, Archan Misra, Prathima Agrawal, Sajal K. Das Aug 2000

Telemip: Telecommunications-Enhanced Mobile Ip Architecture For Fast Intradomain Mobility, Subir Das, Archan Misra, Prathima Agrawal, Sajal K. Das

Research Collection School Of Computing and Information Systems

This article first surveys existing protocols for supporting IP mobility and then proposes an extension to the mobile IP architecture, called TeleMIP. Our architecture attempts to achieve smaller handoff latency by localizing the scope of most location update messages within an administrative domain or a geographical region. TeleMIP is intended for use in evolving third-generation wireless networks, and introduces a new logical entity, called the mobility agent, which provides a mobile node with a stable point of attachment in a foreign network. While the MA is functionally similar to conventional foreign agents, it is located at a higher level in …


An Inference Engine-Based Subscription Service, Kym J. Pohl, Jens G. Pohl Jul 2000

An Inference Engine-Based Subscription Service, Kym J. Pohl, Jens G. Pohl

Collaborative Agent Design (CAD) Research Center

A Distributed Network Architecture (DNA) forms the basis of many decision-support systems available today. Such architecture excels at providing an application environment rich in transparency, performance, and expandability (Gray and Lievano 1997). However, efforts at the Collaborative Agent Design (CAD) Research Center in San Luis Obispo, California have found that for this architecture to be successfully applied to agent-based, decision-support systems two additional ingredients must be present, namely a query service and a subscription service. These two mechanisms support the extensive collaboration inherent in agent-based, decision-support systems. Although primarily utilized as a means of agent-to-agent interaction these two services can …


Adapting To The Information Age, Jens G. Pohl Jul 2000

Adapting To The Information Age, Jens G. Pohl

Collaborative Agent Design (CAD) Research Center

This paper draws attention to the profound changes that human civilization is experiencing as it moves from an industrial environment into an information environment, in which unprecedented emphasis is placed on the knowledge and capabilities of the individual. A clear distinction is drawn between data and information in relationship to computer-based facilities, and the transition of data-processing to the higher levels of information and knowledge representation in quasi intelligent decision-support systems. It is argued that the cultivation of its human capital becomes a foundational requirement for the success of a knowledge-based organization. In such an organization traditional practices of hierarchical, …


Rescaling The Energy Function In Hopfield Networks, Tony R. Martinez, Xinchuan Zeng Jul 2000

Rescaling The Energy Function In Hopfield Networks, Tony R. Martinez, Xinchuan Zeng

Faculty Publications

In this paper we propose an approach that rescales the distance matrix of the energy function in the Hopfield network for solving optimization problems. We rescale the distance matrix by normalizing each row in the matrix and then adjusting the parameter for the distance term. This scheme has the capability of reducing the effects of clustering in data distributions, which is one of main reasons for the formation of invalid solutions. We evaluate this approach through a large number (20,000) simulations based on 200 randomly generated city distributions of the 10-city traveling salesman problem. The result shows that, compared to …


The Inefficiency Of Batch Training For Large Training Sets, Tony R. Martinez, D. Randall Wilson Jul 2000

The Inefficiency Of Batch Training For Large Training Sets, Tony R. Martinez, D. Randall Wilson

Faculty Publications

Multilayer perceptrons are often trained using error backpropagation (BP). BP training can be done in either a batch or continuous manner. Claims have frequently been made that batch training is faster and/or more "correct" than continuous training because it uses a better approximation of the true gradient for its weight updates. These claims are often supported by empirical evidence on very small data sets. These claims are untrue, however, for large training sets. This paper explains why batch training is much slower than continuous training for large training sets. Various levels of semi-batch training used on a 20,000-instance speech recognition …


Examples, Counterexamples, And Enumeration Results For Foldings And Unfoldings Between Polygons And Polytopes, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke Jul 2000

Examples, Counterexamples, And Enumeration Results For Foldings And Unfoldings Between Polygons And Polytopes, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke

Computer Science: Faculty Publications

We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration questions in both directions: Given a polygon, how many foldings are there? Given a polytope, how many unfoldings are there to simple polygons? Throughout we give special attention to convex polygons, and to regular polygons. We show that every convex polygon folds to an infinite number of distinct polytopes, but that their number of combinatorially distinct gluings is …


Dimensionality Reduction Using Genetic Algorithms, Michael L. Raymer, William F. Punch, Erik D. Goodman, Leslie A. Kuhn, Anil K. Jain Jul 2000

Dimensionality Reduction Using Genetic Algorithms, Michael L. Raymer, William F. Punch, Erik D. Goodman, Leslie A. Kuhn, Anil K. Jain

Kno.e.sis Publications

Pattern recognition generally requires that objects be described in terms of a set of measurable features. The selection and quality of the features representing each pattern affect the success of subsequent classification. Feature extraction is the process of deriving new features from original features to reduce the cost of feature measurement, increase classifier efficiency, and allow higher accuracy. Many feature extraction techniques involve linear transformations of the original pattern vectors to new vectors of lower dimensionality. While this is useful for data visualization and classification efficiency, it does not necessarily reduce the number of features to be measured since each …


A New Fixed-Point Theorem For Logic Programming Semantics, Anthony K. Seda, Pascal Hitzler Jul 2000

A New Fixed-Point Theorem For Logic Programming Semantics, Anthony K. Seda, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We present a new fixed-point theorem akin to the Banach contraction mapping theorem, but in the context of a novel notion of generalized metric space, and show how it can be applied to analyse the denotational semantics of certain logic programs. The theorem is obtained by generalizing a theorem of Priess-Crampe and Ribenboim, which grew out of applications within valuation theory, but is also inspired by a theorem of S.G. Matthews which grew out of applications to conventional programming language semantics. The class of programs to which we apply our theorem was defined previously by us in terms of operators …


Is Information Systems A Science? An Inquiry Into The Nature Of The Information Systems Discipline, Deepak Khazanchi, Bjørn Erik Munkvold Jul 2000

Is Information Systems A Science? An Inquiry Into The Nature Of The Information Systems Discipline, Deepak Khazanchi, Bjørn Erik Munkvold

Information Systems and Quantitative Analysis Faculty Publications

The Information Systems (IS) discipline is apparently undergoing an identity crisis. Academicians question the need for IS departments in colleges stating the absence of a core for the field and its integration within other business functions as a basis for its elimination. At the same time, many practitioners, as reflected in the US government's recent IT labor shortage report, continue to ignore IS as a distinct field of study. This article briefly outlines these and other challenges and argues that notwithstanding underlying philosophical differences, it can be concluded that IS is an emerging scientific discipline. This conclusion is reached through …


Traffic Scheduling And Link Sharing Mechanisms For Controlled Load Service, Yun Choong Chin Jul 2000

Traffic Scheduling And Link Sharing Mechanisms For Controlled Load Service, Yun Choong Chin

Student Works (2000-2009)

The project studies and develops a simulator based on the link-sharing and traffic scheduling mechanism for Controlled Load service. The simulation adopts some of the features of the Class Based Queueing. The main factors that determine whether a packet scheduling algorithm is able to support integrated services or differentiated services on Internet is the ability to provide bandwidth guarantee. It is important to provide guarantee for minimum bandwidth when there are enough demands to ensure competing data flows do· not degrade each others' performance. The objective of this project is to observe the performance of the link-sharing and traffic scheduling …


Buckets: Smart Objects For Digital Libraries, Michael L. Nelson Jul 2000

Buckets: Smart Objects For Digital Libraries, Michael L. Nelson

Computer Science Theses & Dissertations

Discussion of digital libraries (DLs) is often dominated by the merits of various archives, repositories, search engines, search interfaces and database systems. While these technologies are necessary for information management, information content and information retrieval systems should progress on independent paths and each should make limited assumptions about the status or capabilities of the other. Information content is more important than the systems used for its storage and retrieval. Digital information should have the same long-term survivability prospects as traditional hardcopy information and should not be impacted by evolving search engine technologies or vendor vagaries in database management systems.

Digital …


Routing Optimization Through Computer-Aided Simulation, Madhusudhan Akundi Jul 2000

Routing Optimization Through Computer-Aided Simulation, Madhusudhan Akundi

Electrical & Computer Engineering Theses & Dissertations

Routing has always been a challenging field, and the various techniques of mathematics and operations research have been developed. For commercial organizations, routing has begun to receive extensive attention because of the savings gained in terms of time, money, personnel, and the transportation fleet by developing optimized routing networks. Until recently, it was difficult to develop optimized networks due to the computational difficulties of the problem. However, with the advancement in computer technology and processing speeds, it has become possible to simulate a large number of routing scenarios and determine optimal solutions for a given set of constraints. Not only …


Almost Block Diagonal Linear Systems: Sequential And Parallel Solution Techniques, And Applications, P. Amodio, J.R. Cash, G. Roussos, R.W. Wright, G. Fairweather, I. Gladwell, G.L. Kraut, M. Paprzycki Jul 2000

Almost Block Diagonal Linear Systems: Sequential And Parallel Solution Techniques, And Applications, P. Amodio, J.R. Cash, G. Roussos, R.W. Wright, G. Fairweather, I. Gladwell, G.L. Kraut, M. Paprzycki

Faculty Publications

Almost block diagonal (ABD) linear systems arise in a variety of contexts, specifically in numerical methods for two-point boundary value problems for ordinary differential equations and in related partial differential equation problems. The stable, efficient sequential solution of ABDs has received much attention over the last fifteen years and the parallel solution more recently. We survey the fields of application with emphasis on how ABDs and bordered ABDs (BABDs) arise. We outline most known direct solution techniques, both sequential and parallel, and discuss the comparative efficiency of the parallel methods. Finally, we examine parallel iterative methods for solving BABD systems. …


Roughening, Deroughening, And Nonuniversal Scaling Of The Interface Width In Electrophoretic Deposition Of Polymer Chains, Frank W. Bentrem, Ras B. Pandey, Fereydoon Family Jul 2000

Roughening, Deroughening, And Nonuniversal Scaling Of The Interface Width In Electrophoretic Deposition Of Polymer Chains, Frank W. Bentrem, Ras B. Pandey, Fereydoon Family

Faculty Publications

Growth and roughness of the interface of deposited polymer chains driven by a field onto an impenetrable adsorbing surface are studied by computer simulations in (2 + 1) dimensions. The evolution of the interface width W shows a crossover from short-time growth described by the exponent beta(1) to a long-time growth with exponent beta(2) (>beta(1)) Tne saturated width increases, i.e., the interface roughens, with the molecular weight L-c, but the roughness exponent alpha (from W-s similar to L-alpha) becomes negative in contrast to models for particle deposition; cr depends on the chain length-a nonuniversal scaling with the substrate length …


Design Of Adaptive Sliding Mode Fuzzy Control For Robot Manipulator Based On Extended Kalman Filter, Abdelrahman Aledhaibi Jul 2000

Design Of Adaptive Sliding Mode Fuzzy Control For Robot Manipulator Based On Extended Kalman Filter, Abdelrahman Aledhaibi

Mechanical & Aerospace Engineering Theses & Dissertations

In this work, a new adaptive motion control scheme for robust performance control of robot manipulators is presented. The proposed scheme is designed by combining the fuzzy logic control with the sliding mode control based on extended Kalman filter. Fuzzy logic controllers have been used successfully in many applications and were shown to be superior to the classical controllers for some nonlinear systems. Sliding mode control is a powerful approach for controlling nonlinear and uncertain systems. It is a robust control method and can be applied in the presence of model uncertainties and parameter disturbances, provided that the bounds of …


A Flowchart Structure For Modification Of A Modsim Process Model, Murali K. Adatrao Jul 2000

A Flowchart Structure For Modification Of A Modsim Process Model, Murali K. Adatrao

Electrical & Computer Engineering Theses & Dissertations

There are many software processes and software development models that support the development of a software model prior to implementation. However, more often than not, these practices are not followed resulting in a lack of documentation of the intended functionality of the software. As a result, software often becomes a black box for later developers. Even a simple bug fix can turn into an exhaustive task for the developers, as they must attempt to infer the intended system behavior. New designers cannot make any changes to the software or extend the software behavior, as the underlying model within the software …


Path Planning For Planar Articulated Robots Using Configuration Spaces And Compliant Motion, Elisha Sacks Jul 2000

Path Planning For Planar Articulated Robots Using Configuration Spaces And Compliant Motion, Elisha Sacks

Department of Computer Science Technical Reports

No abstract provided.


Trading Risk In Mobile-Agent Computational Markets, Jonathan Bredin, David Kotz, Daniela Rus Jul 2000

Trading Risk In Mobile-Agent Computational Markets, Jonathan Bredin, David Kotz, Daniela Rus

Dartmouth Scholarship

Mobile-agent systems allow user programs to autonomously relocate from one host site to another. This autonomy provides a powerful, flexible architecture on which to build distributed applications. The asynchronous, decentralized nature of mobile-agent systems makes them flexible, but also hinders their deployment. We argue that a market-based approach where agents buy computational resources from their hosts solves many problems faced by mobile-agent systems. \par In our earlier work, we propose a policy for allocating general computational priority among agents posed as a competitive game for which we derive a unique computable Nash equilibrium. Here we improve on our earlier approach …


Cryptanalysis Of The M-Permutation Protection Schemes, Hongjun Wu, Feng Bao, Dingfeng Ye, Robert H. Deng Jul 2000

Cryptanalysis Of The M-Permutation Protection Schemes, Hongjun Wu, Feng Bao, Dingfeng Ye, Robert H. Deng

Research Collection School Of Computing and Information Systems

Anderson and Kuhn have proposed the EEPROM modification attack to recover the secret key stored in the EEPROM. At ACISP ’98, Fung and Gray proposed an m-permutation protection scheme against the EEPROM modification attack. At ACISP ’99, Fung and Gray pointed out that in their original scheme, a secret key with too small or too large Hamming weight could be recovered easily. Then they proposed a revised m- permutation protection scheme and claimed that their revised scheme does not leak any information of the secret key. In this paper, we break completely both the original and the revised …


The Complexity Of Planning With Partially-Observable Markov Decision Processes, Martin Mundhenk Jun 2000

The Complexity Of Planning With Partially-Observable Markov Decision Processes, Martin Mundhenk

Computer Science Technical Reports

This work surveys results on the complexity of planning under uncertainty. The planning model considered is the partially-observable Markov decision process. The general planning problems are, given such a process, (a) to calculate its performance under a given control policy, (b) to find an optimal or approximate optimal control policy, and (c) to decide whether a good policy exists. The complexity of this and related problems depend on a variety of factors, including the observability of the process state, the compactness of the process representation, the type of policy, or even the number of actions relative to the number of …


Personal Radio, John C. Artz Jr Jun 2000

Personal Radio, John C. Artz Jr

Dartmouth College Undergraduate Theses

With the development of new technologies that allow the broadcast of digital data over radio signals, there are many possibilities for improving upon the traditional radio station model for content delivery. The idea of Personal Radio is a system that tailors content to meet the needs of each individual. Using Global Positioning System (GPS) technology to play location specific content, the listening history to play content an appropriate number of times, and user feedback to learn personal preferences, the Personal Radio provides the listener with the content that is the most useful/interesting to them. This paper will examine the general …


An Economic Cpu-Time Market For D'Agents, Ezra E.K. Cooper Jun 2000

An Economic Cpu-Time Market For D'Agents, Ezra E.K. Cooper

Dartmouth College Undergraduate Theses

A usable and efficient resource-management system has been created for use with D'Agents. The software dynamically negotiates a price rate for CPU time, using the competitive bids of mobile agents that offer currency in return for fast computation. The system allows mobile agents to plan their expenditures across many hosts while minimizing the time needed for their tasks. The ability to price CPU time opens the door for service owners to be compensated for the computation consumed by agents and provides an incentive for servers to allow anonymous agents. We discuss the theoretical background which makes a CPU market system …