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

Databases and Information Systems Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year

Articles 2041 - 2070 of 3441

Full-Text Articles in Databases and Information Systems

Multimodal Learning With Deep Boltzmann Machine For Emotion Prediction In User Generated Videos, Lei Pang, Chong-Wah Ngo Jun 2015

Multimodal Learning With Deep Boltzmann Machine For Emotion Prediction In User Generated Videos, Lei Pang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Detecting emotions from user-generated videos, such as“anger” and “sadness”, has attracted widespread interest recently. The problem is challenging as effectively representing video data with multi-view information (e.g., audio, video or text) is not trivial. In contrast to the existing works that extract features from each modality (view) separately followed by early or late fusion, we propose to learn a joint density model over the space of multi-modal inputs (including visual, auditory and textual modalities) with Deep Boltzmann Machine (DBM). The model is trained directly on the user-generated Web videos without any labeling effort. More importantly, the deep architecture enlightens the …


Author Topic Model-Based Collaborative Filtering For Personalized Poi Recommendations, Shuhui Jiang, Xueming Qian, Jialie Shen, Yun Fu, Tao Mei Jun 2015

Author Topic Model-Based Collaborative Filtering For Personalized Poi Recommendations, Shuhui Jiang, Xueming Qian, Jialie Shen, Yun Fu, Tao Mei

Research Collection School Of Computing and Information Systems

From social media has emerged continuous needs for automatic travel recommendations. Collaborative filtering (CF) is the most well-known approach. However, existing approaches generally suffer from various weaknesses. For example, sparsity can significantly degrade the performance of traditional CF. If a user only visits very few locations, accurate similar user identification becomes very challenging due to lack of sufficient information for effective inference. Moreover, existing recommendation approaches often ignore rich user information like textual descriptions of photos which can reflect users' travel preferences. The topic model (TM) method is an effective way to solve the "sparsity problem," but is still far …


Method For Matching Probabilistic Encrypted Data, Hwee Hwa Pang, Xuhua Ding Jun 2015

Method For Matching Probabilistic Encrypted Data, Hwee Hwa Pang, Xuhua Ding

Research Collection School Of Computing and Information Systems

Determining if a first encrypted data of a first data value is equal to a second encrypted data of a second data value. Comprising: a first cyclic group; a second cyclic group including a first element. Applying an operation to the first cyclic group to map its elements to an element in the second cyclic group. Randomly selecting a second element from the first cyclic group; producing the first encrypted data by mapping the second element and the first data value into one or more elements of the first cyclic group. Randomly selecting a third element from the first cyclic …


Projection Metric Learning On Grassmann Manifold With Application To Video Based Face Recognition, Zhiwu Huang, R. Wang, S. Shan, X. Chen Jun 2015

Projection Metric Learning On Grassmann Manifold With Application To Video Based Face Recognition, Zhiwu Huang, R. Wang, S. Shan, X. Chen

Research Collection School Of Computing and Information Systems

In video based face recognition, great success has been made by representing videos as linear subspaces, which typically lie in a special type of non-Euclidean space known as Grassmann manifold. To leverage the kernel-based methods developed for Euclidean space, several recent methods have been proposed to embed the Grassmann manifold into a high dimensional Hilbert space by exploiting the well established Project Metric, which can approximate the Riemannian geometry of Grassmann manifold. Nevertheless, they inevitably introduce the drawbacks from traditional kernel-based methods such as implicit map and high computational cost to the Grassmann manifold. To overcome such limitations, we propose …


Emif: Towards A Scalable And Effective Indexing Framework For Large Scale Music Retrieval, Jialie Shen, Tao Mei, Dacheng Tao, Xuelong Li, Yong Rui Jun 2015

Emif: Towards A Scalable And Effective Indexing Framework For Large Scale Music Retrieval, Jialie Shen, Tao Mei, Dacheng Tao, Xuelong Li, Yong Rui

Research Collection School Of Computing and Information Systems

This article presents a novel indexing framework called EMIF (Effective Music Indexing Framework) to facilitate scalable and accurate content based music retrieval. EMIF system architecture is designed based on a "classification-and-indexing" principle and consists of two main functionality layers: 1) a novel semantic-sensitive classification to identify input music's category and 2) multiple indexing structures - one local indexing structure corresponds to one semantic category. EMIF's layered architecture not only enables superior search accuracy but also reduces query response time significantly. To evaluate the system, a set of comprehensive experimental studies have been carried out using large test collection and EMIF …


