Search

Delegation and leadership are critical components of software management, as they play a crucial role in determining the success of the software development process. This study examined the relationship between delegation and leadership in software management and the impact of these factors on project outcomes. Results showed that effective delegation and transformational leadership styles can improve workflow, enhance team motivation and productivity, and ultimately lead to successful software development projects. The findings of this study have important implications for software management practices, as they suggest that organizations and software managers should prioritize the development of effective delegation and leadership practices to ensure the success of their software development initiatives. Further research is needed to explore the complex interplay between delegation and leadership in software management and to identify best practices for improving these processes., Comment: 9 pages

This study details our approach for the CASE 2024 Shared Task on Climate Activism Stance and Hate Event Detection, focusing on Hate Speech Detection, Hate Speech Target Identification, and Stance Detection as classification challenges. We explored the capability of Large Language Models (LLMs), particularly GPT-4, in zero- or few-shot settings enhanced by retrieval augmentation and re-ranking for Tweet classification. Our goal was to determine if LLMs could match or surpass traditional methods in this context. We conducted an ablation study with LLaMA for comparison, and our results indicate that our models significantly outperformed the baselines, securing second place in the Target Detection task. The code for our submission is available at https://github.com/NaiveNeuron/bryndza-case-2024, Comment: Accepted to the 7th Workshop on Challenges and Applications of Automated Extraction of Socio-political Events from Text (CASE 2024)

The interface between a metal electrode and an organic semiconductor (OS) layer has a defining role in the properties of the resulting device. To obtain a desired performance, interlayers are introduced to modify the adhesion and growth of OS and enhance the efficiency of charge transport through the interface. However, the employed interlayers face common challenges, including a lack of electric dipoles to tune the mutual position of energy levels, being too thick for efficient electronic transport, or being prone to intermixing with subsequently deposited OS layers. Here, we show that monolayers of 1,3,5-tris(4 carboxyphenyl)benzene (BTB) with fully deprotonated carboxyl groups on silver substrates form a compact layer resistant to intermixing while mediating energy level alignment and showing a large insensitivity to substrate termination. Employing a combination of surface-sensitive techniques, i.e., low-energy electron microscopy and diffraction, X-ray photoelectron spectroscopy, and scanning tunneling microscopy, we have comprehensively characterized the compact layer and proven its robustness against mixing with the subsequently deposited organic semiconductor layer. DFT calculations show that the robustness arises from a strong interaction of carboxylate groups with the Ag surface, and thus, the BTB in the first layer is energetically favored. Synchrotron radiation photoelectron spectroscopy shows that this layer displays considerable electrical dipoles that can be utilized for work function engineering and electronic alignment of molecular frontier orbitals with respect to the substrate Fermi level. Our work thus provides a widely applicable molecular interlayer and general insights necessary for engineering of charge injection layers for efficient organic electronics.

Stanene, a two-dimensional counterpart to graphene, has the potential to exhibit novel quantum phenomena when grown on a magnetic topological insulator (MTI). This work demonstrates the formation of up to bilayer stanene on 30\% Sb-doped MnBi$_{2}$Te$_4$ (MBST), a well known MTI, albeit with a buffer layer (BL) in between. Angle-resolved photoemission spectroscopy (ARPES), when combined with density functional theory (DFT), reveals stanene related bands such as two hole-like bands and an inverted parabolic band around the $\overline{\Gamma}$ point. An outer hole-like band traverses the Fermi level (\ef) and gives rise to a hexagonal Fermi surface, showing that stanene on MBST is metallic. In contrast, a bandgap of 0.8 eV is observed at the $\overline{K}$ point. We find that DFT shows good agreement with ARPES only when the BL and hydrogen passivation of the top Sn layer are considered in the calculation. Scanning tunneling microscopy (STM) establishes the honeycomb buckled structure of stanene. A stanene-related component is also detected in the Sn $d$ core level spectra, in addition to a BL-related component. The BL, which forms because of the chemical bonding between Sn and the top two layers of MBST, has an ordered crystal lattice with random anti-site defects. The composition of the BL is estimated to be Sn:Te:Bi/Sb $\approx$ 2:1:1 from x-ray photoelectron spectroscopy. Low energy electron diffraction shows that the lattice constant of stanene is marginally larger than that of MBST, and the STM result aligns with this. The BL bridges this disparity and provides a platform for stanene growth., Comment: *Both authors contributed equally

