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

OS and Networks Commons

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year

Articles 301 - 322 of 322

Full-Text Articles in OS and Networks

Anonymous And Authenticated Key Exchange For Roaming Networks, Guomin Yang, Duncan S. Wong, Xiaotie Deng Sep 2007

Anonymous And Authenticated Key Exchange For Roaming Networks, Guomin Yang, Duncan S. Wong, Xiaotie Deng

Research Collection School Of Computing and Information Systems

User privacy is a notable security issue in wireless communications. It concerns about user identities from being exposed and user movements and whereabouts from being tracked. The concern of user privacy is particularly signified in systems which support roaming when users are able to hop across networks administered by different operators. In this paper, we propose a novel construction approach of anonymous and authenticated key exchange protocols for a roaming user and a visiting server to establish a random session key in such a way that the visiting server authenticates the user's home server without knowing exactly who the user …


Percentage-Based Hybrid Pattern Training With Neural Network Specific Cross Over, Sheng-Uei Guan, Kiruthika Ramanathan Mar 2007

Percentage-Based Hybrid Pattern Training With Neural Network Specific Cross Over, Sheng-Uei Guan, Kiruthika Ramanathan

Research Collection School Of Computing and Information Systems

In this paper, a new weight-setting method is proposed to improve the training time and generalization accuracy of feed-forward neural networks. This method introduces a percentage-based hybrid pattern training (PHP) scheme and aims to provide a solution to the problem dependency of other Genetic Algorithm (GA)-based Neural Network weight-setting methods. A neural network is trained using a neural network specific GA until a certain percentage of the training patterns is learned. The weights thus obtained are used as the initial weights for backpropagation (BP) training, which is then applied to complete the network training. Further improvement to the method was …


Direct Code Access In Self-Organizing Neural Networks For Reinforcement Learning, Ah-Hwee Tan Jan 2007

Direct Code Access In Self-Organizing Neural Networks For Reinforcement Learning, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

TD-FALCON is a self-organizing neural network that incorporates Temporal Difference (TD) methods for reinforcement learning. Despite the advantages of fast and stable learning, TD-FALCON still relies on an iterative process to evaluate each available action in a decision cycle. To remove this deficiency, this paper presents a direct code access procedure whereby TD-FALCON conducts instantaneous searches for cognitive nodes that match with the current states and at the same time provide maximal reward values. Our comparative experiments show that TD-FALCON with direct code access produces comparable performance with the original TD-FALCON while improving significantly in computation efficiency and network complexity.


Multi-Learner Based Recursive Supervised Training, Laxmi R. Iyer, Kiruthika Ramanathan, Sheng-Uei Guan Sep 2006

Multi-Learner Based Recursive Supervised Training, Laxmi R. Iyer, Kiruthika Ramanathan, Sheng-Uei Guan

Research Collection School Of Computing and Information Systems

In this paper, we propose the multi-learner based recursive supervised training (MLRT) algorithm, which uses the existing framework of recursive task decomposition, by training the entire dataset, picking out the best learnt patterns, and then repeating the process with the remaining patterns. Instead of having a single learner to classify all datasets during each recursion, an appropriate learner is chosen from a set of three learners, based on the subset of data being trained, thereby avoiding the time overhead associated with the genetic algorithm learner utilized in previous approaches. In this way MLRT seeks to identify the inherent characteristics of …


Anonymous Dos-Resistant Access Control Protocol Using Passwords For Wireless Networks, Zhiguo Wan, Robert H. Deng, Feng Bao, Akkihebbal L. Ananda Nov 2005

Anonymous Dos-Resistant Access Control Protocol Using Passwords For Wireless Networks, Zhiguo Wan, Robert H. Deng, Feng Bao, Akkihebbal L. Ananda

Research Collection School Of Computing and Information Systems

