Search results for "NETWORKS"

showing 10 items of 3260 documents

Small angle neutron scattering on periodically deformed polymers

1984

Small angle neutron scattering from periodically deformed samples is a useful extension of the methods presently available for the study of molecular dynamics of polymers. In this paper we describe apparatus that has been used to produce large cyclic deformations at frequencies upto 10 Hz and the principles by which data is collected to give spectra corresponding to different states of strain of the sample. Some data on model polydimethylsiloxane networks is given as an illustration of the value of this technique.

Materials sciencedata collectionspectra02 engineering and technologysmall angle neutron scattering010402 general chemistry01 natural sciencescyclic deformationsSpectral linechemistry.chemical_compoundMolecular dynamicsOpticsmolecular reorientationpolymersneutron diffraction examination of materialschemistry.chemical_classificationPolydimethylsiloxanebusiness.industryPolymerpolydimethylsiloxane networks021001 nanoscience & nanotechnologySmall-angle neutron scatteringmolecular dynamics0104 chemical sciencesComputational physicschemistry[PHYS.HIST]Physics [physics]/Physics archivesBiological small-angle scattering0210 nano-technologybusinessperiodically deformed polymers
researchProduct

Experimental Characterization of the Human Meniscal Tissue

2018

The meniscus plays a critical role in load transmission, stability and energy dissipation in the knee joint. Loss of the meniscus leads to joint degeneration and osteoarthritis. In a number of cases replacement of the resected meniscal tissue by a synthetic implant might avoid the articular cartilage degeneration. None of the available implants presents optimal biomechanics characteristic due to the fact the biomechanics functionality of the meniscus is not yet fully understood. Mimicking the native biomechanical characteristics of the menisci seems to be the key factor in meniscus replacement functioning. This is extremely challenging due to its complex inhomogeneous microstructure, the la…

Materials sciencemeniscal tissue0206 medical engineeringEnergy Engineering and Power TechnologyArticular cartilage02 engineering and technologyDegeneration (medical)OsteoarthritisKnee JointMeniscus (anatomy)fractional viscoelasticityIndustrial and Manufacturing Engineering0203 mechanical engineeringArtificial IntelligencemedicineInstrumentationMeniscal tissueRenewable Energy Sustainability and the EnvironmentBiomechanicsComputer Science Applications1707 Computer Vision and Pattern Recognitionmusculoskeletal systemmedicine.disease020601 biomedical engineeringCharacterization (materials science)Computer Networks and Communication020303 mechanical engineering & transportsmedicine.anatomical_structureBiaxial testSettore ICAR/08 - Scienza Delle CostruzioniBiomedical engineering2018 IEEE 4th International Forum on Research and Technology for Society and Industry (RTSI)
researchProduct

Effect of mixing and spatial dimension on the glass transition

2009

We study the influence of composition changes on the glass transition of binary hard disc and hard sphere mixtures in the framework of mode coupling theory. We derive a general expression for the slope of a glass transition line. Applied to the binary mixture in the low concentration limits, this new method allows a fast prediction of some properties of the glass transition lines. The glass transition diagram we find for binary hard discs strongly resembles the random close packing diagram. Compared to 3D from previous studies, the extension of the glass regime due to mixing is much more pronounced in 2D where plasticization only sets in at larger size disparities. For small size disparitie…

Materials sciencepacs:82.70.DdCondensed matter physicsStatistical Mechanics (cond-mat.stat-mech)business.industryDiagramRandom close packBinary numberFOS: Physical sciencesCondensed Matter - Soft Condensed MatterCondensed Matter::Disordered Systems and Neural NetworksCondensed Matter::Soft Condensed MatterOpticsPhase (matter)Mode couplingSoft Condensed Matter (cond-mat.soft)ddc:530Glass transitionbusinesspacs:64.70.Q-Mixing (physics)Condensed Matter - Statistical Mechanicspacs:64.70.PLine (formation)
researchProduct

Detection of Partial Discharges at Square Shaped Voltages

2018

Due to the wide use of electronic converters and the introduction of new powerful power electronics devices, the input waveforms most often used are becoming much different than the traditional power frequent sinusoidal one. In High Voltage (HV) apparatus particularly, this condition can increase the stress on the insulation systems that may lower the reliability of the whole power grid. This type of input voltage, often showing an increased voltage gradient, causes problems in the Partial Discharge (PD) measurement setup and acquisition systems, also due to the increased harmonic content. In this paper, the main aim is to discuss how to suitably approach the measurement technique of PDs at…

Materials scienceunconventional streRenewable Energy Sustainability and the Environmentbusiness.industrypattern recognitionElectrical engineeringEnergy Engineering and Power TechnologyComputer Science Applications1707 Computer Vision and Pattern RecognitionHigh voltageConvertersIndustrial and Manufacturing EngineeringPower (physics)Computer Networks and CommunicationReliability (semiconductor)Artificial IntelligencePartial dischargePower electronicsPartial dischargeHarmonicPWMbusinessInstrumentationVoltage2018 IEEE 4th International Forum on Research and Technology for Society and Industry (RTSI)
researchProduct

Shaping communities of local optima by perturbation strength

2017

Recent work discovered that fitness landscapes induced by Iterated Local Search (ILS) may consist of multiple clusters, denoted as funnels or communities of local optima. Such studies exist only for perturbation operators (kicks) with low strength. We examine how different strengths of the ILS perturbation operator affect the number and size of clusters. We present an empirical study based on local optima networks from NK fitness landscapes. Our results show that a properly selected perturbation strength can help overcome the effect of ILS getting trapped in clusters of local optima. This has implications for designing effective ILS approaches in practice, where traditionally only small per…

