Journal articles: 'Optimisation du code latent'

1

Dubisz, Stanisław. "Najnowsze dzieje języka polskiego (1918–2018)." Poradnik Językowy, no. 10/2022(799) (September 5, 2022): 11–26. http://dx.doi.org/10.33896/porj.2022.10.1.

Full text

Abstract:

The latest history of the Polish language (1918–2018) consists of four phases (1918–1939, 1939–1945, 1945–1990, after 1990). In the area of extra-linguistic phenomena and sociolinguistic trends, the Polish language has evolved from the status of an elite language to a democratised code and from the double division of communication varieties (common language : dialects) to the triple division (common language : folk dialects : mixed codes). In the area of intra-linguistic phenomena, the trends of economisation and completion of linguistic devices dominated throughout the history, while preserving the uniform dynamics of other trends (unification, repartition, nobilitation). These processes and specific language changes have affected all structural layers of the Polish language system in a proportional manner, which proves the effectiveness of optimisation processes. Keywords: language history – latest history of the Polish language – Polish language evolution – language system – extra-linguistic factors – intra-linguistic factors – sociolinguistic trends – language system development trends.

APA, Harvard, Vancouver, ISO, and other styles

2

Hetyei, Csaba, and Ferenc Szlivka. "COUNTER-ROTATING DUAL ROTOR WIND TURBINE LAYOUT OPTIMISATION." Acta Polytechnica 61, no. 2 (April 30, 2021): 342–49. http://dx.doi.org/10.14311/ap.2021.61.0342.

Full text

Abstract:

General energy demand is continuously increasing, thus the energy generating assets need to be optimised for higher efficiency. Wind turbines are no exception. Their maximum efficiency can be determined on a theoretical basis. The limit is approached by researches day by day, utilizing the latest developments in airfoil design, blade structure and new and improved ideas in conventional and unconventional wind turbine layouts. In this paper, we are reviewing the conventional and unconventional wind turbines and their place in smart cities. Then, an unconventional wind turbine design, the CO-DRWT (counter-rotating dual rotor wind turbine) is analysed with a CFD (computational fluid dynamics) code, varying the axial and radial distances between the two turbines. After the simulations, the power coefficients for the different turbine configurations is calculated. At the end of this paper, the simulations results are summarized and consequences are drawn for the CO-DRWT layouts.

APA, Harvard, Vancouver, ISO, and other styles

3

Ye, Fei, and Adrian G. Bors. "Task-Free Continual Generation and Representation Learning via Dynamic Expansionable Memory Cluster." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 15 (March 24, 2024): 16451–59. http://dx.doi.org/10.1609/aaai.v38i15.29582.

Full text

Abstract:

Human brains can continually acquire and learn new skills and knowledge over time from a dynamically changing environment without forgetting previously learnt information. Such a capacity can selectively transfer some important and recently seen information to the persistent knowledge regions of the brain. Inspired by this intuition, we propose a new memory-based approach for image reconstruction and generation in continual learning, consisting of a temporary and evolving memory, with two different storage strategies, corresponding to the temporary and permanent memorisation. The temporary memory aims to preserve up-to-date information while the evolving memory can dynamically increase its capacity in order to preserve permanent knowledge information. This is achieved by the proposed memory expansion mechanism that selectively transfers those data samples deemed as important from the temporary memory to new clusters defined within the evolved memory according to an information novelty criterion. Such a mechanism promotes the knowledge diversity among clusters in the evolved memory, resulting in capturing more diverse information by using a compact memory capacity. Furthermore, we propose a two-step optimization strategy for training a Variational Autoencoder (VAE) to implement generation and representation learning tasks, which updates the generator and inference models separately using two optimisation paths. This approach leads to a better trade-off between generation and reconstruction performance. We show empirically and theoretically that the proposed approach can learn meaningful latent representations while generating diverse images from different domains. The source code and supplementary material (SM) are available at https://github.com/dtuzi123/DEMC.

APA, Harvard, Vancouver, ISO, and other styles

4

Dahlin, J. E. "Cook up better code [Software code optimisation]." Electronics Systems and Software 5, no. 6 (December 1, 2007): 24–27. http://dx.doi.org/10.1049/ess:20070606.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Jindal, Richa, and Sanjay Singla. "Ant colony optimisation for latent fingerprint matching." International Journal of Advanced Intelligence Paradigms 19, no. 2 (2021): 161. http://dx.doi.org/10.1504/ijaip.2021.115247.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Lee, Isack, and Seok Bong Yoo. "Latent-PER: ICA-Latent Code Editing Framework for Portrait Emotion Recognition." Mathematics 10, no. 22 (November 14, 2022): 4260. http://dx.doi.org/10.3390/math10224260.

Full text

Abstract:

Although real-image emotion recognition has been developed in several studies, an acceptable accuracy level has not been achieved in portrait drawings. This paper proposes a portrait emotion recognition framework based on independent component analysis (ICA) and latent codes to overcome the performance degradation problem in drawings. This framework employs latent code extracted through a generative adversarial network (GAN)-based encoder. It learns independently from factors that interfere with expression recognition, such as color, small occlusion, and various face angles. It is robust against environmental factors since it filters latent code by adding an emotion-relevant code extractor to extract only information related to facial expressions from the latent code. In addition, an image is generated by changing the latent code to the direction of the eigenvector for each emotion obtained through the ICA method. Since only the position of the latent code related to the facial expression is changed, there is little external change and the expression changes in the desired direction. This technique is helpful for qualitative and quantitative emotional recognition learning. The experimental results reveal that the proposed model performs better than the existing models, and the latent editing used in this process suggests a novel manipulation method through ICA. Moreover, the proposed framework can be applied for various portrait emotion applications from recognition to manipulation, such as automation of emotional subtitle production for the visually impaired, understanding the emotions of objects in famous classic artwork, and animation production assistance.

