Search results for "SIMPLE algorithm"

showing 10 items of 13 documents

A simple algorithm to evaluate the local symmetry at each point of a closed contour

1995

In this work, contour symmetry is evaluated as a numeric feature for each point of the shape outline, using only the positions of a local vicinity of points. A measure is defined, named Local Symmetric Deficiency (LSD), so that the lower this quantity is, the higher the symmetry will be in the local region considered. This approach is simpler than related previous ones both from a conceptual point of view and for its implementation, since it is reduced just to a suitable manipulation of the Freeman chain code of the curve studied. Its computational cost is very low and it has the advantages of a parallel algorithm, since values for LSD can be computed for each point independently.

CombinatoricsChain codeLocal symmetryFeature (computer vision)Parallel algorithmPoint (geometry)Symmetry (geometry)Measure (mathematics)AlgorithmSIMPLE algorithmMathematics
researchProduct

A simple algorithm for generating neuronal dendritic trees

1990

Abstract A simple, efficient algorithm is presented for generating the codewords of all neuronal dendritic trees with a given number of terminal nodes. Furthermore, a procedure is developed for deciding if different codewords correspond to topologically equivalent trees.

Discrete mathematicsQuantitative Biology::Neurons and CognitionEfficient algorithmHealth InformaticsDendritesData_CODINGANDINFORMATIONTHEORYData structureModels BiologicalComputer Science ApplicationsTerminal (electronics)Simple (abstract algebra)Computer SimulationTopological conjugacyMathematical ComputingAlgorithmAlgorithmsSoftwareSIMPLE algorithmComputer Science::Information TheoryMathematicsComputer Methods and Programs in Biomedicine
researchProduct

Fast procedure for the calculation of maximum slot filling factors in electrical machines

2017

This paper presents an algorithm for the calculation of maximum slot filling factor in electrical machines. The determination of whole wire cross section that occupy the area of a stator slot is very important in order to estimate the copper losses: The greater is the filling factor the lower are copper losses. The main goal of this paper is to define a simple algorithm for the determination of slot filling factors suitable for all type of slot profiles. The algorithm can be considered as an additional useful tool for the fast design of electrical machine windings.

EngineeringFilling factorStatorbusiness.industryMechanical engineeringwiresSettore ING-IND/32 - Convertitori Macchine E Azionamenti Elettricilaw.inventionwindingCross section (physics)Slot filling factorElectrical machineElectromagnetic coillawElectronic engineeringbusinessSIMPLE algorithm2017 Twelfth International Conference on Ecological Vehicles and Renewable Energies (EVER)
researchProduct

Simple algorithms for calculation of the axial‐symmetric heat transport problem in a cylinder

2001

The approximation of axial‐symmetric heat transport problem in a cylinder is based on the finite volume method. In the classical formulation of the finite volume method it is assumed that the flux terms in the control volume are approximated with the finite difference expressions. Then in the 1‐D case the corresponding finite difference scheme for the given source function is not exact. There we propose the exact difference scheme. In 2‐D case the corresponding integrals are approximated using different quadrature formulae. This procedure allows one to reduce the heat transport problem described by a partial differential equation to an initial‐value problem for a system of two ordinary diff…

FTCS schemeFinite volume methodDifferential equationMathematical analysisFinite difference method-Parabolic partial differential equationFinite element methodModeling and SimulationQA1-939CylinderAnalysisSIMPLE algorithmMathematicsMathematicsMathematical Modelling and Analysis
researchProduct

Construction and characterization of models of hypercrosslinked polystyrene

2012

A simple algorithm involving classical molecular dynamics (MD) simulations is here suggested to build up models of hypercrosslinked polystyrene showing macroporous structure. The algorithm is composed by three consecutive stages: MD simulation of a single polystyrene coil, crosslink formation, and finally relaxation of the structure. The models, which are differentiated by the crosslinker concentration in the initial polystyrene chain, can be characterized by employing tools of the small angle neutron scattering analysis and procedures associated to the crosslinking algorithm, which allows one to discriminate among the different kinds of crosslinks between phenyl rings and to calculate the …

Hypercrosslinked polystyrene crosslinking degree molecular dynamicsMaterials sciencePolymers and PlasticsRelaxation (NMR)Substrate (chemistry)02 engineering and technology010402 general chemistry021001 nanoscience & nanotechnology01 natural sciencesSmall-angle neutron scattering0104 chemical sciencesCharacterization (materials science)chemistry.chemical_compoundMolecular dynamicsColloid and Surface ChemistryChemical engineeringchemistryPolymer chemistryMaterials ChemistryPolystyrenePhysical and Theoretical Chemistry0210 nano-technologySIMPLE algorithmMacromoleculeColloid and Polymer Science
researchProduct

A simple algorithm for retrieval of the optical thickness at L-band from SMOS data

2012

Vegetation indices are indicators for analyzing the properties of vegetation. The Normalized Difference Vegetation Index (NDVI) from optical remote sensing data is one of the most commonly used vegetation indices, which can exhibit the ecological characteristics of leafy materials, but lacks the ability to directly provide information on the woody materials. In this paper, we developed Microwave Vegetation Indices (MVIs) from the L-band Soil Moisture and Ocean Salinity (SMOS) data, which is an effective means to detect the information of branches and trunks. The theory of MVIs is derived from the tau-omega model. To minimize the influence from the uncertain soil surface radiation, a paramet…

L bandmedicineEnvironmental scienceSoil scienceEnhanced vegetation indexmedicine.symptomVegetation (pathology)Water contentIntegral equationNormalized Difference Vegetation IndexMicrowaveSIMPLE algorithmRemote sensing2012 IEEE International Geoscience and Remote Sensing Symposium
researchProduct

A Simplified Analytical Approach for Optimal Planning of Distributed Generation in Electrical Distribution Networks

2019

DG-integrated distribution system planning is an imperative issue since the installing of distributed generations (DGs) has many effects on the network operation characteristics, which might cause significant impacts on the system performance. One of the most important characteristics that mostly varies because of the installation of DG units is the power losses. The parameters affecting the value of the power losses are number, location, capacity, and power factor of the DG units. In this paper, a new analytical approach is proposed for optimally installing DGs to minimize power loss in distribution networks. Different parameters of DG are considered and evaluated in order to achieve a hig…

Mathematical optimizationComputer science020209 energydistribution systems02 engineering and technologyPower factorReduction (complexity)Softwareoptimum DG capacity0202 electrical engineering electronic engineering information engineeringGeneral Materials ScienceMATLABInstrumentationSIMPLE algorithmcomputer.programming_languageFluid Flow and Transfer Processesdistributed generationbusiness.industryProcess Chemistry and Technology020208 electrical & electronic engineeringGeneral EngineeringProcess (computing)Computer Science ApplicationsPower (physics)Settore ING-IND/33 - Sistemi Elettrici Per L'EnergiaDistribution systemDistributed generationoptimum DG locationbusinesscomputerApplied Sciences
researchProduct

Stochastic Approximation for Multivariate and Functional Median

2010

We propose a very simple algorithm in order to estimate the geometric median, also called spatial median, of multivariate (Small (1990)) or functional data (Gervini (2008)) when the sample size is large. A simple and fast iterative approach based on the Robbins-Monro algorithm (Duflo (1997)) as well as its averaged version (Polyak and Juditsky (1992)) are shown to be effective for large samples of high dimension data. They are very fast and only require O(Nd) elementary operations, where N is the sample size and d is the dimension of data. The averaged approach is shown to be more effective and less sensitive to the tuning parameter. The ability of this new estimator to estimate accurately …

Multivariate statisticsDimension (vector space)Sample size determinationRobustness (computer science)StatisticsApplied mathematicsEstimatorGeometric medianStochastic approximationSIMPLE algorithmMathematics
researchProduct

Parameterization-based tracking for the P2 experiment

2017

The P2 experiment in Mainz aims to determine the weak mixing angle θW at low momentum transfer by measuring the parity-violating asymmetry of elastic electronproton scattering. In order to achieve the intended precision of Δ(sin2 θW )/sin2 θW = 0:13% within the planned 10 000 hours of running the experiment has to operate at the rate of 1011 detected electrons per second. Although it is not required to measure the kinematic parameters of each individual electron, every attempt is made to achieve the highest possible throughput in the track reconstruction chain.In the present work a parameterization-based track reconstruction method is described. It is a variation of track following, where t…

Physics010308 nuclear & particles physicsPhysicsQC1-999DetectorWeinberg angleTracking (particle physics)01 natural sciencesOrders of magnitude (time)Phase space0103 physical sciences010306 general physicsAlgorithmSimulationSIMPLE algorithmAnalytic functionParametric statisticsEPJ Web of Conferences
researchProduct

Algorithms for transforming an integral photography into a plenoptic picture

2013

We report a simple algorithm for transforming the set of elemental images captured with an integral-photography set up, into the set of micro-images ready to be projected into an integral-imaging monitor. The method is based in the transposing relation between an integral photography and a plenoptic picture. The reported technique permits to adapt the integral images to the resolution and size of the monitor.

Set (abstract data type)Computational photographyRelation (database)business.industryComputer graphics (images)ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONIntegral photographyComputer visionArtificial intelligenceResolution (logic)businessSIMPLE algorithmMathematics2013 12th Workshop on Information Optics (WIO)
researchProduct