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

Physical Sciences and Mathematics Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 5761 - 5790 of 6891

Full-Text Articles in Physical Sciences and Mathematics

Non-Redundant Sequential Rules - Theory And Algorithm, David Lo, Siau-Cheng Khoo, Limsoon Wong Jun 2009

Non-Redundant Sequential Rules - Theory And Algorithm, David Lo, Siau-Cheng Khoo, Limsoon Wong

Research Collection School Of Computing and Information Systems

A sequential rule expresses a relationship between two series of events happening one after another. Sequential rules are potentially useful for analyzing data in sequential format, ranging from purchase histories, network logs and program execution traces. In this work, we investigate and propose a syntactic characterization of a non-redundant set of sequential rules built upon past work on compact set of representative patterns. A rule is redundant if it can be inferred from another rule having the same support and confidence. When using the set of mined rules as a composite filter, replacing a full set of rules with a …

Go to article

Interference-Aware Routing Protocol In Multi-Radio Wireless Mesh Networks, Byoungheon Shin, Yangwoo Ko, Jisun An, Dongman Lee Jun 2009

Interference-Aware Routing Protocol In Multi-Radio Wireless Mesh Networks, Byoungheon Shin, Yangwoo Ko, Jisun An, Dongman Lee

Research Collection School Of Computing and Information Systems

Utilization of multiple radio interfaces increases throughput of wireless networks. Existing work proposes a multi-radio routing protocol exploiting link quality and channel diversity of a path. While an established path is deteriorated by interferences incurred by any changes in a network, and existing work does not detect the deterioration. In this paper, we propose an interference-aware multi-radio routing protocol detecting and resolving dynamic path deterioration in wireless mesh networks.

Go to article

Adaptive In-Network Processing For Bandwidth And Energy Constrained Mission-Oriented Multi-Hop Wireless Networks, Sharanya Eswaran, Matthew Johnson, Archan Misra, Thomas La Porta Jun 2009

Adaptive In-Network Processing For Bandwidth And Energy Constrained Mission-Oriented Multi-Hop Wireless Networks, Sharanya Eswaran, Matthew Johnson, Archan Misra, Thomas La Porta

Research Collection School Of Computing and Information Systems

In-network processing, involving operations such as filtering, compression and fusion, is widely used in sensor networks to reduce the communication overhead. In many tactical and stream-oriented wireless network applications, both link bandwidth and node energy are critically constrained resources and in-network processing itself imposes non-negligible computing cost. In this work, we have developed a unified and distributed closed-loop control framework that computes both a) the optimal level of sensor stream compression performed by a forwarding node, and b) the best set of nodes where the stream processing operators should be deployed. Our framework extends the Network Utility Maximization (NUM) paradigm, …

Go to article

Applying Sanitizable Signature To Web-Service-Enabled Business Processes: Going Beyond Integrity Protection, Kar Way Tan, Robert H. Deng Jun 2009

Applying Sanitizable Signature To Web-Service-Enabled Business Processes: Going Beyond Integrity Protection, Kar Way Tan, Robert H. Deng

Research Collection School Of Computing and Information Systems

This paper studies the scenario where data in business documents is aggregated by different entities via the use of web services in streamlined business processes. The documents are transported within the Simple Object Access Protocol (SOAP) messages and travel through multiple intermediary entities, each potentially makes changes to the data in the documents. The WS-Security provides integrity protection by allowing portions of a SOAP message to be signed using eXtensible Markup Language (XML) signature scheme. This method however, has not considered the situation where a portion of data may be modified by another entity, therefore a need to allow the …

Go to article

Architectural Dualities In Complex Systems: Components, Interfaces, Technologies And Organizations, C. Jason Woodard, Joel West Jun 2009

Architectural Dualities In Complex Systems: Components, Interfaces, Technologies And Organizations, C. Jason Woodard, Joel West

Research Collection School Of Computing and Information Systems

Research on technological innovation and product development has long recognized the importance of product architecture, and many scholars have explored its relationship to the organizational structure of the product development process. Product architecture, in turn, has long encompassed both the allocation of functionality to components and the pattern of linkages between them. In this paper, we forge new connections among these established ideas by examining them as two pairs of dual relationships. First, we draw attention to the duality between components and interfaces. While innovation and product development researchers have historically emphasized the partitioning of products and systems into components, …