Wireless networks have gained overwhelming popularity over their wired counterpart due to their great flexibility and convenience, but access control of wireless networks has been a serious problem because of the open medium. Passwords remain the most popular way for access control as well as authentication and key exchange. But existing password-based access control protocols are not satisfactory in that they do not provide DoS-resistance or anonymity. In this paper we analyze the weaknesses of an access control protocol using passwords for wireless networks in IEEE LCN 2001, and propose a different access control protocol using passwords for wireless networks. …


Security Analysis And Improvement Of Return Routability Protocol, Ying Qiu, Jianying Zhou, Robert H. Deng Sep 2005

Security Analysis And Improvement Of Return Routability Protocol, Ying Qiu, Jianying Zhou, Robert H. Deng

Research Collection School Of Computing and Information Systems

Mobile communication plays a more and more important role in computer networks. How to authenticate a new connecting address belonging to a said mobile node is one of the key issues in mobile networks. This paper analyzes the Return Routability (RR) protocol and proposes an improved security solution for the RR protocol without changing its architecture. With the improvement, three types of redirect attacks can be prevented.


Predictive Neural Networks For Gene Expression Data Analysis, Ah-Hwee Tan, Hong Pan Apr 2005

Predictive Neural Networks For Gene Expression Data Analysis, Ah-Hwee Tan, Hong Pan

Research Collection School Of Computing and Information Systems

Gene expression data generated by DNA microarray experiments have provided a vast resource for medical diagnosis and disease understanding. Most prior work in analyzing gene expression data, however, focuses on predictive performance but not so much on deriving human understandable knowledge. This paper presents a systematic approach for learning and extracting rule-based knowledge from gene expression data. A class of predictive self-organizing networks known as Adaptive Resonance Associative Map (ARAM) is used for modelling gene expression data, whose learned knowledge can be transformed into a set of symbolic IF-THEN rules for interpretation. For dimensionality reduction, we illustrate how the system …


The Value Of Mobile Applications: A Utility Company Study, Fiona Fui-Hoon Nah, Keng Siau, Hong Sheng Feb 2005

The Value Of Mobile Applications: A Utility Company Study, Fiona Fui-Hoon Nah, Keng Siau, Hong Sheng

Research Collection School Of Computing and Information Systems

The value proposition of mobile applications i.e. the net value of the benefits and costs associated with the adoption and adaptation of mobile applications is discussed. A means-ends network that depicts the fundamental relationships among the objectives such as efficiency, effectiveness, customer satisfaction, security, cost, and employee acceptance, was developed. The network is useful to researchers as it highlights the issues, concerns, and values of mobile applications. The network help the managers and practitioners to achieve their companies' objectives of implementing mobile and wireless applications.


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 …


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.


Capacitated Network Revenue Management Through Shadow Pricing, Mustapha Bouhtou, Madiagne Diallo, Laura Wynter Sep 2003

Capacitated Network Revenue Management Through Shadow Pricing, Mustapha Bouhtou, Madiagne Diallo, Laura Wynter

Research Collection School Of Computing and Information Systems

In this paper, we analyze a method that links Lagrange multipliers from a resource allocation problem to the problem of revenue or profit maximization. This technique, first proposed in the transportation science literature by [7] has important implications for telecommunication network pricing. Indeed, the framework provides a generalization of telecommunication resource allocation/shadow price-based schemes such as those of [6] and [9], in that it permits the optimization of the shadow prices themselves, through a computationally simple procedure. We analyze the extent to which revenue can be maximized on a network that uses shadow-price-based prices, and how to deal with cases …


Strategyproof Mechanisms For Ad Hoc Network Formation, C. Jason Woodard, David C. Parkes Jun 2003

Strategyproof Mechanisms For Ad Hoc Network Formation, C. Jason Woodard, David C. Parkes

Research Collection School Of Computing and Information Systems

Agents in a peer-to-peer system typically have incentives to influence its network structure, either to reduce their costs or increase their ability to capture value. The problem is compounded when agents can join and leave the system dynamically. This paper proposes three economic mechanisms that offset the incentives for strategic behavior and facilitate the formation of networks with desirable global properties.


