Nasrullah Memon

dblp:99/943 · DBLP profile ↗
← Back
18ranked-venue papers
2as first author
0since 2021 · last 2013
0000-0001-9667-2490ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 6 · 2 first-authorDatabases, data management, data science and information retrieval · 4Human-computer interaction and ubiquitous computing · 4Artificial intelligence and machine learning · 3Graphics, computer vision, multimedia, augmented reality and games · 2Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 1Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Program verification · 75% Requirements engineering and software design · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Requirements engineering and software design
model-driven engineering
0.112010
Verification-driven slicing of UML/OCL models · ASE 2010
Program verification
model slicing
0.112010
Verification-driven slicing of UML/OCL models · ASE 2010
Program verification
model verification
0.112010
Verification-driven slicing of UML/OCL models · ASE 2010
Program verification › specification verification
UML/OCL model verification
0.112010
Verification-driven slicing of UML/OCL models · ASE 2010

Methods — techniques the papers use, named apart from their topics

slicing · 0.1formal verification · 0.1
YearPublicationVenuePosition
2013 Social network and high performance in smart communications
Jongsung Kim, Philip S. Yu, Nasrullah Memon
J. Supercomput.3
2012 Semantic Analysis of FBI News Reports
Sarwat Nizamani, Nasrullah Memon
ICONIP (4)2
2012 Hybrid model of content extraction
Abdul Rasool Qureshi, Nasrullah Memon
J. Comput. Syst. Sci.2
2011 CCM: A Text Classification Model by Clustering
abstract
In this paper, a new Cluster based Classification Model (CCM) for suspicious email detection and other text classification tasks, is presented. Comparative experiments of the proposed model against traditional classification models and the boosting algorithm are also discussed. Experimental results show that the CCM outperforms traditional classification models as well as the boosting algorithm for the task of suspicious email detection on terrorism domain email dataset and topic categorization on the Reuters-21578 and 20 Newsgroups datasets. The overall finding is that applying a cluster based approach to text classification tasks simplifies the model and at the same time increases the accuracy.
Sarwat Nizamani, Nasrullah Memon, Uffe Kock Wiil, Panagiotis Karampelas
ASONAM2
2011 LanguageNet: A novel framework for processing unstructured text information
abstract
In this paper we present LanguageNet-a novel framework for processing unstructured text information from human generated content. The state of the art information processing frameworks have some shortcomings: modeled in generalized form, trained on fixed (limited) data sets, and leaving the specialization necessary for information consolidation to the end users. The proposed framework is the first major attempt to address these shortcomings. LanguageNet provides extended support of graphical methods contributing added value to the capabilities of information processing. We discuss the benefits of the framework and compare it with the available state of the art. We also describe how the framework improves the information gathering process and contribute towards building systems with better performance in the domain of Open Source Intelligence.
Abdul Rasool Qureshi, Nasrullah Memon, Uffe Kock Wiil
ISI2
2011 heteroHarvest: Harvesting information from heterogeneous sources
abstract
The abundance of information regarding any topic makes the Internet a very good resource. Even though searching the Internet is very easy, what remains difficult is to automate the process of information extraction from the available online information due to the lack of structure and the diversity in the sharing methods. Most of the times, information is stored in different proprietary formats, complying with different standards and protocols which makes tasks like data mining and information harvesting very difficult. In this paper, an information harvesting tool (heteroHarvest) is presented with objectives to address these problems by filtering the useful information and then normalizing the information in a singular non hypertext format. Finally we describe the results of experimental evaluation. The results are found promising with an overall error rate equal to 6.5% across heterogeneous formats.
Abdul Rasool Qureshi, Nasrullah Memon, Uffe Kock Wiil, Panagiotis Karampelas, Jose Ignacio Nieto Sancheze
ISI2
2011 Extended approximate string matching algorithms to detect name aliases
abstract
This paper focuses on the problem of alias detection based on orthographic variations of Arabic names. Alias detection is the process to identify different variants of the same name. To detect aliases based on orthographic variations, the approximate string matching (ASM) algorithms are widely used that measure the similarities between two strings (i.e., the name and alias). ASM algorithms work well to detect various type of orthographic variations but still there is a need to develop techniques to detect correct aliases of Arabic names that occur due to the translation of Arabic names into English. An extension to widely used ASM algorithms is proposed to detect the name aliases that generate as a result of transliteration. This paper aims to improve the accuracy of the basic ASM algorithms in order to detect correct aliases. The experimental evaluation shows that proposed extension increases the accuracy of the basic algorithms to a considerable level.
Muniba Shaikh, Nasrullah Memon, Uffe Kock Wiil
ISI2
2010 Measuring Link Importance in Terrorist Networks
abstract
A terrorist network is a special kind of social network with emphasis on both secrecy and efficiency. Such networks are intentionally structured to ensure efficient communication between members without being detected. A terrorist network can be modeled as a generalized network (graph) consisting of nodes and links. Techniques from social network analysis and graph theory can be used to identify key entities in the network, which is helpful for network destabilization purposes. Research on terrorist network analysis has mainly focuses on analysis of nodes, which is in contrast to the fact that the links between the nodes provide at least as much relevant information about the network as the nodes themselves. This paper presents a novel method to analyze the importance of links in terrorist networks inspired by research on transportation networks. The link importance measure is implemented in CrimeFighter Assistant and evaluated on known terrorist networks.
Uffe Kock Wiil, Jolanta Gniadek, Nasrullah Memon
ASONAM3
2010 Knowledge Management Tools for Terrorist Network Analysis
Uffe Kock Wiil, Jolanta Gniadek, Nasrullah Memon, Rasmus Rosenqvist Petersen
IC3K3
2010 Verification-driven slicing of UML/OCL models
abstract
Model defects are a significant concern in the Model-Driven Development (MDD) paradigm, as model transformations and code generation may propagate errors to other notations where they are harder to detect and trace. Formal verification techniques can check the correctness of a model, but their high computational complexity can limit their scalability. In this paper, we consider a specific static model (UML class diagrams annotated with unrestricted OCL constraints) and a specific property to verify (satisfiability, i.e., "is it possible to create objects without violating any constraint?"). Current approaches to this problem have an exponential worst-case runtime. We propose a technique to improve their scalability by partitioning the original model into submodels (slices) which can be verified independently and where irrelevant information has been abstracted. The definition of the slicing procedure ensures that the property under verification is preserved after partitioning.
Asadullah Shaikh, Robert Clarisó, Uffe Kock Wiil, Nasrullah Memon
ASE4
2009 Strengths and Weaknesses of Maturity Driven Process Improvement Effort
abstract
In the recent decades most of the big organizations have adopted maturity driven process improvement efforts (MDPI). Most of these efforts have been inspired of maturity models like the CMM (capability maturity model). The maturity of an organizationpsilas processes is measured through its maturity level. An organization availed a high maturity level is considered more trustworthy In this competitive business era making software process improvement (SPI) happen is a challenge for small organizations. The statistics provided by Software Engineering Institute (SEI) for software community striving for SPI by using CMM/CMM Iindicates that a large number of companies fail to achieve their process improvement goals. SPI efforts have mostly been prolonged, expensive, and not often delivered the effects back to the organizations in the same dimension as investigations.We wonder WHY? This research paper investigates strengths and weaknesses of maturity driven process improvement (e.g. CMM). The case studies in extant SPI literature are studied and focus group is used for data collection.The study suggests that process improvement initiatives should be tailored addressing organizational needs instead of blindly pursuing maturity models prescriptions.Furthermore, it is suggested to have an inception phase prior to an SPI initiative to decide whether a maturity driven process improvement approach should be opted or an effect driven process improvement approach.
Asadullah Shaikh, Ashfaq Ahmed, Nasrullah Memon, Muniba Shoukat Memon
CISIS3
2009 The Role of Service Oriented Architecture in Telemedicine Healthcare System
abstract
Interoperability in telemedicine system is one of the major concern in telemedicine health care system. It is difficult to design exact and flexible interoperable architecture in telemedicine which transmit data and exchange information between systems to systems. The Service Oriented Architecture (SOA) is playing major role in the development of such system which helps to exchange the information between similar and dissimilar telemedicine applications. Using SOA and external Web services, the issue of interoperability can be resolved. The aim of this paper is to describe the importance of SOA in telemedicine through distributed system architecture design and implementation,which is developed in .Net platform using external Web services. The architecture of telemedicine system which we have developed is comprises of three layers that are presentation layer, business logic layer and data layer.
Asadullah Shaikh, Muniba Shoukat Memon, Nasrullah Memon, Muhammad Misbahuddin
CISIS3
2009 CrimeFighter: A Toolbox for Counterterrorism
Uffe Kock Wiil, Nasrullah Memon, Jolanta Gniadek
IC3K2
2009 Supporting emergent knowledge and team communication in police investigations
abstract
This paper focuses on police investigations conducted by small teams of officers as they usually work on solving violent crimes. Collaboration and communication are important aspects as well as connecting pieces of information that become known to the officers over time. This is an important application domain of knowledge management, and in particular hypertext. We present a prototypic application, Socs, that permits the intuitive connecting of information on a space. It supports emergent and dynamic knowledge structures, fosters communication, awareness and notification services, enables multiple trails of thought in parallel (i. e., thought experiments), as well as versioning with easy access to previous states. As a complement to the database and network analysis driven applications available today, we propose a tool for criminal profiling or crime scene analysis supporting small teams of officers in knowledge structuring and collaboration.
Claus Atzenbeck, David L. Hicks, Nasrullah Memon
ISI3
2009 The Security Aspects in Web-Based Architectural Design Using Service Oriented Architecture
abstract
Distributed web-based applications have been progressively increasing in number and scale over the past decades. There is an intensification of the need for security frameworks in the era of web-based applications when we refer to distributed telemedicine interoperability architectures. In contrast, Service Oriented Architecture (SOA) is gaining popularity day by day when we specially consider the web applications. SOA is playing a major role to maintain the security standards of distributed applications. This paper proposes a secure web-based architectural design by using the standards of SOA for distributed web application that maintains the interoperability and data integration through certain secure channels. We have created CRUD (Create,Read, Update, Delete) operations that has an implication on our own created web services and we propose a secure architecture that is implemented on CRUD operations.
Asadullah Shaikh, Aijaz Soomro, Sheeraz Ali, Nasrullah Memon
IV4
2008 Emergent Structure and Awareness Support for Intelligence Analysis
abstract
Based on the emergent nature of terrorist groups, we propose spatial hypertext as a tool for intelligence analysts for representing, reasoning upon, and communicating information. Furthermore, we evaluate awareness as an important feature for analysts to realise hidden associations between various people or objects. Finally, we discuss our prototype Socs, a general spatial structure application with high level support for awareness, under the umbrella of intelligence analysis requirements.
Claus Atzenbeck, David L. Hicks, Nasrullah Memon
IV3
2007 Dependence Centrality: Identifying Dependence of Nodes in Terrorist Networks
abstract
Summary form only given. A new model of dependence centrality is proposed. The centrality measure is based on shortest paths between the pair of nodes. We apply this measure with demonstration of small network example. The comparisons are made with betweenness centrality. We discuss how investigative world / intelligence agencies could be benefited from the proposed measure.
Nasrullah Memon, David L. Hicks, Henrik Legind Larsen
ISI1
2006 Practical Algorithms for Destabilizing Terrorist Networks
Nasrullah Memon, Henrik Legind Larsen
ISI1