Xin Han

Qiaoting Fu

Jie Liu

Int. J. Appl. Earth Obs. Geoinformation, 2024

Dual Branch Non-Autoregressive Image Captioning.

[BibT_eX]

[DOI]

Proceedings of the Pattern Recognition - 27th International Conference, 2024

2023

CHAT: Accurate Network Latency Measurement for 5G E2E Networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., December, 2023

An improved approximation algorithm for a scheduling problem with transporter coordination.

[BibT_eX]

[DOI]

J. Sched., December, 2023

Three-Stage Assembly Flow Shop Scheduling Problem with a Fixed Maintenance Period.

[BibT_eX]

[DOI]

Asia Pac. J. Oper. Res., October, 2023

The spatial coordinates projection method for generating digital geologic cross sections from the multi-source terrain and geologic data.

[BibT_eX]

[DOI]

Earth Sci. Informatics, September, 2023

The impact of isolation kernel on agglomerative hierarchical clustering algorithms.

[BibT_eX]

[DOI]

Pattern Recognit., July, 2023

Crystal-modeler: A tool for geometric analysis and three-dimensional modeling of crystal forms based on rectangular coordinates in space.

[BibT_eX]

[DOI]

Earth Sci. Informatics, March, 2023

A distributed neurodynamic algorithm for sparse signal reconstruction via ℓ1-minimization.

[BibT_eX]

[DOI]

Xing He

Xingxing Ju

Neurocomputing, 2023

MacBERT classification model of memory attention mechanism and its application to the power system of EAST neutral beam injection facility.

[BibT_eX]

[DOI]

Proceedings of the 2023 5th International Conference on Information Technology and Computer Communications, 2023

2022

A Two-Layer Distributed Algorithm Using Neurodynamic System for Solving L1-Minimization.

[BibT_eX]

[DOI]

IEEE Trans. Circuits Syst. II Express Briefs, 2022

Neurodynamic Network for Absolute Value Equations: A Fixed-Time Convergence Technique.

[BibT_eX]

[DOI]

IEEE Trans. Circuits Syst. II Express Briefs, 2022

RNAPhaSep: a resource of RNAs undergoing phase separation.

[BibT_eX]

[DOI]

Nucleic Acids Res., 2022

A PTAS for non-resumable open shop scheduling with an availability constraint.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

A tight approximation algorithm for problem $P2\rightarrow D|v=1, c=1|C_{\max }$.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Decomposition-based scheduling for parallel real-time tasks on multiprocessors.

[BibT_eX]

[DOI]

Liang Zhao

Comput. Electr. Eng., 2022

Synchronization Analysis of Fractional-Order Neural Networks With Adaptive Intermittent-Active Control.

[BibT_eX]

[DOI]

IEEE Access, 2022

Time-Varying Heterogeneous Alternation Control for Synchronization of Delayed Neural Networks.

[BibT_eX]

[DOI]

IEEE Access, 2022

Streaming Hierarchical Clustering Based on Point-Set Kernel.

[BibT_eX]

[DOI]

Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

Combined Load Prediction Model of SVM-LSTM based on Markov Chain Error Correction.

[BibT_eX]

[DOI]

Proceedings of the ICIEI 2022: The 7th International Conference on Information and Education Innovations, Belgrade, Serbia, April 14, 2022

Flow Shop Scheduling Problems with Transportation Constraints Revisited.

[BibT_eX]

[DOI]

Yuan Yuan

Yan Lan

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

GaitPretreatment: Robust Pretreatment Strategy for Gait Recognition.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Communications, 2022

2021

Fault-Tolerant Control for Dynamic Positioning Vessel With Thruster Faults Based on the Neural Modified Extended State Observer.

[BibT_eX]

[DOI]

IEEE Trans. Syst. Man Cybern. Syst., 2021

Narrowing the speedup factor gap of partitioned EDF.

[BibT_eX]

[DOI]

Inf. Comput., 2021

A Fast Algorithm for Knapsack Problem with Conflict Graph.

[BibT_eX]

[DOI]

Asia Pac. J. Oper. Res., 2021

Uni- and bidirectional pedestrian flows through zigzag corridor in a tourism area: a field study.

[BibT_eX]

[DOI]

Adapt. Behav., 2021

