Log in

Relevant bibliographies by topics / Splitting algorithm / Journal articles

Journal articles on the topic 'Splitting algorithm'

To see the other types of publications on this topic, follow the link: Splitting algorithm.

Author: Grafiati

Published: 11 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Splitting algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Luo, Zhi Kang, Huai Ying Sun, and De Wang. "An Improved SPRINT Algorithm." Advanced Materials Research 532-533 (June 2012): 1685–90. http://dx.doi.org/10.4028/www.scientific.net/amr.532-533.1685.

Full text

Abstract:

This paper presents an improved SPRINT algorithm. The original SPRINT algorithm is a scalable and parallelizable decision tree algorithm, which is a popular algorithm in data mining and machine learning communities. To improve the algorithm's efficiency, we propose an improved algorithm. Firstly, we select the splitting attributes and obtain the best splitting attribute from them by computing the information gain ratio of each attribute. After that, we calculate the best splitting point of the best splitting attribute. Since it avoids a lot of calculations of other attributes, the improved algorithm can effectively reduce the computation.

APA, Harvard, Vancouver, ISO, and other styles

2

Chen, Jinjian, Xingyu Luo, Yuchao Tang, and Qiaoli Dong. "Primal-Dual Splitting Algorithms for Solving Structured Monotone Inclusion with Applications." Symmetry 13, no. 12 (December 13, 2021): 2415. http://dx.doi.org/10.3390/sym13122415.

Full text

Abstract:

This work proposes two different primal-dual splitting algorithms for solving structured monotone inclusion containing a cocoercive operator and the parallel-sum of maximally monotone operators. In particular, the parallel-sum is symmetry. The proposed primal-dual splitting algorithms are derived from two approaches: One is the preconditioned forward–backward splitting algorithm, and the other is the forward–backward–half-forward splitting algorithm. Both algorithms have a simple calculation framework. In particular, the single-valued operators are processed via explicit steps, while the set-valued operators are computed by their resolvents. Numerical experiments on constrained image denoising problems are presented to show the performance of the proposed algorithms.

APA, Harvard, Vancouver, ISO, and other styles

3

Hai, Trinh Ngoc, and Ngo Thi Thuong. "A new splitting algorithm for equilibrium problems and applications." Studia Universitatis Babes-Bolyai Matematica 67, no. 1 (March 10, 2022): 129–44. http://dx.doi.org/10.24193/subbmath.2022.1.09.

Full text

Abstract:

"In this paper, we discuss a new splitting algorithm for solving equilibrium problems arising from Nash-Cournot oligopolistic equilibrium problems in electricity markets with non-convex cost functions. Under the strong pseudomonotonicity of the original bifunction and suitable conditions of the component bifunctions, we prove the strong convergence of the proposed algorithm. Our results improve and develop previously discussed extragradient-like splitting algorithms and general extragradient algorithms. We also present some numerical experiments and compare our algorithm with the existing ones."

APA, Harvard, Vancouver, ISO, and other styles

4

Asqool, Obada, Suhana Koting, and Ahmad Saifizul. "Evaluation of Outlier Filtering Algorithms for Accurate Travel Time Measurement Incorporating Lane-Splitting Situations." Sustainability 13, no. 24 (December 15, 2021): 13851. http://dx.doi.org/10.3390/su132413851.

Full text

Abstract:

Malaysia has a high percentage of motorcycles. Due to lane-splitting, travel times of motorcycles are less than passenger cars at congestion. Because of this, collecting travel times using the media access control (MAC) address is not straightforward. Many outlier filtering algorithms for travel time datasets have not been evaluated for their capability to filter lane-splitting observations. This study aims to identify the best travel time filtering algorithms for the data containing lane-splitting observations and how to use the best algorithm. Two stages were adopted to achieve the objective of the study. The first stage validates the performance of the previous algorithms, and the second stage checks the sensitivity of the algorithm parameters for different days. The analysis uses the travel time data for three routes in Kuala Lumpur collected by Wi-Fi detectors in May 2018. The results show that the Jang algorithm has the best performance for two of the three routes, and the TransGuide algorithm is the best algorithm for one route. However, the parameters of Jang and TransGuide algorithms are sensitive for different days, and the parameters require daily calibration to obtain acceptable results. Using proper calibration of the algorithm parameters, the Jang and TransGuide algorithms produced the most accurate filtered travel time datasets compared to other algorithms

APA, Harvard, Vancouver, ISO, and other styles

5

