检索结果-内蒙古大学图书馆

Positive role of glassy dynamics in finite-time optimization by threshold algorithms

COMPUTER PHYSICS COMMUNICATIONS 2011年第1期182卷 229-231页

作者： Hasegawa, M. Univ Tsukuba Grad Sch Syst & Informat Engn Tsukuba Ibaraki 3058573 Japan

The optimization mechanism of threshold algorithms is investigated in the solving process of a random Euclidean traveling salesman problem A series of computer experiments previously designed for simulated annealing is conducted with algorithms such as generalized simulated annealing The results show that if the threshold function decays fast enough a previous positive view of slow relaxation dynamics in finite-time optimization by simulated annealing is still applicable regardless of the algorithm These dynamics work effectively as an optimizer at around an intermediate temperature which can be identified by using the Deborah number (C) 2010 Elsevier B V All rights reserved

关键词： Optimization threshold algorithms Relaxation Glass Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Development of threshold algorithms for a Location Problem with Elastic Demand 11th

Development of Threshold Algorithms for a Location Problem w...

引用

11th International Conference on Large-Scale Scientific Computations (LSSC)

作者： Levanova, Tatyana Gnusarev, Alexander Sobolev Inst Math Omsk Branch Pevtsova Str 13 Omsk 644043 Russia Dostoevsky Omsk State Univ Prospekt Mira 55A Omsk 644077 Russia

ISBN: (纸本)9783319734415;9783319734408

This work is devoted to development of threshold algorithms for one static probabilistic competitive facility location and design problem in the following formulation. New Company plans to enter the market and to locate new facilities with different design scenarios. Clients of each point choose to use the facilities of Company or its competitors depending on their attractiveness and distance. The aim of the new Company is to capture the greatest number of customers thus serving the largest share of the demand. This share for the Company is elastic and depends on clients' decisions. We offer three types of threshold algorithms: Simulated annealing, threshold improvement and Iterative improvement. Experimental tuning of parameters of algorithms was carried out. A comparative analysis of the algorithms, depending on the nature and value of the threshold on special test examples up to 300 locations is carried out. The results of numerical experiments are discussed.

关键词： Discrete optimization Integer programming Location problems threshold algorithms Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Static threshold visual field in glaucoma with the Fastpac(TM) algorithm of the Humphrey Field Analyser. Is the gain in examination time offset by any loss of information?

引用

European Journal of Ophthalmology 1994年第2期4卷 105-110页

作者： Nordmann, J.P. Denis, P. Nguer, Y. Mouton-Chopin, D. Saraux, H. Department of Ophthalmology Hopital Tenon F-75020 Paris 4 rue de la Chine France

A new algorithm (Fastpac(TM)) has been designed to speed up full threshold tests with the Humphrey Field Analyser. We studied the utility of this algorithm by comparing central 24-2 threshold programs obtained with standard and Fastpac(TM) algorithms in 43 hypertensive or glaucomatous eyes. The Fastpac(TM) reduced testing time by 35% to 45%. In glaucomatous eyes, the time spared was inversely correlated with the degree of visual field impairment. Global indices were used to compare visual fields. Mean absolute differences in indices did not exceed 0.98 dB. Correlations between indices in glaucoma patients with standard and Fastpac(TM) strategy were respectively 0.99 and 0.98 for mean deviation and pattern standard deviation. The intra- test variability (short-term fluctuation) was slightly higher with Fastpac(TM) with a lower correlation between algorithms (r=0.62). The use of Fastpac(TM) achieves a mean time reduction of 40% and does not significantly modify global indices obtained with the Humphrey perimeter in hypertensive and glaucomatous eyes.

关键词： Automated perimetry Fastpac Glaucoma Global indices Humphrey Field Analyser Ocular hypertension threshold algorithms

来源：评论

学校读者我要写书评

暂无评论

Metaheuristics: A bibliography

引用

ANNALS OF OPERATIONS RESEARCH 1996年第5期63卷 513-623页

作者： Osman, IH Laporte, G UNIV KENT INST MATH & STATCANTERBURY CT2 7NFKENTENGLAND UNIV MONTREAL CTR RECH TRANSPORTSMONTREALPQ H3C 3J7CANADA