APA, Harvard, Vancouver, ISO, and other styles

7

Lienard, M., and P. Degauque. "Correlation radar: optimisation of code generator architecture." Electronics Letters 39, no. 19 (2003): 1405. http://dx.doi.org/10.1049/el:20030844.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Lewis, S. J., D. G. Ireland, and W. Vanderbauwhede. "Code optimisation in a nested-sampling algorithm." Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment 785 (June 2015): 105–9. http://dx.doi.org/10.1016/j.nima.2015.03.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Dhamdhere, D. M. "A fast algorithm for code movement optimisation." ACM SIGPLAN Notices 23, no. 10 (October 1988): 172–80. http://dx.doi.org/10.1145/51607.51621.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Merllié, Dominique, and Bruno Boussard. "«Comment vous étes-vous connus ?» - 2 - Code patent, code latent." Actes de la recherche en sciences sociales 70, no. 1 (1987): 87–92. http://dx.doi.org/10.3406/arss.1987.2398.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Cai, Aiping. "A latent semantic analysis-based image tag optimisation method." International Journal of Applied Decision Sciences 13, no. 1 (2020): 109. http://dx.doi.org/10.1504/ijads.2020.104308.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Valetov, Eremey, Giovanni Dal Maso, Peter-Raymond Kettle, Andreas Knecht, and Angela Papa. "Beamline Optimisation for High-Intensity Muon Beams at PSI Using the Heterogeneous Island Model." Particles 7, no. 3 (August 1, 2024): 683–91. http://dx.doi.org/10.3390/particles7030039.

Full text

Abstract:

The High Intensity Muon Beams (HIMB) project at the Paul Scherrer Institute (PSI) will deliver muon beams with unprecedented intensities of up to 1010muons/s for next-generation particle physics and material science experiments. This represents a hundredfold increase over the current state-of-the-art muon intensities, also provided by PSI. We performed beam dynamics optimisations and studies for the design of the HIMB beamlines MUH2 and MUH3 using Graphics Transport, Graphics Turtle, and G4beamline, the latter incorporating PSI’s own measured π+ cross-sections and variance reduction. We initially performed large-scale beamline optimisations using asynchronous Bayesian optimisation with DeepHyper. We are now developing an island-based evolutionary optimisation code glyfada based on the Paradiseo framework, where we implemented Message Passing Interface (MPI) islands with OpenMP parallelisation within each island. Furthermore, we implemented an island model that is also suitable for high-throughput computing (HTC) environments with asynchronous communication via a Redis database. The code interfaces with the codes COSY INFINITY and G4beamline. The code glyfada will provide heterogeneous island model optimisation using evolutionary optimisation and local search methods, as well as part-wise optimisation of the beamline with automatic advancement through stages. We will use the glyfada for a future large-scale optimisation of the HIMB beamlines.

APA, Harvard, Vancouver, ISO, and other styles

13

D'Anca, Calogero, Antonio Mancuso, and Gabriele Virzi Mariotti. "Optimisation of a vehicle shape by CFD code." International Journal of Vehicle Design 38, no. 1 (2005): 26. http://dx.doi.org/10.1504/ijvd.2005.006603.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Fornarelli, Francesco, Lorenzo Dambrosio, Sergio Mario Camporeale, and Luigi Terlizzi. "Novel Multi-Objective Optimal Design of a Shell-and-Tube Latent Heat Thermal Energy Storage Device." Energies 16, no. 4 (February 14, 2023): 1882. http://dx.doi.org/10.3390/en16041882.

Full text

Abstract:

In the present paper a new multi-objective optimisation procedure for the design of a shell-and-tube Latent Heat Thermal Energy Storage (LHTES) is proposed. A simple arrangement of a cylindrical shell with multiple vertical tubes has been examined. The optimisation considers, as design variables, the number of tubes, the tube internal radius and the device height-to-diameter ratio, H/D, while the storage volume is kept constant. This analysis aims to detect the set of solutions which optimises the LHTES performances evaluated in terms of charging and discharging times and overall thermal energy capacity. To accomplish the multi-objectives optimal thermal storage design, a simplified mathematical model of the LHTES has been employed. This model can evaluate the prescribed performances for a given set of design variables. The proposed optimisation procedure evaluates new solutions along the most promising directions in the design variables domain, leading to a significant improvement in storage performances. The Design of the Experiment, together with the Pareto dominance relationship, gives a starting optimal solutions subset. The proposed optimisation procedure permits to enhance the starting optimal solutions subset letting approach the Pareto barrier. The paper shows that, at the end of the optimisation procedure, the designer can select the solutions on the Pareto barrier with the best performance and the corresponding design variables for each chosen solution. The proposed optimisation procedure will also allow for maintaining low computational costs due to the low number of the new design variables evaluated only in the promising directions.

APA, Harvard, Vancouver, ISO, and other styles

15