Go to article

A Revisit Of Generative Model For Automatic Image Annotation Using Markov Random Fields, Yu Xiang, Xiangdong Zhou, Tat-Seng Chua, Chong-Wah Ngo Jun 2009

A Revisit Of Generative Model For Automatic Image Annotation Using Markov Random Fields, Yu Xiang, Xiangdong Zhou, Tat-Seng Chua, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Much research effort on Automatic Image Annotation (AIA) has been focused on Generative Model, due to its well formed theory and competitive performance as compared with many well designed and sophisticated methods. However, when considering semantic context for annotation, the model suffers from the weak learning ability. This is mainly due to the lack of parameter setting and appropriate learning strategy for characterizing the semantic context in the traditional generative model. In this paper, we present a new approach based on Multiple Markov Random Fields (MRF) for semantic context modeling and learning. Differing from previous MRF related AIA approach, we …

Go to article

Cyber Attacks: Cross-Country Interdependence And Enforcement, Qiu-Hong Wang, Seung Hyun Kim Jun 2009

Cyber Attacks: Cross-Country Interdependence And Enforcement, Qiu-Hong Wang, Seung Hyun Kim

Research Collection School Of Computing and Information Systems

This study empirically characterizes the interdependence in cyber attacks and examines theimpact from the first international treaty against cybercrimes (Convention on Cybercrimes:Europe Treaty Series No. 185). With the data covering 62 countries over the period from year2003 to 2007, we find that, international cooperation in enforcement as measured by theindicator of joining the Convention on Cybercrimes, deterred cyber attacks originating from anyparticular country by 15.81% ~ 24.77% (in 95% confidence interval). Second, joining theConvention also affected the interdependence in cyber attacks from two angels. First, for anypair of country, closer status in joining or not joining the Convention was associated …

Go to article

Intentional Learning Agent Architecture, Budhitama Subagdja, Liz Sonenberg, Iyad Rahwan Jun 2009

Intentional Learning Agent Architecture, Budhitama Subagdja, Liz Sonenberg, Iyad Rahwan

Research Collection School Of Computing and Information Systems

Dealing with changing situations is a major issue in building agent systems. When the time is limited, knowledge is unreliable, and resources are scarce, the issue becomes more challenging. The BDI (Belief-Desire-Intention) agent architecture provides a model for building agents that addresses that issue. The model can be used to build intentional agents that are able to reason based on explicit mental attitudes, while behaving reactively in changing circumstances. However, despite the reactive and deliberative features, a classical BDI agent is not capable of learning. Plans as recipes that guide the activities of the agent are assumed to be static. …

Go to article

A Formal Framework For Modeling And Validating Simulink Diagrams, Chunqing Chen, Jin Song Dong, Jun Sun May 2009

A Formal Framework For Modeling And Validating Simulink Diagrams, Chunqing Chen, Jin Song Dong, Jun Sun

Research Collection School Of Computing and Information Systems

Simulink has been widely used in industry to model and simulate embedded systems. With the increasing usage of embedded systems in real-time safety-critical situations, Simulink becomes deficient to analyze (timing) requirements with high-level assurance. In this article, we apply Timed Interval Calculus (TIC), a realtime specification language, to complement Simulink with TIC formal verification capability. We elaborately construct TIC library functions to model Simulink library blocks which are used to compose Simulink diagrams. Next, Simulink diagrams are automatically transformed into TIC models which preserve functional and timing aspects. Important requirements such as timing bounded liveness can be precisely specified in …

Go to article

Semisupervised Svm Batch Mode Active Learning With Applications To Image Retrieval, Steven C. H. Hoi, Rong Jin, Jianke Zhu, Michael R. Lyu May 2009

Semisupervised Svm Batch Mode Active Learning With Applications To Image Retrieval, Steven C. H. Hoi, Rong Jin, Jianke Zhu, Michael R. Lyu

Research Collection School Of Computing and Information Systems