Ashley, J., and B. H. Marcus. "A generalized state-splitting algorithm." IEEE Transactions on Information Theory 43, no. 4 (July 1997): 1326–38. http://dx.doi.org/10.1109/18.605603.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kripac, Jiri. "Algorithm for splitting planar faces." Computer-Aided Design 19, no. 6 (July 1987): 293–98. http://dx.doi.org/10.1016/0010-4485(87)90282-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Walraven, F. F. Y., and P. V. Van Rompay. "An improved phase-splitting algorithm." Computers & Chemical Engineering 12, no. 8 (August 1988): 777–82. http://dx.doi.org/10.1016/0098-1354(88)80015-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Zhang, Xiaoyu, Genxiang Chen, and Qi Zhang. "LCOS-SLM Based Intelligent Hybrid Algorithm for Beam Splitting." Electronics 11, no. 3 (January 30, 2022): 428. http://dx.doi.org/10.3390/electronics11030428.

Full text

Abstract:

The iterative Fourier transform algorithm (IFTA) is widely used in various optical communication applications based on liquid crystal on silicon spatial light modulators. However, the traditional iterative method has many disadvantages, such as a poor effect, an inability to select an optimization direction, and the failure to consider zero padding or phase quantization. Moreover, after years of development, the emergence of various variant algorithms also makes it difficult for researchers to choose one. In this paper, a new intelligent hybrid algorithm that combines the IFTA and differential evolution algorithm is proposed in a novel way. The reliability of the proposed algorithm is verified by beam splitting, and the IFTA and symmetrical IFTA algorithms, for comparison, are introduced. The hybrid algorithm improves the defects above while considering the zero padding and phase quantization of a computer-generated hologram, which optimizes the directional optimization in the diffraction efficiency and the fidelity of the output beam and improves the results of these two algorithms. As a result, the engineers’ trouble in the selection of an algorithm has also been reduced.

APA, Harvard, Vancouver, ISO, and other styles

9

Zong, Chunxiang, Yuchao Tang, and Yeol Cho. "Convergence Analysis of an Inexact Three-Operator Splitting Algorithm." Symmetry 10, no. 11 (November 1, 2018): 563. http://dx.doi.org/10.3390/sym10110563.

Full text

Abstract:

The three-operator splitting algorithm is a new splitting algorithm for finding monotone inclusion problems of the sum of three maximally monotone operators, where one is cocoercive. As the resolvent operator is not available in a closed form in the original three-operator splitting algorithm, in this paper, we introduce an inexact three-operator splitting algorithm to solve this type of monotone inclusion problem. The theoretical convergence properties of the proposed iterative algorithm are studied in general Hilbert spaces under mild conditions on the iterative parameters. As a corollary, we obtain general convergence results of the inexact forward-backward splitting algorithm and the inexact Douglas-Rachford splitting algorithm, which extend the existing results in the literature.

APA, Harvard, Vancouver, ISO, and other styles

10

Sun, Yong Yong, and Guang Qiu Huang. "Technique of Code Obfuscation Based on Class Splitting." Applied Mechanics and Materials 271-272 (December 2012): 636–40. http://dx.doi.org/10.4028/www.scientific.net/amm.271-272.636.

Full text

Abstract:

The security of software is threatened by piracy, tampering and reverse engineering. Attackers attempt to get important algorithms and sensitive data of software by static analysis or reverse engineering. Software protection becomes an important problem. The algorithm of code obfuscation based on class splitting is proposed that uses of obfuscation technology. The definition of class splitting and realization on algorithm are described. At the same time, the performance on algorithm is analyzed. The obfuscation method enhances the degree of complication about program and static analysis becomes more difficult. The algorithm is applicable to object-oriented program with class structure.

APA, Harvard, Vancouver, ISO, and other styles

11

Hasegawa, K. "A proof algorithm associated with the dipole splitting algorithm." Progress of Theoretical and Experimental Physics 2015, no. 11 (November 2015): 113B08. http://dx.doi.org/10.1093/ptep/ptv159.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Sylla, Cheickna, Colin G. Drury, and A. J. G. Babu. "A Human Factors Design Investigation of a Computerized Layout System of Text-Graphic Technical Materials." Human Factors: The Journal of the Human Factors and Ergonomics Society 30, no. 3 (June 1988): 347–58. http://dx.doi.org/10.1177/001872088803000308.

Full text

Abstract:

In converting task listings into multiple pages of documentation for job aids or training, the two major problems are deciding how much material should go on each page and how text and graphics should be laid out on the page. A questionnaire study was used to collect input from 14 human factors personnel in order to design algorithms for page splitting and page layout. From the rules or heuristics used for page splitting, an algorithm was devised that closely matched human page-splitting results. Layout of individual pages was automated with an algorithm based on the (significant) consensus among the subjects on questions of graphics positioning and label ordering. The two algorithms have been combined in a computer-aided design procedure that automatically pages task lists and lays out individual pages.

APA, Harvard, Vancouver, ISO, and other styles

13