Diel, R. "Cost-optimisation of screening for latent tuberculosis in close contacts." European Respiratory Journal 28, no. 1 (July 1, 2006): 35–44. http://dx.doi.org/10.1183/09031936.06.00011806.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Sadatsafavi, M., and M. Najafzadeh. "Cost-optimisation of screening for latent tuberculosis in close contacts." European Respiratory Journal 28, no. 6 (December 1, 2006): 1285. http://dx.doi.org/10.1183/09031936.00094906.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Haas, Titus, Sascha Weikert, and Konrad Wegener. "MPCC-Based Set Point Optimisation for Machine Tools." International Journal of Automation Technology 13, no. 3 (May 5, 2019): 407–18. http://dx.doi.org/10.20965/ijat.2019.p0407.

Full text

Abstract:

Numerical control code is typically used for manufacturing a workpiece using machine tools. Most state-of-the-art approaches decouple the set point optimisation into two steps: the geometry and the feed rate optimisation that does not necessarily result in time-optimal set points for the desired geometry. Given the originally programmed geometry through the numerical control code, dynamic constraints of the machine tool, and maximum permissible contour error for the optimisation, a model predictive contouring control based set point optimisation approach is developed to generate time-optimal set points for machine tools globally. A suitable error definition and its linearisation are used whereby the optimisation problem can be represented by a quadratic programming problem with linear constraints. Compared to most state-of-the-art methods, a direct approach is presented and no previous geometry optimisation step is required. Depending on the demands of accuracy, different maximum contour error constraints and penalisation as well as various maximum permissible axis velocities and accelerations are presented and tested on a test bench. The method is shown to be adaptable to different demands on the set points, and the contour errors can be affected by either the constraints or penalising factors.

APA, Harvard, Vancouver, ISO, and other styles

18

Усиченко, В. И., and Д. В. Заврайский. "ДВУХУРОВНЕВАЯ ОПТИМИЗАЦИЯ ПРОГРАММНОГО КОДА ДЛЯ ПОЛИНОМОВ ЛЕЖАНДРА ВЫСОКИХ ПОРЯДКОВ." Journal of Rocket-Space Technology 26, no. 4 (September 5, 2018): 127–36. http://dx.doi.org/10.15421/451823.

Full text

Abstract:

The expediency of two-level optimisation of a program code for calculation Legendre polinomials of high orders is shown. The conclusion about efficacy of optimisation is made on the basis of timekeeping by operating system means. This paper is a second part of article [8].

APA, Harvard, Vancouver, ISO, and other styles

19

Rajagopal, S., and R. Ganguli. "Conceptual design of UAV using Kriging based multi-objective genetic algorithm." Aeronautical Journal 112, no. 1137 (November 2008): 653–62. http://dx.doi.org/10.1017/s0001924000002621.

Full text

Abstract:

Abstract This paper highlights unmanned aerial vehicle (UAV) conceptual design using the multi-objective genetic algorithm (MOGA). The design problem is formulated as a multidisciplinary design optimisation (MDO) problem by coupling aerodynamic and structural analysis. The UAV considered in this paper is a low speed, long endurance aircraft. The optimisation problem uses endurance maximization and wing weight minimisation as dual objective functions. In this multi-objective optimisation, aspect ratio, wing loading, taper ratio, thickness-to-chord ratio, loiter velocity and loiter altitude are considered as design variables with stall speed, maximum speed and rate of climb as constraints. The MDO system integrates the aircraft design code, RDS and an empirical relation for objective function evaluation. In this study, the optimisation problem is solved in two approaches. In the first approach, the RDS code is directly integrated in the optimisation loop. In the second approach, Kriging model is employed. The second approach is fast and efficient as the meta-model reduces the time of computation. A relatively new multi-objective evolutionary algorithm named NSGA-II (non-dominated sorting genetic algorithm) is used to capture the full Pareto front for the dual objective problem. As a result of optimisation using multi-objective genetic algorithm, several non-dominated solutions indicating number of useful Pareto optimal designs is identified.

APA, Harvard, Vancouver, ISO, and other styles

20

Hussain, Syed Aamer, Norulhusna Ahmad, Ibraheem Shayea, Hazilah Mad Kaidi, Liza Abdul Latiff, Norliza Mohamed, and Suriani Mohd Sam. "A review of codebook design methods for sparse code multiple access." Indonesian Journal of Electrical Engineering and Computer Science 22, no. 2 (May 1, 2021): 927. http://dx.doi.org/10.11591/ijeecs.v22.i2.pp927-935.

Full text

Abstract:

The progressions in telecommunication beyond the 5th generation have created a need to improve research drifts. The current 5G study has an important focus on non-orthogonal multiple access (NOMA) technology. sparse code multiple access (SCMA) is a promising technique within NOMA, enhancing the multi-user handling capability of next-generation communication. In the SCMA sphere, codebook designing and optimisation are essential research matters. This study conversed with different codebook design practises existing in the literature, analysing them for numerous parameters, including bit error rate (BER), an optimisation technique, and channel settings. From the analysis, the paper presents the efficiency of different approaches. The article also discusses the prospects and challenges of SCMA optimisation in practical implementation in various domains.

APA, Harvard, Vancouver, ISO, and other styles

21

Ye, Sheng, Jing Wang, Sikandar Ali, Hasan Ali Khattak, Chenhong Guo, and Zhongguo Yang. "Recovering Latent Data Flow from Business Process Model Automatically." Wireless Communications and Mobile Computing 2022 (June 20, 2022): 1–11. http://dx.doi.org/10.1155/2022/7579515.

Full text

Abstract:

