48,762 Hits in 8.4 sec

On the time complexity of minimum and maximum global snapshot problems

Loon-Been Chen, I-Chen Wu
1998 Information Processing Letters  
According to their results, these snapshot problems are linear-time reducible to the MCNF problem. Above investigations only point out that the time complexities of the minimum and maximum global  ...  ., Groselj, Chen and Wu, have shown that the minimum and maximum global snapshot problems are linear-time reducible to the maximum constant-ratio network flow (MCNF) problem, here defined as the wellknown  ...  Acknowledgments The authors would like to thank the National Science Council of the Republic of China for financially supporting this research under Contract No. NSC-86-2213-E-009-32.  ... 
doi:10.1016/s0020-0190(98)00100-8 fatcat:yio7s4e7zvcyznn4vh5yx5ubgy

On Detection of Bounded Global Predicates

I.-C. Wu
1998 Computer journal  
In order to detect bounded global predicates, we can first derive the minimum and maximum global snapshots and then check if the minimum and maximum are out of the range.  ...  By using this technique, we can remove the above restriction and also derive the minimum and maximum global snapshots at the same time.  ...  ACKNOWLEDGEMENTS The authors would like to thank the National Science Council of the Republic of China for financially supporting this research under contract No. NSC-83-0408-E-009-027.  ... 
doi:10.1093/comjnl/41.4.231 fatcat:wpsdoykccfhl7iapqlszv3hy7u

Plan switching: an approach to plan execution in changing environments

Han Yu, D.C. Marinescu, A.S. Wu, H.J. Siegel, R.A. Daley, I-Jeng Wang
2006 Proceedings 20th IEEE International Parallel & Distributed Processing Symposium  
A possible solution is to construct a family of activity graphs beforehand and investigate the means of switching from one member of the family to another when the execution of one activity graph fails  ...  The execution of a complex task in any environment requires planning.  ...  (b) The average, minimum, and maximum number of plan switches in successful runs. The simulation results when 1% of the global consistent snapshots are congruent snapshots.  ... 
doi:10.1109/ipdps.2006.1639395 dblp:conf/ipps/YuMWSDW06 fatcat:uoga5vukgrgklgoixomnsm5mbm

Oil-Spills Detection in Net-Sar Radar Images Using Support Vector Machine

Dong Zhi-Ming, Guo Li-Xia, Zeng Jian-Kui, Zhou Xue-Bin
2015 Open Automation and Control Systems Journal  
The Maximum Likelihood (ML) is one of the good solutions.  ...  To deal with these problems, this paper describes an application of neural network (NN) for obtaining the global optimal solution of ML DOA estimation.  ...  To overcome this problem and increase the probability of finding the global minimum, some modifications have been proposed.  ... 
doi:10.2174/1874444301507011958 fatcat:6vxbimogzzegxovvuy7qmxtrmu

Statistical complexity measures as telltale of relevant scales in emergent dynamics of spatial systems

A. Arbona, C. Bona, B. Miñano, A. Plastino
2014 Physica A: Statistical Mechanics and its Applications  
The definition of complexity through Statistical Complexity Measures (SCM) has recently seen major improvements. Mostly, effort is concentrated in measures on time series.  ...  From a local perspective, the SCM is minimum both in highly ordered and chaotic areas, while it reaches a maximum at the edges between such areas.  ...  We thank Joan Massó (University of the Balearic Islands) for useful discussion on the domain size analysis.  ... 
doi:10.1016/j.physa.2014.05.005 fatcat:zoultmlv5jct3isaioc7mr5uey

Consistency Based Snapshot Management in Data Grids

Lutz Schlesinger
2003 Very Large Data Bases Conference  
This paper focuses on the quantification of the inconsistency and the snapshot management at inidividual members of a global data grid.  ...  Holding multiple versions of snapshots, the user has the possibility to combine snapshots taken at different points in time to get a more globally consistent, but possibly older view.  ...  To establish global consistency from time to time a snapshot of the master copy is locally stored once in a while, which avoids the complex process of asynchronously updates.  ... 
dblp:conf/vldb/Schlesinger03 fatcat:rxdjhhaajbherd45hgi276arqq

Hybrid Garbage Collection for Multi-Version Concurrency Control in SAP HANA

Juchang Lee, Hyungyu Shin, Chang Gyoo Park, Seongyun Ko, Jaeyun Noh, Yongjae Chuh, Wolfgang Stephan, Wook-Shin Han
2016 Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16  
While multi-version concurrency control (MVCC) supports fast and robust performance in in-memory, relational databases, it has the potential problem of a growing number of versions over time due to obsolete  ...  A set of versions for each record is first identified as candidate if their version timestamps are lower than the minimum value of snapshot timestamps of active snapshots in the system.  ...  The authors would like to acknowledge Sang Kyun Cha, who lead the development of P*TIME and SAP HANA row store and thus provided the foundation for the research presented in this paper.  ... 
doi:10.1145/2882903.2903734 dblp:conf/sigmod/LeeSPKNCSH16 fatcat:y36t4tyet5fn5fvvpuwfws7zkm

Fundamental data movement operations and its applications on a hyper-bus broadcast network

Horng-Ren Tsai, Shi-Jinn Horng, Tzong-Wann Kao, Shung-Shing Lee, Shun-Shan Tsai
1999 Parallel Computing  
Note that the proposed algorithms not only can be implemented on the HBBN but also can be easily modi®ed to run on other broadcast-based networks with the same time and processor complexities. Ó  ...  These include the leftmost one problem, the pre®x maxima/minima problem, the m-contour problem, the all nearest neighbor problem and the all nearest smaller values problem, respectively.  ...  Acknowledgements The work was supported by National Science Council under the contract no. NSC-85-2221-E011-004.  ... 
doi:10.1016/s0167-8191(98)00105-7 fatcat:nbuv2rvxkfhhdln3fspdwfep3y

