{"results":[{"id":"ss_54edd7b3067751539c655868a964d69fcd8abf97","title":"Artificial Intelligence in Medical Practice: The Question to the Answer?","authors":[{"name":"D. Miller"},{"name":"E. Brown"}],"abstract":"","source":"Semantic Scholar","year":2017,"language":"en","subjects":["Medicine"],"doi":"10.1016/j.amjmed.2017.10.035","url":"https://www.semanticscholar.org/paper/54edd7b3067751539c655868a964d69fcd8abf97","pdf_url":"https://touroscholar.touro.edu/author_agreement.pdf","is_open_access":true,"citations":640,"published_at":"","score":80.2},{"id":"ss_9634af346c2356a8d40cbb939c49a7a7a9ba62fc","title":"Cramming More Components Onto Integrated Circuits","authors":[{"name":"G. Moore"}],"abstract":"","source":"Semantic Scholar","year":1998,"language":"en","subjects":["Computer Science","Engineering"],"doi":"10.1109/JPROC.1998.658762","url":"https://www.semanticscholar.org/paper/9634af346c2356a8d40cbb939c49a7a7a9ba62fc","is_open_access":true,"citations":11824,"published_at":"","score":80},{"id":"ss_9f14c7b599d3cbd1646215291b5e843d38d42b48","title":"Cryptography and Data Security","authors":[{"name":"D. Denning"}],"abstract":"","source":"Semantic Scholar","year":1982,"language":"en","subjects":["Computer Science"],"url":"https://www.semanticscholar.org/paper/9f14c7b599d3cbd1646215291b5e843d38d42b48","is_open_access":true,"citations":1978,"published_at":"","score":80},{"id":"ss_440cf99ecb3f08451fb3c94cb5c8242f8fa3b5a6","title":"DNA solution of hard computational problems.","authors":[{"name":"R. Lipton"}],"abstract":"","source":"Semantic Scholar","year":1995,"language":"en","subjects":["Computer Science","Medicine"],"doi":"10.1126/SCIENCE.7725098","url":"https://www.semanticscholar.org/paper/440cf99ecb3f08451fb3c94cb5c8242f8fa3b5a6","is_open_access":true,"citations":1091,"published_at":"","score":80},{"id":"ss_7b80e78f77562f2e36664e0f26c63d07b07726e7","title":"OpenFermion: the electronic structure package for quantum computers","authors":[{"name":"J. McClean"},{"name":"N. Rubin"},{"name":"Kevin J Sung"},{"name":"I. Kivlichan"},{"name":"X. Bonet-Monroig"},{"name":"X. Bonet-Monroig"},{"name":"Yudong Cao"},{"name":"Chengyu Dai"},{"name":"E. Fried"},{"name":"C. Gidney"},{"name":"Brendan Gimby"},{"name":"P. Gokhale"},{"name":"Thomas Häner"},{"name":"Tarini S. Hardikar"},{"name":"Vojtěch Havlíček"},{"name":"O. Higgott"},{"name":"Cupjin Huang"},{"name":"J. Izaac"},{"name":"Zhang Jiang"},{"name":"Xinle Liu"},{"name":"Sam McArdle"},{"name":"M. Neeley"},{"name":"T. O’Brien"},{"name":"B. O’Gorman"},{"name":"B. O’Gorman"},{"name":"I. Ozfidan"},{"name":"M. Radin"},{"name":"J. Romero"},{"name":"Nicolas P. D. Sawaya"},{"name":"Bruno Senjean"},{"name":"Kanav Setia"},{"name":"Sukin Sim"},{"name":"Damian S. Steiger"},{"name":"M. Steudtner"},{"name":"M. Steudtner"},{"name":"M. Steudtner"},{"name":"Qiming Sun"},{"name":"Wei Sun"},{"name":"Daochen Wang"},{"name":"Fang Zhang"},{"name":"R. Babbush"}],"abstract":"Quantum simulation of chemistry and materials is predicted to be an important application for both near-term and fault-tolerant quantum devices. However, at present, developing and studying algorithms for these problems can be difficult due to the prohibitive amount of domain knowledge required in both the area of chemistry and quantum algorithms. To help bridge this gap and open the field to more researchers, we have developed the OpenFermion software package (www.openfermion.org). OpenFermion is an open-source software library written largely in Python under an Apache 2.0 license, aimed at enabling the simulation of fermionic and bosonic models and quantum chemistry problems on quantum hardware. Beginning with an interface to common electronic structure packages, it simplifies the translation between a molecular specification and a quantum circuit for solving or studying the electronic structure problem on a quantum computer, minimizing the amount of domain expertise required to enter the field. The package is designed to be extensible and robust, maintaining high software standards in documentation and testing. This release paper outlines the key motivations behind design choices in OpenFermion and discusses some basic OpenFermion functionality which we believe will aid the community in the development of better quantum algorithms and tools for this exciting area of research.","source":"Semantic Scholar","year":2017,"language":"en","subjects":["Computer Science","Mathematics","Physics"],"doi":"10.1088/2058-9565/ab8ebc","url":"https://www.semanticscholar.org/paper/7b80e78f77562f2e36664e0f26c63d07b07726e7","pdf_url":"https://scholarlypublications.universiteitleiden.nl/access/item%3A3640141/view","is_open_access":true,"citations":562,"published_at":"","score":77.86},{"id":"doaj_10.7717/peerj-cs.3621","title":"Understanding older adults’ continuance intention toward smart locks: a socio-technical study based on the Expectation-Confirmation Model of Information Systems and Task-Technology Fit Model","authors":[{"name":"Yuan Wang"},{"name":"Norazmawati Md Sani"},{"name":"Jing Cai"},{"name":"Pei Lu"},{"name":"Lixin Wang"},{"name":"Yinhong Hua"}],"abstract":"Background As aging populations continue to grow, smart home technologies—such as smart locks—have become increasingly essential to support older adults’ independent living. Long-term use remains a challenge, however, with most studies focusing on initial adoption rather than sustained engagement. Methods In this study, we examined the key factors related to older adults’ continuance intention toward smart locks, applying a socio-technical framework that integrated the Expectation-Confirmation Model of Information Systems (ECM-IS), the Task-Technology Fit (TTF) model, and external variables, including privacy and security, trust, and habit. We analyzed survey data from 422 Chinese participants aged 55 and older using Partial Least Squares Structural Equation Modeling (PLS-SEM) and Importance-Performance Matrix Analysis (IPMA). Results The model explained 71.6% of the variance in continuance intention (R2 = 0.716) and showed strong predictive relevance (Q2 = 0.623). Trust and perceived usefulness were positively related to continuance intention, followed by satisfaction. Task-technology fit and confirmation were significantly associated with perceived usefulness and satisfaction. Habit and privacy and security were not significant with respect to continuance intention. Conclusions These findings provide theoretical and practical insight for designing age-inclusive, trust-enhancing smart locks that better support older adults’ needs in post-adoption contexts.","source":"DOAJ","year":2026,"language":"","subjects":["Electronic computers. Computer science"],"doi":"10.7717/peerj-cs.3621","url":"https://peerj.com/articles/cs-3621/","is_open_access":true,"published_at":"","score":70},{"id":"doaj_10.1002/eng2.13035","title":"Path Planning Approaches in Multi‐robot System: A Review","authors":[{"name":"Semonti Banik"},{"name":"Sajal Chandra Banik"},{"name":"Sarker Safat Mahmud"}],"abstract":"ABSTRACT The essential factor in developing multi‐robot systems is the generation of an optimal path for task completion by multiple robots. To ensure effective path planning, this paper studies the recent publications and provides a detailed review of the path planning approaches to avoid collisions in uncertain environments. In this article, path‐planning approaches for multiple robots are categorized primarily into classical, heuristic, and artificial intelligence‐based methods. Among the heuristic approaches, bio‐inspired approaches are mostly employed to optimize the classical approaches to enhance their adaptability. The articles are analyzed based on static and dynamic scenarios, real‐time experiments, and simulations involving hybrid solutions. The increasing focus on using hybrid approaches in dynamic environments is found mostly in the papers employing heuristic and AI‐based approaches. In real‐time applications, AI‐based approaches are highly implemented in comparison to heuristic and classical approaches. Moreover, the findings from this review, highlighting the strengths and drawbacks of each algorithm, can help researchers select the appropriate approach to overcome the limitations in designing efficient multi‐robot systems.","source":"DOAJ","year":2025,"language":"","subjects":["Engineering (General). Civil engineering (General)","Electronic computers. Computer science"],"doi":"10.1002/eng2.13035","url":"https://doi.org/10.1002/eng2.13035","is_open_access":true,"published_at":"","score":69},{"id":"doaj_10.1007/s10791-025-09729-5","title":"A game-theoretic sequential three-way decision using probabilistic rough sets and multiple levels of granularity","authors":[{"name":"T. V. Soumya"},{"name":"M. K. Sabu"}],"abstract":"Abstract The sequential three-way decision accepts additional information at each level and makes more accurate definite decisions with less uncertainty. This process can also be extended to two-way classification with the finer-grained information level. However, both the decision process cost and decision result cost of the model must be considered for optimal performance. The proposed model adapts the game-theoretic approach to deal with the trade-off between the decision process cost and the decision result cost, and thereby balance the number of levels of the model. The time complexity, information level, and feature importance contribute to the process cost while evaluation metrics stand for the result cost. The model starts with reliable initial results by using the most significant features at the first level itself and follows an objective function-based method to determine threshold pairs at each level, which avoids relying on domain experts. Furthermore, if the process cost outweighs the result cost, the number of levels is adjusted accordingly. Using the experimental datasets, instances are classified at each level at the optimal threshold pairs; therefore the trisection is obtained with the highest precision/recall value. The obtained results prove that the proposed model outperforms existing models in terms of precision, recall, and time complexity with balanced decision costs. In summary, the proposed model is cost-efficient, interpretable, termination-aware, and result-oriented, ensuring effective and practical decision-making.","source":"DOAJ","year":2025,"language":"","subjects":["Electronic computers. Computer science"],"doi":"10.1007/s10791-025-09729-5","url":"https://doi.org/10.1007/s10791-025-09729-5","is_open_access":true,"published_at":"","score":69},{"id":"doaj_10.46298/theoretics.25.21","title":"Determinantal Sieving","authors":[{"name":"Eduard Eiben"},{"name":"Tomohiro Koana"},{"name":"Magnus Wahlström"}],"abstract":"We introduce determinantal sieving, a new, remarkably powerful tool in the toolbox of algebraic FPT algorithms. Given a polynomial $P(X)$ on a set of variables $X=\\{x_1,\\ldots,x_n\\}$ and a linear matroid $M=(X,\\mathcal{I})$ of rank $k$, both over a field $\\mathbb{F}$ of characteristic 2, in $2^k$ evaluations we can sieve for those terms in the monomial expansion of $P$ which are multilinear and whose support is a basis for $M$. Alternatively, using $2^k$ evaluations of $P$ we can sieve for those monomials whose odd support spans $M$. Applying this framework, we improve on a range of algebraic FPT algorithms, such as:   1. Solving $q$-Matroid Intersection in time $O^*(2^{(q-2)k})$ and $q$-Matroid Parity in time $O^*(2^{qk})$, improving on $O^*(4^{qk})$ over general fields (Brand and Pratt, ICALP 2021)   2. Long $(s,t)$-Path in $O^*(1.66^k)$ time, improving on $O^*(2^k)$, and Rank $k$ $(S,T)$-Linkage in so-called frameworks in $O^*(2^k)$ time, improving on $O^*(2^{|S|+O(k^2 \\log(k+|\\mathbb{F}|))})$ over general fields (Fomin et al., SODA 2023).   3. Many instances of the Diverse X paradigm, finding a collection of $r$ solutions to a problem with a minimum mutual distance of $d$ in time $O^*(2^{r(r-1)d/2})$, improving solutions for $k$-Distinct Branchings from time $2^{O(k \\log k)}$ to $O^*(2^k)$ (Bang-Jensen et al., ESA 2021), and for Diverse Perfect Matchings from $O^*(2^{2^{O(rd)}})$ to $O^*(2^{r^2d/2})$ (Fomin et al., STACS 2021).   Here, all matroids are assumed to be represented over fields of characteristic 2. Over general fields, we achieve similar results at the cost of using exponential space by working over the exterior algebra. For a class of arithmetic circuits we call strongly monotone, this is even achieved without any loss of running time. However, the odd support sieving result appears to be specific to working over characteristic 2.","source":"DOAJ","year":2025,"language":"","subjects":["Electronic computers. Computer science"],"doi":"10.46298/theoretics.25.21","url":"http://theoretics.episciences.org/14026/pdf","pdf_url":"http://theoretics.episciences.org/14026/pdf","is_open_access":true,"published_at":"","score":69},{"id":"doaj_Research+and+practice+on+key+issues+in+the+implementation+of+government+data+classification+and+grading+in+China","title":"Research and practice on key issues in the implementation of government data classification and grading in China","authors":[{"name":"Yue WANG"},{"name":"Na SU"}],"abstract":"Data classification and grading is the foundation for ensuring the safe circulation of data and promoting the release of data value.This paper focuses on the key task of government data classification and grading in digital reform.Using a theoretical case study method and based on publicly released plans by various provincial governments and ministries, the implementation of government data classification and grading in China is systematically sorted and quantitatively analyzed.This paper summarizes four key processes and five characteristics of the implementation of government data classification and classification in China.Based on the special complexity of the classification and grading of government data, this paper puts forward four problems corresponding solutions in the implementation of the classification and grading of government data in China, such as unclear overall target positioning, different classification and grading objects, separated classification and grading relations, and different security grading standards.Based on the practice of classification and grading government data of a national ministry, this paper verifies the scientificity and effectiveness of the solutions, and provides a reference for constructing a unified national government data classification and grading system.","source":"DOAJ","year":2024,"language":"","subjects":["Electronic computers. Computer science"],"url":"http://www.j-bigdataresearch.com.cn/thesisDetails#10.11959/j.issn.2096-0271.2024035","is_open_access":true,"published_at":"","score":68},{"id":"doaj_10.1016/j.softx.2023.101603","title":"SOQCS: A Stochastic Optical Quantum Circuit Simulator","authors":[{"name":"Javier Osca"},{"name":"Jiri Vala"}],"abstract":"Stochastic Optical Quantum Circuit Simulator (SOQCS) is a C++ and Python library which offers a framework to define, simulate and study quantum linear optical circuits in presence of various imperfections typically encountered in experiments. Quantum circuits can be defined from basic components, including emitters, linear optical elements, delays and detectors. The imperfections come from partial distinguishability of photons, lossy propagation media, unbalanced beamsplitters and non-ideal emitters and detectors for example. SOQCS also provides various simulator cores and tools to analyze the output. Furthermore, the configuration of detectors also includes postselection. SOQCS is developed using a modular approach in which different modules are applied in an automated easy to use manner. Furthermore, the modular approach allows for further extensions of the SOQCS capabilities in future.","source":"DOAJ","year":2024,"language":"","subjects":["Computer software"],"doi":"10.1016/j.softx.2023.101603","url":"http://www.sciencedirect.com/science/article/pii/S2352711023002996","is_open_access":true,"published_at":"","score":68},{"id":"doaj_10.1007/s40747-024-01350-1","title":"CL-BPUWM: continuous learning with Bayesian parameter updating and weight memory","authors":[{"name":"Yao He"},{"name":"Jing Yang"},{"name":"Shaobo Li"},{"name":"Jianjun Hu"},{"name":"Yaping Ren"},{"name":"Qing Ji"}],"abstract":"Abstract Catastrophic forgetting in neural networks is a common problem, in which neural networks lose information from previous tasks after training on new tasks. Although adopting a regularization method that preferentially retains the parameters important to the previous task to avoid catastrophic forgetting has a positive effect; existing regularization methods cause the gradient to be near zero because the loss is at the local minimum. To solve this problem, we propose a new continuous learning method with Bayesian parameter updating and weight memory (CL-BPUWM). First, a parameter updating method based on the Bayes criterion is proposed to allow the neural network to gradually obtain new knowledge. The diagonal of the Fisher information matrix is then introduced to significantly minimize computation and increase parameter updating efficiency. Second, we suggest calculating the importance weight by observing how changes in each network parameter affect the model prediction output. In the process of model parameter updating, the Fisher information matrix and the sensitivity of the network are used as the quadratic penalty terms of the loss function. Finally, we apply dropout regularization to reduce model overfitting during training and to improve model generalizability. CL-BPUWM performs very well in continuous learning for classification tasks on CIFAR-100 dataset, CIFAR-10 dataset, and MNIST dataset. On CIFAR-100 dataset, it is 0.8%, 1.03% and 0.75% higher than the best performing regularization method (EWC) in three task partitions. On CIFAR-10 dataset, it is 2.25% higher than the regularization method (EWC) and 0.7% higher than the scaled method (GR). It is 0.66% higher than the regularization method (EWC) on the MNIST dataset. When the CL-BPUWM method was combined with the brain-inspired replay model under the CIFAR-100 and CIFAR-10 datasets, the classification accuracy was 2.35% and 5.38% higher than that of the baseline method, BI-R + SI.","source":"DOAJ","year":2024,"language":"","subjects":["Electronic computers. Computer science","Information technology"],"doi":"10.1007/s40747-024-01350-1","url":"https://doi.org/10.1007/s40747-024-01350-1","is_open_access":true,"published_at":"","score":68},{"id":"ss_7df645de6695eed2fc5b99c902f3569aef403082","title":"Computer Vision Syndrome Among Health Sciences Students in Saudi Arabia: Prevalence and Risk Factors","authors":[{"name":"Abdullah A Altalhi"},{"name":"Waleed Khayyat"},{"name":"O. Khojah"},{"name":"Mohammed Alsalmi"},{"name":"H. Almarzouki"}],"abstract":"Introduction Computer vision syndrome (CVS) is defined as a group of vision-related symptoms that result from the continuous use of devices with digital displays, such as computers, tablets, and smartphones. Students nowadays can find resources and books online on their smartphones easily, hence, reducing the use of paper-based reading materials. This might lead to a number of ocular symptoms. In this study, we aim to assess the prevalence and determine the risk factors of CVS among students at King Saud Bin Abdulaziz University for Health Sciences (KSAUHS) in Jeddah. Materials and methods This is an observational descriptive cross-sectional study design. Students of Colleges of Medicine, Applied Medical Sciences, and Science and Health Professions at KSAUHS were asked to fill an electronic self-administered survey. The survey instrument included questions on demographic information, digital devices using habits, frequency of eye symptoms, and ergonomic practices. Results The sample size was 334 students, 55% of whom were males. The most used device was the mobile phone (78%), and the most common reason for using an electronic device was for entertainment (80%). The frequency of reported eye symptoms was as follows: headache (68%), feeling of an affected eyesight (short- or long-sightedness (65%)), eye itchiness (63%), burning sensation (62%), excessive tearing (58%), unclear vision (52%), redness (51%), dryness (48.3%), photophobia (47%), painful eye (44%), foreign body sensation (40%), excessive blinking (40%), difficulty in focusing on near objects (31%), halos around objects (28%), double vision (21%), and difficulty moving eyelids (9%). The most commonly applied ergonomic practice was adjusting display brightness based on the surrounding light brightness (82%). The rest of the ergonomic practices were less applied as follows: taking breaks while using the device (66%), sitting with the screen on face level (59%), sitting while the top of the screen on eye level (43%), sitting with the screen more than 50 cm away (32%), using antiglare filter (16%). The number of eye symptoms reported was significantly greater in female students (using Mann-Whitney U test) (U= 11056.500, p= 0.002), students who wear glasses (U= 11026, 0.002), and students who observe glare on their screens (U= 8363, p= 0.043). Conclusion CVS symptoms are commonly reported among health sciences students who use different electronic devices. The occurrence of CVS symptoms was significantly higher among female students, those who observe glare on screens, and those who wear eyeglasses. However, long duration of device use was not significantly associated with increased CVS symptoms. Ergonomic practices are not usually applied by most of the students, which necessitates more efforts to increase their awareness of the correct way of using devices.","source":"Semantic Scholar","year":2020,"language":"en","subjects":["Medicine"],"doi":"10.7759/cureus.7060","url":"https://www.semanticscholar.org/paper/7df645de6695eed2fc5b99c902f3569aef403082","pdf_url":"https://www.cureus.com/articles/26595-computer-vision-syndrome-among-health-sciences-students-in-saudi-arabia-prevalence-and-risk-factors.pdf","is_open_access":true,"citations":119,"published_at":"","score":67.57},{"id":"doaj_10.1016/j.jksuci.2023.101602","title":"Lattice-based ring signcryption for consortium blockchain","authors":[{"name":"Huifang Yu"},{"name":"Zhirui Lv"}],"abstract":"Ring signcryption with no group administrator satisfies the decentralization and blockchain anonymity. In this article, we construct new lattice-based ring signcryption scheme suitable for consortium blockchain (CB-LRSCS), in which the smart contract controls the process of signcryption and unsigncryption to make the system be fair and reliable. CB-LRSCS can protect the user privacy by reducing the connection between blockchain and user information, and it satisfies the reliability in ethereum environment. CB-LRSCS also has the characteristics of high efficiency, anti-quantum, anti-forgery, confidentiality and unconditional anonymity, and it can be applied in the electronic finance system.","source":"DOAJ","year":2023,"language":"","subjects":["Electronic computers. Computer science"],"doi":"10.1016/j.jksuci.2023.101602","url":"http://www.sciencedirect.com/science/article/pii/S1319157823001568","is_open_access":true,"published_at":"","score":67},{"id":"doaj_10.3390/computers12110236","title":"Design Recommendations for Immersive Virtual Reality Application for English Learning: A Systematic Review","authors":[{"name":"Jessica Rodrigues Esteves"},{"name":"Jorge C. S. Cardoso"},{"name":"Berenice Santos Gonçalves"}],"abstract":"The growing popularity of immersive virtual reality (iVR) technologies has opened up new possibilities for learning English. In the literature, it is possible to find several studies focused on the design, development, and evaluation of immersive virtual reality applications. However, there are no studies that systematize design recommendations for immersive virtual reality applications for English learning. To fill this gap, we present a systematic review that aims to identify design recommendations for immersive virtual reality English learning applications. We searched the ACM Digital Library, ERIC, IEEE Xplore, Scopus, and Web of Science (1 January 2010 to April 2023) and found that 24 out of 847 articles met the inclusion criteria. We identified 18 categories of design considerations related to design and learning and a design process used to create iVR applications. We also identified existing trends related to universities, publications, devices, human senses, and development platforms. Finally, we addressed study limitations and future directions for designing iVR applications for English learning.","source":"DOAJ","year":2023,"language":"","subjects":["Electronic computers. Computer science"],"doi":"10.3390/computers12110236","url":"https://www.mdpi.com/2073-431X/12/11/236","is_open_access":true,"published_at":"","score":67},{"id":"doaj_10.3785/j.issn.1008-9497.2022.05.011","title":"Quantitative calculation method of development indexes for layered and directional of production wells(生产井开发指标的分层分方向定量计算方法)","authors":[{"name":"ZHANGJicheng(张继成)"},{"name":"RENShuai(任帅)"},{"name":"LINLi(林立)"},{"name":"ZHAOShuai(赵帅)"},{"name":"FENGShimiao(冯诗淼)"}],"abstract":"针对注水开发的多层砂岩油藏分层动态分析难度大等问题，在常规井层开发指标计算基础上，结合动、静态劈分方法，综合考虑渗透率、孔隙度、地层系数、含水饱和度、位置系数、措施系数及注水量系数，提出了一种既可将油、水井作为统一整体，又可对小层、方向流动分量开发指标进行定量计算的体现渗流力学本质的方法。用大庆油田N2-O1井组的产液剖面资料进行验证。结果表明，所提方法的计算结果与测量结果吻合度较高，精度平均值达75.11%。用该方法计算开发指标，适用性强，能较真实地反映各小层、各方向的产液情况，对现场应用具有指导意义。","source":"DOAJ","year":2022,"language":"","subjects":["Electronic computers. Computer science","Physics"],"doi":"10.3785/j.issn.1008-9497.2022.05.011","url":"https://doi.org/10.3785/j.issn.1008-9497.2022.05.011","is_open_access":true,"published_at":"","score":66},{"id":"doaj_10.1155/2022/3581886","title":"Research on Application of 3D Simulation Technology in Industrial Product Design Technology","authors":[{"name":"Chenhan Huang"},{"name":"Daijiao Shi"}],"abstract":"In order to study the driving effect of industrial product design, a method based on the application of 3D simulation technology in industrial product design technology was proposed. This method introduces the information about the change in industrial product design in industrial enterprises and analyzes the application of 3D simulation technology in industrial product design by taking DIALux, industrial robot, and resource information search system as examples. The results show that the application of 3D simulation system needs to be combined with industrial software, and the development of industrial software business mainly based on 3D simulation technology is emphasized so that the business revenue of enterprises increases from 709 million yuan in 2029 to 1.385 billion yuan in 2021, with a compound growth rate of 25.01%, which has achieved good economic benefits. 3D simulation technology plays an important role in promoting the development of industrial product design technology. It is necessary to actively promote the integration between 3D simulation technology and industrial software.","source":"DOAJ","year":2022,"language":"","subjects":["Electronic computers. Computer science"],"doi":"10.1155/2022/3581886","url":"http://dx.doi.org/10.1155/2022/3581886","is_open_access":true,"published_at":"","score":66},{"id":"doaj_10.3390/a14050156","title":"Digital Twins in Solar Farms: An Approach through Time Series and Deep Learning","authors":[{"name":"Kamel Arafet"},{"name":"Rafael Berlanga"}],"abstract":"The generation of electricity through renewable energy sources increases every day, with solar energy being one of the fastest-growing. The emergence of information technologies such as Digital Twins (DT) in the field of the Internet of Things and Industry 4.0 allows a substantial development in automatic diagnostic systems. The objective of this work is to obtain the DT of a Photovoltaic Solar Farm (PVSF) with a deep-learning (DL) approach. To build such a DT, sensor-based time series are properly analyzed and processed. The resulting data are used to train a DL model (e.g., autoencoders) in order to detect anomalies of the physical system in its DT. Results show a reconstruction error around 0.1, a recall score of 0.92 and an Area Under Curve (AUC) of 0.97. Therefore, this paper demonstrates that the DT can reproduce the behavior as well as detect efficiently anomalies of the physical system.","source":"DOAJ","year":2021,"language":"","subjects":["Industrial engineering. Management engineering","Electronic computers. Computer science"],"doi":"10.3390/a14050156","url":"https://www.mdpi.com/1999-4893/14/5/156","is_open_access":true,"published_at":"","score":65},{"id":"doaj_10.1049/ipr2.12269","title":"Face hallucination based on cluster consistent dictionary learning","authors":[{"name":"Minqi Li"},{"name":"Xiangjian He"},{"name":"Kin‐Man Lam"},{"name":"Kaibing Zhang"},{"name":"Junfeng Jing"}],"abstract":"Abstract Face hallucination is a super‐resolution technique specially designed to reconstruct high‐resolution faces from low‐resolution faces. Most state‐of‐the‐art algorithms leverage position‐patch prior knowledge of human faces to better super‐resolve face images. However, most of them assume the training face dataset is sufficiently large, well cropped or aligned. This paper, proposes a novel example‐based face hallucination method, based on cluster consistent dictionary learning with the assumption that human faces have similar facial structures. In this method, the paired face image patches are firstly labelled as face areas including eyes, nose, mouth and other parts, as well as non‐face areas without requiring the training face images cropped and aligned. Then, the training patches are clustered according their labels and textures. The cluster consistent dictionary is learned to represent the low‐resolution patches and the high‐resolution patches. Finally, the high‐resolution patches of the input low‐resolution face image can be efficiently generated by using the adjusted anchored neighbourhood regression. As utilizing the labelled facial parts prior knowledge, the proposed method represents more details in the reconstruction. Experimental results demonstrate that the authors' algorithm outperforms many state‐of‐the‐art techniques for face hallucination under different datasets.","source":"DOAJ","year":2021,"language":"","subjects":["Photography","Computer software"],"doi":"10.1049/ipr2.12269","url":"https://doi.org/10.1049/ipr2.12269","is_open_access":true,"published_at":"","score":65},{"id":"doaj_10.1186/s42400-020-00067-1","title":"Efficient functional encryption for inner product with simulation-based security","authors":[{"name":"Wenbo Liu"},{"name":"Qiong Huang"},{"name":"Xinjian Chen"},{"name":"Hongbo Li"}],"abstract":"Abstract Functional encryption (FE) is a novel paradigm for encryption scheme which allows tremendous flexibility in accessing encrypted information. In FE, a user can learn specific function of encrypted messages by restricted functional key and reveal nothing else about the messages. Inner product encryption (IPE) is a special type of functional encryption where the decryption algorithm, given a ciphertext related to a vector x and a secret key related to a vector y, computes the inner product x·y. In this paper, we construct an efficient private-key functional encryption (FE) for inner product with simulation-based security, which is much stronger than indistinguishability-based security, under the External Decisional Linear assumption in the standard model. Compared with the existing schemes, our construction is faster in encryption and decryption, and the master secret key, secret keys and ciphertexts are shorter.","source":"DOAJ","year":2021,"language":"","subjects":["Computer engineering. Computer hardware","Electronic computers. Computer science"],"doi":"10.1186/s42400-020-00067-1","url":"https://doi.org/10.1186/s42400-020-00067-1","is_open_access":true,"published_at":"","score":65}],"total":18046808,"page":1,"page_size":20,"sources":["CrossRef","DOAJ","Semantic Scholar"],"query":"Electronic computers. Computer science"}