Bhaskar, Ruchika, and Rakesh Sharma. "An Analysis of Vertical Splitting Algorithm." International Journal of Computer Applications 52, no. 18 (August 30, 2012): 30–36. http://dx.doi.org/10.5120/8304-1767.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Cushman, Richard, and Jan A. Sanders. "Splitting algorithm for nilpotent normal forms." Dynamics and Stability of Systems 2, no. 3-4 (January 1988): 235–46. http://dx.doi.org/10.1080/02681118808806041.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Min Sheng, Jiandong Li, and Fan Jiang. "Hybrid splitting algorithm for wireless MAC." IEEE Communications Letters 9, no. 5 (May 2005): 468–70. http://dx.doi.org/10.1109/lcomm.2005.1431174.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Li, Zhizhi, Risheng Chu, and Huai Zhang. "Accelerating the shift-splitting iteration algorithm." Applied Mathematics and Computation 361 (November 2019): 421–29. http://dx.doi.org/10.1016/j.amc.2019.05.056.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Beeckmans, L. "The Splitting Algorithm for Egyptian Fractions." Journal of Number Theory 43, no. 2 (February 1993): 173–85. http://dx.doi.org/10.1006/jnth.1993.1015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Sleit, Azzam, and Esam Al-Nsour. "Corner-based splitting: An improved node splitting algorithm for R-tree." Journal of Information Science 40, no. 2 (January 13, 2014): 222–36. http://dx.doi.org/10.1177/0165551513516709.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

MUNEHISA, TOMO, and HIDEKAZU TANAKA. "ALGORITHM DEPENDENCE OF PARTON SHOWERS IN DEEP INELASTIC SCATTERING." International Journal of Modern Physics A 06, no. 06 (March 10, 1991): 989–1002. http://dx.doi.org/10.1142/s0217751x9100054x.

Full text

Abstract:

Parton showers for deep inelastic electron-proton scattering are studied. Forward and backward evolution algorithms are constructed using the same definitions for splitting and evolution variables. We discuss features of two algorithms and examine algorithm dependence of final parton distributions.

APA, Harvard, Vancouver, ISO, and other styles

20

Ren, Yifei, and Zhiqiang Lu. "A flexible resource investment problem based on project splitting for aircraft moving assembly line." Assembly Automation 39, no. 4 (September 2, 2019): 532–47. http://dx.doi.org/10.1108/aa-09-2018-0126.

Full text

Abstract:

Purpose In response to the station design and flexible resources allocation of the aircraft moving assembly line, a new problem named flexible resource investment problem based on project splitting (FRIP_PS), which minimizes total cost of resources with a given deadline are proposed in this paper. Design/methodology/approach First, a corresponding mathematical model considering project splitting is constructed, which needs to be simultaneously determined together with job scheduling to acquire the optimized project scheduling scheme and resource configurations. Then, an integrated nested optimization algorithm including project splitting policy and job scheduling policy is designed in this paper. In the first stage of the algorithm, a heuristic algorithm designed to get the project splitting scheme and then in the second stage a genetic algorithm with local prospective scheduling strategy is adopted to solve the flexible resource investment problem. Findings The heuristic algorithm of project splitting gets better project splitting results through the job shift selection strategy and meanwhile guides the algorithm of the second stage. Furthermore, the genetic algorithm solves resources allocation and job schedule through evaluation rules which can effectively solve the delayed execution of jobs because of improper allocation of flexible resources. Originality/value This paper represents a new extension of the resource investment problem based on aircraft moving assembly line. An effective integrated nested optimization algorithm is proposed to specify station splitting scheme, job scheduling scheme and resources allocation in the assembly lines, which is significant for practical engineering applications.

APA, Harvard, Vancouver, ISO, and other styles

21

Morais, Camilo L. M., Marfran C. D. Santos, Kássio M. G. Lima, and Francis L. Martin. "Improving data splitting for classification applications in spectrochemical analyses employing a random-mutation Kennard-Stone algorithm approach." Bioinformatics 35, no. 24 (May 22, 2019): 5257–63. http://dx.doi.org/10.1093/bioinformatics/btz421.

Full text

Abstract:

Abstract Motivation Data splitting is a fundamental step for building classification models with spectral data, especially in biomedical applications. This approach is performed following pre-processing and prior to model construction, and consists of dividing the samples into at least training and test sets; herein, the training set is used for model construction and the test set for model validation. Some of the most-used methodologies for data splitting are the random selection (RS) and the Kennard-Stone (KS) algorithms; here, the former works based on a random splitting process and the latter is based on the calculation of the Euclidian distance between the samples. We propose an algorithm called the Morais-Lima-Martin (MLM) algorithm, as an alternative method to improve data splitting in classification models. MLM is a modification of KS algorithm by adding a random-mutation factor. Results RS, KS and MLM performance are compared in simulated and six real-world biospectroscopic applications using principal component analysis linear discriminant analysis (PCA-LDA). MLM generated a better predictive performance in comparison with RS and KS algorithms, in particular regarding sensitivity and specificity values. Classification is found to be more well-equilibrated using MLM. RS showed the poorest predictive response, followed by KS which showed good accuracy towards prediction, but relatively unbalanced sensitivities and specificities. These findings demonstrate the potential of this new MLM algorithm as a sample selection method for classification applications in comparison with other regular methods often applied in this type of data. Availability and implementation MLM algorithm is freely available for MATLAB at https://doi.org/10.6084/m9.figshare.7393517.v1.