Process-driven applications evolve rapidly through the interaction between executable BPMN (Business Process Modeling and Notation) models, business tasks, and external services. Given these components operate on some shared process data, it is imperative to recover the latent data by visiting relation, which is known as data flow among these tasks. Data flow will benefit some typical applications including data flow anomaly checking and data privacy protection. However, in most cases, the complete data flow in a business process is not explicitly defined but hidden in model elements such as form declarations, variable declarations, and program code. Some methods to recovering data flow based on process model analysis of source code have some drawbacks; i.e., for security reasons, users do not want to provide source code but only encapsulated methods; therefore, data flows are difficult to analyze. We propose a method to generate running logs that are used to produce a complete data flow picture combined with the static code analysis method. This method combines the simple and easy-to-use characteristics of static code analysis methods and makes up for the shortcomings of static code analysis methods that cannot adapt to complex business processes, and as a result, the analyzed data flow is inaccurate. Moreover, a holistic framework is proposed to generate the data flow graph. The prototype system designed on Camunda and Flowable BPM (business process management) engine proves the applicability of the solution. The effectiveness of our method is validated on the prototype system.

APA, Harvard, Vancouver, ISO, and other styles

22

Silva, Hugo Miguel, and José Filipe Bizarro de Meireles. "Design Optimisation of Internally Reinforced Beams Subjected to Torsion Loading." Advanced Engineering Forum 28 (June 2018): 1–17. http://dx.doi.org/10.4028/www.scientific.net/aef.28.1.

Full text

Abstract:

In this work, novel types of internally reinforced hollow-box beams were structurally optimized using a Finite Element Updating code built in MATLAB. In total, 24 different beams were optimized under torsion loads. A new objective function was defined in order to consider the balance between mass and deflection on relevant nodal points. New formulae were developed in order to assess the efficiency of the code and of the structures. The efficiency of the code is determined by comparing the Finite Element results of the optimized solutions using ANSYS with the initial solutions. It was concluded that the optimization algorithm, built in Sequential Quadratic Programming (SQP) allowed to improve the effective mechanical. Therefore, the developed algorithm is effective in optimizing the novel FEM models under the studied conditions.

APA, Harvard, Vancouver, ISO, and other styles

23

Silva, Hugo Miguel, and José Filipe Bizarro de Meireles. "Design Optimisation of Internally Reinforced Beams Subjected to Bending Loading." Advanced Engineering Forum 28 (June 2018): 18–32. http://dx.doi.org/10.4028/www.scientific.net/aef.28.18.

Full text

Abstract:

In this work, novel types of internally reinforced hollow-box beams were structurally optimized using a Finite Element Updating code built in MATLAB. In total, 24 different beams were optimized under bending loads. A new objective function was defined in order to consider the balance between mass and deflection on relevant nodal points. New formulae were developed in order to assess the efficiency of the code and of the structures. The efficiency of the code is determined by comparing the Finite Element results of the optimized solutions using ANSYS with the initial solutions. It was concluded that the optimization algorithm, built in Sequential Quadratic Programming (SQP) allowed to improve the effective mechanical behavior under bending in 8500%.Therefore, the developed algorithm is effective in optimizing the novel FEM models under the studied conditions.

APA, Harvard, Vancouver, ISO, and other styles

24

Bous, Frederik, and Axel Roebel. "A Bottleneck Auto-Encoder for F0 Transformations on Speech and Singing Voice." Information 13, no. 3 (February 23, 2022): 102. http://dx.doi.org/10.3390/info13030102.

Full text

Abstract:

In this publication, we present a deep learning-based method to transform the f0 in speech and singing voice recordings. f0 transformation is performed by training an auto-encoder on the voice signal’s mel-spectrogram and conditioning the auto-encoder on the f0. Inspired by AutoVC/F0, we apply an information bottleneck to it to disentangle the f0 from its latent code. The resulting model successfully applies the desired f0 to the input mel-spectrograms and adapts the speaker identity when necessary, e.g., if the requested f0 falls out of the range of the source speaker/singer. Using the mean f0 error in the transformed mel-spectrograms, we define a disentanglement measure and perform a study over the required bottleneck size. The study reveals that to remove the f0 from the auto-encoder’s latent code, the bottleneck size should be smaller than four for singing and smaller than nine for speech. Through a perceptive test, we compare the audio quality of the proposed auto-encoder to f0 transformations obtained with a classical vocoder. The perceptive test confirms that the audio quality is better for the auto-encoder than for the classical vocoder. Finally, a visual analysis of the latent code for the two-dimensional case is carried out. We observe that the auto-encoder encodes phonemes as repeated discontinuous temporal gestures within the latent code.

APA, Harvard, Vancouver, ISO, and other styles

25

Robinson, G. M., and A. J. Keane. "A case for multi-level optimisation in aeronautical design." Aeronautical Journal 103, no. 1028 (October 1999): 481–85. http://dx.doi.org/10.1017/s0001924000064435.

Full text

Abstract:

Abstract This paper discusses how the inevitable limitations of computing power available to designers has restricted adoption of optimisation as an essential design tool. It is argued that this situation will continue until optimisation algorithms are developed which utilise the range of available analysis methods in a manner more like human designers. The concept of multi-level algorithms is introduced and a case made for their adoption as the way forward. The issues to be addressed in the development of multi-level algorithms are highlighted. The paper goes on to discuss a system developed at Southampton University to act as a test bed for multi-level algorithms deployed on a realistic design task. The Southampton University multi-level wing design environment integrates drag estimation algorithms ranging from an empirical code to an Euler CFD code, covering a 150,000 fold difference in computational cost. A simple multi-level optimisation of a civil transport aircraft wing is presented.

