Valószínűségi változók függvényeinek korlátozása = Bounding of functions of random variables

2004-2007-ig az alábbi területeken születtek új eredmények: 1. A többváltozós diszkrét momentum probléma (TDMP) megoldhatósága hatékonyságának növelése. 2. A TDMP alkalmazása várható hasznosság becslésére. 3. Véletlen vektorváltozók függvényei várható értékének korlátozása a peremeloszlások és néhány vegyes momentum ismeretében. 4. Alkalmazások: Monge tulajdonsággal rendelkező célfüggvény korlátozása adott egyváltozós peremeloszlások és adott kovarianciák mellett, többváltozós momentum generátor függvények pontbecslése. 5. A TDMP-t korlátozó kétváltozós ("min") algoritmus többváltozós általánosítása 6. Közgazdasági alkalmazások a TDMP, az általánosított szita formulák illetve a copulák témaköreihez 7. Bonferroni típusú, képletszerű valószínűségi korlátok megadása a TDMP duál megengedett bázisstruktúrái segítségével. 8. A TDMP megoldása az egyváltozós DMP módszerei segítségével. 2008-ban született eredmények: 9. A TDMP-t korlátozó többváltozós algoritmus alkalmazása események uniója valószínűségének becslésére. 10. A TDMP megoldása az egyváltozós DMP módszerei segítségével, a TDMP-re tett további feltételek nélkül 11. A Bonferroni típusú, képletszerű valószínűségi korlátok bővebb körének megtalálása. | 2004-2007: 1) Improving the solution method of the multivariate discrete moment problem (MDMP) 2) Application of the MDMP for approximating expected utility. 3) Bounding expectations of functions of random vectors with given marginals and some moments. 4) Applications: bounding expected values of functions with Monge property, if the marginal distributions and covariances are given. Approximating the value of multivariate moment generating functions. 5) Generalization of the bivariate (?min?) solution algorithm of MDMP for higher dimensions. 6) Applications of MDMP in economics: sieve formulas, copulas. 7) Bonferroni-type probability bounds, given by formulae, based on the dual feasible basis structures of MDMP. 8) Solution of MDMP by the methods of univariate DMP. 2008: 9) Application of the binomial MDMP for bounding the probability of the union of events. 10) Solution of MDMP by the methods of univariate DMP without any extra assumption. 11) More Bonferroni-type bounds

TDMP-Reliable Target Driven and Mobility Prediction based Routing Protocol in Complex VANET

Vehicle-to-everything (V2X) communication in the vehicular ad hoc network (VANET), an infrastructure-free mechanism, has emerged as a crucial component in the advanced Intelligent Transport System (ITS) for special information transmission and inter-vehicular communications. One of the main research challenges in VANET is the design and implementation of network routing protocols which manage to trigger V2X communication with the reliable end-to-end connectivity and efficient packet transmission. The organically changing nature of road transport vehicles poses a significant threat to VANET with respect to the accuracy and reliability of packet delivery. Therefore, a position-based routing protocol tends to be the predominant method in VANET as they overcome rapid changes in vehicle movements effectively. However, existing routing protocols have some limitations such as (i) inaccurate in high dynamic network topology, (ii) defective link-state estimation (iii) poor movement prediction in heterogeneous road layouts. In this paper, a target-driven and mobility prediction (TDMP) based routing protocol is therefore developed for high-speed mobility and dynamic topology of vehicles, fluctuant traffic flow and diverse road layouts in VANET. The primary idea in TDMP is that the destination target of a driver is included in the mobility prediction to assist the implementation of the routing protocol. Compared to existing geographic routing protocols which mainly greedily forward the packet to the next-hop based on its current position and partial road layout, TDMP is developed to enhance the packet transmission with the consideration of the estimation of inter-vehicles link status, and the prediction of vehicle positions dynamically in fluctuant mobility and global road layout.Comment: 35 pages,16 Figure

Acceleration of High-Fidelity Wireless Network Simulations

Network simulation with bit-accurate modeling of modulation, coding and channel properties is typically computationally intensive. Simple link-layer models that are frequently used in network simulations sacrifice accuracy to decrease simulation time. We investigate the performance and simulation time of link models that use analytical bounds on link performance and bit-accurate link models executed in Graphical Processing Units (GPUs). We show that properly chosen analytical bounds on link performance can result in simulation results close to those using bit-level simulation while providing a significant reduction in simulation time. We also show that bit-accurate decoding in link models can be expedited using parallel processing in GPUs without compromising accuracy and decreasing the overall simulation time

Secure Information Model for Data Marketplaces Enabling Global Distributed Manufacturing