APA, Harvard, Vancouver, ISO, and other styles

22

Liu, Huanlin, Hongyue Dai, Fei Zhai, Yong Chen, and Chengying Wei. "Longest Path Reroute to Optimize the Optical Multicast Routing in Sparse Splitting WDM Networks." International Journal of Optics 2015 (2015): 1–6. http://dx.doi.org/10.1155/2015/489356.

Full text

Abstract:

Limited by the sparse light-splitting capability in WDM networks, some nodes need to reroute the optical packet to different destination nodes with the high cost of routing for reducing packet loss possibility. In the paper, the longest path reroute optimization algorithm is put forward to jointly optimize the multicast routing cost and wavelength channel assignment cost for sparse splitting WDM networks. Based on heuristic algorithms, the longest path reroute routing algorithm calls multiple longest paths in existing multicast tree to reroute the path passing from the nodes which are violating the light-splitting constraint to the nodes which are not violating light-splitting constraint with few wavelength channels and low rerouting cost. And a wavelength cost control factor is designed to select the reroute path with the lowest cost by comparing the multicast rerouting path cost increment with the equivalent wavelength channel required cost increment. By adjusting wavelength cost control factor, we can usually get the optimized multicast routing according to the actual network available wavelength conversion cost. Simulation results show that the proposed algorithm can get the low-cost multicast tree and reduce the required number of wavelength channels.

APA, Harvard, Vancouver, ISO, and other styles

23

Lian, Qi, and Zhi Qiang Wu. "Membrane Computing Based Virtual Network Embedding Algorithm with Path Splitting." Applied Mechanics and Materials 687-691 (November 2014): 2997–3002. http://dx.doi.org/10.4028/www.scientific.net/amm.687-691.2997.

Full text

Abstract:

Network virtualization is recognized as an important enabler technology to diversify the future Internet and the Virtual Network Embedding problem is major challenge to fulfill it. In this paper, we proposed a parallel Virtual Network Embedding algorithm with Path splitting on the basis of membrane Computing (VNEPC). And more importantly, it is one phase embedding algorithm that maps virtual nodes and virtual links in the same phase without decomposing the VNE problem. Extensive simulation results show that our proposed VNEPC algorithm outperforms the existing algorithms in long-term average revenue, acceptance ratio and long-term R/C ratio.

APA, Harvard, Vancouver, ISO, and other styles

24

Wang, Liping, and Wenhui Fan. "A multi-level splitting algorithm based on differential evolution." International Journal of Modeling, Simulation, and Scientific Computing 09, no. 02 (March 20, 2018): 1850021. http://dx.doi.org/10.1142/s1793962318500216.

Full text

Abstract:

Multi-level splitting algorithm is a famous rare event simulation (RES) method which reaches rare set through splitting samples during simulation. Since choosing sample paths is a key factor of the method, this paper embeds differential evolution in multi-level splitting mechanism to improve the sampling strategy and precision, so as to improve the algorithm efficiency. Examples of rare event probability estimation demonstrate that the new proposed algorithm performs well in convergence rate and precision for a set of benchmark cases.

APA, Harvard, Vancouver, ISO, and other styles

25

Li, Q. Y., and L. Sun. "Technical Note: Watershed strategy for oceanic mesoscale eddy splitting." Ocean Science 11, no. 2 (March 20, 2015): 269–73. http://dx.doi.org/10.5194/os-11-269-2015.

Full text

Abstract:

Abstract. To identify oceanic mononuclear mesoscale eddies, a threshold-free splitting method was developed based on the watershed. Because oceanic eddies are similar to plateaus and basins in the map of the sea level anomaly (SLA) data, the natural divisions of the basins are the watersheds between them. The splitting algorithm is based on identifying these watersheds by finding the path of steepest descent. Compared to previous splitting methods, the proposed splitting algorithm has some advantages. First, there are no artificial parameters. Second, the algorithm is robust; the splitting strategy is independent of the algorithm and procedure and automatically guarantees that the split mononuclear eddies are simply connected pixel sets. Third, the new method is very fast, and the time complexity is O(N), where N is the number of multinuclear eddy pixels; each pixel is scanned only once for splitting, regardless of how many extremes there are. Fourth, the algorithm is independent of parameters; the strategy can potentially be applied to any possible physical parameters (e.g. SLA, geostrophic potential vorticity, Okubo–Weiss parameter). Besides, the present strategy can also be applied to automatic identification of troughs and ridges from weather charts. Because this general method can be applied to a variety of eddy parameter fields, we denoted it the Universal Splitting Technology for Circulations (USTC) method.