Dynamic Redeployment To Counter Congestion Or Starvation In Vehicle Sharing Systems, Supriyo Ghosh, Pradeep Varakantham, Yossiri Adulyasak, Patrick Jaillet Jun 2015

Dynamic Redeployment To Counter Congestion Or Starvation In Vehicle Sharing Systems, Supriyo Ghosh, Pradeep Varakantham, Yossiri Adulyasak, Patrick Jaillet

Research Collection School Of Computing and Information Systems

Extensive usage of private vehicles has led to increased traffic congestion, carbon emissions, and usage of non-renewable resources. These concerns have led to the wide adoption of vehicle sharing (ex: bike sharing, car sharing) systems in many cities of the world. In vehicle-sharing systems, base stations (ex: docking stations for bikes) are strategically placed throughout a city and each of the base stations contain a pre-determined number of vehicles at the beginning of each day. Due to the stochastic and individualistic movement of customers,there is typically either congestion (more than required)or starvation (fewer than required) of vehicles at certain base …


The Role Of Intermediary In Sustainable Lending: An Economic Analysis Of Crowdfunding Platform, Ling Ge, Zhiling Guo Jun 2015

The Role Of Intermediary In Sustainable Lending: An Economic Analysis Of Crowdfunding Platform, Ling Ge, Zhiling Guo

Research Collection School Of Computing and Information Systems

Is the interest-free crowdfunding platform a promising alternative to the non-zero interest platform? This study investigates the lenders and borrowers’ incentives and choices between an indirect, non-zero interest rate platform intermediated by a field partner and a direct-lending, interest-free platform. We model the field partner as a profit maximizer that filters qualified borrowers to enable the lenders’ capital to be better utilized on the crowdfunding platform. We show that, under certain conditions, both the borrowers and lenders are better off from the existence of the field partner. The existence of field partner is necessary to effectively segment the market and …


Keeping Pace With Criminals: Designing Patrol Allocation Against Adaptive Opportunistic Criminals, Chao Zhang, Arunesh Sinha, Milind Tambe May 2015

Keeping Pace With Criminals: Designing Patrol Allocation Against Adaptive Opportunistic Criminals, Chao Zhang, Arunesh Sinha, Milind Tambe

Research Collection School Of Computing and Information Systems

Police patrols are used ubiquitously to deter crimes in urban areas. A distinctive feature of urban crimes is that criminals react opportunistically to patrol officers' assignments. Compared to strategic attackers (such as terrorists) with a well-laid out plan, opportunistic criminals are less strategic in planning attacks and more flexible in executing them. In this paper, our goal is to recommend optimal police patrolling strategy against such opportunistic criminals. We first build a game-theoretic model that captures the interaction between officers and opportunistic criminals. However, while different models of adversary behavior have been proposed, their exact form remains uncertain. Rather than …


Self-Organizing Neural Networks Integrating Domain Knowledge And Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Jacek M. Zurada May 2015

Self-Organizing Neural Networks Integrating Domain Knowledge And Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Jacek M. Zurada

Research Collection School Of Computing and Information Systems

The use of domain knowledge in learning systems is expected to improve learning efficiency and reduce model complexity. However, due to the incompatibility with knowledge structure of the learning systems and real-time exploratory nature of reinforcement learning (RL), domain knowledge cannot be inserted directly. In this paper, we show how self-organizing neural networks designed for online and incremental adaptation can integrate domain knowledge and RL. Specifically, symbol-based domain knowledge is translated into numeric patterns before inserting into the self-organizing neural networks. To ensure effective use of domain knowledge, we present an analysis of how the inserted knowledge is used by …


Discovering The Rise And Fall Of Software Engineering Ideas From Scholarly Publication Data, Subhajit Datta, Santonu Sarkar, Sajeev A. S. M., Nishant Kumar May 2015

Discovering The Rise And Fall Of Software Engineering Ideas From Scholarly Publication Data, Subhajit Datta, Santonu Sarkar, Sajeev A. S. M., Nishant Kumar

