Yong Wu

ORCID: 0000-0001-8515-708X
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Scheduling and Optimization Algorithms
  • Advanced Manufacturing and Logistics Optimization
  • Optimization and Search Problems
  • Assembly Line Balancing Optimization
  • Distributed and Parallel Computing Systems
  • Cloud Computing and Resource Management
  • Optimization and Packing Problems
  • Data Management and Algorithms
  • Advanced Database Systems and Queries
  • Color perception and design
  • Robotics and Sensor-Based Localization
  • Economic theories and models
  • Statistical Methods and Bayesian Inference
  • Image Processing and 3D Reconstruction
  • Textile materials and evaluations
  • Computer Graphics and Visualization Techniques
  • Bayesian Modeling and Causal Inference
  • Game Theory and Applications
  • Computational Geometry and Mesh Generation
  • Advanced Bandit Algorithms Research
  • 3D Modeling in Geospatial Applications
  • Parallel Computing and Optimization Techniques
  • Fire Detection and Safety Systems
  • Geographic Information Systems Studies
  • Fashion and Cultural Textiles

Fujian Normal University
2025

Jiading District Central Hospital
2024

Ningbo University Affiliated Hospital
2020-2022

Ningbo Dahongying University
2018

Hong Kong Polytechnic University
2014-2016

Cornell University
2016

Ningbo University of Technology
2010-2015

Zhejiang University
2006-2011

Cesium is an open-source 3D virtual earth engine based on WebGL and one of the most widely used GIS engines. The 3DTiles rendering parameters in improve efficiency but involve numerous data types complex interdependencies, making simultaneous optimization challenging. In this paper, we proposed a multi-strategy probabilistic discrete differential evolution algorithm (MSPDDE) for finding optimal values model, which increases search space improves convergence speed by introducing multiple...

10.3390/app15020801 article EN cc-by Applied Sciences 2025-01-15

10.1016/j.tcs.2006.11.015 article EN Theoretical Computer Science 2006-11-30

This paper investigates the semi-online machine covering problem on two hierarchical machines where jobs are correspondingly classified into classes. The objective is to maximize minimum load. We show that if we only know size of largest job, no algorithm with a bounded competitive ratio exists. So consider case both and class job. If job it belongs higher class, then an optimal (1+22)-competitive lower design α-competitive ratio, α≈2.48119 root equation x3−2x2−2x+2=0. For total all known in...

10.1016/j.tcs.2014.02.015 article EN publisher-specific-oa Theoretical Computer Science 2014-02-22

In the "shared manufacturing" environment, based on fairness, shared manufacturing platforms often require service enterprises to arrange production according principle of "order first, finish first" which leads a series scheduling problems with fixed processing sequences. this paper, two two-machine hybrid flow-shop sequences are studied. Each job has tasks. The first task is flexible, can be processed either machines, and second must machine after completed. We consider objective...

10.32604/cmes.2022.019754 article EN Computer Modeling in Engineering & Sciences 2022-01-01

In "Shared Manufacturing" environment, orders are processed in a given job sequence which is based on the time of receipt orders. This paper studies problem scheduling two-task jobs two-machine hybrid flow-shop subject to used production electronic circuits under shared manufacturing. Each has two tasks: first one flexible task, can be either machines, and second preassigned only machine after task finished. processing deadline. Three objective functions related deadlines considered. The...

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

Summary In the past few years, executing high‐concurrency queries with interactive SQL query engines on Hadoop has become an important activity for many organizations. However, these systems do not adopt Multi‐Query Optimization (MQO) to accelerate process. There are two major concerns. Firstly, traditional MQO researches assume that multiple have high similarity. usually serve a variety of applications. Although from same application similarity, different applications may low so using will...

10.1002/cpe.4676 article EN Concurrency and Computation Practice and Experience 2018-08-09

Two semi-online scheduling problems on two parallel identical machines under a grade of service (GoS) provision were studied. The goal is to maximize the minimum machine load. For version where largest processing time all jobs known in advance, we show that no competitive algorithm exists. optimal offline value propose an with ratio 2.

10.4028/www.scientific.net/amm.101-102.484 article EN Applied Mechanics and Materials 2011-09-01

10.1016/j.jspi.2010.01.030 article EN Journal of Statistical Planning and Inference 2010-01-22

Summary Impala system is an open source, analytic MPP database for Apache Hadoop. uses a query execution scheduling scheme that assigns near‐equal bytes retrieval tasks different hosts to ensure load balance. However, such “load balance” cannot guarantee short response time system, when there are original loads in the system. Traditional methods require either some assumptions or particular architecture, which be directly used In this paper, we present If fetches data from single table,...

10.1002/cpe.4392 article EN Concurrency and Computation Practice and Experience 2017-12-11

In this paper, we study an semi-online version of bin stretching problem on m parallel identical machines. Where the jobs arrive sorted by non-increasing processing times. We propose algorithm and prove that competitive ratio is at most 1 + 2m-1/4m-2 <; 5/4 also show lower bound least 10/9.

10.1109/iccasm.2010.5622660 article EN 2010-10-01

In this paper, a two-machine two-stage flow shop with identical jobs is considered. Each of has two tasks. The first task can be processed on either machine, called flexible task, while the second must machine and can't unless been processed. problem to determine assignment tasks machines for each job, objective maximizing throughput rate. This model applied graphic programs processing which comprises data graphics processing. We consider three cases regarding capacity buffer between...

10.4028/www.scientific.net/amm.101-102.290 article EN Applied Mechanics and Materials 2011-09-01

Proximal causal learning is a promising framework for identifying the effect under existence of unmeasured confounders. Within this framework, doubly robust (DR) estimator was derived and has shown its effectiveness in estimation, especially when model assumption violated. However, current form DR restricted to binary treatments, while treatment can be continuous many real-world applications. The primary obstacle treatments resides delta function present original estimator, making it...

10.48550/arxiv.2309.12819 preprint EN other-oa arXiv (Cornell University) 2023-01-01

The classical formulation of the multiprocessor scheduling problem requires to assign a set tasks m processors so that makespan is minimized. This well known be NP - hard. online version has been studied widely and many results are available. LS algorithm optimal for two with competitive ratio 3/2. Various semi-online problems on have studied. cases where sum (T) known, or largest size (P <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">max</sub>...

10.1109/iske.2010.5680781 article EN IEEE International Conference on Intelligent Systems and Knowledge Engineering 2010-11-01

A heuristic strategy is presented to solve the point location problem in spherical triangulation mesh. Firstly, a mesh with regular subdivision connectivity constructed partition domain into some small regions. Then region, which contains query p, found according position of p and selected as search area for locating p. During location, barycentric coordinates are used extract local information about so find shortest path from start triangle target one containing In comparison traditional...

10.1360/jos161983 article EN Journal of Software 2005-01-01
Coming Soon ...