Bo Jiang

ORCID: 0000-0002-9748-1810
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Caching and Content Delivery
  • Energy Efficient Wireless Sensor Networks
  • Service-Oriented Architecture and Web Services
  • Opportunistic and Delay-Tolerant Networks
  • Software Engineering Research
  • Mobile Ad Hoc Networks
  • Complex Network Analysis Techniques
  • Distributed and Parallel Computing Systems
  • Usability and User Interface Design
  • Multimedia Communication and Technology
  • Web Data Mining and Analysis
  • Advanced Queuing Theory Analysis
  • Advanced Text Analysis Techniques
  • Software System Performance and Reliability
  • Peer-to-Peer Network Technologies
  • Advanced Software Engineering Methodologies
  • Recommender Systems and Techniques
  • Advanced Data Storage Technologies
  • Cloud Computing and Resource Management
  • Distributed systems and fault tolerance
  • Interactive and Immersive Displays
  • Network Traffic and Congestion Control
  • Indoor and Outdoor Localization Technologies
  • Cooperative Communication and Network Coding
  • Network Time Synchronization Technologies

Zhejiang Gongshang University
2010-2024

AGH University of Krakow
2021

Altice Portugal (Portugal)
2021

Binghamton University
2021

Shanghai Jiao Tong University
2021

Two Sigma Investments (United States)
2021

University of Massachusetts Amherst
2009-2018

Shanghai University of Finance and Economics
2017

PLA Army Engineering University
2014

State Key Laboratory of Software Engineering
2013

Intended for network-wide dissemination of commands, configurations and code binaries, flooding has been investigated extensively in wireless networks. However, little work yet done on low-duty-cycle sensor networks which nodes stay asleep most time wake up asynchronously. In this type network, a broadcasting packet is rarely received by multiple simultaneously, unique constraining feature that makes existing solutions unsuitable. Combined with unreliable links, new challenging issue.In...

10.1145/1614320.1614336 article EN Proceedings of the 28th Annual International Conference on Mobile Computing And Networking 2009-09-20

We investigate the problem of optimal request routing and content caching in a heterogeneous network supporting in-network with goal minimizing average access delay. Here, can either be accessed directly from back-end server (where resides permanently) or obtained one multiple caches. To piece content, user must decide whether to route its cache server. Additionally, caches which cache. complexity two formulations, where direct path is modeled as i) congestion-sensitive ii)...

10.1109/infocom.2015.7218465 article EN 2015-04-01

Sentiment classification is an important subject in text mining research, which concerns the application of automatic methods for predicting orientation sentiment present on documents, with many applications a number areas including recommender and advertising systems, customer intelligence information retrieval. In this paper, we provide survey comparative study existing techniques opinion machine learning lexicon-based approaches, together evaluation metrics. Also cross-domain...

10.1109/wisa.2014.55 article EN 2014-09-01

Flooding service has been investigated extensively in wireless networks to efficiently disseminate network-wide commands, configurations, and code binaries. However, little work done on low-duty-cycle sensor which nodes stay asleep most of the time wake up asynchronously. In this type network, a broadcasting packet is rarely received by multiple simultaneously, unique constraining feature that makes existing solutions unsuitable. paper, we introduce Opportunistic Flooding, novel design...

10.1109/tc.2013.142 article EN cc-by IEEE Transactions on Computers 2013-07-02

In-network content caching has been deployed in both the Internet and cellular networks to reduce content-access delay. We investigate problem of developing optimal joint routing policies a network supporting in-network with goal minimizing expected Here, needed can either be accessed directly from back-end server (where resides permanently) or obtained one multiple caches. To access content, users must thus decide whether route their requests cache server. In addition, caches which cache....

10.1109/tnet.2016.2636843 article EN publisher-specific-oa IEEE/ACM Transactions on Networking 2016-12-24

A surveillance system, which tracks mobile targets, is one of the most important applications wireless sensor networks. When nodes operate in a duty cycling mode, tracking performance can be improved if target motion predicted and along trajectory proactively awakened. However, this will negatively influence energy efficiency constrain benefits cycling. In paper, we present Probability-based Prediction Sleep Scheduling protocol (PPSS) to improve proactive wake up. We start with designing...

10.1109/tmc.2012.44 article EN IEEE Transactions on Mobile Computing 2012-02-14

Abstract In the context of global aging, to explore design needs elderly with dementia in museum environments, establish a user cognitive psychological model based on immersion theory, and enhance satisfaction cognitively impaired service experience. Using literature research, surveys, questionnaires, interviews, focus groups, we analyze experience from demands dementia, build method mining by combining KANO analytic hierarchy process (AHP) method, for evaluating excellence environment. The...

