@conference {Ba{\"\i}na2020175, title = {An Efficient Lightweight Algorithm for Automatic Meters Identification and Error Management in Arabic Poetry}, booktitle = {ACM International Conference Proceeding Series}, year = {2020}, note = {cited By 1}, pages = {175-180}, abstract = {This paper targets the problem of automatic meter identification and error management in Arabic poetry. Many approaches use high level abstractions of poems in their prosodic forms: feet patterns cords and pegs forms or syllables. Our algorithm manipulates directely binary representations of meters and prosodic forms of verses with computing distances between those representations. Our algorithm does not need to handle explicitely neither the foot patterns relaxations nor defects which makes our algorithm compared to studied works simpler (i.e. no symbolic combinatory analysis rules for exception patterns) and efficient in time and memory with dynamic programming of Levenshtein distance. {\textcopyright} 2020 ACM.}, keywords = {Analysis rules, Binary representations, Computation theory, Computing distances, Dynamic programming, Error management, High-level abstraction, Intelligent systems, Levenshtein distance, Prosodic forms}, doi = {10.1145/3419604.3419781}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85096425890\&doi=10.1145\%2f3419604.3419781\&partnerID=40\&md5=3ad4b7e10bfb4c2c3394ce9963974e0d}, author = {Baina, K. and Moutassaref, H.} } @article {9434372220130201, title = {Buffer dimensioning and control stations positioning with a space partitioning-tabu search approach.}, journal = {INFOR}, volume = {51}, number = {1}, year = {2013}, pages = {15 - 22}, abstract = {We propose an efficient heuristic method based on Space Partitioning (SP) and Tabu Search (TS) to solve the buffer sizing problem in unreliable production lines with several inspection stations. In such problem, we have an unreliable production line consisting of a certain number of machines and fixed-size buffers. These machines produce a single part with two different quality levels: conforming and non-conforming parts. The production line may contain inspection stations whose job is to reject the non-conforming parts from the line. The production line must meet a constant rate of demand for the conforming finished parts. The objective is to minimize the average long term combined storage and shortage costs, while also specifying the optimal location of inspection stations. This design problem is a difficult mixed integer nonlinear program. Solving even a small instance of 10 machines and one inspection station using a direct dynamic programming method takes hours. If we especially}, keywords = {Buffer storage (Computer science), Combinatorial Optimization, Dynamic programming, Heuristic algorithms, Inspection, Machine theory, Meta-heuristics, Production lines, Quality, Tabu search algorithm, Topology}, issn = {03155986}, url = {http://search.ebscohost.com/login.aspx?direct=true\&db=bth\&AN=94343722\&site=ehost-live}, author = {Ouzineb, Mohamed and Mhada, Fatima and El Hallaoui, Issmail} }