In Chinese, dependency analysis has been shown to be a powerful syntactic parser because the order of phrases in a sentence is relatively free compared with English. Conventional dependency parsers require a number of...In Chinese, dependency analysis has been shown to be a powerful syntactic parser because the order of phrases in a sentence is relatively free compared with English. Conventional dependency parsers require a number of sophisticated rules that have to be handcrafted by linguists, and are too cumbersome to maintain. To solve the problem, a parser using SVM (Support Vector Machine) is introduced. First, a new strategy of dependency analysis is proposed. Then some chosen feature types are used for learning and for creating the modification matrix using SVM. Finally, the dependency of phrases in the sentence is generated. Experiments conducted to analyze how each type of feature affects parsing accuracy, showed that the model can increase accuracy of the dependency parser by 9.2%.展开更多
In order to obtain information or discover knowledge from system logs,the first step is to performlog parsing,whereby unstructured raw logs can be transformed into a sequence of structured events.Although comprehensiv...In order to obtain information or discover knowledge from system logs,the first step is to performlog parsing,whereby unstructured raw logs can be transformed into a sequence of structured events.Although comprehensive studies on log parsing have been conducted in recent years,most assume that one event object corresponds to a single-line message.However,in a growing number of scenarios,one event object spans multiple lines in the log,for which parsing methods toward single-line events are not applicable.In order to address this problem,this paper proposes an automated log parsing method for multiline events(LPME).LPME finds multiline event objects via iterative scanning,driven by a set of heuristic rules derived from practice.The advantage of LPME is that it proposes a cohesion-based evaluation method for multiline events and a bottom-up search approach that eliminates the process of enumerating all combinations.We analyze the algorithmic complexity of LPME and validate it on four datasets from different backgrounds.Evaluations show that the actual time complexity of LPME parsing for multiline events is close to the constant time,which enables it to handle large-scale sample inputs.On the experimental datasets,the performance of LPME achieves 1.0 for recall,and the precision is generally higher than 0.9,which demonstrates the effectiveness of the proposed LPME.展开更多
We study CFG parse tree enumeration in this paper. By dividing the set of all parse trees into infinite hierarchies according to height of parse tree, the hierarchical lexicographic order on the set of parse trees is ...We study CFG parse tree enumeration in this paper. By dividing the set of all parse trees into infinite hierarchies according to height of parse tree, the hierarchical lexicographic order on the set of parse trees is established. Then grammar-based algorithms for counting and enumerating CFG parse trees in this order are presented. To generate a parse tree of height n, the time complexity is O(n). If τ is a lowest parse tree for its yield, then O(n) =O(||τ|| + 1), where ||τ|| is the length of the sentence (yield) generated by τ. The sentence can be obtained as a by-product of the parse tree. To compute sentence from its parse tree (needn't be lowest one), the time complexity is O(node)+O(||τ|| + 1), where node is the number of non-leaf nodes of parse tree τ. To generate both a complete lowest parse tree and its yield at the same time, the time complexity is O(||τ|| + 1).展开更多
This paper proposes a tree kernel method of semantic relation detection and classification (RDC) between named entities. It resolves two critical problems in previous tree kernel methods of RDC. First, a new tree ke...This paper proposes a tree kernel method of semantic relation detection and classification (RDC) between named entities. It resolves two critical problems in previous tree kernel methods of RDC. First, a new tree kernel is presented to better capture the inherent structural information in a parse tree by enabling the standard convolution tree kernel with context-sensitiveness and approximate matching of sub-trees. Second, an enriched parse tree structure is proposed to well derive necessary structural information, e.g., proper latent annotations, from a parse tree. Evaluation on the ACE RDC corpora shows that both the new tree kernel and the enriched parse tree structure contribute significantly to RDC and our tree kernel method much outperforms the state-of-the-art ones.展开更多
This paper explores a tree kernel based method for semantic role labeling (SRL) of Chinese nominal predicates via a convolution tree kernel. In particular, a new parse tree representation structure, called dependenc...This paper explores a tree kernel based method for semantic role labeling (SRL) of Chinese nominal predicates via a convolution tree kernel. In particular, a new parse tree representation structure, called dependency-driven constituent parse tree (D-CPT), is proposed to combine the advantages of both constituent and dependence parse trees. This is achieved by directly representing various kinds of dependency relations in a CPT-style structure, which employs dependency relation types instead of phrase labels in CPT (Constituent Parse Tree). In this way, D-CPT not only keeps the dependency relationship information in the dependency parse tree (DPT) structure but also retains the basic hierarchical structure of CPT style. Moreover, several schemes are designed to extract various kinds of necessary information, such as the shortest path between the nominal predicate and the argument candidate, the support verb of the nominal predicate and the head argument modified by the argument candidate, from D-CPT. This largely reduces the noisy information inherent in D-CPT. Finally, a convolution tree kernel is employed to compute the similarity between two parse trees. Besides, we also implement a feature-based method based on D-CPT. Evaluation on Chinese NomBank corpus shows that our tree kernel based method on D-CPT performs significantly better than other tree kernel-based ones and achieves comparable performance with the state-of-the-art feature-based ones. This indicates the effectiveness of the novel D-CPT structure in representing various kinds of dependency relations in a CPT-style structure and our tree kernel based method in exploring the novel D-CPT structure. This also illustrates that the kernel-based methods are competitive and they are complementary with the feature- based methods on SRL.展开更多
Analyzing the syntactic structure of natural languages by parsing is an important task in artificial intelligence. Due to the complexity of natural languages, individual parsers tend to make different yet complementar...Analyzing the syntactic structure of natural languages by parsing is an important task in artificial intelligence. Due to the complexity of natural languages, individual parsers tend to make different yet complementary errors. We propose a neural network based approach to combine parses from different parsers to yield a more accurate parse than individual ones. Unlike conventional approaches, our method directly transforms linearized candidate parses into the ground-truth parse. Experiments on the Penn English Treebank show that the proposed method improves over a state-of-the-art parser combination approach significantly.展开更多
A log is a text message that is generated in various services,frameworks,and programs.The majority of log data mining tasks rely on log parsing as the first step,which transforms raw logs into formatted log templates....A log is a text message that is generated in various services,frameworks,and programs.The majority of log data mining tasks rely on log parsing as the first step,which transforms raw logs into formatted log templates.Existing log parsing approaches often fail to effectively handle the trade-off between parsing quality and performance.In view of this,in this paper,we present Multi-Layer Parser(ML-Parser),an online log parser that runs in a streaming manner.Specifically,we present a multi-layer structure in log parsing to strike a balance between efficiency and effectiveness.Coarse-grained tokenization and a fast similarity measure are applied for efficiency while fine-grained tokenization and an accurate similarity measure are used for effectiveness.In experiments,we compare ML-Parser with two existing online log parsing approaches,Drain and Spell,on ten real-world datasets,five labeled and five unlabeled.On the five labeled datasets,we use the proportion of correctly parsed logs to measure the accuracy,and ML-Parser achieves the highest accuracy on four datasets.On the whole ten datasets,we use Loss metric to measure the parsing quality.ML-Parse achieves the highest quality on seven out of the ten datasets while maintaining relatively high efficiency.展开更多
●AIM:To evaluate the effectiveness and safety of early lens extraction during pars plana vitrectomy(PPV)for proliferative diabetic retinopathy(PDR)compared to those of PPV with subsequent cataract surgery.●METHODS:T...●AIM:To evaluate the effectiveness and safety of early lens extraction during pars plana vitrectomy(PPV)for proliferative diabetic retinopathy(PDR)compared to those of PPV with subsequent cataract surgery.●METHODS:This multicenter randomized controlled trial was conducted in three Chinese hospitals on patients with PDR,aged>45y,with mild cataracts.The participants were randomly assigned to the combined(PPV combined with simultaneously cataract surgery,i.e.,phacovitrectomy)or subsequent(PPV with subsequent cataract surgery 6mo later)group and followed up for 12mo.The primary outcome was the change in best-corrected visual acuity(BCVA)from baseline to 6mo,and the secondary outcomes included complication rates and medical expenses.●RESULTS:In total,129 patients with PDR were recruited and equally randomized(66 and 63 in the combined and subsequent groups respectively).The change in BCVA in the combined group[mean,36.90 letters;95%confidence interval(CI),30.35–43.45]was significantly better(adjusted difference,16.43;95%CI,8.77–24.08;P<0.001)than in the subsequent group(mean,22.40 letters;95%CI,15.55–29.24)6mo after the PPV,with no significant difference between the two groups at 12mo.The overall surgical risk of two sequential surgeries was significantly higher than that of the combined surgery for neovascular glaucoma(17.65%vs 3.77%,P=0.005).No significant differences were found in the photocoagulation spots,surgical time,and economic expenses between two groups.In the subsequent group,the duration of work incapacity(22.54±9.11d)was significantly longer(P<0.001)than that of the combined group(12.44±6.48d).●CONCLUSION:PDR patients aged over 45y with mild cataract can also benefit from early lens extraction during PPV with gratifying effectiveness,safety and convenience,compared to sequential surgeries.展开更多
AIM:To compare the efficacy of pars plana vitrectomy(PPV)combined with internal limiting membrane(ILM)and silicone oil or sterile air tamponade for the treatment of myopic foveoschisis(MF)in highly myopic eyes.METHODS...AIM:To compare the efficacy of pars plana vitrectomy(PPV)combined with internal limiting membrane(ILM)and silicone oil or sterile air tamponade for the treatment of myopic foveoschisis(MF)in highly myopic eyes.METHODS:This retrospective study included 48 myopic eyes of 40 patients with MF and axial lengths(ALs)ranging from 26-32 mm treated between January 2020 and January 2022.All patients were underwent PPV combined with ILM peeling followed by sterile air or silicone oil tamponade and followed up at least 12mo.Based on the features on spectral-domain optical coherence tomography(SD-OCT),the eyes were divided into the MF-only group(Group A,n=15 eyes),MF with central foveal detachment group(Group B,n=20 eyes),and MF with lamellar macular hole group(Group C,n=13 eyes).According to AL,eyes were further divided into three groups:Group D(26.01-28.00 mm,n=12 eyes),Group E(28.01-30.00 mm,n=26 eyes),and Group F(30.01-32.00 mm,n=10 eyes).The best-corrected visual acuity(BCVA),central foveal thickness(CFT),and complications were recorded.RESULTS:The patients included 16 males and 24 females with the mean age of 56±9.82y.The BCVA and CFT improved in all groups after surgery(P<0.01),while there was no significant difference of the CFT in Group A,B,and C postoperatively(P>0.05).The intergroup differences of BCVA and CFT postoperatively were statistically significant in Group D,E,and F.Twenty eyes were injected with sterile air,and 28 eyes were injected with silicone oil for tamponade based on the AL.However,there was no statistically significant difference among Groups D,E,and F in terms of the results of sterile air or silicone oil tamponade.The mean recovery time was 5.9mo for MF patients subjected to silicone oil tamponade and 7.7mo for patients subjected to sterile air tamponade,and the difference was not statistically significant.CONCLUSION:PPV and ILM peeling combined with silicone oil or sterile air tamponade can achieve good results for MF in highly myopic eyes with ALs≤32 mm.展开更多
BACKGROUND Endophthalmitis occurring in silicone oil-filled eyes is a very rare occurrence,with reported incidence rates ranging between 0.07%and 0.039%.Traditional methods of management of infectious endophthalmitis ...BACKGROUND Endophthalmitis occurring in silicone oil-filled eyes is a very rare occurrence,with reported incidence rates ranging between 0.07%and 0.039%.Traditional methods of management of infectious endophthalmitis include the removal of silicone oil,washout of the vitreous cavity,administration of intravitreal antibiotics,and reinjection of silicone oil.CASE SUMMARY Herein,we report the case of a 39-year-old man with unilateral endophthalmitis after pars plana vitrectomy and silicone oil tamponade.Intravitreal injections of full-dose antibiotics and anterior chamber washout were used to treat the patient.No signs of retinal toxicity were observed during the follow-up period.CONCLUSION Intravitreal full-dose antibiotic injections and anterior chamber washout are promising alternatives to traditional therapies for endophthalmitis in silicone oilfilled eyes.展开更多
The Extensible Markup Language(XML)files,widely used for storing and exchanging information on the web require efficient parsing mechanisms to improve the performance of the applications.With the existing Document Obj...The Extensible Markup Language(XML)files,widely used for storing and exchanging information on the web require efficient parsing mechanisms to improve the performance of the applications.With the existing Document Object Model(DOM)based parsing,the performance degrades due to sequential processing and large memory requirements,thereby requiring an efficient XML parser to mitigate these issues.In this paper,we propose a Parallel XML Tree Generator(PXTG)algorithm for accelerating the parsing of XML files and a Regression-based XML Parsing Framework(RXPF)that analyzes and predicts performance through profiling,regression,and code generation for efficient parsing.The PXTG algorithm is based on dividing the XML file into n parts and producing n trees in parallel.The profiling phase of the RXPF framework produces a dataset by measuring the performance of various parsing models including StAX,SAX,DOM,JDOM,and PXTG on different cores by using multiple file sizes.The regression phase produces the prediction model,based on which the final code for efficient parsing of XML files is produced through the code generation phase.The RXPF framework has shown a significant improvement in performance varying from 9.54%to 32.34%over other existing models used for parsing XML files.展开更多
AIM:To analyze the distribution of fibrovascular proliferative membranes(FVPMs)in proliferative diabetic retinopathy(PDR)patients that treated with pars plana vitrectomy(PPV),and to evaluate the outcomes separately.ME...AIM:To analyze the distribution of fibrovascular proliferative membranes(FVPMs)in proliferative diabetic retinopathy(PDR)patients that treated with pars plana vitrectomy(PPV),and to evaluate the outcomes separately.METHODS:This was a retrospective and cross-sectional study.Consecutive 25-gauge(25-G)PPV cases operated for PDR from May 2018 to April 2020.According to the FVPMs images outlined after operations,subjects were assigned into three groups:arcade type group,juxtapapillary type group,and central type group.All patients were followed up for over one year.General characteristics,operation-related variables,postoperative parameters and complications were recorded.RESULTS:Among 103 eyes recruited,the FVPMs distribution of nasotemporal and inferiosuperioral was significantly different(both P<0.01),with 95(92.23%)FVPMs located in the nasal quadrants,and 74(71.84%)in the inferior.The eyes with a central FVPM required the longest operation time,with silicon oil used in most patients,generally combined with tractional retinal detachment(RD)and rhegmatogenous RD,the worst postoperative bestcorrected visual acuity(BCVA)and the highest rates of recurrent RD(all P<0.05).FVPM type,age of onset diabetes mellitus,preoperative BCVA,and combined with tractional RD and rhegmatogenous RD were significantly associated with BCVA improvement(all P<0.05).Compared with the central type group,the arcade type group had higher rates of BCVA improvement.CONCLUSION:FVPMs are more commonly found in the nasal and inferior mid-peripheral retina in addition to the area of arcade vessels.Performing 25-G PPV for treating PDR eyes with central FVPM have relatively worse prognosis.展开更多
This paper introduces Certis, a powerful framework that addresses the challenges of cloud asset tracking, management, and threat detection in modern cybersecurity landscapes. It enhances asset identification and anoma...This paper introduces Certis, a powerful framework that addresses the challenges of cloud asset tracking, management, and threat detection in modern cybersecurity landscapes. It enhances asset identification and anomaly detection through SSL certificate parsing, cloud service provider integration, and advanced fingerprinting techniques like JARM at the application layer. Current work will focus on cross-layer malicious behavior identification to further enhance its capabilities, including minimizing false positives through AI-based learning techniques. Certis promises to offer a powerful solution for organizations seeking proactive cybersecurity defenses in the face of evolving threats.展开更多
We utilized Raspberry Pi 4B to develop a microbial monitoring system to simplify the microbial image-capturing process and facilitate the informatization of microbial observation results.The Raspberry Pi 4B firmware,d...We utilized Raspberry Pi 4B to develop a microbial monitoring system to simplify the microbial image-capturing process and facilitate the informatization of microbial observation results.The Raspberry Pi 4B firmware,developed under Python on the Linux platform,achieves sum verification of serial data,file upload based on TCP protocol,control of sequence light source and light valve,real-time self-test based on multithreading,and an experiment-oriented file management method.The system demonstrated improved code logic,scheduling,exception handling,and code readability.展开更多
文摘In Chinese, dependency analysis has been shown to be a powerful syntactic parser because the order of phrases in a sentence is relatively free compared with English. Conventional dependency parsers require a number of sophisticated rules that have to be handcrafted by linguists, and are too cumbersome to maintain. To solve the problem, a parser using SVM (Support Vector Machine) is introduced. First, a new strategy of dependency analysis is proposed. Then some chosen feature types are used for learning and for creating the modification matrix using SVM. Finally, the dependency of phrases in the sentence is generated. Experiments conducted to analyze how each type of feature affects parsing accuracy, showed that the model can increase accuracy of the dependency parser by 9.2%.
文摘In order to obtain information or discover knowledge from system logs,the first step is to performlog parsing,whereby unstructured raw logs can be transformed into a sequence of structured events.Although comprehensive studies on log parsing have been conducted in recent years,most assume that one event object corresponds to a single-line message.However,in a growing number of scenarios,one event object spans multiple lines in the log,for which parsing methods toward single-line events are not applicable.In order to address this problem,this paper proposes an automated log parsing method for multiline events(LPME).LPME finds multiline event objects via iterative scanning,driven by a set of heuristic rules derived from practice.The advantage of LPME is that it proposes a cohesion-based evaluation method for multiline events and a bottom-up search approach that eliminates the process of enumerating all combinations.We analyze the algorithmic complexity of LPME and validate it on four datasets from different backgrounds.Evaluations show that the actual time complexity of LPME parsing for multiline events is close to the constant time,which enables it to handle large-scale sample inputs.On the experimental datasets,the performance of LPME achieves 1.0 for recall,and the precision is generally higher than 0.9,which demonstrates the effectiveness of the proposed LPME.
基金Supported by the National Natural Science Foundation of China (Grant Nos. 60273023, 60721061)
文摘We study CFG parse tree enumeration in this paper. By dividing the set of all parse trees into infinite hierarchies according to height of parse tree, the hierarchical lexicographic order on the set of parse trees is established. Then grammar-based algorithms for counting and enumerating CFG parse trees in this order are presented. To generate a parse tree of height n, the time complexity is O(n). If τ is a lowest parse tree for its yield, then O(n) =O(||τ|| + 1), where ||τ|| is the length of the sentence (yield) generated by τ. The sentence can be obtained as a by-product of the parse tree. To compute sentence from its parse tree (needn't be lowest one), the time complexity is O(node)+O(||τ|| + 1), where node is the number of non-leaf nodes of parse tree τ. To generate both a complete lowest parse tree and its yield at the same time, the time complexity is O(||τ|| + 1).
基金Supported by the National Natural Science Foundation of China under Grant Nos.60873150,60970056 and 90920004
文摘This paper proposes a tree kernel method of semantic relation detection and classification (RDC) between named entities. It resolves two critical problems in previous tree kernel methods of RDC. First, a new tree kernel is presented to better capture the inherent structural information in a parse tree by enabling the standard convolution tree kernel with context-sensitiveness and approximate matching of sub-trees. Second, an enriched parse tree structure is proposed to well derive necessary structural information, e.g., proper latent annotations, from a parse tree. Evaluation on the ACE RDC corpora shows that both the new tree kernel and the enriched parse tree structure contribute significantly to RDC and our tree kernel method much outperforms the state-of-the-art ones.
基金Supported by the National Natural Science Foundation of China under Grant Nos.61331011 and 61273320the National High Technology Research and Development 863 Program of China under Grant No.2012AA011102the Natural Science Foundation of Jiangsu Provincial Department of Education under Grant No.10KJB520016
文摘This paper explores a tree kernel based method for semantic role labeling (SRL) of Chinese nominal predicates via a convolution tree kernel. In particular, a new parse tree representation structure, called dependency-driven constituent parse tree (D-CPT), is proposed to combine the advantages of both constituent and dependence parse trees. This is achieved by directly representing various kinds of dependency relations in a CPT-style structure, which employs dependency relation types instead of phrase labels in CPT (Constituent Parse Tree). In this way, D-CPT not only keeps the dependency relationship information in the dependency parse tree (DPT) structure but also retains the basic hierarchical structure of CPT style. Moreover, several schemes are designed to extract various kinds of necessary information, such as the shortest path between the nominal predicate and the argument candidate, the support verb of the nominal predicate and the head argument modified by the argument candidate, from D-CPT. This largely reduces the noisy information inherent in D-CPT. Finally, a convolution tree kernel is employed to compute the similarity between two parse trees. Besides, we also implement a feature-based method based on D-CPT. Evaluation on Chinese NomBank corpus shows that our tree kernel based method on D-CPT performs significantly better than other tree kernel-based ones and achieves comparable performance with the state-of-the-art feature-based ones. This indicates the effectiveness of the novel D-CPT structure in representing various kinds of dependency relations in a CPT-style structure and our tree kernel based method in exploring the novel D-CPT structure. This also illustrates that the kernel-based methods are competitive and they are complementary with the feature- based methods on SRL.
文摘Analyzing the syntactic structure of natural languages by parsing is an important task in artificial intelligence. Due to the complexity of natural languages, individual parsers tend to make different yet complementary errors. We propose a neural network based approach to combine parses from different parsers to yield a more accurate parse than individual ones. Unlike conventional approaches, our method directly transforms linearized candidate parses into the ground-truth parse. Experiments on the Penn English Treebank show that the proposed method improves over a state-of-the-art parser combination approach significantly.
基金the National Natural Science Foundation of China under Grant No.61672163.
文摘A log is a text message that is generated in various services,frameworks,and programs.The majority of log data mining tasks rely on log parsing as the first step,which transforms raw logs into formatted log templates.Existing log parsing approaches often fail to effectively handle the trade-off between parsing quality and performance.In view of this,in this paper,we present Multi-Layer Parser(ML-Parser),an online log parser that runs in a streaming manner.Specifically,we present a multi-layer structure in log parsing to strike a balance between efficiency and effectiveness.Coarse-grained tokenization and a fast similarity measure are applied for efficiency while fine-grained tokenization and an accurate similarity measure are used for effectiveness.In experiments,we compare ML-Parser with two existing online log parsing approaches,Drain and Spell,on ten real-world datasets,five labeled and five unlabeled.On the five labeled datasets,we use the proportion of correctly parsed logs to measure the accuracy,and ML-Parser achieves the highest accuracy on four datasets.On the whole ten datasets,we use Loss metric to measure the parsing quality.ML-Parse achieves the highest quality on seven out of the ten datasets while maintaining relatively high efficiency.
文摘●AIM:To evaluate the effectiveness and safety of early lens extraction during pars plana vitrectomy(PPV)for proliferative diabetic retinopathy(PDR)compared to those of PPV with subsequent cataract surgery.●METHODS:This multicenter randomized controlled trial was conducted in three Chinese hospitals on patients with PDR,aged>45y,with mild cataracts.The participants were randomly assigned to the combined(PPV combined with simultaneously cataract surgery,i.e.,phacovitrectomy)or subsequent(PPV with subsequent cataract surgery 6mo later)group and followed up for 12mo.The primary outcome was the change in best-corrected visual acuity(BCVA)from baseline to 6mo,and the secondary outcomes included complication rates and medical expenses.●RESULTS:In total,129 patients with PDR were recruited and equally randomized(66 and 63 in the combined and subsequent groups respectively).The change in BCVA in the combined group[mean,36.90 letters;95%confidence interval(CI),30.35–43.45]was significantly better(adjusted difference,16.43;95%CI,8.77–24.08;P<0.001)than in the subsequent group(mean,22.40 letters;95%CI,15.55–29.24)6mo after the PPV,with no significant difference between the two groups at 12mo.The overall surgical risk of two sequential surgeries was significantly higher than that of the combined surgery for neovascular glaucoma(17.65%vs 3.77%,P=0.005).No significant differences were found in the photocoagulation spots,surgical time,and economic expenses between two groups.In the subsequent group,the duration of work incapacity(22.54±9.11d)was significantly longer(P<0.001)than that of the combined group(12.44±6.48d).●CONCLUSION:PDR patients aged over 45y with mild cataract can also benefit from early lens extraction during PPV with gratifying effectiveness,safety and convenience,compared to sequential surgeries.
基金Supported by the Natural Science Basic Research Program in Shaanxi Province(No.2020JM-683).
文摘AIM:To compare the efficacy of pars plana vitrectomy(PPV)combined with internal limiting membrane(ILM)and silicone oil or sterile air tamponade for the treatment of myopic foveoschisis(MF)in highly myopic eyes.METHODS:This retrospective study included 48 myopic eyes of 40 patients with MF and axial lengths(ALs)ranging from 26-32 mm treated between January 2020 and January 2022.All patients were underwent PPV combined with ILM peeling followed by sterile air or silicone oil tamponade and followed up at least 12mo.Based on the features on spectral-domain optical coherence tomography(SD-OCT),the eyes were divided into the MF-only group(Group A,n=15 eyes),MF with central foveal detachment group(Group B,n=20 eyes),and MF with lamellar macular hole group(Group C,n=13 eyes).According to AL,eyes were further divided into three groups:Group D(26.01-28.00 mm,n=12 eyes),Group E(28.01-30.00 mm,n=26 eyes),and Group F(30.01-32.00 mm,n=10 eyes).The best-corrected visual acuity(BCVA),central foveal thickness(CFT),and complications were recorded.RESULTS:The patients included 16 males and 24 females with the mean age of 56±9.82y.The BCVA and CFT improved in all groups after surgery(P<0.01),while there was no significant difference of the CFT in Group A,B,and C postoperatively(P>0.05).The intergroup differences of BCVA and CFT postoperatively were statistically significant in Group D,E,and F.Twenty eyes were injected with sterile air,and 28 eyes were injected with silicone oil for tamponade based on the AL.However,there was no statistically significant difference among Groups D,E,and F in terms of the results of sterile air or silicone oil tamponade.The mean recovery time was 5.9mo for MF patients subjected to silicone oil tamponade and 7.7mo for patients subjected to sterile air tamponade,and the difference was not statistically significant.CONCLUSION:PPV and ILM peeling combined with silicone oil or sterile air tamponade can achieve good results for MF in highly myopic eyes with ALs≤32 mm.
基金Supported by National Key R and D Program of China,No.2020YFC2008200.
文摘BACKGROUND Endophthalmitis occurring in silicone oil-filled eyes is a very rare occurrence,with reported incidence rates ranging between 0.07%and 0.039%.Traditional methods of management of infectious endophthalmitis include the removal of silicone oil,washout of the vitreous cavity,administration of intravitreal antibiotics,and reinjection of silicone oil.CASE SUMMARY Herein,we report the case of a 39-year-old man with unilateral endophthalmitis after pars plana vitrectomy and silicone oil tamponade.Intravitreal injections of full-dose antibiotics and anterior chamber washout were used to treat the patient.No signs of retinal toxicity were observed during the follow-up period.CONCLUSION Intravitreal full-dose antibiotic injections and anterior chamber washout are promising alternatives to traditional therapies for endophthalmitis in silicone oilfilled eyes.
文摘The Extensible Markup Language(XML)files,widely used for storing and exchanging information on the web require efficient parsing mechanisms to improve the performance of the applications.With the existing Document Object Model(DOM)based parsing,the performance degrades due to sequential processing and large memory requirements,thereby requiring an efficient XML parser to mitigate these issues.In this paper,we propose a Parallel XML Tree Generator(PXTG)algorithm for accelerating the parsing of XML files and a Regression-based XML Parsing Framework(RXPF)that analyzes and predicts performance through profiling,regression,and code generation for efficient parsing.The PXTG algorithm is based on dividing the XML file into n parts and producing n trees in parallel.The profiling phase of the RXPF framework produces a dataset by measuring the performance of various parsing models including StAX,SAX,DOM,JDOM,and PXTG on different cores by using multiple file sizes.The regression phase produces the prediction model,based on which the final code for efficient parsing of XML files is produced through the code generation phase.The RXPF framework has shown a significant improvement in performance varying from 9.54%to 32.34%over other existing models used for parsing XML files.
基金Supported by the Program for Qinhuangdao Self-financing Science and Technology Plan of 2008 (No.201805A143).
文摘AIM:To analyze the distribution of fibrovascular proliferative membranes(FVPMs)in proliferative diabetic retinopathy(PDR)patients that treated with pars plana vitrectomy(PPV),and to evaluate the outcomes separately.METHODS:This was a retrospective and cross-sectional study.Consecutive 25-gauge(25-G)PPV cases operated for PDR from May 2018 to April 2020.According to the FVPMs images outlined after operations,subjects were assigned into three groups:arcade type group,juxtapapillary type group,and central type group.All patients were followed up for over one year.General characteristics,operation-related variables,postoperative parameters and complications were recorded.RESULTS:Among 103 eyes recruited,the FVPMs distribution of nasotemporal and inferiosuperioral was significantly different(both P<0.01),with 95(92.23%)FVPMs located in the nasal quadrants,and 74(71.84%)in the inferior.The eyes with a central FVPM required the longest operation time,with silicon oil used in most patients,generally combined with tractional retinal detachment(RD)and rhegmatogenous RD,the worst postoperative bestcorrected visual acuity(BCVA)and the highest rates of recurrent RD(all P<0.05).FVPM type,age of onset diabetes mellitus,preoperative BCVA,and combined with tractional RD and rhegmatogenous RD were significantly associated with BCVA improvement(all P<0.05).Compared with the central type group,the arcade type group had higher rates of BCVA improvement.CONCLUSION:FVPMs are more commonly found in the nasal and inferior mid-peripheral retina in addition to the area of arcade vessels.Performing 25-G PPV for treating PDR eyes with central FVPM have relatively worse prognosis.
文摘This paper introduces Certis, a powerful framework that addresses the challenges of cloud asset tracking, management, and threat detection in modern cybersecurity landscapes. It enhances asset identification and anomaly detection through SSL certificate parsing, cloud service provider integration, and advanced fingerprinting techniques like JARM at the application layer. Current work will focus on cross-layer malicious behavior identification to further enhance its capabilities, including minimizing false positives through AI-based learning techniques. Certis promises to offer a powerful solution for organizations seeking proactive cybersecurity defenses in the face of evolving threats.
文摘We utilized Raspberry Pi 4B to develop a microbial monitoring system to simplify the microbial image-capturing process and facilitate the informatization of microbial observation results.The Raspberry Pi 4B firmware,developed under Python on the Linux platform,achieves sum verification of serial data,file upload based on TCP protocol,control of sequence light source and light valve,real-time self-test based on multithreading,and an experiment-oriented file management method.The system demonstrated improved code logic,scheduling,exception handling,and code readability.