Research Collection School Of Computing and Information Systems

For researchers and practitioners of a relatively young discipline like software engineering, an enduring concern is to identify the acorns that will grow into oaks -- ideas remaining most current in the long run. Additionally, it is interesting to know how the ideas have risen in importance, and fallen, perhaps to rise again. We analyzed a corpus of 19,000+ papers written by 21,000+ authors across 16 software engineering publication venues from 1975 to 2010, to empirically determine the half-life of software engineering research topics. We adapted existing measures of half-life as well as defined a specific measure based on publication …


Moving Average Reversion Strategy For On-Line Portfolio Selection, Bin Li, Steven C. H. Hoi, Doyen Sahoo, Zhi-Yong Liu May 2015

Moving Average Reversion Strategy For On-Line Portfolio Selection, Bin Li, Steven C. H. Hoi, Doyen Sahoo, Zhi-Yong Liu

Research Collection School Of Computing and Information Systems

On-line portfolio selection, a fundamental problem in computational finance, has attracted increasing interest from artificial intelligence and machine learning communities in recent years. Empirical evidence shows that stock's high and low prices are temporary and stock prices are likely to follow the mean reversion phenomenon. While existing mean reversion strategies are shown to achieve good empirical performance on many real datasets, they often make the single-period mean reversion assumption, which is not always satisfied, leading to poor performance in certain real datasets. To overcome this limitation, this article proposes a multiple-period mean reversion, or so-called "Moving Average Reversion" (MAR), and …


Efficient Reverse Top-K Boolean Spatial Keyword Queries On Road Networks, Yunjun Gao, Xu Qin, Baihua Zheng, Gang Chen May 2015

Efficient Reverse Top-K Boolean Spatial Keyword Queries On Road Networks, Yunjun Gao, Xu Qin, Baihua Zheng, Gang Chen

Research Collection School Of Computing and Information Systems

Reverse k nearest neighbor (RkNN) queries have a broad application base such as decision support, profile-based marketing, and resource allocation. Previous work on RkNN search does not take textual information into consideration or limits to the Euclidean space. In the real world, however, most spatial objects are associated with textual information and lie on road networks. In this paper, we introduce a new type of queries, namely, reverse top-k Boolean spatial keyword (RkBSK) retrieval, which assumes objects are on the road network and considers both spatial and textual information. Given a data set P on a road network and a …


A Nested Recursive Logit Model For Route Choice Analysis, Tien Mai, Mogens Fosgerau, Emma Frejinger May 2015

A Nested Recursive Logit Model For Route Choice Analysis, Tien Mai, Mogens Fosgerau, Emma Frejinger

Research Collection School Of Computing and Information Systems

We propose a route choice model that relaxes the independence from irrelevant alternatives property of the logit model by allowing scale parameters to be link specific. Similar to the recursive logit (RL) model proposed by Fosgerau et al. (2013), the choice of path is modeled as a sequence of link choices and the model does not require any sampling of choice sets. Furthermore, the model can be consistently estimated and efficiently used for prediction.A key challenge lies in the computation of the value functions, i.e. the expected maximum utility from any position in the network to a destination. The value …


Mining Patterns Of Unsatisfiable Constraints To Detect Infeasible Paths, Sun Ding, Hee Beng Kuan Tan, Lwin Khin Shar May 2015

Mining Patterns Of Unsatisfiable Constraints To Detect Infeasible Paths, Sun Ding, Hee Beng Kuan Tan, Lwin Khin Shar

Research Collection School Of Computing and Information Systems

Detection of infeasible paths is required in many areas including test coverage analysis, test case generation, security vulnerability analysis, etc. Existing approaches typically use static analysis coupled with symbolic evaluation, heuristics, or path-pattern analysis. This paper is related to these approaches but with a different objective. It is to analyze code of real systems to build patterns of unsatisfiable constraints in infeasible paths. The resulting patterns can be used to detect infeasible paths without the use of constraint solver and evaluation of function calls involved, thus improving scalability. The patterns can be built gradually. Evaluation of the proposed approach shows …


Map: A Computational Model For Adaptive Persuasion, Yilin Kang, Ah-Hwee Tan May 2015

Map: A Computational Model For Adaptive Persuasion, Yilin Kang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

