I.A. Sarbu-Pop, T. Benedek, I. Kovács, M. Struczuy, S. Madaras, M. Chițu, G. Kozma, C. Matei, D. Horga, I. Benedek
Aim: In a period of 4 years we created a regional registry on acute coronary syndromes on a target population of 1 million inhabitants, and we followed the evolution of all patients with acute coronary syndromes (ACS). During this period we performed an intense educational activity in order to increase the adherence to European guidelines regarding the treatment of ACS. Material and method: The registry included 10 hospitals in 2004 and 13 hospitals in the following years, serving a population of 1 million inhabitants. Data regarding clinical presentation, risk factors, therapy and evolution were collected, centralized and processed in the clinic of cardiology of Targu Murescedil. Results: The registry included a number of 3455 patients with ACS, from which 1457 acute myocardial infarction (AMI) and 1998 unstable angina (UA). Mortality rates in AMI in the territorial hospitals was: 19,8% in 2004 which decreased to 11.04% in 2007, in parallel with an increase in the number of cases sent to interventional center (from 20% in 2004 to 28.51% in 2007). Conclusions: After the experience in running a registry on ACS, we conclude that we succeeded to decrease the mortality rates in AMI by increasing the adherence to European guidelines and by increasing the rates of patients sent to interventional center.
{"title":"Regional Networking for Decreasing Mortality in Acute Coronary Syndromes on a Target Population of 1 Million Inhabitants","authors":"I.A. Sarbu-Pop, T. Benedek, I. Kovács, M. Struczuy, S. Madaras, M. Chițu, G. Kozma, C. Matei, D. Horga, I. Benedek","doi":"10.1109/CANS.2008.33","DOIUrl":"https://doi.org/10.1109/CANS.2008.33","url":null,"abstract":"Aim: In a period of 4 years we created a regional registry on acute coronary syndromes on a target population of 1 million inhabitants, and we followed the evolution of all patients with acute coronary syndromes (ACS). During this period we performed an intense educational activity in order to increase the adherence to European guidelines regarding the treatment of ACS. Material and method: The registry included 10 hospitals in 2004 and 13 hospitals in the following years, serving a population of 1 million inhabitants. Data regarding clinical presentation, risk factors, therapy and evolution were collected, centralized and processed in the clinic of cardiology of Targu Murescedil. Results: The registry included a number of 3455 patients with ACS, from which 1457 acute myocardial infarction (AMI) and 1998 unstable angina (UA). Mortality rates in AMI in the territorial hospitals was: 19,8% in 2004 which decreased to 11.04% in 2007, in parallel with an increase in the number of cases sent to interventional center (from 20% in 2004 to 28.51% in 2007). Conclusions: After the experience in running a registry on ACS, we conclude that we succeeded to decrease the mortality rates in AMI by increasing the adherence to European guidelines and by increasing the rates of patients sent to interventional center.","PeriodicalId":50026,"journal":{"name":"Journal of Systems Science & Complexity","volume":"19 1","pages":"216-224"},"PeriodicalIF":2.1,"publicationDate":"2008-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90070188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents a method to determinate a desired trajectory for the manipulated object by the 6-PGK parallel robot, with an imposed velocity, when some vibration motions act in the prismatic motor joints. By using the Lagrangian approach the dynamic equations of motion of the parallel robot were deduced. The supplementary generalized forces that must be introduced in system to correct the trajectory errors have been computed from these equations.
{"title":"Trajectory Errors of the 6-PGK Parallel Robot","authors":"L. Moldovan","doi":"10.1109/CANS.2008.11","DOIUrl":"https://doi.org/10.1109/CANS.2008.11","url":null,"abstract":"This paper presents a method to determinate a desired trajectory for the manipulated object by the 6-PGK parallel robot, with an imposed velocity, when some vibration motions act in the prismatic motor joints. By using the Lagrangian approach the dynamic equations of motion of the parallel robot were deduced. The supplementary generalized forces that must be introduced in system to correct the trajectory errors have been computed from these equations.","PeriodicalId":50026,"journal":{"name":"Journal of Systems Science & Complexity","volume":"64 1","pages":"31-37"},"PeriodicalIF":2.1,"publicationDate":"2008-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89075071","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we propose an information-theoretic approach to discriminate graph classes structurally. For this, we use a measure for determining the structural information content of graphs. This complexity measure is based on a special information functional that quantifies certain structural information of a graph. To demonstrate that the complexity measure captures structural information meaningfully, we interpret some numerical results.
{"title":"Network Classes and Graph Complexity Measures","authors":"M. Dehmer, Stephan Borgert, F. Emmert-Streib","doi":"10.1109/CANS.2008.17","DOIUrl":"https://doi.org/10.1109/CANS.2008.17","url":null,"abstract":"In this paper, we propose an information-theoretic approach to discriminate graph classes structurally. For this, we use a measure for determining the structural information content of graphs. This complexity measure is based on a special information functional that quantifies certain structural information of a graph. To demonstrate that the complexity measure captures structural information meaningfully, we interpret some numerical results.","PeriodicalId":50026,"journal":{"name":"Journal of Systems Science & Complexity","volume":"52 1","pages":"77-84"},"PeriodicalIF":2.1,"publicationDate":"2008-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86224013","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Recent research in BCI focuses not only on developing a new communication channel for severely handicapped people but also on applications for rehabilitation, multimedia, communication, virtual reality, entertainment and relaxation. Most of them fall in the domain of human-computer interfaces (HCIs) designed for interaction between brain, eyes, body and computer or robot. For brain signal acquisition several technologies have been applied, for example electroencephalography (EEG), magneto encephalography (MEG), functional magnetic resonance imaging (fMRI) and near infrared spectroscopy (NIRS). Portability and cost effectiveness problems channeled BCI systems to exploit EEG signals mostly. This paper presents a methodology and recommended parameter setting, for representation in time-frequency scale of EEG signals. It refines the detection of event-related changes in the signals, revealing specific patterns of rhythms, for actual and intended physical movement. The result shows that, with well defined window length it is possible to improve localization of specific frequencies within the brain activity. This lead to the fact that actual muscle activity form could be identified from EEG signals. Using the referenced methodology a wide range of HCIs systems can be designed to perform specific tasks for the benefit of the end-user.
{"title":"Specific Movement Detection in EEG Signal Using Time-Frequency Analysis","authors":"H. Piroska, S. Janos","doi":"10.1109/CANS.2008.32","DOIUrl":"https://doi.org/10.1109/CANS.2008.32","url":null,"abstract":"Recent research in BCI focuses not only on developing a new communication channel for severely handicapped people but also on applications for rehabilitation, multimedia, communication, virtual reality, entertainment and relaxation. Most of them fall in the domain of human-computer interfaces (HCIs) designed for interaction between brain, eyes, body and computer or robot. For brain signal acquisition several technologies have been applied, for example electroencephalography (EEG), magneto encephalography (MEG), functional magnetic resonance imaging (fMRI) and near infrared spectroscopy (NIRS). Portability and cost effectiveness problems channeled BCI systems to exploit EEG signals mostly. This paper presents a methodology and recommended parameter setting, for representation in time-frequency scale of EEG signals. It refines the detection of event-related changes in the signals, revealing specific patterns of rhythms, for actual and intended physical movement. The result shows that, with well defined window length it is possible to improve localization of specific frequencies within the brain activity. This lead to the fact that actual muscle activity form could be identified from EEG signals. Using the referenced methodology a wide range of HCIs systems can be designed to perform specific tasks for the benefit of the end-user.","PeriodicalId":50026,"journal":{"name":"Journal of Systems Science & Complexity","volume":"166 1","pages":"209-215"},"PeriodicalIF":2.1,"publicationDate":"2008-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80486637","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In the recycling process of the Waste Electrical and Electronic Equipment (WEEE) the disassembly process has a central role. Disassembly is not the reverse of the assembly process, real difficulties occur in the tasks assignment process of the disassembly operations. Since this is a multi objective optimization problem, we prove that genetic algorithms provide a useful multi-criteria decision tool in the industrial disassembly process.
{"title":"Genetic Algorithms: A Decision Tool in Industrial Disassembly","authors":"L. Duta, F. Filip, C. Zamfirescu","doi":"10.1109/CANS.2008.14","DOIUrl":"https://doi.org/10.1109/CANS.2008.14","url":null,"abstract":"In the recycling process of the Waste Electrical and Electronic Equipment (WEEE) the disassembly process has a central role. Disassembly is not the reverse of the assembly process, real difficulties occur in the tasks assignment process of the disassembly operations. Since this is a multi objective optimization problem, we prove that genetic algorithms provide a useful multi-criteria decision tool in the industrial disassembly process.","PeriodicalId":50026,"journal":{"name":"Journal of Systems Science & Complexity","volume":"1 1","pages":"55-61"},"PeriodicalIF":2.1,"publicationDate":"2008-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77579468","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
New supramolecular systems have been assembled with the use of bridging unities such as tetrapyridylporphyrins, porphyrazines and polypyrazines. The assembly involves the orientation of the pi-conjugated rings, which are kept together by means of strong hydrophobic intermolecular interactions, as well as by the electrostatic interactions between the peripheral cationic and anionic residues. The porphyrins and ruthenium polypyridines are two classes of compounds exhibiting most of the above mentioned molecular properties. In the present study new cationic porphyrin as tetraruthenium (bipyridine)porphyrin (4+)(TRPyP) was synthesized and its association with anionic porphyrin (TSPP) forming heteroaggregates, is investigated. Potential applications in photodynamic therapy of cancer are discussed.
{"title":"Supramolecular Assemblies of Functional Nanoporphyrins in Therapeutics","authors":"R. Ion, S. Dreve","doi":"10.1109/CANS.2008.29","DOIUrl":"https://doi.org/10.1109/CANS.2008.29","url":null,"abstract":"New supramolecular systems have been assembled with the use of bridging unities such as tetrapyridylporphyrins, porphyrazines and polypyrazines. The assembly involves the orientation of the pi-conjugated rings, which are kept together by means of strong hydrophobic intermolecular interactions, as well as by the electrostatic interactions between the peripheral cationic and anionic residues. The porphyrins and ruthenium polypyridines are two classes of compounds exhibiting most of the above mentioned molecular properties. In the present study new cationic porphyrin as tetraruthenium (bipyridine)porphyrin (4+)(TRPyP) was synthesized and its association with anionic porphyrin (TSPP) forming heteroaggregates, is investigated. Potential applications in photodynamic therapy of cancer are discussed.","PeriodicalId":50026,"journal":{"name":"Journal of Systems Science & Complexity","volume":"78 1","pages":"191-196"},"PeriodicalIF":2.1,"publicationDate":"2008-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76292200","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
V. Prejmerean, M. Frentiu, V. Cioban, Ovidiu Ghiran
The pandemic spreading of a disease may be influenced in many ways. This paper focuses on simulation of the pandemic influenza and the graphical representation on the maps. For this reason we need to build maps by stitching the counties that contain cities and localities, the encoding of these elements using different colours on the map, the generation of the neighbour relationship, and finally the simulation.
{"title":"Graphical Representation of the Pandemic Spreading","authors":"V. Prejmerean, M. Frentiu, V. Cioban, Ovidiu Ghiran","doi":"10.1109/CANS.2008.30","DOIUrl":"https://doi.org/10.1109/CANS.2008.30","url":null,"abstract":"The pandemic spreading of a disease may be influenced in many ways. This paper focuses on simulation of the pandemic influenza and the graphical representation on the maps. For this reason we need to build maps by stitching the counties that contain cities and localities, the encoding of these elements using different colours on the map, the generation of the neighbour relationship, and finally the simulation.","PeriodicalId":50026,"journal":{"name":"Journal of Systems Science & Complexity","volume":"37 1","pages":"197-202"},"PeriodicalIF":2.1,"publicationDate":"2008-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89257822","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
JPEG is a popular DCT-based still image compression standard, which has played an important role in image storage and transmission since its development. Several papers have been published to improve the performance of JPEG. Advanced image coding (AIC) combines intra frame block prediction from H.264 with a JPEG-style DCT, followed by context adaptive binary arithmetic coding (CABAC) used in H.264. It performs much better than JPEG and close to JPEG-2000. In this paper, we propose a modified AIC (M-AIC) by replacing the CABAC in AIC with a Huffman coder and an adaptive arithmetic coder. The simulation results demonstrate that M-AIC performs much better than JPEG, close to JPEG-2000 and AIC, and a little bit better than AIC in some low bit rate range.
{"title":"Modified Advanced Image Coding","authors":"Zhengbing Zhang, R. Veerla, K. Rao","doi":"10.1109/CANS.2008.21","DOIUrl":"https://doi.org/10.1109/CANS.2008.21","url":null,"abstract":"JPEG is a popular DCT-based still image compression standard, which has played an important role in image storage and transmission since its development. Several papers have been published to improve the performance of JPEG. Advanced image coding (AIC) combines intra frame block prediction from H.264 with a JPEG-style DCT, followed by context adaptive binary arithmetic coding (CABAC) used in H.264. It performs much better than JPEG and close to JPEG-2000. In this paper, we propose a modified AIC (M-AIC) by replacing the CABAC in AIC with a Huffman coder and an adaptive arithmetic coder. The simulation results demonstrate that M-AIC performs much better than JPEG, close to JPEG-2000 and AIC, and a little bit better than AIC in some low bit rate range.","PeriodicalId":50026,"journal":{"name":"Journal of Systems Science & Complexity","volume":"9 1","pages":"110-116"},"PeriodicalIF":2.1,"publicationDate":"2008-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84570465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Clinical decision support systems form a significant part of the field of clinical knowledge management technologies, being interactive computer programs, which are designed to assist physicians and other health professionals with decision making tasks. Nowadays, agent oriented techniques are important new means in analyzing, designing and building complex software systems. We propose in this paper an intelligent multiagent system, named IMASC, for assisting physicians in their decision making tasks. We have implemented the proposed system for assisting physicians in diagnosing the heart disease. The performance of our system and comparisons with other similar approaches are also reported.
{"title":"IMASC - An Intelligent MultiAgent System for Clinical Decision Support","authors":"G. Czibula, I. Czibula, G. Cojocar, A. Guran","doi":"10.1109/CANS.2008.28","DOIUrl":"https://doi.org/10.1109/CANS.2008.28","url":null,"abstract":"Clinical decision support systems form a significant part of the field of clinical knowledge management technologies, being interactive computer programs, which are designed to assist physicians and other health professionals with decision making tasks. Nowadays, agent oriented techniques are important new means in analyzing, designing and building complex software systems. We propose in this paper an intelligent multiagent system, named IMASC, for assisting physicians in their decision making tasks. We have implemented the proposed system for assisting physicians in diagnosing the heart disease. The performance of our system and comparisons with other similar approaches are also reported.","PeriodicalId":50026,"journal":{"name":"Journal of Systems Science & Complexity","volume":"85 1","pages":"185-190"},"PeriodicalIF":2.1,"publicationDate":"2008-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84085152","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
RC4 is one of the most widely used stream cipher. It is fairly simple and efficient, and is used, among other things, in WEP, TKIP and SSL/TLS protocols. Fluhrer, Mantin and Shamir show that RC4 is completely insecure in the WEP mode of operation, and most of the discovered weaknesses are related to the key-scheduling algorithm (KSA) part of RC4. Crainicu and Boian propose a new variant of key-scheduling algoritm, called KSAm, whose primary goal is to address the Fluhrer-Mantin-Shamir (FMS) weakness of WEP-like cryptosystems, where IV (initialization vector) precedes the secret key. Cryptanalysis of KSAm reveals that the FMS IV weakness is removed by destroying the FMS resolved condition. This paper summarizes the previous security analyses of KSAm, examines KSAm in the WEP mode of operation, where IV follows the secret key, and discusses new security aspects like the effect of other FMS weak keys and Roos weak keys on KSAm and the randomness of the state tablepsila first entries after KSAm completion.
{"title":"Cryptanalysis of KSAm-like Algorithms","authors":"Bogdan Crainicu, B. Iantovics","doi":"10.1109/CANS.2008.24","DOIUrl":"https://doi.org/10.1109/CANS.2008.24","url":null,"abstract":"RC4 is one of the most widely used stream cipher. It is fairly simple and efficient, and is used, among other things, in WEP, TKIP and SSL/TLS protocols. Fluhrer, Mantin and Shamir show that RC4 is completely insecure in the WEP mode of operation, and most of the discovered weaknesses are related to the key-scheduling algorithm (KSA) part of RC4. Crainicu and Boian propose a new variant of key-scheduling algoritm, called KSAm, whose primary goal is to address the Fluhrer-Mantin-Shamir (FMS) weakness of WEP-like cryptosystems, where IV (initialization vector) precedes the secret key. Cryptanalysis of KSAm reveals that the FMS IV weakness is removed by destroying the FMS resolved condition. This paper summarizes the previous security analyses of KSAm, examines KSAm in the WEP mode of operation, where IV follows the secret key, and discusses new security aspects like the effect of other FMS weak keys and Roos weak keys on KSAm and the randomness of the state tablepsila first entries after KSAm completion.","PeriodicalId":50026,"journal":{"name":"Journal of Systems Science & Complexity","volume":"28 1","pages":"130-148"},"PeriodicalIF":2.1,"publicationDate":"2008-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87268715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：