AbstractThe German term “Industrie 4.0” is distinguished by expanding networking and intelligence of machines, products and services In this context new business models are developed, many of them is based mainly on digital design and production data In this paper, a new concept for a technology data marketplace (TDMP) is presented, which allows trading manufacturing process data Digital data distribution involves various risks by hackers’ attacks, theft or manipulation of data So, the use of effective security methods and mechanisms is the key to the success of this TDMP At the same time authority, authenticity, privacy and availability of these machine data are highly required for secure use and confidential identities The scientific challenge is to develop a secure concept of technology data exchange between market members Furthermore providing machines with required data automatically from the marketplace is desired This distribution of data introduces a basic concept to exchange and protect production information In addition it discusses developing new business models based on existing resources, which create a new value stream in the industry

New Algorithms for High-Throughput Decoding with Low-Density Parity-Check Codes using Fixed-Point SIMD Processors

Most digital signal processors contain one or more functional units with a single-instruction, multiple-data architecture that supports saturating fixed-point arithmetic with two or more options for the arithmetic precision. The processors designed for the highest performance contain many such functional units connected through an on-chip network. The selection of the arithmetic precision provides a trade-off between the task-level throughput and the quality of the output of many signal-processing algorithms, and utilization of the interconnection network during execution of the algorithm introduces a latency that can also limit the algorithm\u27s throughput. In this dissertation, we consider the turbo-decoding message-passing algorithm for iterative decoding of low-density parity-check codes and investigate its performance in parallel execution on a processor of interconnected functional units employing fast, low-precision fixed-point arithmetic. It is shown that the frequent occurrence of saturation when 8-bit signed arithmetic is used severely degrades the performance of the algorithm compared with decoding using higher-precision arithmetic. A technique of limiting the magnitude of certain intermediate variables of the algorithm, the extrinsic values, is proposed and shown to eliminate most occurrences of saturation, resulting in performance with 8-bit decoding nearly equal to that achieved with higher-precision decoding. We show that the interconnection latency can have a significant detrimental effect of the throughput of the turbo-decoding message-passing algorithm, which is illustrated for a type of high-performance digital signal processor known as a stream processor. Two alternatives to the standard schedule of message-passing and parity-check operations are proposed for the algorithm. Both alternatives markedly reduce the interconnection latency, and both result in substantially greater throughput than the standard schedule with no increase in the probability of error

Application of defoliants alters leaf growth and gas exchange parameters for cotton defoliation

The goal of the current study was to determine how different chemical defoliants and application timing affected defoliation in cotton variety CO 17. The studies were conducted using a split-plot design with three applications at three different times as the main plot and seven defoliants as the subplot. Thidiazuron + Diuron (0.03%) defoliant reduced the gas exchange parameters, photosynthetic rate, transpiration rate and stomatal conductance by reducing plant growth parameters, leaf area, leaf area index, specific leaf weight which significantly increased the defoliation percentage. The negative correlation of cotton growth and gas exchange parameters with defoliation percentage was observed in correlation studies. In conclusion, Thidiazuron + Diuron (0.03%) defoliant was found to be superior in action for improving leaf defoliation and its associated parameters. And also it may be a cost-effective cotton defoliant for aiding the mechanical picking of cotton bolls

Genetic variability, heritability and correlation among soybean [Glycine max. (L.) Merrill] varieties

The study was conducted at Teaching and Research Farm, Faculty of Agriculture, Bayero University, Kano (Lat 11059`N, Long 8025`E and 466m above sea level), during 2016 rainy season, to determine the variability, heritability and correlation among the soybean varieties. The treatments consist of eight soybean varieties, laid out in Randomized Complete Block Design (RCBD) and replicated four times; varieties were evaluated for fifteen characters to determine variability, estimate heritability and correlation. Analysis of variance revealed significant difference (P>0.01<0.05) with respect to four characters and highly significant (P≤0.01) four seven characters. The results indicated the presence of substantial variability among the varieties. GCV, PCV, ECV and heritability estimates ranges from 0.000039-169.18, 0.000066-187.55, 0.000053-122.28 and 0-100% respectively, the high Genotypic Coefficient of Variation (GCV), Phenotypic Coefficient of Variation (PCV) and Environmental Coefficient of Variation (ECV) observed in this study indicated the existence of variability and selection can be done. Whereas high estimate of broad Sense heritability for the tested parameters indicated that these characters were highly heritable and selection can be imposed. Significant phenotypic correlation for GWha and FWha with FWP respectively revealed that, these characters were primarily influenced by their direct contribution to higher yield. It is therefore recommended for an effective selection of those characters could be adopted for cultivar improvement and hybridization program and more research is needed to validate the findings.Keywords: Genetic, Heritability , Soybean, Variabilit