While a variety of persuasion agents have been created and applied in different domains such as marketing, military training and health industry, there is a lack of a model which provides a unified framework for different persuasion strategies. Specifically, persuasion is not adaptable to the individuals’ personal states in different situations. Grounded in the Elaboration Likelihood Model (ELM), this paper presents a computational model called Model for Adaptive Persuasion (MAP) for virtual agents. MAP is a semi-connected network model which enables an agent to adapt its persuasion strategies through feedback. We have implemented and evaluated a MAP-based virtual nurse agent …


Beyond Traits: Social Context Based Personality Model, Jaroslaw Kochanowicz, Ah-Hwee Tan, Daniel Thalmann May 2015

Beyond Traits: Social Context Based Personality Model, Jaroslaw Kochanowicz, Ah-Hwee Tan, Daniel Thalmann

Research Collection School Of Computing and Information Systems

The relation between individual’s personality and environmental context is a key issue in psychology, recently also in character simulations. This paper contributes to both domains by proposing a socio-cognitive, contextual personality model - a new voice in a century old problem of personality, but also an approach to simulating groups of more humanlike agents. After analyzing the influence of popularity of ‘trait personality models’ on psychology and computer simulation, we propose Social Context based Personality model - a continuation and specification of the Cognitive-Affective Personality System theory. The discussion, model and implementation are provided, followed by an example application in …


Characterizing Silent Users In Social Media Communities, Wei Gong, Ee-Peng Lim, Feida Zhu May 2015

Characterizing Silent Users In Social Media Communities, Wei Gong, Ee-Peng Lim, Feida Zhu

Research Collection School Of Computing and Information Systems

Silent users often constitute a significant proportion of an online user-generated content system. In the context of social media such as Twitter, users can opt to be silent all or most of the time. They are often called the invisible participants or lurkers. As lurkers contribute little to the online content, existing analysis often overlooks their presence and voices. However, we argue that understanding lurkers is important in many applications such as recommender systems, targeted advertising, and social sensing. This research therefore seeks to characterize lurkers in social media and propose methods to profile them. We examine 18 weeks of …


Advances In Knowledge Discovery And Data Mining Part Ii, Tru Cao, Ee Peng Lim, Zhi-Hua Zhou, Tu-Bao Ho, David Wai-Lok Cheung, Hiroshi Motoda May 2015

Advances In Knowledge Discovery And Data Mining Part Ii, Tru Cao, Ee Peng Lim, Zhi-Hua Zhou, Tu-Bao Ho, David Wai-Lok Cheung, Hiroshi Motoda

Research Collection School Of Computing and Information Systems

No abstract provided.


Advances In Knowledge Discovery And Data Mining: 19th Pacific-Asia Conference, Pakdd 2015, Ho Chi Minh City, Vietnam, May 19-22, 2015, Proceedings, Part I, Tru Cao, Ee-Peng Lim, Zhi-Hua Zhou, Tu-Bao Ho, David Wai-Lok Cheung, Hiroshi Motoda May 2015

Advances In Knowledge Discovery And Data Mining: 19th Pacific-Asia Conference, Pakdd 2015, Ho Chi Minh City, Vietnam, May 19-22, 2015, Proceedings, Part I, Tru Cao, Ee-Peng Lim, Zhi-Hua Zhou, Tu-Bao Ho, David Wai-Lok Cheung, Hiroshi Motoda

Research Collection School Of Computing and Information Systems

No abstract provided.


Breaking The News: First Impressions Matter On Online News, Julio Reis, Fabr´Icio Benevenuto, Pedro Olmo, Raquel Prates, Haewoon Kwak, Jisun An May 2015

Breaking The News: First Impressions Matter On Online News, Julio Reis, Fabr´Icio Benevenuto, Pedro Olmo, Raquel Prates, Haewoon Kwak, Jisun An

Research Collection School Of Computing and Information Systems

A growing number of people are changing the way they consume news, replacing the traditional physical newspapers and magazines by their virtual online versions or/and weblogs. The interactivity and immediacy present in online news are changing the way news are being produced and exposed by media corporations. News websites have to create effective strategies to catch people’s attention and attract their clicks. In this paper we investigate possible strategies used by online news corporations in the design of their news headlines. We analyze the content of 69,907 headlines produced by four major global media corporations during a minimum of eight …


