The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
To improve the adaptability and stability of Dijkstra algorithm for solving routing problem of service composition, a method to solve routing problem of service composition based on an improved ant colony algorithm is proposed. Firstly, based on the traditional ant colony algorithm, the constraints of it are improved. Secondly, a problem solving model for improved ant colony algorithm is established,...
Background subtraction is a traditional method for detecting objects in stationary background. However, this traditional method is difficult to detect objects accurately in the real world, because the background is usually cluttered and not completely static. In this paper, we propose an object detection approach using Ant Colony System (ACS) in a MAP-MRF framework. For object segmentation, a MAP-MRF...
Environmental impact assessment has an important influence on project decision. Based on the fuzzy matter element theory and information entropy theory, entropy fuzzy matter-element model has been established, which is used to evaluate the good or bad of schemes. Taking scheme selection of highway as an example, the evaluation results show that the model can effectively eliminate the impact of man-made...
This paper proposes an intelligent control method by applying the heating rate method to measure the instant heat of solar collector, and thus solve a difficult problem in solar energy collecting control. We analyzed the advantages and disadvantages of the differential temperature control method and total heat energy control method through heat-collecting control by Diaphragm-type solar collector...
The constraints to manage in a telecom splitter design are numerous and according to a given splitter structure, the choice became difficult. The paper proposes a software tool allowing the design of such filters. This one carries out the modelling of the electrical circuit configurations, and creates the corresponding computation code, used for simulation or optimisation. The methodology is detailed...
We say an algorithm on n × n matrices with entries in [-M, M] (or n-node graphs with edge weights from [-M, M]) is truly subcubic if it runs in O(n3-δ - poly(log M)) time for some δ > 0. We define a notion of subcubic reducibility, and show that many important problems on graphs and matrices solvable in O(n3) time are equivalent under subcubic reductions. Namely, the following weighted problems...
Reliability and/or availability are increasingly important aspects in the design of systems, especially networks and service offerings. Optimization here is a multi-criteria process finding the right compromise between cost and quality. At the same time, results should be explored online, either as part of interactive, user-centric design tools or for Web based service negotiation. In this paper we...
The successive linearization optimization, incision plane, little-step grads and two-rank linearization solution method was introduced. For a problem with two-rank objective function and constraint function, three times of solving linearization problem achieves the optimization point nearly same as extremum point by successive linearization optimization. The method has the characteristic of gradual...
This paper considers a size constrained version of the undirected feedback vertex set problem motivated by placing wavelength converters on a WDM network efficiently, and proves that this problem is NP-complete even in several special cases. Moreover, the paper presents a simple approximation algorithm for a minimization version of the problem using an algorithm for the original minimum undirected...
We give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multi-parameter problems. Specifically, we prove that every packing problem that admits an FPTAS also admits a truthful-in-expectation randomized mechanism that is an FPTAS. Our reduction makes novel use of smoothed analysis, by employing small perturbations...
For every ∈ > 0, and integer q ≥ 3, we show that given an N-vertex graph that has an induced q-colorable subgraph of size (1 - ∈)N, it is NP-hard to find an independent set of size N/q2.
We present a Monte Carlo algorithm for Hamiltonicity detection in an n-vertex undirected graph running in O* (1.657n) time. To the best of our knowledge, this is the first superpolynomial improvement on the worst case runtime for the problem since the O*(2n) bound established for TSP almost fifty years ago (Bellman 1962, Held and Karp 1962). It answers in part the first open problem in Woeginger's...
This research gives a new improvement scheme of Lorenz signal based on chaotic masking secure communication, which improves the notable features of Lorenz signal and the confidentiality of transmission signal in channel. The scheme here mainly changes the properties of chaotic signal in both time and frequency domains, which makes the masking signal in channel more like noise. This paper also does...
This paper addresses a new uncertainty set - interval random uncertainty set for robust Value-at-Risk optimization. The form of interval random uncertainty set makes it suitable for capturing the downside and upside deviations of real-world data. These deviation measures capture distributional asymmetry and lead to better optimization results. We also apply our interval random chance-constrained programming...
Wireless Sensor Networks(WSN) is a hot spot of the research of wireless networks currently, the key of achieving efficient transmission business is to control node energy and improve the network lifetime in wireless sensor networks. The paper first uses Boolean sensing model based on Poisson point process to identify the function of the rate of coverage and the node density in unit area, and then...
Adjustment and optimization of applications is an important stage throughout the software life cycle. Based on the database system coming into running applications, SQL statements on the optimization algorithms and improving the application efficiency have become an important goal. In this paper, based on the ORACLE database management system and the optimization goals, the methods and techniques...
This paper presents a methodology to design and to optimize inductive power link for biomedical applications. The importance of the operation frequency on the application is expressed. A model of inductive link is presented. The dimensions of the coils are compatible with the size of a mouse and the mouse cage. The simulation results are in good agreement with the analysis.
We give sub linear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclosing balls. Our algorithms can be extended to some kernelized versions of these problems, such as SVDD, hard margin SVM, and L2-SVM, for which sub linear-time algorithms were not known before. These new algorithms use a combination...
It has been shown by Indyk and Sidiropoulos that any graph of genus g > 0 can be stochastically embedded into a distribution over planar graphs with distortion 2O(g). This bound was later improved to O(g2) by Borradaile, Lee and Sidiropoulos. We give an embedding with distortion O(log g), which is asymptotically optimal. Apart from the improved distortion, another advantage of our embedding is...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.