Metaheuristics are the most exciting development in approximate optimization techniques of the last two decades. They have had widespread successes in attacking a variety of difficult combinatorial optimization problems that arise in many, practical areas. This bibliography provides a classification of a comprehensive list of 1380 references on the theory and application of metaheuristics. Metaheuristics include but are not limited to constraint logic programming;greedy random adaptive search procedures;natural evolutionary computation;neural networks;non-monotonic search strategies;space-search methods;simulated annealing;tabu search;threshold algorithms and their hybrids. References are presented in alphabetical order under a number of subheadings.

关键词： artificial intelligence bibliography combinatorial optimization constraint logic programming evolutionary computation genetic algorithms greedy random adaptive search procedure heuristics hybrids local search metaheuristics neural networks non-monotonic search strategies problem-space method simulated annealing tabu search threshold algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimal Matching for Observational Studies That Integrate Quantitative and Qualitative Research

引用

STATISTICS AND PUBLIC POLICY 2021年第1期8卷 42-52页

作者： Yu, Ruoqi Small, Dylan S. Harding, David Aveldanes, Jose Rosenbaum, Paul R. Univ Penn Wharton Sch Philadelphia PA 19104 USA Univ Calif Berkeley Dept Sociol Berkeley CA 94720 USA

A quantitative study of treatment effects may form many matched pairs of a treated subject and an untreated control who look similar in terms of covariates measured prior to treatment. When treatments are not randomly assigned, one inevitable concern is that individuals who look similar in measured covariates may be dissimilar in unmeasured covariates. Another concern is that quantitative measures may be misinterpreted by investigators in the absence of context that is not recorded in quantitative data. When text information is automatically coded to form quantitative measures, examination of the narrative context can reveal the limitations of initial coding efforts. An existing proposal entails a narrative description of a subset of matched pairs, hoping in a subset of pairs to observe quite a bit more of what was not quantitatively measured or automatically encoded. A subset of pairs cannot rule out subtle biases that materially affect analyses of many pairs, but perhaps a subset of pairs can inform discussion of such biases, perhaps leading to a reinterpretation of quantitative data, or perhaps raising new considerations and perspectives. The large literature on qualitative research contends that open-ended, narrative descriptions of a subset of people can be informative. Here, we discuss and apply a form of optimal matching that supports such an integrated, quantitative-plus-qualitative study. The optimal match provides many closely matched pairs plus a subset of exceptionally close pairs suitable for narrative interpretation. We illustrate the matching technique using data from a recentstudy of police responses to domestic violence in Philadelphia, where the police report includes both quantitative and narrative information.

关键词： Causal inference Narrative description Optimal matching threshold algorithms

来源：评论

学校读者我要写书评

暂无评论

Network-aware Search in Social Tagging Applications: Instance Optimality versus Efficiency 13

Network-aware Search in Social Tagging Applications: Instanc...

引用

22nd ACM International Conference on Information and Knowledge Management (CIKM)

作者： Maniu, Silviu Cautis, Bogdan Univ Hong Kong Dept Comp Sci Pokfulam Rd Hong Kong Peoples R China Univ Paris Sud F-91405 Orsay France INRIA Saclay F-91405 Orsay France

ISBN: (纸本)9781450322638

We consider in this paper top-k query answering in social applications, with a focus on social tagging. This problem requires a significant departure from socially agnostic techniques. In a network-aware context, one can (and should) exploit the social links, which can indicate how users relate to the seeker and how much weight their tagging actions should have in the result build-up. We propose algorithms that have the potential to scale to current applications. While the problem has already been considered in previous literature, this was done either under strong simplifying assumptions or under choices that cannot scale to even moderate-size real-world applications. We first revisit a key aspect of the problem, which is accessing the closest or most relevant users for a given seeker. We describe how this can be done on the fly (without any precomputations) for several possible choices - arguably the most natural ones - of proximity computation in a user network. Based on this, our top-k algorithm is sound and complete, addressing the applicability issues of the existing ones. Moreover, it performs significantly better in general and is instance optimal in the case when the search relies exclusively on the social weight of tagging actions. To further address the efficiency needs of online applications, for which the exact search, albeit optimal, may still be expensive, we then consider approximate algorithms. Specifically, these rely on concise statistics about the social network or on approximate shortest-paths computations. Extensive experiments on real-world data from Twitter show that our techniques can drastically improve response time, without sacrificing precision.

关键词： social applications social search threshold algorithms

来源：评论

学校读者我要写书评

暂无评论

An EEG-Controlled Wheelchair Using Eye Movements 5