Mathematical optimization021103 operations researchIterated local searchFitness landscapeComputer Science::Neural and Evolutionary Computation0211 other engineering and technologiesPerturbation (astronomy)02 engineering and technologyLocal optima networksLocal optimum0202 electrical engineering electronic engineering information engineeringPerturbation operator020201 artificial intelligence & image processingMathematicsProceedings of the Genetic and Evolutionary Computation Conference
researchProduct

Scatter search for the profile minimization problem

2014

We study the problem of minimizing the profile of a graph and develop a solution method by following the tenets of scatter search. Our procedure exploits the network structure of the problem and includes strategies that produce a computationally efficient and agile search. Among several mechanisms, our search includes path relinking as the basis for combining solutions to generate new ones. The profile minimization problem PMP is NP-Hard and has relevant applications in numerical analysis techniques that rely on manipulating large sparse matrices. The problem was proposed in the early 1970s but the state-of-the-art does not include a method that could be considered powerful by today's compu…

Mathematical optimizationBasis (linear algebra)ExploitComputer Networks and CommunicationsComputer scienceNumerical analysisHardware and ArchitecturePath (graph theory)Graph (abstract data type)MetaheuristicSoftwareInformation SystemsSparse matrixEnvelope (motion)Networks
researchProduct

Explicit Recursive and Adaptive Filtering in Reproducing Kernel Hilbert Spaces

2014

This brief presents a methodology to develop recursive filters in reproducing kernel Hilbert spaces. Unlike previous approaches that exploit the kernel trick on filtered and then mapped samples, we explicitly define the model recursivity in the Hilbert space. For that, we exploit some properties of functional analysis and recursive computation of dot products without the need of preimaging or a training dataset. We illustrate the feasibility of the methodology in the particular case of the $\gamma$ -filter, which is an infinite impulse response filter with controlled stability and memory depth. Different algorithmic formulations emerge from the signal model. Experiments in chaotic and elect…

Mathematical optimizationComputer Networks and Communications02 engineering and technologyautoregressive and moving-averagekernel methodssymbols.namesakeArtificial Intelligence0202 electrical engineering electronic engineering information engineeringKernel adaptive filterInfinite impulse responseMathematicsfilterrecursiveHilbert space020206 networking & telecommunicationsFilter (signal processing)AdaptiveComputer Science ApplicationsAdaptive filterKernel methodKernel (statistics)symbols020201 artificial intelligence & image processingAlgorithmSoftwareReproducing kernel Hilbert spaceIEEE Transactions on Neural Networks and Learning Systems
researchProduct

Iterative momentum relaxation for fast lattice-Boltzmann simulations

2001

Abstract Lattice-Boltzmann simulations are often used for studying steady-state hydrodynamics. In these simulations, however, the complete time evolution starting from some initial condition is redundantly computed due to the transient nature of the scheme. In this article we present a refinement of body-force driven lattice-Boltzmann simulations that may reduce the simulation time significantly. This new technique is based on an iterative adjustment of the local body-force. We validate this technique on three test cases, namely fluid flow around a spherical obstacle, flow in random fiber mats and flow in a static mixer reactor.

Mathematical optimizationComputer Networks and CommunicationsComputer scienceLattice Boltzmann methodsTime evolutionPorous mediaRelaxation (iterative method)Fluid mechanicsMechanicsStatic mixerlaw.inventionMomentumFlow (mathematics)Hardware and ArchitecturelawLattice-Boltzmann methodFluid dynamicsInitial value problemFluid mechanicsPorous mediumSoftware
researchProduct

Partial joint processing with efficient backhauling using particle swarm optimization

2012

In cellular communication systems with frequency reuse factor of one, user terminals (UT) at the cell-edge are prone to intercell interference. Joint processing is one of the coordinated multipoint transmission techniques proposed to mitigate this interference. In the case of centralized joint processing, the channel state information fed back by the users need to be available at the central coordination node for precoding. The precoding weights (with the user data) need to be available at the corresponding base stations to serve the UTs. These increase the backhaul traffic. In this article, partial joint processing (PJP) is considered as a general framework that allows reducing the amount …

Mathematical optimizationComputer Networks and CommunicationsComputer scienceReal-time computingSignal-to-interference-plus-noise ratio02 engineering and technologycoordinated multipointPrecodingFrequency reusejoint processingBase station0203 mechanical engineering0202 electrical engineering electronic engineering information engineeringZero-forcing precodingComunicació i tecnologiaprecodingOther Electrical Engineering Electronic Engineering Information Engineeringparticle swarm optimizationComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSParticle swarm optimization020206 networking & telecommunications020302 automobile design & engineeringstochastic optimizationComputer Science ApplicationsBackhaul (telecommunications)Channel state informationSignal ProcessingTelecommunicationsStochastic optimizationEURASIP Journal on Wireless Communications and Networking
researchProduct

GRASP with path relinking heuristics for the antibandwidth problem

2010

This article proposes a linear integer programming formulation and several heuristics based on GRASP and path relinking for the antibandwidth problem. In the antibandwidth problem, one is given an undirected graph with n nodes and must label the nodes in a way that each node receives a unique label from the set {1, 2,…,n}, such that, among all adjacent node pairs, the minimum difference between the node labels is maximized. Computational results show that only small instances of this problem can be solved exactly (to optimality) with a commercial integer programming solver and that the heuristics find high-quality solutions in much less time than the commercial solver. © 2010 Wiley Periodic…

Mathematical optimizationComputer Networks and CommunicationsGRASPSolverSet (abstract data type)Hardware and ArchitecturePath (graph theory)Node (circuits)HeuristicsInteger programmingMetaheuristicSoftwareInformation SystemsMathematicsNetworks
researchProduct