Multisecret-sharing schemes and bounded distance decoding of linear codes

Error-correcting codes are used to correct errors when messages are transmitted through a noisy communication channel. Bounded distance decoding (i.e. decoding up to the error-correcting capacity) is a method of correcting errors that guarantees unique decoding. Secret sharing is a cryptographic protocol that allows a secret known from a person called the dealer to be distributed to n participants. No single participant knows the secret but some special subsets of participants called coalitions can. In this paper, we present a multisecret-sharing scheme based on an error-correcting code where secret reconstruction is made by using bounded distance decoding of the code. This scheme is ideal in the sense that the size of each secret equals the size of any share. Its security improves on that of multisecret-sharing schemes.     

Synthesis of Quaternary,Long-Chain N-Alkyl Amides and Their Corrosion Inhibition in Acidic Media

New cationic surfactants were synthesized by the quaternization of a number of straight-chain amide derivatives with triethylamine or pyridine. The corrosion inhibition tests of the surface-active compounds were performed at room temperature for 24 h on carbon steel coupons in acidic media using the gravimetric method. The acidic media used were 1.5 M HCl and 1.5 M H₂SO₄. Almost all of the synthesized cationic surfactants showed efficient inhibition of corrosion in the test. To establish the inhibition efficiencies of the inhibitors, surface characterization studies (contact angle measurements, SEM analysis and optical profilometer images) of the metal coupons used were performed.     

Flow time analyses of a simulated flexible job shop by considering jockeying

It has been essential to include flexibility in manufacturing policy making since variability in demand and products are considerably increasing. However, it is important to know and to monitor the proper level and type of flexibility that is required to obtain full benefits from it. This paper analyses the effects of flexibility on flow time performance of a simulated job shop. For that purpose, several scenarios are developed under four flexibility levels with two different machine selection rule and three types of dispatching rules. Furthermore, effect of jockeying as a queuing policy on the flow time performance is also investigated through simulation modeling. Results indicated that full flexibility is a preferable state for most of the cases. However, in some cases, chain configurations perform similar results since it combines the benefits of pooling and specialization. In addition, it is observed that a queue control mechanism like jockeying is an effective way to improve performance even though it may increase complexity of controlling policy.