Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (4216)
- Computer Sciences (4213)
- Databases and Information Systems (1558)
- Software Engineering (1254)
- Artificial Intelligence and Robotics (747)
-
- Information Security (730)
- Graphics and Human Computer Interfaces (490)
- Numerical Analysis and Scientific Computing (454)
- Engineering (345)
- Programming Languages and Compilers (269)
- Computer Engineering (232)
- Social and Behavioral Sciences (214)
- Theory and Algorithms (212)
- Business (202)
- OS and Networks (148)
- Communication (103)
- Operations Research, Systems Engineering and Industrial Engineering (101)
- Social Media (83)
- Data Storage Systems (81)
- Medicine and Health Sciences (79)
- Education (66)
- Public Affairs, Public Policy and Public Administration (55)
- Computer and Systems Architecture (52)
- Health Information Technology (51)
- Transportation (51)
- Management Information Systems (49)
- Digital Communications and Networking (47)
- E-Commerce (44)
- Finance and Financial Management (40)
- Higher Education (30)
- Keyword
-
- Deep learning (71)
- Machine learning (59)
- Privacy (41)
- Empirical study (40)
- Deep Learning (35)
-
- Training (34)
- Security (33)
- Task analysis (32)
- Cloud computing (31)
- Data mining (31)
- Artificial intelligence (29)
- Reinforcement learning (29)
- Social media (29)
- Software engineering (29)
- Neural networks (28)
- Android (27)
- Blockchain (27)
- Feature extraction (27)
- Large Language Models (26)
- Model Check (26)
- Access control (25)
- Natural language processing (25)
- Authentication (24)
- Large language models (24)
- Privacy-preserving (24)
- Servers (24)
- Anomaly detection (23)
- Information retrieval (23)
- Visualization (23)
- Classification (22)
- Publication Year
Articles 2971 - 3000 of 4266
Full-Text Articles in Entire DC Network
Integrating Water Exclusion Theory Into Β Contacts To Predict Binding Free Energy Changes And Binding Hot Spots, Qian Liu, Steven C. H. Hoi, Chee Keong Kwoh, Limsoon Wong, Jinyan Li
Integrating Water Exclusion Theory Into Β Contacts To Predict Binding Free Energy Changes And Binding Hot Spots, Qian Liu, Steven C. H. Hoi, Chee Keong Kwoh, Limsoon Wong, Jinyan Li
Research Collection School Of Computing and Information Systems
Binding free energy and binding hot spots at protein-protein interfaces are two important research areas for understanding protein interactions. Computational methods have been developed previously for accurate prediction of binding free energy change upon mutation for interfacial residues. However, a large number of interrupted and unimportant atomic contacts are used in the training phase which caused accuracy loss. Results: This work proposes a new method, β ACV ASA , to predict the change of binding free energy after alanine mutations. β ACV ASA integrates accessible surface area (ASA) and our newly defined β contacts together into an atomic contact vector …
Democracy Is Good For Ranking: Towards Multi-View Rank Learning And Adaptation In Web Search, Wei Gao, Pei Yang
Democracy Is Good For Ranking: Towards Multi-View Rank Learning And Adaptation In Web Search, Wei Gao, Pei Yang
Research Collection School Of Computing and Information Systems
No abstract provided.
Livelabs: Building An In-Situ Real-Time Mobile Experimentation Testbed, Rajesh Krishna Balan, Archan Misra, Youngki Lee
Livelabs: Building An In-Situ Real-Time Mobile Experimentation Testbed, Rajesh Krishna Balan, Archan Misra, Youngki Lee
Research Collection School Of Computing and Information Systems
We present LiveLabs, a mobile experimentation testbed that is currently deployed across our university campus with further deployments at a large shopping mall, a commercial airport, and a resort island soon to follow. The key goal of LiveLabs is to allow in-situ real-time experimentation of mobile applications and services that require context-specific triggers with real participants on their actual smart phones. We describe how LiveLabs works, and then explain the novel R&D required to realise it. We end with a descriptionof the current LiveLabs status (> 700 active participants to date) as well as present some key lessons learned.
Extended Comprehensive Study Of Association Measures For Fault Localization, Lucia Lucia, David Lo, Lingxiao Jiang, Ferdian Thung, Aditya Budi
Extended Comprehensive Study Of Association Measures For Fault Localization, Lucia Lucia, David Lo, Lingxiao Jiang, Ferdian Thung, Aditya Budi
Research Collection School Of Computing and Information Systems
Spectrum-based fault localization is a promising approach to automatically locate root causes of failures quickly. Two well-known spectrum-based fault localization techniques, Tarantula and Ochiai, measure how likely a program element is a root cause of failures based on profiles of correct and failed program executions. These techniques are conceptually similar to association measures that have been proposed in statistics, data mining, and have been utilized to quantify the relationship strength between two variables of interest (e.g., the use of a medicine and the cure rate of a disease). In this paper, we view fault localization as a measurement of the …
An Empirical Study Of Bug Report Field Reassignment, Xin Xia, David Lo, Ming Wen, Shihab Emad, Bo Zhou
An Empirical Study Of Bug Report Field Reassignment, Xin Xia, David Lo, Ming Wen, Shihab Emad, Bo Zhou
Research Collection School Of Computing and Information Systems
A bug report contains many fields, such as product, component, severity, priority, fixer, operating system (OS), platform, etc., which provide important information for the bug triaging and fixing process. It is important to make sure that bug information is correct since previous studies showed that the wrong assignment of bug report fields could increase the bug fixing time, and even delay the delivery of the software. In this paper, we perform an empirical study on bug report field reassignments in open-source software projects. To better understand why bug report fields are reassigned, we manually collect 99 recent bug reports that …
Los And Nlos Classification For Underwater Acoustic Localization, Roee Diamant, Hwee-Pink Tan, Lutz Lampe
Los And Nlos Classification For Underwater Acoustic Localization, Roee Diamant, Hwee-Pink Tan, Lutz Lampe
Research Collection School Of Computing and Information Systems
The low sound speed in water makes propagation delay (PD)-based range estimation attractive for underwater acoustic localization (UWAL). However, due to the long channel impulse response and the existence of reflectors, PD-based UWAL suffers from significant degradation when PD measurements of nonline-of-sight (NLOS) communication links are falsely identified as line-of-sight (LOS). In this paper, we utilize expected variation of PD measurements due to mobility of nodes and present an algorithm to classify the former into LOS and NLOS links. First, by comparing signal strength-based and PD-based range measurements, we identify object-related NLOS (ONLOS) links, where signals are reflected from objects …
Parameter Synthesis For Hierarchical Concurrent Real-Time Systems, Étienne André, Yang Liu, Jun Sun, Jin Song Dong
Parameter Synthesis For Hierarchical Concurrent Real-Time Systems, Étienne André, Yang Liu, Jun Sun, Jin Song Dong
Research Collection School Of Computing and Information Systems
Modeling and verifying complex real-time systems, involving timing delays, are notoriously difficult problems. Checking the correctness of a system for one particular value for each delay does not give any information for other values. It is thus interesting to reason parametrically, by considering that the delays are parameters (unknown constants) and synthesizing a constraint guaranteeing a correct behavior. We present here Parametric Stateful Timed Communicating Sequential Processes, a language capable of specifying and verifying parametric hierarchical real-time systems with complex data structures. Although we prove that the synthesis is undecidable in general, we present several semi-algorithms for efficient parameter synthesis, …
Towards Verification Of Computation Orchestration, Jin Song Dong, Yang Liu, Jun Sun, Xian Zhang
Towards Verification Of Computation Orchestration, Jin Song Dong, Yang Liu, Jun Sun, Xian Zhang
Research Collection School Of Computing and Information Systems
Recently, a promising programming model called Orc has been proposed to support a structured way of orchestrating distributed Web Services. Orc is intuitive because it offers concise constructors to manage concurrent communication, time-outs, priorities, failure of Web Services or communication and so forth. The semantics of Orc is precisely defined. However, there is no automatic verification tool available to verify critical properties against Orc programs. Our goal is to verify the orchestration programs (written in Orc language) which invoke web services to achieve certain goals. To investigate this problem and build useful tools, we explore in two directions. Firstly, we …
Model Checking Approach To Automated Planning, Yi Li, Jin Song Dong, Jing Sun, Yang Liu, Jun Sun
Model Checking Approach To Automated Planning, Yi Li, Jin Song Dong, Jing Sun, Yang Liu, Jun Sun
Research Collection School Of Computing and Information Systems
Model checking provides a way to automatically explore the state space of a finite state system based on desired properties, whereas planning is to produce a sequence of actions that leads from the initial state to the target goal states. Previous research in this field proposed a number of approaches for connecting model checking with planning problem solving. In this paper, we investigate the feasibility of using an established model checking framework, Process Analysis Toolkit (PAT), as a planning solution provider for upper layer applications. To achieve this, we first carry out a number of experiments on different model checking …
Towards Formal Modelling And Verification Of Pervasive Computing Systems, Yan Liu, Xian Zhang, Yang Liu, Jin Song Dong, Jun Sun, Jit Biswas, Mounir Mokhtari
Towards Formal Modelling And Verification Of Pervasive Computing Systems, Yan Liu, Xian Zhang, Yang Liu, Jin Song Dong, Jun Sun, Jit Biswas, Mounir Mokhtari
Research Collection School Of Computing and Information Systems
Smart systems equipped with emerging pervasive computing technologies enable people with limitations to live in their homes independently. However, lack of guarantees for correctness prevent such system to be widely used. Analysing the system with regard to correctness requirements is a challenging task due to the complexity of the system and its various unpredictable faults. In this work, we propose to use formal methods to analyse pervasive computing (PvC) systems. Firstly, a formal modelling framework is proposed to cover the main characteristics of such systems (e.g., context-awareness, concurrent communications, layered architectures). Secondly, we identify the safety requirements (e.g., free of …
Learning Assumptions For Compositional Verification Of Timed Systems, Shang-Wei Lin Lin, Yang Liu, Jun Sun, Jun Sun
Learning Assumptions For Compositional Verification Of Timed Systems, Shang-Wei Lin Lin, Yang Liu, Jun Sun, Jun Sun
Research Collection School Of Computing and Information Systems
Compositional techniques such as assume-guarantee reasoning (AGR) can help to alleviate the state space explosion problem associated with model checking. However, compositional verification is difficult to be automated, especially for timed systems, because constructing appropriate assumptions for AGR usually requires human creativity and experience. To automate compositional verification of timed systems, we propose a compositional verification framework using a learning algorithm for automatic construction of timed assumptions for AGR. We prove the correctness and termination of the proposed learning-based framework, and experimental results show that our method performs significantly better than traditional monolithic timed model checking.
Risk Minimization Of Disjunctive Temporal Problem With Uncertainty, Hoong Chuin Lau, Tuan Anh Hoang
Risk Minimization Of Disjunctive Temporal Problem With Uncertainty, Hoong Chuin Lau, Tuan Anh Hoang
Research Collection School Of Computing and Information Systems
The Disjunctive Temporal Problem with Uncertainty (DTPU) is a fundamental problem that expresses temporal reasoning with both disjunctive constraints and contingency. A recent work (Peintner et al, 2007) develops a complete algorithm for determining Strong Controlla- bility of a DTPU. Such a notion that guarantees 100% confidence of execution may be too conservative in practice. In this paper, following the idea of (Tsamardinos 2002), we are interested to find a schedule that minimizes the risk (i.e. probability of failure) of executing a DTPU. We present a problem decomposition scheme that enables us to compute the probability of failure efficiently, followed …
Privacy-Preserving Ad-Hoc Equi-Join On Outsourced Data, Hwee Hwa Pang, Xuhua Ding
Privacy-Preserving Ad-Hoc Equi-Join On Outsourced Data, Hwee Hwa Pang, Xuhua Ding
Research Collection School Of Computing and Information Systems
In IT outsourcing, a user may delegate the data storage and query processing functions to a third-party server that is not completely trusted. This gives rise to the need to safeguard the privacy of the database as well as the user queries over it. In this article, we address the problem of running ad hoc equi-join queries directly on encrypted data in such a setting. Our contribution is the first solution that achieves constant complexity per pair of records that are evaluated for the join. After formalizing the privacy requirements pertaining to the database and user queries, we introduce a …
How Can Consumer Preferences Be Leveraged For Targeted Upselling In Cable Tv Services?, Bing Tian Dai
How Can Consumer Preferences Be Leveraged For Targeted Upselling In Cable Tv Services?, Bing Tian Dai
Research Collection School Of Computing and Information Systems
Internet TV has attracted a significant amount of attention from the conventional cable TV service providers, by providing customized TV programs at preferred time slots. The cable TV service providers are seeking to retain their customers by giving them a better experience: by understanding their customers’ preferences and upselling them the right products to cater to their interests. It is not easy to understand customer preferences though, since customers are not able to watch channels to which they have not subscribed. This makes it difficult to predict what they will like to watch, as a result. In this paper, I …
Mining Weakly Labeled Web Facial Images For Search-Based Face Annotation, Dayong Wang, Steven C. H. Hoi, Ying He, Jianke Zhu
Mining Weakly Labeled Web Facial Images For Search-Based Face Annotation, Dayong Wang, Steven C. H. Hoi, Ying He, Jianke Zhu
Research Collection School Of Computing and Information Systems
This paper investigates a framework of search-based face annotation (SBFA) by mining weakly labeled facial images that are freely available on the World Wide Web (WWW). One challenging problem for search-based face annotation scheme is how to effectively perform annotation by exploiting the list of most similar facial images and their weak labels that are often noisy and incomplete. To tackle this problem, we propose an effective unsupervised label refinement (ULR) approach for refining the labels of web facial images using machine learning techniques. We formulate the learning problem as a convex optimization and develop effective optimization algorithms to solve …
A Robust Smart Card-Based Anonymous User Authentication Protocol For Wireless Communications, Fengton Wen, Willy Susilo, Guomin Yang
A Robust Smart Card-Based Anonymous User Authentication Protocol For Wireless Communications, Fengton Wen, Willy Susilo, Guomin Yang
Research Collection School Of Computing and Information Systems
Anonymous user authentication is an important but challenging task for wireless communications. In a recent paper, Das proposed a smart cardï based anonymous user authentication protocol for wireless communications. The scheme can protect user privacy and is believed to be secure against a range of network attacks even if the secret information stored in the smart card is compromised. In this paper, we reanalyze the security of Das' scheme, and show that the scheme is in fact insecure against impersonation attacks. We then propose a new smart cardï based anonymous user authentication protocol for wireless communications. Compared with the existing …
Cross-Domain Password-Based Authenticated Key Exchange Revisited, Liqun Chen, Hoon Wei Lim, Guomin Yang
Cross-Domain Password-Based Authenticated Key Exchange Revisited, Liqun Chen, Hoon Wei Lim, Guomin Yang
Research Collection School Of Computing and Information Systems
We revisit the problem of secure cross-domain communication between two users belonging to different security domains within an open and distributed environment. Existing approaches presuppose that either the users are in possession of public key certificates issued by a trusted certificate authority (CA), or the associated domain authentication servers share a long-term secret key. In this article, we propose a generic framework for designing four-party password-based authenticated key exchange (4PAKE) protocols. Our framework takes a different approach from previous work. The users are not required to have public key certificates, but they simply reuse their login passwords, which they share …
Coupling Graphs, Efficient Algorithms And B-Cell Epitope Prediction, Liang Zhao, Steven C. H. Hoi, Zhenhua Li, Limsoon Wong, Hung Nguyen
Coupling Graphs, Efficient Algorithms And B-Cell Epitope Prediction, Liang Zhao, Steven C. H. Hoi, Zhenhua Li, Limsoon Wong, Hung Nguyen
Research Collection School Of Computing and Information Systems
Coupling graphs are newly introduced in this paper to meet many application needs particularly in the field of bioinformatics. A coupling graph is a two-layer graph complex, in which each node from one layer of the graph complex has at least one connection with the nodes in the other layer, and vice versa. The coupling graph model is sufficiently powerful to capture strong and inherent associations between subgraph pairs in complicated applications. The focus of this paper is on mining algorithms of frequent coupling subgraphs and bioinformatics application. Although existing frequent subgraph mining algorithms are competent to identify frequent subgraphs …
Loki: A Privacy-Conscious Platform For Crowdsourced Surveys, Thivya Kandappu, Vijay Sivaraman, Arik Friedman, Roksana Boreli
Loki: A Privacy-Conscious Platform For Crowdsourced Surveys, Thivya Kandappu, Vijay Sivaraman, Arik Friedman, Roksana Boreli
Research Collection School Of Computing and Information Systems
Emerging platforms such as Amazon Mechanical Turk and Google Consumer Surveys are increasingly being used by researchers and market analysts to crowdsource large-scale survey data from on-line populations at extremely low-cost. However, by participating in successive surveys, users risk being profiled and targeted, both by surveyors and by the platform itself. In this paper we propose, develop, and evaluate the design of a crowdsourcing platform, called Loki, that is privacy conscious. Our contributions are three-fold: (a) We propose Loki, a system that allows users to obfuscate their (ratings-based or multiple-choice) responses at-source based on their chosen privacy level, and gives …
Strategic Decision Support System Using Heuristic Algorithm For Practical Outlet Zones Allocation To Dealers In A Beer Supply Distribution Network, Michelle Lee Fong Cheong
Strategic Decision Support System Using Heuristic Algorithm For Practical Outlet Zones Allocation To Dealers In A Beer Supply Distribution Network, Michelle Lee Fong Cheong
Research Collection School Of Computing and Information Systems
We consider a two-echelon beer supply distribution network with the brewer replenishing the dealers and the dealers serving the outlet zones directly, for multiple product types. The allocation of the outlet zones to the dealers will determine the quantity of products the brewer replenishes each dealer, which will in turn impact the total warehousing and transportation costs. The non-linear optimization model formulated is difficult to solve to optimality, and the model itself does not include practical business considerations in the distribution business. A heuristics algorithm is designed and easily implemented using spreadsheets with Visual Basic programming to effectively and efficiently …
Measuring And Modelling The Thermal Performance Of The Tamar Suspension Bridge Using A Wireless Sensor Network, Nicholas De Battista, James M. W. Brownjohn, Hwee-Pink Tan, Ki Young Koo
Measuring And Modelling The Thermal Performance Of The Tamar Suspension Bridge Using A Wireless Sensor Network, Nicholas De Battista, James M. W. Brownjohn, Hwee-Pink Tan, Ki Young Koo
Research Collection School Of Computing and Information Systems
A study on the thermal performance of the Tamar Suspension Bridge deck in Plymouth, UK, is presented in this paper. Ambient air, suspension cable, deck and truss temperatures were acquired using a wired sensor system. Deck extension data were acquired using a two-hop wireless sensor network. Empirical models relating the deck extension to various combinations of temperatures were derived and compared. The most accurate model, which used all the four temperature variables, predicted the deck extension with an accuracy of 99.4%. Time delays ranging from 10 to 66 min were identified between the daily cycles of the air temperature and …
On The Security Of Auditing Mechanisms For Secure Cloud Storage, Yong Yu, Lei Niu, Guomin Yang, Yi Mu, Willy Susilo
On The Security Of Auditing Mechanisms For Secure Cloud Storage, Yong Yu, Lei Niu, Guomin Yang, Yi Mu, Willy Susilo
Research Collection School Of Computing and Information Systems
Cloud computing is a novel computing model that enables convenient and on-demand access to a shared pool of configurable computing resources. Auditing services are highly essential to make sure that the data is correctly hosted in the cloud. In this paper, we investigate the active adversary attacks in three auditing mechanisms for shared data in the cloud, including two identity privacy-preserving auditing mechanisms called Oruta and Knox, and a distributed storage integrity auditing mechanism.We show that these schemes become insecure when active adversaries are involved in the cloud storage. Specifically, an active adversary can arbitrarily alter the cloud data without …
Complexity Of The Soundness Problem Of Workflow Nets, Guan Jun Liu, Jun Sun, Yang Liu, Jin Song Dong
Complexity Of The Soundness Problem Of Workflow Nets, Guan Jun Liu, Jun Sun, Yang Liu, Jin Song Dong
Research Collection School Of Computing and Information Systems
Classical workflow nets (WF-nets for short) are an important subclass of Petri nets that are widely used to model and analyze workflow systems. Soundness is a crucial property of workflow systems and guarantees that these systems are deadlock-free and bounded. Aalst et al. proved that the soundness problem is decidable for WF-nets and can be polynomially solvable for free-choice WF-nets. This paper proves that the soundness problem is PSPACE-hard for WF-nets. Furthermore, it is proven that the soundness problem is PSPACE-complete for bounded WF-nets. Based on the above conclusion, it is derived that the soundness problem is also PSPACE-complete for …
On Empirical Validation Of Compactness Measures For Electoral Redistricting And Its Significance For Application Of Models In The Social Sciences, Christine Chou, Steven O. Kimbrough, Frederic H. Murphy, John Sullivan-Fedock, C. Jason Woodard
On Empirical Validation Of Compactness Measures For Electoral Redistricting And Its Significance For Application Of Models In The Social Sciences, Christine Chou, Steven O. Kimbrough, Frederic H. Murphy, John Sullivan-Fedock, C. Jason Woodard
Research Collection School Of Computing and Information Systems
Use of optimization models in science and policy applications is often problematic because the best available models are very inaccurate representations of the originating problems. Such is the case with electoral districting models, for which there exist no generally accepted measures of compactness, in spite of many proposals and much analytical study. This article reports on an experimental investigation of subjective judgments of compactness for electoral districts. The experiment draws on a unique database of 116 distinct, legally valid districting plans for the Philadelphia City Council, discovered with evolutionary computation. Subjects in the experiment displayed, in the aggregate, remarkable agreement …
Two Formulas For Success In Social Media: Social Learning And Network Effects, Liangfei Qiu, Qian Tang, Andrew B. Whinston
Two Formulas For Success In Social Media: Social Learning And Network Effects, Liangfei Qiu, Qian Tang, Andrew B. Whinston
Research Collection School Of Computing and Information Systems
This paper examines social learning and network effects that are particularly important for online videos, considering the limited marketing campaigns of user-generated content. Rather than combining both social learning and network effects under the umbrella of social contagion or peer influence, we develop a theoretical model and empirically identify social learning and network effects separately. Using a unique data set from YouTube, we find that both mechanisms have statistically and economically significant effects on video views, and which mechanism dominates depends on the specific video type.
Coupling Alignments With Recognition For Still-To-Video Face Recognition, Zhiwu Huang, X. Zhao, S. Shan, R. Wang, X. Chen
Coupling Alignments With Recognition For Still-To-Video Face Recognition, Zhiwu Huang, X. Zhao, S. Shan, R. Wang, X. Chen
Research Collection School Of Computing and Information Systems
The Still-to-Video (S2V) face recognition systems typically need to match faces in low-quality videos captured under unconstrained conditions against high quality still face images, which is very challenging because of noise, image blur, low face resolutions, varying head pose, complex lighting, and alignment difficulty. To address the problem, one solution is to select the frames of `best quality' from videos (hereinafter called quality alignment in this paper). Meanwhile, the faces in the selected frames should also be geometrically aligned to the still faces offline well-aligned in the gallery. In this paper, we discover that the interactions among the three tasks-quality …
Towards A Hybrid Framework For Detecting Input Manipulation Vulnerabilities, Sun Ding, Hee Beng Kuan Tan, Lwin Khin Shar, Bindu Madhavi Padmanabhuni
Towards A Hybrid Framework For Detecting Input Manipulation Vulnerabilities, Sun Ding, Hee Beng Kuan Tan, Lwin Khin Shar, Bindu Madhavi Padmanabhuni
Research Collection School Of Computing and Information Systems
Input manipulation vulnerabilities such as SQL Injection, Cross-site scripting, Buffer Overflow vulnerabilities are highly prevalent and pose critical security risks. As a result, many methods have been proposed to apply static analysis, dynamic analysis or a combination of them, to detect such security vulnerabilities. Most of the existing methods classify vulnerabilities into safe and unsafe. They have both false-positive and false-negative cases. In general, security vulnerability can be classified into three cases: (1) provable safe, (2) provable unsafe, (3) unsure. In this paper, we propose a hybrid framework-Detecting Input Manipulation Vulnerabilities (DIMV), to verify the adequacy of security vulnerability defenses …
A Secure And Effective Anonymous User Authentication Scheme For Roaming Service In Global Mobility Networks, Fengtong Wen, Willy Susilo, Guomin Yang
A Secure And Effective Anonymous User Authentication Scheme For Roaming Service In Global Mobility Networks, Fengtong Wen, Willy Susilo, Guomin Yang
Research Collection School Of Computing and Information Systems
In global mobility networks, anonymous user authentication is an essential task for enabling roaming service. In a recent paper, Jiang et al. proposed a smart card based anonymous user authentication scheme for roaming service in global mobility networks. This scheme can protect user privacy and is believed to have many abilities to resist a range of network attacks, even if the secret information stored in the smart card is compromised. In this paper, we analyze the security of Jiang et al.’s scheme, and show that the scheme is in fact insecure against the stolen-verifier attack and replay attack. Then, we …
A Dynamic Programming Approach To Achieving An Optimal End State Along A Serial Production Line, Shih-Fen Cheng, Blake E. Nicholson, Marina A. Epelman, Daniel J. Reaume, Robert L. Smith
A Dynamic Programming Approach To Achieving An Optimal End State Along A Serial Production Line, Shih-Fen Cheng, Blake E. Nicholson, Marina A. Epelman, Daniel J. Reaume, Robert L. Smith
Research Collection School Of Computing and Information Systems
In modern production systems, it is critical to perform maintenance, calibration, installation, and upgrade tasks during planned downtime. Otherwise, the systems become unreliable and new product introductions are delayed. For reasons of safety, testing, and access, task performance often requires the vicinity of impacted equipment to be left in a specific “end state” when production halts. Therefore, planning the shutdown of a production system to balance production goals against enabling non-production tasks yields a challenging optimization problem. In this paper, we propose a mathematical formulation of this problem and a dynamic programming approach that efficiently finds optimal shutdown policies for …
An Efficient Partial Shape Matching Algorithm For 3d Tooth Recognition, Zhiyuan Zhang, Xin Zhong, Sim Heng Ong, Kelvin W. C. Foong
An Efficient Partial Shape Matching Algorithm For 3d Tooth Recognition, Zhiyuan Zhang, Xin Zhong, Sim Heng Ong, Kelvin W. C. Foong
Research Collection School Of Computing and Information Systems
As a new biometric strategy, tooth recognition has drawn much attention in recent years. However, most existing work focus mainly on 2D dental radiographs which are less informative and vulnerable to noise and pose variance. Although there are already several attempts on 3D tooth recognition, the results are still inaccurate and performance is inefficient. Moreover, existing methods cannot recognize precisely when the post-mortem data contains incomplete teeth. In this work, we propose an efficient and accurate partial shape matching algorithm to recognize 3D teeth for human identification. Given the ante-mortem and post-mortem teeth models which were taken from patients using …