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.
This communication aims to associate the product configuration task with the planning of its production process in order to make consistent decisions while trying to minimize cost and cycle time. A two step approach is described with relevant aiding tools. During the first one, configuration and planning are considered as two constraint satisfaction problems and are interactively assisted by constraint...
In the domain of planning, searching for optimal plans gives rise to many works. Most of the existing planners search for optimal parallel plans, that is plans which are optimal in the number of steps. FDP is an exception: it searches for optimal sequential plans, that is plans which are optimal in the number of actions. FDP implements a depth-first iterative-deepening search, using a CSP-like structure,...
The weighted constraint satisfaction problem (WCSP) is a popular formalism for encoding instances of hard optimization problems. The common approach to solving WCSP is branch-and-bound (BB), whose efficiency strongly depends on the method of computing a lower bound (LB) associated with the current node of the search tree. Two of the most important approaches for computing LB include (1) using local...
Distributed denial of service (DDoS) attacks are today the most destabilizing factor in the global internet and there is a strong need for sophisticated solutions. We introduce a formal statistical framework and derive a Bayes optimal packet classifier from it. Our proposed practical algorithm "adaptive history-based IP filtering" (AHIF) mitigates DDoS attacks near the victim and outperforms...
Filtering data transmitted over the Internet into a company's network for viruses, Trojans, worms and spam is an important part of a security concept to protect the local network from being taken over by attackers. Those filters are either implemented on the client, on a local network server or on a proxy system, depending on how the respective data is transmitted over the network. Where mail and...
A soft version of the well-known global constraint AllDifferent has been recently introduced for the Max-CSP framework ([9, 15, 16]). In this paper, we propose to soften AllDifferent in the Weighted CSP framework that is more general. We extend the two semantics of violation proposed in [9]: the first one is based on variables and the second one on the decomposition into a set of binary constraints...
A novel packet marking scheme Is proposed to defend against network or bandwidth DDoS attacks, especially where malicious packets do not target the victim directly. A recent study shows that packet-level symmetry exists in legitimate Internet traffic while malicious flooding traffic often exhibits packet asymmetry. Our scheme utilizes the packet asymmetry to differentiate malicious and legitimate...
An analog multiplexer which allows several data channels to share the available bandwidth of one channel of an analog tape recorder is described. The method involves demodulation by correlating with a separately recorded carrier. Inexpensive integrated circuits are the only active elements.
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.