103,891 research outputs found
Tutorial: Silicon Systems for Wireless LAN
No full textThe tutorial is aimed to help new device, circuit, and system
designers to function knowledgeably in the area. It can serve as
a comprehensive user guide to researchers and engineers who
have already acquired basic knowledge of microelectronics.
The tutorial is based on a recently published book: Z. Stamenkovic, G. Leger, and A. Bosio, "Silicon Systems for Wireless LAN
Identità, contraddizione, dialettica e verità: riflessioni sugli studi di Storia della Filosofia Antica di G. Martano
No full textVengono illustrati i rapporti tra logica formale, logica trascendentale e dialettica speculativa
A dynamic programming algorithm for the single-machine scheduling problem with deteriorating processing times
No full textA combinatorial optimization problem arising from text classification
No full textWe study a combinatorial optimization problem related to the automatic classification of texts. The problem consists of covering a given text using strings from a given set, where a cost is incurred for each type of string used. We give a 0-1 linear programming formulation and we report on computational experiences on very large instances using two different Lagrangean relaxations and heuristic algorithms based on simulated annealing and threshold accepting
Il territorio in età moderna. Istantanee sulle architetture ed il paesaggio attraverso la lettura della cartografia storica
No full textA dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times
No full textWe consider a scheduling problem in which the processing time of each job deteriorates, i.e. it increases as time passes after the release date of the job.
We present a dynamic programming algorithm coupled with upper bounding and lower
bounding techniques to compute exact solutions. We report on problem instances of
different size and we analyze the dependence between the ranges to which the data belong and the computing time
Computational approaches to a combinatorial optimization problem arising from text classification
No full textWe present a combinatorial optimization problem with a particular cost structure: a constrained set of elements must be chosen from a ground set and the ground set is partitioned into subsets corresponding to types of elements. The constraints concern the elements, whereas the solution cost does not depend on the elements but only on their types. The motivation of this study comes from text categorization but we believe that the same combinatorial structure may emerge in many different contexts. We prove that the problem is NP-hard. We give a 0-1 linear programming formulation and we report on computational experiences on very large instances using branch-and-bound algorithms based on two different Lagrangean relaxations and heuristic algorithms based on Threshold Accepting and Simulated Annealing
Knockin’ on heaven’s door? Reframing the debate on temporary employment and wages: evidence from Europe
Get PDFThis article reframes the debate on the consequences of flexibilization in European labour markets focusing on the unexplored impact of temporary employment on occupational wages for permanent workers. Exploiting the variation in the temps’ density within occupation and age groups across European countries between 2003 and 2010, we find that temporary contracts negatively affect occupational average wages for insiders’ workers. These results are still robust using a dynamic system based on generalized method of moments (GMM-SYS) to account for potential endogeneity issues. We also explore the existence of heterogeneity across different occupational clusters and institutional settings. Our estimates indicate that the knock-on effect is large in countries with low employment protection legislation and it is driven by occupations characterized by untechnical work logics
DEVELOPMENT OF A 3D SKIN MODEL BASED ON BIOCOMPATIBLE POLYMERIC HYDROGEL SCAFFOLD ENGINEERED WITH HUMAN MESENCHYMAL STROMAL CELLS FOR HEALING OF SKIN WOUNDS
Get PDFIn questo studio, abbiamo cercato di creare in vitro un dispositivo medicale “clinical grade” per un potenziale utilizzo nella medicina rigenerativa della cute. In particolare, sono stati sintetizzati, con una metodica innovativa, due tipologie di scaffold porosi a partire da G, polietilene glicole (PEG), CH e glicerolo (Gly): G-PEG-CH-Gly e G-PEG-CH.
È stata messa a punto una coltura monolayer (2D) per settare le condizioni di coltura per il differenziamento delle BM-hMSCS e delle UC-hMSCs a fibroblasti e cheratinociti. È seguita la coltura 3D in cui le BM-hMSCs e le UC-hMSCs sono state seminate negli idrogeli ibridi G-PEG-CH-Gly e G-PEG-CH in presenza di FBS o di hPL ed è stata valutata la loro vitalità, la proliferazione e la differenziazione verso la linea fibroblastica e cheratinocitica. È stata fatto un confronto tra il potenziale proliferativo e differenziativo degli idrogeli ibridi e quello del MatriDerm® (MD).In this study, we sought to create a 'clinical grade' medical device in vitro for potential use in skin regenerative medicine. Specifically, two types of porous scaffolds were synthesised from G, polyethylene glycol (PEG), CH and glycerol (Gly) using an innovative method: G-PEG-CH-Gly and G-PEG-CH. A monolayer (2D) culture was set up to set the culture conditions for the differentiation of BM-hMSCs and UC-hMSCs to fibroblasts and keratinocytes. This was followed by 3D culture in which BM-hMSCs and UC-hMSCs were seeded in G-PEG-CH-Gly and G-PEG-CH hybrid hydrogels in the presence of FBS or hPL and their viability, proliferation and differentiation to fibroblast and keratinocyte lineages was assessed. A comparison was made between the proliferative and differentiative potential of the hybrid hydrogels and that of MatriDerm® (MD)
Memory Fault Simulator for Static-Linked Faults
Get PDFStatic linked faults are considered an interesting class of memory faults. Their capability of influencing the behavior of other faults causes the hiding of the fault effect and makes test algorithm design and validation a very complex task. This paper presents a memory fault simulator architecture targeting the full set of linked fault
- …
