Regular population monotonic allocation schemes and the core

A subclass of games with population monotonic allocation schemes is studied, namelygames with regular population monotonic allocation schemes (rpmas). We focus on theproperties of these games and we prove the coincidence between the core and both theDavis-Maschler bargaining set and the Mas-Colell bargaining set

Roles of multiple acyl-CoA oxidases in the routing of carbon flow towards β-oxidation and polyhydroxyalkanoate biosynthesis in Yarrowia lipolytica.

The oleaginous yeast Yarrowia lipolytica possesses six acyl-CoA oxidase (Aox) isoenzymes encoded by genes POX1-POX6. The respective roles of these multiple Aox isoenzymes were studied in recombinant Y. lipolytica strains that express heterologous polyhydroxyalkanoate (PHA) synthase (phaC) of Pseudomonas aeruginosa in varying POX genetic backgrounds, thus allowing assessment of the impact of specific Aox enzymes on the routing of carbon flow to β-oxidation or to PHA biosynthesis. Analysis of PHA production yields during growth on fatty acids with different chain lengths has revealed that the POX genotype significantly affects the PHA levels, but not the monomer composition of PHA. Aox3p function was found to be responsible for 90% and 75% of the total PHA produced from either C9:0 or C13:0 fatty acid, respectively, whereas Aox5p encodes the main Aox involved in the biosynthesis of 70% of PHA from C9:0 fatty acid. Other Aoxs, such as Aox1p, Aox2p, Aox4p and Aox6p, were not found to play a significant role in PHA biosynthesis, independent of the chain length of the fatty acid used. Finally, three known models of β-oxidation are discussed and it is shown that a 'leaky-hose pipe model' of the cycle can be applied to Y. lipolytica.

To select or to weigh: a comparative study of linear combination schemes for superparent-one-dependence estimators

We conduct a large-scale comparative study on linearly combining superparent-one-dependence estimators (SPODEs), a popular family of seminaive Bayesian classifiers. Altogether, 16 model selection and weighing schemes, 58 benchmark data sets, and various statistical tests are employed. This paper's main contributions are threefold. First, it formally presents each scheme's definition, rationale, and time complexity and hence can serve as a comprehensive reference for researchers interested in ensemble learning. Second, it offers bias-variance analysis for each scheme's classification error performance. Third, it identifies effective schemes that meet various needs in practice. This leads to accurate and fast classification algorithms which have an immediate and significant impact on real-world applications. Another important feature of our study is using a variety of statistical tests to evaluate multiple learning methods across multiple data sets.

Regular population monotonic allocation schemes and the core

A subclass of games with population monotonic allocation schemes is studied, namelygames with regular population monotonic allocation schemes (rpmas). We focus on theproperties of these games and we prove the coincidence between the core and both theDavis-Maschler bargaining set and the Mas-Colell bargaining set

Steganalytic methods for the detection of histogram shifting data-hiding schemes

In this paper, some steganalytic techniques designed to detect the existence of hidden messages using histogram shifting methods are presented. Firstly, some techniques to identify specific methods of histogram shifting, based on visible marks on the histogram or abnormal statistical distributions are suggested. Then, we present a general technique capable of detecting all histogram shifting techniques analyzed. This technique is based on the effect of histogram shifting methods on the "volatility" of the histogram of differences and the study of its reduction whenever new data are hidden.

A connectome-based comparison of diffusion MRI schemes.

Diffusion MRI has evolved towards an important clinical diagnostic and research tool. Though clinical routine is using mainly diffusion weighted and tensor imaging approaches, Q-ball imaging and diffusion spectrum imaging techniques have become more widely available. They are frequently used in research-oriented investigations in particular those aiming at measuring brain network connectivity. In this work, we aim at assessing the dependency of connectivity measurements on various diffusion encoding schemes in combination with appropriate data modeling. We process and compare the structural connection matrices computed from several diffusion encoding schemes, including diffusion tensor imaging, q-ball imaging and high angular resolution schemes, such as diffusion spectrum imaging with a publically available processing pipeline for data reconstruction, tracking and visualization of diffusion MR imaging. The results indicate that the high angular resolution schemes maximize the number of obtained connections when applying identical processing strategies to the different diffusion schemes. Compared to the conventional diffusion tensor imaging, the added connectivity is mainly found for pathways in the 50-100mm range, corresponding to neighboring association fibers and long-range associative, striatal and commissural fiber pathways. The analysis of the major associative fiber tracts of the brain reveals striking differences between the applied diffusion schemes. More complex data modeling techniques (beyond tensor model) are recommended 1) if the tracts of interest run through large fiber crossings such as the centrum semi-ovale, or 2) if non-dominant fiber populations, e.g. the neighboring association fibers are the subject of investigation. An important finding of the study is that since the ground truth sensitivity and specificity is not known, the comparability between results arising from different strategies in data reconstruction and/or tracking becomes implausible to understand.

Anonymous Routing Protocol in decentralized networks

Peer-reviewed

Steganalytic Methods for the Detection of Histogram Shifting Data Hiding Schemes

Peer-reviewed

Secure Dynamic MANET On-demand (SEDYMO) Routing Protocol