APA, Harvard, Vancouver, ISO, and other styles

26

Li, Q. Y., and L. Sun. "Technical Note: Watershed strategy for oceanic mesoscale eddy splitting." Ocean Science Discussions 11, no. 3 (June 30, 2014): 1719–32. http://dx.doi.org/10.5194/osd-11-1719-2014.

Full text

Abstract:

Abstract. To identify oceanic mononuclear mesoscale eddies, a threshold-free splitting method was developed based on the watershed. Because oceanic eddies are similar to plateaus and basins in the map of the sea level anomaly (SLA) data, the natural divisions of the basins are the watersheds between them. The splitting algorithm is based on identifying these watersheds by finding the path of steepest descent. Compared to previous splitting methods, the proposed splitting algorithm has some advantages. First, there are no artificial parameters. Second, the algorithm is robust; the splitting strategy is independent of the algorithm and procedure and automatically guarantees that the split mononuclear eddies are simply-connected pixel sets. Third, the new method is very fast, and the time complexity is O(N), where N is the number of multinuclear eddy pixels; each pixel is scanned only once for splitting, regardless of how many extremes there are. Fourth, the algorithm is independent of parameters; the strategy can potentially be applied to any possible physical parameters (e.g., SLA, geostrophic potential vorticity, Okubo–Weiss parameter, etc.). Besides, the present strategy can also be applied to automatic identification of troughs and ridges from weather charts. Because this general method can be applied to a variety of eddy parameter fields, we denoted it the Universal Splitting Technology for Circulations (USTC) method.

APA, Harvard, Vancouver, ISO, and other styles

27

Patrascu, Andrei, and Paul Irofti. "Stochastic proximal splitting algorithm for composite minimization." Optimization Letters 15, no. 6 (January 25, 2021): 2255–73. http://dx.doi.org/10.1007/s11590-021-01702-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Kosolapov, Yury V., and Aleksey N. Shigaev. "The Support Splitting Algorithm for Induced Codes." Modeling and Analysis of Information Systems 25, no. 3 (June 30, 2018): 276–90. http://dx.doi.org/10.18255/1818-1015-2018-3-276-290.

Full text

Abstract:

In the paper, the analysis of the stability of the McEliece-type cryptosystem on induced codes for key attacks is examined. In particular, a model is considered when the automorphism group is trivial for the base code C, on the basis of which the induced code Flq⊗ C is constructed. In this case, as shown by N. Sendrier in 2000, there exists such a mapping, called a complete discriminant, by means of which a secret permutation that is part of the secret key of a McEliece-type cryptosystem can be effectively found. The automorphism group of the code Flq⊗ C is nontrivial, therefore there is no complete discriminant for this code. This suggests a potentially high resistance of the McEliece-type cryptosystem on the code Flq⊗ C. The algorithm for splitting the support for the code Flq⊗ C is constructed and the efficiency of this algorithm is compared with the existing attack on the key of the McElice type cryptosystem based on the code Flq⊗ C.

APA, Harvard, Vancouver, ISO, and other styles

29

Su, Zhao Bin, Zong Xi Cai, and Yi Lan Kang. "An Element Splitting Algorithm for Crack Propagation." Applied Mechanics and Materials 90-93 (September 2011): 2277–81. http://dx.doi.org/10.4028/www.scientific.net/amm.90-93.2277.

Full text

Abstract:

A new algorithm is presented for the finite element analysis of fracture mechanics. The algorithm allows crack propagation in any direction, and guarantees the crack path smoothly. This is achieved by tracking the path of the crack tip and by introducing a new remeshing method. Examples show that this algorithm is efficient for 2D problems.

APA, Harvard, Vancouver, ISO, and other styles

30

Hyatt, R. M. "The Dynamic Tree-Splitting Parallel Search Algorithm." ICGA Journal 20, no. 1 (March 1, 1997): 3–19. http://dx.doi.org/10.3233/icg-1997-20102.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Watson, K. H., and J. W. Giffin. "The Vertex Splitting Algorithm for facilities layout." International Journal of Production Research 35, no. 9 (September 1997): 2477–92. http://dx.doi.org/10.1080/002075497194615.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Murray, Leslie, Héctor Cancela, and Gerardo Rubino. "A splitting algorithm for network reliability estimation." IIE Transactions 45, no. 2 (February 2013): 177–89. http://dx.doi.org/10.1080/0740817x.2012.677574.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Blum, H., S. Lisky, and R. Rannacher. "A domain splitting algorithm for parabolic problems." Computing 49, no. 1 (March 1992): 11–23. http://dx.doi.org/10.1007/bf02238647.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Jackowski, Konrad. "Adaptive Splitting and Selection Algorithm for Regression." New Generation Computing 33, no. 4 (July 2015): 425–48. http://dx.doi.org/10.1007/s00354-015-0405-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

