Hill-climbing, simulated annealing and genetic algorithms: a comparative study and application to the mapping problem
[1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences
Abstract Hill-climbing, simulated annealing and genetic algorithms are search techniques that can... more Abstract Hill-climbing, simulated annealing and genetic algorithms are search techniques that can be applied to most combinatorial optimization problems. The three algorithms are used to solve the mapping problem, which is the optimal static allocation of ...
Unitary approach of watermarking and attack algorithms for audio signals
Proceedings Third International Conference on WEB Delivering of Music, Sep 29, 2003
Watermarking is a technique used to transmit hidden information by modifying an audio signal in a... more Watermarking is a technique used to transmit hidden information by modifying an audio signal in an imperceptible manner. The transmission must be possible in spite of subsequent imperceptible alterations (attacks) of the watermarked signal. We propose a unitary approach of watermarking and attack algorithms by defining them in a similar manner, using sets and set mappings. The algorithms are then
Second International Conference on Web Delivering of Music, 2002. WEDELMUSIC 2002. Proceedings.
Watermarking is a technique used to label digital media, to protect copyright ownership, by hidin... more Watermarking is a technique used to label digital media, to protect copyright ownership, by hiding information into the signal. Watermarks must be imperceptible and robust against attacks. Besides, watermark robustness against several signal processing techniques can be ensured by exploiting a technique related to the spread spectrum communications. In this paper, we propose a procedure based on frequential substitution using a BPSK modulation with an adaptive carrier frequency, the choice of which depends on the original signal features. A secret key, generated during watermarking process, is used for retrieving hidden information.
A deadlock free routing algorithm with network size independent buffering space
CONPAR 90 — VAPP IV, 1990
The purpose of this paper is to describe the theory behind a correct routing function suitable fo... more The purpose of this paper is to describe the theory behind a correct routing function suitable for parallel machines composed of networks of asynchronous processors. We propose a new deadlock free routing function which avoids the drawbacks of existing methods based on buffers ordering. The algorithm is based on a protocol which insures the correct delivery of messages at their
In this course1, we introduce basic mechanisms to support parallel programs at operating system l... more In this course1, we introduce basic mechanisms to support parallel programs at operating system level on distributed memory parallel machines. Issues about process models and communication support are developed. As parallelism requires much more support than simple concurrency in classical multitasking environments, we define a set of abstractions, including new entities suitable for exploiting parallelism. Communication support can be divided into message passing and shared data. Parallel applications have specific requirements for communication; we analyse a basic set of essential communication protocols. Lastly, we briefly discuss caracteristics of distributed operating systems.
Hill-climbing, simulated annealing and genetic algorithms: a comparative study and application to the mapping problem
[1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences
Abstract Hill-climbing, simulated annealing and genetic algorithms are search techniques that can... more Abstract Hill-climbing, simulated annealing and genetic algorithms are search techniques that can be applied to most combinatorial optimization problems. The three algorithms are used to solve the mapping problem, which is the optimal static allocation of ...
Unitary approach of watermarking and attack algorithms for audio signals
Proceedings Third International Conference on WEB Delivering of Music, Sep 29, 2003
Watermarking is a technique used to transmit hidden information by modifying an audio signal in a... more Watermarking is a technique used to transmit hidden information by modifying an audio signal in an imperceptible manner. The transmission must be possible in spite of subsequent imperceptible alterations (attacks) of the watermarked signal. We propose a unitary approach of watermarking and attack algorithms by defining them in a similar manner, using sets and set mappings. The algorithms are then
Second International Conference on Web Delivering of Music, 2002. WEDELMUSIC 2002. Proceedings.
Watermarking is a technique used to label digital media, to protect copyright ownership, by hidin... more Watermarking is a technique used to label digital media, to protect copyright ownership, by hiding information into the signal. Watermarks must be imperceptible and robust against attacks. Besides, watermark robustness against several signal processing techniques can be ensured by exploiting a technique related to the spread spectrum communications. In this paper, we propose a procedure based on frequential substitution using a BPSK modulation with an adaptive carrier frequency, the choice of which depends on the original signal features. A secret key, generated during watermarking process, is used for retrieving hidden information.
A deadlock free routing algorithm with network size independent buffering space
CONPAR 90 — VAPP IV, 1990
The purpose of this paper is to describe the theory behind a correct routing function suitable fo... more The purpose of this paper is to describe the theory behind a correct routing function suitable for parallel machines composed of networks of asynchronous processors. We propose a new deadlock free routing function which avoids the drawbacks of existing methods based on buffers ordering. The algorithm is based on a protocol which insures the correct delivery of messages at their
In this course1, we introduce basic mechanisms to support parallel programs at operating system l... more In this course1, we introduce basic mechanisms to support parallel programs at operating system level on distributed memory parallel machines. Issues about process models and communication support are developed. As parallelism requires much more support than simple concurrency in classical multitasking environments, we define a set of abstractions, including new entities suitable for exploiting parallelism. Communication support can be divided into message passing and shared data. Parallel applications have specific requirements for communication; we analyse a basic set of essential communication protocols. Lastly, we briefly discuss caracteristics of distributed operating systems.
Uploads
Papers by Traian MUNTEAN