Tighter Bounds of Speedup Factor of Partitioned EDF for Constrained-Deadline Sporadic Tasks.

[BibT_eX]

[DOI]

Proceedings of the 42nd IEEE Real-Time Systems Symposium, 2021

CLRS: A Novel CSI-Based Indoor Localization Approach by Region Sectioning.

[BibT_eX]

[DOI]

Proceedings of the 17th International Wireless Communications and Mobile Computing, 2021

Systematic evaluation of abnormal detection methods on gas well sensor data.

[BibT_eX]

[DOI]

Proceedings of the IEEE Symposium on Computers and Communications, 2021

Open Shop Scheduling Problem with a Non-resumable Flexible Maintenance Period.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2021

2020

Analysis of students' learning and psychological features by contrast frequent patterns mining on academic performance.

[BibT_eX]

[DOI]

Neural Comput. Appl., 2020

Approximation algorithms for two-stage flexible flow shop scheduling.

[BibT_eX]

[DOI]

Minghui Zhang

Yan Lan

J. Comb. Optim., 2020

KST-GCN: A Knowledge-Driven Spatial-Temporal Graph Convolutional Network for Traffic Forecasting.

[BibT_eX]

[DOI]

CoRR, 2020

A New Integer Programming Model for the File Transfer Scheduling Problem.

[BibT_eX]

[DOI]

Jingwen Yang

Jiaxin Li

Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020

A Novel Loss Calibration Strategy for Object Detection Networks Training on Sparsely Annotated Pathological Datasets.

[BibT_eX]

[DOI]

Proceedings of the Medical Image Computing and Computer Assisted Intervention - MICCAI 2020, 2020

Automated Tumor Proportion Scoring for Assessment of PD-L1 Expression Based on Multi-Stage Ensemble Strategy.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning in Medical Imaging - 11th International Workshop, 2020

2019

Proportional cost buyback problem with weight bounds.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Online knapsack problem under concave functions.

[BibT_eX]

[DOI]

Qinyang Chen

Theor. Comput. Sci., 2019

Unit Cost Buyback Problem.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

Group topic-author model for efficient discovery of latent social astroturfing groups in tourism domain.

[BibT_eX]

[DOI]

Noora Hashim Alallaq

Muhmmad Al-Khiza'ay

Cybersecur., 2019

NDNVIC: Named Data Networking for Vehicle Infrastructure Cooperation.

[BibT_eX]

[DOI]

IEEE Access, 2019

Online Knapsack Problems with a Resource Buffer.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

User requirements dynamic elicitation of complex products from social network service.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Automation and Computing, 2019

Revised Pulse Algorithm for Elementary Shortest Path Problem with Resource Constraints.

[BibT_eX]

[DOI]

Jiaxin Li

Proceedings of the 2019 Seventh International Symposium on Computing and Networking, 2019

Thoughts of Artificial Intelligence Enhanced Smart Community Management.

[BibT_eX]

[DOI]

Xiaofang Zhou

Weili Wang

Proceedings of the Data Processing Techniques and Applications for Cyber-Physical Systems, 2019

2018

Online buffer management for transmitting packets with processing cycles.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

A General Bin Packing Game: Interest Taken into Account.

[BibT_eX]

[DOI]

Algorithmica, 2018

An Improved Speedup Factor for Sporadic Tasks with Constrained Deadlines Under Dynamic Priority Scheduling.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE Real-Time Systems Symposium, 2018

A New Approximation Algorithm for Flow Shop with Transporter Coordinate.

[BibT_eX]

[DOI]

Yinling Wang

Proceedings of the Theoretical Computer Science - 36th National Conference, 2018

Detecting Suspicious Social Astroturfing Groups in Tourism Social Networks.

[BibT_eX]

[DOI]

Noora Hashim Alallaq

Muhmmad Al-Khiza'ay

Proceedings of the 5th International Conference on Behavioral, 2018

Sentiment Analysis to Enhance Detection of Latent Astroturfing Groups in Online Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Applications and Techniques in Information Security, 2018

2017

Flowshop problem F2 → D|v = 1, c ≥ 1|Cmax revisited.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Online bin packing problem with buffer and bounded size revisited.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

A New Recurrent Neural Network with Fewer Neurons for Quadratic Programming Problems.

[BibT_eX]

[DOI]