Active learning has been shown as a key technique for improving content-based image retrieval (CBIR) performance. Among various methods, support vector machine (SVM) active learning is popular for its application to relevance feedback in CBIR. However, the regular SVM active learning has two main drawbacks when used for relevance feedback. First, SVM often suffers from learning with a small number of labeled examples, which is the case in relevance feedback. Second, SVM active learning usually does not take into account the redundancy among examples, and therefore could select multiple examples in relevance feedback that are similar (or even identical) to …

Go to article

Zeros And Ones, M. Thulasidas May 2009

Zeros And Ones, M. Thulasidas

Research Collection School Of Computing and Information Systems

Computers are notorious for their infuriatingly literal obedience. I am sure anyone who has ever worked with a computer has come across the lack of empathy on its part – it follows our instructions to the dot, yet ends up accomplishing something altogether different from what we intend. Let’s spare a thought for the way your glorified adding machine makes sense of things

Go to article

Predicting Outcome For Collaborative Featured Article Nomination In Wikipedia, Meiqun Hu, Ee Peng Lim, Ramayya Krishnan May 2009

Predicting Outcome For Collaborative Featured Article Nomination In Wikipedia, Meiqun Hu, Ee Peng Lim, Ramayya Krishnan

Research Collection School Of Computing and Information Systems

In Wikipedia, good articles are wanted. While Wikipedia relies on collaborative effort from online volunteers for quality checking, the process of selecting top quality articles is time consuming. At present, the duty of decision making is shouldered by only a couple of administrators. Aiming to assist in the quality checking cycles so as to cope with the exponential growth of online contributions to Wikipedia, this work studies the task of predicting the outcome of featured article (FA) nominations. We analyze FA candidate (FAC) sessions collected over a period of 3.5 years, and examine the extent to which consensus has been …

Go to article

Concernlines: A Timeline View Of Co-Occurring Concerns, Christoph Treude, Margaret-Anne Storey May 2009

Concernlines: A Timeline View Of Co-Occurring Concerns, Christoph Treude, Margaret-Anne Storey

Research Collection School Of Computing and Information Systems

Understanding the evolution of a software system requires understanding how information about the release history, non-functional requirements and project milestones relates to functional requirements on the software components. This short paper describes a new tool, called CONCERNLINES, that supports this cognitive process by visualizing co-occurring concerns over time.

Go to article

How Tagging Helps Bridge The Gap Between Social And Technical Aspects In Software Development, Christoph Treude, Margaret-Anne Storey May 2009

How Tagging Helps Bridge The Gap Between Social And Technical Aspects In Software Development, Christoph Treude, Margaret-Anne Storey

Research Collection School Of Computing and Information Systems

Empirical research on collaborative software development practices indicates that technical and social aspects of software development are often intertwined. The processes followed are tacit and constantly evolving, thus not all of them are amenable to formal tool support. In this paper, we explore how ldquotaggingrdquo, a lightweight social computing mechanism, is used to bridge the gap between technical and social aspects of managing work items. We present the results from an empirical study on how tagging has been adopted and adapted over the past two years of a large project with 175 developers. Our research shows that the tagging mechanism …

Go to article

The Impact Of Process Choice In High Maturity Environments: An Empirical Analysis, Narayanasamy Ramasubbu, Rajesh Krishna Balan May 2009

The Impact Of Process Choice In High Maturity Environments: An Empirical Analysis, Narayanasamy Ramasubbu, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

We present the results of a three year field study of the software development process choices made by project teams at two leading offshore vendors. In particular, we focus on the performance implications of project teams that chose to augment structured, plan-driven processes to implement the CMM level-5 Key Process Areas (KPAs) with agile methods. Our analysis of 112 software projects reveals that the decision to augment the firm-recommended, plan-driven approach with improvised, agile methods was significantly affected by the extent of client knowledge and involvement, newness of technology, and the project size. Furthermore this decision had a significant and …

Go to article

Dynamic Programming Approximations For Partially Observable Stochastic Games, Akshat Kumar, Shlomo Zilberstein May 2009

Dynamic Programming Approximations For Partially Observable Stochastic Games, Akshat Kumar, Shlomo Zilberstein

