Search results for "BLE"

showing 10 items of 23353 documents

Comparison of fully non-stationary artificial accelerogram generation methods in reproducing seismicity at a given site

2020

Abstract Seismic input modelling is a crucial step when Non-Linear Time-History Analyses (NLTHAs) are performed, the seismic response of structures being highly responsive to the input employed. When natural accelerograms able to represent local seismicity are not available, the use of generated accelerograms is an efficient solution for input modelling. The aim of the present paper is to compare four methods for generating fully non-stationary artificial accelerograms on the basis of a target spectrum, identified using seven recorded accelerograms registered in the neighbourhood of the construction site during a single event, assumed as target accelerograms. For each method, seven accelero…

0211 other engineering and technologiesSoil Science020101 civil engineeringSpectrum-compatible02 engineering and technologyInduced seismicity0201 civil engineeringSet (abstract data type)Intensity measure parametermedicinePoint (geometry)Seismic site characteristic021101 geological & geomatics engineeringCivil and Structural EngineeringEvent (probability theory)Basis (linear algebra)business.industryFully non-stationaryStiffnessStructural engineeringGeotechnical Engineering and Engineering GeologySettore ICAR/09 - Tecnica Delle CostruzioniArtificial accelerogrammedicine.symptombusinessEnergy (signal processing)GeologySoil Dynamics and Earthquake Engineering
researchProduct

Aesthetic considerations for the min-max K-Windy Rural Postman Problem

2017

[EN] The aesthetic quality of routes is a feature of route planning that is of practical importance, but receives relatively little attention in the literature. Several practitioners have pointed out that the visual appeal of a proposed set of routes can have a strong influence on the willingness of a client to accept or reject a specific routing plan. While some work has analyzed algorithmic performance relative to traditional min-sum or min-max objective functions and aesthetic objective functions, we are not aware of any work that has considered a multi-objective approach. This work considers a multi-objective variant of the Min-Max K-Vehicles Windy Rural Postman Problem, discusses sever…

021103 operations researchComputer Networks and Communications0211 other engineering and technologiesMin-Max objective02 engineering and technologyMulti-Objective problemsCombinatoricsArc routing problemsAesthetic objectiveHardware and Architecture0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingMATEMATICA APLICADAHumanitiesSoftwareInformation SystemsMathematicsNetworks
researchProduct

Pricing Sovereign Contingent Convertible Debt

2016

We develop a pricing model for sovereign contingent convertible bonds (S-CoCo) with payment standstills triggered by a sovereign's credit default swap CDS spread. One innovation is the modeling of CDS spread regime switching which is prevalent during crises. Regime switching is modeled as a hidden Markov process and is integrated with a stochastic process of spread levels to obtain S-CoCo prices through simulation. The paper goes a step further and uses the pricing model in a Longstaff-Schwartz. American option pricing framework to compute state contingent S-CoCo prices at some risk horizon, thus facilitating risk management. Dual trigger pricing is also discussed using the idiosyncratic CD…

021103 operations researchCredit default swapbusiness.industryFinancial economicsmedia_common.quotation_subject05 social sciences0211 other engineering and technologies02 engineering and technologyPaymentStock market indexDebt restructuringValuation of options0502 economics and businessEconomics050207 economicsRational pricingbusinessConvertible bondRisk managementmedia_commonSSRN Electronic Journal
researchProduct

Stabilized branch-and-price algorithms for vector packing problems

2018

Abstract This paper considers packing and cutting problems in which a packing/cutting pattern is constrained independently in two or more dimensions. Examples are restrictions with respect to weight, length, and value. We present branch-and-price algorithms to solve these vector packing problems (VPPs) exactly. The underlying column-generation procedure uses an extended master program that is stabilized by (deep) dual-optimal inequalities. While some inequalities are added to the master program right from the beginning (static version), other violated dual-optimal inequalities are added dynamically. The column-generation subproblem is a multidimensional knapsack problem, either binary, boun…

021103 operations researchInformation Systems and ManagementGeneral Computer ScienceComputer scienceBranch and price0211 other engineering and technologiesProcess (computing)02 engineering and technologyManagement Science and Operations ResearchResolution (logic)Industrial and Manufacturing EngineeringKnapsack problemModeling and SimulationBounded functionShortest path problem0202 electrical engineering electronic engineering information engineeringBenchmark (computing)020201 artificial intelligence & image processingAlgorithmEuropean Journal of Operational Research
researchProduct

Tabu Search to Plan Schedules in a Multiskill Customer Contact Center

2006

International audience; We have studied a realistic case of scheduling problem in a customer contact center, dealing with multiskill agents. Our model combines the last two steps of the standard approach by determining shifts and by assigning them to agents at the same time (scheduling and rostering). Moreover, we have considered realistic vacations, according to legal constraints and preferences of agents. We have envisioned entire weeks of work, with variable meal times and meal durations, without overtime. In this paper, we define the problem and describe a Tabu search based solution.

021103 operations researchJob shop schedulingOperations research[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO]Computer science05 social sciencesReal-time computing0211 other engineering and technologies02 engineering and technologyDynamic priority scheduling[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]Fair-share schedulingTabu searchScheduling (computing)Variable (computer science)Nurse scheduling problemTwo-level scheduling0502 economics and business050207 economics[ INFO.INFO-RO ] Computer Science [cs]/Operations Research [cs.RO]
researchProduct

