Filters








1,177,507 Hits in 12.8 sec

On the Feasibility of Consistent Computations [chapter]

Sven Laur, Helger Lipmaa
2010 Lecture Notes in Computer Science  
As a concrete practical contribution, we show how to implement consistent versions of several important cryptographic protocols such as oblivious transfer, conditional disclosure of secrets and private  ...  Aumann and Lindell introduced a concept of covert adversaries to formalize this type of corruption. In the current paper, we refine their model to get stronger security guarantees.  ...  Both authors were supported by the European Regional Development Fund through the Estonian Centre of Excellence in Computer Science, EXCS.  ... 
doi:10.1007/978-3-642-13013-7_6 fatcat:342ngsug6ndengm7hcqamuywx4

Qualitative spatial reasoning using algebraic topology [chapter]

Boi Faltings
1995 Lecture Notes in Computer Science  
It uses Helly's theorem to decide consistency of any set of k propositions based on information about consistency of small subsets.  ...  Using methods of algebraic topology, I s h o w a su cient method to compute a minimal skeleton of feasible places which accurately models the connectivity b e t ween feasible environments.  ...  In c), no relation between 3 1. compute the set of maximal consistent e n vironments M. 2. compute the set of candidates for minimal feasible and join environments as all subsets shared by at least 2  ... 
doi:10.1007/3-540-60392-1_2 fatcat:l3hvgzdokbeoxpmzvap4ctst4a

Instruction Scheduling with Release Times and Deadlines on ILP Processors

Hui Wu, J. Jaffar, Jingling Xue
2006 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06)  
Our algorithm is guaranteed to find a feasible schedule whenever one exists in the following special cases: 1) one functional unit, arbitrary precedence constraints, latencies in {0, 1}, integer release  ...  The time complexity of our algorithm is O(n 2 log d) + min{O(de), O(ne)} + min{O(ne), O(n 2.376 )}, where n is the number of instructions, e is the number of edges in the precedence graph and d is the  ...  and the ILP processor M , compute a feasible schedule whenever one exists.  ... 
doi:10.1109/rtcsa.2006.39 dblp:conf/rtcsa/WuJX06 fatcat:aze7ninpefbu5h5e2pgwxvqmxm

Development of Learning Media Game Computer Assembly (GAPEKO) Android Based on Computer Assembly Subjects for Students TKJ SMK Negeri 1 Sukoharjo

Mutri Widiasih, Yudianto Sujana, A G Thamrin
2019 Journal of Informatics and Vocational Education  
of computer assembly (2) to investigate the feasibility of learning media game computer assembly (GAPEKO) android based on computer assembly subjects for students TKJ SMK Negeri 1 Sukoharjo.  ...  Based on the measurement results feasibility it can be concluded that the learning media game computer assembly (GAPEKO) android based on computer assembly subjects for students TKJ SMK Negeri 1 Sukoharjo  ...  On the basis of the researchers are interested in developing learning media game computer assembly (GAPEKO) android based for students TKJ in favor of the practice material on computer assembly subjects  ... 
doi:10.20961/joive.v2i1.35699 fatcat:ffp6as5gxnbdrosq7f5yocao5e

Diagnostics of Data-Driven Models: Uncertainty Quantification of PM7 Semi-Empirical Quantum Chemical Method

James Oreluk, Zhenyuan Liu, Arun Hegde, Wenyu Li, Andrew Packard, Michael Frenklach, Dmitry Zubarev
2018 Scientific Reports  
The training data are chemically accurate, i.e., they have very low uncertainty by the standards of computational chemistry.  ...  Nevertheless, PM7 is found to be consistent for subsets of the training data.  ...  The views and opinions of authors expressed herein do not necessarily state or reflect those of the United States Government or any agency thereof.  ... 
doi:10.1038/s41598-018-31677-y pmid:30185953 pmcid:PMC6125339 fatcat:6appti5enfhdtpfaiwsw6la7z4

A progressive method to solve large-scale AC optimal power flow with discrete variables and control of the feasibility

