نتایج جستجو برای: over wieght

تعداد نتایج: 1136338  

2002
Tobias ANDERSSON

The objective of this research proposal is to see how components can be used to map information from one system to an other. To do this a number of different problems must be addressed, and three groups of problems can be found. The first is how components work and how the other problems can benefit from that. The second is mapping, both syntactically and semantically. What information is neede...

2012
Bruno Brochado Ribeiro Débora Maurmo Modesto Gleison Santos

Métodos de estimativas como o Pontos por Casos de Uso (PCU) calibram o tamanho do software baseado em características técnicas e ambientais associadas aos projetos e às equipes de desenvolvimento. Este artigo analisa os resultados de uma pesquisa realizada com profissionais da área de software, utilizando o método Processo Analítico Hierárquico (AHP), sobre a relevância de cada uma das caracter...

2001
L. Roselli A. Casini

We have developed some low-cost predistortion circuits to compensate secondand third-order laser distortions in multiservice radio-over-fiber industrial systems. Depending on the predistorter configuration implemented, average reductions of 10–15 dB and of 8–10 dB have been observed in the laser secondand third-order distortions, respectively, within the cellular bands relevant to the European ...

2015
Kohji Kamada

A number of researchers claim that the derivation of the Right Dislocation Construction (RDC) involves movement (e.g., Chung, 2012, for Korean; Ott & de Vries, 2012, 2015, for Dutch and German; Tanaka, 2001 and Abe, 2004, for Japanese; Whitman, 2000, for English, Japanese, and Korean). However, the RDC in English does not obey movement constraints such as the Coordinate Structure Constraint and...

2009
Ming-Jun Lai Bradley J. Lucier Jingyue Wang

We study the connection between minimizers of the discrete and the continuous Rudin-Osher-Fatemi models. We use a centraldifference total variation term in the discrete ROF model and treat the discrete input data as a projection of the continuous input data into the discrete space. We employ a method developed in [13] with slight adaption to the setting of the central-difference total variation...

Journal: :Systematic biology 1998
W H Day G F Estabrook F R McMorris

Two qualitative taxonomic characters are potentially compatible if the states of each can be ordered into a character state tree in such a way that the two resulting character state trees are compatible. The number of potentially compatible pairs (NPCP) of qualitative characters from a data set may be considered to be a measure of its phylogenetic randomness. The value of NPCP depends on the nu...

2001
Carlos Alberto Ferreira Bispo Edson Walmir Cazarini

O objetivo princzpal deste artigo e" fer com que todos, sejam os acade^micos ou Os empresa rios ou aLnda os consumz.dores, compreendam o cena"rz-o atual e possam ter, pelo menos, uma percep50 minx'ma dos rumos qu_e as empresas, as tecnoLogz"as e o mercado consumidor tonzara-o nos pr6xz"mos anos. Para aLcanor o obj~etino deste artigo, mostra-Se o resultado de um estudo onde e" avaliado como as e...

2004
Wanncherng Wang

This paper examines the relationship between firm performance and ownership structure for listed and OTC manufacturing firms in Taiwan. By classifying ownership into three categories (managerial owners, institutional owners and the control group), the study addresses two related empirical issues—the commonly examined piecewise and the Granger causality relationships between ownership and perfor...

Journal: :CoRR 2015
Meena Mahajan Anuj Tawari

An arithmetic read-once formula (ROF) is a formula (circuit of fan-out 1) over +,× where each variable labels at most one leaf. Every multilinear polynomial can be expressed as the sum of ROFs. In this work, we prove, for certain multilinear polynomials, a tight lower bound on the number of summands in such an expression.

2013
Alexios Balatsoukas-Stimming

In this report, we review the construction of polar codes and we briefly present the main results that lead to the conclusion that polar codes are capacity achieving over binaryinput discrete memoryless channels. Moreover, we discuss a more sophisticated variant of successive cancellation decoding, namely list successive cancellation decoding, that aims to improve the finite-length performance ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید