Loading...
Search for: forsati--r
0.097 seconds
Total 7830 records
 List View    Gallery View
# Type Title Author Publisher Pub. Year Subjects Call Number
1 مقاله Efficient stochastic algorithms for document clustering Forsati, R. 2013 Hybridization.
Stochastic optimization.
Document Clustering.
Harmony search.
K-means.
Stochastic optimizations.
Cluster analysis.
Genetic algorithms.
Information retrieval.
Markov processes.
Optimization.
Parameter estimation.
Stochastic systems.
World Wide Web.
Clustering algorithms.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
2 مقاله Novel meta-heuristic algorithms for clustering web documents Mahdavi, M. 2008 Cluster analysis.
Knowledge acquisition.
Optimization.
Web services.
Document clustering.
Harmony search.
Heuristic algorithms.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
3 مقاله Hybridization of k-means and harmony search methods for web page clustering Forsati, R. 2008 Optimization.
Websites.
Document datasets.
Documents clustering.
Harmony searches.
Heterogeneous informations.
Human beings.
Initial cluster centers.
Initial parameters.
K-means.
k-means algorithms.
K-means clustering algorithms.
Large data sets.
Local optimal solutions.
Optimization problems.
Solution spaces.
Web page clustering.
Clustering algorithms.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
4 مقاله Web text mining using harmony search Forsati, R. 2010
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
5 مقاله Effective page recommendation algorithms based on distributed learning automata Forsati, R. 2009 Learning automata.
Machine learning.
Personalization.
Web mining.
Computational costs.
Data sets.
Distributed learning.
Information overloads.
Information spaces.
Learned patterns.
Learning automata.
Machine-learning.
Memory usage.
Other algorithms.
Personalizations.
Recommendation algorithms.
Recommender systems.
Web Mining.
Web page.
Automata theory.
Computer science.
Education.
Information technology.
Robot learning.
Robots.
Translation (languages)
Learning algorithms.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
6 مقاله Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing Forsati, R. 2008 Bandwidth.
Computational complexity.
HIgh speed networks.
Multimedia services.
Optimization.
Quality of service.
Routing algorithms.
Delay constraint.
Harmony search.
Multicast routing.
Multicasting.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
7 مقاله Web page clustering using harmony search optimization Forsati, R. 2008 Chlorine compounds.
Cluster analysis.
Flow of solids.
Global optimization.
Hydraulic structures.
Internet.
Optimization.
Technology.
Websites.
World wide web.
Application domains.
Clustering techniques.
Clustering web pages.
Data sets.
Electrical and computer engineering.
Harmony search.
K-means.
Novel clustering.
Optimization problems.
Optimization methods.
Reasonable time.
Relevant information.
Research area.
Web document clustering.
Web page clustering.
Clustering algorithms.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
8 مقاله An efficient algorithm for bandwidth-delay constrained least cost multicast routing Forsati, R. 2008 Algorithms.
Bandwidth.
Computer networks.
Heuristic algorithms.
Heuristic methods.
Heuristic programming.
Multicasting.
Network routing.
Nuclear propulsion.
Packet networks.
Polynomial approximation.
Routing algorithms.
Technology.
Telecommunication systems.
Trees (mathematics)
Bandwidth constraint.
Bandwidth-delay.
Efficient algorithms.
Electrical and computer engineering.
End-to-end delay.
Harmony search.
High-speed networks.
Large networks.
Link bandwidths.
Minimum costs.
Multicast.
Multicast algorithms.
Multicast routing.
Multicast trees.
Near-optimal solutions.
NP-complete problems.
Polynomial-time.
QoS constraints.
QoS routing.
Real-time multimedia.
Running time.
Simulation results.
Quality of service.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
9 مقاله Network vulnerability analysis through vulnerability take-grant model (VTG) Shahriari, H. R. 2005 Algorithms.
Graph theory.
Mathematical models.
Polynomials.
Security of data.
Bounded polynomial algorithm.
Vulnerabilities rewriting rules.
Vulnerability take-grant model (VTG)
Information analysis.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
10 مقاله Sequence dependence of the binding energy in chaperone-driven polymer translocation through a nanopore Abdolvahab, R. H. 2011 Binding affinities.
Binding proteins.
Mean first passage time.
Monomer types.
Nearest-neighbors.
Polymer translocation.
Potential gradients.
Stiff polymers.
Trans side.
Translocation dynamics.
Monomers.
Nanopores.
Nuclear energy.
Polymers.
Potential energy.
Binding energy.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
11 مقاله First passage time distribution of chaperone driven polymer translocation through a nanopore: Homopolymer and heteropolymer cases Abdolvahab, R. H. 2011 Advection diffusion equation.
Characteristic exponents.
Dimensionless parameters.
First passage time.
First passage time distributions.
Heterogeneous polymers.
Mean waiting time.
Monte Carlo Simulation.
Polymer translocation.
Power-law dependences.
Reaction coordinates.
Stiff polymers.
Translocation dynamics.
Translocation process.
Waiting time.
Advection.
Binding energy.
Chain length.
Electron transitions.
Monte Carlo methods.
Nanopores.
Partial differential equations.
Polymers.
Probability distributions.
Probability density function.
Polymer.
Chemical model.
Chemistry.
Nanopore.
Computer Simulation.
Diffusion.
Models, Chemical.
Monte Carlo Method.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
12 مقاله Reply: Abedpour, asgari, and tabar Abedpour, N. 2011
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
13 مقاله Irreversibility in response to forces acting on graphene sheets Abedpour, N. 2010 Graphene sheets.
Relaxation mechanism.
Ripple structure.
Sample sizes.
Structural parameter.
Suspending structures.
Graphite.
Graphene.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
14 مقاله Analysis of design goals of cryptography algorithms based on different components Molk, A.M.N.G. Institute of Advanced Engineering and Science, 2021 Analysis.
Telemedicine.
IoT.
Cryptography algorithms.
Component.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
15 مقاله Conservation of statistical results under the reduction of pair-contact interactions to solvation interactions Radja, N.H. 2005 Additives.
Hydrophilicity.
Mathematical models.
Proteins.
Structural design.
Vectors.
Interactions.
Miyazawa-Jernigan interactions.
Solvation.
Contacts (fluid mechanics)
Amino acid.
Protein.
Protein binding.
Solvent.
Binding site.
Chemical model.
Chemical structure.
Chemistry.
Computer simulation.
Protein conformation.
Statistical model.
Amino Acids.
Binding Sites.
Models, Chemical.
Models, Molecular.
Models, Statistical.
Solvents.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
16 مقاله Multifunctional hyperelastic structured surface for tunable and switchable transparency Mahabadi, R. K. MDPI AG, 2021 Fabrication.
Switchable.
Structured surfaces.
Optimized design.
Microwave.
Metasurface.
Mechanically tunable.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
17 مقاله MaxHiC: A robust background correction model to identify biologically relevant chromatin interactions in Hi-C and capture Hi-C experiments Alinejad Rokny, H. Public Library of Science, 2022 Bioinformatics.
C (programming language)
Maximum likelihood.
Python.
Background correction.
Background modelling.
Chromatin structure.
Correction models.
Functional interaction.
GC contents.
Genomic regions.
High-order.
Higher-order.
Interaction frequencies.
Binding sites.
Deoxyribonuclease.
Histone.
Transcription factor CTCF.
Binding site.
Binomial distribution.
Biological model.
Biotechnology.
Chromatin structure.
Clustered regularly interspaced short palindromic repeat.
Data analysis.
Enhancer region.
Experimental study.
Expression quantitative trait locus.
Gene mapping.
Genetic database.
Genetic regulation.
Genome-wide association study.
Maximum likelihood method.
Molecular interaction.
Promoter region.
Protein binding.
Single nucleotide polymorphism.
Statistical bias.
Statistical significance.
Validation process.
Chromatin.
Genetics.
Genome.
Genome-wide association study.
Genomics.
Procedures.
Binding Sites.
Chromatin.
Genome.
Genome-Wide Association Study.
Genomics.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
18 مقاله SER of M-PSK modulation in incremental-selective decode-and-forward cooperative communications over Rayleigh fading channels Renani, R. A. 2011 Cooperative communication.
Decode and forward.
Direct links.
Incremental relaying.
Optimal power allocation.
Phase signals.
PSK modulation.
Retransmissions.
selective relaying.
Symbol error rates.
Total power.
Communication channels (information theory)
Communication systems.
Fading channels.
Innovation.
Optimization.
Signal receivers.
Wireless sensor networks.
Rayleigh fading.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
19 مقاله Power allocation for incremental-selective decode-and-forward cooperative communications over Rician fading channels Renani, R. A. 2011 Decode and forward.
Incremental relaying.
Power allocations.
Rician fading channel.
Selective relaying.
Communication systems.
Fading (radio)
Innovation.
Fading channels.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
20 مقاله Efficient and practical protocol for silylation of hydroxyl groups using reusable lithium perchlorate dispread in silica gel under neutral condition [electronic resource] / N. Azizi, R. Yousefi, M. R. Saidi. Azizi, N. (Najmodin). LP-SiO2.
Silylation.
Hexamethyldisilazane.
Recycling.
Hydroxyl group.
Regioselective.
Alcohol.
Phenol.
Lithium perchlorate.
Silica gel.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())