Research Collection School Of Computing and Information Systems

Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes with a price, namely a high computational cost. Solving POSGs optimally quickly becomes intractable after a few decision cycles. Our main contribution is to provide bounded approximation techniques, which enable us to scale POSG algorithms by several orders of magnitude. We study both the POSG model and its cooperative counterpart, DEC-POMDP. Experiments on a number of problems confirm the scalability of our approach while still providing useful policies.

Go to article

Classification Of Software Behaviors For Failure Detection: A Discriminative Pattern Mining Approach, David Lo, Hong Cheng, Jiawei Han, Siau-Cheng Khoo, Chengnian Sun May 2009

Classification Of Software Behaviors For Failure Detection: A Discriminative Pattern Mining Approach, David Lo, Hong Cheng, Jiawei Han, Siau-Cheng Khoo, Chengnian Sun

Research Collection School Of Computing and Information Systems

Software is a ubiquitous component of our daily life. We often depend on the correct working of software systems. Due to the difficulty and complexity of software systems, bugs and anomalies are prevalent. Bugs have caused billions of dollars loss, in addition to privacy and security threats. In this work, we address software reliability issues by proposing a novel method to classify software behaviors based on past history or runs. With the technique, it is possible to generalize past known errors and mistakes to capture failures and anomalies. Our technique first mines a set of discriminative features capturing repetitive series …

Go to article

A Novel Framework For Efficient Automated Singer Identification In Large Music Databases, Jialie Shen, John Shepherd, Bin Cui, Kian-Lee Tan May 2009

A Novel Framework For Efficient Automated Singer Identification In Large Music Databases, Jialie Shen, John Shepherd, Bin Cui, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

Over the past decade, there has been explosive growth in the availability of multimedia data, particularly image, video, and music. Because of this, content-based music retrieval has attracted attention from the multimedia database and information retrieval communities. Content-based music retrieval requires us to be able to automatically identify particular characteristics of music data. One such characteristic, useful in a range of applications, is the identification of the singer in a musical piece. Unfortunately, existing approaches to this problem suffer from either low accuracy or poor scalability. In this article, we propose a novel scheme, called Hybrid Singer Identifier (HSI), for …

Go to article

An Agent-Based Commodity Trading Simulation, Shih-Fen Cheng, Yee Pin Lim, Chao-Chi Liu May 2009

An Agent-Based Commodity Trading Simulation, Shih-Fen Cheng, Yee Pin Lim, Chao-Chi Liu

Research Collection School Of Computing and Information Systems

In recent years, the study of trading in electronic markets has received significant amount of attention, particularly in the areas of artificial intelligence and electronic commerce. With increasingly sophisticated technologies being applied in analyzing information and making decisions, fully autonomous software agents are expected to take up significant roles in many important fields. This trend is most obvious in the financial domain, where speed of reaction is highly valued and significant investments have been made in information and communication technologies.Despite the successes of automated trading in many important classes of financial markets, commodity trading has lagged behind, mainly because of …

Go to article

Distributed Constraint Optimization With Structured Resource Constraints, Akshat Kumar, Boi Faltings, Adrian Petcu May 2009

Distributed Constraint Optimization With Structured Resource Constraints, Akshat Kumar, Boi Faltings, Adrian Petcu

Research Collection School Of Computing and Information Systems

Distributed constraint optimization (DCOP) provides a framework for coordinated decision making by a team of agents. Often, during the decision making, capacity constraints on agents' resource consumption must be taken into account. To address such scenarios, an extension of DCOP-Resource Constrained DCOP - has been proposed. However, certain type of resources have an additional structure associated with them and exploiting it can result in more efficient algorithms than possible with a general framework. An example of these are distribution networks, where the flow of a commodity from sources to sinks is limited by the flow capacity of edges. We present …

Go to article

A Self-Organizing Neural Network Architecture For Intentional Planning Agents, Budhitama Subagdja, Ah-Hwee Tan May 2009

A Self-Organizing Neural Network Architecture For Intentional Planning Agents, Budhitama Subagdja, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

This paper presents a model of neural network embodiment of intentions and planning mechanisms for autonomous agents. The model bridges the dichotomy of symbolic and non-symbolic representation in developing agents. Some novel techniques are introduced that enables the neural network to process and manipulate sequential and hierarchical structures of information. It is suggested that by incorporating intentional agent model which relies on explicit symbolic description with self-organizing neural networks that are good at learning and recognizing patterns, the best from both sides can be exploited. This paper demonstrates that plans can be represented as weighted connections and reasoning processes can …

