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 3841 - 3870 of 4266
Full-Text Articles in Entire DC Network
Osprey: A Practical Type System For Validating Dimensional Unit Correctness Of C Programs, Lingxiao Jiang, Zhendong Su
Osprey: A Practical Type System For Validating Dimensional Unit Correctness Of C Programs, Lingxiao Jiang, Zhendong Su
Research Collection School Of Computing and Information Systems
Misuse of measurement units is a common source of errors in scientific applications, but standard type systems do not prevent such errors. Dimensional analysis in physics can be used to manually detect such errors in physical equations. It is, however, not feasible to perform such manual analysis for programs computing physical equations because of code complexity. In this paper, we present a type system to automatically detect potential errors involving measurement units. It is constraint-based: we model units as types and flow of units as constraints. However, standard type checking algorithms are not powerful enough to handle units because of …
Gestalt-Based Feature Similarity Measure In Trademark Database, Hui Jiang, Chong-Wah Ngo, Hung-Khoon Tan
Gestalt-Based Feature Similarity Measure In Trademark Database, Hui Jiang, Chong-Wah Ngo, Hung-Khoon Tan
Research Collection School Of Computing and Information Systems
Motivated by the studies in Gestalt principle, this paper describes a novel approach on the adaptive selection of visual features for trademark retrieval. We consider five kinds of visual saliencies: symmetry, continuity, proximity, parallelism and closure property. The first saliency is based on Zernike moments, while the others are modeled by geometric elements extracted illusively as a whole from a trademark. Given a query trademark, we adaptively determine the features appropriate for retrieval by investigating its visual saliencies. We show that in most cases, either geometric or symmetric features can give us good enough accuracy. To measure the similarity of …
Discovering Causal Dependencies In Mobile Context-Aware Recommenders, Ghim-Eng Yap, Ah-Hwee Tan, Hwee Hwa Pang
Discovering Causal Dependencies In Mobile Context-Aware Recommenders, Ghim-Eng Yap, Ah-Hwee Tan, Hwee Hwa Pang
Research Collection School Of Computing and Information Systems
Mobile context-aware recommender systems face unique challenges in acquiring context. Resource limitations make minimizing context acquisition a practical need, while the uncertainty inherent to the mobile environment makes missing context values a major concern. This paper introduces a scalable mechanism based on Bayesian network learning in a tiered context model to overcome both of these challenges. Extensive experiments on a restaurant recommender system showed that our mechanism can accurately discover causal dependencies among context, thereby enabling the effective identification of the minimal set of important context for a specific user and task, as well as providing highly accurate recommendations even …
Clip-Based Similarity Measure For Query-Dependent Clip Retrieval And Video Summarization, Yuxin Peng, Chong-Wah Ngo
Clip-Based Similarity Measure For Query-Dependent Clip Retrieval And Video Summarization, Yuxin Peng, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
This paper proposes a new approach and algorithm for the similarity measure of video clips. The similarity is mainly based on two bipartite graph matching algorithms: maximum matching (MM) and optimal matching (OM). MM is able to rapidly filter irrelevant video clips, while OM is capable of ranking the similarity of clips according to visual and granularity factors. We apply the similarity measure for two tasks: retrieval and summarization. In video retrieval, a hierarchical retrieval framework is constructed based on MM and OM. The validity of the framework is theoretically proved and empirically verified on a video database of 21 …
Winning Back The Cup For Distributed Pomdps: Planning Over Continuous Belief Spaces, Pradeep Varakantham, Ranjit Nair, Milind Tambe, Makoto Yokoo
Winning Back The Cup For Distributed Pomdps: Planning Over Continuous Belief Spaces, Pradeep Varakantham, Ranjit Nair, Milind Tambe, Makoto Yokoo
Research Collection School Of Computing and Information Systems
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms have been proposed to obtain locally or globally optimal policies. Unfortunately, most of these algorithms have either been explicitly designed or experimentally evaluated assuming knowledge of a starting belief point, an assumption that often does not hold in complex, uncertain domains. Instead, in such domains, it is important for agents to explicitly plan over continuous belief spaces. This paper provides a novel algorithm to explicitly compute finite horizon policies over continuous belief spaces, without restricting the space of …
Real-Time Non-Rigid Shape Recovery Via Active Appearance Models For Augmented Reality, Jianke Zhu, Steven C. H. Hoi, Michael R. Lyu
Real-Time Non-Rigid Shape Recovery Via Active Appearance Models For Augmented Reality, Jianke Zhu, Steven C. H. Hoi, Michael R. Lyu
Research Collection School Of Computing and Information Systems
One main challenge in Augmented Reality (AR) applications is to keep track of video objects with their movement, orientation, size, and position accurately. This poses a challenging task to recover nonrigid shape and global pose in real-time AR applications. This paper proposes a novel two-stage scheme for online non-rigid shape recovery toward AR applications using Active Appearance Models (AAMs). First, we construct 3D shape models from AAMs offline, which do not involve processing of the 3D scan data. Based on the computed 3D shape models, we propose an efficient online algorithm to estimate both 3D pose and non-rigid shape parameters …
Evaluation Of Time-Varying Availability In Multi-Echelon Spare Parts Systems With Passivation, Hoong Chuin Lau, Huawei Song, Chuen Teck See, Siew Yen Cheng
Evaluation Of Time-Varying Availability In Multi-Echelon Spare Parts Systems With Passivation, Hoong Chuin Lau, Huawei Song, Chuen Teck See, Siew Yen Cheng
Research Collection School Of Computing and Information Systems
The popular models for repairable item inventory, both in the literature as well as practical applications, assume that the demands for items are independent of the number of working systems. However this assumption can introduce a serious underestimation of availability when the number of working systems is small, the failure rate is high or the repair time is long. In this paper, we study a multi-echelon repairable item inventory system under the phenomenon of passivation, i.e. serviceable items are passivated (“switched off”) upon system failure. This work is motivated by corrective maintenance of high-cost technical equipment in the miltary. We …
Enterprise Agility And The Enabling Role Of Information Technology, Eric Overby, Anandhi S. Bharadwaj, V. Sambamurthy
Enterprise Agility And The Enabling Role Of Information Technology, Eric Overby, Anandhi S. Bharadwaj, V. Sambamurthy
Research Collection School Of Computing and Information Systems
In turbulent environments, enterprise agility, that is, the ability of firms to sense environmental change and respond readily, is an important determinant of firm success. We define and deconstruct enterprise agility, delineate enterprise agility from similar concepts in the business research literature, explore the underlying capabilities that support enterprise agility, explicate the enabling role of information technology (IT) and digital options, and propose a method for measuring enterprise agility. The concepts in this paper are offered as foundational building blocks for the overall research program on enterprise agility and the enabling role of IT.
Anonymous Signature Schemes, Guomin Yang, Duncan S. Wong, Xiaotie Deng, Huaxiong Wang
Anonymous Signature Schemes, Guomin Yang, Duncan S. Wong, Xiaotie Deng, Huaxiong Wang
Research Collection School Of Computing and Information Systems
Digital signature is one of the most important primitives in public key cryptography. It provides authenticity, integrity and non-repudiation to many kinds of applications. On signer privacy however, it is generally unclear or suspicious of whether a signature scheme itself can guarantee the anonymity of the signer. In this paper, we give some affirmative answers to it. We formally define the signer anonymity for digital signature and propose some schemes of this type. We show that a signer anonymous signature scheme can be very useful by proposing a new anonymous key exchange protocol which allows a client Alice to establish …
A Practical Password-Based Two-Server Authentication And Key Exchange System, Yanjiang Yang, Robert H. Deng, Feng Bao
A Practical Password-Based Two-Server Authentication And Key Exchange System, Yanjiang Yang, Robert H. Deng, Feng Bao
Research Collection School Of Computing and Information Systems
Most password-based user authentication systems place total trust on the authentication server where cleartext passwords or easily derived password verification data are stored in a central database. Such systems are, thus, by no means resilient against offline dictionary attacks initiated at the server side. Compromise of the authentication server by either outsiders or insiders subjects all user passwords to exposure and may have serious legal and financial repercussions to an organization. Recently, several multiserver password systems were proposed to circumvent the single point of vulnerability inherent in the single-server architecture. However, these multiserver systems are difficult to deploy and operate …
A Unified Log-Based Relevance Feedback Scheme For Image Retrieval, Steven Hoi, Michael R. Lyu, Rong Jin
A Unified Log-Based Relevance Feedback Scheme For Image Retrieval, Steven Hoi, Michael R. Lyu, Rong Jin
Research Collection School Of Computing and Information Systems
Relevance feedback has emerged as a powerful tool to boost the retrieval performance in content-based image retrieval (CBIR). In the past, most research efforts in this field have focused on designing effective algorithms for traditional relevance feedback. Given that a CBIR system can collect and store users' relevance feedback information in a history log, an image retrieval system should be able to take advantage of the log data of users' feedback to enhance its retrieval performance. In this paper, we propose a unified framework for log-based relevance feedback that integrates the log of feedback data into the traditional relevance feedback …
Fortifying Password Authentication In Integrated Healthcare Delivery Systems, Yanjiang Yang, Robert H. Deng, Feng Bao
Fortifying Password Authentication In Integrated Healthcare Delivery Systems, Yanjiang Yang, Robert H. Deng, Feng Bao
Research Collection School Of Computing and Information Systems
Integrated Delivery Systems (IDSs) now become a primary means of care provision in healthcare domain. However, existing password systems (under either the single-server model or the multi-server model) do not provide adequate security when applied to IDSs. We are thus motivated to present a practical password authentication system built upon a novel two-server model. We generalize the two-server model to an architecture of a single control server supporting multiple service servers, tailored to the organizational structure of IDSs. The underlying user authentication and key exchange protocols we propose are password-only, neat, efficient, and robust against off-line dictionary attacks mounted by …
Threading And Autodocumenting News Videos: A Promising Solution To Rapidly Browse News Topics, Xiao Wu, Chong-Wah Ngo, Qing Li
Threading And Autodocumenting News Videos: A Promising Solution To Rapidly Browse News Topics, Xiao Wu, Chong-Wah Ngo, Qing Li
Research Collection School Of Computing and Information Systems
This paper describes the techniques in threading and autodocumenting news stories according to topic themes. Initially, we perform story clustering by exploiting the duality between stories and textual-visual concepts through a co-clustering algorithm. The dependency among stories of a topic is tracked by exploring the textual-visual novelty and redundancy of stories. A novel topic structure that chains the dependencies of stories is then presented to facilitate the fast navigation of the news topic. By pruning the peripheral and redundant news stories in the topic structure, a main thread is extracted for autodocumentary
Splash: Systematic Proteomics Laboratory Analysis And Storage Hub, Siaw Ling Lo, You Tao, Qingsong Lin, Shashikant B. Joshi, Maxey Chung, Choy Leong Hew
Splash: Systematic Proteomics Laboratory Analysis And Storage Hub, Siaw Ling Lo, You Tao, Qingsong Lin, Shashikant B. Joshi, Maxey Chung, Choy Leong Hew
Research Collection School Of Computing and Information Systems
In the field of proteomics, the increasing difficulty to unify the data format, due to the different platforms/instrumentation and laboratory documentation systems, greatly hinders experimental data verification, exchange, and comparison. Therefore, it is essential to establish standard formats for every necessary aspect of proteomics data. One of the recently published data models is the proteomics experiment data repository [Taylor, C. F., Paton, N. W., Garwood, K. L., Kirby, P. D. et al., Nat. Biotechnol. 2003, 21, 247-254]. Compliant with this format, we developed the systematic proteomics laboratory analysis and storage hub (SPLASH) database system as an informatics infrastructure to support …
Publicly Verifiable Ownership Protection For Relational Databases, Yingjiu Li, Robert H. Deng
Publicly Verifiable Ownership Protection For Relational Databases, Yingjiu Li, Robert H. Deng
Research Collection School Of Computing and Information Systems
Today, watermarking techniques have been extended from the multimedia context to relational databases so as to protect the ownership of data even after the data are published or distributed. However, all existing watermarking schemes for relational databases are secret key based, thus require a secret key to be presented in proof of ownership. This means that the ownership can only be proven once to the public (e.g., to the court). After that, the secret key is known to the public and the embedded watermark can be easily destroyed by malicious users. Moreover, most of the existing techniques introduce distortions to …
Robust Classification Of Eeg Signal For Brain-Computer Interface, Manoj Thulasidas, Cuntai Guan, Jiankang Wu
Robust Classification Of Eeg Signal For Brain-Computer Interface, Manoj Thulasidas, Cuntai Guan, Jiankang Wu
Research Collection School Of Computing and Information Systems
We report the implementation of a text input application (speller) based on the P300 event related potential. We obtain high accuracies by using an SVM classifier and a novel feature. These techniques enable us to maintain fast performance without sacrificing the accuracy, thus making the speller usable in an online mode. In order to further improve the usability, we perform various studies on the data with a view to minimizing the training time required. We present data collected from nine healthy subjects, along with the high accuracies (of the order of 95% or more) measured online. We show that the …
Scalable Authentication Of Mpeg-4 Streams, Yongdong Wu, Robert H. Deng
Scalable Authentication Of Mpeg-4 Streams, Yongdong Wu, Robert H. Deng
Research Collection School Of Computing and Information Systems
This paper presents three scalable and efficient schemes for authenticating MPEG-4 streams: the Flat Authentication Scheme, the Progressive Authentication Scheme, and the Hierarchical Authentication Scheme. All the schemes allow authentication of MPEG-4 streams over lossy networks by integrating seamlessly digital signatures and erasure correction coding with MPEG-4's fine granular scalability. A prominent feature of our schemes is their "sign once, verify many ways" property, i.e., they generate only one digital signature per compressed MPEG-4 object group, but allow clients to verify the authenticity of any down-scaled version of the original signed object group.
Energy Efficiency And Capacity For Tcp Traffic In Multi-Hop Wireless Networks, Sorav Bansal, Rajeev Shorey, Rajeev Gupta, Archan Misra
Energy Efficiency And Capacity For Tcp Traffic In Multi-Hop Wireless Networks, Sorav Bansal, Rajeev Shorey, Rajeev Gupta, Archan Misra
Research Collection School Of Computing and Information Systems
We study the performance metrics associated with TCP-regulated traffic in multi-hop, wireless networks that use a common physical channel (e.g., IEEE 802.11). In contrast to earlier analyses, we focus simultaneously on two key operating metrics—the energy efficiency and the transport-layer (TCP) throughput. Using analysis and simulations, we show how these metrics are strongly influenced by the radio transmission range of individual nodes. Due to tradeoffs between the individual packet transmission energy and the likelihood of retransmissions, the total energy consumption is a convex function of the number of hops (and hence, of the transmission range). On the other hand, the …
Design Synthesis From Interaction And State-Based Specifications, Jun Sun, Jin Song Dong
Design Synthesis From Interaction And State-Based Specifications, Jun Sun, Jin Song Dong
Research Collection School Of Computing and Information Systems
Interaction-based and state-based modeling are two complementary approaches of behavior modeling. The former focuses on global interactions between system components. The latter concentrates on the internal states of individual components. Both approaches have been proven useful in practice. One challenging and important research objective is to combine the modeling power of both effectively and then use the combination as the basis for automatic design synthesis. We present a combination of interaction-based and state-based modeling, namely, Live Sequence Charts and Z, for system specification. We then propose a way of generating distributed design from the combinations. Our approach handles systems with …
The Roles Of Digital Libraries In Teaching And Learning Geography, Chew-Hung Chang, John Hedberg, Tiong-Sa Teh, Ee Peng Lim
The Roles Of Digital Libraries In Teaching And Learning Geography, Chew-Hung Chang, John Hedberg, Tiong-Sa Teh, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Adopting a problem-centred approach helps students to learn Geography more effectively as they are able to identify and generalize about where different resources or activities are spatially located and they learn to associate certain patterns and processes with geographical changes. In an era where web-based student-centred inquiry is gaining popularity as a mode of learning Geography, the role of digital libraries as delivery trucks (in Clark’s terminology, 1983) needs to be better understood. An obvious affordance of the digital library is that it organizes information around themes for problems to be solved. This paper describes a developmental project to build …
Multiagent Teamwork: Hybrid Approaches, Praveen Paruchuri, Emma Bowring, Ranjit Nair, Jonathan Pearce, Nathan Schurr, Milind Tambe, Pradeep Varakantham
Multiagent Teamwork: Hybrid Approaches, Praveen Paruchuri, Emma Bowring, Ranjit Nair, Jonathan Pearce, Nathan Schurr, Milind Tambe, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Today within the multiagent community, we see at least four competing methods to building multiagent systems: beliefdesireintention (BDI), distributed constraint optimization (DCOP), distributed POMDPs, and auctions or game-theoretic methods. While there is exciting progress within each approach, there is a lack of cross-cutting research. This article highlights the various hybrid techniques for multiagent teamwork developed by the teamcore group. In particular, for the past decade, the TEAMCORE research group has focused on building agent teams in complex, dynamic domains. While our early work was inspired by BDI, we will present an overview of recent research that uses DCOPs and distributed …
Efficient Mining Of Group Patterns From User Movement Data, Yida Wang, Ee Peng Lim, San-Yih Hwang
Efficient Mining Of Group Patterns From User Movement Data, Yida Wang, Ee Peng Lim, San-Yih Hwang
Research Collection School Of Computing and Information Systems
In this paper, we present a new approach to derive groupings of mobile users based on their movement data. We assume that the user movement data are collected by logging location data emitted from mobile devices tracking users. We formally define group pattern as a group of users that are within a distance threshold from one another for at least a minimum duration. To mine group patterns, we first propose two algorithms, namely AGP and VG-growth. In our first set of experiments, it is shown when both the number of users and logging duration are large, AGP and VG-growth are …
Advances In Data Modeling Research, G. Allen, A. Bajaj, V. Khatri, S. Ram, Keng Siau
Advances In Data Modeling Research, G. Allen, A. Bajaj, V. Khatri, S. Ram, Keng Siau
Research Collection School Of Computing and Information Systems
In this paper, we summarize the discussions of the panel on "Advances in Data Modeling Research," held at the Americas Conference on Information Systems (AMCIS) in 2005. We focus on four primary areas where data modeling research offers rich opportunities: spatio-temporal semantics, genome research, ontological analysis and empirical evaluation of existing models. We highlight past work in each area and also discuss open questions, with a view to promoting future research in the overall data modeling area.
Grid-Partition Index: A Hybrid Approach To Nearest-Neighbor Queries In Wireless Location-Based Services, Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lun Lee
Grid-Partition Index: A Hybrid Approach To Nearest-Neighbor Queries In Wireless Location-Based Services, Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lun Lee
Research Collection School Of Computing and Information Systems
Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on the locations of data objects: using some distance heuristics on object locations. The latter is built on a precomputed solution space. Thus, NN queries can be reduced to and processed as simple point queries in this solution space. Both approaches exhibit some disadvantages, especially when employed for wireless data broadcast in mobile computing environments. In this paper, we introduce a new index method, called the grid-partition index, to support NN search in both ondemand access and periodic broadcast …
Towards Better Quality Specification Miners, David Lo, Siau-Cheng Khoo
Towards Better Quality Specification Miners, David Lo, Siau-Cheng Khoo
Research Collection School Of Computing and Information Systems
Softwares are often built without specification. Tools to automatically extract specification from software are needed and many techniques have been proposed. One type of these specifications – temporal API specification – is often specified in the form of automaton (i.e., FSA/PFSA). There have been many work on mining software temporal specification using dynamic analysis techniques; i.e., analysis of software program traces. Unfortunately, the issues of scalability, robustness and accuracy of these techniques have not been comprehensively addressed. In this paper, we describe a framework that enables assessments of the performance of a specification miner in generating temporal specification of software …
Improving The Quality Of Conceptual Modeling Using Cognitive Mapping Techniques, Keng Siau, X. Tan
Improving The Quality Of Conceptual Modeling Using Cognitive Mapping Techniques, Keng Siau, X. Tan
Research Collection School Of Computing and Information Systems
Conceptual modeling involves the understanding and communication between system analysts and end-users. Many factors may affect the quality of conceptual modeling processes as well as the models per se. Human cognition plays a pivotal role in understanding these factors and cognitive mapping techniques are effective tools to elicit and represent human cognition. In this paper, we look at the use of cognitive mapping techniques to improve the quality of conceptual modeling. We review frameworks on quality in conceptual modeling and examine the role of human cognition in conceptual modeling. The paper also discusses how human cognition is related to quality …
New Efficient Mds Array Codes For Raid Part Ii: Rabin-Like Codes For Tolerating Multiple (>=4) Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao
New Efficient Mds Array Codes For Raid Part Ii: Rabin-Like Codes For Tolerating Multiple (>=4) Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao
Research Collection School Of Computing and Information Systems
A new class of Binary Maximum Distance Separable (MDS) array codes which are based on circular permutation matrices are introduced in this paper. These array codes are used for tolerating multiple (greater than or equal to 4) disk failures in Redundant Arrays of Inexpensive Disks (RAID) architecture. The size of the information part is m \times n, where n is the number of information disks and (m+1) is a prime integer; the size of the parity-check part is m \times r, the minimum distance is r+1, and the number of parity-check disks is r. In practical applications, m can be …
Matrix: Adaptive Middleware For Distributed Multiplayer Games, Rajesh Krishna Balan, Maria Ebling, Paul Castro, Archan Misra
Matrix: Adaptive Middleware For Distributed Multiplayer Games, Rajesh Krishna Balan, Maria Ebling, Paul Castro, Archan Misra
Research Collection School Of Computing and Information Systems
Building a distributed middleware infrastructure that provides the low latency required for massively multiplayer games while still maintaining consistency is non-trivial. Previous attempts have used static partitioning or client-based peer-to-peer techniques that do not scale well to a large number of players, perform poorly under dynamic workloads or hotspots, and impose significant programming burdens on game developers. We show that it is possible to build a scalable distributed system, called Matrix, that is easily usable by game developers. We show experimentally that Matrix provides good performance, especially when hotspots occur.
Sequential Aggregate Signatures Working Over Independent Homomorphic Trapdoor One-Way Permutation Domains, Huafei Zhu, Feng Bao, Robert H. Deng
Sequential Aggregate Signatures Working Over Independent Homomorphic Trapdoor One-Way Permutation Domains, Huafei Zhu, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
The contribution of this paper has two folds. In the first fold, we propose a generic construction of sequential aggregate signatures from families of certificated trapdoor one-way permutations. We show that our construction is provably secure in the random oracle model assuming that the underlying homomorphic permutations are trapdoor one-way. Compared to Lysyanskaya et al’s generic construction that is constructed from a trapdoor one-way permutation family working over the same domain [16], our scheme works over independent trapdoor one-way permutation domains. The flexible choice of the underlying permutation domains benefits our scheme to its applications in the real world where …
An Efficient And Robust Computational Framework For Studying Lifetime And Information Capacity In Sensor Networks, Enrique J. Duarte-Melo, Mingyan Liu, Archan Misra
An Efficient And Robust Computational Framework For Studying Lifetime And Information Capacity In Sensor Networks, Enrique J. Duarte-Melo, Mingyan Liu, Archan Misra
Research Collection School Of Computing and Information Systems
In this paper we investigate the expected lifetime and information capacity, defined as the maximum amount of data (bits) transferred before the first sensor node death due to energy depletion, of a data-gathering wireless sensor network. We develop a fluid-flow based computational framework that extends the existing approach, which requires precise knowledge of the layout/deployment of the network, i.e., exact sensor positions. Our method, on the other hand, views a specific network deployment as a particular instance (sample path) from an underlying distribution of sensor node layouts and sensor data rates. To compute the expected information capacity under this distribution-based …