APA, Harvard, Vancouver, ISO, and other styles

26

Orszag, J. Michael. "Fortran, C and C++ Code for Econometrics and Optimisation Applications." Economic Journal 107, no. 440 (January 1, 1997): 252–56. http://dx.doi.org/10.1111/1468-0297.00154.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Yan, Rongjie, Min Yu, Kai Huang, and Xiaomeng Zhang. "Communication-oriented performance optimisation during code generation from Simulink models." International Journal of Embedded Systems 6, no. 2/3 (2014): 124. http://dx.doi.org/10.1504/ijes.2014.063809.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Abdelghany, Ahmed, Worachat Sattayalekha, and Khaled Abdelghany. "On airlines code-share optimisation: a modelling framework and analysis." International Journal of Revenue Management 3, no. 3 (2009): 307. http://dx.doi.org/10.1504/ijrm.2009.027389.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Saranya, G., H. Khanna Nehemiah, and A. Kannan. "Hybrid particle swarm optimisation with mutation for code smell detection." International Journal of Bio-Inspired Computation 12, no. 3 (2018): 186. http://dx.doi.org/10.1504/ijbic.2018.094624.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Saranya, G., H. Khanna Nehemiah, and A. Kannan. "Hybrid particle swarm optimisation with mutation for code smell detection." International Journal of Bio-Inspired Computation 12, no. 3 (2018): 186. http://dx.doi.org/10.1504/ijbic.2018.10015872.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Redwood-Sawyer, J. A. S., and L. F. Lind. "Some useful criteria for the optimisation of phase code spectra." IEE Proceedings F Communications, Radar and Signal Processing 133, no. 1 (1986): 16. http://dx.doi.org/10.1049/ip-f-1.1986.0004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Pholdee, Nantiwat, and Sujin Bureerat. "Hybrid real-code ant colony optimisation for constrained mechanical design." International Journal of Systems Science 47, no. 2 (February 28, 2014): 474–91. http://dx.doi.org/10.1080/00207721.2014.891664.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Henzler, Philipp, Valentin Deschaintre, Niloy J. Mitra, and Tobias Ritschel. "Generative modelling of BRDF textures from flash images." ACM Transactions on Graphics 40, no. 6 (December 2021): 1–13. http://dx.doi.org/10.1145/3478513.3480507.

Full text

Abstract:

We learn a latent space for easy capture, consistent interpolation, and efficient reproduction of visual material appearance. When users provide a photo of a stationary natural material captured under flashlight illumination, first it is converted into a latent material code. Then, in the second step, conditioned on the material code, our method produces an infinite and diverse spatial field of BRDF model parameters (diffuse albedo, normals, roughness, specular albedo) that subsequently allows rendering in complex scenes and illuminations, matching the appearance of the input photograph. Technically, we jointly embed all flash images into a latent space using a convolutional encoder, and -conditioned on these latent codes- convert random spatial fields into fields of BRDF parameters using a convolutional neural network (CNN). We condition these BRDF parameters to match the visual characteristics (statistics and spectra of visual features) of the input under matching light. A user study compares our approach favorably to previous work, even those with access to BRDF supervision. Project webpage: https://henzler.github.io/publication/neuralmaterial/.

APA, Harvard, Vancouver, ISO, and other styles

34

Bird, Robert F., Patrick Gillies, Michael R. Bareford, Andy Herdman, and Stephen Jarvis. "Performance Optimisation of Inertial Confinement Fusion Codes using Mini-applications." International Journal of High Performance Computing Applications 32, no. 4 (November 2, 2016): 570–81. http://dx.doi.org/10.1177/1094342016670225.

Full text

Abstract:

Despite the recent successes of nuclear energy researchers, the scientific community still remains some distance from being able to create controlled, self-sustaining fusion reactions. Inertial Confinement Fusion (ICF) techniques represent one possible option to surpass this barrier, with scientific simulation playing a leading role in guiding and supporting their development. The simulation of such techniques allows for safe and efficient investigation of laser design and pulse shaping, as well as providing insight into the reaction as a whole. The research presented here focuses on the simulation code EPOCH, a fully relativistic particle-in-cell plasma physics code concerned with faithfully recreating laser-plasma interactions at scale. A significant challenge in developing large codes like EPOCH is maintaining effective scientific delivery on successive generations of high-performance computing architecture. To support this process, we adopt the use of mini-applications – small code proxies that encapsulate important computational properties of their larger parent counterparts. Through the development of a mini-application for EPOCH (called miniEPOCH), we investigate a variety of the performance features exhibited in EPOCH, expose opportunities for optimisation and increased scientific capability, and offer our conclusions to guide future changes to similar ICF codes.

APA, Harvard, Vancouver, ISO, and other styles

35

Ünal, Can, and Alime Dere Yüksel. "Cut Order Planning Optimisation in the Apparel Industry." Fibres and Textiles in Eastern Europe 28, no. 1(139) (February 29, 2020): 8–13. http://dx.doi.org/10.5604/01.3001.0013.5851.

Full text

Abstract:

Nowadays, apparel businesses have to cut down on their costs in order to ensure the continuity of their activities and to expand them. Fabric costs cover about 50-60% of production costs. In this study, for the minimisation of fabric costs, the cutting department in enterprises was investigated and the cut order plans developed by mixed integer nonlinear programming. Examples were taken from the enterprises that were implemented. A mathematical model was then developed to be used in mixed integer nonlinear programming for a manual cut order plan, and a program code was created in LINGO optimisation software. With the program code developed, optimum results that cannot be manually calculated by an operator is obtained. The amounts of fabric to be used as a result of the cut order plan were applied to the samples taken from the enterprises, and the manual solution and model developed were compared. As a result of the comparisons made, thanks to the model, fabric developed, usage is reduced and fabric cost minimisation ensured.