The transition to Electric Vehicles (EV) in place of traditional internal combustion engines is increasing societal demand for electricity. The ability to integrate the additional demand from EV charging into forecasting electricity demand is critical for maintaining the reliability of electricity generation and distribution. Load forecasting studies typically exclude households with home EV charging, focusing on offices, schools, and public charging stations. Moreover, they provide point forecasts which do not offer information about prediction uncertainty. Consequently, this paper proposes the Long Short-Term Memory Bayesian Neural Networks (LSTM-BNNs) for household load forecasting in presence of EV charging. The approach takes advantage of the LSTM model to capture the time dependencies and uses the dropout layer with Bayesian inference to generate prediction intervals. Results show that the proposed LSTM-BNNs achieve accuracy similar to point forecasts with the advantage of prediction intervals. Moreover, the impact of lockdowns related to the COVID-19 pandemic on the load forecasting model is examined, and the analysis shows that there is no major change in the model performance as, for the considered households, the randomness of the EV charging outweighs the change due to pandemic.

Intersection algorithms are very important in computation of geometrical problems. Algorithms for a line intersection with linear or quadratic surfaces are quite efficient. However, algorithms for a line intersection with other surfaces are more complex and time consuming. In this case the object is usually closed into a simple bounding volume to speed up the cases when the given line cannot intersect the given object. In this paper new formulations of the line-torus intersection problem are given and new specification of the bounding volume for a torus is given as well. The presented approach is based on an idea of a line intersection with an envelope of rotating sphere that forms a torus. Due to this approach new bounding volume can be formulated which is more effective as it enables to detect cases when the line passes the "hole" of a torus, too., Comment: Draft of the paper published Line-Torus Intersection: Alternative Formulations, WSEAS Trans. on Computers, ISSN 2224-2872, Vol7., No.12, pp.288-297, 2013

The surface reconstruction problem from sets of planar parallel slices representing cross sections through 3D objects is presented. The final result of surface reconstruction is always based on the correct estimation of the structure of the original object. This paper is a case study of the problem of the structure determination. We present a new approach, which is based on considering mutually orthogonal sets of slices. A new method for surface reconstruction from orthogonal slices is described and the benefit of orthogonal slices is discussed too., Comment: Draft of the papers published in Machine Graphics and Vision, Vol.13, No.3, Polish Academy of Sciences, Vol.13, No.3, pp.221-233, ISSN 1230-0535, 2004

In this paper four fundamental methods for an iso-surface extraction are compared, based on cell decomposition to tetrahedra. The methods are compared both on mathematically generated data sets as well as on real data sets. The comparison using mathematical data is made from different points of view such as area approximation, volume approximation. On the other hand, the Hausdorff distance and root mean square are used to compare methods on real data sets. The presented comparison can be helpful when deciding among tested methods which one to choose, as well as when we need to compare a newly developed method with other existing approaches., Comment: Draft of the paper submitted to Machine Graphics and Vision, Polish Academy of Sciences, Vol.13, No.4., pp.329-344, ISSN 1230-0535, 2004

The proposed Poseidon system is based on email services of filled forms instead of WEB server based services. This approach is convenient especially for small applications or small-medium companies. It is based on PDF forms that are available on a WEB page. PDF forms can be downloaded, off-line filled in, printed and finally sent by email for final processing. Data are actually stored in the local outbox waiting for a connection to a mail server. This follows an idea of the standard "paper" letter sending. Filled in data are actually sent when a user is on-line, therefore a user is "free" of being on-line when filling the forms. When the PDF form is processed on the recipient side, answer is sent back via email as well. Typical application is e.g. in conference management systems, systems for submission to journals etc. The great advantage of the PDF forms use is that they can be easily made or modified by a non-specialized administrative person easily., Comment: Draft of the paper submitted to International Journal of Computers, ISSN: 2367-8895

Bicubic four-sided patches are widely used in computer graphics, CAD/CAM systems etc. Their flexibility is high and enables to compress a surface description before final rendering. However, computer graphics hardware supports only triangular meshes. Therefore, four-sided bicubic patches are approximated by a triangular mesh. The border curves of a bicubic patch are of degree 3, while diagonal and anti-diagonal curves are of degree 6. Therefore the resulting shape and texturing depend on the actual mapping, i.e. how the tessellation of a bicubic patch is made. The proposed new modification of the Hermite bicubic patch, the HS-patch, is a result of additional restriction put on the Hermite bicubic patch formulation - the diagonal and anti-diagonal curves are of degree 3. This requirement leads to a new Hermite based bicubic four-sided patch with 12 control points and another 4 control points, i.e. twist vectors, are computed from those 12 control points., Comment: Draft of the paper: NAUN Journal International Journal of Mathematics and Computers in Simulation, Vol.8, pp.292-299, ISSN: 1998-0159, 2014. arXiv admin note: substantial text overlap with arXiv:2212.11986, arXiv:2212.11875