Report On The Fg 2015 Video Person Recognition Evaluation, J.R. Beveridge, H. Zhang, B.A. Draper, P.J. Flynn, Z. Feng, P. Huber, J. Kittler, Zhiwu Huang, Li S., Li Y., M. Kan, R. Wang, S. Shan, X. Chen, Li H., G. Hua, V. Struc, J. Krizaj, C. Ding, D. Tao May 2015

Report On The Fg 2015 Video Person Recognition Evaluation, J.R. Beveridge, H. Zhang, B.A. Draper, P.J. Flynn, Z. Feng, P. Huber, J. Kittler, Zhiwu Huang, Li S., Li Y., M. Kan, R. Wang, S. Shan, X. Chen, Li H., G. Hua, V. Struc, J. Krizaj, C. Ding, D. Tao

Research Collection School Of Computing and Information Systems

This report presents results from the Video Person Recognition Evaluation held in conjunction with the 11th IEEE International Conference on Automatic Face and Gesture Recognition. Two experiments required algorithms to recognize people in videos from the Point-and-Shoot Face Recognition Challenge Problem (PaSC). The first consisted of videos from a tripod mounted high quality video camera. The second contained videos acquired from 5 different handheld video cameras. There were 1401 videos in each experiment of 265 subjects. The subjects, the scenes, and the actions carried out by the people are the same in both experiments. Five groups from around the world …


Understanding The Test Automation Culture Of App Developers, Pavneet Singh Kochhar, Ferdian. Thung, Nachiappan Nagappan, Thomas Zimmermann, David Lo Apr 2015

Understanding The Test Automation Culture Of App Developers, Pavneet Singh Kochhar, Ferdian. Thung, Nachiappan Nagappan, Thomas Zimmermann, David Lo

Research Collection School Of Computing and Information Systems

Smartphone applications (apps) have gained popularity recently. Millions of smartphone applications (apps) are available on different app stores which gives users plethora of options to choose from, however, it also raises concern if these apps are adequately tested before they are released for public use. In this study, we want to understand the test automation culture prevalent among app developers. Specifically, we want to examine the current state of testing of apps, the tools that are commonly used by app developers, and the problems faced by them. To get an insight on the test automation culture, we conduct two different …


Sensorem – An Efficient Mobile Platform For Wireless Sensor Network Visualization, Jin Ming Koh, Marcus Sak, Hwee Xian Tan, Huiguang Liang, Fachmin Folianto, Tony Quek Apr 2015

Sensorem – An Efficient Mobile Platform For Wireless Sensor Network Visualization, Jin Ming Koh, Marcus Sak, Hwee Xian Tan, Huiguang Liang, Fachmin Folianto, Tony Quek

Research Collection School Of Computing and Information Systems

No abstract provided.


Exploring Discriminative Features For Anomaly Detection In Public Spaces, Shriguru Nayak, Archan Misra, Kasthuri Jeyarajah, Philips Kokoh Prasetyo, Ee-Peng Lim Apr 2015

