42 results on '"*PSEUDOCODE (Computer program language)"'
Search Results
2. PSEUDO CORE INVERTIBILITY AND DMP INVERTIBILITY IN TWO SEMIGROUPS OF A RING WITH INVOLUTION.
- Author
-
WENDE LI, JIANLONG CHEN, YUKUN ZHOU, and YUANYUAN KE
- Subjects
- *
PSEUDOCODE (Computer program language) , *MATHEMATICS , *FINITE element method , *SEMIGROUPS (Algebra) , *GROUP theory - Abstract
In 2004, Patrício and Puystjens characterized the relation between Drazin invertible elements (resp., Moore-Penrose invertible elements) of two semigroups pRp and pRp+1 p of a ring R for some idempotent (resp., projection) p ∈ R. In this paper, we consider the relevant result for pseudo core invertible elements of such two semigroups of a ring for some projection, which is then applied to characterize the relation between pseudo core invertible elements of the matrix semigroup AA†RmxmAA†+Im AA† and the matrix semigroup A†ARnxnA†A+In A†A, where A ∈ Rmxn with A† existing. Also, similar equivalence involving DMP invertible elements is investigated. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
3. Remainder and quotient without polynomial long division.
- Author
-
Laudano, Francesco
- Subjects
- *
STUDY & teaching of polynomials , *MATHEMATICS education , *ALGEBRA education , *PSEUDOCODE (Computer program language) , *PROGRAMMING languages - Abstract
We propose an algorithm that allows calculating the remainder and the quotient of division between polynomials over commutative coefficient rings, without polynomial long division. We use the previous results to determine the quadratic factors of polynomials over commutative coefficient rings and, in particular, to completely factorize in Z [ x ] any integral polynomial with degree less than 6. The arguments are suitable for building classroom/homework activities in basic algebra courses. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
4. A Look at Algorithm BEPtoPNST.
- Author
-
García-Ojeda, Juan C.
- Subjects
- *
BUILDING evacuation , *COMBINATORIAL optimization , *PSEUDOCODE (Computer program language) , *COMPUTATIONAL complexity , *HIGH performance computing , *VERY large scale circuit integration , *INTERNET of things , *GRAPH theory - Abstract
This work analyzes the computational complexity of algorithm BEPtoPNST which transforms a building-evacuation problem (BEP) into a time-expanded, process-network synthesis (PNST) problem. The solution of the latter is achieved by resorting to the P-graph method which exploits the combinatorial nature of a BEP. Unlike other approaches, the P-graph method provides not only the optimal solution (best evacuation route as a function of egress time), but also the best n sub-optimal solutions. For the complexity analysis, a generic processor, and a Random-access machine (RAM) model were deployed as well as a mathematical model to calculate the number and cost of the operations performed. It was observed that algorithm BEPtoPNST exhibits an asymptotic complexity of order O (T/A/(/N/-k)). When solving a BEP, however, the total complexity grows exponentially with order O (T/A/(/N/-k)) + O (2h)) in the worst case; where h represents the total number of operating units specified in the corresponding PNST problem. Nevertheless, the computational complexity can be reduced significantly when the P-graph method is deployed. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
5. UbiSitePred: A novel method for improving the accuracy of ubiquitination sites prediction by using LASSO to select the optimal Chou's pseudo components.
- Author
-
Cui, Xiaowen, Yu, Zhaomin, Yu, Bin, Wang, Minghui, Tian, Baoguang, and Ma, Qin
- Subjects
- *
UBIQUITINATION , *LOGICAL prediction , *PSEUDOCODE (Computer program language) , *DNA damage , *COMPUTATIONAL complexity - Abstract
Abstract Ubiquitination is an essential process in protein post-translational modification, which plays a crucial role in cell life activities, such as proteasomal degradation, transcriptional regulation, and DNA damage repair. Therefore, recognition of ubiquitination sites is a crucial step to understand the molecular mechanisms of ubiquitination. However, the experimental verification of numerous ubiquitination sites is time-consuming and costly. To alleviate these issues, a computational approach is needed to predict ubiquitination sites. This paper proposes a new method called UbiSitePred for predicting ubiquitination sites combined least absolute shrinkage and selection operator (LASSO) feature selection and support vector machine. First, we use binary encoding (BE), pseudo-amino acid composition (PseAAC), the composition of k-spaced amino acid pairs (CKSAAP), position-specific propensity matrices (PSPM) to extract the sequence feature information; thus, the initial feature space is obtained. Secondly, LASSO is applied to remove the feature redundancy information and selects the optimal feature subset. Finally, the optimal feature subset is input into the support vector machine (SVM) to predict the ubiquitination sites. Five-fold cross-validation shows that UbiSitePred model can achieve a better prediction performance compared with other methods, the AUC values for Set1, Set2, and Set3 are 0.9998, 0.8887, and 0.8481, respectively. Notably, the UbiSitePred has overall accuracy rates of 98.33%, 81.12%, and 76.90%, respectively. The results demonstrate that the proposed method is significantly superior to other state-of-the-art prediction methods and provide a new idea for the prediction of other post-translational modification sites of proteins. The source code and all datasets are available at https://github.com/QUST-AIBBDRC/UbiSitePred/. Highlights • A new method (UbiSitePred) to predict the ubiquitination sites. • Fusing BE, PseAAC, CKSAAP and PSPM methods to extract protein sequence features information. • LASSO method can effectively remove redundant information in the protein sequences. • We investigate the effect of the six different classifiers on the results. • The proposed method increases the prediction performance over several methods. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
6. GLANCE ON PARALLELIZATION OF FFT ALGORITHMS.
- Author
-
FARHAN, Mhnd
- Subjects
- *
FAST Fourier transforms , *PARALLELIZING compilers , *DISCRETE Fourier transforms , *MULTIPROCESSORS , *PSEUDOCODE (Computer program language) - Abstract
This paper implores the parallelization of Fast Fourier Transform (FFT) algorithms and evaluates the resultant parallelized source codes. The FFT algorithm is considered to be among the most important algorithms in the digital era. There are various FFT algorithms but just a few are considered in this paper. The Cooley-Tukey FFT is the most widely known and used. With no exception, in this paper, the radix-2 Decimation in Time (DIT) and Decimation in Frequency (DIF) are studied and implemented. Another important FFT algorithm that is the Goertzel is also considered in this paper. [ABSTRACT FROM AUTHOR]
- Published
- 2019
7. Classification of some elements in pseudo BL-algebras.
- Author
-
Daneshpayeh, Roohallah, Borumand Saeid, Arsham, Mirvakili, Saeed, and Rezaei, Akbar
- Subjects
- *
CLASSIFICATION algorithms , *PSEUDOCODE (Computer program language) , *ALGEBRA , *ORTHOGONAL codes , *SMALL divisors - Abstract
In this paper, the notions of orthogonal, dense, regular, zero-divisor, strong and complemented elements in a pseudo BL-algebra are introduced and relation between the orthogonal and zero-divisor elements for perfect (good) pseudo BL-algebras is investigated. In particular, we get some results when a pseudo BL- algebra is good or perfect. Finally, a new characterization of these elements in a pseudo BL-algebra by a diagram is given. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
8. Revealing Privacy Vulnerabilities of Anonymous Trajectories.
- Author
-
Chang, Shan, Li, Chao, Zhu, Hongzi, Lu, Ting, and Li, Qiang
- Subjects
- *
TRAJECTORIES (Mechanics) , *MOBILE communication systems , *DIGITAL Object Identifiers , *CYBERTERRORISM , *PSEUDOCODE (Computer program language) , *VEHICULAR ad hoc networks , *GLOBAL Positioning System , *PRIVACY - Abstract
The proliferation of various mobile devices equipped with GPS positioning modules makes the collection of trajectories more easier than ever before, and more and more trajectory datasets have been available for business applications or academic researches. Normally, published trajectories are often anonymized by replacing real identities of mobile objects with pseudonyms (e.g., random identifiers); however, privacy leaks can hardly be prevented. In this paper, we introduce a novel paradigm of de-anonymization attack re-identifying trajectories of victims from anonymous trajectory datasets. Different from existing attacks, no background knowledge or side channel information about the target dataset is required. Instead, we claim that, for each moving object, there exist some mobility patterns that reflect the preference or usual behavior of the object, and will not change dramatically over a period of time. As long as those relatively stable patterns can be extracted from trajectories and be utilized as quasi-identifiers, trajectories can be linked to anonymous historical ones. To implement such kind of de-anonymization attacks, an adversary only needs to collect a few trajectory segments of a victim, the durations of which do not necessarily overlap with that of trajectories in the target dataset (in simple terms, those trajectory segments are not necessary sub-trajectories included in the target dataset). Since the movements of victims in public areas could be observed openly, an adversary can obtain traces or locations about the victims either by direct monitoring them (e.g., tracking) or from third parties (e.g., social-networks). Then, the adversary extracts useful patterns from both the historical trajectories in the accessible dataset and newly obtained trajectory segments of victims, the historical trajectory with most similar patterns to that of a victim is considered as belonging to the victim. In order to demonstrate the feasibility of such attacks, we conduct extensive trace-driven simulations. We extract road segment preferences and stop of interests from trajectories of vehicles, and construct feature vectors (mobility patterns) of vehicles according to them, used for trajectory comparisons. Simulation results show that the adversary could re-identify anonymous trajectories effectively. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
9. Peeling the longest: A simple generalized curve reconstruction algorithm.
- Author
-
Parakkat, Amal Dev, Methirumangalath, Subhasree, and Muthuganapathy, Ramanathan
- Subjects
- *
PARAMETRIC processes , *VORONOI polygons , *WATER distribution , *TRIANGULATION , *PSEUDOCODE (Computer program language) - Abstract
Given a planar point set sampled from a curve, the curve reconstruction problem computes a polygonal approximation of the curve. In this paper, we propose a Delaunay triangulation-based algorithm for curve reconstruction, which removes the longest edge of each triangle to result in a graph. Further, each vertex of the graph is checked for a degree constraint to compute simple closed/open curves. Assuming ϵ-sampling, we provide theoretical guarantee which ensures that a simple closed/open curve is a piecewise linear approximation of the original curve. Input point sets with outliers are handled as part of the algorithm, without pre-processing. We also propose strategies to identify the presence of noise and simplify a noisy point set, identify self-intersections and enhance our algorithm to reconstruct such point sets. Perhaps, this is the first algorithm to identify the presence of noise in a point set. Our algorithm is able to detect closed/open curves, disconnected components, multiple holes and sharp corners. The algorithm is simple to implement, independent of the type of input, non-feature specific and hence it is a generalized one. We have performed extensive comparative studies to demonstrate that our method is comparable or better than other existing methods. Limitations of our approach have also been discussed. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
10. Numerical Calculation of Laser-Induced Thermal Diffusion and Elastic Dynamics.
- Author
-
Ulrichs, Henning, Meyer, Dennis, Müller, Markus, Mansurova, Maria, and Döring, Florian
- Subjects
- *
NUMERICAL calculations , *LASER-induced fluorescence , *DIFFUSION kinetics , *FINITE difference method , *PSEUDOCODE (Computer program language) - Abstract
In this article we discuss the implementation of a finite-difference time-domain simulation method, which describes thermal diffusion and elastic dynamics induced by an ultrashort laser-pulse. Besides the pseudocode, we provide an example in which numerical results are compared with experimental data, showing excellent agreement. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
11. Hybrid non-parametric particle swarm optimization and its stability analysis.
- Author
-
Liu, Zhao-Guang, Ji, Xiu-Hua, and Liu, Yun-Xia
- Subjects
- *
PARTICLE swarm optimization , *MACHINE learning , *STOCHASTIC convergence , *WILCOXON signed-rank test , *PSEUDOCODE (Computer program language) - Abstract
As a population-based random search optimization technique, particle swarm optimization (PSO) has become an important branch of swarm intelligence (SI). The tuning of parameters in PSO has attracted the attention of many researchers. This study proposes an alternative technology called hybrid non-parametric PSO (HNPPSO) algorithm. Other SI operations, including a multi-crossover operation, a vertical crossover, and an exemplar-based learning strategy, are combined with the proposed algorithm to balance the global and local search capabilities. The first- and second-order stability analyses conducted for the present study showed that the particle positions are expected to converge at a fixed point in the search space and that the variance of the particle positions converges to zero. In the experiments, the proposed algorithm was compared with 10 other advanced PSO techniques using 40 widely used benchmark functions. The experimental results indicated that the proposed algorithm yields better solution accuracy and convergence speed than the other PSO techniques. The proposed algorithm significantly outperformed the other PSO approaches in terms of convergence speed. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
12. Fast Scheduling of Robot Teams Performing Tasks With Temporospatial Constraints.
- Author
-
Gombolay, Matthew C., Wilcox, Ronald J., and Shah, Julie A.
- Subjects
- *
HUMAN-robot interaction , *CONSTRAINTS (Physics) , *METAHEURISTIC algorithms , *PSEUDOCODE (Computer program language) , *SCHEDULING - Abstract
The application of robotics to traditionally manual manufacturing processes requires careful coordination between human and robotic agents in order to support safe and efficient coordinated work. Tasks must be allocated to agents and sequenced according to temporal and spatial constraints. Also, systems must be capable of responding on-the-fly to disturbances and people working in close physical proximity to robots. In this paper, we present a centralized algorithm, named “Tercio,” that handles tightly intercoupled temporal and spatial constraints. Our key innovation is a fast, satisficing multi-agent task sequencer inspired by real-time processor scheduling techniques and adapted to leverage a hierarchical problem structure. We use this sequencer in conjunction with a mixed-integer linear program solver and empirically demonstrate the ability to generate near-optimal schedules for real-world problems an order of magnitude larger than those reported in prior art. Finally, we demonstrate the use of our algorithm in a multirobot hardware testbed. [ABSTRACT FROM PUBLISHER]
- Published
- 2018
- Full Text
- View/download PDF
13. Fourier-Based Shape Servoing: A New Feedback Method to Actively Deform Soft Objects into Desired 2-D Image Contours.
- Author
-
Navarro-Alarcon, David and Liu, Yun-Hui
- Subjects
- *
FOURIER series , *ADAPTIVE control systems , *IMAGE sensors , *PSEUDOCODE (Computer program language) , *COMPUTER simulation - Abstract
This paper addresses the design of a vision-based method to automatically deform soft objects into desired two-dimensional shapes with robot manipulators. The method presents an innovative feedback representation of the object's shape (based on a truncated Fourier series) and effectively exploits it to guide the soft object manipulation task. A new model calibration scheme that iteratively approximates a local deformation model from vision and motion sensory feedback is derived; this estimation method allows us to manipulate objects with unknown deformation properties. Pseudocode algorithms are presented to facilitate the implementation of the controller. Numerical simulations and experiments are reported to validate this new approach. [ABSTRACT FROM PUBLISHER]
- Published
- 2018
- Full Text
- View/download PDF
14. A Time-Efficient Pair-Wise Collision-Resolving Protocol for Missing Tag Identification.
- Author
-
Zhang, Lijuan, Xiang, Wei, Atkinson, Ian, and Tang, Xiaohu
- Subjects
- *
PROTOCOL analyzers , *RADIO frequency identification systems , *PSEUDOCODE (Computer program language) , *REDUNDANCY in engineering , *TCP/IP - Abstract
Radio frequency identification (RFID) technology has been employed in wide-raging application domains. In most RFID applications, time-efficient identification of missing tags is one of the most fundamental objectives, especially for asset management and anti-theft purposes. In this paper, we propose a time-efficient pair-wise collision-resolving missing tag identification (PCMTI) protocol for large-scale RFID systems. In the protocol, two novel strategies, i.e., the pair-reply and two-collision slot (i.e., a slot with two exact tag responses) resolving strategies, are proposed. The pair-reply strategy can verify two tags in one short response slot simultaneously, while the two-collision slot resolving strategy further increases the number of tags verified in each frame. Both theoretical analysis and simulated results are presented to demonstrate the superiority of the proposed PCMTI protocol, which is capable of outperforming the state-of-the-art comparative protocols with at least a 30% reduction in average identification time for verifying one tag. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
15. The connected-component labeling problem: A review of state-of-the-art algorithms.
- Author
-
He, Lifeng, Ren, Xiwei, Gao, Qihang, Zhao, Xiao, Yao, Bin, and Chao, Yuyan
- Subjects
- *
PATTERN recognition systems , *PIXELS , *COMPUTER vision , *PSEUDOCODE (Computer program language) , *IMAGE analysis - Abstract
This article addresses the connected-component labeling problem which consists in assigning a unique label to all pixels of each connected component (i.e., each object) in a binary image. Connected-component labeling is indispensable for distinguishing different objects in a binary image, and prerequisite for image analysis and object recognition in the image. Therefore, connected-component labeling is one of the most important processes for image analysis, image understanding, pattern recognition, and computer vision. In this article, we review state-of-the-art connected-component labeling algorithms presented in the last decade, explain the main strategies and algorithms, present their pseudo codes, and give experimental results in order to bring order of the algorithms. Moreover, we will also discuss parallel implementation and hardware implementation of connected-component labeling algorithms, extension for n -D images, and try to indicate future work on the connected component labeling problem. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
16. Limited contiguous processor allocation mechanism in the mesh-connected multiprocessors using compaction.
- Author
-
Reza, Akram and Rafie, Mahnaz
- Subjects
- *
MULTIPROCESSORS , *MESH networks , *RESOURCE allocation , *PSEUDOCODE (Computer program language) , *TECHNOLOGICAL innovations - Abstract
In this paper, several efficient migration and allocation strategies have been compared on the mesh-based multiprocessor systems. The traditional non-preemptive submesh allocation strategies consist of two row boundary (TRB) and two column boundary (TCB). The existing migration mechanisms are online dynamic compaction-four corner (ODC-FC), limited top-down compaction (LTDC), TCB, and the combination of TCB and ODC-FC algorithms. Indeed, the new allocation method is presented in this paper. This mechanism has the benefits of two efficient traditional allocation algorithms. It is the combination of the TCB and TRB allocation methods. Also, in this process the impact of four key metrics on online mapping is considered. The parameters are average task execution time (ATET), average task system utilization (ATSU), average task waiting time (ATWT), and average task response time (ATRT). Using TCB and TRB mechanism with the migration strategies is shown that the new algorithm has better ATET, ATRT, ATWT, and ATSU. It has, respectively, 23.5494, 97.1216, 39.1291, and 4.142% improvements in comparison with the previous mechanisms. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
17. DuelMerge: Merging with Fewer Moves.
- Author
-
MERGEN, SERGIO L. S. and MOREIRA, VIVIANE P.
- Subjects
- *
COMPUTER algorithms , *PSEUDOCODE (Computer program language) , *C (Computer program language) , *PROGRAMMING languages , *COMPUTER science - Abstract
This work proposes DUELMERGE, a stable merging algorithm that is asymptotically optimal in the number of comparisons and performs O (n log2 (n) moves. Unlike other partition-based algorithms, we only allow blocks of equal sizes to be swapped, which reduces the number of moves required. We performed experiments comparing DUELMERGE against a number of baselines including RECMERGE, the standard merging solution for programming languages such as C, and some more recent approaches. The results show that our proposed algorithm performs fewer moves than other stable solutions. Experiments employing DUELMERGE within MergeSort confirmed our positive results in terms of moves, comparisons and runtime. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
18. Lexicographic pseudo effect algebras.
- Author
-
Dvurečenskij, Anatolij
- Subjects
- *
LEXICOGRAPHICAL errors , *EFFECT algebras , *RIESZ spaces , *ASSOCIATIVE algebras , *PSEUDONOISE sequences (Digital communications) , *PSEUDOCODE (Computer program language) - Abstract
We characterize effect algebras and pseudo effect algebras that can be represented as an interval of the lexicographic product of an antilattice unital po-group ( H, u) with a directed po-group G, both with the Riesz Decomposition Property (RDP). We show that a crucial condition is the existence of a lexicographic normal ideal. Finally, we present a categorical equivalence of the category of ( H, u)-lexicographic pseudo effect algebras having RDP with the category of directed po-groups with RDP. In addition, a weaker form of the ( H, u)-lexicographic pseudo effect algebra is studied. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
19. Parallel Pseudo Arc-Length Moving Mesh Schemes for Multidimensional Detonation.
- Author
-
Ning, Jianguo, Yuan, Xinpeng, Ma, Tianbao, and Li, Jian
- Subjects
- *
ARC length , *GEOMETRY , *PARALLEL algorithms , *COMPUTATIONAL geometry , *PSEUDOCODE (Computer program language) , *MATHEMATICAL models - Abstract
We have discussed the multidimensional parallel computation for pseudo arc-length moving mesh schemes, and the schemes can be used to capture the strong discontinuity for multidimensional detonations. Different from the traditional Euler numerical schemes, the problems of parallel schemes for pseudo arc-length moving mesh schemes include diagonal processor communications and mesh point communications, which are illustrated by the schematic diagram and key pseudocodes. Finally, the numerical examples are given to show that the pseudo arc-length moving mesh schemes are second-order convergent and can successfully capture the strong numerical strong discontinuity of the detonation wave. In addition, our parallel methods are proved effectively and the computational time is obviously decreased. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
20. A computational strategy to establish algebraic parameters for the Reference Resistance Design of metal shell structures.
- Author
-
Sadowski, Adam J., Fajuyitan, O. Kunle, and Wang, Jie
- Subjects
- *
COMPRESSION loads , *PSEUDOCODE (Computer program language) , *MATERIAL plasticity , *MECHANICAL buckling , *FINITE element method - Abstract
The new Reference Resistance Design (RRD) method, recently developed by Rotter [1] , for the manual dimensioning of metal shell structures effectively permits an analyst working with only a calculator or spreadsheet to take full advantage of the realism and accuracy of an advanced nonlinear finite element (FE) calculation. The method achieves this by reformulating the outcomes of a vast programme of parametric FE calculations in terms of six algebraic parameters and two resistances, each representing a physical aspect of the shell's behaviour. The formidable challenge now is to establish these parameters and resistances for the most important shell geometries and load cases. The systems that have received by far the most research attention for RRD are that of a cylindrical shell under uniform axial compression and uniform bending. Their partial algebraic characterisations required thousands of finite element calculations to be performed across a four-dimensional parameter hyperspace (i.e. length, radius to thickness ratio, imperfection amplitude, linear strain hardening modulus). Handling so many nonlinear finite element models is time-consuming and the quantities of data generated can be overwhelming. This paper illustrates a computational strategy to deal with both issues that may help researchers establish sets of RRD parameters for other important shell systems with greater confidence and accuracy. The methodology involves full automation of model generation, submission, termination and processing with object-oriented scripting, illustrated using code and pseudocode fragments. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
21. A comprehensive review of fuzzy-based clustering techniques in wireless sensor networks.
- Author
-
Singh, Manjeet and Soni, Surender Kumar
- Subjects
- *
WIRELESS sensor networks , *WIRELESS sensor nodes , *FUZZY logic , *PSEUDOCODE (Computer program language) , *ENERGY consumption - Abstract
Purpose This paper aims to discuss a comprehensive survey on fuzzy-based clustering techniques. The determination of an appropriate sensor node as a cluster head straightforwardly affects a network’s lifetime. Clustering often possesses some uncertainties in determining suitable sensor nodes as a cluster head. Owing to various variables, selection of a suitable node as a cluster head is a perplexing decision. Fuzzy logic is capable of handling uncertainties and improving decision-making processes even with insufficient information. Then, state-of-the-art research in the field of clustering techniques has been reviewed.Design/methodology/approach The literature is presented in a tabular form with merits and limitations of each technique. Furthermore, the various techniques are compared graphically and classified in a tabular form and the flowcharts of important algorithms are presented with pseudocodes.Findings This paper comprehends the importance and distinction of different fuzzy-based clustering methods which are further supportive in designing more efficient clustering protocols.Originality/value This paper fulfills the need of a review paper in the field of fuzzy-based clustering techniques because no other paper has reviewed all the fuzzy-based clustering techniques. Furthermore, none of them has presented literature in a tabular form or presented flowcharts with pseudocodes of important techniques. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
22. Excited Muon Searches at the FCC-Based Muon-Hadron Colliders.
- Author
-
Caliskan, A., Kara, S. O., and Ozansoy, A.
- Subjects
- *
MUON spin rotation , *HADRON colliders , *COLLIDERS (Nuclear physics) , *HADRON facilities , *PSEUDOCODE (Computer program language) - Abstract
We study the excited muon production at the FCC-based muon-hadron colliders. We give the excited muon decay widths and production cross-sections. We deal with the μp→μ⋆q→μγq process and plot the transverse momentum and normalized pseudorapidity distributions of final state particles to define the kinematical cuts best suited for discovery. By using these cuts, we get the mass limits for excited muons. It is shown that the discovery limits obtained on the mass of μ⋆ are 2.2, 5.8, and 7.5 TeV for muon energies of 63, 750, and 1500 GeV, respectively. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
23. A box-particle implementation of standard PHD filter for extended target tracking.
- Author
-
Zhang, Yongquan, Ji, Hongbing, and Hu, Qi
- Subjects
- *
FILTERS (Mathematics) , *TRACKING algorithms , *SIMULATION methods & models , *PSEUDOCODE (Computer program language) , *BAYESIAN analysis - Abstract
This paper presents a box-particle implementation of the standard probability hypothesis density (PHD) filter for extended target tracking, called the extended target box-particle PHD (ET-Box-PHD) filter. The proposed filter can dynamically track multiple extended targets and estimate the unknown number of extended targets, in the presence of clutter measurements, false alarms and missed detections, where the extended targets are described as a Poisson model developed by Gilholm et al. To get the PHD recursion of the ET-Box-PHD filter, a suitable cell likelihood function for one given reliable partition is derived, and the main filter steps are presented along with the necessary box manipulations and approximations. The capabilities and limitations of the proposed ET-Box-PHD filter are illustrated both in linear simulation examples and in nonlinear ones. The simulation results show that the proposed ET-Box-PHD filter can effectively avoid the high number of particles and obviously reduce computational burden, compared to a particle implementation of the standard PHD filter for extended target tracking. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
24. Multi-Target Engagement in Complex Mobile Surveillance Sensor Networks.
- Author
-
Semnani, Samaneh Hosseini and Basir, Otman A.
- Subjects
- *
SENSOR networks , *SURVEILLANCE detection , *CONSTRAINT algorithms , *ENVIRONMENTAL monitoring , *PSEUDOCODE (Computer program language) - Published
- 2017
- Full Text
- View/download PDF
25. GPU-LMDDA: a bit-vector GPU-based deadlock detection algorithm for multi-unit resource systems.
- Author
-
Abell, Stephen, Do, Nhan, and Lee, John Jaehwan
- Subjects
- *
GRAPHICS processing units , *COMPUTER algorithms , *PSEUDOCODE (Computer program language) , *COMPUTER software , *RESOURCE allocation - Abstract
This article presents the detailed description of a GPU-based multi-unit deadlock detection methodology, GPU-LMDDA with 12 pieces of pseudo code. Our design utilises the massively parallel hardware of the GPU to perform computations of deadlock detection in multi-unit resource systems. As a result, it is able to overcome the major limitations of prior software and hardware-based solutions by handling thousands of processes and resources concurrently. GPU-LMDDA employs a bit-vector technique with a novel bit-matrix multiplication algorithm to store and perform computations on algorithm matrices, thus decreasing the memory footprint and maximizing throughput. Our design treats deadlock detection as a service to the operating system by requiring minimal interaction with the CPU. By treating deadlock detection as an interactive service, all matrix management and algorithm computation are handled by the GPU, freeing CPU compute cycles. Our algorithm is implemented on three GPU cards: Tesla C2050, Tesla K20c, and Titan X, which showed speedups of 3-434X against single-threaded CPU equivalents. As an interactive service to the CPU and with bit-vector technique, GPU-LMDDA provides significant speedups against CPU implementation for increasing number of resources and processes. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
26. Eye-tracking verification of the strategy used to analyse algorithms expressed in a flowchart and pseudocode.
- Author
-
Andrzejewska, Magdalena, Stolińska, Anna, Błasiak, Władysław, Pęczkowski, Paweł, Rosiek, Roman, Rożek, Bożena, Sajka, Mirosława, and Wcisło, Dariusz
- Subjects
- *
EYE tracking , *PROBLEM solving , *PSEUDOCODE (Computer program language) , *EDUCATIONAL planning , *FLOW charts - Abstract
The results of qualitative and quantitative investigations conducted with individuals who learned algorithms in school are presented in this article. In these investigations, eye-tracking technology was used to follow the process of solving algorithmic problems. The algorithmic problems were presented in two comparable variants: in a pseudocode and flowchart. The eye-tracking data resulted in both qualitative (films registering the gaze paths) and quantitative measures, which allowed the detection and interpretation of the differences in the task-solving strategies between those who found the correct answer and those that did not. The results confirmed a hypothesis that use of the formal notation characteristic of a programming language for presenting algorithms is often a practical difficulty in the process of solving even simple tasks. This study opens a new direction of research; they show that eye-tracking technology can be used to optimise the educational process of learning programming. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
27. Integrated calibration and magnetic disturbance compensation of three-axis magnetometers.
- Author
-
Pang, Hongfeng, Pan, Mengchun, Chen, Jinfei, Li, Ji, Zhang, Qi, and Luo, Shitu
- Subjects
- *
CALIBRATION , *MATHEMATICAL models , *MAGNETIC fields , *MAGNETOMETERS , *MAGNETIC devices , *PSEUDOCODE (Computer program language) , *COMPUTER network resources - Abstract
Technological limitations in sensor manufacturing and unwanted magnetic fields will corrupt the measurements of three-axis magnetometers. An experiment with four different magnetic disturbance situations is designed, and the influence of hard-iron and soft-iron material is analyzed. The calibration method with magnetic disturbance parameters is proposed for calibration and magnetic disturbance compensation of three axis magnetometers. It is not necessary to compute pseudo-linear parameters, thus the integrated parameters are computed directly by solving nonlinear equations. To employ this method, a nonmagnetic rotation equipment, a CZM-3 proton magnetometer, a DM-050 three-axis magnetometer, two magnets and two steel tubes are used. Calibration performance is discussed in the four situations. Compared with several traditional calibration methods, experiment results show that the proposed method has better integrated compensation performance in all situations, and error is reduced by several orders of magnitude. After compensation, RMS error is reduced from 10797.962 nT to 15.309 nT when the big magnet and steel tube are deployed. It suggests an useful method for calibration and magnetic disturbance compensation of three-axis magnetometers. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
28. Pseudo-differential operator associated with the fractional Fourier transform.
- Author
-
PRASAD, AKHILESH and KUMAR, PRAVEEN
- Subjects
- *
PSEUDOCODE (Computer program language) , *FOURIER transforms , *SCHWARTZ spaces , *CEPSTRUM analysis (Mechanics) , *FOURIER analysis - Abstract
The main goal of this paper is to study properties of the fractional Fourier transform on Schwartz type space ℒθ. Symbol class Sρ,σm,θ is introduced. The fractional pseudo-differential operators (f.p.d.o.) associated with the symbol a(x, ξ) are a continuous linear mapping of ℒ into ℒθ. Kernel and integral representations of f.p.d.o are obtained. The boundedness property of f.p.d.o. is studied. Application of the fractional Fourier transform in solving a generalized Fredholm integral equation is also given. [ABSTRACT FROM AUTHOR]
- Published
- 2016
29. Efficient editing and data abstraction by finding homogeneous clusters.
- Author
-
Ougiaroglou, Stefanos and Evangelidis, Georgios
- Subjects
- *
ABSTRACT data types (Computer science) , *DATA reduction , *DATA mining , *CLASSIFICATION algorithms , *PSEUDOCODE (Computer program language) - Abstract
The efficiency of the k-Nearest Neighbour classifier depends on the size of the training set as well as the level of noise in it. Large datasets with high level of noise lead to less accurate classifiers with high computational cost and storage requirements. The goal of editing is to improve accuracy by improving the quality of the training datasets. To obtain such datasets, editing removes noise and mislabeled data as well as smooths the decision boundaries between the discrete classes. On the other hand, prototype abstraction aims to reduce the computational cost and the storage requirements of classifiers by condensing the training data. This paper proposes an editing algorithm called Editing through Homogeneous Clusters (EHC). Then, it extends the idea by introducing a prototype abstraction algorithm that integrate the EHC mechanism and is capable of creating a small noise-free representative set of the initial training data. This algorithm is called Editing and Reduction through Homogeneous Clusters (ERHC). Both are based on a fast and parameter free iterative execution of k-means clustering that forms homogeneous clusters. Both consider as noise and remove clusters consisting of a single item. In addition, ERHC summarizes the items of the remaining clusters by storing the mean item for each one in the representative set. EHC and ERHC are tested on several datasets. The results show that both run very fast and achieve high accuracy. In addition, ERHC achieves high reduction rates. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
30. A Fast Algorithm to Generate Feasible Solution of Production Facilities Layout Based on Plane Segmentation.
- Author
-
Hou, Shi-wang, Li, Zhibin, and Wang, Hui
- Subjects
- *
ALGORITHMS , *TOPOLOGICAL spaces , *NUMBER theory , *ARBITRARY constants , *PSEUDOCODE (Computer program language) , *DECISION support systems - Abstract
For facility layout problem with continuous block and unequal area, it is key to generate feasible solution of facility layout with arbitrary space form in order to find the optimal arrangement scheme under a given goal. According to the given slicing position and slicing mode, the plane for arrangement was divided into many block areas by use of plane segmentation, which was consistent with the facilities in number. The precise coordinates of the lower-left corner and the top-right corner of each facility were calculated in light of its area, width, and length. The corresponding algorithm was designed in the form of pseudocode. The procedure proposed can provide a feasible facility layout solution. The running results of facilities layout instance containing 14 facilities show that the scheme can output facilities plane layout scheme quickly and provide decision support for the facilities planning. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
31. Clustering based unit commitment with wind power uncertainty.
- Author
-
Shukla, Anup and Singh, S.N.
- Subjects
- *
WIND power plants , *UNIT commitment problem (Electric power systems) , *CLUSTERING of particles , *PUMPED storage power plants , *PSEUDOCODE (Computer program language) , *PARTICLE swarm optimization - Abstract
Wind power generation is continuously increasing around the world, but due to uncertainty in wind power generation, the unit commitment problem has become complex. In this paper, scenario generation and reduction techniques are used to consider wind power uncertainty on system operation. Also, a new approach is developed for creating clusters of unit status associated with a probability of occurrence from an initial set of large wind power generation scenarios. And then a model of wind-hydro-thermal coordination problem along with the pumped storage plant is established. Combination of proposed weighted-improved crazy particle swarm optimization along with a pseudo code based algorithm and scenario analysis method is utilized to solve above problem. The effectiveness and feasibility of the proposed method is tested on systems with and without pumped storage plant integration. The results are analyzed in detail, which demonstrate the model and the proposed method is practicable in solving the unit commitment. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
32. Efficient computation of Sommerfeld integral tails – methods and algorithms.
- Author
-
Michalski, Krzysztof A. and Mosig, Juan R.
- Subjects
- *
GREEN'S functions , *MATHEMATICAL analysis , *NUMERICAL analysis , *PSEUDOCODE (Computer program language) , *ALGORITHMS - Abstract
A review is presented of the most effective methods for the computation of Sommerfeld integral tails. Such integrals, which are often oscillatory, singular and divergent, commonly arise in layered media Green functions. The mathematical foundations of various pertinent methods are discussed in detail and their performance is illustrated by relevant numerical examples. The associated algorithms are given in pseudocode for their easy computer implementation. [ABSTRACT FROM PUBLISHER]
- Published
- 2016
- Full Text
- View/download PDF
33. Global Center Point Splitting: New Linear Node Splitting Algorithm for R-Trees.
- Author
-
Arafat, Manar
- Subjects
- *
PSEUDOCODE (Computer program language) , *SPLITTING extrapolation method , *QUADRATIC programming - Abstract
We introduce a new linear algorithm to split overflowed nodes of an R-tree index called the Global Center Point Splitting (GCPS) algorithm. The proposed method is an enhancement of the Quadratic splitting algorithm proposed by Guttmann (Guttman A, 1984; 47-57). Most known algorithms do not take advantage of the fact that most spatial objects data is known beforehand, and these objects are relatively easy to identify. In this paper we have adopted an informative approach by making use of spatial information provided by the problem space. Objects in the problem space are scanned and the Global Center Point (GCP) that the objects are concentrated around is determined. The GCPS algorithm uses the proximity between the Global Center Point (GCP) and the remaining objects in selecting a splitting axis that produces the most even split. We conducted several experiments using both real and synthetic data sets. Results show that the proposed splitting method outperforms the quadratic version in terms of construction time especially for nodes with high capacity. The query performance approximately remains the same. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
34. Implementation-level verification of algorithms with KeY.
- Author
-
Bruns, Daniel, Mostowski, Wojciech, and Ulbrich, Mattias
- Subjects
- *
SOFTWARE verification , *BENCHMARKING (Management) , *COMPUTER algorithms , *JAVA programming language , *PSEUDOCODE (Computer program language) , *STRUCTURAL analysis (Engineering) - Abstract
We give an account on the authors' experience and results from the software verification competition held at the Formal Methods 2012 conference. Competitions like this are meant to provide a benchmark for verification systems. It consisted of three algorithms which the authors have implemented in Java, specified with the Java Modeling Language, and verified using the KeY system. Building on our solutions, we argue that verification systems which target implementations in real-world programming languages better have powerful abstraction capabilities. Regarding the KeY tool, we explain features which, driven by the competition, have been freshly implemented to accommodate for these demands. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
35. Specifying and Verifying External Behaviour of Fair Input/Output Automata by Using the Temporal Logic of Actions.
- Author
-
KAPUS, Tatjana
- Subjects
- *
DATA transmission systems , *DATA replication , *PROGRAMMING languages , *FINITE state machines , *PSEUDOCODE (Computer program language) - Abstract
Fair input/output (or I/O) automata are a state-machine model for specifying and verifying reactive and concurrent systems. For the verification purposes, one is usually interested only in the sequences of interactions fair I/O automata offer to their environment. These sequences are called fair traces. The usual approach to the verification consists in proving fair trace inclusion between fair I/O automata. This paper presents a simple approach to the specification of fair traces and shows how to establish a fair trace inclusion relation for a pair of fair I/O automata by using the temporal logic of actions. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
36. ANALYSIS OF GNSS DATA USING PRECISE POINT POSITIONING TECHNIQUE FOR THE DETERMINATION OF PERMANENT STATION IN ROMANIA.
- Author
-
NISTOR, SORIN and BUDA, AURELIAN STELIAN
- Subjects
- *
PSEUDOCODE (Computer program language) , *EPHEMERIDES , *GLOBAL Positioning System , *IONOSPHERE - Abstract
To obtain the coordinates by means of precise point positioning (PPP) technique we need to use the undifferenced GPS pseudocode and carrier phase observations but to obtain the "precise" positioning we need precise orbit and clock data too. This products and other information for obtaining the results by using PPP technique on a centimeter level accuracy can be downloaded from different locations, but the most reliable satellite ephemerides and clock correction are available from International GNSS Service (IGS). In the PPP analysis we determined the parameters such as the receiver clock error, ionospheric delays code biases, code multipath and the total neutral atmosphere delay of the observations. For the determination of the permanent station coordinates, using the PPP technique, we used precise orbit and clock solutions to enable absolute positioning of a single receiver. In this article we present the results obtained by using the PPP technique on the permanent station Oradea, from which we can conclude that the PPP technique can be used for different GNSS application. [ABSTRACT FROM AUTHOR]
- Published
- 2015
37. On Decoding of the (73, 37, 13) Quadratic Residue Code.
- Author
-
Li, Yong, Liu, Hongqing, Chen, Qianbin, and Truong, Trieu-Kien
- Subjects
- *
BERLEKAMP-Massey algorithm , *GAUSSIAN elimination , *LINEAR programming , *PSEUDOCODEWORDS , *PSEUDOCODE (Computer program language) - Abstract
In this paper, a method to search the set of syndromes' indices needed in computing the unknown syndromes for the (73, 37, 13) quadratic residue (QR) code is proposed. According to the resulting index sets, one computes the unknown syndromes and thus finds the corresponding error-locator polynomial by using an inverse-free Berlekamp–Massey (BM) algorithm. Based on the modified Chase-II algorithm, the performance of soft-decision decoding for the (73, 37, 13) QR code is given. This result is new. Moreover, the error-rate performance of linear programming (LP) decoding for the (73, 37, 13) QR code is also investigated, and LP-based decoding is shown to be significantly superior in performance to the algebraic soft-decision decoding while requiring almost the same computational complexity. In fact, the algebraic hard-decision and soft-decision decoding of the (89, 45, 17) QR code outperforms that of the (73, 37, 13) QR code because the former has a larger minimal distance. However, experimental results indicate that the (73, 37, 13) QR code outperforms the (89, 45, 17) QR code with much fewer arithmetic operations when using the LP-based decoding algorithms. The pseudocodewords analysis partially explains this seemingly strange phenomenon. [ABSTRACT FROM PUBLISHER]
- Published
- 2014
- Full Text
- View/download PDF
38. SHAPE directed RNA folding.
- Author
-
Lorenz, Ronny, Luntzer, Dominik, Hofacker, Ivo L., Stadler, Peter F., and Wolfinger, Michael T.
- Subjects
- *
NUCLEOTIDES , *RNA , *THERMODYNAMICS , *ALGORITHMS , *PSEUDOCODE (Computer program language) - Abstract
Chemical mapping experiments allow for nucleotide resolution assessment of RNA structure. We demonstrate that different strategies of integrating probing data with thermodynamics- based RNA secondary structure prediction algorithms can be implemented by means of soft constraints. This amounts to incorporating suitable pseudo-energies into the standard energy model for RNA secondary structures. As a showcase application for this new feature of the ViennaRNA Package we compare three distinct, previously published strategies to utilize SHAPE reactivities for structure prediction. The new tool is benchmarked on a set of RNAs with known reference structure. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
39. Efficient convolution based impedance boundary conditions.
- Author
-
Paganini, Alberto and López-Férnández, María
- Subjects
- *
CONVOLUTION quadrature , *IMPEDANCE control , *BOUNDARY value problems , *DISCRETIZATION methods , *PSEUDOCODE (Computer program language) , *EDDY currents (Electric) - Abstract
Purpose – The purpose of this paper is to propose an approach based on Convolution quadrature (CQ) for the modeling and the numerical treatment of impedance boundary condition. Design/methodology/approach – The model is derived from a general setting. Its discretization is discussed in details by providing pseudo-codes and by performing their complexity analysis. The model is validated through several numerical experiments. Findings – CQ provides an efficient and accurate treatment of impedance boundary conditions. Originality/value – The paper suggests a new effective treatment of impedance boundary conditions. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
40. Hero and Bad Motherland: J. M. Coetzee's Computational Critique.
- Author
-
Roach, Rebecca
- Subjects
- *
COMPUTERS in literature , *DIGITAL humanities , *COMPUTER software , *PSEUDOCODE (Computer program language) - Abstract
The article offers poetry criticism of the poem "Hero and Bad Mother in Epic" by J. M. Coetzee. It explores the importance of digital humanities in the career of author. The author highlights that while working at International Business Machines (IBM), Coetzee wrote programs to generate lines of poetry and literature version presented in pseudocode, an idiosyncratic form of coding notation.
- Published
- 2018
- Full Text
- View/download PDF
41. Generalized Paxos Made Byzantine (and Less Complex) †.
- Author
-
Pires, Miguel, Ravi, Srivatsan, and Rodrigues, Rodrigo
- Subjects
- *
FAULT tolerance (Engineering) , *BLOCKCHAINS , *PSEUDOCODE (Computer program language) , *AGREEMENT protocols (Computer network protocols) , *ALGORITHMS - Abstract
One of the most recent members of the Paxos family of protocols is Generalized Paxos. This variant of Paxos has the characteristic that it departs from the original specification of consensus, allowing for a weaker safety condition where different processes can have a different views on a sequence being agreed upon. However, much like the original Paxos counterpart, Generalized Paxos does not have a simple implementation. Furthermore, with the recent practical adoption of Byzantine fault tolerant protocols in the context of blockchain protocols, it is timely and important to understand how Generalized Paxos can be implemented in the Byzantine model. In this paper, we make two main contributions. First, we attempt to provide a simpler description of Generalized Paxos, based on a simpler specification and the pseudocode for a solution that can be readily implemented. Second, we extend the protocol to the Byzantine fault model, and provide the respective correctness proof. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
42. Mathematical analysis of interconnected photovoltaic arrays under different shading conditions.
- Author
-
Nnamchi, S.N., Oko, C.O.C., Kamen, F.L, and Sanya, O.D.
- Subjects
- *
PHOTOVOLTAIC power generation , *ALGORITHMS , *PSEUDOCODE (Computer program language) , *INTEGRATED circuit interconnections , *PROBABILITY theory - Abstract
A comprehensive mathematical analysis of interconnected photovoltaic arrays under different shading conditions (opacity) and patterns (column, row, diagonal and corner) has been carried out in this work. The equivalent circuit models for the different shading conditions and patterns, and pseudocode algorithm were developed upon which the performance characteristics of the interconnected arrays were analyzed. Five different interconnections were inclusively considered in this work: series-parallel, total-cross-tied (TCT), bridge-linked, ladder and honey-comb interconnection. The emerging analytical results revealed that TCT is most dominant interconnection and shading patterns across the strings (row and diagonal) have detrimental effect on output power, especially when the opacity is one (signifying perfect shading condition) but shading patterns along the string (column or corner shadings) are less severe to power generation. The formation of double peaks sequel to the presence of shadings are inimical to power generated from the interconnected arrays. Moreover, increasing the interconnections enhances the output power and further serves as a means of bypassing current in the event of threats to the modules. Thus, the results obtained provide vital information for smooth operation and maximization of output power in interconnected arrays by avoiding shades on the strings. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.