Bezier parametric patches are used in engineering practice quite often, especially in CAD/CAM systems oriented to mechanical design. In many cases quadrilateral meshes are used for tessellation of parameters domain. We propose a new modification of the Bezier cubic rectangular patch, the BS-patch, which is based on the requirement that diagonal curves must be of degree 3 instead of degree 6 as it is in the case of the Bezier patch. Theoretical derivation of conditions is presented and some experimental results as well. The BS-Patch is convenient for applications where for different tessellation of the u-v domain different degrees of diagonal curves are not acceptable., Comment: Draft of the paper: WSEAS Trans.on Mathematics, E-ISSN 2224-2880, No.5, Vol.12, pp.598-607, 2013. arXiv admin note: text overlap with arXiv:2212.11875

A new modification of the Hermite cubic rectangular patch is proposed: the S-Patch, which is based on the requirement that diagonal curves must be of degree 3 instead of degree 6 as it is in the case of the Hermite patch. Theoretical derivation of conditions is presented and some experimental results as well. The S-Patch is convenient for applications, where different tessellation of the u-v domain is needed, boundary and diagonal curves of different degrees are not acceptable., Comment: Draft of the paper: S-Patch: Modification of the Hermite Parametric Patch, ICGG 2010 conference, Kyoto, Japan, 2010

Numerical data processing is a key task across different fields of computer technology use. However, even simple summation of values is not precise due to the floating point representation use. This paper presents a practical algorithm for summation of values convenient for medium and large data sets. The proposed algorithm is simple, easy to implement. Its computational complexity is O(N) in the contrary of the Exact Sign Summation Algorithm (ESSA) approach with O(N^2) run-time complexity. The proposed algorithm is especially convenient for cases when exponent data differ significantly and many small values are summed with higher values, Comment: 9 pages, 3 Figs, 3 Tabs. Presented at Recent Advances in Computer Science Conf, 2013

A solution of linear systems of equations Ax=b and Ax=0 is a vital part of many computational packages. This paper presents a novel formulation based on the projective extension of the Euclidean space using the outer product (extended cross-product). This approach enables to solve the both cases, i.e. Ax=b and Ax=0. The proposed approach leads actually to an analytical solution of linear systems in the form on which the other vector operation can be applied before using the numerical evaluation. This contribution also proposes a new approach to the conditionality estimation of matrices applicable to non-squared matrices. It splits the conditionality to structural conditionality showing matrix property if nearly unlimited precision is used, numerical issue which depends on numerical representation with respect to the right-hand side influence, if given.

This paper describes a novel and fast, simple and robust algorithm with O(N) expected complexity which enables to decrease run time needed to find the maximum distance of two points in E2. It can be easily modified for the E3 case in general. The proposed algorithm has been evaluated experimentally on larger different datasets in order to verify it and prove expected properties of it. Experiments proved the advantages of the proposed algorithm over the standard algorithms based on the Brute force, convex hull or convex hull diameters approaches. The proposed algorithm gives a significant speed-up to applications, when medium and large data sets are processed. It is over 10 000 times faster than the standard Brute force algorithm for 10 mil. points randomly distributed points in E2 and over 4 times faster than convex hull diameter computation. The speed-up of the proposed algorithm grows with the number of points processed., Comment: This contribution was partially presented as an extended abstract at the ICNAAM 2013 conference, DOI: 10.1063/1.4826047, arXiv DOI:10.48550/arXiv.2208.04730

Acceleration of algorithms is becoming a crucial problem, if larger data sets are to be processed. Evaluation of algorithms is mostly done by using computational geometry approach and evaluation of computational complexity. However in todays engineering problems this approach does not respect that number of processed items is always limited and a significant role plays also speed of read/write operations. One general method how to speed up an algorithm is application of space subdivision technique and usually the orthogonal space subdivision is used. In this paper non-orthogonal subdivisions are described. The proposed approach can significantly improve memory consumption and run-time complexity. The proposed modified space subdivision techniques are demonstrated on two simple problems Point-in-Convex Polygon and Point-in-Convex Polyhedron tests., Comment: 4 pages, 8 figures

