Search results for "General Computer Science"
showing 10 items of 895 documents
Inverse simulated annealing: Improvements and application to amorphous InSb
2014
An improved inverse simulated annealing method is presented to determine the structure of complex disordered systems from first principles in agreement with available experimental data or desired predetermined target properties. The effectiveness of this method is demonstrated by revisiting the structure of amorphous InSb. The resulting network is mostly tetrahedral and in excellent agreement with available experimental data.
Numerical investigation of the mechanical properties of a novel hybrid polymer composite reinforced with graphene and MXene nanosheets
2020
Abstract This paper presents a numerical investigation of the elastic properties of a novel hybrid polymer composite reinforced with graphene and MXene nanosheets. A finite element computational model was developed to analyze the mechanical properties of a new polymer hybrid composite reinforced with MXene and graphene taking into account the properties of the 2D nanosheets, different aspect ratios, placement options and volume fractions of nanoreinforcements, as well as the interaction effects between the nanofillers and the surrounding polymer matrix. Using the developed numerical model, the influences of the interface layer properties, MXene and graphene aspect ratio, alignment and volum…
Gas Transport in Mixed Matrix Membranes: Two Methods for Time Lag Determination
2020
The most widely used method to measure the transport properties of dense polymeric membranes is the time lag method in a constant volume/pressure increase instrument. Although simple and quick, this method provides only relatively superficial, averaged data of the permeability, diffusivity, and solubility of gas or vapor species in the membrane. The present manuscript discusses a more sophisticated computational method to determine the transport properties on the basis of a fit of the entire permeation curve, including the transient period. The traditional tangent method and the fitting procedure were compared for the transport of six light gases (H2, He, O2, N2, CH4, and CO2) and ethane an…
Routing Design in Wireless Sensor Networks and a Solution for Healthcare Environments
2011
This work presents the software implementation of a tissue engineering image analysis tool through the study of several biomaterials by means of different microscopy techniques (optical, scanning electron, and atomic force microscopy). With this tool, different quantitative information has been extracted from the microscopy image analysis of these biomaterials, as the number of objects, their mean size and the area they cover. Morphological characteristics, as the roundness or the porosity have been also obtained. All these quantitative information has permitted an statistical analysis over the obtained results.
The Azimuthal Dependence of Exchange Bias Effect and its Analysis by Spin Glass Model in Ni0.8Fe0.2/CoxNi1−xO Bilayers
2021
Exchange bias (EB) effect has been vigorously researched for many years due to its possible applications in information storage and spintronics, especially in spin valves for magnetic recording devices. Even though many models have been expounded to this day, they do not prove convincingly the origins of EB effect. We attempt to establish the azimuthal dependence of EB effect with respect to varying the composition of the antiferromagnet CoxNi $_{\mathrm {1-x}}\text{O}$ and temperature. In this report, we deposited the bilayer thin films of Ni0.8Fe0.2/Co x Ni1− x O with $x$ varying from 0.4 to 0.8 by magnetron sputtering and studied the variation of exchange bias field and coercivity. The E…
Fundamentals of the design and the operation of an intelligent tutoring system for the learning of the arithmetical and algebraic way of solving word…
2013
Designers of interactive learning environments with a focus on word problem solving usually have to compromise between the amount of resolution paths that a user is allowed to follow and the quality of the feedback provided. We have built an intelligent tutoring system (ITS) that is able to both track the user's actions and provide adequate supervision during the resolution. This is done without imposing any restriction on the resolution paths that are allowed. Instead, the system attempts to enforce metacognitive learning by requiring an appropriate definition of quantities before they are used. The program (a) supports both the arithmetical and algebraic way of solving problems; (b) allow…
A branch-and-cut algorithm for the Orienteering Arc Routing Problem
2016
[EN] In arc routing problems, customers are located on arcs, and routes of minimum cost have to be identified. In the Orienteering Arc Routing Problem (OARP),in addition to a set of regular customers that have to be serviced, a set of potential customers is available. From this latter set, customers have to be chosen on the basis of an associated profit. The objective is to find a route servicing the customers which maximize the total profit collected while satisfying a given time limit on the route.In this paper, we describe large families of facet-inducing inequalities for the OARP and present a branch-and-cut algorithm for its solution. The exact algorithm embeds a procedure which builds…
Matheuristics for the irregular bin packing problem with free rotations
2017
[EN] We present a number of variants of a constructive algorithm able to solve a wide variety of variants of the Two-Dimensional Irregular Bin Packing Problem (2DIBPP). The aim of the 2DIBPP is to pack a set of irregular pieces, which may have concavities, into stock sheets (bins) with fixed dimensions in such a way that the utilization is maximized. This problem is inspired by a real application from a ceramic company in Spain. In addition, this problem arises in other industries such as the garment industry or ship building. The constructive procedure presented in this paper allows both free orientation for the pieces, as in the case of the ceramic industry, or a finite set of orientation…
Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems
2018
Abstract For the exact solution of many types of vehicle-routing problems, column-generation based algorithms have become predominant. The column-generation subproblems are then variants of the shortest-path problem with resource constraints which can be solved well with dynamic-programming labeling algorithms. For vehicle-routing problems with a pickup-and-delivery structure, the strongest known dominance between two labels requires the delivery triangle inequality (DTI) for reduced costs to hold. When the direction of labeling is altered from forward labeling to backward labeling, the DTI requirement becomes the pickup triangle inequality (PTI). DTI and PTI cannot be guaranteed at the sam…
Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem
2016
Abstract The Obnoxious p-Median problem consists in selecting a subset of p facilities from a given set of possible locations, in such a way that the sum of the distances between each customer and its nearest facility is maximized. The problem is NP -hard and can be formulated as an integer linear program. It was introduced in the 1990s, and a branch and cut method coupled with a tabu search has been recently proposed. In this paper, we propose a heuristic method – based on the Greedy Randomized Adaptive Search Procedure, GRASP, methodology – for finding approximate solutions to this optimization problem. In particular, we consider an advanced GRASP design in which a filtering mechanism avo…