10.1038/s41598-024-51929-4 article EN cc-by Scientific Reports 2024-01-23

Collapsed forwarding has been used in cache systems to reduce the load on servers by aggregating requests for same content. This technique made its way into design proposals future Internet architecture through a data structure called Pending Interest Table (PIT). A PIT keeps track of interest packets that are received at cache-router until they responded to. PITs considered useful variety reasons e.g., communicating without knowledge source and destination, reducing bandwidth usage, better...

10.1145/2810156.2810161 article EN 2015-09-22

The modeling and analysis of an LRU cache is extremely challenging as exact results for the main performance metrics (e.g., hit rate) are either lacking or cannot be used because their high computational complexity large caches. As a result, various approximations have been proposed. state-of-the-art method so-called TTL approximation, first proposed shown to asymptotically IRM requests by Fagin [13]. It has applied other workload models numerically demonstrated accurate but without...

10.1145/3239164 article EN ACM Transactions on Modeling and Performance Evaluation of Computing Systems 2018-09-07

10.1007/s11633-013-0708-y article EN International Journal of Automation and Computing 2013-04-01

It may be very difficult to receive the signals from satellite positioning systems due existing obstacles in indoor environment. Arising popularity of smart phones, Wi-Fi based technology has advantages with convenient deployment and low hardware cost. In this study, we focused on using fingerprint data that were collected shopping malls. Due volatility high-dimensional sparseness data, proposed a feature extraction algorithm, called joint multi-task stacked denoising auto-encoder...

10.1109/access.2020.3004039 article EN cc-by IEEE Access 2020-01-01

This paper presents a target direction-based sleep scheduling algorithm (TDSS) for tracking surveillance sensor networks. TDSS reduces the number of proactively awakened nodes and schedules their pattern to enhance energy efficiency but suffer little performance loss. Both approaches are based on two probabilistic distribution models moving directions, normal linear distribution. We compare with against legacy circle-based waking up scheme (Circle) working node reducing - MCTA. The...

10.1109/ipdps.2008.4536330 article EN Proceedings - IEEE International Parallel and Distributed Processing Symposium 2008-04-01

Population initialization is a crucial task in population-based optimization methods, which can affect the convergence speed and also quality of final solutions. Generally, if no priori information about solutions available, initial population often selected randomly using random numbers. This paper presents new method by applying concept adaptive randomness (AR) to distribute individuals as spaced out possible over search space. To verify performance AR, comprehensive set 34 benchmark...

10.1155/2014/975916 article EN cc-by Mathematical Problems in Engineering 2014-01-01

Affective education has been the new educational pattern under modern ubiquitous learning environment. Especially in mobile learning, how to effectively construct affective optimize and enhance teaching effectiveness attracted many scholars attention. This paper presents framework of based on learner?s interest emotion recognition. Learner?s voice, text behavior log data are firstly preprocessed, then association rules analysis, SO-PMI (Semantic Orientation-Pointwise Mutual Information)...

10.2298/csis170110023c article EN cc-by-nc-nd Computer Science and Information Systems 2017-01-01

It is an intrinsic property of real-world software to evolve, which usually accompanied by the increase complexity and deterioration quality. So successful has be reconditioned from time time. Though many refactoring approaches have been proposed, only a few them are performed at package level. In this paper, we present novel approach refactor structure object-oriented (OO) software. uses weighted bipartite networks represent classes, packages, their dependencies; it proposes guidance...

10.1142/s0219525914500064 article EN Advances in Complex Systems 2014-05-15

Refactoring is regarded as an effective way to address the software quality deterioration problem. Although many refactoring approaches have been proposed, there little work at package level. This paper proposes use community detection technique refactor packages of object–oriented software. It uses class network represent classes and their dependencies, a genetic algorithm based obtain optimised structures, finally provides list that should be moved by comparing structures with real...

10.1504/ijcat.2013.056914 article EN International Journal of Computer Applications in Technology 2013-01-01

In this paper we extend an approximation first proposed by Fagin [4] for the LRU cache under independence reference model to systems where requests different contents form independent stationary and ergodic processes. We show that becomes exact as number of goes infinity while maintaining fraction can populate be constant. Last, provide results on rate convergence.

10.1145/3152042.3152051 article EN ACM SIGMETRICS Performance Evaluation Review 2017-10-11

Considering the existing problems in Web service such as lack of semantic information and interoperability, atomic services can not cooperate with each other be combined into composite services. In this paper, based on extended UDDI, we present a annotation framework  for description composition. The novel matching algorithm not only takes account height factor of ontology tree local density factor for impact distance, but also degree overlap. Experimental results show that proposed improved...

10.4304/jsw.8.2.351-356 article EN Journal of Software 2013-02-01
Coming Soon ...