There are many practical applications based on the Least Square Error (LSE) or Total Least Square Error (TLSE) methods. Usually the standard least square error is used due to its simplicity, but it is not an optimal solution, as it does not optimize distance, but square of a distance. The TLSE method, respecting the orthogonality of a distance measurement, is computed in d-dimensional space, i.e. for points given in E2 a line p in E2, resp. for points given in E3 a plane in rho in E3, fitting the TLSE criteria are found. However, some tasks in physical sciences lead to a slightly different problem. In this paper, a new TSLE method is introduced for solving a problem when data are given in E3 and a line p in E3 is to be found fitting the TLSE criterion. The presented approach is applicable for a general -dimensional case, i.e. when points are given in E^d a line E^d is to be found. This formulation is different from the TLSE formulation., Comment: arXiv admin note: text overlap with arXiv:2208.03674

This paper describes novel and fast, simple and robust algorithm with O(N) expected complexity which enables to decrease run-time needed to find an exact maximum distance of two points in E2. The proposed algorithm has been evaluated experimentally on larger different datasets. The proposed algorithm gives a significant speed-up to applications, when medium and large data sets are processed. It is over 10 000 times faster than the standard algorithm for 10^6 points randomly distributed points in E2. Experiments proved the advantages of the proposed algorithm over the standard algorithm and convex hull diameters approaches.

This paper presents a new approach to computation of geometric continuity for parametric bi-cubic patches, based on a simple mathematical reformulation which leads to simple additional conditions to be applied in the patching computation. The paper presents an Hermite formulation of a bicubic parametric patch, but reformulations can be made also for B\'ezier and B-Spline patches as well. The presented approach is convenient for the cases when valencies of corners are different from the value 4, in general.

Line intersection with convex and un-convex polygons or polyhedron algorithms are well known as line clipping algorithms and very often used in computer graphics. Rendering of geometrical problems often leads to ray tracing techniques, when an intersection of many lines with spheres or quadrics is a critical issue due to ray-tracing algorithm complexity. A new formulation of detection and computation of the intersection of line (ray) with a quadric surface is presented, which separates geometric properties of the line and quadrics that enables pre-computation. The presented approach is especially convenient for implementation with SSE instructions or on GPU

There are many applications in which a bounding sphere containing the given triangle E3 is needed, e.g. fast collision detection, ray-triangle intersecting in raytracing etc. This is a typical geometrical problem in E3 and it has also applications in computational problems in general. In this paper a new fast and robust algorithm of circumscribed sphere computation in the -dimensional space is presented and specification for the E3 space is given, too. The presented method is convenient for use on GPU or with SSE or Intel AVX instructions on a standard CPU

There are many space subdivision and space partitioning techniques used in many algorithms to speed up computations. They mostly rely on orthogonal space subdivision, resp. using hierarchical data structures, e.g. BSP trees, quadtrees, octrees, kd-trees, bounding volume hierarchies, etc. However in some applications a non-orthogonal space subdivision can offer new ways for actual speed up. In the case of convex polygon in E3 a simple Point-in-Polygon test is of the O(N) complexity and the optimal algorithm is of O(lg N) computational complexity. In the E3 case, the complexity is O(N) even for the convex polyhedron as no ordering is defined. New Point-in-Convex Polygon and Point-in-Convex Polyhedron algorithms are presented based on space subdivision in the preprocessing stage resulting to O(1) run-time complexity. The presented approach is simple to implement. Due to the principle of duality, dual problems, e.g. line-convex polygon, line clipping, can be solved in a similarly.

Many algorithms used are based on geometrical computation. There are several criteria in selecting appropriate algorithm from already known. Recently, the fastest algorithms have been preferred. Nowadays, algorithms with a high stability are preferred. Also technology and computer architecture, like GPU etc., plays a significant role for large data processing. However, some algorithms are ill-conditioned due to numerical representation used; result of the floating point representation. In this paper, relations between projective representation, duality and Plucker coordinates will be explored with demonstration on simple geometric examples. The presented approach is convenient especially for application on GPUs or vector-vector computational architectures, Comment: arXiv admin note: substantial text overlap with arXiv:1708.06684