Go to article

Sharing Hierarchical Mobile Multimedia Content Using The Mobitop System, Quang Minh Nguyen, Thi Nhu Quynh Kim, Dion Hoe-Lian Goh, Ee-Peng Lim, Yin-Leng Theng, Kalyani Chatterjea, Chew-Hung Chang, Aixin Sun, Khasfariyati Razikin May 2009

Sharing Hierarchical Mobile Multimedia Content Using The Mobitop System, Quang Minh Nguyen, Thi Nhu Quynh Kim, Dion Hoe-Lian Goh, Ee-Peng Lim, Yin-Leng Theng, Kalyani Chatterjea, Chew-Hung Chang, Aixin Sun, Khasfariyati Razikin

Research Collection School Of Computing and Information Systems

We introduce MobiTOP (Mobile Tagging of Objects and People), a map-based application which allows users to contribute and share geo-referenced multimedia annotations via mobile devices. An important feature of MobiTOP is that annotations are hierarchical, allowing annotations to be annotated to an arbitrary depth. MobiTOP's interface was designed using a participatory design methodology to ensure that the user interface meets the needs of potential users. In an evaluation, a group of student-teachers involved in a geographical field study were tasked to collaboratively identify rock formations using the MobiTOP system. The students who were in the field were guided by their …

Go to article

Automatic Mining Of Functionally Equivalent Code Fragments Via Random Testing, Lingxiao Jiang, Zhendong Su May 2009

Automatic Mining Of Functionally Equivalent Code Fragments Via Random Testing, Lingxiao Jiang, Zhendong Su

Research Collection School Of Computing and Information Systems

Similar code may exist in large software projects due to some common software engineering practices, such as copying and pasting code and n-version programming. Although previous work has studied syntactic equivalence and small-scale, coarse-grained program-level and function-level semantic equivalence, it is not known whether significant fine-grained, code-level semantic duplications exist. Detecting such semantic equivalence is also desirable because it can enable many applications such as code understanding, maintenance, and optimization. In this paper, we introduce the first algorithm to automatically mine functionally equivalent code fragments of arbitrary size - down to an executable statement. Our notion of functional equivalence is …

Go to article

On Mining Rating Dependencies In Online Collaborative Rating Networks, Hady W. Lauw, Ee Peng Lim, Ke Wang May 2009

On Mining Rating Dependencies In Online Collaborative Rating Networks, Hady W. Lauw, Ee Peng Lim, Ke Wang

Research Collection School Of Computing and Information Systems

The trend of social information processing sees e-commerce and social web applications increasingly relying on user-generated content, such as rating, to determine the quality of objects and to generate recommendations for users. In a rating system, a set of reviewers assign to a set of objects different types of scores based on specific evaluation criteria. In this paper, we seek to determine, for each reviewer and for each object, the dependency between scores on any two given criteria. A reviewer is said to have high dependency between a pair of criteria when his or her rating scores on objects based …

Go to article

Are Online Auction Markets Efficient? An Empirical Study Of Market Liquidity And Abnormal Returns., Robert J. Kauffman, Trent J Spaulding, Charles A. Wood May 2009

Are Online Auction Markets Efficient? An Empirical Study Of Market Liquidity And Abnormal Returns., Robert J. Kauffman, Trent J Spaulding, Charles A. Wood

Research Collection School Of Computing and Information Systems

Technological advances have facilitated investment in collectibles through online auction markets, where information regarding product characteristics, current and historical prices, and product availability is available to millions of market participants. However, market inefficiencies may still exist, where prices do not reflect market information and where savvy speculators can profit. Using unit root and variance ratio tests, we examine 8538 rare stamp and 56,997 rare coin auctions to evaluate the efficiency of online markets. In particular, we study market liquidity, abnormal returns and weak-form efficiency. We find an inverse relationship between market efficiency and liquidity. Bidder competition intrinsic to liquidity increases …

Go to article

Constraint-Based Dynamic Programming For Decentralized Pomdps With Structured Interactions, Akshat Kumar, Shlomo Zilberstein May 2009