APA, Harvard, Vancouver, ISO, and other styles

36

Lee, Po Lun Timothy, Fehmida K. Kanodarwala, Chris Lennard, Xanthe Spindler, Val Spikmans, Claude Roux, and Sébastien Moret. "Latent fingermark detection using functionalised silicon oxide nanoparticles: Method optimisation and evaluation." Forensic Science International 298 (May 2019): 372–83. http://dx.doi.org/10.1016/j.forsciint.2019.02.038.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

BOULTON, RICHARD J. "Transparent optimisation of rewriting combinators." Journal of Functional Programming 9, no. 2 (March 1999): 113–46. http://dx.doi.org/10.1017/s0956796899003391.

Full text

Abstract:

The LCF system was the first mechanical theorem prover to be user-programmable via a metalanguage, ML, from which the functional programming language Standard ML has been developed. Paulson has demonstrated how a modular rewriting engine can be implemented in LCF. This provides both clarity and flexibility. This paper shows that the same modular approach (using higher-order functions) allows transparent optimisation of the rewriting engine; performance can be improved while few, if any, changes are required to code written using these functions. The techniques described have been implemented in the HOL system, a descendant of LCF, and some are now in daily use. Comparative results are given. Some of the techniques described, in particular ones to avoid processing parts of a data structure that do not need to be changed, may be of more general use in functional programming and beyond.

APA, Harvard, Vancouver, ISO, and other styles

38

Modi, Nishant, Xiaolin Wang, and Michael Negnevitsky. "Solar Hot Water Systems Using Latent Heat Thermal Energy Storage: Perspectives and Challenges." Energies 16, no. 4 (February 16, 2023): 1969. http://dx.doi.org/10.3390/en16041969.

Full text

Abstract:

Domestic water heating accounts for 15% to 27% of the total energy consumption in buildings in Australia. Over the past two decades, the latent heat thermal energy storage (LHTES) system has been widely investigated as a way to reduce fossil fuel consumption and increase the share of renewable energy in solar water heating. However, the research has concentrated on the geometric optimisation of the LHTES heat exchanger for the past few years, and this might not be sufficient for commercialisation. Moreover, recent review papers mainly discussed the development of a particular heat-transfer improvement technique. This paper presents perspectives on various solar hot water systems using LHTES to shift focus to on-demand performance studies, as well as structure optimisation studies for faster commercialisation. Future challenges are also discussed. Since the topic is an active area of research, this paper focuses on references that showcase the overall performance of LHTES-assisted solar hot water systems and cannot include all published work in the discussion. This perspective paper provides directional insights to researchers for developing an energy-efficient solar hot water system using LHTES.

APA, Harvard, Vancouver, ISO, and other styles

39

Emm, Toby A., and Yu Zhang. "Self-Adaptive Evolutionary Info Variational Autoencoder." Computers 13, no. 8 (August 22, 2024): 214. http://dx.doi.org/10.3390/computers13080214.

Full text

Abstract:

With the advent of increasingly powerful machine learning algorithms and the ability to rapidly obtain accurate aerodynamic performance data, there has been a steady rise in the use of algorithms for automated aerodynamic design optimisation. However, long training times, high-dimensional design spaces and rapid geometry alteration pose barriers to this becoming an efficient and worthwhile process. The variational autoencoder (VAE) is a probabilistic generative model capable of learning a low-dimensional representation of high-dimensional input data. Despite their impressive power, VAEs suffer from several issues, resulting in poor model performance and limiting optimisation capability. Several approaches have been proposed in attempts to fix these issues. This study combines the approaches of loss function modification with evolutionary hyperparameter tuning, introducing a new self-adaptive evolutionary info variational autoencoder (SA-eInfoVAE). The proposed model is validated against previous models on the MNIST handwritten digits dataset, assessing the total model performance. The proposed model is then applied to an aircraft image dataset to assess the applicability and complications involved with complex datasets such as those used for aerodynamic design optimisation. The results obtained on the MNIST dataset show improved inference in conjunction with increased generative and reconstructive performance. This is validated through a thorough comparison against baseline models, including quantitative metrics reconstruction error, loss function calculation and disentanglement percentage. A number of qualitative image plots provide further comparison of the generative and reconstructive performance, as well as the strength of latent encodings. Furthermore, the results on the aircraft image dataset show the proposed model can produce high-quality reconstructions and latent encodings. The analysis suggests, given a high-quality dataset and optimal network structure, the proposed model is capable of outperforming the current VAE models, reducing the training time cost and improving the quality of automated aerodynamic design optimisation.

APA, Harvard, Vancouver, ISO, and other styles

40

Liu, Jian, Zhen Yu, and Wenyu Guo. "The 3D-aware image synthesis of prohibited items in the X-ray security inspection by stylized generative radiance fields." Electronic Research Archive 32, no. 3 (2024): 1801–21. http://dx.doi.org/10.3934/era.2024082.

Full text

Abstract:

