In many engineering applications, it is necessary to calculate the min-area encasing box of a circumscription. In this paper, an algorithm for generating the min-area rectangle encasing box, based on revolving angle, ...In many engineering applications, it is necessary to calculate the min-area encasing box of a circumscription. In this paper, an algorithm for generating the min-area rectangle encasing box, based on revolving angle, is investigated and hence put forward. The algorithm computes the areas of the outer rectangular bounds of a closed contour in different revolving angles θ by dispersing approach where 0< θ < π/2 because of the axial symmetry. It is very simple, straight forward and highly efficient. The complexity of its computing time reaches O(n·k ). Practical applications suggest its usefulness and efficiency.展开更多
Web services are becoming an important paradigm for web-based computing. However the mainstream web service description language such as WSDL (Web Service Description Language) is lack of formal basis. In order to ver...Web services are becoming an important paradigm for web-based computing. However the mainstream web service description language such as WSDL (Web Service Description Language) is lack of formal basis. In order to verify the behavioral properties of web services, we adopt the π-calculus as a precise language because it provides many useful facilities such as behavioral equivalence, mobility that are lack in other formal language. The basic elements of WSDL are translated into the terms in the π-calculus. By means of the MWB (Mobility Workbench), a concurrency tool, the behavioral property of web services denoted by processes is verified.展开更多
A support system for form-correction of Chinese characters is developedbased upon a generation model SAM, and its feasibility is evaluated. SAMis excelIent as a model for generating Chinese characters, but it is diffi...A support system for form-correction of Chinese characters is developedbased upon a generation model SAM, and its feasibility is evaluated. SAMis excelIent as a model for generating Chinese characters, but it is difficult todetermine appropriate parameters because the use of calligraphic knowledge isneeded. By noticing that calligraphic knowledge of calligraphists is includedin their corrective actions, we adopt a strategy to acquire calligraphic knowl-edge by monitoring, recording and analyzing corrective actions of calligraphists,and try to realize an environment under which calligraphists can easily makecorrections to character forms and which can record corrective actions of cal-ligraphists without interfering with them. In this paper, we first construct amodel of correcting procedurcs of calligraphists, which is composed of typicalcorrecting procedures that are acquired by extensively observing their correc-tive actions and interviewing them, and develop a form-correcting system forbrush-written Chinese characters by using the model. Secondly, through actualcorrecting experiments, we demonstrate that parameters within SAM can beeasily corrected at the level of character patterns by our system, and show thatit is effective and easy for calligraphists to be used by evaluating effectivenessof the correcting model, sufficiency of its functions and execution speed.展开更多
in this paper the algorithms for self-stabilizing communication protocols are studied. First some concepts and a formal method for describing theproposed algorithms are described, then an improved algorithm for achiev...in this paper the algorithms for self-stabilizing communication protocols are studied. First some concepts and a formal method for describing theproposed algorithms are described, then an improved algorithm for achieving globalstates is presented. The study shows that the improved algorithm can be appliedto obtain the global states in the case of a loss of cooperation of the different processes in the protocol, which can be used as a recovery point that will be used bythe following recovery procedure. Thus, the improved algorithm can be used toself-stabilize a communication protocol. Meanwhile, a recovery algorithm for selfstabilizing communication protocols is presented. After a failure is detected, allProcesses can eventually know the error. The recovery algorithm uses the contextualinformation exchanged during the progress of the protocol and recorded on the stablememory. The proof of correctness and analysis of complexity for these algorithmshave been made. The availability and efficiency of the algorithms have been verifiedby illustrating the example protocols. Finally, some conclusions and remarks aregiven.展开更多
This paper presents a new microarchitecture technique named DYNAMEM,in which memory reference instructions are dynamically scheduled and can be executed out-of-order. Load instructions can bypass store instructions sp...This paper presents a new microarchitecture technique named DYNAMEM,in which memory reference instructions are dynamically scheduled and can be executed out-of-order. Load instructions can bypass store instructions specula-tively, even if the store instructions'addresses are unknown. DYNAMEM can greatly alleviate the restraints of ambiguous memory dependencies. Simulation results show that the frequency of false load is low. Mechanism has been pro-vided to repair false loads with low penalty, and to achieve precise interrupts.Discussions and experimental results show that DYNAMEM could dramatically raise instruction-level parallelism in programs without recompilation.展开更多
文摘In many engineering applications, it is necessary to calculate the min-area encasing box of a circumscription. In this paper, an algorithm for generating the min-area rectangle encasing box, based on revolving angle, is investigated and hence put forward. The algorithm computes the areas of the outer rectangular bounds of a closed contour in different revolving angles θ by dispersing approach where 0< θ < π/2 because of the axial symmetry. It is very simple, straight forward and highly efficient. The complexity of its computing time reaches O(n·k ). Practical applications suggest its usefulness and efficiency.
文摘Web services are becoming an important paradigm for web-based computing. However the mainstream web service description language such as WSDL (Web Service Description Language) is lack of formal basis. In order to verify the behavioral properties of web services, we adopt the π-calculus as a precise language because it provides many useful facilities such as behavioral equivalence, mobility that are lack in other formal language. The basic elements of WSDL are translated into the terms in the π-calculus. By means of the MWB (Mobility Workbench), a concurrency tool, the behavioral property of web services denoted by processes is verified.
文摘A support system for form-correction of Chinese characters is developedbased upon a generation model SAM, and its feasibility is evaluated. SAMis excelIent as a model for generating Chinese characters, but it is difficult todetermine appropriate parameters because the use of calligraphic knowledge isneeded. By noticing that calligraphic knowledge of calligraphists is includedin their corrective actions, we adopt a strategy to acquire calligraphic knowl-edge by monitoring, recording and analyzing corrective actions of calligraphists,and try to realize an environment under which calligraphists can easily makecorrections to character forms and which can record corrective actions of cal-ligraphists without interfering with them. In this paper, we first construct amodel of correcting procedurcs of calligraphists, which is composed of typicalcorrecting procedures that are acquired by extensively observing their correc-tive actions and interviewing them, and develop a form-correcting system forbrush-written Chinese characters by using the model. Secondly, through actualcorrecting experiments, we demonstrate that parameters within SAM can beeasily corrected at the level of character patterns by our system, and show thatit is effective and easy for calligraphists to be used by evaluating effectivenessof the correcting model, sufficiency of its functions and execution speed.
文摘in this paper the algorithms for self-stabilizing communication protocols are studied. First some concepts and a formal method for describing theproposed algorithms are described, then an improved algorithm for achieving globalstates is presented. The study shows that the improved algorithm can be appliedto obtain the global states in the case of a loss of cooperation of the different processes in the protocol, which can be used as a recovery point that will be used bythe following recovery procedure. Thus, the improved algorithm can be used toself-stabilize a communication protocol. Meanwhile, a recovery algorithm for selfstabilizing communication protocols is presented. After a failure is detected, allProcesses can eventually know the error. The recovery algorithm uses the contextualinformation exchanged during the progress of the protocol and recorded on the stablememory. The proof of correctness and analysis of complexity for these algorithmshave been made. The availability and efficiency of the algorithms have been verifiedby illustrating the example protocols. Finally, some conclusions and remarks aregiven.
文摘This paper presents a new microarchitecture technique named DYNAMEM,in which memory reference instructions are dynamically scheduled and can be executed out-of-order. Load instructions can bypass store instructions specula-tively, even if the store instructions'addresses are unknown. DYNAMEM can greatly alleviate the restraints of ambiguous memory dependencies. Simulation results show that the frequency of false load is low. Mechanism has been pro-vided to repair false loads with low penalty, and to achieve precise interrupts.Discussions and experimental results show that DYNAMEM could dramatically raise instruction-level parallelism in programs without recompilation.