On Quantitative Evaluation Of Clustering Systems, Ji He, Ah-Hwee Tan, Chew-Lim Tan, Sam-Yuan Sung Jan 2003

On Quantitative Evaluation Of Clustering Systems, Ji He, Ah-Hwee Tan, Chew-Lim Tan, Sam-Yuan Sung

Research Collection School Of Computing and Information Systems

Clustering refers to the task of partitioning unlabelled data into meaningful groups (clusters). It is a useful approach in data mining processes for identifying hidden patterns and revealing underlying knowledge from large data collections. The application areas of clustering, to name a few, include image segmentation, information retrieval, document classification, associate rule mining, web usage tracking, and transaction analysis.


Personalized Information Management For Web Intelligence, Ah-Hwee Tan May 2002

Personalized Information Management For Web Intelligence, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Web intelligence can be defined as the process of scanning and tracking information on the World Wide Web so as to gain competitive advantages. This paper describes a system known as Flexible Organizer for Competitive Intelligence (FOCI) that transforms raw URLs returned by internet search engines into personalized information portfolios. FOCI builds information portfolios by gathering and organizing online information according to a user's needs and preferences. Through a novel method called User-Configurable Clustering, a user can personalize his/her portfolios in terms of the content as well as the information structure. The personalized portfolios can then be used to track …


Predictive Self-Organizing Networks For Text Categorization, Ah-Hwee Tan Apr 2001

Predictive Self-Organizing Networks For Text Categorization, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

This paper introduces a class of predictive self-organizing neural networks known as Adaptive Resonance Associative Map (ARAM) for classification of free-text documents. Whereas most sta- tistical approaches to text categorization derive classification knowledge based on training examples alone, ARAM performs supervised learn- ing and integrates user-defined classification knowledge in the form of IF-THEN rules. Through our experiments on the Reuters-21578 news database, we showed that ARAM performed reasonably well in mining categorization knowledge from sparse and high dimensional document feature space. In addition, ARAM predictive accuracy and learning efficiency can be improved by incorporating a set of rules derived from …


Supervised Adaptive Resonance Theory And Rules, Ah-Hwee Tan Jan 2000

Supervised Adaptive Resonance Theory And Rules, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Supervised Adaptive Resonance Theory is a family of neural networks that performs incremental supervised learning of recognition categories (pattern classes) and multidimensional maps of both binary and analog patterns. This chapter highlights that the supervised ART architecture is compatible with IF-THEN rule-based symbolic representation. Specifi­cally, the knowledge learned by a supervised ART system can be readily translated into rules for interpretation. Similarly, a priori domain knowl­edge in the form of IF-THEN rules can be converted into a supervised ART architecture. Not only does initializing networks with prior knowl­edge improve predictive accuracy and learning efficiency, the inserted symbolic knowledge can also …


Internet, World Wide Web, And Creativity, Keng Siau Sep 1999

Internet, World Wide Web, And Creativity, Keng Siau

Research Collection School Of Computing and Information Systems

The growth of the Internet has been the most astonishing technological and social phenomenon of the last decade of this century. In 1990 only a few academics had heard of it; now, more than 50 million people use it. By the turn of the century, that figure could be 100–200 million. So far, the network's only constant has been that the number of new users has doubled almost every 12–18 months. Most organizations have or will soon have Internet access. The popularity of Internet provides a tremendous opportunity for individuals and organizations to explore its features and services for electronic …


Cascade Artmap: Integrating Neural Computation And Symbolic Knowledge Processing, Ah-Hwee Tan Mar 1997

Cascade Artmap: Integrating Neural Computation And Symbolic Knowledge Processing, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

