scholarly journals SMC PROTOCOL FOR DISTRIBUTED K- ANONYMITY

Author(s):  
V. SIREESHA ◽  
B. OBULESU

Secure multiparty protocols have been proposed to enable non colluding parties to cooperate without a trusted server. Even though such protocols put off information exposé other than the objective function, they are quite costly in computation and communication. The high overhead motivates parties to estimate the utility that can be achieved as a result of the protocol beforehand. To avoid this issue we propose a look-ahead approach, specifically for secure multiparty protocols to achieve distributed k-anonymity, which helps parties to decide if the utility benefit from the protocol is within an acceptable range before initiating the protocol. The look-aheadoperation is highly localized and its accuracy depends on the amount of information the parties are willing toshare. Experimental results show the effectiveness of the proposed methods.

Diabetes ◽  
2020 ◽  
Vol 69 (Supplement 1) ◽  
pp. 170-OR
Author(s):  
JINGYI QIAN ◽  
MICHAEL P. WALKUP ◽  
SHYH-HUEI CHEN ◽  
PETER H. BRUBAKER ◽  
DALE BOND ◽  
...  

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Fatemeh Amini ◽  
Felipe Restrepo Franco ◽  
Guiping Hu ◽  
Lizhi Wang

AbstractRecent advances in genomic selection (GS) have demonstrated the importance of not only the accuracy of genomic prediction but also the intelligence of selection strategies. The look ahead selection algorithm, for example, has been found to significantly outperform the widely used truncation selection approach in terms of genetic gain, thanks to its strategy of selecting breeding parents that may not necessarily be elite themselves but have the best chance of producing elite progeny in the future. This paper presents the look ahead trace back algorithm as a new variant of the look ahead approach, which introduces several improvements to further accelerate genetic gain especially under imperfect genomic prediction. Perhaps an even more significant contribution of this paper is the design of opaque simulators for evaluating the performance of GS algorithms. These simulators are partially observable, explicitly capture both additive and non-additive genetic effects, and simulate uncertain recombination events more realistically. In contrast, most existing GS simulation settings are transparent, either explicitly or implicitly allowing the GS algorithm to exploit certain critical information that may not be possible in actual breeding programs. Comprehensive computational experiments were carried out using a maize data set to compare a variety of GS algorithms under four simulators with different levels of opacity. These results reveal how differently a same GS algorithm would interact with different simulators, suggesting the need for continued research in the design of more realistic simulators. As long as GS algorithms continue to be trained in silico rather than in planta, the best way to avoid disappointing discrepancy between their simulated and actual performances may be to make the simulator as akin to the complex and opaque nature as possible.


2011 ◽  
Vol 11 (1) ◽  
Author(s):  
Tiffany L Gary-Webb ◽  
◽  
Kesha Baptiste-Roberts ◽  
Luu Pham ◽  
Jacqueline Wesche-Thobaben ◽  
...  

2017 ◽  
Vol 5 (10) ◽  
pp. 763-764 ◽  
Author(s):  
Edward W Gregg ◽  
Rena Wing
Keyword(s):  

1990 ◽  
Vol 28 (2) ◽  
pp. 369-384 ◽  
Author(s):  
M. J. ZEESTRATEN
Keyword(s):  

2014 ◽  
Vol 602-605 ◽  
pp. 3247-3250
Author(s):  
Yu Ming Chen

Optimization method ofmassive dataquery is researched in this paper.In the modernInternet environment,the datahas the characteristics oflarge amount of information, complexity, disorder, andchaosassociation. Using traditionalqueried methodsoftenrequirea lot oflimitedconditions, witha lot of drawbacks such as time-consuming data query, moreineffective queryand low efficiency.To this end, anoptimizationmethod of massive data query based onparallel Apriori algorithm is proposed in this paper.The massive dataare made simplification processing andredundant data are deleted to providedata foundation for fast and accuratedataquery.Effectiveassociation rulesof the massive data are calculated, in order to obtain the relevantof the target data. Based onAprioriparallel algorithm,massivedata are processedto achieveaccurate query. Experimental results show thatthe use ofoptimization algorithm for massive dataquerycan improvethe query speedof target data and it has a strong superiority.


Obesity ◽  
2018 ◽  
Vol 26 (10) ◽  
pp. 1558-1565 ◽  
Author(s):  
Rebecca A. Krukowski ◽  
Marion E. Hare ◽  
Gerald W. Talcott ◽  
Leslie A. Gladney ◽  
Karen C. Johnson ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document