<abstract>The merging of neural radiance fields with generative adversarial networks (GANs) can synthesize novel views of objects from latent code (noise). However, the challenge for generative neural radiance fields (NERFs) is that a single multiple layer perceptron (MLP) network represents a scene or object, and the shape and appearance of the generated object are unpredictable, owing to the randomness of latent code. In this paper, we propose a stylized generative radiance field (SGRF) to produce 3D-aware images with explicit control. To achieve this goal, we manipulated the input and output of the MLP in the model to entangle and disentangle label codes into/from the latent code, and incorporated an extra discriminator to differentiate between the class and color mode of the generated object. Based on the labels provided, the model could generate images of prohibited items varying in class, pose, scale, and color mode, thereby significantly increasing the quantity and diversity of images in the dataset. Through a systematic analysis of the results, the method was demonstrated to be effective in improving the detection performance of deep learning algorithms during security screening.</abstract>

APA, Harvard, Vancouver, ISO, and other styles

41

Eiter, Thomas, Tobias Geibinger, Nelson Higuera Ruiz, Nysret Musliu, Johannes Oetsch, and Daria Stepanova. "Large-Neighbourhood Search for Optimisation in Answer-Set Solving." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 5 (June 28, 2022): 5616–25. http://dx.doi.org/10.1609/aaai.v36i5.20502.

Full text

Abstract:

While Answer-Set Programming (ASP) is a prominent approach to declarative problem solving, optimisation problems can still be a challenge for it. Large-Neighbourhood Search (LNS) is a metaheuristic for optimisation where parts of a solution are alternately destroyed and reconstructed that has high but untapped potential for ASP solving. We present a framework for LNS optimisation in answer-set solving, in which neighbourhoods can be specified either declaratively as part of the ASP encoding, or automatically generated by code. To effectively explore different neighbourhoods, we focus on multi-shot solving as it allows to avoid program regrounding. We illustrate the framework on different optimisation problems, some of which are notoriously difficult, including shift planning and a parallel machine scheduling problem from semi-conductor production which demonstrate the effectiveness of the LNS approach.

APA, Harvard, Vancouver, ISO, and other styles

42

Pholdee, Nantiwat, and Sujin Bureerat. "Estimation of Distribution Algorithm Using Correlation between Binary Elements: A New Binary-Code Metaheuristic." Mathematical Problems in Engineering 2017 (2017): 1–15. http://dx.doi.org/10.1155/2017/6043109.

Full text

Abstract:

A new metaheuristic called estimation of distribution algorithm using correlation between binary elements (EDACE) is proposed. The method searches for optima using a binary string to represent a design solution. A matrix for correlation between binary elements of a design solution is used to represent a binary population. Optimisation search is achieved by iteratively updating such a matrix. The performance assessment is conducted by comparing the new algorithm with existing binary-code metaheuristics including a genetic algorithm, a univariate marginal distribution algorithm, population-based incremental learning, binary particle swarm optimisation, and binary simulated annealing by using the test problems of CEC2015 competition and one real-world application which is an optimal flight control problem. The comparative results show that the new algorithm is competitive with other established binary-code metaheuristics.

APA, Harvard, Vancouver, ISO, and other styles

43

Isonuma, Masaru, Junichiro Mori, Danushka Bollegala, and Ichiro Sakata. "Unsupervised Abstractive Opinion Summarization by Generating Sentences with Tree-Structured Topic Guidance." Transactions of the Association for Computational Linguistics 9 (2021): 945–61. http://dx.doi.org/10.1162/tacl_a_00406.

Full text

Abstract:

Abstract This paper presents a novel unsupervised abstractive summarization method for opinionated texts. While the basic variational autoencoder-based models assume a unimodal Gaussian prior for the latent code of sentences, we alternate it with a recursive Gaussian mixture, where each mixture component corresponds to the latent code of a topic sentence and is mixed by a tree-structured topic distribution. By decoding each Gaussian component, we generate sentences with tree-structured topic guidance, where the root sentence conveys generic content, and the leaf sentences describe specific topics. Experimental results demonstrate that the generated topic sentences are appropriate as a summary of opinionated texts, which are more informative and cover more input contents than those generated by the recent unsupervised summarization model (Bražinskas et al., 2020). Furthermore, we demonstrate that the variance of latent Gaussians represents the granularity of sentences, analogous to Gaussian word embedding (Vilnis and McCallum, 2015).

APA, Harvard, Vancouver, ISO, and other styles

44

Matuszewski, Leszek. "Ring thruster — a preliminary optimisation study." Polish Maritime Research 16, no. 1 (January 1, 2009): 43–46. http://dx.doi.org/10.2478/v10012-008-0009-5.

Full text

Abstract:

Ring thruster — a preliminary optimisation study The ring thruster is a new type of propeller, for which there is no experimental data to verify analytical design calculations. A significant feature of the ring thruster is the absence of a shaft. Propeller blades are mounted to the ring rotating inside the housing, which has the shape of a nozzle. For this reason the ring thruster is closest, with respect to both the construction and principle of operation, to the Kort nozzle propeller. The absence of a shaft and no gap between the blades and the nozzle make it impossible to fully relay on results obtained from Kort nozzle propeller examination. What is more, the already existing computer codes developed for designing Kort nozzle propellers cannot be directly used for designing ring thrusters either. That is why for this purpose a new code determining hydrodynamic characteristics based on the theory of the vortex lifting surface will be used. When using the above method, some differences between calculated and experimentally recorded results are expected to be observed. To a significant extent, the level of the torque taken by the thruster will be affected by drag of the rotating ring to which the blades are fixed. Examining a propeller equipped with a rotating ring has revealed that the expected torque increment may reach as much as a few per cent, at the comparable level of axial force (thrust). At the present stage of ring propeller investigations there is no data available on how to shape the ring propeller blades. Possible comparison calculations, done using the existing computer code, will allow, the most, the shape of the blades to be determined for preliminary tests in the cavitation tunnel and on a self-propelled model. And only the results obtained in these tests will provide opportunities for verification of preliminary design calculations. It should be stressed, however, that developing design procedures for this type of propellers will require additional optimisation calculations, with further experimental verification. And this should be the subject of separate investigations.