Constraint-Based Dynamic Programming For Decentralized Pomdps With Structured Interactions, Akshat Kumar, Shlomo Zilberstein

Research Collection School Of Computing and Information Systems

Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited scalability of solution techniques has restricted the applicability of the model. To overcome this computational barrier, research has focused on restricted classes of DEC-POMDPs, which are easier to solve yet rich enough to capture many practical problems. We present CBDP, an efficient and scalable point-based dynamic programming algorithm for one such model called ND-POMDP (Network Distributed POMDP). Specifically, CBDP provides magnitudes of speedup in the policy computation and generates better quality solution for all …

Go to article

Ss-Ids: Statistical Signature Based Ids, Payas Gupta, Chedy Raissi, Gerard Dray, Pascal Poncelet, Johan Brissaud May 2009

Ss-Ids: Statistical Signature Based Ids, Payas Gupta, Chedy Raissi, Gerard Dray, Pascal Poncelet, Johan Brissaud

Research Collection School Of Computing and Information Systems

Security of web servers has become a sensitive subject today. Prediction of normal and abnormal request is problematic due to large number of false alarms in many anomaly based Intrusion, Detection Systems(IDS). SS-IDS derives automatically the parameter profiles from the analyzed data thereby generating the Statistical Signatures. Statistical Signatures are based on modeling of normal requests and their distribution value without explicit intervention. Several attributes are used to calculate the behavior of the legitimate request on the web server. SS-IDS is best suited for the newly installed web servers which doesn't have low gene number of requests in. the data …

Go to article

Joint Ranking For Multilingual Web Search, Wei Gao, Cheng Niu, Ming Zhou, Kam-Fai Wong Apr 2009

Joint Ranking For Multilingual Web Search, Wei Gao, Cheng Niu, Ming Zhou, Kam-Fai Wong

Research Collection School Of Computing and Information Systems

Ranking for multilingual information retrieval (MLIR) is a task to rank documents of different languages solely based on their relevancy to the query regardless of query’s language. Existing approaches are focused on combining relevance scores of different retrieval settings, but do not learn the ranking function directly. We approach Web MLIR ranking within the learning-to-rank (L2R) framework. Besides adopting popular L2R algorithms to MLIR, a joint ranking model is created to exploit the correlations among documents, and induce the joint relevance probability for all the documents. Using this method, the relevant documents of one language can be leveraged to improve …

Go to article

Ensuring Dual Security Modes In Rfid-Enabled Supply Chain Systems, Shaoying Cai, Tieyan Li, Yingjiu Li, Robert H. Deng Apr 2009

Ensuring Dual Security Modes In Rfid-Enabled Supply Chain Systems, Shaoying Cai, Tieyan Li, Yingjiu Li, Robert H. Deng

Research Collection School Of Computing and Information Systems

While RFID technology has greatly facilitated the supply chain management, designing a secure, visible, and efficient RFID- enabled supply chain system is still a challenge since the three equally important requirements (i.e., security, visibility, and efficiency) may conflict to each other. Few research works have been conducted to address these issues simultaneously. In this paper, we observe the different security requirements in RFID-enabled supply chain environments and differentiate the simplified model into two security levels. Accordingly, dual security modes are properly defined in our RFID setting. In the relatively secure environment, our system is set to the weak security mode, …

Go to article

Describing Fuzzy Sets Using A New Concept: Fuzzify Functor, Kexin Wei, Zhaoxia Wang, Quan Wang Apr 2009

Describing Fuzzy Sets Using A New Concept: Fuzzify Functor, Kexin Wei, Zhaoxia Wang, Quan Wang

Research Collection School Of Computing and Information Systems

This paper proposed a fuzzify functor as an extension of the concept of fuzzy sets. The fuzzify functor and the first-order operated fuzzy set are defined. From the theory analysis, it can be observed that when the fuzzify functor acts on a simple crisp set, we get the first order fuzzy set or type-1 fuzzy set. By operating the fuzzify functor on fuzzy sets, we get the higher order fuzzy sets or higher type fuzzy sets and their membership functions. Using the fuzzify functor we can exactly describe the type-1 fuzzy sets, type-2 fuzzy sets and higher type or higher …

Go to article

First Prev Next Last