Measuring Social Responsibility: A Multicriteria Approach

2016

In this chapter we present a portfolio selection model for Socially Responsible Investment. The model, following the spirit of Socially Responsible Investment, consists of two different steps. Firstly, a social screening is applied in order to obtain the feasible set of assets accomplishing the socially responsible investment policy of the assets’ manager. In this step, an indicator is obtained for the measurement of the social responsibility degree of an asset. Assets are then ranked using this indicator from the most socially responsible to the less socially responsible. In a second step, once the feasible set is obtained, composed of those socially responsible assets verifying the screen…

021103 operations researchManagement scienceFeasible region0211 other engineering and technologies02 engineering and technologyAsset (computer security)MicroeconomicsSocially responsible investmentOrder (exchange)0202 electrical engineering electronic engineering information engineeringPortfolio020201 artificial intelligence & image processingBusinessSocial responsibilitySelection (genetic algorithm)
researchProduct

Learning automata-based solutions to the optimal web polling problem modelled as a nonlinear fractional knapsack problem

2011

We consider the problem of polling web pages as a strategy for monitoring the world wide web. The problem consists of repeatedly polling a selection of web pages so that changes that occur over time are detected. In particular, we consider the case where we are constrained to poll a maximum number of web pages per unit of time, and this constraint is typically dictated by the governing communication bandwidth, and by the speed limitations associated with the processing. Since only a fraction of the web pages can be polled within a given unit of time, the issue at stake is one of determining which web pages are to be polled, and we attempt to do it in a manner that maximizes the number of ch…

021103 operations researchTheoretical computer scienceLearning automataComputer scienceContinuous knapsack problem0211 other engineering and technologies02 engineering and technologyAutomatonArtificial IntelligenceControl and Systems EngineeringKnapsack problemWeb page0202 electrical engineering electronic engineering information engineeringResource allocation020201 artificial intelligence & image processingStochastic optimizationElectrical and Electronic EngineeringPollingEngineering Applications of Artificial Intelligence
researchProduct

Heuristics for the min–max arc crossing problem in graphs

2018

Abstract In this paper, we study the visualization of complex structures in the context of automatic graph drawing. Constructing geometric representations of combinatorial structures, such as networks or graphs, is a difficult task that requires an expert system. The automatic generation of drawings of graphs finds many applications from software engineering to social media. The objective of graph drawing expert systems is to generate layouts that are easy to read and understand. This main objective is achieved by solving several optimization problems. In this paper we focus on the most important one: reducing the number of arc crossings in the graph. This hard optimization problem has been…

021103 operations researchTheoretical computer scienceOptimization problemComputer scienceHeuristic0211 other engineering and technologiesGeneral Engineering0102 computer and information sciences02 engineering and technologycomputer.software_genre01 natural sciencesGraphExpert systemComputer Science ApplicationsVisualization010201 computation theory & mathematicsArtificial IntelligenceGraph drawingHeuristicscomputerExpert Systems with Applications
researchProduct

Improving the performance of embedded systems with variable neighborhood search

2017

Graphical abstractDisplay Omitted Embedded systems have become an essential part of our lives, mainly due to the evolution of technology in the last years. However, the power consumption of these devices is one of their most important drawbacks. It has been proven that an efficient use of the memory of the device also improves its energy performance. This work efficiently solves the dynamic memory allocation problem, which can be formally defined as follows: given a program that has to be executed by a circuit, the objective is to fit that program in memory in such a way that the computing time required to execute it is minimized. In this work, we propose a parallel variable neighborhood se…

021103 operations researchbusiness.industryComputer scienceC dynamic memory allocationEmbedded systemsWork (physics)0211 other engineering and technologies02 engineering and technologyMetaheuristics[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]Static memory allocationMemoryEmbedded system0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingDynamic memory allocationbusinessMetaheuristicSoftwareVariable neighborhood searchVariable neighborhood search
researchProduct

2019

Final disposal of spent nuclear fuel (SNF) from nuclear power plants (NPPs) is an ethical issue with implications within and across generations. We address this issue from the perspective of nuclear communities that host nuclear waste disposal sites. These are primarily the communities that face injustice due to the potential radiological risks. A resident survey (n = 454) was conducted in two Finnish nuclear communities, i.e. Eurajoki and Pyhajoki, that are being considered as alternative sites for a second repository for SNF. The nuclear waste management (NWM) company Posiva is already building a repository in Eurajoki, the first in Finland. These communities are in different stages of th…

021110 strategic defence & security studies010504 meteorology & atmospheric sciencesbusiness.industryStrategy and Managementmedia_common.quotation_subject0211 other engineering and technologiesGeneral EngineeringGeneral Social SciencesRadioactive wasteDistribution (economics)02 engineering and technologyPublic relationsNuclear power01 natural sciencesSpent nuclear fuelInjustice12. Responsible consumptionPolitical sciencePerceptionJustice (ethics)Safety Risk Reliability and QualityDistributive justicebusiness0105 earth and related environmental sciencesmedia_commonJournal of Risk Research
researchProduct