An EEG-Controlled Wheelchair Using Eye Movements

引用

5th International Conference on the Development of Biomedical Engineering in Vietnam

作者： Tran, Hue T. Nguyen, Hai T. Phan, Hieu V. Toi, V. Van Ngo, Thuyen V. Cao Bui-Thu Int Univ VNU HCMC Dept Biomed Engn Seoul South Korea UTE HCMC Fac Elect Elect Engn Hanoi Vietnam Ind Univ Ho Chi Minh City Dept Elect Technol Ho Chi Minh City Vietnam

ISBN: (纸本)9783319117768;9783319117751

This paper proposes a threshold algorithm to extract features and then create standard thresholds of EEG online signals using eye movements. Based on the standard thresholds, an electrical wheelchair can be controlled to reach the desired target. In this project, a Hamming band-pass filter is applied to detect noise of EEG signal. Moreover, calculation of blink-times and detection of confusion between left glance and right glance signals program are built and added to increase the accuracy of the wheelchair control. Additionally, a quality testing program is also built in Labview environment to improve effort of data collection. Finally, experimental results of controlling the electrical wheelchair in indoor environments demonstrated the effectiveness of the proposed method.

关键词： threshold algorithms EEG technology Eye movements Electric wheelchair

来源：评论

学校读者我要写书评

暂无评论

Application of Change Point Outlier Detection Methods in Real Time Intrusion Detection

Application of Change Point Outlier Detection Methods in Rea...

引用

International Conference on Advanced Computer Science Applications and Technologies (ACSAT)

作者： Naveen, N. C. Natarajan, S. Srinivasan, R. RV Coll Engn Dept ISE Bangalore Karnataka India PESIT Dept ISE Bangalore Karnataka India MSRIT Dept Comp Sci & Engn Bangalore Karnataka India

ISBN: (纸本)9780769549590;9781467358323

Recent years has shown a growing interest in the development of change detection techniques for the analysis of Intrusion Detection. Current research shows that change detection methods can be used for a wide range of real time applications. Detecting the changes by observing data collected at different times is one of the most important applications of network security because they can provide analysis of short interval on global scale. Research in exploring change detection techniques for medium/high network data can be found for the new generation of very high resolution data. The advent of new technologies has greatly increased the ability to monitor and resolve the details of changes in order to analyze better. Analyzing large amount of data is still a new challenge. The data need to be analyzed and corrected for registration and classification errors for identifying frequently changing trend. In this research paper we have proposed a unified and novel approach for Intrusion Detection System (IDS) which embeds a Change Detection Algorithm with Data Mining (DM) technique. IDS are considered as a system integrated with intelligent subsystems, which completes the distributed solution procedure on the basis of exchanging large data and information. The goal is to learn more effectively from the model. The knowledge developed automatically adjusts to the changes as well as threshold while minimizing the false alarm rate and timely detection. A hybrid approach for improving the performance of detection algorithm by building more intelligence to the system is proposed using Support Vector Machine (SVM). The results are properly substantiated for better effectiveness, system security and flexibility.

关键词： Network Intrusion Anomaly Detection Change Detection threshold algorithms Performance Evaluation Outlier Detection

来源：评论

学校读者我要写书评

暂无评论

Security of Selected Secret Sharing Schemes 11th

Security of Selected Secret Sharing Schemes

引用

11th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS)

作者： Ogiela, Urszula Takizawa, Makoto Ogiela, Lidia AGH Univ Sci & Technol Cryptog & Cognit Informat Res Grp 30 Mickiewicza Ave PL-30059 Krakow Poland Hosei Univ Dept Adv Sci 3-7-2 Kajino Cho Koganei Tokyo 1848584 Japan

ISBN: (纸本)9783319615424;9783319615417

In the paper will be described a few most important aspects connected with innovative secret sharing procedures, and also an idea of linguistic cryptography in processes of data encryption. The most important aspects are using parts of divided data to finally reconstruction them. Linguistic algorithms dedicated to securing data as well as secret sharing techniques, are also very useful to guarantee data security. Secret sharing algorithms allow to distribute information within a separate group of secret trustees. In this paper authors describe techniques of using that methods for linguistic data sharing techniques. Authors propose also captcha analysis for linguistic threshold schemes. All secret parts of data can be written by used any parts of selected captcha.

关键词： Secret sharing threshold algorithms Linguistic techniques Data security

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：