Effect of slice scope on data slice-based class cohesion metrics

This paper suggests that a single class rather than methods should be used as the slice scope to compute class cohesion. First, for a given attribute, the statements in all methods that last define the attribute are computed. Then, the forward and backward data slices for this attribute are generated by using the class as the slice scope and are combined to compute the corresponding class data slice. Finally, the class cohesion is computed based on all class data slices for the attributes. Compared to traditional cohesion metrics that use methods as the slice scope, the proposed metrics that use a single class as slice scope take into account the possible interactions between the methods. The experimental results show that class cohesion can be more accurately measured when using the class as the slice scope.

Fast Parallel Algorithm for Slicing STL Based on Pipeline

In Additive Manufacturing field, the current researches of data processing mainly focus on a slicing process of large STL files or complicated CAD models. To improve the efficiency and reduce the slicing time, a parallel algorithm has great advantages. However, traditional algorithms can＇t make full use of multi-core CPU hardware resources. In the paper, a fast parallel algorithm is presented to speed up data processing. A pipeline mode is adopted to design the parallel algorithm. And the complexity of the pipeline algorithm is analyzed theoretically. To evaluate the performance of the new algorithm, effects of threads number and layers number are investigated by a serial of experiments. The experimental results show that the threads number and layers number are two remarkable factors to the speedup ratio. The tendency of speedup versus threads number reveals a positive relationship which greatly agrees with the Amdahl＇s law, and the tendency of speedup versus layers number also keeps a positive relationship agreeing with Gustafson＇s law. The new algorithm uses topological information to compute contours with a parallel method of speedup. Another parallel algorithm based on data parallel is used in experiments to show that pipeline parallel mode is more efficient. A case study at last shows a suspending performance of the new parallel algorithm. Compared with the serial slicing algorithm, the new pipeline parallel algorithm can make full use of the multi-core CPU hardware, accelerate the slicing process, and compared with the data parallel slicing algorithm, the new slicing algorithm in this paper adopts a pipeline parallel model, and a much higher speedup ratio and efficiency is achieved.

Intelligent tools and techniques for modern management

In order to make decisions all companies need information. As a rule, all the informatics systems of a company contain a multitude of data and turn these data into information that has to be analyzed in order to make decisions. It is a slow process. The solution of this drawback is given by Business Intelligence （BI） applications that can help companies increase income or diminish costs by offering the executive management appropriate information on the basis of which quick and efficient decisions can be taken.The main purpose of the paper is to prove the necessity that BI tools should be used by the modem manager. Managers are aware of that by putting into practice the BI solutions, opportunities of getting control over the business process and methods are improved and better, timely analysis functions of the performance parameters can be obtained.

Slice Data Based Support Generation Algorithm for Fused Deposition Modeling

This paper presents a robust algorithm to generate support for fused deposition modeling (FDM). Since many flaws appear in most stereo lithography (STL) models, this algorithm utilizes slice data as input. A top-down approach was used to calculate the support slice layer by layer. The generation algorithm was described in detail including the slice grouping, oriental bounding box (OBB) calculation, offsetting, and Boolean operations. Several cases are given to validate the efficiency and robustness of the procedure. The algorithm provides necessary support not only for hanging surface but also for hanging vertexes and edges with O(n) time complexity, where n is the number of layers. The algorithm fully utilizes the parts’ self-support ability and reduces support volume to the maximum extent. This slice data based algorithm has the same efficiency as the STL based algorithm but is more stable, which significantly enhances the robustness of the support generation process.