Several results on iterative methods for equilibrium problems have been proposed and studied in the literature.Most of these results are obtained when the associated bifunction of the equilibrium problem is either a m...Several results on iterative methods for equilibrium problems have been proposed and studied in the literature.Most of these results are obtained when the associated bifunction of the equilibrium problem is either a monotone or pseudomonotone operator.Results on iterative methods for equilibrium problems without monotonicity conditions on the bifunction are still few in the literature.In this paper,we study equilibrium problems for which the underlined bifunction is not assumed any form of monotonicity.We propose two weakly convergent iterative algorithms and one strongly convergent algorithm.We obtain our convergence results without assuming either monotonicity or pseudomonotonicity condition on the bifunction.Our proposed algorithms are tested numerically to be more efficient and faster than some few available algorithms for equilibrium problems without monotonicity in the literature.展开更多
This paper studies a strongly convergent inertial forward-backward-forward algorithm for the variational inequality problem in Hilbert spaces.In our convergence analysis,we do not assume the on-line rule of the inerti...This paper studies a strongly convergent inertial forward-backward-forward algorithm for the variational inequality problem in Hilbert spaces.In our convergence analysis,we do not assume the on-line rule of the inertial parameters and the iterates,which have been assumed by several authors whenever a strongly convergent algorithm with an inertial extrapolation step is proposed for a variational inequality problem.Consequently,our proof arguments are different from what is obtainable in the relevant literature.Finally,we give numerical tests to confirm the theoretical analysis and show that our proposed algorithm is superior to related ones in the literature.展开更多
Organizations need to use a proved methodology to reduce implementation risks and enable the enterprise resource planning （ERP） solution to be put into operation as quickly as possible. The right implementation meth...Organizations need to use a proved methodology to reduce implementation risks and enable the enterprise resource planning （ERP） solution to be put into operation as quickly as possible. The right implementation methodology will also help ensure that the ERP implementation fully addresses an organization＇s business goals and objectives. Modern ERP implementation methodology encourages and supports a progressive approach to the management for users of ERP systems. A company is constantly seeking better methods and models for decision supports in all kinds of decisions and developing/copying new products/markets that generate the growth of the company. On the other hand, a company creates efficient and effective operations that improve the return on investment, because ERP is always considered as an asset. This paper focuses on the interaction of culture in a company, business strategy, and organizational skills and balances the relationship among ERP methodology, ERP implementation, and the performance of the company. Considering the fact that different ERP systems use different methodologies, short descriptions of the most dominant brand name ERP are analyzed （Oracle Financials, PeopleSoft, and systems, applications, and products （SAP） implementation methodology）. Although all methodologies may look similar, the selection of a proper methodology is the most critical part in ERP investment. The focus of this paper is on the accelerated SAP methodology, also named as ASAP methodology, because it is the most used one on the worldwide market of ERP systems.展开更多
The visions of Industry 4.0 and 5.0 have reinforced the industrial environment.They have also made artificial intelligence incorporated as a major facilitator.Diagnosing machine faults has become a solid foundation fo...The visions of Industry 4.0 and 5.0 have reinforced the industrial environment.They have also made artificial intelligence incorporated as a major facilitator.Diagnosing machine faults has become a solid foundation for automatically recognizing machine failure,and thus timely maintenance can ensure safe operations.Transfer learning is a promising solution that can enhance the machine fault diagnosis model by borrowing pre-trained knowledge from the source model and applying it to the target model,which typically involves two datasets.In response to the availability of multiple datasets,this paper proposes using selective and adaptive incremental transfer learning(SA-ITL),which fuses three algorithms,namely,the hybrid selective algorithm,the transferability enhancement algorithm,and the incremental transfer learning algorithm.It is a selective algorithm that enables selecting and ordering appropriate datasets for transfer learning and selecting useful knowledge to avoid negative transfer.The algorithm also adaptively adjusts the portion of training data to balance the learning rate and training time.The proposed algorithm is evaluated and analyzed using ten benchmark datasets.Compared with other algorithms from existing works,SA-ITL improves the accuracy of all datasets.Ablation studies present the accuracy enhancements of the SA-ITL,including the hybrid selective algorithm(1.22%-3.82%),transferability enhancement algorithm(1.91%-4.15%),and incremental transfer learning algorithm(0.605%-2.68%).These also show the benefits of enhancing the target model with heterogeneous image datasets that widen the range of domain selection between source and target domains.展开更多
Multi-view dynamic three-dimensional reconstruction has typically required the use of custom shutter-synchronized camera rigs in order to capture scenes containing rapid movements or complex topology changes. In this ...Multi-view dynamic three-dimensional reconstruction has typically required the use of custom shutter-synchronized camera rigs in order to capture scenes containing rapid movements or complex topology changes. In this paper, we demonstrate that multiple unsynchronized low-cost RGB-D cameras can be used for the same purpose. To alleviate issues caused by unsynchronized shutters, we propose a novel depth frame interpolation technique that allows synchronized data capture from highly dynamic 3 D scenes. To manage the resulting huge number of input depth images, we also introduce an efficient moving least squares-based volumetric reconstruction method that generates triangle meshes of the scene. Our approach does not store the reconstruction volume in memory,making it memory-efficient and scalable to large scenes.Our implementation is completely GPU based and works in real time. The results shown herein, obtained with real data, demonstrate the effectiveness of our proposed method and its advantages compared to stateof-the-art approaches.展开更多
Symbolic execution is widely used in many code analysis, testing, and verification tools. As symbolic execu- tion exhaustively explores all feasible paths, it is quite time consuming. To handle the problem, researcher...Symbolic execution is widely used in many code analysis, testing, and verification tools. As symbolic execu- tion exhaustively explores all feasible paths, it is quite time consuming. To handle the problem, researchers have par- alleled existing symbolic execution tools （e.g., KLEE）. In particular, Cloud9 is a widely used paralleled symbolic exe- cution tool, and researchers have used the tool to analyze real code. However, researchers criticize that tools such as Cloud9 still cannot analyze large scale code. In this paper, we con- duct a field study on Cloud9, in which we use KLEE and Cloud9 to analyze benchmarks in C. Our results confirm the criticism. Based on the results, we identify three bottlenecks that hinder the performance of Cloud9： the communication time gap, the job transfer policy, and the cache management of the solved constraints. To handle these problems, we tune the communication time gap with better parameters, modify the job transfer policy, and implement an approach for cache management of solved constraints. We conduct two evalua- tions on our benchmarks and a real application to understand our improvements. Our results show that our tuned Cloud9 reduces the execution time significantly, both on our bench- marks and the real application. Furthermore, our evaluation results show that our tuning techniques improve the effective- ness on all the devices, and the improvement can be achievedupto five times, depending upon a tuning value of our ap- proach and the behaviour of program under test.展开更多
For stroke-order free online multi-stroke charac- ter recognition, stroke-to-stroke correspondence search be- tween an input pattern and a reference pattern plays an im- portant role to deal with the stroke-order vari...For stroke-order free online multi-stroke charac- ter recognition, stroke-to-stroke correspondence search be- tween an input pattern and a reference pattern plays an im- portant role to deal with the stroke-order variation. Although various methods of stroke correspondence have been pro- posed, no comparative study for clarifying the relative su- periority of those methods has been done before. In this pa- per, we firstly review the approaches for solving the stroke- order variation problem. Then, five representative methods of stroke correspondence proposed by different groups, includ- ing cube search （CS）, bipartite weighted matching （BWM）, individual correspondence decision （ICD）, stable marriage （SM）, and deviation-expansion model （DE）, are experimen- tally compared, mainly in regard of recognition accuracy and efficiency. The experimental results on an online Kanji char- acter dataset, showed that 99.17%, 99.17%, 96.37%, 98.54%, and 96.59% were attained by CS, BWM, ICD, SM, and DE, respectively as their recognition rates. Extensive discussions are made on their relative superiorities and practicalities.展开更多
Purpose–This paper aims to present an approach for a bio-inspired decentralization topology control mechanism,called force-based genetic algorithm(FGA),where a genetic algorithm(GA)is run by each holonomic autonomous...Purpose–This paper aims to present an approach for a bio-inspired decentralization topology control mechanism,called force-based genetic algorithm(FGA),where a genetic algorithm(GA)is run by each holonomic autonomous vehicle(HAV)in a mobile ad hoc network(MANET)as software agent to achieve a uniform spread of HAVs and to provide a fully connected network over an unknown geographical terrain.An HAV runs its own FGA to decide its next movement direction and speed based on local neighborhood information,such as obstacles and the number of neighbors,without a centralized control unit or global knowledge.Design/methodology/approach-The objective function used in FGA is inspired by the equilibrium of the molecules in physics where each molecule tries to be in the balanced position to spend minimum energy to maintain its position.In this approach,a virtual force is assumed to be applied by the neighboring HAVs to a given HAV.At equilibrium,the aggregate virtual force applied to an HAV by its neighbors should sum up to zero.If the aggregate virtual force is not zero,it is used as a fitness value for the HAV.The value of this virtual force depends on the number of neighbors within the communication range of Rcom and the distance among them.Each chromosome in our GA-based framework is composed of speed and movement direction.The FGA is independently run by each HAV as a topology control mechanism and only utilizes information from neighbors and local terrain to make movement and speed decisions to converge towards a uniform distribution of HAVs.The authors developed an analytical model,simulation software and several testbeds to study the convergence properties of the FGA.Findings-The paper finds that coverage-centric,bio-inspired,mobile node deployment algorithm ensures effective sensing coverage for each mobile node after initial deployment.The FGA is also an energy-aware self-organization framework since it reduces energy consumption by eliminating unnecessary excessive movements.Fault-tolerance is another important feature of the GA-based approach since the FGA is resilient to losses and malfunctions of HAVs.Furthermore,the analytical results show that the authors’bio-inspired approach is effective in terms of convergence speed and area coverage uniformity.As seen from the experimental results,the FGA delivers promising results for uniform autonomous mobile node distribution over an unknown geographical terrain.Originality/value-The proposed decentralized and bio-inspired approach for autonomous mobile nodes can be used as a real-time topology control mechanism for commercial and military applications since it adapts to local environment rapidly but does not require global network knowledge.展开更多
Model checking is a formal verification technique. It takes an exhaustively strategy to check hardware circuits and network protocols against desired properties. Having been developed for more than three decades, mode...Model checking is a formal verification technique. It takes an exhaustively strategy to check hardware circuits and network protocols against desired properties. Having been developed for more than three decades, model checking is now playing an important role in software engineering for verifying rather complicated software artifacts. This paper surveys the role of model checking in software engineering. In particular, we searched for the related liter- atures published at reputed conferences, symposiums, workshops, and journals, and took a survey of （1） various model checking techniques that can be adapted to software development and their implementations, and （2） the use of model checking at different stages of a software development life cycle. We observed that model checking is useful for soft- ware debugging, constraint solving, and malware detection, and it can help verify different types of software systems, such as object- and aspect-oriented systems, service-oriented applications, web-based applications, and GUI applications including safety- and mission-critical systems. The survey is expected to help human engineers understand the role of model checking in software engineering, and as well decide which model checking technique（s） and/or tool（s） are applicable for developing, analyzing and verifying a practical software system. For researchers, the survey also points out how model checking has been adapted to their research topics on software engineering and its challenges.展开更多
文摘Several results on iterative methods for equilibrium problems have been proposed and studied in the literature.Most of these results are obtained when the associated bifunction of the equilibrium problem is either a monotone or pseudomonotone operator.Results on iterative methods for equilibrium problems without monotonicity conditions on the bifunction are still few in the literature.In this paper,we study equilibrium problems for which the underlined bifunction is not assumed any form of monotonicity.We propose two weakly convergent iterative algorithms and one strongly convergent algorithm.We obtain our convergence results without assuming either monotonicity or pseudomonotonicity condition on the bifunction.Our proposed algorithms are tested numerically to be more efficient and faster than some few available algorithms for equilibrium problems without monotonicity in the literature.
文摘This paper studies a strongly convergent inertial forward-backward-forward algorithm for the variational inequality problem in Hilbert spaces.In our convergence analysis,we do not assume the on-line rule of the inertial parameters and the iterates,which have been assumed by several authors whenever a strongly convergent algorithm with an inertial extrapolation step is proposed for a variational inequality problem.Consequently,our proof arguments are different from what is obtainable in the relevant literature.Finally,we give numerical tests to confirm the theoretical analysis and show that our proposed algorithm is superior to related ones in the literature.
文摘Organizations need to use a proved methodology to reduce implementation risks and enable the enterprise resource planning （ERP） solution to be put into operation as quickly as possible. The right implementation methodology will also help ensure that the ERP implementation fully addresses an organization＇s business goals and objectives. Modern ERP implementation methodology encourages and supports a progressive approach to the management for users of ERP systems. A company is constantly seeking better methods and models for decision supports in all kinds of decisions and developing/copying new products/markets that generate the growth of the company. On the other hand, a company creates efficient and effective operations that improve the return on investment, because ERP is always considered as an asset. This paper focuses on the interaction of culture in a company, business strategy, and organizational skills and balances the relationship among ERP methodology, ERP implementation, and the performance of the company. Considering the fact that different ERP systems use different methodologies, short descriptions of the most dominant brand name ERP are analyzed （Oracle Financials, PeopleSoft, and systems, applications, and products （SAP） implementation methodology）. Although all methodologies may look similar, the selection of a proper methodology is the most critical part in ERP investment. The focus of this paper is on the accelerated SAP methodology, also named as ASAP methodology, because it is the most used one on the worldwide market of ERP systems.
文摘The visions of Industry 4.0 and 5.0 have reinforced the industrial environment.They have also made artificial intelligence incorporated as a major facilitator.Diagnosing machine faults has become a solid foundation for automatically recognizing machine failure,and thus timely maintenance can ensure safe operations.Transfer learning is a promising solution that can enhance the machine fault diagnosis model by borrowing pre-trained knowledge from the source model and applying it to the target model,which typically involves two datasets.In response to the availability of multiple datasets,this paper proposes using selective and adaptive incremental transfer learning(SA-ITL),which fuses three algorithms,namely,the hybrid selective algorithm,the transferability enhancement algorithm,and the incremental transfer learning algorithm.It is a selective algorithm that enables selecting and ordering appropriate datasets for transfer learning and selecting useful knowledge to avoid negative transfer.The algorithm also adaptively adjusts the portion of training data to balance the learning rate and training time.The proposed algorithm is evaluated and analyzed using ten benchmark datasets.Compared with other algorithms from existing works,SA-ITL improves the accuracy of all datasets.Ablation studies present the accuracy enhancements of the SA-ITL,including the hybrid selective algorithm(1.22%-3.82%),transferability enhancement algorithm(1.91%-4.15%),and incremental transfer learning algorithm(0.605%-2.68%).These also show the benefits of enhancing the target model with heterogeneous image datasets that widen the range of domain selection between source and target domains.
文摘Multi-view dynamic three-dimensional reconstruction has typically required the use of custom shutter-synchronized camera rigs in order to capture scenes containing rapid movements or complex topology changes. In this paper, we demonstrate that multiple unsynchronized low-cost RGB-D cameras can be used for the same purpose. To alleviate issues caused by unsynchronized shutters, we propose a novel depth frame interpolation technique that allows synchronized data capture from highly dynamic 3 D scenes. To manage the resulting huge number of input depth images, we also introduce an efficient moving least squares-based volumetric reconstruction method that generates triangle meshes of the scene. Our approach does not store the reconstruction volume in memory,making it memory-efficient and scalable to large scenes.Our implementation is completely GPU based and works in real time. The results shown herein, obtained with real data, demonstrate the effectiveness of our proposed method and its advantages compared to stateof-the-art approaches.
文摘Symbolic execution is widely used in many code analysis, testing, and verification tools. As symbolic execu- tion exhaustively explores all feasible paths, it is quite time consuming. To handle the problem, researchers have par- alleled existing symbolic execution tools （e.g., KLEE）. In particular, Cloud9 is a widely used paralleled symbolic exe- cution tool, and researchers have used the tool to analyze real code. However, researchers criticize that tools such as Cloud9 still cannot analyze large scale code. In this paper, we con- duct a field study on Cloud9, in which we use KLEE and Cloud9 to analyze benchmarks in C. Our results confirm the criticism. Based on the results, we identify three bottlenecks that hinder the performance of Cloud9： the communication time gap, the job transfer policy, and the cache management of the solved constraints. To handle these problems, we tune the communication time gap with better parameters, modify the job transfer policy, and implement an approach for cache management of solved constraints. We conduct two evalua- tions on our benchmarks and a real application to understand our improvements. Our results show that our tuned Cloud9 reduces the execution time significantly, both on our bench- marks and the real application. Furthermore, our evaluation results show that our tuning techniques improve the effective- ness on all the devices, and the improvement can be achievedupto five times, depending upon a tuning value of our ap- proach and the behaviour of program under test.
文摘For stroke-order free online multi-stroke charac- ter recognition, stroke-to-stroke correspondence search be- tween an input pattern and a reference pattern plays an im- portant role to deal with the stroke-order variation. Although various methods of stroke correspondence have been pro- posed, no comparative study for clarifying the relative su- periority of those methods has been done before. In this pa- per, we firstly review the approaches for solving the stroke- order variation problem. Then, five representative methods of stroke correspondence proposed by different groups, includ- ing cube search （CS）, bipartite weighted matching （BWM）, individual correspondence decision （ICD）, stable marriage （SM）, and deviation-expansion model （DE）, are experimen- tally compared, mainly in regard of recognition accuracy and efficiency. The experimental results on an online Kanji char- acter dataset, showed that 99.17%, 99.17%, 96.37%, 98.54%, and 96.59% were attained by CS, BWM, ICD, SM, and DE, respectively as their recognition rates. Extensive discussions are made on their relative superiorities and practicalities.
基金supported by US Army Communications Electronics Command(CECOM)contracts W15P7T-06-C-P217 andW15P7T-09-C-S021the National Science Foundation grants ECS-0421159 and CNS-0619577.
文摘Purpose–This paper aims to present an approach for a bio-inspired decentralization topology control mechanism,called force-based genetic algorithm(FGA),where a genetic algorithm(GA)is run by each holonomic autonomous vehicle(HAV)in a mobile ad hoc network(MANET)as software agent to achieve a uniform spread of HAVs and to provide a fully connected network over an unknown geographical terrain.An HAV runs its own FGA to decide its next movement direction and speed based on local neighborhood information,such as obstacles and the number of neighbors,without a centralized control unit or global knowledge.Design/methodology/approach-The objective function used in FGA is inspired by the equilibrium of the molecules in physics where each molecule tries to be in the balanced position to spend minimum energy to maintain its position.In this approach,a virtual force is assumed to be applied by the neighboring HAVs to a given HAV.At equilibrium,the aggregate virtual force applied to an HAV by its neighbors should sum up to zero.If the aggregate virtual force is not zero,it is used as a fitness value for the HAV.The value of this virtual force depends on the number of neighbors within the communication range of Rcom and the distance among them.Each chromosome in our GA-based framework is composed of speed and movement direction.The FGA is independently run by each HAV as a topology control mechanism and only utilizes information from neighbors and local terrain to make movement and speed decisions to converge towards a uniform distribution of HAVs.The authors developed an analytical model,simulation software and several testbeds to study the convergence properties of the FGA.Findings-The paper finds that coverage-centric,bio-inspired,mobile node deployment algorithm ensures effective sensing coverage for each mobile node after initial deployment.The FGA is also an energy-aware self-organization framework since it reduces energy consumption by eliminating unnecessary excessive movements.Fault-tolerance is another important feature of the GA-based approach since the FGA is resilient to losses and malfunctions of HAVs.Furthermore,the analytical results show that the authors’bio-inspired approach is effective in terms of convergence speed and area coverage uniformity.As seen from the experimental results,the FGA delivers promising results for uniform autonomous mobile node distribution over an unknown geographical terrain.Originality/value-The proposed decentralized and bio-inspired approach for autonomous mobile nodes can be used as a real-time topology control mechanism for commercial and military applications since it adapts to local environment rapidly but does not require global network knowledge.
文摘Model checking is a formal verification technique. It takes an exhaustively strategy to check hardware circuits and network protocols against desired properties. Having been developed for more than three decades, model checking is now playing an important role in software engineering for verifying rather complicated software artifacts. This paper surveys the role of model checking in software engineering. In particular, we searched for the related liter- atures published at reputed conferences, symposiums, workshops, and journals, and took a survey of （1） various model checking techniques that can be adapted to software development and their implementations, and （2） the use of model checking at different stages of a software development life cycle. We observed that model checking is useful for soft- ware debugging, constraint solving, and malware detection, and it can help verify different types of software systems, such as object- and aspect-oriented systems, service-oriented applications, web-based applications, and GUI applications including safety- and mission-critical systems. The survey is expected to help human engineers understand the role of model checking in software engineering, and as well decide which model checking technique（s） and/or tool（s） are applicable for developing, analyzing and verifying a practical software system. For researchers, the survey also points out how model checking has been adapted to their research topics on software engineering and its challenges.