GENG, Chun, Hiromasa SUZUKI, Dong-ming YAN, Takashi MICHIKAWA, Yutaka OHTAKE, Yuichi SATO, Masayoshi HASHIMA, and Eiji Ohta. "2212 Algorithm for Splitting Plate Mesh Model." Proceedings of Design & Systems Conference 2009.19 (2009): 386–88. http://dx.doi.org/10.1299/jsmedsd.2009.19.386.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Wang, Liping, and Wenhui Fan. "A multilevel splitting algorithm for quick sampling." Tsinghua Science and Technology 26, no. 4 (August 2021): 417–25. http://dx.doi.org/10.26599/tst.2020.9010006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Lackenby, Marc. "Links with splitting number one." Geometriae Dedicata 214, no. 1 (April 20, 2021): 319–51. http://dx.doi.org/10.1007/s10711-021-00618-x.

Full text

Abstract:

AbstractWe provide an algorithm to determine whether a link L admits a crossing change that turns it into a split link, under some fairly mild hypotheses on L. The algorithm also provides a complete list of all such crossing changes. It can therefore also determine whether the unlinking number of L is 1.

APA, Harvard, Vancouver, ISO, and other styles

38

Pramudiani, Puri, and Tatang Herman. "Students' Mathematical Thinking in Column Calculation and Algorithms." Jurnal Cendekia : Jurnal Pendidikan Matematika 5, no. 2 (July 12, 2021): 1928–42. http://dx.doi.org/10.31004/cendekia.v5i2.697.

Full text

Abstract:

This study aims to investigate primary school students’ mathematical thinking in column calculation and algorithms. The method used in this research is qualitative descriptive. The participants of this research were twelve Indonesian primary school students at grade 3 and 4 in Ciparay, Bandung, West Java. They worked to solve calculation and algorithm questions developed from TAL TEAM book Freudenthal Institute, Utrecht University, The Netherlands that were classified based on the strategies used. After analyzing their written works, interviews were organized to acquire further information about their mathematical thinking. The study found that students’ strategies in dealing with calculation algorithm consist of three strategies. The first strategy is the splitting strategy from units to tens column and then the interim results are combined. The second strategy is the splitting strategy used from tens to unit column and the interim results are added vertically digit-by-digit. The third strategy is the transition from splitting strategy from units to tens column consists primarily of using abbreviated column calculation for the interim results in each column. In addition, several students made common mistakes due to misconception about algorithm and arithmetical problems. Implication of this research for teaching and learning calculation and algorithms were described elaborately.

APA, Harvard, Vancouver, ISO, and other styles

39

Abraham, Minu Treesa, Neelima Satyam, Revuri Lokesh, Biswajeet Pradhan, and Abdullah Alamri. "Factors Affecting Landslide Susceptibility Mapping: Assessing the Influence of Different Machine Learning Approaches, Sampling Strategies and Data Splitting." Land 10, no. 9 (September 19, 2021): 989. http://dx.doi.org/10.3390/land10090989.

Full text

Abstract:

Data driven methods are widely used for the development of Landslide Susceptibility Mapping (LSM). The results of these methods are sensitive to different factors, such as the quality of input data, choice of algorithm, sampling strategies, and data splitting ratios. In this study, five different Machine Learning (ML) algorithms are used for LSM for the Wayanad district in Kerala, India, using two different sampling strategies and nine different train to test ratios in cross validation. The results show that Random Forest (RF), K Nearest Neighbors (KNN), and Support Vector Machine (SVM) algorithms provide better results than Naïve Bayes (NB) and Logistic Regression (LR) for the study area. NB and LR algorithms are less sensitive to the sampling strategy and data splitting, while the performance of the other three algorithms is considerably influenced by the sampling strategy. From the results, both the choice of algorithm and sampling strategy are critical in obtaining the best suited landslide susceptibility map for a region. The accuracies of KNN, RF, and SVM algorithms have increased by 10.51%, 10.02%, and 4.98% with the use of polygon landslide inventory data, while for NB and LR algorithms, the performance was slightly reduced with the use of polygon data. Thus, the sampling strategy and data splitting ratio are less consequential with NB and algorithms, while more data points provide better results for KNN, RF, and SVM algorithms.