Manuel Ruiz, Jean Maeght, Alexandre Marie, Patrick Panciatici, Arnaud Renaud
2014 2014 Power Systems Computation Conference  
injection level:-: set value of active injection computed using data mining -: active over injection defined by of activated devices  ℎ : value of the attribute for one unit • The main objective is to  ...  production levels: -Induces active and reactive non linear power balances, -Allows computation of active power losses. • Security constraints: -Bounds on voltage magnitude, -Upper bounds on currents (  ...  Conclusion • The problem of solving extended OPF with no guarantee on feasibility is addressed. • A custom methodology is designed.  ... 
doi:10.1109/pscc.2014.7038395 dblp:conf/pscc/RuizMMPR14 fatcat:dwgrlrrh7bbilg6nvc7gcoq7r4

Accelerating Convergence Method for Relaxation Cooperative Optimization

JING CHEN, YU CHAO LV, LI MIN WANG
2017 DEStech Transactions on Computer Science and Engineering  
To solve problems of higher computational cost and lower convergence speed in collaborative optimization, a new relaxation cooperative optimization method of accelerating convergence is presented.  ...  solution and their average value; in the optimization solving stage, the optimal solution in the former stage is taken as the initial point, relaxation factors with consistent precision are collaboratively  ...  , enhance the consistency among disciplines and guarantee the feasibility of this method.  ... 
doi:10.12783/dtcse/icmsie2016/6332 fatcat:6hx53w2sxjhtljevsnf7tf5rnm

Atomic commit in concurrent computing

P. Thanisch
2000 IEEE Concurrency  
Indeed, one of the roles of the commit protocol is to ensure that agents only make changes that maintain this local consistency.  ...  First, traditional TP contains the notion of a consistent global state, in which each transaction transforms the database from one consistent global state to another.  ... 
doi:10.1109/4434.895104 fatcat:nsl3nyxvarac3fgvtpuqh5wrca

The Feasibility of Information Technology Infrastructure according to the Regulation of the Minister of National Education No.40 of 2008: A Case Study at SMK Palembang City

Supriyati Supriyati, Darius Antoni, Muhammad Akbar
2020 International Journal of Information Systems and Informatics  
Based on research according to Permendiknas No. 40 of 2008 contains computer laboratory furniture, including: the ratio of the number of student chairs and desks, the ratio of the number of teacher chairs  ...  The feasibility of infrastructure to determine the level and feasibility of Information Technology Vocational Schools in Palembang City.  ...  . 40 of 2008 which consists of: laboratory furniture, educational equipment, educational media, other equipment, as well as assessment of the feasibility of IT infrastructure based on O'brien's theory  ... 
doi:10.47747/ijisi.v1i1.79 fatcat:nv4tddnc6vbytbrasafgojn4we

Shape decomposition algorithms for laser capture microdissection

Leonie Selbach, Tobias Kowalski, Klaus Gerwert, Maike Buchin, Axel Mosig
2021 Algorithms for Molecular Biology  
Results We model this problem of constrained shape decomposition as the computation of optimal feasible decompositions of simple polygons.  ...  We use a skeleton-based approach and present an algorithmic framework that allows the implementation of various feasibility criteria as well as optimization goals.  ...  Acknowledgements We acknowledge support by the Open Access Publication Funds of the Ruhr-Universität Bochum.  ... 
doi:10.1186/s13015-021-00193-6 pmid:34238311 fatcat:4zbhrgnyfzg4tajxd5pmkxm7xy

Computing Height-Optimal Tangles Faster [article]

Oksana Firman, Philipp Kindermann, Alexander Ravsky, Alexander Wolff, Johannes Zink
2019 arXiv   pre-print
Given a set of n y-monotone wires, a tangle determines the order of the wires on a number of horizontal layers such that the orders of the wires on any two consecutive layers differ only in swaps of neighboring  ...  We implemented the algorithm for the general case and compared it to an existing algorithm. Finally, we discuss feasibility for lists with a simple structure.  ...  We thank Thomas C. van Dijk for stimulating discussions and the anonymous reviewers for helpful comments.  ... 
arXiv:1901.06548v5 fatcat:3ubpsd53mnb4bgbq7y3lzprjqi

Page 201 of Journal of the Association for Computing Machinery Vol. 8, Issue 2 [page]

1961 Journal of the Association for Computing Machinery  
Some of these methods and possibilities are now feasible and others will become feasible as the capabilities of high speed computers increase.  ...  A scheme which is feasible for application on a high speed computer is developed for determining the huge number of re- gression relations that can arise among subsets of the estimation variables.  ... 

A Feasibility Study on the Research Infrastructure Projects for the High-Speed Big Data Processing Devices Using AHP

Dae Ho Kim, Dongwook Kim
2016 International Journal of Software Engineering and Its Applications  
The purpose of this study is to implement the feasibility analysis on this project.  ...  and test a large scale of computing devices and a kernel SW.  ...  Acknowledgments This study was financially supported by the academic research fund of Mokwon University in 2016 and the National Research Foundation of Korea Grant funded by the Korean Government (NRF-  ... 
doi:10.14257/ijseia.2016.10.4.04 fatcat:zuk5wwkg5zadtgmyotr27tsfk4

Page 201 of American Society of Civil Engineers. Collected Journals Vol. 17, Issue 3 [page]

2003 American Society of Civil Engineers. Collected Journals  
check for the neighbors generated; Identify the feasible neighbors; Compute the heuristic search function for the feasible neigh- bors; Choose the best neighbor based on the heuristic function value;  ...  The total number of neighbors generated for each configuration de- pends on the number and the type of DOF that vary between two JOURNAL OF COMPUTING IN CIVIL ENGINEERING © ASCE / JULY 2003 / 201  ... 

Temporal Consistency Maintenance Upon Partitioned Multiprocessor Platforms

Jianjun Li, Jian-Jia Chen, Ming Xiong, Guohui Li, Wei Wei
2016 IEEE transactions on computers  
Despite years of active research, most of the past work focuses on uniprocessor systems.  ...  Firstly, we only consider the feasibility aspect of the problem by proposing two polynomial time partitioning schemes, Temporal Consistency Partitioning under EDF (TCP EDF ) and Temporal Consistency Partitioning  ...  ACKNOWLEDGMENTS A preliminary version of this paper appeared in [25]  ... 
doi:10.1109/tc.2015.2448088 fatcat:hdy6kbtf2zbgvcadfnjnfyncda
« Previous Showing results 1 — 15 out of 1,177,507 results