Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (3555)
- Software Engineering (2197)
- Artificial Intelligence and Robotics (1881)
- Information Security (1102)
- Numerical Analysis and Scientific Computing (1060)
-
- Graphics and Human Computer Interfaces (942)
- Engineering (884)
- Social and Behavioral Sciences (807)
- Business (748)
- Theory and Algorithms (514)
- Computer Engineering (449)
- Programming Languages and Compilers (413)
- Operations Research, Systems Engineering and Industrial Engineering (407)
- OS and Networks (345)
- Communication (326)
- Social Media (264)
- Public Affairs, Public Policy and Public Administration (230)
- Medicine and Health Sciences (196)
- Education (194)
- Transportation (194)
- Management Information Systems (176)
- Data Storage Systems (167)
- E-Commerce (154)
- International and Area Studies (147)
- Technology and Innovation (146)
- Asian Studies (145)
- Health Information Technology (118)
- Higher Education (105)
- Keyword
-
- Machine learning (145)
- Deep learning (129)
- Artificial intelligence (123)
- Social media (82)
- Singapore (73)
-
- Reinforcement learning (72)
- Data mining (70)
- Privacy (67)
- Security (62)
- Cloud computing (60)
- Deep Learning (57)
- Empirical study (55)
- Software engineering (55)
- Optimization (53)
- Online learning (51)
- Visualization (51)
- Neural networks (50)
- Anomaly detection (49)
- Training (49)
- Twitter (49)
- Task analysis (48)
- Blockchain (47)
- Natural language processing (47)
- Collaboration (46)
- Large Language Models (46)
- Feature extraction (45)
- Algorithms (44)
- Access control (43)
- Machine Learning (43)
- Semantics (43)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8458)
- Dissertations and Theses Collection (Open Access) (189)
- Research Collection Lee Kong Chian School Of Business (59)
- Research Collection Yong Pung How School Of Law (49)
- Research Collection School of Social Sciences (27)
-
- Asian Management Insights (26)
- Research Collection College of Integrative Studies (23)
- Perspectives@SMU (21)
- Research Collection School Of Accountancy (18)
- Dissertations and Theses Collection (15)
- FORCE 2026 (14)
- SMU Press Releases and News (12)
- MITB Thought Leadership Series (11)
- Research Collection Library (10)
- Research Collection School of Computing and Information Systems (10)
- Research@SMU: Connecting the Dots (10)
- PhD Student’s Publications Collection (8)
- LARC Research Publications (7)
- Research Collection School Of Economics (6)
- CCX Research (4)
- SMU Research Data (4)
- Student Publications (4)
- 2024 AI for Research Week (3)
- SCIS Student Publications (3)
- Centre for AI & Data Governance (2019-2025) (2)
- Research Collection Office of Research (2)
- CASTLe: Collection of Articles on Scholarship for Teaching and Learning (1)
- Centre for Computational Law (2022-2025) (1)
- Library Events (1)
- ROSA Journal Articles and Publications (1)
- Publication Type
- File Type
Articles 8461 - 8490 of 9003
Full-Text Articles in Computer Sciences
Tournament Versus Fitness Uniform Selection, Shane Legg, Marcus Hutter, Akshat Kumar
Tournament Versus Fitness Uniform Selection, Shane Legg, Marcus Hutter, Akshat Kumar
Research Collection School Of Computing and Information Systems
In evolutionary algorithms a critical parameter that must be tuned is that of selection pressure. If it is set too low then the rate of convergence towards the optimum is likely to be slow. Alternatively if the selection pressure is set too high the system is likely to become stuck in a local optimum due to a loss of diversity in the population. The recent Fitness Uniform Selection Scheme (FUSS) is a conceptually simple but somewhat radical approach to addressing this problem - rather than biasing the selection towards higher fitness, FUSS biases selection towards sparsely populated fitness levels. In …
Steganographic Schemes For File System And B-Tree, Hwee Hwa Pang, Kian-Lee Tan, Xuan Zhou
Steganographic Schemes For File System And B-Tree, Hwee Hwa Pang, Kian-Lee Tan, Xuan Zhou
Research Collection School Of Computing and Information Systems
While user access control and encryption can protect valuable data from passive observers, these techniques leave visible ciphertexts that are likely to alert an active adversary to the existence of the data. We introduce StegFD, a steganographic file driver that securely hides user-selected files in a file system so that, without the corresponding access keys, an attacker would not be able to deduce their existence. Unlike other steganographic schemes proposed previously, our construction satisfies the prerequisites of a practical file system in ensuring the integrity of the files and maintaining efficient space utilization. We also propose two schemes for implementing …
Parameter Inference Of Queueing Models For It Systems Using End-To-End Measurements, Laura Wynter, Cathy H. Xia, Fan Zhang
Parameter Inference Of Queueing Models For It Systems Using End-To-End Measurements, Laura Wynter, Cathy H. Xia, Fan Zhang
Research Collection School Of Computing and Information Systems
he scope of available applications, IT systems increase at a fascinating rate in both size and complexity. For example, today, a typical Web service hosting center may have hundreds of nodes and dozens of different applications simultaneously running on it. Each of the nodes in turn has often multiple processors and layered caches. These nodes make use of both local and shared storage systems. The size and complexity of such systems make performance modeling much more difficult, if at all tractable. Detailed modeling, fine tuning and accurate analysis can be carried out only on very small IT systems or very …
The Complexity Of Uml: Differentiating Practical And Theoretical Complexity, J. Erickson, Keng Siau
The Complexity Of Uml: Differentiating Practical And Theoretical Complexity, J. Erickson, Keng Siau
Research Collection School Of Computing and Information Systems
UML (Unified Modeling Language) has been criticized for its complexity, relating to users, and those learning to use it. Using Rossi and Brinkkemper’s [9] complexity metrics, Siau and Cao [10] completed a complexity analysis of UML and 36 other modeling techniques, finding that UML is indeed more complex than other techniques. Siau, Erickson and Lee [11] argued that Rossi and Brinkkemper’s metrics present the theoretical maximum complexity, as opposed to a practitioner-based complexity, that must be less than the theoretical maximum. The current research proposes that a subset of UML (a kernel) composed of the most commonly used constructs, would …
A Rate-Distortion Framework For Information-Theoretic Mobility Management, Abhishek Roy, Archan Misra, Sajal K. Das
A Rate-Distortion Framework For Information-Theoretic Mobility Management, Abhishek Roy, Archan Misra, Sajal K. Das
Research Collection School Of Computing and Information Systems
A practical information theoretic framework is developed for studying the optimal tradeoff between location update and paging costs in cellular networks. The framework envisions the quantization of location information into a registration area (RA) level granularity, followed by the use of an entropy-coding technique to decrease the location update rate. The rate distortion theory of the lossy quantization is identified as an appropriate measure for capturing the optimal tradeoff between a mobile's update rate and its location uncertainty. Based on LZ-78 compression, two different RA-level location update algorithms (RA-LeZi and LeZi-RA) have been developed, both of which asymptotically approach this …
Cryptanalysis Of Two Anonymous Buyer-Seller Watermarking Protocols And An Improvement For True Anonymity, Bok-Min Goi, Raphael C. W. Phan, Yanjiang Yang, Feng Bao, Robert H. Deng, M. U. Siddiqi
Cryptanalysis Of Two Anonymous Buyer-Seller Watermarking Protocols And An Improvement For True Anonymity, Bok-Min Goi, Raphael C. W. Phan, Yanjiang Yang, Feng Bao, Robert H. Deng, M. U. Siddiqi
Research Collection School Of Computing and Information Systems
By combining techniques of watermarking and fingerprinting, a sound buyer-seller watermarking protocol can address the issue of copyright protection in e-commerce. In this paper, we analyze the security of two recent anonymous buyer-seller watermarking protocols proposed by Ju et. al and Choi et. al respectively, and prove that they do not provide the features and security as claimed. In particular, we show that i) the commutative cryptosystem used in Choi et. als protocol fails to prevent the watermark certification authority (WCA) from discovering the watermark (fingerprint) chosen by the buyer; ii) for both protocols, the seller can discover the watermark …
Web Image Learning For Searching Semantic Concepts In Image Databases, Steven Hoi, Michael R. Lyu
Web Image Learning For Searching Semantic Concepts In Image Databases, Steven Hoi, Michael R. Lyu
Research Collection School Of Computing and Information Systems
Without textual descriptions or label information of images, searching semantic concepts in image databases is still a very challenging task. While automatic annotation techniques are yet a long way off, we can seek other alternative techniques to solve this difficult issue. In this paper, we propose to learn Web images for searching the semantic concepts in large image databases. To formulate effective algorithms, we suggest to engage the support vector machines for attacking the problem. We evaluate our algorithm in a large image database and demonstrate the preliminary yet promising results.
Modified Art 2a Growing Network Capable Of Generating A Fixed Number Of Nodes, Ji He, Ah-Hwee Tan, Chew-Lim Tan
Modified Art 2a Growing Network Capable Of Generating A Fixed Number Of Nodes, Ji He, Ah-Hwee Tan, Chew-Lim Tan
Research Collection School Of Computing and Information Systems
This paper introduces the Adaptive Resonance Theory under Constraint (ART-C 2A) learning paradigm based on ART 2A, which is capable of generating a user-defined number of recognition nodes through online estimation of an appropriate vigilance threshold. Empirical experiments compare the cluster validity and the learning efficiency of ART-C 2A with those of ART 2A, as well as three closely related clustering methods, namely online K-Means, batch K-Means, and SOM, in a quantitative manner. Besides retaining the online cluster creation capability of ART 2A, ART-C 2A gives the alternative clustering solution, which allows a direct control on the number of output …
Power Adaptation Based Optimization For Energy Efficient Reliable Wireless Paths, Suman Banerjee, Archan Misra
Power Adaptation Based Optimization For Energy Efficient Reliable Wireless Paths, Suman Banerjee, Archan Misra
Research Collection School Of Computing and Information Systems
We define a transmission power adaptation-based routing technique that finds optimal paths for minimum energy reliable data transfer in multi-hop wireless networks. This optimal choice of the transmission power depends on the link distance between the two nodes and the channel characteristics. Typical energy efficient routing techniques use a transmission power such that the received signal power at the destination minimally exceeds a desired threshold signal strength level. In this paper we argue that such a choice of the transmission power does not always lead to optimal energy routes, since it does not consider differences in the receiver noise levels.We …
Performance Planning, Quality-Of-Service, And Pricing Under Competition, Corinne Touati, Parijat Dube, Laura Wynter
Performance Planning, Quality-Of-Service, And Pricing Under Competition, Corinne Touati, Parijat Dube, Laura Wynter
Research Collection School Of Computing and Information Systems
In this work we model the relationship between the capacity and the Quality of Service (QoS) offered by the firm in a competitive scenario of two firm’s working to maximize their profits. Using simple queueing theoretic models we study the sensitivity of a firm’s market share to price, capacity and market size. Our preliminary studies yield important properties of the equilibrium solution which may further provide important “engineering” guidelines for performance planning and pricing strategies.
A Stage Model For E-Government Implementation, Keng Siau, Y. Long
A Stage Model For E-Government Implementation, Keng Siau, Y. Long
Research Collection School Of Computing and Information Systems
With the advancement of wired and wireless technologies in recent years, the concept of an e-government has attracted increasing interests from both researchers and practitioners. The E-Government Act of 2002 was signed into law by President Bush to encourage government agencies to efficiently and effectively serve their customers over the Web. E-government presents a way for government agencies to use new technologies, such as the Internet, to provide citizens, businesses, and other governments with a more convenient access to government information and services, to improve the quality of services, and to provide greater opportunities for citizens to participate in democratic …
Toolglasses, Marking Menus, And Hotkeys: A Comparison Of One And Two-Handed Command Selection Techniques, Daniel L. Odell, Richard C. Davis, Andrew Smith, Paul K. Wright
Toolglasses, Marking Menus, And Hotkeys: A Comparison Of One And Two-Handed Command Selection Techniques, Daniel L. Odell, Richard C. Davis, Andrew Smith, Paul K. Wright
Research Collection School Of Computing and Information Systems
This paper introduces a new input technique, bimanual marking menus, and compares its performance with five other techniques: static toolbars, hotkeys, grouped hotkeys, marking menus, and toolglasses. The study builds on previous work by setting the comparison in a commonly encountered task, shape drawing. In this context, grouped hotkeys and bimanual marking menus were found to be the fastest. Subjectively, the most pre-ferred input method was bimanual marking menus. Toolglass performance was unexpectedly slow, which hints at the importance of low-level toolglass imple-mentation choices.
Multi-Period Multi-Dimensional Knapsack Problem And Its Application To Available-To-Promise, Hoong Chuin Lau, M. K. Lim
Multi-Period Multi-Dimensional Knapsack Problem And Its Application To Available-To-Promise, Hoong Chuin Lau, M. K. Lim
Research Collection School Of Computing and Information Systems
This paper is motivated by a recent trend in logistics scheduling, called Available-to-Promise. We model this problem as the multi-period multi-dimensional knapsack problem. We provide some properties for a special case of a single-dimensional problem. Based on insights obtained from these properties, we propose a two-phase heuristics for solving the multi-dimensional problem. We also propose a novel time-based ant colony optimization algorithm. The quality of the solutions generated is verified through experiments, where we demonstrate that the computational time is superior compared with integer programming to achieve solutions that are within a small percentage of the upper bounds.
Dynamic Offloading In A Multi-Provider Environment: A Behavioral Framework For Use In Influencing Peering, Zhen Liu, Vishal Misra, Laura Wynter
Dynamic Offloading In A Multi-Provider Environment: A Behavioral Framework For Use In Influencing Peering, Zhen Liu, Vishal Misra, Laura Wynter
Research Collection School Of Computing and Information Systems
We pose the question of how to encourage the resource sharing in a distributed, multi-provider environment, where each node, or provider, has local work but is able to accept additional work from other nodes/providers if there is available capacity. An instance of such an environment is found in content delivery, where. numerous, competing providers can work together if enough benefit is to be gained from doing so. We model individual provider behavior as essentially selfish, and then propose pricing schemes to exploit the selfishness to achieve system wide performance gains. We employ a game theoretic framework to analyze the problem, …
A Cost-Effective Critical Path Approach For Service Priority Optimization In The Grid Computing Economy, Mei Lin, Zhangxi Lin
A Cost-Effective Critical Path Approach For Service Priority Optimization In The Grid Computing Economy, Mei Lin, Zhangxi Lin
Research Collection School Of Computing and Information Systems
The advancement in the utilization and technologiesof the Internet has led to the rapid growth of gridcomputing; and the perpetuating demand for gridcomputing resources calls for an incentive-compatible solution to the imminent QoS problem. This paper examines the optimal service priority selection problem that a grid computing network user will confront. We model grid services for a multi-subtask request as a prioritized PERT graph and prove that the localized conditional critical path, which is based on the cost-minimizin gpriority selection for each node, sets the lower bound for the length of cost-effective critical path that commits the optimal solution. We …
Security Analysis Of Some Proxy Signature, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng
Security Analysis Of Some Proxy Signature, Guilin Wang, Feng Bao, Jianying Zhou, Robert H. Deng
Research Collection School Of Computing and Information Systems
A proxy signature scheme allows an entity to delegate his/her signing capability to another entity in such a way that the latter can sign messages on behalf of the former. Such schemes have been suggested for use in a number of applications, particularly in distributed computing where delegation of rights is quite common. Followed by the first schemes introduced by Mambo, Usuda and Okamoto in 1996, a number of new schemes and improvements have been proposed. In this paper, we present a security analysis of four such schemes newly proposed. By successfully identifying several interesting forgery attacks, we show that …
Prediction Of Rna-Binding Proteins From Primary Sequence By A Support Vector Machine Approach., Lian Yi Han, Cong Zhong Cai, Siaw Ling Lo, Maxey Chung, Yu Zong Chen
Prediction Of Rna-Binding Proteins From Primary Sequence By A Support Vector Machine Approach., Lian Yi Han, Cong Zhong Cai, Siaw Ling Lo, Maxey Chung, Yu Zong Chen
Research Collection School Of Computing and Information Systems
Elucidation of the interaction of proteins with different molecules is of significance in the understanding of cellular processes. Computational methods have been developed for the prediction of protein-protein interactions. But insufficient attention has been paid to the prediction of protein-RNA interactions, which play central roles in regulating gene expression and certain RNA-mediated enzymatic processes. This work explored the use of a machine learning method, support vector machines (SVM), for the prediction of RNA-binding proteins directly from their primary sequence. Based on the knowledge of known RNA-binding and non-RNA-binding proteins, an SVM system was trained to recognize RNA-binding proteins. A total …
An Automated Algorithm For Extracting Website Skeleton, Zehua Liu, Wee-Keong Ng, Ee Peng Lim
An Automated Algorithm For Extracting Website Skeleton, Zehua Liu, Wee-Keong Ng, Ee Peng Lim
Research Collection School Of Computing and Information Systems
The huge amount of information available on the Web has attracted many research efforts into developing wrappers that extract data from webpages. However, as most of the systems for generating wrappers focus on extracting data at page-level, data extraction at site-level remains a manual or semi-automatic process. In this paper, we study the problem of extracting website skeleton, i.e. extracting the underlying hyperlink structure that is used to organize the content pages in a given website. We propose an automated algorithm, called the Sew algorithm, to discover the skeleton of a website. Given a page, the algorithm examines hyperlinks in …
Authenticating Query Results In Edge Computing, Hwee Hwa Pang, Kian-Lee Tan
Authenticating Query Results In Edge Computing, Hwee Hwa Pang, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
Edge computing pushes application logic and the underlying data to the edge of the network, with the aim of improving availability and scalability. As the edge servers are not necessarily secure, there must be provisions for validating their outputs. This paper proposes a mechanism that creates a verification object (VO) for checking the integrity of each query result produced by an edge server - that values in the result tuples are not tampered with, and that no spurious tuples are introduced. The primary advantages of our proposed mechanism are that the VO is independent of the database size, and that …
Hiding Data Accesses In Steganographic File System, Xuan Zhou, Hwee Hwa Pang, Kian-Lee Tan
Hiding Data Accesses In Steganographic File System, Xuan Zhou, Hwee Hwa Pang, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
To support ubiquitous computing, the underlying data have to be persistent and available anywhere-anytime. The data thus have to migrate from devices local to individual computers, to shared storage volumes that are accessible over open network. This potentially exposes the data to heightened security risks. We propose two mechanisms, in the context of a steganographic file system, to mitigate the risk of attacks initiated through analyzing data accesses from user applications. The first mechanism is intended to counter attempts to locate data through updates in between snapshots - in short, update analysis. The second mechanism prevents traffic analysis - identifying …
The Evolution Of Research On Information Systems: A Fiftieth Year Survey Of The Literature In Management Science, Rajiv D. Banker, Robert J. Kauffman
The Evolution Of Research On Information Systems: A Fiftieth Year Survey Of The Literature In Management Science, Rajiv D. Banker, Robert J. Kauffman
Research Collection School Of Computing and Information Systems
The development of the information systems (IS) literature in Management Science during the past 50 years reflects the inception, growth, and maturation of several different research streams. The five research streams we identify incorporate different definitions of the managerial problems that relate to IS, the alternate theoretical perspectives and different methodological paradigms to study them, and the levels of the organization at which their primary results impact managerial practice. The decision support and design science research stream studies the application of computers in decision support, control, and managerial decision making. The value of information research stream reflects relationships established based …
Tool Support For Model Based Architectural Design For Automotive Control Systems, Kevin Steppe
Tool Support For Model Based Architectural Design For Automotive Control Systems, Kevin Steppe
Research Collection School Of Computing and Information Systems
In conjunction with Ford Motor Company, we built a tool to support multilevel architectural design. The tool, called Synergy, allows Ford to visually design architectures of vehicle control components. The components are imported from existing Simulink models; then the tool automatically generates a detailed view showing all required connections and ports. The resulting model is exported to Simulink for further analysis. In this paper we describe the conceptual and technical challenges encountered in building Synergy and our design choices for solving them.
A Smart-Card-Enabled Privacy Preserving E-Prescription System, Yanjiang Yang, Xiaoxi Han, Feng Bao, Robert H. Deng
A Smart-Card-Enabled Privacy Preserving E-Prescription System, Yanjiang Yang, Xiaoxi Han, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
Within the overall context of protection of health care information, privacy of prescription data needs special treatment. First, the involvement of diverse parties, especially nonmedical parties in the process of drug prescription complicates the protection of prescription data. Second, both patients and doctors have privacy stakes in prescription, and their privacy should be equally protected. Third, the following facts determine that prescription should not be processed in a truly anonymous manner: certain involved parties conduct useful research on the basis of aggregation of prescription data that are linkable with respect to either the patients or the doctors; prescription data has …
An Information-Theoretic Framework For Optimal Location Tracking In Multi-System 4g Wireless Networks, Archan Misra, Abhishek Roy, Sajal K. Das
An Information-Theoretic Framework For Optimal Location Tracking In Multi-System 4g Wireless Networks, Archan Misra, Abhishek Roy, Sajal K. Das
Research Collection School Of Computing and Information Systems
An information-theoretic framework is developed for optimal location management in multisystem, fourth generation (4G) wireless networks. The framework envisions that each individual subsystem operates fairly independently, and does not require public knowledge of individual subnetwork topologies. To capture the variation in paging and location update costs in this heterogeneous environment, the location management problem is formulated in terms of a new concept of weighted entropy. The update process is based on the Lempel-Ziv compression algorithms, which are applied to a vector-valued sequence consisting of both the mobile's movement pattern and its session activity state. Three different tracking strategies which differ …
Effects Of Query Complexity And Learning On Novice User Query Performance With Conceptual And Logical Database Interfaces, Keng Siau, Hock Chuan Chan, Kwok Kee Wei
Effects Of Query Complexity And Learning On Novice User Query Performance With Conceptual And Logical Database Interfaces, Keng Siau, Hock Chuan Chan, Kwok Kee Wei
Research Collection School Of Computing and Information Systems
Users see the database interface as the database system. A good interface enables them to formulate queries better. The semantics communicated through the interface can be classified according to abstraction levels, such as the conceptual and logical levels. With the conceptual interface, interaction is in terms of real-world concepts such as entities, objects and relationships. Current user-database interaction is mainly based on the logical interface, where interaction is in terms of abstract database concepts such as relations and joins. Many researchers argue that end users will perform better with the conceptual interface. This research tested this claim, as well as …
Knowledge-Based Support In A Group Decision-Making Context: An Expert-Novice Comparison, Fiona Fui-Hoon Nah, I. Benbasat
Knowledge-Based Support In A Group Decision-Making Context: An Expert-Novice Comparison, Fiona Fui-Hoon Nah, I. Benbasat
Research Collection School Of Computing and Information Systems
This research examines the use of knowledge-based and explanation facilities to support group decision making of experts versus novices. Consistent with predictions from the persuasion literature, our results show that experts exhibit a higher level of criticality and involvement in their area of expertise; this not only decreases their likelihood of being persuaded by a knowledge-based system, but also accounts for a lower group consensus among experts as compared to novices. Novices are more easily persuaded by the system and find the system to be more useful than experts do. This research integrates theories from the persuasion literature to understand …
Phoneme-Based Transliteration Of Foreign Names For Oov Problem, Wei Gao, Kam-Fai Wong, Wai Lam
Phoneme-Based Transliteration Of Foreign Names For Oov Problem, Wei Gao, Kam-Fai Wong, Wai Lam
Research Collection School Of Computing and Information Systems
A proper noun dictionary is never complete rendering name translation from English to Chinese ineffective. One way to solve this problem is not to rely on a dictionary alone but to adopt automatic translation according to pronunciation similarities, i.e. to map phonemes comprising an English name to the phonetic representations of the corresponding Chinese name. This process is called transliteration. We present a statistical transliteration method. An efficient algorithm for aligning phoneme chunks is described. Unlike rule-based approaches, our method is data-driven. Compared to source-channel based statistical approaches, we adopt a direct transliteration model, i.e. the direction of probabilistic estimation …
A Modeling Framework For Computing Lifetime And Information Capacity In Wireless Sensor Networks, Enrique Duarte-Melo, Mingyan Liu, Archan Misra
A Modeling Framework For Computing Lifetime And Information Capacity In Wireless Sensor Networks, Enrique 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 fluidflow 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.
Clash: A Protocol For Internet-Scale Utility-Oriented Distributed Computing, Archan Misra, Paul Castro, Jinwon Lee
Clash: A Protocol For Internet-Scale Utility-Oriented Distributed Computing, Archan Misra, Paul Castro, Jinwon Lee
Research Collection School Of Computing and Information Systems
Distributed hash table (DHT) overlay networks offer an efficient and robust technique for wire-area data storage and queries. Workload from real applications that use DHT networks will likely exhibit significant skews that can result in bottlenecks and failures that limit the overall scalability of the DHT approach. We present the content and load-aware scalable hashing (CLASH) protocol that can enhance the load distribution behavior of a DHT. CLASH relies on a variable-length identifier key scheme, where the length of any individual key is a function of load. CLASH uses variable-length keys to cluster content-related objects on single nodes to achieve …
Spatial Queries In The Presence Of Obstacles, Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis, Manli Zhu
Spatial Queries In The Presence Of Obstacles, Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis, Manli Zhu
Research Collection School Of Computing and Information Systems
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are directly reachable. In this paper, we study spatial queries in the presence of obstacles, where the obstructed distance between two points is defined as the length of the shortest path that connects them without crossing any obstacles. We propose efficient algorithms for the most important query types, namely, range search, nearest neighbors, e-distance joins and closest pairs, considering that both data objects and obstacles are indexed by R-trees. The effectiveness of the proposed solutions is verified …