To diagnose the feasibility of the solution of a job-shop scheduling problem(JSSP),a test algorithm based on diagraph and heuristic search is developed and verified through a case study.Meanwhile,a new repair algori...To diagnose the feasibility of the solution of a job-shop scheduling problem(JSSP),a test algorithm based on diagraph and heuristic search is developed and verified through a case study.Meanwhile,a new repair algorithm for modifying an infeasible solution of the JSSP to become a feasible solution is proposed for the general JSSP.The computational complexity of the test algorithm and the repair algorithm is both O(n) under the worst-case scenario,and O(2J+M) for the repair algorithm under the best-case scenario.The repair algorithm is not limited to specific optimization methods,such as local tabu search,genetic algorithms and shifting bottleneck procedures for job shop scheduling,but applicable to generic infeasible solutions for the JSSP to achieve feasibility.展开更多
Feedforward symbol timing recovery techniques are particularly important for initial acquisition in burst modems. However, these techniques either have large calculation burden or sensitive to frequency offsets. In th...Feedforward symbol timing recovery techniques are particularly important for initial acquisition in burst modems. However, these techniques either have large calculation burden or sensitive to frequency offsets. In this paper, we proposed an efficient symbol timing recovery algorithm of MPSK signals named OMQ(Ordered Maximum power using Quadratic approximation partially) algorithm which is based on the Quadratic Approximation(QA) algorithm. We used ordered statistic sorting method to reduce the computational complexity further, meanwhile maximum mean power principle was used to decrease frequency offset sensitivity. The proposed algorithm adopts estimation-down sampling structure which is suitable for small packet size transmission. The results show that, while comparing with the QA algorithm, the computational complexity is reduced by 75% at most when 8 samples per symbol are used. The proposed algorithm shows better performance in terms of the jitter variance and sensitivity to frequency offsets.展开更多
In this paper,we propose a novel adjustable multiple cross-hexagonal search(AMCHS) algorithm for fast block motion estimation. It employs adjustable multiple cross search patterns(AMCSP) in the first step and then use...In this paper,we propose a novel adjustable multiple cross-hexagonal search(AMCHS) algorithm for fast block motion estimation. It employs adjustable multiple cross search patterns(AMCSP) in the first step and then uses half-way-skip and half-way-stop technique to determine whether to employ two hexagonal search patterns(HSPs) subsequently. The AMCSP can be used to find small motion vectors efficiently while the HSPs can be used to find large ones accurately to ensure prediction quality. Simulation results showed that our proposed AMCHS achieves faster search speed,and provides better distortion performance than other popular fast search algorithms,such as CDS and CDHS.展开更多
This paper describes an extremely fast polynomial time algorithm, the NOVCA (Near Optimal Vertex Cover Algorithm) that produces an optimal or near optimal vertex cover for any known undirected graph G (V, E). NOVC...This paper describes an extremely fast polynomial time algorithm, the NOVCA (Near Optimal Vertex Cover Algorithm) that produces an optimal or near optimal vertex cover for any known undirected graph G (V, E). NOVCA is based on the idea of(l) including the vertex having maximum degree in the vertex cover and (2) rendering the degree of a vertex to zero by including all its adjacent vertices. The three versions of algorithm, NOVCA-I, NOVCA-II, and NOVCA-random, have been developed. The results identifying bounds on the size of the minimum vertex cover as well as polynomial complexity of algorithm are given with experimental verification. Future research efforts will be directed at tuning the algorithm and providing proof for better approximation ratio with NOVCA compared to any available vertex cover algorithms.展开更多
Two efficient and low complexity multiuser scheduling algorithms are proposed for the uplink multi- ple-input multiple-output systems in this paper. Conventionally, the exhaustive search algorithm (ESA) can give the...Two efficient and low complexity multiuser scheduling algorithms are proposed for the uplink multi- ple-input multiple-output systems in this paper. Conventionally, the exhaustive search algorithm (ESA) can give the optimal performance; however, it is complexity prohibitive for practical implementation. Aiming at re- ducing the complexity while keeping the achievable sum rate performance, two heuristic algorithms are proposed for the multiuser scheduling problems: the improved genetic algorithm and simplified norm-based greedy algo- rithm. Moreover, we also consider the heterogeneity scenario where a modified grouping-based user selection al- gorithm is given to guarantee the user' s fairness. Specifically, the asymptotic behavior of the norm-based greed- y algorithm is given when each user is equipped with one antenna. Numerical examples demonstrate the superi- ority of our proposed schedulin~ and ~rouoin~ algorithms.展开更多
The aim of this paper is to reveal the mechanism of compromise and change in coordination where players agree in general but disagree on coordination methods. When players agree on the need to collaborate but are in c...The aim of this paper is to reveal the mechanism of compromise and change in coordination where players agree in general but disagree on coordination methods. When players agree on the need to collaborate but are in conflict regarding the specific method, one player must always compromise. This situation is known as the Battle of the Sexes in game theory. It has ever been believed that if an agreement is reached under such circumstances, the players do not have the incentive to withdraw from the agreement. However, this study shows that this belief is not always true if the players were able to revise the outcome of their negotiations later. The wide-ranging fields use game theories for their analysis frameworks to analyze the success or failure of coordination. However, comparing with the possibility of betrayal illustrated as a well-known Prisoner Dilemma, it has been rare to discuss conflict regarding the specific method of coordination, although such situations are often observed in today's interdependent real world. The repeated Battle of the Sexes games presented in this study would be a useful framework to analyze conflict regarding the specific method of coordination.展开更多
Objective:To observe the clinical efficacy of mind-refreshing and balance-restoring needling method combined with Frenkel exercises in treating ataxia after cerebral stroke.Methods:The recruited 120 patients were rand...Objective:To observe the clinical efficacy of mind-refreshing and balance-restoring needling method combined with Frenkel exercises in treating ataxia after cerebral stroke.Methods:The recruited 120 patients were randomized into an observation group and a control group,with 60 cases in each group.The control group was intervened by mind-refreshing and balance-restoring needling method,while the observation group was given additional lower-limb Frenkel exercises.Before and after treatment and at the follow-up,the ataxic lower-limb function was scored using Berg balance scale(BBS)and international cooperative ataxia rating scale(ICARS),and Barthel index(BI)was adopted to score the activities of daily living(ADL).Results:After treatment,the markedly effective rate was 70.2%and the total effective rate was 96.5%in the observation group,versus 39.7%and 87.9%in the control group,and the differences in the markedly effective rate and the total effective rate were statistically significant(P<0.01,P<0.05).The intra-group comparisons showed that the BBS,ICARS and BI scores after treatment and at the follow-up were significantly different from those before treatment in both groups(all P<0.01).There were significant differences in the BBS score between the two groups after treatment and at the follow-up(P<0.05,P<0.01);the between-group differences in the ICARS and BI scores were statistically insignificant after treatment(both P>0.05),while the between-group differences in the ICARS and BI scores were statistically significant at the follow-up(both P<0.05).The interaction effects between the scoring time of BBS and BI and the group factor were statistically significant(P<0.01,P<0.05).Conclusion:Mind-refreshing and balance-restoring needling can effectively improve the lower-limb ataxic symptoms and ADL after stroke;when combined with Fenkel exercises,this needling method can produce more significant efficacy.展开更多
In the field of oil well logging, real-time monitoring of the fluid flow parameter provides a scientific basis for oil and gas optimization exploration and increase in reservoir recovery, so a non-intrusive flow test ...In the field of oil well logging, real-time monitoring of the fluid flow parameter provides a scientific basis for oil and gas optimization exploration and increase in reservoir recovery, so a non-intrusive flow test method based on turbulent vibration was proposed. The specific length of the sensor fiber wound tightly around the outer wall of the pipe was connected with the optical fiber gratings at both ends, and the sensor fiber and the optical fiber gratings composed the flow sensing unit. The dynamic pressure was generated by the turbulence when fluid flows through the pipe, and the dynamic pressure resulted in the light phase shift of the sensor fiber. The phase information was demodulated by the fiber optic interferometer technology, time division multiplexing technology, and phase generated carrier modulation and demodulation techniques. The quadratic curve relationship between the phase change and flow rate was found by experimental data analysis, and the experiment confirmed the feasibility of the optical fiber flow test method with non-intrusion and achieved the real-time monitoring of the fluid flow.展开更多
基金The US National Science Foundation (No. CMMI-0408390, CMMI-0644552)the Research Fellowship for International Young Scientists (No. 51050110143)+2 种基金the Fok Ying-Tong Education Foundation(No. 114024)the Natural Science Foundation of Jiangsu Province (No.BK2009015)the Postdoctoral Science Foundation of Jiangsu Province (No.0901005C)
文摘To diagnose the feasibility of the solution of a job-shop scheduling problem(JSSP),a test algorithm based on diagraph and heuristic search is developed and verified through a case study.Meanwhile,a new repair algorithm for modifying an infeasible solution of the JSSP to become a feasible solution is proposed for the general JSSP.The computational complexity of the test algorithm and the repair algorithm is both O(n) under the worst-case scenario,and O(2J+M) for the repair algorithm under the best-case scenario.The repair algorithm is not limited to specific optimization methods,such as local tabu search,genetic algorithms and shifting bottleneck procedures for job shop scheduling,but applicable to generic infeasible solutions for the JSSP to achieve feasibility.
基金supported by the National Natural Science Foundation of China(NSFC.NO.61303253)
文摘Feedforward symbol timing recovery techniques are particularly important for initial acquisition in burst modems. However, these techniques either have large calculation burden or sensitive to frequency offsets. In this paper, we proposed an efficient symbol timing recovery algorithm of MPSK signals named OMQ(Ordered Maximum power using Quadratic approximation partially) algorithm which is based on the Quadratic Approximation(QA) algorithm. We used ordered statistic sorting method to reduce the computational complexity further, meanwhile maximum mean power principle was used to decrease frequency offset sensitivity. The proposed algorithm adopts estimation-down sampling structure which is suitable for small packet size transmission. The results show that, while comparing with the QA algorithm, the computational complexity is reduced by 75% at most when 8 samples per symbol are used. The proposed algorithm shows better performance in terms of the jitter variance and sensitivity to frequency offsets.
文摘In this paper,we propose a novel adjustable multiple cross-hexagonal search(AMCHS) algorithm for fast block motion estimation. It employs adjustable multiple cross search patterns(AMCSP) in the first step and then uses half-way-skip and half-way-stop technique to determine whether to employ two hexagonal search patterns(HSPs) subsequently. The AMCSP can be used to find small motion vectors efficiently while the HSPs can be used to find large ones accurately to ensure prediction quality. Simulation results showed that our proposed AMCHS achieves faster search speed,and provides better distortion performance than other popular fast search algorithms,such as CDS and CDHS.
文摘This paper describes an extremely fast polynomial time algorithm, the NOVCA (Near Optimal Vertex Cover Algorithm) that produces an optimal or near optimal vertex cover for any known undirected graph G (V, E). NOVCA is based on the idea of(l) including the vertex having maximum degree in the vertex cover and (2) rendering the degree of a vertex to zero by including all its adjacent vertices. The three versions of algorithm, NOVCA-I, NOVCA-II, and NOVCA-random, have been developed. The results identifying bounds on the size of the minimum vertex cover as well as polynomial complexity of algorithm are given with experimental verification. Future research efforts will be directed at tuning the algorithm and providing proof for better approximation ratio with NOVCA compared to any available vertex cover algorithms.
基金Sponsored by the Technology Specific Project(Grant No. 2010ZX03002-003-01)
文摘Two efficient and low complexity multiuser scheduling algorithms are proposed for the uplink multi- ple-input multiple-output systems in this paper. Conventionally, the exhaustive search algorithm (ESA) can give the optimal performance; however, it is complexity prohibitive for practical implementation. Aiming at re- ducing the complexity while keeping the achievable sum rate performance, two heuristic algorithms are proposed for the multiuser scheduling problems: the improved genetic algorithm and simplified norm-based greedy algo- rithm. Moreover, we also consider the heterogeneity scenario where a modified grouping-based user selection al- gorithm is given to guarantee the user' s fairness. Specifically, the asymptotic behavior of the norm-based greed- y algorithm is given when each user is equipped with one antenna. Numerical examples demonstrate the superi- ority of our proposed schedulin~ and ~rouoin~ algorithms.
文摘The aim of this paper is to reveal the mechanism of compromise and change in coordination where players agree in general but disagree on coordination methods. When players agree on the need to collaborate but are in conflict regarding the specific method, one player must always compromise. This situation is known as the Battle of the Sexes in game theory. It has ever been believed that if an agreement is reached under such circumstances, the players do not have the incentive to withdraw from the agreement. However, this study shows that this belief is not always true if the players were able to revise the outcome of their negotiations later. The wide-ranging fields use game theories for their analysis frameworks to analyze the success or failure of coordination. However, comparing with the possibility of betrayal illustrated as a well-known Prisoner Dilemma, it has been rare to discuss conflict regarding the specific method of coordination, although such situations are often observed in today's interdependent real world. The repeated Battle of the Sexes games presented in this study would be a useful framework to analyze conflict regarding the specific method of coordination.
文摘Objective:To observe the clinical efficacy of mind-refreshing and balance-restoring needling method combined with Frenkel exercises in treating ataxia after cerebral stroke.Methods:The recruited 120 patients were randomized into an observation group and a control group,with 60 cases in each group.The control group was intervened by mind-refreshing and balance-restoring needling method,while the observation group was given additional lower-limb Frenkel exercises.Before and after treatment and at the follow-up,the ataxic lower-limb function was scored using Berg balance scale(BBS)and international cooperative ataxia rating scale(ICARS),and Barthel index(BI)was adopted to score the activities of daily living(ADL).Results:After treatment,the markedly effective rate was 70.2%and the total effective rate was 96.5%in the observation group,versus 39.7%and 87.9%in the control group,and the differences in the markedly effective rate and the total effective rate were statistically significant(P<0.01,P<0.05).The intra-group comparisons showed that the BBS,ICARS and BI scores after treatment and at the follow-up were significantly different from those before treatment in both groups(all P<0.01).There were significant differences in the BBS score between the two groups after treatment and at the follow-up(P<0.05,P<0.01);the between-group differences in the ICARS and BI scores were statistically insignificant after treatment(both P>0.05),while the between-group differences in the ICARS and BI scores were statistically significant at the follow-up(both P<0.05).The interaction effects between the scoring time of BBS and BI and the group factor were statistically significant(P<0.01,P<0.05).Conclusion:Mind-refreshing and balance-restoring needling can effectively improve the lower-limb ataxic symptoms and ADL after stroke;when combined with Fenkel exercises,this needling method can produce more significant efficacy.
文摘In the field of oil well logging, real-time monitoring of the fluid flow parameter provides a scientific basis for oil and gas optimization exploration and increase in reservoir recovery, so a non-intrusive flow test method based on turbulent vibration was proposed. The specific length of the sensor fiber wound tightly around the outer wall of the pipe was connected with the optical fiber gratings at both ends, and the sensor fiber and the optical fiber gratings composed the flow sensing unit. The dynamic pressure was generated by the turbulence when fluid flows through the pipe, and the dynamic pressure resulted in the light phase shift of the sensor fiber. The phase information was demodulated by the fiber optic interferometer technology, time division multiplexing technology, and phase generated carrier modulation and demodulation techniques. The quadratic curve relationship between the phase change and flow rate was found by experimental data analysis, and the experiment confirmed the feasibility of the optical fiber flow test method with non-intrusion and achieved the real-time monitoring of the fluid flow.