APA, Harvard, Vancouver, ISO, and other styles

45

Liu, Hailin, Ling Xu, Mengning Yang, Meng Yan, and Xiaohong Zhang. "Predicting Component Failures Using Latent Dirichlet Allocation." Mathematical Problems in Engineering 2015 (2015): 1–15. http://dx.doi.org/10.1155/2015/562716.

Full text

Abstract:

Latent Dirichlet Allocation (LDA) is a statistical topic model that has been widely used to abstract semantic information from software source code. Failure refers to an observable error in the program behavior. This work investigates whether semantic information and failures recorded in the history can be used to predict component failures. We use LDA to abstract topics from source code and a new metric (topic failure density) is proposed by mapping failures to these topics. Exploring the basic information of topics from neighboring versions of a system, we obtain a similarity matrix. Multiply the Topic Failure Density (TFD) by the similarity matrix to get the TFD of the next version. The prediction results achieve an average 77.8% agreement with the real failures by considering the top 3 and last 3 components descending ordered by the number of failures. We use the Spearman coefficient to measure the statistical correlation between the actual and estimated failure rate. The validation results range from 0.5342 to 0.8337 which beats the similar method. It suggests that our predictor based on similarity of topics does a fine job of component failure prediction.

APA, Harvard, Vancouver, ISO, and other styles

46

Davvetas, Athanasios, Iraklis A. Klampanos, Spiros Skiadopoulos, and Vangelis Karkaletsis. "The Effect of Evidence Transfer on Latent Feature Relevance for Clustering." Informatics 6, no. 2 (April 25, 2019): 17. http://dx.doi.org/10.3390/informatics6020017.

Full text

Abstract:

Evidence transfer for clustering is a deep learning method that manipulates the latent representations of an autoencoder according to external categorical evidence with the effect of improving a clustering outcome. Evidence transfer’s application on clustering is designed to be robust when introduced with a low quality of evidence, while increasing the effectiveness of the clustering accuracy during relevant corresponding evidence. We interpret the effects of evidence transfer on the latent representation of an autoencoder by comparing our method to the information bottleneck method. Information bottleneck is an optimisation problem of finding the best tradeoff between maximising the mutual information of data representations and a task outcome while at the same time being effective in compressing the original data source. We posit that the evidence transfer method has essentially the same objective regarding the latent representations produced by an autoencoder. We verify our hypothesis using information theoretic metrics from feature selection in order to perform an empirical analysis over the information that is carried through the bottleneck of the latent space. We use the relevance metric to compare the overall mutual information between the latent representations and the ground truth labels before and after their incremental manipulation, as well as, to study the effects of evidence transfer regarding the significance of each latent feature.

APA, Harvard, Vancouver, ISO, and other styles

47

Kim, EunSun, and Yoon-Sik Cho. "Latent Dirichlet Allocation Based Crime Code Clustering and Crime Prediction." Journal of KIISE 47, no. 1 (January 31, 2020): 45–51. http://dx.doi.org/10.5626/jok.2020.47.1.45.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Xiao, Jing, Liang Liao, Qiegen Liu, and Ruimin Hu. "CISI-net: Explicit Latent Content Inference and Imitated Style Rendering for Image Inpainting." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 354–62. http://dx.doi.org/10.1609/aaai.v33i01.3301354.

Full text

Abstract:

Convolutional neural networks (CNNs) have presented their potential in filling large missing areas with plausible contents. To address the blurriness issue commonly existing in the CNN-based inpainting, a typical approach is to conduct texture refinement on the initially completed images by replacing the neural patch in the predicted region using the closest one in the known region. However, such a processing might introduce undesired content change in the predicted region, especially when the desired content does not exist in the known region. To avoid generating such incorrect content, in this paper, we propose a content inference and style imitation network (CISI-net), which explicitly separate the image data into content code and style code. The content inference is realized by performing inference in the latent space to infer the content code of the corrupted images similar to the one from the original images. It can produce more detailed content than a similar inference procedure in the pixel domain, due to the dimensional distribution of content being lower than that of the entire image. On the other hand, the style code is used to represent the rendering of content, which will be consistent over the entire image. The style code is then integrated with the inferred content code to generate the complete image. Experiments on multiple datasets including structural and natural images demonstrate that our proposed approach out-performs the existing ones in terms of content accuracy as well as texture details.

APA, Harvard, Vancouver, ISO, and other styles

49

Civalleri, B., Ph D'Arco, R. Orlando, V. R. Saunders, and R. Dovesi. "Hartree–Fock geometry optimisation of periodic systems with the Crystal code." Chemical Physics Letters 348, no. 1-2 (November 2001): 131–38. http://dx.doi.org/10.1016/s0009-2614(01)01081-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Song, Rongfang, and Guangguo Bi. "Constrained optimisation based space-time-code blind receiver in CDMA systems." Electronics Letters 36, no. 12 (2000): 1061. http://dx.doi.org/10.1049/el:20000748.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Optimisation du code latent'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles