Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (239)
- Programming Languages and Compilers (198)
- Artificial Intelligence and Robotics (142)
- Engineering (142)
- Computer Engineering (126)
-
- Information Security (109)
- OS and Networks (80)
- Graphics and Human Computer Interfaces (78)
- Social and Behavioral Sciences (76)
- Numerical Analysis and Scientific Computing (59)
- Theory and Algorithms (46)
- Business (43)
- Computer and Systems Architecture (39)
- Digital Communications and Networking (39)
- Medicine and Health Sciences (33)
- Communication (30)
- Education (28)
- Systems Architecture (21)
- Health Information Technology (20)
- Sociology (18)
- Finance and Financial Management (15)
- Gerontology (15)
- Public Affairs, Public Policy and Public Administration (15)
- Higher Education (13)
- Social Media (13)
- Transportation (12)
- Technology and Innovation (11)
- Keyword
-
- Deep learning (54)
- Software engineering (49)
- Empirical study (43)
- Machine learning (35)
- Software (30)
-
- Android (29)
- Model Check (29)
- Collaboration (26)
- Deep Learning (24)
- GitHub (22)
- Stack Overflow (22)
- Fuzzing (21)
- Security (21)
- Testing (20)
- Data mining (19)
- Large language models (18)
- Programming (18)
- Software Engineering (18)
- Code search (17)
- Computer bugs (17)
- Codes (16)
- Empirical Study (16)
- Information retrieval (16)
- Large Language Models (16)
- Large language model (16)
- Software testing (15)
- Large Language Model (14)
- Linear Temporal Logic (14)
- Software maintenance (14)
- Vulnerability detection (14)
- Publication Year
- Publication
- Publication Type
Articles 1801 - 1830 of 2211
Full-Text Articles in Software Engineering
Network Structure Of Social Coding In Github, Ferdian Thung, Tegawende F. Bissyande, David Lo, Lingxiao Jiang
Network Structure Of Social Coding In Github, Ferdian Thung, Tegawende F. Bissyande, David Lo, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
Social coding enables a different experience of software development as the activities and interests of one developer are easily advertized to other developers. Developers can thus track the activities relevant to various projects in one umbrella site. Such a major change in collaborative software development makes an investigation of networkings on social coding sites valuable. Furthermore, project hosting platforms promoting this development paradigm have been thriving, among which GitHub has arguably gained the most momentum. In this paper, we contribute to the body of knowledge on social coding by investigating the network structure of social coding in GitHub. We collect …
Understanding Widespread Changes: A Taxonomic Study, Shaowei Wang, David Lo, Lingxiao Jiang
Understanding Widespread Changes: A Taxonomic Study, Shaowei Wang, David Lo, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
No abstract provided.
Predicting Project Outcome Leveraging Socio-Technical Network Patterns, Didi Surian, Yuan Tian, David Lo, Hong Cheng, Ee Peng Lim
Predicting Project Outcome Leveraging Socio-Technical Network Patterns, Didi Surian, Yuan Tian, David Lo, Hong Cheng, Ee Peng Lim
Research Collection School Of Computing and Information Systems
There are many software projects started daily, some are successful, while others are not. Successful projects get completed, are used by many people, and bring benefits to users. Failed projects do not bring similar benefits. In this work, we are interested in developing an effective machine learning solution that predicts project outcome (i.e., success or failures) from developer socio-technical network. To do so, we investigate successful and failed projects to find factors that differentiate the two. We analyze the socio-technical aspect of the software development process by focusing at the people that contribute to these projects and the interactions among …
Empirical Evaluation Of Bug Linking, Tegawende F. Bissyande, Ferdian Thung, Shaowei Wang, David Lo, Lingxiao Jiang, Laurent Reveillere
Empirical Evaluation Of Bug Linking, Tegawende F. Bissyande, Ferdian Thung, Shaowei Wang, David Lo, Lingxiao Jiang, Laurent Reveillere
Research Collection School Of Computing and Information Systems
To collect software bugs found by users, development teams often setup bug trackers using systems such as Bugzilla. Developers would then fix some of the bugs and commit corresponding code changes into version control systems such as svn or git. Unfortunately, the links between bug reports and code changes are missing for many software projects as the bug tracking and version control systems are often maintained separately. Yet, linking bug reports to fix commits is important as it could shed light into the nature of bug fixing processes and expose patterns in software management. Bug linking solutions, such as ReLink, …
Understanding Widespread Changes: A Taxonomic Study, Shaowei Wang, David Lo, Lingxiao Jiang
Understanding Widespread Changes: A Taxonomic Study, Shaowei Wang, David Lo, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
Many active research studies in software engineering, such as detection of recurring bug fixes, detection of copyand- paste bugs, and automated program transformation tools, are motivated by the assumption that many code changes (e.g., changing an identifier name) in software systems are widespread to many locations and are similar to one another. However, there is no study so far that actually analyzes widespread changes in software systems. Understanding the nature of widespread changes could empirically support the assumption, which provides insight to improve the research studies and related tools. Our study in this paper addresses such a need. We propose …
An Empirical Study On Developer Interactions In Stackoverflow, Shaowei Wang, David Lo, Lingxiao Jiang
An Empirical Study On Developer Interactions In Stackoverflow, Shaowei Wang, David Lo, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
StackOverflow provides a popular platform where developers post and answer questions. Recently, Treude et al. manually label 385 questions in StackOverflow and group them into 10 categories based on their contents. They also analyze how tags are used in StackOverflow. In this study, we extend their work to obtain a deeper understanding on how developers interact with one another on such a question and answer web site. First, we analyze the distributions of developers who ask and answer questions. We also investigate if there is a segregation of the StackOverflow community into questioners and answerers. We also perform automated text …
Combining Crowdsourcing And Google Street View To Identify Street-Level Accessibility Problems, Kotaro Hara, Victoria Le, Jon Froehlich
Combining Crowdsourcing And Google Street View To Identify Street-Level Accessibility Problems, Kotaro Hara, Victoria Le, Jon Froehlich
Research Collection School Of Computing and Information Systems
Jon FroehlichAbstractPoorly maintained sidewalks, missing curb ramps, and other obstacles pose considerable accessibility challenges; however, there are currently few, if any, mechanisms to determine accessible areas of a city a priori. In this paper, we investigate the feasibility of using untrained crowd workers from Amazon Mechanical Turk (turkers) to find, label, and assess sidewalk accessibility problems in Google Street View imagery. We report on two studies: Study 1 examines the feasibility of this labeling task with six dedicated labelers including three wheelchair users; Study 2 investigates the comparative performance of turkers. In all, we collected 13,379 labels and 19,189 verification …
Mutual Assessment In The Social Programmer Ecosystem: An Empirical Investigation Of Developer Profile Aggregators, Leif Singer, Fernando Figueira Filho, Brendan Cleary, Christoph Treude, Margaret-Anne Storey, Kurt Schneider
Mutual Assessment In The Social Programmer Ecosystem: An Empirical Investigation Of Developer Profile Aggregators, Leif Singer, Fernando Figueira Filho, Brendan Cleary, Christoph Treude, Margaret-Anne Storey, Kurt Schneider
Research Collection School Of Computing and Information Systems
The multitude of social media channels that programmers can use to participate in software development has given rise to online developer profiles that aggregate activity across many services. Studying members of such developer profile aggregators, we found an ecosystem that revolves around the social programmer. Developers are assessing each other to evaluate whether other developers are interesting, worth following, or worth collaborating with. They are self-conscious about being assessed, and thus manage their public images. They value passion for software development, new technologies, and learning. Some recruiters participate in the ecosystem and use it to find candidates for hiring; other …
Authscan: Automatic Extraction Of Web Authentication Protocols From Implementations, Guangdong Bai, Jike Lei, Guozhu Meng, Sai Sathyanarayan Venkatraman, Prateek Saxena, Jun Sun, Yang Liu, Jin Song Dong
Authscan: Automatic Extraction Of Web Authentication Protocols From Implementations, Guangdong Bai, Jike Lei, Guozhu Meng, Sai Sathyanarayan Venkatraman, Prateek Saxena, Jun Sun, Yang Liu, Jin Song Dong
Research Collection School Of Computing and Information Systems
Ideally, security protocol implementations should be formally verified before they are deployed. However, this is not true in practice. Numerous high-profile vulnerabilities have been found in web authentication protocol implementations, especially in single-sign on (SSO) protocols implementations recently. Much of the prior work on authentication protocol verification has focused on theoretical foundations and building scalable verification tools for checking manually-crafted specifications [17, 18, 44]. In this paper, we address a complementary problem of automatically extracting specifications from implementations. We propose AUTHSCAN, an end-to-end platform to automatically recover authentication protocol specifications from their implementations. AUTHSCAN finds a total of 7 security …
Verification Of Functional And Non-Functional Requirements Of Web Service Composition, Manman Chen, Tian Huat Tan, Jun Sun, Yang Liu, Jun Pang, Xiaohong Li
Verification Of Functional And Non-Functional Requirements Of Web Service Composition, Manman Chen, Tian Huat Tan, Jun Sun, Yang Liu, Jun Pang, Xiaohong Li
Research Collection School Of Computing and Information Systems
Web services have emerged as an important technology nowadays. There are two kinds of requirements that are crucial to web service composition, which are functional and non-functional requirements. Functional requirements focus on functionality of the composed service, e.g., given a booking service, an example of functional requirements is that a flight ticket with price higher than $2000 will never be purchased. Non-functional requirements are concerned with the quality of service (QoS), e.g., an example of the booking service’s non-functional requirements is that the service will respond to the user within 5 seconds. Non-functional requirements are important to web service composition, …
Improving Model Checking Stateful Timed Csp With Non-Zenoness Through Clock-Symmetry Reduction, Yuanjie Si, Jun Sun, Yang Liu, Ting Wang
Improving Model Checking Stateful Timed Csp With Non-Zenoness Through Clock-Symmetry Reduction, Yuanjie Si, Jun Sun, Yang Liu, Ting Wang
Research Collection School Of Computing and Information Systems
Real-time system verification must deal with a special notion of ‘fairness’, i.e., clocks must always be able to progress. A system run which prevents clocks from progressing unboundedly is known as Zeno. Zeno runs are infeasible in reality and thus must be pruned during system verification. Though zone abstraction is an effective technique for model checking real-time systems, it is known that zone graphs (e.g., those generated from Timed Automata models) are too abstract to directly infer time progress and hence non-Zenoness. As a result, model checking with non-Zenoness (i.e., existence of a non-Zeno counterexample) based on zone graphs only …
A Utp Semantics For Communicating Processes With Shared Variables, Ling Shi, Yongxin Zhao, Yang Liu, Jun Sun, Jin Song Dong, Shengchao Qin
A Utp Semantics For Communicating Processes With Shared Variables, Ling Shi, Yongxin Zhao, Yang Liu, Jun Sun, Jin Song Dong, Shengchao Qin
Research Collection School Of Computing and Information Systems
CSP# (Communicating Sequential Programs) is a modelling language designed for specifying concurrent systems by integrating CSP-like compositional operators with sequential programs updating shared variables. In this paper, we define an observation-oriented denotational semantics in an open environment for the CSP# language based on the UTP framework. To deal with shared variables, we lift traditional event-based traces into hybrid traces which consist of event-state pairs for recording process behaviours. We also define refinement to check process equivalence and present a set of algebraic laws which are established based on our denotational semantics. Our approach thus provides a rigorous means for reasoning …
Vtrust: A Formal Modeling And Verification Framework For Virtualization Systems, Jianan Hao, Yang Liu, Wentong Cai, Guangdong Bai, Jun Sun
Vtrust: A Formal Modeling And Verification Framework For Virtualization Systems, Jianan Hao, Yang Liu, Wentong Cai, Guangdong Bai, Jun Sun
Research Collection School Of Computing and Information Systems
Virtualization is widely used for critical services like Cloud computing. It is desirable to formally verify virtualization systems. However, the complexity of the virtualization system makes the formal analysis a difficult task, e.g., sophisticated programs to manipulate low-level technologies, paged memory management, memory mapped I/O and trusted computing. In this paper, we propose a formal framework, vTRUST, to formally describe virtualization systems with a carefully designed abstraction. vTRUST includes a library to model configurable hardware components and technologies commonly used in virtualization. The system designer can thus verify virtualization systems on critical properties (e.g., confidentiality, verifiability, isolation and PCR consistency) …
Verifying Linearizability Via Optimized Refinement Checking, Yang Liu, Wei Chen, Yanhong A. Liu, Jun Sun, Shao Jie Zhang, Jin Song Dong Dong
Verifying Linearizability Via Optimized Refinement Checking, Yang Liu, Wei Chen, Yanhong A. Liu, Jun Sun, Shao Jie Zhang, Jin Song Dong Dong
Research Collection School Of Computing and Information Systems
Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires checking that: 1) All executions of concurrent operations are serializable, and 2) the serialized executions are correct with respect to the sequential semantics. In this work, we describe a method to automatically check linearizability based on refinement relations from abstract specifications to concrete implementations. The method does not require that linearization points in the implementations be given, which is often difficult or impossible. However, the method takes advantage of linearization points if they are given. The method is based on …
Modeling And Verifying Hierarchical Real-Time Systems Using Stateful Timed Csp, Jun Sun, Yang Liu, Jin Song Dong, Yan Liu, Ling Shi, Étienne André
Modeling And Verifying Hierarchical Real-Time Systems Using Stateful Timed Csp, Jun Sun, Yang Liu, Jin Song Dong, Yan Liu, Ling Shi, Étienne André
Research Collection School Of Computing and Information Systems
Modeling and verifying complex real-time systems are challenging research problems. The de facto approach is based on Timed Automata, which are finite state automata equipped with clock variables. Timed Automata are deficient in modeling hierarchical complex systems. In this work, we propose a language called Stateful Timed CSP and an automated approach for verifying Stateful Timed CSP models. Stateful Timed CSP is based on Timed CSP and is capable of specifying hierarchical real-time systems. Through dynamic zone abstraction, finite-state zone graphs can be generated automatically from Stateful Timed CSP models, which are subject to model checking. Like Timed Automata, Stateful …
Raising The Game: Applying Theory And Analytics To Real-World Threats, Singapore Management University
Raising The Game: Applying Theory And Analytics To Real-World Threats, Singapore Management University
Perspectives@SMU
Safety and security are, on many levels, essential priorities for governments, businesses and individuals. While an increase of defence and security budgets may bring some assurance of peaceful times to come, it seems the world has no lack of insane perpetrators who can still somehow evade, breach, ambush, assail and attack as they please. Enter the “Bayesian Stackelberg Game”, a game theory model that can, and has been applied rather successfully to the allocation of security resources in the United States by Prof Milind Tambe, University of Southern California.
Mining Indirect Antagonistic Communities From Social Interactions, Kuan Zhang, David Lo, Ee Peng Lim, Philips Kokoh Prasetyo
Mining Indirect Antagonistic Communities From Social Interactions, Kuan Zhang, David Lo, Ee Peng Lim, Philips Kokoh Prasetyo
Research Collection School Of Computing and Information Systems
Antagonistic communities refer to groups of people with opposite tastes, opinions, and factions within a community. Given a set of interactions among people in a community, we develop a novel pattern mining approach to mine a set of antagonistic communities. In particular, based on a set of user-specified thresholds, we extract a set of pairs of communities that behave in opposite ways with one another. We focus on extracting a compact lossless representation based on the concept of closed patterns to prevent exploding the number of mined antagonistic communities. We also present a variation of the algorithm using a divide …
Understanding And Rejecting Errant Touches On Multi-Touch Tablets, Ke Shu
Understanding And Rejecting Errant Touches On Multi-Touch Tablets, Ke Shu
Dissertations and Theses Collection (Open Access)
Given the pervasion of multi-touch tablet, pen-based applications have rapidly moved onto this new platform. Users draw both with bare fingers and using capacitive pens as they would do on paper in the past. Unlike paper, these tablets cannot distinguish legitimate finger/pen input from accidental touches by other parts of the user’s hand. In this thesis, we refer it to as errant touch rejection problem since users may unintentionally touch the screen with other parts of their hand. In this thesis, I design, implement and evaluate new approaches, bezel-focus rejection, of preventing errant touches on multi-touch tablets. I began the …
State Space Reduction For Sensor Networks Using Two-Level Partial Order Reduction, Manchun Zheng, David Sanán, Jun Sun, Yang Liu, Jin Song Dong, Yu Gu
State Space Reduction For Sensor Networks Using Two-Level Partial Order Reduction, Manchun Zheng, David Sanán, Jun Sun, Yang Liu, Jin Song Dong, Yu Gu
Research Collection School Of Computing and Information Systems
Wireless sensor networks may be used to conduct critical tasks like fire detection or surveillance monitoring. It is thus important to guarantee the correctness of such systems by systematically analyzing their behaviors. Formal verification of wireless sensor networks is an extremely challenging task as the state space of sensor networks is huge, e.g., due to interleaving of sensors and intra-sensor interrupts. In this work, we develop a method to reduce the state space significantly so that state space exploration methods can be applied to a much smaller state space without missing a counterexample. Our method explores the nature of networked …
An Initial Study Of Automatic Curb Ramp Detection With Crowdsourced Verification Using Google Street View Images, Kotaro Hara, Jin Sun, Jonah Chazan, David Jacobs, Jin Froehlich
An Initial Study Of Automatic Curb Ramp Detection With Crowdsourced Verification Using Google Street View Images, Kotaro Hara, Jin Sun, Jonah Chazan, David Jacobs, Jin Froehlich
Research Collection School Of Computing and Information Systems
In our previous research, we examined whether minimallytrained crowd workers could find, categorize, and assesssidewalk accessibility problems using Google Street View(GSV) images. This poster paper presents a first step towardscombining automated methods (e.g., machine visionbasedcurb ramp detectors) in concert with human computationto improve the overall scalability of our approach.
Clustering Of Search Trajectory And Its Application To Parameter Tuning, Linda Lindawati, Hoong Chuin Lau, David Lo
Clustering Of Search Trajectory And Its Application To Parameter Tuning, Linda Lindawati, Hoong Chuin Lau, David Lo
Research Collection School Of Computing and Information Systems
This paper is concerned with automated classification of Combinatorial Optimization Problem instances for instance-specific parameter tuning purpose. We propose the CluPaTra Framework, a generic approach to CLUster instances based on similar PAtterns according to search TRAjectories and apply it on parameter tuning. The key idea is to use the search trajectory as a generic feature for clustering problem instances. The advantage of using search trajectory is that it can be obtained from any local-search based algorithm with small additional computation time. We explore and compare two different search trajectory representations, two sequence alignment techniques (to calculate similarities) as well as …
Improving Public Transit Accessibility For Blind Riders By Crowdsourcing Bus Stop Landmark Locations With Google Street View, Kotaro Hara, Shiri Azenkot, Megan Campbell, Cynthia L. Bennett, Vicki Le, Sean Pannella, Robert Moore, Kelly Minckler, Rochelle H. Ng, Jon E. Froehlich
Improving Public Transit Accessibility For Blind Riders By Crowdsourcing Bus Stop Landmark Locations With Google Street View, Kotaro Hara, Shiri Azenkot, Megan Campbell, Cynthia L. Bennett, Vicki Le, Sean Pannella, Robert Moore, Kelly Minckler, Rochelle H. Ng, Jon E. Froehlich
Research Collection School Of Computing and Information Systems
Low-vision and blind bus riders often rely on known physicallandmarks to help locate and verify bus stop locations (e.g., bysearching for a shelter, bench, newspaper bin). However, there arecurrently few, if any, methods to determine this information apriori via computational tools or services. In this paper, weintroduce and evaluate a new scalable method for collecting busstop location and landmark descriptions by combining onlinecrowdsourcing and Google Street View (GSV). We conduct andreport on three studies in particular: (i) a formative interviewstudy of 18 people with visual impairments to inform the designof our crowdsourcing tool; (ii) a comparative study examiningdifferences between physical …
Symbolic Model-Checking Of Stateful Timed Csp Using Bdd And Digitization, Truong Khanh Nguyen, Jun Sun, Yang Liu, Jin Song Dong
Symbolic Model-Checking Of Stateful Timed Csp Using Bdd And Digitization, Truong Khanh Nguyen, Jun Sun, Yang Liu, Jin Song Dong
Research Collection School Of Computing and Information Systems
Stateful Timed CSP has been recently proposed to model (and verify) hierarchical real-time systems. It is an expressive modeling language which combines data structure/operations, complicated control flows (modeled using compositional process operators adopted from Timed CSP), and real-time requirements like deadline and within. It has been shown that Stateful Timed CSP is equivalent to closed timed automata with silent transitions, which implies that the timing constraints of Stateful Timed CSP can be captured using explicit tick events, through digitization. In order to tackle the state space explosion problem, we develop a BDD-based symbolic model checking approach to verify Stateful Timed …
Fame, Soft Flock Formation Control For Collective Behavior Studies And Rapid Games Development, Choon Sing Ho, Yew-Soon Ong, Xianshun Chen, Ah-Hwee Tan
Fame, Soft Flock Formation Control For Collective Behavior Studies And Rapid Games Development, Choon Sing Ho, Yew-Soon Ong, Xianshun Chen, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
We present FAME, a comprehensive C# software library package providing soft formation control for large flocks of agents. While many existing available libraries provide means to create flocks of agent equipped with simple steering behavior, none so far, to the best of our knowledge, provides an easy and hassle free approach to control the formation of the flock. Here, besides the basic flocking mechanisms, FAME provides an extensive range of advanced features that gives enhanced soft formation control over multiple flocks. These soft formation features include defining flocks in any user-defined formation, automated self-organizing agent within formation, manipulating formation shape …
Semi-Automated Verification Of Defense Against Sql Injection In Web Applications, Kaiping Liu, Hee Beng Kuan Tan, Lwin Khin Shar
Semi-Automated Verification Of Defense Against Sql Injection In Web Applications, Kaiping Liu, Hee Beng Kuan Tan, Lwin Khin Shar
Research Collection School Of Computing and Information Systems
Recent reports reveal that majority of the attacks to Web applications are input manipulation attacks. Among these attacks, SQL injection attack malicious input is submitted to manipulate the database in a way that was unintended by the applications' developers is one such attack. This paper proposes an approach for assisting to code verification process on the defense against SQL injection. The approach extracts all such defenses implemented in code. With the use of the proposed approach, developers, testers or auditors can then check the defenses extracted from code to verify their adequacy. We have evaluated the feasibility, effectiveness, and usefulness …
Ibinhunt: Binary Hunting With Inter-Procedural Control Flow, Jiang Ming, Meng Pan, Debin Gao
Ibinhunt: Binary Hunting With Inter-Procedural Control Flow, Jiang Ming, Meng Pan, Debin Gao
Research Collection School Of Computing and Information Systems
Techniques have been proposed to find the semantic differences between two binary programs when the source code is not available. Analyzing control flow, and in particular, intra-procedural control flow, has become an attractive technique in the latest binary diffing tools since it is more resistant to syntactic, but non-semantic, differences. However, this makes such techniques vulnerable to simple function obfuscation techniques (e.g., function inlining) attackers any malware writers could use. In this paper, we first show function obfuscation as an attack to such binary diffing techniques, and then propose iBinHunt which uses deep taint and automatic input generation to find …
Diffusion Of Software Features: An Exploratory Study, Ferdian Thung, David Lo, Lingxiao Jiang
Diffusion Of Software Features: An Exploratory Study, Ferdian Thung, David Lo, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
New features are frequently proposed in many software libraries. These features include new methods, classes, packages, etc. These features are utilized in many open source and commercial software systems. Some of these features are adopted very quickly, while others take a long time to be adopted. Each feature takes much resource to develop, test, and document. Library developers and managers need to decide what feature to prioritize and what to develop next. As a first step to aid these stakeholders, we perform an exploratory study on the diffusion or rate of adoption of features in Java Development Kit (JDK) library. …
Scalable Malware Clustering Through Coarse-Grained Behavior Modeling, Mahinthan Chandramohan, Hee Beng Kuan Tan, Lwin Khin Shar
Scalable Malware Clustering Through Coarse-Grained Behavior Modeling, Mahinthan Chandramohan, Hee Beng Kuan Tan, Lwin Khin Shar
Research Collection School Of Computing and Information Systems
Anti-malware vendors receive several thousand new malware (malicious software) variants per day. Due to large volume of malware samples, it has become extremely important to group them based on their malicious characteristics. Grouping of malware variants that exhibit similar behavior helps to generate malware signatures more efficiently. Unfortunately, exponential growth of new malware variants and huge-dimensional feature space, as used in existing approaches, make the clustering task very challenging and difficult to scale. Furthermore, malware behavior modeling techniques proposed in the literature do not scale well, where malware feature space grows in proportion with the number of samples under examination. …
Action Disambiguation Analysis Using Normalized Google-Like Distance Correlogram, Qianru Sun, Hong Liu
Action Disambiguation Analysis Using Normalized Google-Like Distance Correlogram, Qianru Sun, Hong Liu
Research Collection School Of Computing and Information Systems
Classifying realistic human actions in video remains challenging for existing intro-variability and inter-ambiguity in action classes. Recently, Spatial-Temporal Interest Point (STIP) based local features have shown great promise in complex action analysis. However, these methods have the limitation that they typically focus on Bag-of-Words (BoW) algorithm, which can hardly discriminate actions’ ambiguity due to ignoring of spatial-temporal occurrence relations of visual words. In this paper, we propose a new model to capture this contextual relationship in terms of pairwise features’ co-occurrence. Normalized Google-Like Distance (NGLD) is proposed to numerically measuring this co-occurrence, due to its effectiveness in semantic correlation analysis. …
Automatic Generation Of Provably Correct Embedded Systems, Shang-Wei Lin, Yang Liu, Pao-Ann Hsiung, Jun Sun, Jin Song Dong
Automatic Generation Of Provably Correct Embedded Systems, Shang-Wei Lin, Yang Liu, Pao-Ann Hsiung, Jun Sun, Jin Song Dong
Research Collection School Of Computing and Information Systems
With the demand for new and complicated features, embedded systems are becoming more and more difficult to design and verify. Even if the design of a system is verified, how to guarantee the consistency between the design and its implementation remains a big issue. As a solution, we propose a framework that can help a system designer to model his or her embedded system using a high-level modeling language, verify the design of the system, and automatically generate executable software codes whose behavior semantics are consistent with that of the high-level model. We use two case studies to demonstrate the …