Exploring Discriminative Features For Anomaly Detection In Public Spaces, Shriguru Nayak, Archan Misra, Kasthuri Jeyarajah, Philips Kokoh Prasetyo, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Context data, collected either from mobile devices or from user-generated social media content, can help identify abnormal behavioural patterns in public spaces (e.g., shopping malls, college campuses or downtown city areas). Spatiotemporal analysis of such data streams provides a compelling new approach towards automatically creating real-time urban situational awareness, especially about events that are unanticipated or that evolve very rapidly. In this work, we use real-life datasets collected via SMU's LiveLabs testbed or via SMU's Palanteer software, to explore various discriminative features (both spatial and temporal - e.g., occupancy volumes, rate of change in topic{specific tweets or probabilistic distribution of …


Best Upgrade Plans For Single And Multiple Source-Destination Pairs, Yimin Lin, Kyriakos Mouratidis Apr 2015

Best Upgrade Plans For Single And Multiple Source-Destination Pairs, Yimin Lin, Kyriakos Mouratidis

Research Collection School Of Computing and Information Systems

In this paper, we study Resource Constrained Best Upgrade Plan (BUP) computation in road network databases. Consider a transportation network (weighted graph) G where a subset of the edges are upgradable, i.e., for each such edge there is a cost, which if spent, the weight of the edge can be reduced to a specific new value. In the single-pair version of BUP, the input includes a source and a destination in G, and a budget B (resource constraint). The goal is to identify which upgradable edges should be upgraded so that the shortest path distance between source and …


Review Selection Using Micro-Reviews, Thanh-Son Nguyen, Hady W. Lauw, Panayiotis Tsaparas Apr 2015

Review Selection Using Micro-Reviews, Thanh-Son Nguyen, Hady W. Lauw, Panayiotis Tsaparas

Research Collection School Of Computing and Information Systems

Given the proliferation of review content, and the fact that reviews are highly diverse and often unnecessarily verbose, users frequently face the problem of selecting the appropriate reviews to consume. Micro-reviews are emerging as a new type of online review content in the social media. Micro-reviews are posted by users of check-in services such as Foursquare. They are concise (up to 200 characters long) and highly focused, in contrast to the comprehensive and verbose reviews. In this paper, we propose a novel mining problem, which brings together these two disparate sources of review content. Specifically, we use coverage of micro-reviews …


Measuring User Influence, Susceptibility And Cynicalness In Sentiment Diffusion, Roy Ka-Wei Lee, Ee Peng Lim Apr 2015

Measuring User Influence, Susceptibility And Cynicalness In Sentiment Diffusion, Roy Ka-Wei Lee, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Diffusion in social networks is an important research topic lately due to massive amount of information shared on social media and Web. As information diffuses, users express sentiments which can affect the sentiments of others. In this paper, we analyze how users reinforce or modify sentiment of one another based on a set of inter-dependent latent user factors as they are engaged in diffusion of event information. We introduce these sentiment-based latent user factors, namely influence, susceptibility and cynicalness. We also propose the ISC model to relate the three factors together and develop an iterative computation approach to …


Multi-Roles Affiliation Model For General User Profiling, Lizi Liao, Heyan Huang, Yashen Wang Apr 2015

Multi-Roles Affiliation Model For General User Profiling, Lizi Liao, Heyan Huang, Yashen Wang

Research Collection School Of Computing and Information Systems

Online social networks release user attributes, which is important for many applications. Due to the sparsity of such user attributes online, many works focus on profiling user attributes automatically. However, in order to profile a specific user attribute, an unique model is built and such model usually does not fit other profiling tasks. In our work, we design a novel, flexible general user profiling model which naturally models users’ friendships with user attributes. Experiments show that our method simultaneously profile multiple attributes with better performance.


Mining Business Competitiveness From User Visitation Data, Doan Thanh Nam, Freddy Chong Tat Chua, Ee-Peng Lim Apr 2015

Mining Business Competitiveness From User Visitation Data, Doan Thanh Nam, Freddy Chong Tat Chua, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Ranking businesses by competitiveness is useful in many applications including business (e.g., restaurant) recommendation, and estimation of intrinsic value of businesses for mergers and acquisitions. Our literature reveals that previous methods of business ranking have ignored the competing relationship among businesses within their geographical areas. To account for competition, we propose the use of PageRank model and its variant to derive the Competitive Rankof businesses. We use the check-ins of users from Foursquare, a location-based social network, to model the winners of competitions among stores. The results of our experiments show that Competitive Rank works well when evaluated against ground …


Memory Dynamics In Attractor Networks, Guoqi Li, Kiruthika Ramanathan, Ning Ning, Luping Shi, Changyun Wen Apr 2015

Memory Dynamics In Attractor Networks, Guoqi Li, Kiruthika Ramanathan, Ning Ning, Luping Shi, Changyun Wen

Research Collection School Of Computing and Information Systems

As can be represented by neurons and their synaptic connections, attractor networks are widely believed to underlie biological memory systems and have been used extensively in recent years to model the storage and retrieval process of memory. In this paper, we propose a new energy function, which is nonnegative and attains zero values only at the desired memory patterns. An attractor network is designed based on the proposed energy function. It is shown that the desired memory patterns are stored as the stable equilibrium points of the attractor network. To retrieve a memory pattern, an initial stimulus input is presented …