Capacity Analysis of LEO Mega-Constellation Networks

Ningyuan Wang, Liang Liu, Zhaotao Qin, Bingyuan Liang, Dong Chen
2022 IEEE Access  
Numerical results illustrate the superiority of the proposed IFPTA algorithm in accuracy and time complexity compared to existing solutions.  ...  with the support of the time-variant network topology model and the task distribution model.  ...  The snapshot sampling step is 30s, and the simulation time T is one orbit period of the satellite, which is 105 seconds for 1000 H km = . The link capacity of ISLs 1 ISL C Gbps = .  ... 
doi:10.1109/access.2022.3149961 fatcat:ufwywcqtpbdyvcz6ehg7kdma5q

Towards Efficient I/O Scheduling for Collaborative Multi-Level Checkpointing

Avinash Maurya, Bogdan Nicolae, M. Mustafa Rafique, Thierry Tonellot, Franck Cappello
2021 2021 29th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)  
We propose two algorithms: one based on a greedy approach and the other based on modified minimum cost flows. We evaluate our proposal using synthetic and real-life application traces.  ...  To this end, we solve an optimization problem of how much data to send from each process that runs out of space to the processes that have spare capacity in order to minimize the amount of time spent blocking  ...  ACKNOWLEDGMENTS This work is supported in part by the ARAMCO Services Company and the U.S.  ... 
doi:10.1109/mascots53633.2021.9614284 fatcat:on5affhubjcxfjkxghsvwf5zay

High-Resolution Direction of Arrival Estimation of Underwater Multitargets Using Swarming Intelligence of Flower Pollination Heuristics

Nauman Ahmed, Huigang Wang, Shanshan Tu, Norah A.M. Alsaif, Muhammad Asif Zahoor Raja, Muhammad Kashif, Ammar Armghan, Yasser S. Abdalla, Wasiq Ali, Farman Ali
2022 Shock and Vibration  
The measuring parameters like robustness against noise and element quantity, estimation accuracy, computation complexity, various numbers of hydrophones, variability analysis, frequency distribution and  ...  For this purpose, particle swarm optimization (PSO), minimum variance distortion-less response (MVDR), multiple signal classification (MUSIC), and estimation of signal parameter via rotational invariance  ...  Novel complexity measure is proposed in [14] for improving permutation entropy (PE) and analyzing the time series.  ... 
doi:10.1155/2022/5876874 doaj:502c1e15898f4aef893a66caa4ec0673 fatcat:3msipifr7nem7baufvy7m2dxcq

Real-time analog global optimization with constraints: application to the direction of arrival estimation problem

T.M. Jelonek, J.P. Reilly, Q. Wu
1995 IEEE transactions on circuits and systems - 2, Analog and digital signal processing  
Even though the proposed method is applicable to a wide range of engineering problems, the real-time, global and other capabilities of this method are demonstrated speci cally with an optimization problem  ...  from array signal processing-the maximum likelihood direction of arrival estimator.  ...  Also, the nancial assistance of the following agencies are gratefully acknowledged: the Telecommunications Research Institute of Ontario (TRIO), the Natural Sciences and Engineering Research Council of  ... 
doi:10.1109/82.378037 fatcat:wasnefy53jbtlp36ggfeku2cce

Source Bearing and Steering-Vector Estimation using Partially Calibrated Arrays

Minghui Li, Yilong Lu
2009 IEEE Transactions on Aerospace and Electronic Systems  
A particle swarm optimization (PSO) algorithm is used to explore the high-dimensional problem space and find the global minimum of the cost function.  ...  The design of the PSO is a combination of the problem-independent kernel and some newly introduced problem-specific features such as search space mapping, particle velocity control, and particle position  ...  From 1984 to 1988, he was a faculty member with the Department of Electromagnetic Fields Engineering, University of Electronic Science and Technology of China, Chengdu, China.  ... 
doi:10.1109/taes.2009.5310304 fatcat:7baw4um3xzfmlnor6oln3sewpi

Comparative and analysis of evaluation of several direction of arrival estimation methods

Aya Ahkam Kamil, Marwa Moutaz Ismail, Bashar Sami Bashar
2021 TELKOMNIKA (Telecommunication Computing Electronics and Control)  
entropies, and min-norm, root-MUSIC, and estimation of signal parameters via rotational invariance technique (ESPRIT). in this paper reduces the number of antennas and snaps necessary to observe six target  ...  Modern-day, global, and clever array systems have several distinguished approaches with regard to a wireless device.  ...  The best algorithm is the one that required the minimum number of antennas and snapshots to see the spaced sources.  ... 
doi:10.12928/telkomnika.v19i5.18744 fatcat:wgvjoxwzq5fepevyxbbumqn56q

Robust ML wideband beamforming in reverberant fields

E.D. Di Claudio, R. Parisi
2003 IEEE Transactions on Signal Processing  
It is shown that ML beamforming can alleviate the typical cancellation problems encountered by adaptive MV beamforming and preserve the intelligibility of a wideband and colored source signal under interference  ...  In this paper, a steered wideband adaptive beamformer, optimized by a novel concentrated maximum likelihood (ML) criterion in the frequency domain, is presented and discussed in the light of a very general  ...  ACKNOWLEDGMENT The authors thank the NATO SACLANT Centre, La Spezia, Italy, for publishing the array data employed for experiment B.  ... 
doi:10.1109/tsp.2002.806866 fatcat:fjnelybhavftxbzgx3fp2no3fu
« Previous Showing results 1 — 15 out of 48,762 results