APA, Harvard, Vancouver, ISO, and other styles

40

Tan, Yong, Gui Xiong Liu, and Guo Guang Wu. "Cardinality Estimation-Based Adaptive Multi-Tree Splitting Algorithm for RFID System." Applied Mechanics and Materials 239-240 (December 2012): 1373–76. http://dx.doi.org/10.4028/www.scientific.net/amm.239-240.1373.

Full text

Abstract:

This paper proposes a cardinality estimation-based adaptive multi-tree splitting (CEAMS) algorithm. Tag number is estimated by using the depth information obtained from the first tag identification and adaptively assigns the splitting strategy according to the splitting subset rule table. Simulation results show that the average total number of timeslots can be reduced by 65% compared with DBS and the system throughput is about 0.52 when the number of tags ranged from 5 ~ 1000.

APA, Harvard, Vancouver, ISO, and other styles

41

Chen, Xiaobiao, Meiyu Zhang, Gaoshe Lian, and Lichen Chai. "New Inexact Parallel Splitting Algorithm for a Class of Separable Convex Programming." Wireless Communications and Mobile Computing 2022 (February 23, 2022): 1–6. http://dx.doi.org/10.1155/2022/8054688.

Full text

Abstract:

In this paper, a new inexact parallel splitting algorithm based on the shrinkage algorithm is proposed. We bring in inexact terms, and new iteration points are obtained by the parallel splitting method. A new descent direction and a proper step length are derived. Under reasonable assumptions, the convergence of the algorithm is demonstrated. Some matrix correction problem experiments show that the algorithm is efficient and easy to implement.

APA, Harvard, Vancouver, ISO, and other styles

42

Yang, Jian, Fei Tang, Qing Fen Liao, and Yi Fei Wang. "Study on a Controlled Splitting Scheme Based on Layer Expanding Graph Algorithm." Applied Mechanics and Materials 577 (July 2014): 974–77. http://dx.doi.org/10.4028/www.scientific.net/amm.577.974.

Full text

Abstract:

Optimal controlled splitting is an emergency strategy to split the power system into several sub-regions based on global electrical information before the collapse of the system which is subject to severe disturbances. How to seek the optimal splitting sections rapidly and accurately is a key problem in controlled splitting field. A controlled splitting scheme based on layer expanding graph algorithm is presented in this paper. Firstly, source nodes of island regions extend out for the formation of the island regions. Secondly, island regions can be combined to make up synchronous sub-regions on the basis of the clustering of generators. At last, the optimal sections can be determined according to the initial and improved adjustment of splitting sections. Moreover, the scheme proposed can be adapt to the change of operation mode of the power system. The accuracy and effectiveness of the scheme is shown by the simulation results of CEPRI 36-bus system.

APA, Harvard, Vancouver, ISO, and other styles

43

Wu, Yan Hai, Shao Hua Zhao, Nan Wu, and Hao Zhang. "An Improved Touching-Cell Splitting Algorithm Based on Bottleneck Detection." Applied Mechanics and Materials 411-414 (September 2013): 1159–63. http://dx.doi.org/10.4028/www.scientific.net/amm.411-414.1159.

Full text

Abstract:

In terms of the phenomenon that red cells and white cells incline to touch each other in urinary sediment images, an improved touching-cell splitting algorithm is proposed in the paper that is based on the bottleneck detection The proposed algorithm is featured by positioning the bottleneck points by the rule of bottleneck, also featured by determining to split a region or not by the criteria of segmentation conditions. Once a splitting is done, the algorithm turn to apply the bottleneck detection again to those regions that are already been segmented. Simulation and experiment show that the performance of the improved algorithm is accurate and stable in splitting ranging from two touched cells to multiple touched circumstances; the enhanced robustness and universality can be enough to prove the practicability of the algorithm a certain level.

APA, Harvard, Vancouver, ISO, and other styles

44

Nurhopipah, Ade, and Uswatun Hasanah. "Dataset Splitting Techniques Comparison For Face Classification on CCTV Images." IJCCS (Indonesian Journal of Computing and Cybernetics Systems) 14, no. 4 (October 31, 2020): 341. http://dx.doi.org/10.22146/ijccs.58092.

Full text

Abstract:

The performance of classification models in machine learning algorithms is influenced by many factors, one of which is dataset splitting method. To avoid overfitting, it is important to apply a suitable dataset splitting strategy. This study presents comparison of four dataset splitting techniques, namely Random Sub-sampling Validation (RSV), k-Fold Cross Validation (k-FCV), Bootstrap Validation (BV) and Moralis Lima Martin Validation (MLMV). This comparison is done in face classification on CCTV images using Convolutional Neural Network (CNN) algorithm and Support Vector Machine (SVM) algorithm. This study is also applied in two image datasets. The results of the comparison are reviewed by using model accuracy in training set, validation set and test set, also bias and variance of the model. The experiment shows that k-FCV technique has more stable performance and provide high accuracy on training set as well as good generalizations on validation set and test set. Meanwhile, data splitting using MLMV technique has lower performance than the other three techniques since it yields lower accuracy. This technique also shows higher bias and variance values and it builds overfitting models, especially when it is applied on validation set.