Proceedings of the Computational Intelligence and Intelligent Systems, 2017

Online Knapsack Problem Under Concave Functions.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

Re-designing Cloud Platforms for Massive Scale Using a P2P Architecture.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Cloud Computing Technology and Science, 2017

2016

Online minimization knapsack problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Scheduling on parallel identical machines with late work criterion: Offline and online cases.

[BibT_eX]

[DOI]

J. Sched., 2016

带等时空载返程运输的双机Flow shop调度问题复杂性 (Complexity of Flow Shop Scheduling Problems with No-load Return Transportation).

[BibT_eX]

[DOI]

计算机科学, 2016

Complexity of problem TF2|v=1, c=2|Cmax.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

Approximate strip packing: Revisited.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Research on Variation Rule of Sensible Heat Flux in Field Under Different Soil Moisture Content and Underlying Surface by Large Aperture Scintillometer.

[BibT_eX]

[DOI]

Proceedings of the Computer and Computing Technologies in Agriculture X, 2016

2015

Randomized algorithms for online knapsack problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Online bin packing with (1, 1) and (2, R) bins.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2015

Bin Packing Game with an Interest Matrix.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

Black and White Bin Packing Revisited.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Online algorithms for 1-space bounded 2-dimensional bin packing and square packing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Online removable knapsack problem under convex function.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Online Minimum makespan Scheduling with a Buffer.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

Online Unweighted Knapsack Problem with Removal Cost.

[BibT_eX]

[DOI]

Algorithmica, 2014

2013

2D knapsack: Packing squares.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

A Harmonic Algorithm for the 3D Strip Packing Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

A note on a selfish bin packing problem.

[BibT_eX]

[DOI]

J. Glob. Optim., 2013

Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing.

[BibT_eX]

[DOI]

J. Comb. Optim., 2013

Semi-online hierarchical scheduling problems with buffer or rearrangements.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

The Train Delivery Problem Revisited.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Randomized Algorithms for Removable Online Knapsack Problems.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2013

2012

Online call control in cellular networks revisited.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Online scheduling with one rearrangement at the end: Revisited.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Online Knapsack Problem with Removal Cost.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Online Minimum Makespan Scheduling with a Buffer.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011

Online multiple-strip packing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Online scheduling with rearrangement on two related machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Optimal algorithms for online scheduling with bounded rearrangement at the end.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

A new upper bound 2.5545 on 2D Online Bin Packing.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2D Knapsack: Packing Squares.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010

Deterministic on-line call control in cellular networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Online removable knapsack with limited cuts.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Deadline scheduling and power management for speed bounded processors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Dynamic bin packing with unit fraction items revisited.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

A note on online hypercube packing.

[BibT_eX]

[DOI]

Yong Zhou

Central Eur. J. Oper. Res., 2010

Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Graph-Based Semi-supervised Learning with Adaptive Similarity Estimation.

[BibT_eX]

[DOI]

Proceedings of the ICDM 2010, 2010

Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

2009

A note on online strip packing.

[BibT_eX]

[DOI]

J. Comb. Optim., 2009

A note on on-line broadcast scheduling with deadlines.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

A New Upper Bound on 2D Online Bin Packing

[BibT_eX]

[DOI]

CoRR, 2009

Online Knapsack Problems with Limited Cuts.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

On-Line Multiple-Strip Packing.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2009

Models of Antifreeze Proteins Bound to Ice by Tandem Repeat Motif.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Conference on BioMedical Engineering and Informatics, 2009

2008

A fast asymptotic approximation scheme for bin packing with rejection.

[BibT_eX]

[DOI]

Wolfgang W. Bein

José R. Correa

Theor. Comput. Sci., 2008

Online Removable Square Packing.

[BibT_eX]

[DOI]

Kazuo Iwama

Theory Comput. Syst., 2008

On Two Dimensional Orthogonal Knapsack Problem

[BibT_eX]

[DOI]

Kazuo Iwama

CoRR, 2008

2007

Harmonic algorithm for 3-dimensional strip packing problem.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006

Strip Packing vs. Bin Packing.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

New Upper Bounds on The Approximability of 3D Strip Packing

[BibT_eX]

[DOI]

Kazuo Iwama

CoRR, 2006

Improved Online Hypercube Packing.

[BibT_eX]

[DOI]