This paper introduces a hybrid system termed cascade adaptive resonance theory mapping (ARTMAP) that incorporates symbolic knowledge into neural-network learning and recognition. Cascade ARTMAP, a generalization of fuzzy ARTMAP, represents intermediate attributes and rule cascades of rule-based knowledge explicitly and performs multistep inferencing. A rule insertion algorithm translates if-then symbolic rules into cascade ARTMAP architecture. Besides that initializing networks with prior knowledge can improve predictive accuracy and learning efficiency, the inserted symbolic knowledge can be refined and enhanced by the cascade ARTMAP learning algorithm. By preserving symbolic rule form during learning, the rules extracted from cascade ARTMAP can be compared …


Inductive Neural Logic Network And The Scm Algorithm, Ah-Hwee Tan, Loo-Nin Teow Feb 1997

Inductive Neural Logic Network And The Scm Algorithm, Ah-Hwee Tan, Loo-Nin Teow

Research Collection School Of Computing and Information Systems

Neural Logic Network (NLN) is a class of neural network models that performs both pattern processing and logical inferencing. This article presents a procedure for NLN to learn multi-dimensional mapping of both binary and analog data. The procedure, known as the Supervised Clustering and Matching (SCM) algorithm, provides a means of inferring inductive knowledge from databases. In contrast to gradient descent error correction methods, pattern mapping is learned by an inductive NLN using fast and incremental clustering of input and output patterns. In addition, learning/encoding only takes place when both the input and output match criteria are satisfied in a …


Concept Hierarchy Memory Model: A Neural Architecture For Conceptual Knowledge Representation, Learning, And Commonsense Reasoning, Ah-Hwee Tan, Hui-Shin Vivien Soon Jul 1996

Concept Hierarchy Memory Model: A Neural Architecture For Conceptual Knowledge Representation, Learning, And Commonsense Reasoning, Ah-Hwee Tan, Hui-Shin Vivien Soon

Research Collection School Of Computing and Information Systems

This article introduces a neural network based cognitive architecture termed Concept Hierarchy Memory Model (CHMM) for conceptual knowledge representation and commonsense reasoning. CHMM is composed of two subnetworks: a Concept Formation Network (CFN), that acquires concepts based on their sensory representations; and a Concept Hierarchy Network (CHN), that encodes hierarchical relationships between concepts. Based on Adaptive Resonance Associative Map (ARAM), a supervised Adaptive Resonance Theory (ART) model, CHMM provides a systematic treatment for concept formation and organization of a concept hierarchy. Specifically, a concept can be learned by sampling activities across multiple sensory fields. By chunking relations between concepts as …


Adaptive Resonance Associative Map, Ah-Hwee Tan Jan 1995

Adaptive Resonance Associative Map, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

This article introduces a neural architecture termed Adaptive Resonance Associative Map (ARAM) that extends unsupervised Adaptive Resonance Theory (ART) systems for rapid, yet stable, heteroassociative learning. ARAM can be visualized as two overlapping ART networks sharing a single category field. Although ARAM is simpler in architecture than another class of supervised ART models known as ARTMAP, it produces classification performance equivalent to that of ARTMAP. As ARAM network structure and operations are symmetrical, associative recall can be performed in both directions. With maximal vigilance settings, ARAM encodes pattern pairs explicitly as cognitive chunks and thus guarantees perfect storage and recall …


Fuzzy Neural Logic Network And Its Learning Algorithms, Fiona Fui-Hoon Nah, Nah Fiona Jan 1991

Fuzzy Neural Logic Network And Its Learning Algorithms, Fiona Fui-Hoon Nah, Nah Fiona

Research Collection School Of Computing and Information Systems

The paper introduces the basic features of fuzzy neural logic network. Each fuzzy neural logic network model is trained from a set of knowledge in the form of examples using one of the three learning algorithms introduced. These three learning algorithms are the delta rule controlled learning algorithm and two mathematical construction algorithms, namely, the local learning method and the global learning method. Once the fuzzy neural logic network model is constructed, it is ready to accept any unknown input from the user. With a low percentage of mismatched features, output solution can be obtained.