Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Adaptive (1)
- Bloom filter (1)
- Classification (1)
- Collaboration (1)
- Computer-supported collaborative learning (1)
-
- Confidence (1)
- Dempster-Shafer belief theory (1)
- Distributed conceptual learning (1)
- Distributed file systems (1)
- Dynamic profiling (1)
- Face attractiveness (1)
- Face recognition (1)
- Face symmetry (1)
- Feature extraction (1)
- File system management (1)
- Fitness of Use (FoU) (1)
- Golden ratio (1)
- Graph theory (1)
- Metadata management (1)
- Multiagent system (1)
- Multiseed clustering (1)
- Negotiation management (1)
- Neoclassical canons (1)
- Pattern recognition (1)
- Remote sensing (1)
- Resource description (1)
- Strategic negotiations (1)
- Time series data (1)
Articles 1 - 30 of 32
Full-Text Articles in Entire DC Network
Smartstore: A New Metadata Organization Paradigm With Metadata Semantic-Awareness For Next-Generation File Systems, Yu Hua, Hong Jiang, Yifeng Zhu, Dan Feng, Lei Tian
Smartstore: A New Metadata Organization Paradigm With Metadata Semantic-Awareness For Next-Generation File Systems, Yu Hua, Hong Jiang, Yifeng Zhu, Dan Feng, Lei Tian
CSE Technical Reports
Existing data storage systems based on hierarchical directory tree do not meet scalability and functionality requirements for exponentially growing datasets and increasingly complex metadata queries in large-scale file systems with billions of files and Exabytes of data. This paper proposes a novel decentralized semantic-aware metadata organization, called SmartStore, which exploits metadata semantics of files to judiciously aggregate correlated files into semantic-aware groups by using information retrieval tools. The decentralized design of SmartStore can improve system scalability and reduce query latency for both complex queries (including range and top-k queries), which is helpful to construct semantic-aware caching, and conventional filename-based point …
Ideas: An Identity-Based Security Architecture For Large-Scale And High-Performance Storage Systems, Zhongying Niu, Ke Zhou, Hong Jiang, Dan Feng, Tianming Yang
Ideas: An Identity-Based Security Architecture For Large-Scale And High-Performance Storage Systems, Zhongying Niu, Ke Zhou, Hong Jiang, Dan Feng, Tianming Yang
CSE Technical Reports
We develop IDEAS, an identity-based security architecture for large-scale and high-performance storage systems, designed to improve security, convenience and total cost of access control by merging identity management with access control in these systems. IDEAS authenticates users at each I/O node by using a single-identity certificate without the service of a centralized security server and enforces access control mechanism by using an object-based access control (OBAC) model, which is designed to address the complexity and scalability issue of security administration in large-scale storage systems. We also discuss the issue of how to identify and authenticate a large number of users …
An M-Sequence Based Steganography Model For Voice Over Ip, Lei Tian, Ke Zhou, Hong Jiang, Jin Liu, Yongfeng Huang, Dan Feng
An M-Sequence Based Steganography Model For Voice Over Ip, Lei Tian, Ke Zhou, Hong Jiang, Jin Liu, Yongfeng Huang, Dan Feng
CSE Technical Reports
Differing from applying steganography on storage cover media, steganography on Voice over IP (VoIP) must often delicately balance between providing adequate security and maintaining low latency for real-time services. This paper presents a novel real-time steganography model for VoIP that aims at providing good security for secret messages without sacrificing real-time performance. We achieve this goal by employing the well-known least-significant-bits (LSB) substitution approach to provide a reasonable tradeoff between the adequate information hiding requirement (good security and sufficient capacity) and the low latency requirement for VoIP. Further, we incorporate the m-sequence technique to eliminate the correlation among secret messages …
On Incorporating Learning Theories To Simulate A Computer-Supported Collaborative Learning Environment, Nobel Khandaker, Leen-Kiat Soh
On Incorporating Learning Theories To Simulate A Computer-Supported Collaborative Learning Environment, Nobel Khandaker, Leen-Kiat Soh
CSE Technical Reports
The success of a computer-supported collaborative learning (CSCL) environment in improving student knowledge depends on factors like student attributes (e.g., ability and motivation) and elements of the CSCL environment (e.g., group size and group formation). Better understanding of the individual and combined effects of these factors on the learning outcome of students would help: (1) researchers design better CSCL systems and (2) teachers make better decisions while carrying out CSCL sessions. To aid the researchers and teachers, we have used the observations collected and derived from published theories on individual, peer-based, and collaborative learning to design SimCoL, a multiagent-based tool …
Nmflux: Improving Degradation Behavior Of Server Applications Through Dynamic Nursery Resizing, Witawas Srisaan, Cheng Huan Jia
Nmflux: Improving Degradation Behavior Of Server Applications Through Dynamic Nursery Resizing, Witawas Srisaan, Cheng Huan Jia
CSE Technical Reports
Currently, most generational collectors are tuned to either deliver peak performance when the heap is plentiful, but yield unacceptable performance when the heap is tight or maintain good degradation behavior when the heap is tight, but deliver sub-optimal performance when the heap is plentiful. In this paper, we present NMFLUX (continuously varying the Nursery/Mature ratio), a framework that switches between using a fixed-nursery generational collector and a variable-nursery collector to achieve the best of both worlds; i.e. our framework delivers optimal performance under normal workload, and graceful performance degradation under heavy workload. We use this framework to create two generational …
Duts: Targeted Case Studies, Hui Nee Chin, Sebastian Elbaum, Matthew B. Dwyer, Matthew Jorde
Duts: Targeted Case Studies, Hui Nee Chin, Sebastian Elbaum, Matthew B. Dwyer, Matthew Jorde
CSE Technical Reports
Our previous studies of DUTs addressed research questions of effectiveness, efficiency, and robustness with respect to one software artifact, Siena, and we believe the findings generalize to similar artifacts. Still, we realize that existing studies suffer from threats to validity. Specifically, the selected artifact provided limited exposure to CR in the presence of deeper heap structures, extensive software changes, and high number of methods invocations. We start to address those threats to the validity of our findings by investigating the performance of CR in the presence of such settings.
The findings in this report reveal that the performance of the …
Hba: Distributed Metadata Management For Large Cluster-Based Storage Systems, Yifeng Zhu, Hong Jiang, Jun Wang, Feng Xian
Hba: Distributed Metadata Management For Large Cluster-Based Storage Systems, Yifeng Zhu, Hong Jiang, Jun Wang, Feng Xian
School of Computing: Faculty Publications
An efficient and distributed scheme for file mapping or file lookup is critical in decentralizing metadata management within a group of metadata servers. This paper presents a novel technique called Hierarchical Bloom Filter Arrays (HBA) to map filenames to the metadata servers holding their metadata. Two levels of probabilistic arrays, namely, the Bloom filter arrays with different levels of accuracies, are used on each metadata server. One array, with lower accuracy and representing the distribution of the entire metadata, trades accuracy for significantly reduced memory overhead, whereas the other array, with higher accuracy, caches partial distribution information and exploits the …
Multidomain Optical Networks: Issues And Challenges, Chava Vijaya Saradhi, Byrav Ramamurthy, Dominic A. Schupke, Eiji Oki
Multidomain Optical Networks: Issues And Challenges, Chava Vijaya Saradhi, Byrav Ramamurthy, Dominic A. Schupke, Eiji Oki
School of Computing: Faculty Publications
Today, many leading organizations are undertaking extensive research on a very broad range of new and evolving optical networking technologies. These efforts carry particular significance, especially in light of the “postbubble” dynamics of the optical networking market and have led to the investigation of various cost-efficient optical technologies. Today’s telecom carriers operate several independent optical domains based on diverse technologies, control solutions, standards, and protocols, making interdomain and intercarrier interworking extremely difficult. Standardized interworking across diverse multigranularity network interfaces, and interoperability across disparate vendor equipments and carrier domains are crucial to provisioning end-to-end services and achieving cost-efficient network operation. Needless …
Efficient Power Management Of Heterogeneous Soft Real-Time Clusters, Leping Wang, Ying Lu
Efficient Power Management Of Heterogeneous Soft Real-Time Clusters, Leping Wang, Ying Lu
CSE Technical Reports
With growing cost of electricity, the power management of server clusters has become an important problem. However, most previous researchers only address the challenge in homogeneous environments. Considering the increasing popularity of heterogeneous systems, this paper proposes an efficient algorithm for power management of heterogeneous soft real-time clusters. It is built on simple but effective mathematical models. When deployed to a new platform, the software incurs low configuration cost because no extensive performance measurements and profiling are required. To strive for efficiency, a threshold-based approach is adopted. In this paper, we systematically study this approach and its design decisions.
Proceedings Work-In-Progress Session Of The 14th Real-Time And Embedded Technology And Applications Symposium, 22-24 April, 2008 St. Louis, Usa, Ying Lu
CSE Technical Reports
The Work-In-Progress session of the 14th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS '08) presents papers describing contributions both to state of the art and state of the practice in the broad field of real-time and embedded systems. The 25 accepted papers were selected from 27 submissions. This proceedings is also available as University of Nebraska–Lincoln Technical Report TR-UNL-CSE-2008-0003, at
http://lakota.unl.edu/facdb/csefacdb/TechReportArchive/TR-UNL-CSE-2008-0003.pdf
Special thanks go to the General Chairs – Scott Brandt and Frank Mueller and Program Chairs – Chenyang Lu and Christopher Gill for their support and guidance. Special thanks also go to the Work-In-Progress Program Committee Members …
Getting Started With Prpl, Qingfeng Guan
Getting Started With Prpl, Qingfeng Guan
School of Natural Resources: Faculty Publications
pRPL is an open-source1 general-purpose parallel Raster Processing programming Library developed by Qingfeng Guan, in the Department of Geography, University of California, Santa Barbara. pRPL encapsulates complex parallel computing utilities and routines specifically for raster processing (e.g., raster data decomposition, distribution and gathering among multiple processors, inter-processor communication and data exchange), and provides an easy-to-use interface for users to parallelize almost any raster processing algorithm with any arbitrary neighborhood (or moving window) configuration. pRPL enables the implementation of parallel raster-processing algorithms without requiring a deep understanding of parallel computing and programming, thus it greatly reduces the development complexity. Moreover, even …
Loss-Rate Based Reliable Data Transport Mechanism For Dynamic Event Sensing In Wireless Sensor Networks, Yuyan Xue, Byrav Ramamurthy, Yong Wang
Loss-Rate Based Reliable Data Transport Mechanism For Dynamic Event Sensing In Wireless Sensor Networks, Yuyan Xue, Byrav Ramamurthy, Yong Wang
CSE Technical Reports
Many wireless sensor network (WSN) transport protocols proposed in recent studies focus on providing end-to- end reliability as in TCP. However, traditional end-to-end reliability is energy and time consuming for common loss tolerant applications in WSNs. In this paper, we propose a Loss Tolerant Reliable (LTR) data transport mechanism for dynamic Event Sensing (LTRES) in WSNs. In LTRES, a reliable event sensing requirement at the transport layer is dynamically determined by the sink. A distributed source rate adaptation mechanism is designed, incorporating a loss rate based lightweight congestion control mechanism, to regulate the data traffic injected into the network so …
Farmer: A Novel Approach To File Access Correlation Mining And Evaluation Reference Model For Optimizing Peta-Scale File System Performance, Peng Xia, Dan Feng, Hong Jiang, Lei Tian, Fang Wang
Farmer: A Novel Approach To File Access Correlation Mining And Evaluation Reference Model For Optimizing Peta-Scale File System Performance, Peng Xia, Dan Feng, Hong Jiang, Lei Tian, Fang Wang
CSE Technical Reports
File correlations have become an increasingly important consideration for performance enhancement in peta-scale storage systems. Previous studies on file correlationsmainly concern with two aspects of files: file access sequence and semantic attribute. Based on mining with regard to these two aspects of file systems, various strategies have been proposed to optimize the overall system performance. Unfortunately, all of these studies consider either file access sequences or semantic attribute information separately and in isolation, thus unable to accurately and effectively mine file correlations, especially in large-scale distributed storage systems.
This paper introduces a novel File Access coRrelation Mining and Evaluation Referencemodel …
Network Coding For Wdm All-Optical Multicast, Eric D. Manley, Jitender S. Deogun, Lisong Xu, Dennis R. Alexander
Network Coding For Wdm All-Optical Multicast, Eric D. Manley, Jitender S. Deogun, Lisong Xu, Dennis R. Alexander
CSE Technical Reports
Network coding has become a useful means for achieving efficient multicast, and the optical community has started to examine its application to optical networks. However, a number of challenges, including limited processing capability and coarse bandwidth granularity, need to be overcome before network coding can be effectively used in optical networks. In this paper, we address some of these problems. We consider the problem of finding efficient routes to use with coding, and we study the effectiveness of using network coding for optical-layer dedicated protection of multicast traffic. We also propose architectures for all-optical circuits capable of performing the processing …
Variable Neighbor Selection In Live Peer-To-Peer Multimedia Streaming Networks, Jagannath Ghoshal, Miao Wang, Lisong Xu, Byrav Ramamurthy
Variable Neighbor Selection In Live Peer-To-Peer Multimedia Streaming Networks, Jagannath Ghoshal, Miao Wang, Lisong Xu, Byrav Ramamurthy
CSE Conference and Workshop Papers
Data-driven (or swarming based) streaming is one of the popular ways to distribute live multimedia streaming traffic over Peer-to-Peer (P2P) networks. The efficiency and user satisfaction highly depend on the constructed overlays. The common neighbor selection algorithms in existing overlay construction schemes usually randomly select a fixed number of neighbors which satisfy the selection requirements, such as end-to-end delay or a peer's sojourn time. However, this fixed random neighbor-selection algorithm (FRNS) neglects the peers' upload bandwidth heterogeneity and therefore, the upload bandwidth cannot be efficiently used. In this paper, we propose a variable random neighbor-selection (VRNS) scheme to alleviate the …
A Security Framework For Wireless Sensor Networks Utilizing A Unique Session Key, Yong Wang, Byrav Ramamurthy, Yuyan Xue, Xukai Zou
A Security Framework For Wireless Sensor Networks Utilizing A Unique Session Key, Yong Wang, Byrav Ramamurthy, Yuyan Xue, Xukai Zou
CSE Conference and Workshop Papers
Key management is a core mechanism to ensure the security of applications and network services in wireless sensor networks. It includes two aspects: key distribution and key revocation. Many key management protocols have been specifically designed for wireless sensor networks. However, most of the key management protocols focus on the establishment of the required keys or the removal of the compromised keys. The design of these key management protocols does not consider the support of higher level security applications. When the applications are integrated later in sensor networks, new mechanisms must be designed. In this paper, we propose a security …
An Automatic Bridge Detection Technique For Multispectral Images, D. Chaudhuri, Ashok Samal
An Automatic Bridge Detection Technique For Multispectral Images, D. Chaudhuri, Ashok Samal
CSE Conference and Workshop Papers
Extraction of features from images has been a goal of researchers since the early days of remote sensing. While significant progress has been made in several applications, much remains to be done in the area of accurate identification of high-level features such as buildings and roads. This paper presents an approach for detecting bridges over water bodies from multispectral imagery. The multispectral image is first classified into eight land-cover types using a majority-must-be-granted logic based on the multiseed supervised classification technique. The classified image is then categorized into a trilevel image: water, concrete, and background. Bridges are then recognized in …
Partial Forwarding Scheme For Dynamic Window Resizing In Live P2p Streaming Systems, Zhipeng Ouyang, Lisong Xu, Byrav Ramamurthy
Partial Forwarding Scheme For Dynamic Window Resizing In Live P2p Streaming Systems, Zhipeng Ouyang, Lisong Xu, Byrav Ramamurthy
CSE Conference and Workshop Papers
Peer-to-peer (P2P) streaming systems, in which individual nodes or peers operated by ordinary Internet users collaborate to serve video streams, have recently aroused considerable interest in both academia and industry. An important problem in P2P streaming systems is how to reduce their consumed bandwidth, which is a major concern of Internet service providers. Our work is motivated by the fact that a user may dynamically change the size of a window displaying a video stream according to his/her personal choice, a scenario we refer to as dynamic window resizing. In this paper, we propose a scheme called the Partial Forwarding …
Channel-Aware Peer Selection In Multi-View Peer-To-Peer Multimedia Streaming, Miao Wang, Lisong Xu, Byrav Ramamurthy
Channel-Aware Peer Selection In Multi-View Peer-To-Peer Multimedia Streaming, Miao Wang, Lisong Xu, Byrav Ramamurthy
CSE Conference and Workshop Papers
Motivated by the success of the Picture in Picture feature of the traditional TV, several commercial Peer-to-Peer Multi-Media Streaming (P2PMMS) applications now support the multi-view feature, with which a user can simultaneously watch multiple channels on its screen. This paper considers the peer selection problem in multi-view P2PMMS. This problem has been well studied in the traditional single-view P2PMMS; however, it becomes more complicated in multi-view P2PMMS, mainly due to the fact that a peer watching multiple channels joins multiple corresponding overlays. In this paper, we propose a novel peer selection algorithm, called Channel-Aware Peer Selection (CAPS), where a peer …
A Service-Differentiated Real-Time Communication Scheme For Wireless Sensor Networks, Yuyan Xue, Byrav Ramamurthy, Mehmet C. Vuran
A Service-Differentiated Real-Time Communication Scheme For Wireless Sensor Networks, Yuyan Xue, Byrav Ramamurthy, Mehmet C. Vuran
CSE Conference and Workshop Papers
Supporting end-to-end real-time communication is important for wireless sensor networks (WSNs) to accomplish the collaborative sensing tasks with specific timing constraints. However, without considering the unique constraints for WSNs, many existing real-time communication protocols prove to be infeasible for low-cost WSNs. In this paper, we propose a novel real-time communication scheme (RCS) to provide service-differentiated soft real-time guarantees for end-to-end communication in WSNs. We use hop-based geographic grouping to enable location awareness for sensor nodes with extremely low control overhead.We use dynamic forwarding with load-balanced receiver contention to provide a light-weight, yet efficient, routing technique, which can be easily adapted …
Providing Reliable Data Transport For Dynamic Event Sensing In Wireless Sensor Networks, Yuyan Xue, Byrav Ramamurthy, Yong Wang
Providing Reliable Data Transport For Dynamic Event Sensing In Wireless Sensor Networks, Yuyan Xue, Byrav Ramamurthy, Yong Wang
CSE Conference and Workshop Papers
In this paper, we propose a Loss Tolerant Reliable (LTR) data transport mechanism for dynamic Event Sensing (LTRES) in WSNs. In LTRES, a reliable event sensing requirement at the transport layer is dynamically determined by the sink. A distributed source rate adaptation mechanism is designed, incorporating a loss rate based lightweight congestion control mechanism, to regulate the data traffic injected into the network so that the reliability requirement can be satisfied. An equation based fair rate control algorithm is used to improve the fairness among the LTRES flows sharing the congestion path. The performance evaluations show that LTRES can provide …
A Key Management Protocol For Wireless Sensor Networks With Multiple Base Stations, Yong Wang, Byrav Ramamurthy, Yuyan Xue
A Key Management Protocol For Wireless Sensor Networks With Multiple Base Stations, Yong Wang, Byrav Ramamurthy, Yuyan Xue
CSE Conference and Workshop Papers
Most of the proposed key management protocols for wireless sensor networks (WSNs) in the literature assume that a single base station is used and that the base station is trustworthy. However, there are applications in which multiple base stations are used and the security of the base stations must be considered. This paper investigates a key management protocol in wireless sensor networks which include multiple base stations. We consider the situations in which both the base stations and the sensor nodes can be compromised. The proposed key management protocol, mKeying, includes two schemes, a key distribution scheme, mKeyDist, supporting multiple …
Predicting Accurate And Actionable Static Analysis Warnings: An Experimental Approach, Joseph Ronald Ruthruff, John Penix, J. David Morgenthaler, Sebastian Elbaum, Gregg Rothermel
Predicting Accurate And Actionable Static Analysis Warnings: An Experimental Approach, Joseph Ronald Ruthruff, John Penix, J. David Morgenthaler, Sebastian Elbaum, Gregg Rothermel
CSE Conference and Workshop Papers
Static analysis tools report software defects that may or may not be detected by other verification methods. Two challenges complicating the adoption of these tools are spurious false positive warnings and legitimate warnings that are not acted on. This paper reports automated support to help address these challenges using logistic regression models that predict the foregoing types of warnings from signals in the warnings and implicated code. Because examining many potential signaling factors in large software development settings can be expensive, we use a screening methodology to quickly discard factors with low predictive power and cost-effectively build predictive models. Our …
Cross-Layer Packet Size Optimization For Wireless Terrestrial, Underwater, And Underground Sensor Networks, Mehmet C. Vuran, Ian F. Akyildiz
Cross-Layer Packet Size Optimization For Wireless Terrestrial, Underwater, And Underground Sensor Networks, Mehmet C. Vuran, Ian F. Akyildiz
CSE Conference and Workshop Papers
In this paper, a cross-layer solution for packet size optimization in wireless sensor networks (WSN) is introduced such that the effects of multi-hop routing, the broadcast nature of the physical wireless channel, and the effects of error control techniques are captured. A key result of this paper is that contrary to the conventional wireless networks, in wireless sensor networks, longer packets reduce the collision probability. Consequently, an optimization solution is formalized by using three different objective functions, i.e., packet throughput, energy consumption, and resource utilization. Furthermore, the effects of end-to-end latency and reliability constraints are investigated that may be required …
Design Of A Wireless Vision Sensor For Object Tracking In Wireless Vision Sensor Networks, Mauricio Casarest, Mehmet C. Vuran, Senem Velipasalar
Design Of A Wireless Vision Sensor For Object Tracking In Wireless Vision Sensor Networks, Mauricio Casarest, Mehmet C. Vuran, Senem Velipasalar
CSE Conference and Workshop Papers
The integration of CMOS cameras with embedded processors and wireless communication devices has enabled the development of distributed wireless vision systems. Wireless Vision Sensor Networks (WVSNs), which consist of wirelessly connected embedded systems with vision and sensing capabilities, provide wide variety of application areas that have not been possible to realize with the wall-powered vision systems with wired links or scalar-data based wireless sensor networks. In this paper, the design of a middleware for a wireless vision sensor node is presented for the realization of WVSNs. The implemented wireless vision sensor node is tested through a simple vision application to …
Efficient Selection Of Observation Points For Functional Tests, Jian Kang, Sharad C. Seth, Yi-Shing Chang, Vijay Gangaram
Efficient Selection Of Observation Points For Functional Tests, Jian Kang, Sharad C. Seth, Yi-Shing Chang, Vijay Gangaram
School of Computing: Faculty Publications
The fault coverage of existing functional tests can be enhanced by additional observation points. For a given set of functional tests, this paper proposes an efficient fault-dropping fault simulation method for selecting a subset of observation points at a small fraction of the cost of non-fault-dropping fault simulation. Experimental results on industrial circuits demonstrate the effectiveness of the method in achieving close to optimal results in the size of the selected subset with an order of magnitude less time, without losing achievable coverage. The technique is particularly applicable to industrial designs where fault-simulation times can be prohibitively expensive, even when …
Considering Operational Issues For Multiagent Conceptual Inferencing In A Distributed Information Retrieval Application, Leen-Kiat Soh
Considering Operational Issues For Multiagent Conceptual Inferencing In A Distributed Information Retrieval Application, Leen-Kiat Soh
School of Computing: Faculty Publications
Our system, based on a multiagent framework called collaborative understanding of distributed knowledge (CUDK), is designed with the overall goal of balancing agents’ conceptual learning and task accomplishment. The tradeoff between the two is that while conceptual learning allows an agent to improve its own concept base, it could be counter-productive: conceptual learning is time consuming and requires processing resources necessary for the agent to accomplish its tasks. In our current phase of research, we investigate the roles of resource and knowledge constraints, environmental factors (such as the frequency of queries), and learning mechanisms in a CUDK-based distributed information retrieval …
I-Minds: A Multiagent System For Intelligent Computer- Supported Collaborative Learning And Classroom Management, Leen-Kiat Soh, Nobel Khandaker, Hong Jiang
I-Minds: A Multiagent System For Intelligent Computer- Supported Collaborative Learning And Classroom Management, Leen-Kiat Soh, Nobel Khandaker, Hong Jiang
School of Computing: Faculty Publications
I-MINDS provides a computer-supported collaborative learning (CSCL) infrastructure and environment for learners in synchronous learning and classroom management applications for instructors, for large classroom or distance education situations. For supporting the instructor, I-MINDS includes a teacher agent. The teacher agent allows the instructor to interact with students, manage Q&A sessions, administer quizzes, post evaluations, form groups and monitor individual and group performances. For computer-supported collaborative learning, I-MINDS, which stands for Intelligent Multiagent Infrastructure for Distributed Systems in Education, provides a student agent for each student. Each student agent monitors and models its user and carries out group formation with other …
Investigating Adaptive, Confidence-Based Strategic Negotiations In Complex Multiagent Environments, Leen-Kiat Soh, Xin Li
Investigating Adaptive, Confidence-Based Strategic Negotiations In Complex Multiagent Environments, Leen-Kiat Soh, Xin Li
School of Computing: Faculty Publications
We propose an adaptive 1-to-many negotiation strategy for multiagent coalition formation in complex environments that are dynamic, uncertain, and real-time. Our strategy deals with how to assign multiple issues to a set of concurrent negotiations based on an initiating agent’s confidence in its profiling of its peer agents. When an agent is confident, it uses a packaged approach—conducting multiple multi-issue negotiations—with its peers. Otherwise, it uses a pipelined approach—conducting multiple single-issue negotiations—with its peers. The initiating agent is also capable of using both approaches in a hybrid, dealing with a mixed group of responding peers. An agent’s confidence in its …
A Survey On Spectrum Management In Cognitive Radio Networks, Ian F. Akyildiz, Won-Yeol Lee, Mehmet C. Vuran, Shantidev Mohanty
A Survey On Spectrum Management In Cognitive Radio Networks, Ian F. Akyildiz, Won-Yeol Lee, Mehmet C. Vuran, Shantidev Mohanty
School of Computing: Faculty Publications
Cognitive radio networks will provide high bandwidth to mobile users via heterogeneous wireless architectures and dynamic spectrum access techniques. However, CR networks impose challenges due to the fluctuating nature of the available spectrum, as well as the diverse QoS requirements of various applications. Spectrum management functions can address these challenges for the realization of this new network paradigm. To provide a better understanding of CR networks, this article presents recent developments and open research issues in spectrum management in CR networks. More specifically, the discussion is focused on the development of CR networks that require no modification of existing networks. …