APA, Harvard, Vancouver, ISO, and other styles

45

Huang, Wenli, Yuchao Tang, Meng Wen, and Haiyang Li. "Relaxed Variable Metric Primal-Dual Fixed-Point Algorithm with Applications." Mathematics 10, no. 22 (November 20, 2022): 4372. http://dx.doi.org/10.3390/math10224372.

Full text

Abstract:

In this paper, a relaxed variable metric primal-dual fixed-point algorithm is proposed for solving the convex optimization problem involving the sum of two convex functions where one is differentiable with the Lipschitz continuous gradient while the other is composed of a linear operator. Based on the preconditioned forward–backward splitting algorithm, the convergence of the proposed algorithm is proved. At the same time, we show that some existing algorithms are special cases of the proposed algorithm. Furthermore, the ergodic convergence and linear convergence rates of the proposed algorithm are established under relaxed parameters. Numerical experiments on the image deblurring problems demonstrate that the proposed algorithm outperforms some existing algorithms in terms of the number of iterations.

APA, Harvard, Vancouver, ISO, and other styles

46

Xue, Xirui, Shucai Huang, and Daozhi Wei. "Combined AGADESN with DBSCAN Algorithm for Cluster Target Motion Intention Recognition." International Journal of Aerospace Engineering 2022 (October 22, 2022): 1–16. http://dx.doi.org/10.1155/2022/8220029.

Full text

Abstract:

In this paper, we consider the problem of motion intention recognition for cluster targets with splitting behaviour and lack of motion prior information. This is a challenge to the classical Bayesian inference based intention recognition algorithms because they rely heavily on a priori knowledge. In order to solve these problems, a joint algorithm of deep echo state network optimized by adaptive genetic algorithm (AGADESN) and DBSCAN clustering algorithm is proposed in this paper. We use improved Olfati-Saber model with direction noise to generate cluster motion and use the cluster motion data to drive AGADESN algorithm to predict cluster destination, which achieves higher destination prediction accuracy than DESN algorithm. We innovatively design the motion similarity distance (MSD) and take the destination prediction output as one of the distance inputs, alleviating the lack of differentiation among different cluster targets caused by only relying on speed and position distance at the early stage of cluster motion. Based on the MSD, DBSCAN clustering algorithm is used to identify clusters in the field of view to determine whether splitting behaviour occurs. Simulation results demonstrate the effectiveness of the proposed algorithm in cluster target motion intention recognition and its superiority over DESN algorithm and DBSCAN algorithm only based on speed and position distance.

APA, Harvard, Vancouver, ISO, and other styles

47

Li, Yifei, Jinlin Wang, Xiao Chen, and Jinghong Wu. "SplitTrie: A Fast Update Packet Classification Algorithm with Trie Splitting." Electronics 11, no. 2 (January 10, 2022): 199. http://dx.doi.org/10.3390/electronics11020199.

Full text

Abstract:

Software Defined Network (SDN) currently is widely used in the implementation of new network technologies owing to its distinctive advantages. In changeable SDN environments, the update performance of SDN switches has significant importance for the overall network performance because packet processing could be interrupted by ruleset updating in SDN switches. In order to guarantee high update performance, we propose a new classification algorithm, SplitTrie, based on trie structures and trie splitting. SplitTrie splits rulesets according to the field type vectors of rules. The splitting can improve the update performance because it reduces the trie structure sizes. Experimental results demonstrated that SplitTrie could achieve 20 times of update speed in the complex rulesets comparing the method without trie splitting.

APA, Harvard, Vancouver, ISO, and other styles

48

Hasegawa, K. "Dipole splitting algorithm: A practical algorithm to use the dipole subtraction procedure." Progress of Theoretical and Experimental Physics 2015, no. 11 (November 2015): 113B07. http://dx.doi.org/10.1093/ptep/ptv158.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Doğan, Erdi, and Nuran Yörükeren. "Binary pathfinder algorithm for bus splitting optimisation problem." IET Generation, Transmission & Distribution 14, no. 26 (December 2020): 6613–23. http://dx.doi.org/10.1049/iet-gtd.2020.0729.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Kosolapov, Yu V., and A. N. Shigaev. "On the Support Splitting Algorithm for Induced Codes." Automatic Control and Computer Sciences 53, no. 7 (December 2019): 719–29. http://dx.doi.org/10.3103/s0146411619070125.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!