This paper describes the state of the art of secure ad hoc routing protocols and presents SEDYMO, a mechanism to secure a dynamic multihop ad hoc routing protocol. The proposed solution defeats internal and external attacks usinga trustworthiness model based on a distributed certification authority. Digital signatures and hash chains are used to ensure the correctness of the protocol. The protocol is compared with other alternatives in terms of security strength, energy efficiency and time delay. Both computational and transmission costs are considered and it is shown that the secure protocol overhead is not a critical factor compared to the high network interface cost.

Spatial processing for frequency diversity schemes

A novel technique to obtain optimum blind spatialprocessing for frequency diversity spread spectrum (FDSS) communicationsystems is introduced. The sufficient statistics for alinear combiner, which prove ineffective due to the interferers frequencycharacteristics, are modified to yield improved detectionunder partial jamming in the spectral domain. Robustness to partialtime jamming is achieved by extending the notion of replicasover the frequency axis to a repetition over the time variable. Analysisand simulations are provided, showing the advantages of usingFDSS with spatial diversity to combat the interference when it isconfined to a narrow frequency band or short time interval relativeto the desired signal extent in either domain.

Evaluation of Routing solution for Next Generation Open Platform

Verkkoon kytkettävien laitteiden määrä on lisääntynyt viime vuosina, joka luo tarpeen reitittimille ja niiden ominaisuuksille. On muodostunut uusi tarve laitteille, jotka voivat yhdistää erilaisia verkkoja toisiinsa. Tällaisen reitittimen rakentamiseen tarvitaan vakaa alusta. Tällaisella alustalla luodaan mahdollisuus kuormittaa järjestelmää ilman suuria ongelmia. Tällainen alusta on Open Platform, joka on suunniteltu tällaisille toiminnoille ja yhdessä oikeanlaisen verkkoratkaisun kanssa sitä voidaan käyttää sille suunnitellussa ympäristössä. Tämän diplomityön tarkoituksena on arvioida neljää eri reititysohjelmistoa ja kahta eri IP pinoa. Työssä käytetyt testit on suunniteltu arviointia varten ja niiden tarkoituksena on tuoda esille ohjelmistoissa esiintyvät viat ja ongelmat. Kaikki testit ovat samoja kaikille ohjelmille ja tehdään samassa ympäristössä. Testit analysoidaan niiden ajon jälkeen ja niiden tulosten avulla tehdään päätös mitä näistä ohjelmistoista tullaan käyttämään seuraavan sukupolven avoimella alustalla, joka tulee toimimaan Nokian Intelligent Service Nodessa. Tämä verkon laite toimii yhdyskäytävänäerilaisten verkkojen välillä.

Cost Models for Routing and Wavelength Assignment in Wavelength-Division Multiplexing Optical Net

WDM (Wavelength-Division Multiplexing) optiset verkot on tällä hetkellä suosituin tapa isojen määrän tietojen siirtämiseen. Jokaiselle liittymälle määrätään reitin ja aallonpituus joka linkin varten. Tarvittavan reitin ja aallon pituuden löytäminen kutsutaan RWA-ongelmaksi. Tämän työn kuvaa mahdollisia kustannuksen mallein ratkaisuja RWA-ongelmaan. Olemassa on paljon erilaisia optimoinnin tavoitteita. Edellä mainittuja kustannuksen malleja perustuu näillä tavoitteilla. Kustannuksen malleja antavat tehokkaita ratkaisuja ja algoritmeja. The multicommodity malli on käsitelty tässä työssä perusteena RV/A-kustannuksen mallille. Myöskin OB käsitelty heuristisia menetelmiä RWA-ongelman ratkaisuun. Työn loppuosassa käsitellään toteutuksia muutamalle mallille ja erilaisia mahdollisuuksia kustannuksen mallein parantamiseen.

Readout schemes for low noise single-photon avalanche diodes fabricated in conventional HV-CMOS technologies

Three different pixels based on single-photon avalanche diodes for triggered applications, such as fluorescence lifetime measurements and high energy physics experiments, are presented. Each pixel consists of a 20µm x 100µm (width x length) single photon avalanche diode and a monolithically integrated readout circuit. The sensors are operated in the gated mode of acquisition to reduce the probability to detect noise counts interferring with real radiation events. Each pixel includes a different readout circuit that allows to use low reverse bias overvoltages. Experimental results demonstrate that the three pixels present a similar behaviour. The pixels get rid of afterpulses and present a reduced dark count probability by applying the gated operation. Noise figures are further improved by using low reverse bias overvoltages. The detectors exhibit an input dynamic range of 13.35 bits with short gated"on" periods of 10ns and a reverse bias overvoltage of 0.5V. The three pixels have been fabricated in a standard HV-CMOS process.

Question Waves: A multicast query routing algorithm for social search

This paper describes Question Waves, an algorithm that can be applied to social search protocols, such as Asknext or Sixearch. In this model, the queries are propagated through the social network, with faster propagation through more trustable acquaintances. Question Waves uses local information to make decisions and obtain an answer ranking. With Question Waves, the answers that arrive first are the most likely to be relevant, and we computed the correlation of answer relevance with the order of arrival to demonstrate this result. We obtained correlations equivalent to the heuristics that use global knowledge, such as profile similarity among users or the expertise value of an agent. Because Question Waves is compatible with the social search protocol Asknext, it is possible to stop a search when enough relevant answers have been found; additionally, stopping the search early only introduces a minimal risk of not obtaining the best possible answer. Furthermore, Question Waves does not require a re-ranking algorithm because the results arrive sorted