Single-atom catalysts represent an essential and ever-growing family of heterogeneous catalysts. Recent studies indicate that besides the valuable catalytic properties provided by single-atom active sites, the presence of single-atom sites on the catalyst substrates may significantly influence the population of supported metal nanoparticles coexisting with metal single atoms. Treatment of ceria-based single-atom catalysts in oxidizing or reducing atmospheres was proven to provide precise experimental control of the size of the supported Pt nanoparticles, and, correspondingly, control of catalyst activity and stability. Based on dedicated surface science experiments, ab-initio calculations and kinetic Monte-Carlo simulations we demonstrate that the morphology of Pt nanoparticle population on ceria surface is a result of a competition for Pt atoms between Pt single-atom sites and Pt nanoparticles. In oxidizing atmosphere, Pt single-atom sites provide strong bonding to single Pt atoms and Pt nanoparticles shrink. In reducing atmosphere, Pt single atom sites are depopulated and Pt nanoparticles grow. We formulate a generic model of Pt redispersion and coarsening on ceria substrates. Our model provides a unified atomic-level explanation for a variety of metal nanoparticle dynamic processes observed in single-atom catalysts under stationary or alternating oxidizing/reducing atmospheres, and allows to classify the conditions when nanoparticle ensembles on single-atom catalysts substrates can be stabilized against Ostwald ripening.

De-identification of data used for automatic speech recognition modeling is a critical component in protecting privacy, especially in the medical domain. However, simply removing all personally identifiable information (PII) from end-to-end model training data leads to a significant performance degradation in particular for the recognition of names, dates, locations, and words from similar categories. We propose and evaluate a two-step method for partially recovering this loss. First, PII is identified, and each occurrence is replaced with a random word sequence of the same category. Then, corresponding audio is produced via text-to-speech or by splicing together matching audio fragments extracted from the corpus. These artificial audio/label pairs, together with speaker turns from the original data without PII, are used to train models. We evaluate the performance of this method on in-house data of medical conversations and observe a recovery of almost the entire performance degradation in the general word error rate while still maintaining a strong diarization performance. Our main focus is the improvement of recall and precision in the recognition of PII-related words. Depending on the PII category, between $50\% - 90\%$ of the performance degradation can be recovered using our proposed method., Comment: Accepted to INTERSPEECH 2022

This contribution presents a brief survey of clipping and intersection algorithms in E2 and E3 with a nearly complete list of relevant references. Some algorithms use the projective extension of the Euclidean space and vector-vector operations, which supports GPU and SSE use., Comment: 22 pages

Molecular functionalization of nanoparticles and metallic substrates can be used to tune their properties for specific applications. However, polycrystalline substrates and nanoparticles exhibit surface planes with distinct crystallographic orientations. Therefore, the development of reliable strategies for molecular functionalization requires knowledge of the role of the surface plane orientation in the growth kinetics, structure, and properties of the molecular layer. Here, we apply a multiscale analysis to investigate the self-assembly of 4,4'-biphenyl-dicarboxylic acid (BDA) on Ag(111) and critically discuss the difference to Ag(100). Whereas the structural motifs for intact and fully deprotonated BDA are similar on both surfaces, the intermediate phases comprising partially deprotonated BDA differ in the structure and chemical composition. A real-time view of the phase transformations enables us to present a generalized picture of the phase transformations between the self-assembled molecular phases on the surfaces and underline important features such as the phase stabilization of the chemical composition and the mechanism of the related burst transformation. The influence of the substrate orientation on the structure of molecular layers and phase transformations provides the necessary background for developing functionalization strategies of the substrates displaying multiple surface planes and kinetic models for the growth near thermodynamic equilibrium.

The precise energy level alignment between a metal electrode and an organic semiconductor is required to reduce contact resistance and enhance the efficiency of organic-semiconductor-based devices. One of the ways is to include interlayers that mediate the energy level alignment, i.e., charge injection layers (CILs). Here we introduce the monolayer thick CILs based on the aromatic carboxylic acids that can induce the energy level shift in the subsequent layers by up to 0.8 eV. By gradual chemical transformation of the as-deposited molecules, we achieve a highly tunable energy level shift in the range of 0.5 eV. We reveal that the position of both the work function and energy-level position in the CIL increases linearly with the density of induced dipoles. The energy level position of subsequent layers changes in the same way as the CIL. Our results thus connect the energy alignment quantities, i.e., energy level positions of both CIL and subsequent layers and sample work function. The high tunability would allow precise tuning of the active layers deposited on the CIL, which marks the path towards efficient charge injection layers on metal electrodes.