51,294 results
Search Results
2. Assessment of Published Papers on the Use of Machine Learning in Diagnosis and Treatment of Mastitis
- Author
-
Maria V. Bourganou, Yiannis Kiouvrekis, Dimitrios C. Chatzopoulos, Sotiris Zikas, Angeliki I. Katsafadou, Dimitra V. Liagka, Natalia G. C. Vasileiou, George C. Fthenakis, and Daphne T. Lianou
- Subjects
algorithm ,artificial intelligence ,cattle ,machine learning ,mammary infection ,mastitis ,Information technology ,T58.5-58.64 - Abstract
The present study is an evaluation of published papers on machine learning as employed in mastitis research. The aim of this study was the quantitative evaluation of the scientific content and the bibliometric details of these papers. In total, 69 papers were found to combine machine learning in mastitis research and were considered in detail. There was a progressive yearly increase in published papers, which originated from 23 countries (mostly from China or the United States of America). Most original articles (n = 59) referred to work involving cattle, relevant to mastitis in individual animals. Most articles described work related to the development and diagnosis of the infection. Fewer articles described work on the antibiotic resistance of pathogens isolated from cases of mastitis and on the treatment of the infection. In most studies (98.5% of published papers), supervised machine learning models were employed. Most frequently, decision trees and support vector machines were employed in the studies described. ‘Machine learning’ and ‘mastitis’ were the most frequently used keywords. The papers were published in 39 journals, with most frequent publications in Computers and Electronics in Agriculture and Journal of Dairy Science. The median number of cited references in the papers was 39 (interquartile range: 31). There were 435 co-authors in the papers (mean: 6.2 per paper, median: 5, min.–max.: 1–93) and 356 individual authors. The median number of citations received by the papers was 4 (min.–max.: 0–70). Most papers (72.5%) were published in open-access mode. This study summarized the characteristics of papers on mastitis and artificial intelligence. Future studies could explore using these methodologies at farm level, and extending them to other animal species, while unsupervised learning techniques might also prove to be useful.
- Published
- 2024
- Full Text
- View/download PDF
3. The Development of Autonomous Examination Paper Application: A Case Study in UiTM Cawangan Perlis
- Author
-
Noorfaizalfarid Mohd Noor, Izzati Farzana Ibni Amin, and Nadhirah Mohd Napi
- Subjects
algorithm ,automated question paper ,examination ,fisher-yates ,randomization ,Probabilities. Mathematical statistics ,QA273-280 ,Technology ,Technology (General) ,T1-995 - Abstract
Examination is a vital role to measure the capabilities of students in their learning. Hence, generating question paper in an effective way is a decisive job for educators in educational institution. Using traditional method, it is monotonous and time consuming. Today, Autonomous Examination Paper (AEP) is used to produce exam paper. Many researchers have proposed effective AEPs to be used by educators. This paper aims to investigate about AEP development and to construct AEP in UiTM Cawangan Perlis. As a result, Ad-Hoc Question Paper Application (AQPA) has been developed using Fisher-Yates algorithm to generate questions for exam paper in the university. Evaluation based on Perceived Ease of Use (PEOU) and Perceived Usefulness (PU) reveal that lecturers in the university manage to interact with AQPA and willing to use it as a tool to minimize their workload. However, more improvement must be done on AQPA to be an effective AEP. To conclude, AEP brings significance to educators and can be improved with the latest technology.
- Published
- 2019
4. The Development of Autonomous Examination Paper Application: A Case Study in UiTM Cawangan Perlis
- Author
-
Izzati Farzana Ibni Amin, Noorfaizalfarid Mohd Noor, and Nadhirah Mohd Napi
- Subjects
Measure (data warehouse) ,algorithm ,business.industry ,Computer science ,lcsh:T ,Usability ,Workload ,General Medicine ,fisher-yates ,randomization ,Educational institution ,automated question paper ,lcsh:Technology ,Engineering management ,examination ,lcsh:Technology (General) ,lcsh:T1-995 ,lcsh:Probabilities. Mathematical statistics ,Construct (philosophy) ,business ,lcsh:QA273-280 - Abstract
Examination is a vital role to measure the capabilities of students in their learning. Hence, generating question paper in an effective way is a decisive job for educators in educational institution. Using traditional method, it is monotonous and time consuming. Today, Autonomous Examination Paper (AEP) is used to produce exam paper. Many researchers have proposed effective AEPs to be used by educators. This paper aims to investigate about AEP development and to construct AEP in UiTM Cawangan Perlis. As a result, Ad-Hoc Question Paper Application (AQPA) has been developed using Fisher-Yates algorithm to generate questions for exam paper in the university. Evaluation based on Perceived Ease of Use (PEOU) and Perceived Usefulness (PU) reveal that lecturers in the university manage to interact with AQPA and willing to use it as a tool to minimize their workload. However, more improvement must be done on AQPA to be an effective AEP. To conclude, AEP brings significance to educators and can be improved with the latest technology.
- Published
- 2019
5. Overlap Detection in 2D Amorphous Shapes for Paper Optimization in Digital Printing Presses
- Author
-
Rafael Rivera-López, Juan Manuel Rendón-Mancha, Marco Antonio Cruz-Chávez, Yainier Labrada-Nueva, Marta Lilia Eraña-Díaz, and Martín H. Cruz-Rosales
- Subjects
Computer science ,Iterated local search ,General Mathematics ,0211 other engineering and technologies ,resource allocation ,02 engineering and technology ,neighborhood structure ,Reduction (complexity) ,overlaps ,perturbations ,0202 electrical engineering, electronic engineering, information engineering ,Computer Science (miscellaneous) ,QA1-939 ,Engineering (miscellaneous) ,Structure (mathematical logic) ,021103 operations research ,business.industry ,paper waste ,amorphous shapes ,Amorphous solid ,Resource allocation ,020201 artificial intelligence & image processing ,Digital printing ,business ,Algorithm ,Mathematics - Abstract
Paper waste in the mockups design with regular, irregular, and amorphous patterns is a critical problem in digital printing presses. Paper waste reduction directly impacts production costs, generating business and environmental benefits. This problem can be mapped to the two-dimensional irregular bin-packing problem. In this paper, an iterated local search algorithm using a novel neighborhood structure to detect overlaps between amorphous shapes is introduced. This algorithm is used to solve the paper waste problem, modeled as one 2D irregular bin-packing problem. The experimental results show that this approach works efficiently and effectively to detect and correct the overlaps between regular, irregular, and amorphous figures.
- Published
- 2021
6. Scheduling of corrugated paper production
- Author
-
Matsumoto, Kazuki, Miwa, Hiroyoshi, and Ibaraki, Toshihide
- Subjects
Paper industry -- Production data ,Algorithms ,Algorithm ,Business ,Business, general ,Business, international - Abstract
To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ejor.2007.10.019 Byline: Kazuki Matsumoto (a), Hiroyoshi Miwa (b), Toshihide Ibaraki (b) Keywords: Scheduling; Corrugated paper; Complexity; Contiguous set; Integer programming Abstract: Corrugated paper is produced by gluing three types of papers of the same breadth. Given a set of orders, we first assign each order to one of the standard breadths, and then sequence those assigned to each standard breadth so that they are continuously manufactured from the three rolls of the specified standard breadth equipped in the machine called corrugator. Here we are asked to achieve multi-goals of minimizing total length of roll papers, total loss of papers caused by the differences between standard breadths and real breadths of the orders, and the number of machine stops needed during production. We use integer programming to assign orders to standard breadths, and then develop a special purpose algorithm to sequence the orders assigned to each standard breadth. This is a first attempt to handle scheduling problems of the corrugator machine. Author Affiliation: (a) Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Sakyo-ku, Kyoto 606-8501, Japan (b) Department of Informatics, School of Science and Technology, Kwansei Gakuin University, 2-1 Gakuen Sanda, Hyogo 669-1337, Japan Article History: Received 24 March 2007; Accepted 5 October 2007
- Published
- 2009
7. Beyond Dirty Paper Coding for Multi-Antenna Broadcast Channel with Partial CSIT: A Rate-Splitting Approach
- Author
-
Bruno Clerckx and Yijie Mao
- Subjects
Signal Processing (eess.SP) ,FOS: Computer and information sciences ,Computer science ,business.industry ,Information Theory (cs.IT) ,Computer Science - Information Theory ,Transmitter ,020206 networking & telecommunications ,020302 automobile design & engineering ,02 engineering and technology ,Data_CODINGANDINFORMATIONTHEORY ,Interference (wave propagation) ,Precoding ,Noise (electronics) ,0203 mechanical engineering ,Transmission (telecommunications) ,Single antenna interference cancellation ,0202 electrical engineering, electronic engineering, information engineering ,FOS: Electrical engineering, electronic engineering, information engineering ,Wireless ,Dirty paper coding ,Electrical and Electronic Engineering ,Electrical Engineering and Systems Science - Signal Processing ,business ,Algorithm - Abstract
Imperfect Channel State Information at the Transmitter (CSIT) is inevitable in modern wireless communication networks, and results in severe multi-user interference in multi-antenna Broadcast Channel (BC). While the capacity of the multi-antenna (Gaussian) BC with perfect CSIT is known and achieved by Dirty Paper Coding (DPC), the capacity and the capacity-achieving strategy of the multi-antenna BC with imperfect CSIT remain unknown. Conventional approaches therefore rely on applying communication strategies designed for perfect CSIT to the imperfect CSIT setting. In this work, we break this conventional routine and make two major contributions. First, we show that linearly precoded Rate-Splitting (RS), relying on the split of messages into common and private parts and linear precoding at the transmitter, and successive interference cancellation at the receivers, can achieve larger rate regions than DPC in multi-antenna BC with partial CSIT. Second, we propose a novel achievable scheme, denoted as Dirty Paper Coded Rate-Splitting (DPCRS), that relies on RS to split the user messages into common and private parts, and DPC to encode the private parts. We show that the rate region achieved by DPCRS in Multiple-Input Single-Output (MISO) BC with partial CSIT is enlarged beyond that of conventional DPC and that of linearly precoded RS. Gaining benefits from the capability of RS to partially decode the interference and partially treat interference as noise, DPCRS is less sensitive to CSIT inaccuracies, networks loads and user deployments compared with DPC and other existing transmission strategies. The proposed DPCRS acts as a new benchmark and the best-known achievable strategy for multi-antenna BC with partial CSIT., accepted by IEEE transactions on communications for publication
- Published
- 2019
8. Reports Summarize Information and Data Mining Research from Al-Iraqia University (Analysis of H-index and Papers Citation in Computer Science Field using K-Means Clustering Algorithm)
- Subjects
Data mining -- Analysis ,Algorithms -- Analysis ,Data warehousing/data mining ,Algorithm ,Computers - Abstract
2023 MAY 9 (VerticalNews) -- By a News Reporter-Staff News Editor at Information Technology Newsweekly -- Current study results on information and data mining have been published. According to news [...]
- Published
- 2023
9. New Findings from Northeast Forestry University Update Understanding of Information Science (Airank: an Algorithm On Evaluating the Academic Influence of Papers Based On Heterogeneous Academic Network)
- Subjects
Information science ,Algorithms ,Algorithm ,Computers - Abstract
2023 MAR 14 (VerticalNews) -- By a News Reporter-Staff News Editor at Information Technology Newsweekly -- Data detailed on Information Technology - Information Science have been presented. According to news [...]
- Published
- 2023
10. Reports from Zhejiang Normal University Highlight Recent Findings in Engineering Software (Paper Intrusion Detection Approach for Cloud and Iot Environments Using Deep Learning and Capuchin Search Algorithm)
- Subjects
Engineering -- Computer programs ,Security software ,Algorithms ,Network security software ,Algorithm ,Engineering software ,Computers ,News, opinion and commentary - Abstract
2023 MAR 8 (VerticalNews) -- By a News Reporter-Staff News Editor at Computer Weekly News -- Current study results on Engineering - Engineering Software have been published. According to news [...]
- Published
- 2023
11. Performance of two multiscale texture algorithms in classifying silver gelatine paper via k-nearest neighbors
- Author
-
Herwig Wendt, Andrew G. Klein, Kirsten R. Basinet, Patrice Abry, Paul Messier, Stéphane Roux, Centre National de la Recherche Scientifique - CNRS (FRANCE), Ecole Normale Supérieure de Lyon - ENS de Lyon (FRANCE), Institut National Polytechnique de Toulouse - INPT (FRANCE), Université Toulouse III - Paul Sabatier - UT3 (FRANCE), Université Toulouse - Jean Jaurès - UT2J (FRANCE), Université Toulouse 1 Capitole - UT1 (FRANCE), Université Claude Bernard-Lyon I - UCBL (FRANCE), Université de Lyon - UDL (FRANCE), Western Washington University - WWU (USA), Yale University (USA), Laboratoire de Physique (Lyon, France), Western Washington University (WWU), Laboratoire de Physique de l'ENS Lyon (Phys-ENS), École normale supérieure - Lyon (ENS Lyon)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon, CoMputational imagINg anD viSion (IRIT-MINDS), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, Centre National de la Recherche Scientifique (CNRS), Department of Electrical Engineering, College of Engineering, Qatar University, PO BOX 2713, Doha, Qatar, Qatar University, École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Toulouse Mind & Brain Institut (TMBI), Université Toulouse - Jean Jaurès (UT2J), Université de Toulouse (UT)-Université de Toulouse (UT)-Université Toulouse III - Paul Sabatier (UT3), Université de Toulouse (UT)-Université Toulouse Capitole (UT Capitole), Université de Toulouse (UT), and Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE)
- Subjects
Photographic paper ,Computer science ,020206 networking & telecommunications ,Context (language use) ,02 engineering and technology ,Intelligence artificielle ,k-nearest neighbors algorithm ,Visualization ,[INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI] ,Data set ,Texture similarity ,Statistical classification ,Similarity (network science) ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Crowd-sourcing ,Algorithm ,Multiscale analysis - Abstract
International audience; As part of the Historic Photographic Paper Classification Challenge, a multitude of approaches to quantifying paper texture similarity have been developed. These approaches have yielded encouraging results when applied to very controlled datasets containing photomicrographs of familiar specimens. In this paper, we report on the k-nearest neighbors classification performance of two multiscale analysis-based texture similarity approaches when applied to a much larger reference collection of silver gelatin photographic papers. The clusters for this data set were derived from a visual sorting experiment conducted by art conservators and paper experts later extended through crowd-sourcing. The results show that these texture similarity approaches, when combined with a simple k-nearest neighbors classification algorithm, yield workable performances with accuracy of up to 69%. We discuss this outcome in the context of available data and the cross-validation procedure used, then provide suggestions for improvement.
- Published
- 2018
12. The effect of flexible lead times on a paper producer
- Author
-
Bjork, Kaj-Mikael and Carlsson, Christer
- Subjects
Algorithms -- Analysis ,Paper industry -- Analysis ,Algorithm ,Business ,Business, international ,Engineering and manufacturing industries - Abstract
Current competitive conditions in the paper markets have forced the producers to look for new ways of reducing their inventory. However, too often the production planning and inventory management are decoupled activities. Coordination between these activities needs to be done in order to successfully decrease the inventories at hand, especially when considering the characteristics of a special business context, the paper making industry. Also, flexibility is of great importance in a production-distribution network. There is an ongoing debate about who should provide the flexibility and in what form. We believe that the flexibility should be in the form of flexible lead times towards the producer and not--as is the tradition--among the distributors. But even if such an agreement with the lead times is made, it is not trivially selfevident how to use the flexibility in the fight way in order to get an optimal improvement of operations. In this paper, two sets of mixed integer linear programming models with a fixed time-horizon will be presented: one combined production and inventory model (for the producer) with fixed lead times and one with flexible lead times. The models are solved with both an MILP-solver and a genetic algorithm. The data is obtained from a Nordic tissue producer in order to test the models and to quantify the effects of flexible lead-times on a producer's production and inventory costs. Keywords: Flexible lead times; Production-distribution optimization; MILP; Genetic algorithm
- Published
- 2007
13. Short Paper: An Empirical Analysis of Blockchain Forks in Bitcoin
- Author
-
Till Neudecker and Hannes Hartenstein
- Subjects
050101 languages & linguistics ,Blockchain ,Computer science ,05 social sciences ,Short paper ,DATA processing & computer science ,Process (computing) ,02 engineering and technology ,Propagation delay ,Order (exchange) ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,0501 psychology and cognitive sciences ,Fork (file system) ,Latency (engineering) ,ddc:004 ,Algorithm ,Block (data storage) - Abstract
Temporary blockchain forks are part of the regular consensus process in permissionless blockchains such as Bitcoin. As forks can be caused by numerous factors such as latency and miner behavior, their analysis provides insights into these factors, which are otherwise unknown. In this paper we provide an empirical analysis of the announcement and propagation of blocks that led to forks of the Bitcoin blockchain. By analyzing the time differences in the publication of competing blocks, we show that the block propagation delay between miners can be of similar order as the block propagation delay of the average Bitcoin peer. Furthermore, we show that the probability of a block to become part of the main chain increases roughly linearly in the time the block has been published before the competing block. Additionally, we show that the observed frequency of short block intervals between two consecutive blocks mined by the same miner after a fork is conspicuously large. While selfish mining can be a cause for this observation, other causes are also possible. Finally, we show that not only the time difference of the publication of competing blocks but also their propagation speeds vary greatly.
- Published
- 2019
14. Management of adverse events associated with idelalisib treatment in chronic lymphocytic leukemia and follicular lymphoma: A multidisciplinary position paper
- Author
-
Pier Luigi Zinzani, Stefano Fagiuoli, Paolo Ghia, Antonio Cuneo, Giovanni Barosi, Alfredo Marzano, Romano Danesi, Pierluigi Viale, Marco Montillo, Venerino Poletti, Cuneo, Antonio, Barosi, Giovanni, Danesi, Romano, Fagiuoli, Stefano, Ghia, Paolo, Marzano, Alfredo, Montillo, Marco, Poletti, Venerino, Viale, Pierluigi, Zinzani, Pier Luigi, Cuneo, A, Barosi, G, Danesi, R, Fagiuoli, S, Ghia, P, Marzano, A, Montillo, M, Poletti, V, Viale, P, and Zinzani, P
- Subjects
Oncology ,Cancer Research ,Adverse events ,chronic lymphocytic leukemia ,follicular lymphoma ,idelalisib ,Chronic lymphocytic leukemia ,adverse event ,Follicular lymphoma ,Review ,Antineoplastic Agent ,0302 clinical medicine ,hemic and lymphatic diseases ,Antineoplastic Combined Chemotherapy Protocols ,Cytochrome P-450 CYP3A ,Drug Interactions ,Disease management (health) ,Lymphoma, Follicular ,Disease Management ,Hematology ,General Medicine ,Colitis ,Algorithm ,Aldehyde Oxidase ,Drug Interaction ,030220 oncology & carcinogenesis ,Idelalisib ,Algorithms ,Human ,Diarrhea ,medicine.medical_specialty ,Reviews ,Antineoplastic Agents ,Quinazolinone ,NO ,03 medical and health sciences ,Internal medicine ,medicine ,Animals ,Humans ,Clinical significance ,Adverse effect ,Purine ,Quinazolinones ,Pneumonitis ,adverse events ,Antineoplastic Combined Chemotherapy Protocol ,Animal ,business.industry ,medicine.disease ,Leukemia, Lymphocytic, Chronic, B-Cell ,Purines ,Position paper ,business ,Coliti ,030215 immunology - Abstract
The introduction of new therapeutic agents in chronic lymphocytic leukemia (CLL) and follicular lymphoma (FL), including the new kinase inhibitor idelalisib, has changed the therapeutic landscape of these diseases. However, the use of idelalisib is associated with a peculiar profile of side effects, which require an optimization of the current approach to prophylaxis and supportive treatment. Moving from the recognition that the abovementioned issue represents an unmet need in CLL and FL, a multidisciplinary panel of experts was convened to produce a consensus document aiming to provide practical recommendations for the management of the side effects during idelalisib therapy for CLL and FL. The present publication represents a consensus document from a series of meetings held during 2017. The Panel generated clinical key questions using the criterion of clinical relevance through a Delphi process and explored 4 domains, ie, diarrhea/colitis, transaminitis, pneumonitis, and infectious complications. Using the consensus method, the Panel was able to shape recommendations which may assist hematologist to minimize adverse events and guarantee adherence to treatment in patients with CLL and FL candidate to receive idelalisib.
- Published
- 2019
15. Paper may hint at new helicopter for carriers; Mainland engineers publish research on algorithms for landing safety in tilt-rotor craft
- Author
-
Chan, Minnie
- Subjects
Aerospace engineering -- Research -- Safety and security measures ,Aircraft carriers -- Research -- Safety and security measures ,Shipbuilding industry -- Safety and security measures -- Research ,Algorithms -- Safety and security measures -- Research ,Periodical publishing -- Research -- Safety and security measures ,Algorithm ,News, opinion and commentary - Abstract
There are signs China could be developing a new type of helicopter for its aircraft carriers, with the publication of research by a group of Chinese engineers on an algorithm [...]
- Published
- 2021
16. Reports Outline Machine Learning Study Results from Jinan University (The predictive effect of different machine learning algorithms for pressure injuries in hospitalized patients: A network meta-analysesWhat is already knownWhat this paper adds)
- Subjects
Artificial intelligence -- Reports -- Research ,Machine learning -- Reports -- Research ,Data mining -- Research -- Reports ,Hospital patients -- Reports -- Research ,Algorithms -- Research -- Reports ,Data warehousing/data mining ,Algorithm ,Artificial intelligence ,Health - Abstract
2022 NOV 21 (NewsRx) -- By a News Reporter-Staff News Editor at Clinical Trials Week -- New study results on artificial intelligence have been published. According to news reporting originating [...]
- Published
- 2022
17. A Parameterization Approach for the Dielectric Response Model of Oil Paper Insulation Using FDS Measurements
- Author
-
Lijun Yang, Ran Liman, Peng He, Chao Wei, Youyuan Wang, Feng Yang, and Lin Du
- Subjects
Control and Optimization ,Akaike’s information criterion ,Frequency band ,020209 energy ,Energy Engineering and Power Technology ,02 engineering and technology ,01 natural sciences ,Capacitance ,dielectric response ,lcsh:Technology ,oil paper insulation ,frequency domain spectroscopy ,extended Debye model ,parameterization ,syncretic algorithm ,Goodness of fit ,0103 physical sciences ,0202 electrical engineering, electronic engineering, information engineering ,Time domain ,Electrical and Electronic Engineering ,Engineering (miscellaneous) ,Mathematics ,010302 applied physics ,Renewable Energy, Sustainability and the Environment ,lcsh:T ,Transformation (function) ,Akaike information criterion ,Algorithm ,Energy (signal processing) ,Energy (miscellaneous) ,Voltage - Abstract
To facilitate better interpretation of dielectric response measurements—thereby directing numerical evidence for condition assessments of oil-paper-insulated equipment in high-voltage alternating current (HVAC) transmission systems—a novel approach is presented to estimate the parameters in the extended Debye model (EDM) using wideband frequency domain spectroscopy (FDS). A syncretic algorithm that integrates a genetic algorithm (GA) and the Levenberg-Marquardt (L-M) algorithm is introduced in the present study to parameterize EDM using the FDS measurements of a real-life 126 kV oil-impregnated paper (OIP) bushing under different controlled temperatures. As for the uncertainty of the EDM structure due to variable branch quantity, Akaike’s information criterion (AIC) is employed to determine the model orders. For verification, comparative analysis of FDS reconstruction and results of FDS transformation to polarization–depolarization current (PDC)/return voltage measurement (RVM) are presented. The comparison demonstrates good agreement between the measured and reconstructed spectroscopies of complex capacitance and tan δ over the full tested frequency band (10−4 Hz–103 Hz) with goodness of fit over 0.99. Deviations between the tested and modelled PDC/RVM from FDS are then discussed. Compared with the previous studies to parameterize the model using time domain dielectric responses, the proposed method solves the problematic matching between EDM and FDS especially in a wide frequency band, and therefore assures a basis for quantitative insulation condition assessment of OIP-insulated apparatus in energy systems.
- Published
- 2018
18. Airsense-to-act: A concept paper for covid-19 countermeasures based on artificial intelligence algorithms and multi-source data processing
- Author
-
Gianluca Di Cosmo, Francesco Mauro, Fabrizio Passarini, Marco Carminati, Silvia Liberata Ullo, Alessandro Sebastianelli, Sebastianelli A., Mauro F., Di Cosmo G., Passarini F., Carminati M., and Ullo S.L.
- Subjects
FOS: Computer and information sciences ,Decision support system ,Artificial intelligence ,Pollutants ,Sensor networks ,010504 meteorology & atmospheric sciences ,Computer science ,Process (engineering) ,Geography, Planning and Development ,lcsh:G1-922 ,Cloud computing ,010501 environmental sciences ,Safeguarding ,Pollutant ,01 natural sciences ,Microanalysi ,Computer Science - Computers and Society ,Microanalysis ,Satellite remote sensing ,Computers and Society (cs.CY) ,Earth and Planetary Sciences (miscellaneous) ,Computers in Earth Sciences ,Risk levels ,COVID-19 counteractions ,0105 earth and related environmental sciences ,Artificial neural network ,business.industry ,Mechanism (biology) ,COVID-19 counteraction ,Macroanalysis ,Long short term memory neural network ,Crowding ,Risk level ,Macroanalysi ,Air quality ,Environmental chemistry ,Anthropogenic activities ,business ,Anthropogenic activitie ,Wireless sensor network ,Algorithm ,lcsh:Geography (General) - Abstract
The aim of this concept paper is the description of a new tool to support institutions in the implementation of targeted countermeasures, based on quantitative and multi-scale elements, for the fight and prevention of emergencies, such as the current COVID-19 pandemic. The tool is a cloud-based centralized system, a multi-user platform that relies on artificial intelligence (AI) algorithms for the processing of heterogeneous data, which can produce as an output the level of risk. The model includes a specific neural network which is first trained to learn the correlations between selected inputs, related to the case of interest: environmental variables (chemical&ndash, physical, such as meteorological), human activity (such as traffic and crowding), level of pollution (in particular the concentration of particulate matter) and epidemiological variables related to the evolution of the contagion. The tool realized in the first phase of the project will serve later both as a decision support system (DSS) with predictive capacity, when fed by the actual measured data, and as a simulation bench performing the tuning of certain input values, to identify which of them led to a decrease in the degree of risk. In this way, we aimed to design different scenarios to compare different restrictive strategies and the actual expected benefits, to adopt measures sized to the actual needs, adapted to the specific areas of analysis and useful for safeguarding human health, and we compared the economic and social impacts of the choices. Although ours is a concept paper, some preliminary analyses have been shown, and two different case studies are presented, whose results have highlighted a correlation between NO2, mobility and COVID-19 data. However, given the complexity of the virus diffusion mechanism, linked to air pollutants but also to many other factors, these preliminary studies confirmed the need, on the one hand, to carry out more in-depth analyses, and on the other, to use AI algorithms to capture the hidden relationships among the huge amounts of data to process.
- Published
- 2021
19. Research from School of Information Engineering Has Provided New Study Findings on Multimedia (Research on the Fusion of Hybrid Fuzzy Clustering Algorithm and Computer Automatic Test Paper Composition Algorithm)
- Subjects
Algorithms -- Research -- Reports ,Algorithm ,Computers ,News, opinion and commentary - Abstract
2022 JUL 13 (VerticalNews) -- By a News Reporter-Staff News Editor at Computer Weekly News -- New research on multimedia is the subject of a new report. According to news [...]
- Published
- 2022
20. Algorithmic accountability: robodebt and the making of welfare cheats
- Author
-
Nikidehaghani, Mona, Andrew, Jane, and Cortese, Corinne
- Published
- 2023
- Full Text
- View/download PDF
21. The first 25 years of the FPL conference: Significant papers
- Author
-
Jason H. Anderson, João M. P. Cardoso, Guy Gogniat, JunKyu Lee, Hayden K.-H. So, Tero Rissa, Patrick Lysaght, Hideharu Amano, Philip H. W. Leong, Oliver Diessel, Koen Bertels, Yu Wang, Wayne Luk, Michael D. Hutton, Marco Platzner, Cristina Silvano, Viktor K. Prasanna, Engineering & Physical Science Research Council (E, Commission of the European Communities, and Engineering & Physical Science Research Council (EPSRC)
- Subjects
Technology ,General Computer Science ,Field (physics) ,Computer science ,Significant papers ,02 engineering and technology ,25 years ,Reconfigurable logic and FPGA ,01 natural sciences ,INTRUSION DETECTION ,Reconfigurable computing ,Field-programmable logic and applications ,0103 physical sciences ,0202 electrical engineering, electronic engineering, information engineering ,Computer Science, Hardware & Architecture ,FPGA ,010302 applied physics ,ARCHITECTURE ,1006 Computer Hardware ,Science & Technology ,CHIP ,RECONFIGURABLE SYSTEMS ,PROGRAMMABLE GATE ARRAYS ,020202 computer hardware & architecture ,NETWORKS ,Computer engineering ,Computer Science ,Algorithm ,FPL ,HARDWARE - Abstract
A summary of contributions made by significant papers from the first 25 years of the Field-Programmable Logic and Applications conference (FPL) is presented. The 27 papers chosen represent those which have most strongly influenced theory and practice in the field.
- Published
- 2017
22. Supplemental data for the paper 'low-complexity detection of small frequency deviations by the generalized LMPU test'
- Author
-
Eyal Levy and Tirza Routtenberg
- Subjects
General method ,Computer science ,Nuisance parameters ,Matlab code ,Notation ,lcsh:Computer applications to medicine. Medical informatics ,Low complexity ,Unbiased test ,03 medical and health sciences ,0302 clinical medicine ,Low-complexity methods ,Special case ,lcsh:Science (General) ,030304 developmental biology ,Data Article ,0303 health sciences ,Signal processing ,Multidisciplinary ,Frequency deviation ,Test (assessment) ,Locally most powerful ,lcsh:R858-859.7 ,Algorithm ,030217 neurology & neurosurgery ,lcsh:Q1-390 - Abstract
This document contains supplemental material for the paper [2] . The notations in this document are the same as in [2] . In particular, we first present here the proof of Theorem 1 in [2] . This theorem expresses the locally most powerful unbiased (LMPU) test, which is a general method for local detection, in the presence of known nuisance parameters. Second, we present here the Matlab code of the LMPU and the generalized LMPU for the special case of detection of a small deviation in the frequency of sinusoidal signals, which arises in various signal processing applications.
- Published
- 2021
23. Learning regularization parameters of inverse problems via deep neural networks:Paper
- Author
-
Julianne Chung, Matthias Chung, and Babak Maboudi Afkham
- Subjects
FOS: Computer and information sciences ,Computer Science - Machine Learning ,Bilevel optimization ,010103 numerical & computational mathematics ,01 natural sciences ,Regularization (mathematics) ,Theoretical Computer Science ,Machine Learning (cs.LG) ,Bayes' theorem ,Design objective ,Deep neural networks ,Regularization ,FOS: Mathematics ,Mathematics - Numerical Analysis ,0101 mathematics ,Representation (mathematics) ,Mathematical Physics ,Mathematics ,Applied Mathematics ,Supervised learning ,Deep learning ,Numerical Analysis (math.NA) ,Inverse problem ,Computer Science Applications ,010101 applied mathematics ,Optimal experimental design ,Signal Processing ,Minification ,Algorithm ,Hyperparameter selection - Abstract
In this work, we describe a new approach that uses deep neural networks (DNN) to obtain regularization parameters for solving inverse problems. We consider a supervised learning approach, where a network is trained to approximate the mapping from observation data to regularization parameters. Once the network is trained, regularization parameters for newly obtained data can be computed by efficient forward propagation of the DNN. We show that a wide variety of regularization functionals, forward models, and noise models may be considered. The network-obtained regularization parameters can be computed more efficiently and may even lead to more accurate solutions compared to existing regularization parameter selection methods. We emphasize that the key advantage of using DNNs for learning regularization parameters, compared to previous works on learning via optimal experimental design or empirical Bayes risk minimization, is greater generalizability. That is, rather than computing one set of parameters that is optimal with respect to one particular design objective, DNN-computed regularization parameters are tailored to the specific features or properties of the newly observed data. Thus, our approach may better handle cases where the observation is not a close representation of the training set. Furthermore, we avoid the need for expensive and challenging bilevel optimization methods as utilized in other existing training approaches. Numerical results demonstrate the potential of using DNNs to learn regularization parameters., 27 pages, 16 figures
- Published
- 2021
24. National Heart Lung and Blood Institute (NHLBI) Reports Findings in Healthcare Information Technology (Use of a community advisory board to build equitable algorithms for participation in clinical trials: a protocol paper for HoPeNET)
- Subjects
Medical informatics -- Usage -- Reports ,Cardiovascular equipment -- Product development -- Usage ,Clinical trials -- Usage -- Reports ,Machine learning -- Reports -- Usage ,Medical advice systems -- Product development -- Usage ,Algorithms -- Reports -- Usage ,Algorithm ,Computers - Abstract
2022 MAR 8 (VerticalNews) -- By a News Reporter-Staff News Editor at Information Technology Newsweekly -- New research on Information Technology - Healthcare Information Technology is the subject of a [...]
- Published
- 2022
25. Microwave (8-50 GHz) characterization of multiwalled carbon nanotube papers using rectangular waveguides
- Author
-
Wang, Lu, Zhou, Rongguo, and Xin, Hao
- Subjects
Algorithms -- Methods ,Waveguides -- Properties ,Nanotubes -- Properties ,Algorithm ,Business ,Computers ,Electronics ,Electronics and electrical industries - Abstract
Multiwalled carbon nanotubes (MWNTs) are characterized at X., Ku-, Ka-, and Q-bands by rectangular waveguide measurements. The scattering parameters (S-parameters) of thin MWNT papers containing a large ensemble of randomly oriented nanotubes are measured by a vector network analyzer from 8 to 50 GHz. A rigorous extraction algorithm has been developed to compute the effective complex permittivity ([epsilon] = [epsilon]' - [epsilon]') and permeability ([mu] = [mu]' - j[mu]') of the nanotube papers from the measured S-parameters. The extracted effective medium parameters are verified by finite-element simulations using Ansoft's High Frequency Structure Simulator (HFSS). The uncertainties for this characterization method are analyzed. The systematic uncertainties are found larger at lower frequencies than at higher frequencies. The extracted conductivity of the nanotube papers is in the range of 810-1500 S/m and the dielectric constant is from 250 to 700. The extracted complex permittivity can be fitted with the Drude-Lorentz model for the 8-50-GHz frequency range. The effective medium theory is then applied to remove the impact of air in the nanotube paper. Index Terms--Conductivity, Drude-Lorentz model, Drude model, effective medium theory, multiwalled carbon nanotube (MWNT), permeability, permittivity, waveguide.
- Published
- 2008
26. SciPy 1.0: fundamental algorithms for scientific computing in Python: 24 February 2020 : An amendment to this paper has been published and can be accessed via a link at the top of the paper
- Author
-
Virtanen, P., Gommers, R., Oliphant, T.E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., Walt, S.J., Brett, M., Wilson, J., Millman, K.J., Mayorov, N., Nelson, A.R.J., Jones, E., Kern, R., Larson, E., Carey, C.J., Polat, I., Feng, Y., Moore, E.W., VanderPlas, J., Laxalde, D., Perktold, J., Cimrman, R., Henriksen, I., Quintero, E.A., Harris, C.R., Archibald, A.M., Ribeiro, A.H., Pedregosa, F., Mulbregt, P., Vijaykumar, A., Bardelli, A.P., Rothberg, A., Hilboll, A., Kloeckner, A., Scopatz, A., Lee, A., Rokem, A., Woods, C.N., Fulton, C., Masson, C., Häggström, C., Fitzgerald, C., Nicholson, D.A., Hagen, D.R., Pasechnik, D.V., Olivetti, E., Martin, E., Wieser, E., Lenders, F., Silva, Fabrice, Wilhelm, F., Young, G., Price, G.A., Ingold, G.-L., Allen, G.E., Lee, G.R., Audren, H., Probst, Irvin, Dietrich, J.P., Silterra, J., Webber, J.T., Slavič, J., Nothman, J., Buchner, J., Kulick, J., Schönberger, J.L., Miranda Cardoso, J.V., Reimer, J., Harrington, J., Rodríguez, J.L.C., Nunez-Iglesias, J., Kuczynski, J., Tritz, K., Thoma, M., Newville, M., Kümmerer, M., Bolingbroke, M., Tartre, M., Pak, M., Smith, N.J., Nowaczyk, N., Shebanov, N., Pavlyk, O., Brodtkorb, P.A., Lee, P., McGibbon, R.T., Feldbauer, R., Lewis, S., Tygier, S., Sievert, S., Vigna, S., Peterson, S., More, S., Pudlik, T., Oshima, T., Pingel, T.J., Robitaille, T.P., Spura, T., Jones, T.R., Cera, T., Leslie, T., Zito, T., Krauss, T., Upadhyay, U., Halchenko, Y.O., Vázquez-Baeza, Y., SciPy 1.0, Contributors, Low Temperature Laboratory, TKK Helsinki University of Technology (TKK), Centre Interdisciplinaire de Nanoscience de Marseille (CINaM), Aix Marseille Université (AMU)-Centre National de la Recherche Scientifique (CNRS), Laboratoire de Tribologie et Dynamique des Systèmes (LTDS), École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-École Nationale des Travaux Publics de l'État (ENTPE)-Ecole Nationale d'Ingénieurs de Saint Etienne-Centre National de la Recherche Scientifique (CNRS), SNECMA Villaroche [Moissy-Cramayel], Safran Group, New Technologies Research Centre [Plzeň] (NTC), University of West Bohemia [Plzeň ], Institute of Environmental Physics [Bremen] (IUP), University of Bremen, Istituto Nazionale di Ricerca Metrologica (INRiM), Laboratoire Chrono-environnement - CNRS - UBFC (UMR 6249) (LCE), Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC), Laboratoire de Mécanique et d'Acoustique [Marseille] (LMA ), Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS), Sons, Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS), European Synchrotron Radiation Facility (ESRF), Lab-STICC_ENSTAB_CID_PRASYS, Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT), Max Planck Institute for Solar System Research (MPS), Max-Planck-Gesellschaft, University of Chicago, Consortium of Advanced Radiation Sciences, Advanced Photon Source, GSECARS, University of Chicago, Laboratoire de physique des gaz et des plasmas (LPGP), Université Paris-Sud - Paris 11 (UP11)-Centre National de la Recherche Scientifique (CNRS), The Open University [Milton Keynes] (OU), Nobeyama Radio Observatory, Gommers, Ralf [0000-0002-0300-3333], Haberland, Matt [0000-0003-4806-3601], Reddy, Tyler [0000-0003-2364-6157], van der Walt, Stéfan J. [0000-0001-9276-1891], Millman, K. Jarrod [0000-0002-5263-5070], Nelson, Andrew R. J. [0000-0002-4548-3558], Laxalde, Denis [0000-0002-5540-4825], Ribeiro, Antônio H. [0000-0003-3632-8529], van Mulbregt, Paul [0000-0002-2382-8308], Apollo - University of Cambridge Repository, van der Walt, Stéfan J [0000-0001-9276-1891], Millman, K Jarrod [0000-0002-5263-5070], Nelson, Andrew RJ [0000-0002-4548-3558], Ribeiro, Antônio H [0000-0003-3632-8529], Quansight LLC, California Polytechnic State University [San Luis Obispo] (CAL POLY), Los Alamos National Laboratory (LANL), AUTRES, National Research University Higher School of Economics [St. Petersburg], Tallinn Technical University, University of California [Berkeley] (UC Berkeley), University of California (UC), University of Birmingham [Birmingham], Skolkovo Innovation Center, Australian Nuclear Science and Technology Organisation [Australie] (ANSTO), Enthought Inc, University of Washington [Seattle], University of Massachusetts [Amherst] (UMass Amherst), University of Massachusetts System (UMASS), Bruker BioSpin Corporation, Université de Lyon-Université de Lyon-École Nationale des Travaux Publics de l'État (ENTPE)-Ecole Nationale d'Ingénieurs de Saint Etienne (ENISE)-Centre National de la Recherche Scientifique (CNRS), University of Texas at Austin [Austin], Astronomical Institute Anton Pannekoek (AI PANNEKOEK), University of Amsterdam [Amsterdam] (UvA), Universidade Federal de Minas Gerais [Belo Horizonte] (UFMG), Google LLC, Laboratoire Chrono-environnement (UMR 6249) (LCE), École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-IMT Atlantique (IMT Atlantique), and Max-Planck-Institut für Sonnensystemforschung = Max Planck Institute for Solar System Research (MPS)
- Subjects
FOS: Computer and information sciences ,Computer science ,01 natural sciences ,Biochemistry ,Computer Science - Software Engineering ,631/45/56 ,Data Structures and Algorithms (cs.DS) ,010303 astronomy & astrophysics ,computer.programming_language ,0303 health sciences ,Signal processing ,Signal Processing, Computer-Assisted ,Computational Physics (physics.comp-ph) ,ddc ,Linear algebra ,Perspective ,Minification ,Physics - Computational Physics ,Algorithm ,Algorithms ,Biotechnology ,De facto standard ,FOS: Physical sciences ,Image processing ,History, 21st Century ,Models, Biological ,706/703/559 ,Python (Computer program language) ,Computational science ,03 medical and health sciences ,Computer Science - Data Structures and Algorithms ,0103 physical sciences ,Computer Simulation ,[INFO]Computer Science [cs] ,ddc:530 ,Cluster analysis ,Molecular Biology ,Scientific computing ,030304 developmental biology ,Sparse matrix ,software ,Computational Biology ,Cell Biology ,Python (programming language) ,History, 20th Century ,[INFO.INFO-NA]Computer Science [cs]/Numerical Analysis [cs.NA] ,Software Engineering (cs.SE) ,Nonlinear Dynamics ,Linear Models ,Computer Science - Mathematical Software ,Programming Languages ,631/114 ,computer ,Mathematical Software (cs.MS) ,Python - Abstract
SciPy is an open source scientific computing library for the Python programming language. SciPy 1.0 was released in late 2017, about 16 years after the original version 0.1 release. SciPy has become a de facto standard for leveraging scientific algorithms in the Python programming language, with more than 600 unique code contributors, thousands of dependent packages, over 100,000 dependent repositories, and millions of downloads per year. This includes usage of SciPy in almost half of all machine learning projects on GitHub, and usage by high profile projects including LIGO gravitational wave analysis and creation of the first-ever image of a black hole (M87). The library includes functionality spanning clustering, Fourier transforms, integration, interpolation, file I/O, linear algebra, image processing, orthogonal distance regression, minimization algorithms, signal processing, sparse matrix handling, computational geometry, and statistics. In this work, we provide an overview of the capabilities and development practices of the SciPy library and highlight some recent technical developments., Comment: Article source data is available here: https://github.com/scipy/scipy-articles
- Published
- 2020
27. Dynamic and vibration analysis of a multimotor dc drive system with elastic shafts driving a tissue paper machine
- Author
-
Michael, Costas A. and Safacas, Athanasios N.
- Subjects
Algorithms -- Analysis ,Direct current electric motors -- Analysis ,Algorithm ,Business ,Computers ,Electronics ,Electronics and electrical industries - Abstract
In this paper, the influence of the stiffness and damping of real elastic shafts on the behavior of a multidrive system driving a tissue paper machine is investigated. The drive system consists of four dc motors, where two of them drive the Yankee drying cylinder and the other two drive the presses section. Six-pulse thyristor bridge power converters that are connected to the same power transformer supply the motors. The inertias of the motors and the driven machines, in conjunction with the shaft stiffness, form mechanical resonators. Thus, resonance phenomena may occur, which may lead to undesirable results. This particular case results to two three-mass and one five-mass systems. This paper presents an analysis of the resonance frequencies of two sections of the machine during startup and machine production, considering the shaft stiffness (shaft diameter, length, and thickness). The elastic shafts eliminate the ripple of the motor electromagnetic torque, which is transferred to the driven machine. The behavior of elastic shafts with different stiffness in the transmission system is studied. Moreover, the steady state and dynamic behavior of the system considering the influence of the elastic shafts and vibration analysis were investigated using simulation. A model algorithm for system simulation was developed using the MATLAB/SIMULINK software. Characteristic simulation results are presented and are expressed in terms of speed and torque response. Considering the resonance frequency analysis and simulation results, mechanical design guidelines can be given for the most significant drive components in order to avoid torsional oscillation resonance phenomena and minimize torsional oscillations of the drive system. Index Terms--Current and torque control, dc motor drives, modeling, pulp and paper industry, resonance, simulation, vibrations.
- Published
- 2007
28. Boris Johnson's 'mutant' planning algorithm could scar England for ever; A Dominic Cummings-influenced white paper throws land open to uncontrolled building -- but could spark a Tory revolt
- Subjects
Algorithms ,Algorithm ,News, opinion and commentary - Abstract
Byline: Simon Jenkins When Dominic Cummings stormed out of Downing Street earlier this month he left behind a time bomb more explosive than any pandemic recession or no-deal Brexit. Those [...]
- Published
- 2020
29. Robust sheet tension estimation for paper winders
- Author
-
Valenzuela, M. Anibal, Carrasco, Rodrigo, and Sbarbaro, Daniel
- Subjects
Control systems -- Analysis ,Algorithms -- Analysis ,Algorithm ,Business ,Computers ,Electronics ,Electronics and electrical industries - Abstract
This paper proposes and evaluates two robust sheet tension estimation algorithms based on unwind and rewind variables, respectively. The proper sheet tension estimation is guaranteed by a continuous monitoring of the differences between the actual estimated values and the values predicted from the last calibration of the estimation parameters. The evaluation was performed with the aid of a developed winder emulator that allowed the offline testing in a real-time field environment, including the initial setting of the estimation constants, and evaluation of both four-and six-shipping-roll cycles. The sheet tension estimation results confirm the precise and stable operation of the proposed robust estimation algorithms, in tests conducted with signals from a winder model, and with tests involving actual field signals from an operational winder. Index Terms--Sensorless tension control, tension control, tension estimation, winder drives.
- Published
- 2008
30. Planning and optimizing the maintenance of paper production systems in a paper plant
- Author
-
Sachdeva, Anish, Kumar, Dinesh, and Kumar, Pradeep
- Subjects
Algorithm ,Mathematical optimization -- Analysis ,Algorithms -- Analysis - Abstract
Manufacturing and production plants operate physical assets that deteriorate with usage and time, thus, maintenance actions are required to restore the assets back to their original predetermined operational conditions. But since, organizational resources are limited and scarce. The objective of an effective maintenance program is to minimize total cost of inspection and repair, and equipment downtime. In this paper, we describe a new multi-criteria optimization framework for deriving optimal maintenance schedules for preventive maintenance which considers availability, maintenance cost and life cycle costs as the criteria for optimization. The Simulink toolbox of the Matlab has been interfaced with Genetic algorithm for optimization. After getting solution, Stochastic Petri nets has been used to model the system and find out the effect of optimized maintenance schedules on system performance. The application of the proposed framework has been discussed on a practical case of a paper plant. Keywords: Preventive maintenance Availability Life cycle cost Maintenance planning Simulink Petri nets
- Published
- 2008
31. Republished Paper. Multiple damage detection and localization in beam-like and complex structures using co-ordinate modal assurance criterion combined with firefly and genetic algorithms
- Author
-
MagdĀ AbdelĀ Wahab, SamirĀ Khatir, AbdelwahhabĀ Khatir, and MohamedĀ Tehami
- Subjects
Engineering ,coordinate modal assurance criterion ,lcsh:Mechanical engineering and machinery ,02 engineering and technology ,finite element analysis ,01 natural sciences ,0203 mechanical engineering ,Simple (abstract algebra) ,0103 physical sciences ,Genetic algorithm ,genetic algorithm ,General Materials Science ,Firefly algorithm ,lcsh:TJ1-1570 ,010301 acoustics ,business.industry ,Mechanical Engineering ,Frame (networking) ,firefly algorithm ,Finite element method ,Noise ,020303 mechanical engineering & transports ,Modal ,Rate of convergence ,business ,Algorithm ,damage detection and localization ,two-dimensional frame structure ,optimization - Abstract
Damage detection and localization in civil engineering constructions using dynamic analysis has become an important topic in recent years. This paper presents a methodology based on non-destructive detection, localization and quantification of multiple damages in simple and continuous beams, and a more complex structure, namely two-dimensional frame structure. The proposed methodology makes used of Firefly Algorithm and Genetic Algorithm as optimization tools and the Coordinate Modal Assurance Criterion as an objective function. The results show that the proposed combination of Coordinate Modal Assurance Criterion and Firefly Algorithm or Genetic Algorithm can be easily used to identify multiple local structural damages in complex structures. However, the convergence rate becomes slower for the case of multiple damages compared to the case of single damage. The effect of noise on the algorithm is further investigated. It is found that the proposed technique is able to detect the damage location and its severity with high accuracy in the presence of noise, although the convergence rate became slower than in the case when no noise is present. It is also found that the convergence rate of Firefly Algorithm is much faster than that of Genetic Algorithm.
- Published
- 2018
32. Topic Modeling and Classification of Cyberspace Papers Using Text Mining
- Author
-
Sohrabi, Babak, Vanani, Iman Raeesi, and Shineh, Mohsen Baranizade
- Subjects
cyberspace ,Text mining ,Science ,topic modeling ,interaktive Medien ,Naturwissenschaften ,virtuelle Realität ,lcsh:Technology ,ddc:070 ,lcsh:Telecommunication ,Interactive, electronic Media ,lcsh:TK5101-6720 ,interaktive, elektronische Medien ,News media, journalism, publishing ,Natural Science and Engineering, Applied Sciences ,Internet ,algorithm ,lcsh:T ,electronic media ,interactive media ,Naturwissenschaften, Technik(wissenschaften), angewandte Wissenschaften ,Algorithmus ,trend ,trend discovery ,text mining ,virtual reality ,ddc:500 ,Publizistische Medien, Journalismus,Verlagswesen ,elektronische Medien - Abstract
The global cyberspace networks provide individuals with platforms to can interact, exchange ideas, share information, provide social support, conduct business, create artistic media, play games, engage in political discussions, and many more. The term cyberspace has become a conventional means to describe anything associated with the Internet and the diverse Internet culture. In fact, cyberspace is an umbrella term that covers all issues occurring through the interaction of information systems and humans over these networks. Deep evaluation of the scientific articles on the cyberspace domain provides concentrated knowledge and insights about major trends of the field. Text mining tools and techniques enable the practitioners and scholars to discover significant trends in a large set of internationally validated papers. This study utilizes text mining algorithms to extract, validate, and analyze 1860 scientific articles on the cyberspace domain and provides insight over the future scientific directions or cyberspace studies.
- Published
- 2018
33. Using distance transform based algorithms for extracting measures of the fiber network in volume images of paper
- Author
-
Svensson, Stina and Aronsson, Mattias
- Subjects
Algorithm ,Algorithms -- Research - Abstract
Nowadays volume images are frequently used in many applications. Volume images of paper can be analyzed to increase the understanding of the complexity of the fiber network in paper and its effect on the optical and mechanical properties of paper. We show how curve and surface representations of the fiber, the fiber wall, and the fiber lumen can be computed using distance transform based algorithms. These representations are used for easy computation of wall thickness, degree of collapse, fiber length, slenderness ratio, fiber curl, and torsional resistance for the fibers. Free-fiber segments are identified, again using a distance transform based algorithm. Finally, we show tools for qualitative visual inspection of the fibers. The methods are evaluated and illustrated using both sets of synthetic and of real data. In addition to the analysis of the fiber network in paper, they can be used in many other applications where shape analysis of elongated objects is to be performed. Index Terms--3-D image, curve representation, distance transform, density, fiber, fiber curl, length, slenderness, surface representation, thickness, torsional resistance.
- Published
- 2003
34. Data from Norwegian University of Science and Technology (NTNU) Provide New Insights into Information Technology (Classification of Forensic Hyperspectral Paper Data Using Hybrid Spectral Similarity Algorithms)
- Subjects
Algorithms ,Algorithm ,Computers - Abstract
2022 FEB 1 (VerticalNews) -- By a News Reporter-Staff News Editor at Information Technology Newsweekly -- Investigators publish new report on Information Technology. According to news reporting originating in Gjovik, [...]
- Published
- 2022
35. 'Another fine mess': how the papers covered the exams fiasco U-turn; Now that the algorithm has finally been dropped, the blame game begins, as well as the search for university places Gavin Williamson seeks to blame Ofqual for exams debacle
- Subjects
Algorithms ,Journalistic ethics ,Algorithm ,News, opinion and commentary - Abstract
Byline: Graham Russell Climbdowns, U-turns and calls for Gavin Williamson to resign resounded across Tuesday's front pages following the education secretary's apology for the exams algorithm fiasco that has marred [...]
- Published
- 2020
36. Study Findings on Personal and Ubiquitous Computing Are Outlined in Reports from School of Materials Science and Engineering (Research On Characteristics of Paper-plastic Composite Film Based On Intelligent Optimization Algorithm)
- Subjects
Mathematical optimization -- Research ,Teaching -- Equipment and supplies ,Algorithms -- Research ,Algorithm ,Computers ,News, opinion and commentary - Abstract
2021 SEP 15 (VerticalNews) -- By a News Reporter-Staff News Editor at Computer Weekly News -- Current study results on Personal and Ubiquitous Computing have been published. According to news [...]
- Published
- 2021
37. Roll assortment optimization in a paper mill: An integer programming approach
- Author
-
Chauhan, S.S., Martel, Alain, and D'Amour, Sophie
- Subjects
Algorithm ,Algorithms - Abstract
To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.cor.2006.03.026 Byline: S.S. Chauhan, Alain Martel, Sophie D'Amour Abstract: Fine paper mills produce a variety of paper grades to satisfy demand for a large number of sheeted products. Huge reels of different paper grades are produced on a cyclical basis on paper machines. These reels are then cut into rolls of smaller size which are then either sold as such, or sheeted into finished products in converting plants. A huge number of roll sizes would be required to cut all finished products without trim loss and they cannot all be inventoried. An assortment of rolls is inventoried with the implication that the sheeting operations may yield trim loss. The selection of the assortment of roll sizes to stock and the assignment of these roll sizes to finished products have a significant impact on performances. This paper presents a model to decide the parent roll assortment and assignments to finished products based on these products demand processes, desired service levels, trim loss and inventory holding costs. Risk pooling economies made by assigning several finished products to a given roll size is a fundamental aspect of the problem. The overall model is a binary non-linear program. Two solution methods are developed: a branch and price algorithm based on column generation and a fast pricing heuristic, and a marginal cost heuristic. The two methods are tested on real data and also on randomly generated problem instances. The approach proposed was implemented by a large pulp and paper company. Author Affiliation: FOR@C Research Consortium, Network Organization Technology Research Center (CENTOR), Universite Laval, Sainte-Foy, Que., Canada G1K 7P4
- Published
- 2008
38. A lower bound on the data rate of dirty paper coding in general noise and interference
- Author
-
Daniel Yellin, Itsik Bergel, and Shlomo Shamai
- Subjects
FOS: Computer and information sciences ,Computer science ,Information Theory (cs.IT) ,Gaussian ,Computer Science - Information Theory ,Transmitter ,Data_CODINGANDINFORMATIONTHEORY ,Upper and lower bounds ,Noise (electronics) ,symbols.namesake ,Distribution (mathematics) ,Interference (communication) ,Control and Systems Engineering ,symbols ,Probability distribution ,Dirty paper coding ,Electrical and Electronic Engineering ,Algorithm ,Computer Science::Information Theory - Abstract
Dirty paper coding (DPC) allows a transmitter to send information to a receiver in the presence of interference that is known (non-causally) to the transmitter. The original version of DPC was derived for the case where the noise and the interference are statistically independent Gaussian random sequences. More recent works extended this approach to the case where the noise and the interference are mutually independent and at least one of them is Gaussian. In this letter we further extend the DPC scheme by relaxing the Gaussian and statistical independence assumptions. We provide lower bounds on the achievable data rates in a DPC setting for the case of possibly dependent noise, interference and input signals. Also, the interference and noise terms are allowed to have arbitrary probability distributions. The bounds are relatively simple, are phrased in terms of second-order statistics, and are tight when the actual noise distribution is close to Gaussian., Published in the IEEE Wireless Communications Letters
- Published
- 2015
39. On Polar Coding for Binary Dirty Paper
- Author
-
David Burshtein and Barak Beilin
- Subjects
FOS: Computer and information sciences ,Channel code ,Source code ,Computer science ,media_common.quotation_subject ,Information Theory (cs.IT) ,Computer Science - Information Theory ,Binary number ,020206 networking & telecommunications ,02 engineering and technology ,Data_CODINGANDINFORMATIONTHEORY ,0202 electrical engineering, electronic engineering, information engineering ,Polar ,Algorithm ,Decoding methods ,Communication channel ,Coding (social sciences) ,media_common ,Computer Science::Information Theory - Abstract
The problem of communication over binary dirty paper (DP) using nested polar codes is considered. An improved scheme, focusing on low delay, short to moderate blocklength communication is proposed. Successive cancellation list (SCL) decoding with properly defined CRC is used for channel coding, and SCL encoding without CRC is used for source coding. The performance is compared to the best achievable rate of any coding scheme for binary DP using nested codes. A well known problem with nested polar codes for binary DP is the existence of frozen channel code bits that are not frozen in the source code. These bits need to be retransmitted in a second phase of the scheme, thus reducing transmission rate. We observe that the number of these bits is typically either zero or a small number, and provide an improved analysis, compared to that presented in the literature, on the size of this set and on its scaling with respect to the blocklength when the power constraint parameter is sufficiently large or the channel crossover probability sufficiently small., Accepted to ISIT 2019
- Published
- 2019
40. Peculiarities of logical and methodological approaches to the qualifying paper development by ecologist and chemmytologist
- Subjects
methodological guide ,qualifying paper ,algorithm ,lcsh:Motor vehicles. Aeronautics. Astronautics ,lcsh:TL1-4050 - Abstract
Algorithm of the qualifying paper development is presented. Periodical publications on ecological and chemmytological directions are systematized
- Published
- 2013
41. The approximate capacity for the 3-receiver writing on random dirty paper channel
- Author
-
Stefano Rini and Shlomo Shamai
- Subjects
Gaussian ,020206 networking & telecommunications ,Data_CODINGANDINFORMATIONTHEORY ,02 engineering and technology ,State (functional analysis) ,Upper and lower bounds ,Superposition principle ,symbols.namesake ,Additive white Gaussian noise ,Transmission (telecommunications) ,0202 electrical engineering, electronic engineering, information engineering ,symbols ,Algorithm ,Realization (systems) ,Computer Science::Information Theory ,Mathematics ,Communication channel - Abstract
In this paper, the approximate capacity of the 3-receiver “writing on random dirty paper” (WRDP) channel is derived. In the M-receiver WRDP channel, the channel output is obtained as the sum of the channel input, white Gaussian noise and a channel state sequence randomly selected among a set of M independent Gaussian sequences. The transmitter has non-causal knowledge of the set of possible state sequences but does not know which one is selected to produce the channel output. In the following, we derive upper and lower bounds to the capacity of the 3-receiver WRDP channel which are to within a distance of at most 3 bits-per-channel-use (bpcu) for all channel parameters. In the achievability proof, the channel input is composed of the superposition of three codewords: the receiver opportunistically decodes a different set of codewords, depending on the variance of the channel state appearing in the channel output. Time-sharing among multiple transmission phases is employed to guarantee that transmitted message can be decoded regardless of the state realization. In the converse proof, we derive a novel outer bound which matches the pre-log coefficient arising in the achievability proof due to time-sharing. Although developed for the case of three possible state realizations, our results can be extended the general WRDP.
- Published
- 2017
- Full Text
- View/download PDF
42. New Soft Computing Study Results Reported from National Cheng Kung University (Automatic Paper Writing Based On a Rnn and the Textrank Algorithm)
- Subjects
Algorithms -- Reports -- Research ,Algorithm ,Computers ,News, opinion and commentary - Abstract
2021 FEB 3 (VerticalNews) -- By a News Reporter-Staff News Editor at Computer Weekly News -- Research findings on Soft Computing are discussed in a new report. According to news [...]
- Published
- 2021
43. A note on the paper ‘Demonstrating Johnson’s algorithm via resource constrained scheduling’
- Author
-
Imma Ribas, Ramon Companys, Universitat Politècnica de Catalunya. Departament d'Organització d'Empreses, and Universitat Politècnica de Catalunya. EOLI - Enginyeria d'Organització i Logística Industrial
- Subjects
0209 industrial biotechnology ,Transitive relation ,Mathematical optimization ,021103 operations research ,Job shop scheduling ,Computer science ,Strategy and Management ,Resource constrained ,0211 other engineering and technologies ,makespan ,Algorismes ,02 engineering and technology ,Flow shop scheduling ,Management Science and Operations Research ,Industrial and Manufacturing Engineering ,Scheduling (computing) ,Algorithm ,020901 industrial engineering & automation ,Johnson’s theorem ,Economia i organització d'empreses [Àrees temàtiques de la UPC] ,Johnson's algorithm ,Flow shop ,scheduling ,transitivity ,Màquines automàtiques -- Models matemàtics - Abstract
In this paper we demonstrate that the relation between two jobs defined by min{ai, bj}=min{bi, aj}, used in Johnson’s theorem, is not transitive. However, both the theorem and Johnson’s algorithm are correct.
- Published
- 2017
44. Sticky market webs of connection – human and nonhuman market co-codification dynamics across social media
- Author
-
Schöps, Jonathan David, Reinhardt, Christian, and Hemetsberger, Andrea
- Published
- 2022
- Full Text
- View/download PDF
45. Practical Security Analysis of Dirty Paper Trellis Watermarking
- Author
-
Patrick Bas, Gwenael Doerr, Bas, Patrick, Teddy Furon (Editor), François Cayre (Editor), Gwenaël DoërrG (Editor), Patrick Bas (Editor), GIPSA - Communication, Signal et Sécurité (GIPSA-C2S), Département Images et Signal (GIPSA-DIS), Grenoble Images Parole Signal Automatique (GIPSA-lab), Université Stendhal - Grenoble 3-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Stendhal - Grenoble 3-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Grenoble Images Parole Signal Automatique (GIPSA-lab), Université Stendhal - Grenoble 3-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Stendhal - Grenoble 3-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS), University College of London [London] (UCL), Centre National de la Recherche Scientifique (CNRS)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Centre National de la Recherche Scientifique (CNRS)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Grenoble Images Parole Signal Automatique (GIPSA-lab), and Centre National de la Recherche Scientifique (CNRS)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3-Centre National de la Recherche Scientifique (CNRS)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Stendhal - Grenoble 3
- Subjects
Security analysis ,Computer science ,[INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing ,Data_MISCELLANEOUS ,020206 networking & telecommunications ,02 engineering and technology ,Data_CODINGANDINFORMATIONTHEORY ,computer.software_genre ,Dirty paper ,symbols.namesake ,Additive white Gaussian noise ,[INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing ,Viterbi decoder ,0202 electrical engineering, electronic engineering, information engineering ,symbols ,Embedding ,020201 artificial intelligence & image processing ,Data mining ,Cluster analysis ,[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing ,Algorithm ,computer ,Digital watermarking ,[SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing - Abstract
International audience; This paper analyses the security of dirty paper trellis (DPT) watermarking schemes which use both informed coding and informed em- bedding. After recalling the principles of message embedding with DPT watermarking, the secret parameters of the scheme are highlighted. The security weaknesses of DPT watermarking are then presented: in the wa- termarked contents only attack (WOA) setup, the watermarked data-set exhibits clusters corresponding to the different patterns attached to the arcs of the trellis. The K-means clustering algorithm is used to estimate these patterns and a co-occurrence analysis is performed to retrieve the connectivity of the trellis. Experimental results demonstrate that it is possible to accurately estimate the trellis configuration, which enables to perform attacks much more efficient than simple additive white Gaus- sian noise (AWGN).
- Published
- 2007
46. Near-capacity dirty-paper code design : a source-channel coding approach
- Author
-
Vladimir Stankovic, A.D. Liveris, Yang Yang, Yong Sun, and Zixiang Xiong
- Subjects
Source code ,Theoretical computer science ,media_common.quotation_subject ,TK ,Variable-length code ,Data_CODINGANDINFORMATIONTHEORY ,Code rate ,Library and Information Sciences ,EXIT chart ,Computer Science Applications ,Systematic code ,Shannon–Fano coding ,Turbo code ,Dirty paper coding ,Algorithm ,Information Systems ,media_common ,Mathematics - Abstract
This paper examines near-capacity dirty-paper code designs based on source-channel coding. We first point out that the performance loss in signal-to-noise ratio (SNR) in our code designs can be broken into the sum of the packing loss from channel coding and a modulo loss, which is a function of the granular loss from source coding and the target dirty-paper coding rate (or SNR). We then examine practical designs by combining trellis-coded quantization (TCQ) with both systematic and nonsystematic irregular repeat-accumulate (IRA) codes. Like previous approaches, we exploit the extrinsic information transfer (EXIT) chart technique for capacity-approaching IRA code design; but unlike previous approaches, we emphasize the role of strong source coding to achieve as much granular gain as possible using TCQ. Instead of systematic doping, we employ two relatively shifted TCQ codebooks, where the shift is optimized (via tuning the EXIT charts) to facilitate the IRA code design. Our designs synergistically combine TCQ with IRA codes so that they work together as well as they do individually. By bringing together TCQ (the best quantizer from the source coding community) and EXIT chart-based IRA code designs (the best from the channel coding community), we are able to approach the theoretical limit of dirty-paper coding. For example, at 0.25 bit per symbol (b/s), our best code design (with 2048-state TCQ) performs only 0.630 dB away from the Shannon capacity.
- Published
- 2009
47. Withdrawn Paper
- Author
-
Z. Tangxiaotao and D.-C. Gong
- Subjects
Transformation (function) ,Mathematical analysis ,Rational function ,Algorithm ,Image based ,Mathematics ,Image (mathematics) - Abstract
delete
- Published
- 2018
48. Fault Diagnosis of the Paper Machine Short Circulation Process using Novel Dynamic Causal Digraph Reasoning
- Author
-
Mats Nikus, Sirkka-Liisa Jämsä-Jounela, Hui Cheng, Department of Biotechnology and Chemical Technology, Aalto-yliopisto, and Aalto University
- Subjects
Engineering ,business.product_category ,business.industry ,Inference ,Digraph ,Residual ,Industrial and Manufacturing Engineering ,Fault detection and isolation ,Computer Science Applications ,Stuck-at fault ,Paper machine ,Control and Systems Engineering ,Causal digraph ,CUSUM ,Modeling and Simulation ,Graph (abstract data type) ,Fault model ,business ,Algorithm - Abstract
This paper presents a novel dynamic causal digraph reasoning method for fault diagnosis and its application to the short circulation process of a paper machine. In order to improve the fault detection ability of the original causal digraph method, a residual modification approach that takes into account the direction of different fault effects is presented. An improvement of the isolation capability of the original method, an inference mechanism between the arcs of the graph, is also proposed to locate process faults on the arcs. The results from the application show that the proposed method, compared to the conventional method, is able to detect the correct nodes and to identify the responsible arcs when the system is affected by a process fault.
- Published
- 2008
49. Using artificial neural network on flight distance prediction for paper plane
- Author
-
Chih-Hsien Chuo, Tian-Syung Lan, and Pin-Chang Chen
- Subjects
0209 industrial biotechnology ,Engineering ,Wing ,Artificial neural network ,Aviation ,business.industry ,Plane (geometry) ,Mechanical Engineering ,lcsh:Mechanical engineering and machinery ,020208 electrical & electronic engineering ,Artificial neural network model ,02 engineering and technology ,Rudder ,Flight experiment ,020901 industrial engineering & automation ,0202 electrical engineering, electronic engineering, information engineering ,lcsh:TJ1-1570 ,business ,Algorithm ,Simulation ,Flight distance - Abstract
This study shows how to apply the essential principles of paper plane on the flight experiment. It applies three basic structures of paper plane including nose, wing, and rudder movements to predict the optimal flight distance. This study employs the artificial neural network model for data analysis and prediction. The data collected from the flight distance of paper plane are calculated and analyzed in the artificial neural network model in order to predict the optimal flight distance of paper plane. This study is intended to discover the essential principles and basic structures of manufacturing paper plane and provide theoretical and practical contributions in hands-on experiments and aviation science.
- Published
- 2017
50. Interactive paper tearing
- Author
-
Camille Schreck, Damien Rohmer, Stefanie Hahmann, Intuitive Modeling and Animation for Interactive Graphics & Narrative Environments (IMAGINE ), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Laboratoire Jean Kuntzmann (LJK ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Department of Computer Science [Lyon] (CPE), École supérieure de Chimie Physique Electronique de Lyon (CPE)-Université de Lyon, European Project: 291184,EC:FP7:ERC,ERC-2011-ADG_20110209,EXPRESSIVE(2012), and École Supérieure de Chimie Physique Électronique de Lyon (CPE)-Université de Lyon
- Subjects
Three-Dimensional Graphics and Realism ,Computer science ,Scientific visualization ,020207 software engineering ,Context (language use) ,ComputerApplications_COMPUTERSINOTHERSYSTEMS ,02 engineering and technology ,Animation ,01 natural sciences ,Computer Graphics and Computer-Aided Design ,[INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR] ,Computer graphics ,Real-time computer graphics ,Physics::Plasma Physics ,Computer graphics (images) ,0103 physical sciences ,Path (graph theory) ,Tearing ,Physics::Space Physics ,0202 electrical engineering, electronic engineering, information engineering ,Tears ,010306 general physics ,Algorithm ,3D computer graphics - Abstract
International audience; We propose an efficient method to model paper tearing in the context of interactive modeling. The method uses geometrical information to automatically detect potential starting points of tears. We further introduce a new hybrid geometrical and physical-based method to compute the trajectory of tears while procedurally synthesizing high resolution details of the tearing path using a texture based approach. The results obtained are compared with real paper and with previous studies on the expected geometric paths of paper that tears.
- Published
- 2017
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.