Search

This paper argues that the social power of algorithms comes to the fore through the narratives they generate about individuals. Proposing the notion of 'algorithmic emplotment', the article showcases the ways in which algorithms construct and tell narratives about us, participating in shaping people's encounters with the world and their perceptions of it. The concept denotes the processes through which data, people, experiences, and complex temporalities are ordered, woven together, and presented as coherent, frictionless narratives in the present. Through an analysis of the smartphone feature called Apple Memories, the paper seeks to highlight the narratives algorithms tell, how they are constructed, and the potential impacts they may have on everyday life. The concept of algorithmic emplotment is used to scrutinise the ways in which people's lives are rendered sequential, ordered, and ultimately meaningful and actionable by algorithmic processes. [ABSTRACT FROM AUTHOR]

Algorithmic decision-making and other types of artificial intelligence (AI) can be used to predict who will commit crime, who will be a good employee, who will default on a loan, etc. However, algorithmic decision-making can also threaten human rights, such as the right to non-discrimination. The paper evaluates current legal protection in Europe against discriminatory algorithmic decisions. The paper shows that non-discrimination law, in particular through the concept of indirect discrimination, prohibits many types of algorithmic discrimination. Data protection law could also help to defend people against discrimination. Proper enforcement of non-discrimination law and data protection law could help to protect people. However, the paper shows that both legal instruments have severe weaknesses when applied to artificial intelligence. The paper suggests how enforcement of current rules can be improved. The paper also explores whether additional rules are needed. The paper argues for sector-specific – rather than general – rules, and outlines an approach to regulate algorithmic decision-making. [ABSTRACT FROM AUTHOR]

Algorithms make highly consequential decisions and, thereby, exercise considerable power. In this study, I investigate how social power through algorithms is exercised in media consumption, particularly through curation algorithms. This conceptual paper then contributes to the understanding of social power through algorithms by suggesting the concept of algorithmic meta-capital. The concept derives from Bourdieu's theory on meta-capital which has also been applied to legacy media. I then argue that this algorithmic meta-capital is an extension of the power traditionally held by the state and legacy media. The study also contributes to the understanding of meta-capital as it proposes how the meta-capital possessed by digital intermediaries functions. It does so by legitimating representations of the world and by creating a necessity for algorithmic visibility across different fields, thereby shaping habitus. This Bourdieusian approach enables researchers to take a balanced view on the power of algorithms on the structure/agency continuum. [ABSTRACT FROM AUTHOR]

The eruption of disruptive digital platforms is reshaping geographies of housing under the gaze of corporations and through the webs of algorithms. Engaging with interdisciplinary scholarship on informal housing across the Global North and South, we propose the term 'digital informalisation' to examine how digital platforms are engendering new and opaque ways of governing housing, presenting a theoretical and political blind spot. Focusing on rental housing, our paper unpacks the ways in which new forms of digital management of risk control access and filter populations. In contrast to progressive imaginaries of 'smart' technological mediation, practices of algorithmic redlining, biased tenant profiling and the management of risk in private tenancies and in housing welfare both introduce and extend discriminatory and exclusionary housing practices. The paper aims to contribute to research on informal housing in the Global North by examining digital mediation and its governance as key overlooked components of housing geographies beyond North and South dichotomies. [ABSTRACT FROM AUTHOR]

In the paper, the concept of self-healing effects, permanent or limited duration on system health, is introduced by building a class of cumulative damage shock models in terms of the integral for counting processes including Poisson process, Hawkes process and Affine process, and so on. Based on the established shock models, the property on lifetime and the bounds of system reliability are discussed, especially for the simplest case. Then the general simulation algorithm is given for the general situation under the given cumulative damage shock models, because it is impossible to present the general analytical results on the reliability of systems. Some numerical examples are given to illustrate the algorithm and bounds of reliability. Finally, the whole works in the paper are concluded. [ABSTRACT FROM AUTHOR]

Drawing upon interviews with 72 practitioners of automated, ultrafast high-frequency trading (HFT), this paper identifies the most salient divide within HFT: between algorithms, trading groups and firms that specialize in 'making' (in adding bids to buy and offers to sell to exchanges' electronic order books) and those that specialize in 'taking' (in executing against existing bids and offers in those order books). The paper explores how 'making' and 'taking' algorithms interact, emphasizing the materiality of that interaction (including, e.g. the surprising effect on it of rain), and suggesting the importance of the 'material political economy' of algorithmic trading: the shaping of that trading, in economically consequential ways, by material orderings that could be different. [ABSTRACT FROM AUTHOR]

This paper follows the proliferation of the "line-drawing algorithm," a method for encoding lines into digital media that saw widespread application in early interactive computing. The algorithm reveals a tightly linked complex of graphical technologies which integrated disparate hardware and software into continuous, real-time operation. Generated by this algorithm, the rasterized line offered an interactive form of graphic production, one categorically distinct from the inscribed line of orthographic representation. It transformed geometry into a computable entity, reproduced the line in an array of display technologies, and standardized its usage through the practices of computer graphics programming. As an automated method that produced lines from data manipulated by a user, the algorithm illuminates a shift in the work of graphic representation from drawing to modeling. This change is considered against discourses that posit line drawing as integral to an architectural notion of representation, examining the capacity of the algorithmic line to mask historical discontinuities and suggesting that drawing and line, rather than denoting stable disciplinary categories, are constantly constructed within broader technological regimes. [ABSTRACT FROM AUTHOR]

A particular decision-making process that is needed by most firms who produce joint products is the one requiring an assessment of desirability of further processing joint products beyond the split-off point. The purpose of this paper is to develop an algorithm for optimizing a joint products further processing decision under the theory of constraints. To fit the jointly produced characteristic of joint products and the sequential produced characteristic between each joint product and its further processing product, the algorithm is composed of seven steps. These steps consider every bottleneck resource to the decision-making process by computing a priority ratio to establish its priority sequence. According to the priority sequence of the most constrained resource, the initial master production schedule is developed. Then, the following steps find the best path to reach the optimal solution under the guidance of all bottleneck resources. Due to its accessibility and comprehensibility, the TOC-based algorithm developed by this paper is a practical tool for obtaining the optimal joint products further processing decision. [ABSTRACT FROM AUTHOR]

Full-field simulations used to enhance the predictive capability of classical finite element models require the preparation of high-quality initial digital material representation (DMR) data. Depending on the selected method, such a procedure can be time-consuming and, in subsequent model runs, result in a significant increase in computational time. An unconstrained grain growth algorithm based on the random cellular automata (RCA) method can be used as a potential solution to provide high-quality DMR. However, the most time-consuming part of that approach, the neighbor-search algorithm, should be optimized from an algorithmic point of view before practical application in full-field analysis. Therefore, four neighbor-search algorithms dedicated to the RCA method were developed and benchmarked within the paper for the algorithm's complexity and impact of individual parameters on computational efficiency. The research has shown that significantly reducing RCA simulation time is possible with the properly developed neighbor-search algorithm and problem-specific code optimizations. [ABSTRACT FROM AUTHOR]

This paper presents a Quality of Service (QoS) guaranteed dynamic grid resource scheduling algorithm. It mainly deals with multiple QoS-based grid resource scheduling models and solves the scheduling problems using optimization techniques. The paper proposes the idea of decomposing a global optimization problem in multiple QoS-based resource scheduling into two sub-problems, which simplifies the problem and makes it mathematically tractable. An iterative algorithm is also presented to get grid users and grid resource providers to interact with each other in an interactive process in resource market and achieve optimal QoS constraint dynamic grid resource scheduling. The paper provides performance studies comparing the proposed optimal approach with three possible easier approaches, which provide only partial optimization. The experimental results show that the proposed approach considering both computation and network traffic is able to better optimize the execution time than approaches, which consider only one or none of these criteria. [ABSTRACT FROM AUTHOR]

The finite-difference (FD) scheme is extensively applied in seismic modelling, imaging and inversion due to its advantages of large-scale parallel computing and programming. However, numerical dispersion caused by using a difference operator in substitution for the differential operator is non-negligible, which reduces the accuracy of the modelling and can lead to some misinterpretations. In addition, the computing resources required by the FD scheme is highly demanding when dealing with large models, which limits its applicability. In this paper, a new optimised FD scheme is proposed, which is based on an improved particle swarm optimisation (PSO) algorithm. We improve the conventional PSO algorithm by introducing strategies related to local learning and global learning, which contribute to accelerating the convergence rate and effectively avoiding getting trapped in local extrema. Then, the improved PSO algorithm is used to improve the conventional FD scheme. Dispersion analysis and numerical modelling demonstrate that the low-order optimised FD scheme can achieve higher accuracy than a high-order conventional operator. Compared with the conventional FD scheme and a FD scheme based on the Remez exchange algorithm, the optimised FD scheme based on the improved PSO algorithm can more efficiently suppress numerical dispersion and increase computational efficiency. [ABSTRACT FROM AUTHOR]

Seismic data interpolation is a meaningful research topic in the field of seismic data processing. In this paper, we propose deep internal learning for interpolating regularly sampled aliased seismic data, to improve the upsampling accuracy of regularly sampled aliased seismic data. The proposed algorithm, contrary to previous deep external learning-based seismic interpolation relying on prior training for vast external seismic data, exploits the characteristics of the field data itself, based on the feature similarity between the regularly missing and remaining samples. Internal learning generates training samples solely from the currently remaining regularly undersampled seismic data, and then trains a simple convolutional neural network using the training set. Finally, the trained model is used to upsample the current seismic traces regularly with high accuracy, and can adapt itself intelligently to different field data for the upsampling requirement. This enables seismic data antialiasing interpolation on regularly sampled seismic data with a small sample in the case of insufficient data. The performance of the proposed deep internal learning is assessed using synthetic and field data, respectively. Moreover, the comparison of the proposed deep internal learning with a classic prediction-based interpolation method and deep external learning-based seismic interpolation validates the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

More and more aspects of our everyday lives are being mediated, augmented, produced and regulated by software-enabled technologies. Software is fundamentally composed of algorithms: sets of defined steps structured to process instructions/data to produce an output. This paper synthesises and extends emerging critical thinking about algorithms and considers how best to research them in practice. Four main arguments are developed. First, there is a pressing need to focus critical and empirical attention on algorithms and the work that they do given their increasing importance in shaping social and economic life. Second, algorithms can be conceived in a number of ways – technically, computationally, mathematically, politically, culturally, economically, contextually, materially, philosophically, ethically – but are best understood as being contingent, ontogenetic and performative in nature, and embedded in wider socio-technical assemblages. Third, there are three main challenges that hinder research about algorithms (gaining access to their formulation; they are heterogeneous and embedded in wider systems; their work unfolds contextually and contingently), which require practical and epistemological attention. Fourth, the constitution and work of algorithms can be empirically studied in a number of ways, each of which has strengths and weaknesses that need to be systematically evaluated. Six methodological approaches designed to produce insights into the nature and work of algorithms are critically appraised. It is contended that these methods are best used in combination in order to help overcome epistemological and practical challenges. [ABSTRACT FROM PUBLISHER]

In this paper, we study the families of n-dimensional Lie algebras associated with a combinatorial structure made up of n vertices and with its edges forming a complete simple, undirected graph. Moreover, some properties are characterized for these structures using Lie theory, giving some examples and representations. Furthermore, we also study the type of Lie algebras associated with them in order to get their classification. Finally, we also show an implementation of the algorithmic method used to associate Lie algebras with complete triangular structures. [ABSTRACT FROM AUTHOR]

In this paper, we give an elegant algorithm to generate all distributions of n identical objects to m bins without repetition. The best known previous algorithm, due to Klingsberg, generates each distribution in constant time in average sense. Using a new technique of efficient tree traversal, in this paper we improve the time complexity to constant time (in ordinary sense). By modifying our algorithm, we can generate the distributions in anti-lexicographic order. Overall space complexity of our algorithm is O(mlgn), where m is the number of bins and n is the number of objects. [ABSTRACT FROM AUTHOR]

In this article, we introduce a new type of generalized mixed ordered quasi-variational inclusion problem in the setting of real ordered Hilbert spaces. Further, we propose a perturbed three-step iterative algorithm for solving generalized mixed ordered quasi-variational inclusion problem. By using the relaxed resolvent operator method with XOR technique, we prove the existence of solution of generalized mixed ordered quasi-variational inclusion problem and discuss the convergence analysis and stability of the proposed algorithm. The iterative algorithm and results presented in this paper generalize, improve and significantly refine many previously known results of this area. Moreover, we give a numerical example to illustrate and show the convergence of the proposed algorithm in support of our main result. [ABSTRACT FROM AUTHOR]

It is shown in this paper that a quasi order for the vectors in Rp is a cone induced if and only if the order is preservable under limits and under linear combinations with non-negative coefficients. For the mean vectors in MANOVA subject to the restriction of simple ordering, a pseudo restricted MLE is proposed. This estimator is a matrix projection onto a closed convex set inside the restricted domain. An algorithm for the pseudo restricted MLE is developed, that computes the matrix projections using only vector projections. [ABSTRACT FROM AUTHOR]

In this paper we give an algorithm to generate all distributions of distinguishable objects to bins without repetition. Our algorithm generates each distribution in constant time. To the best of our knowledge, our algorithm is the first algorithm which generates each solution in O(1) time in the ordinary sense. As a byproduct of our algorithm, we obtain a new algorithm to enumerate all multiset partitions when the number of partitions is fixed and the partitions are numbered. In this case, the algorithm generates each multiset partitions in constant time (in the ordinary sense). Finally, we extend the algorithm to the case when the bins have priorities associated with them. Overall space complexity of the algorithm is O(mklgn), where there are m bins and the objects fall into k different classes. In a companion paper, the generation of all distributions of identical objects to bins is also considered. [ABSTRACT FROM AUTHOR]

The current study is related to the issue of computer-aided reverse engineering. Although the proposed technique has been suggested and adopted for the image-based planar objects, it is extendable to the objects in three dimensions (3D) with some modifications. The objective of the present study is to provide a robust and automated solution and methodology for the applications of reverse engineering technology in manufacturing and other industries. By extracting nearly exact geometric data of the models, the key points (one may call them ‘corner points’) from the data are detected using an efficient technique. Then curve or surface models are fitted by using non-uniform rational B-splines (NURBS). In curve or surface fitting problems, the selection of appropriate parameters, in order to obtain an optimized shape design, is a well-known problem. For large data, this problem needs to be dealt with by optimization algorithms avoiding possible local optima and at the same time reaching the desired solution in an iterative fashion. Many evolutionary optimization techniques including genetic algorithm and simulated annealing have been applied to the problem. This paper presents an application of an evolutionary heuristic technique known as ‘simulated evolution’ (SimE) to the curve and surface fitting problems using NURBS. NURBS have become the standard for representing curves and surfaces. This paper presents a method for approximating NURBS using digitized data. Instead of using the classical optimization approach to solve the problem, a new method based on SimE is developed. The shape parameters, in the description of NURBS, have been targeted to be optimized in a best possible way. The paper describes the mapping scheme of the problem to SimE followed by the proposed algorithm outlines with the interesting results obtained. [ABSTRACT FROM AUTHOR]

It is well known that data mining has been implemented by statistical regressions, induction decision tree, neural networks, rough set, fuzzy set and etc. This paper promotes a multiple criteria linear programming (MCLP) approach to data mining based on linear discriminant analysis. This paper first describes the fundamental connections between MCLP and data mining, including several general models of MCLP approaches. Given the general models, it focuses on a designing architecture of MCLP-data mining algorithms in terms of a process of real-life business intelligence. This architecture consists of finding MCLP solutions, preparing mining scores, and interpreting the knowledge patterns. Secondly, this paper elaborates the software development of the MCLP-data mining algorithms. Based on a pseudo coding, two versions of software (SAS- and Linux-platform) will be discussed. Finally, the software performance analysis over business and experimental databases is reported to show its mining and prediction power. As a part of the performance analysis, a series of data testing comparisons between the MCLP and induction decision tree approaches are demonstrated. These findings suggest that the MCLP-data mining techniques have a great potential in discovering knowledge patterns from a large-scale real-life database or data warehouse. [ABSTRACT FROM AUTHOR]

A mixed-model assembly line comprises a set of workstations in serial and a conveyor moving at a constant speed, which can assemble variety products in different models during a working shift or a working day. Initial-units that belong to different models are successively fed onto the conveyor at a given cycle time length to get into the assembling operations as semi-products. The conveyor moves semi-products to pass through the workstations gradually to complete the assembling operations for generating finished products. A set of warehouses stores finished products, and each model has a specified warehouse. Customers arrive at the warehouses to demand finished products with stochastic demand forms. A daily scheduling task is the determination of the sequence that specifies the feeding order of the models, which must be set out at the beginning of each day. This paper deals with a new goal, 'sequence-to-customer', with stochastic customer demands. An optimization problem is formulated with the objective of minimizing the system cost that includes the holding cost for finished products and the penalty cost for backordered customers during a decision horizon. A lower bound of the system cost is found, which is useful in verifying the optimality of any solution. A heuristic algorithm is proposed to solve the optimization problem, which can obtain optimal solutions or near-optimal solutions with almost ignorable relative errors to optimal solutions. By using the algorithm, the behaviour of the system cost with respect to the variation in customer demands is also investigated to provide insights into management of a mixed-model assembly line. [ABSTRACT FROM AUTHOR]

An algorithm for modelling 3D flexible pavements using the discrete element method (DEM) is put forward in this paper. Firstly, this algorithm can generate the various shapes, sizes and angularity of coarse aggregates and place them randomly within the model of flexible pavements, besides, the asphalt mastic and voids are generated. The micro parameters in DEM model are verified by the tests for mechanical properties. Then, the model of utilising vibration cutting for flexible pavements in road miller is established and corresponding formulas are inferred. Finally, two kinds of vibration cutting utilised in road miller are simulated and the results shown that utilising the vibration cutting along the horizontal direction is better than the elliptical vibration cutting, the amplitudes and frequency of vibration are optimised using DEM in PFC3D. [ABSTRACT FROM AUTHOR]

In this paper, we show an algorithmic procedure to compute abelian subalgebras and ideals of a given finite-dimensional Leibniz algebra, starting from the non-zero brackets in its law. In order to implement this method, the symbolic computation package MAPLE 12 is used. Moreover, we also show a brief computational study considering both the computing time and the memory used in the two main routines of the implementation. Finally, we determine the maximal dimension of abelian subalgebras and ideals for 3-dimensional Leibniz algebras and 4-dimensional solvable ones over. [ABSTRACT FROM PUBLISHER]

While the solution to deriving the roots of the general quadratic equation is adequately covered in a typical classroom environment, the same is not true for the general cubic and quartic equations. To the best of our knowledge, we do not see the roots of the general cubic or quartic equation discussed in any typical algebra textbook at the undergraduate level. In this paper, we propose an efficient algorithm in order to calculate the roots of the general quadratic, cubic and quartic equations. Examples are given to demonstrate the usefulness of this proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we propose an iterative algorithm for a simplified friction problem which is formulated as an elliptic variational inequality of the second kind. We approximate the simplified friction problem by a discrete system with the finite element method. Based on the use of the linearized technique and by constructing a particular function, we put forward the new algorithm to get the discrete solution. This algorithm is attractive due to its simple proof of convergence and easy implementation. A linear equation is solved in each iteration. Numerical results confirm that our algorithm is efficient and mesh independent. [ABSTRACT FROM AUTHOR]

This paper deals with several operations on graphs and combinatorial structures linking them with their associated Lie algebras. More concretely, our main goal is to obtain some criteria to determine when there exists a Lie algebra associated with a combinatorial structure arising from those operations. Additionally, we show an algorithmic method for one of those operations. [ABSTRACT FROM PUBLISHER]

This paper evaluates the ability of a Markov regime-switching log-normal (RSLN) model to capture the time-varying features of stock return and volatility. The model displays a better ability to depict a fat tail distribution as compared with using a log-normal model, which means that the RSLN model can describe observed market behavior better. Our major objective is to explore the capability of the model to capture stock market behavior over time. By analyzing the behavior of calibrated regime-switching parameters over different lengths of time intervals, the change-point concept is introduced and an algorithm is proposed for identifying the change-points in the series corresponding to the times when there are changes in parameter estimates. This algorithm for identifying change-points is tested on the Standard and Poor's 500 monthly index data from 1971 to 2008, and the Nikkei 225 monthly index data from 1984 to 2008. It is evident that the change-points we identify match the big events observed in the US stock market and the Japan stock market (e.g., the October 1987 stock market crash), and that the segmentations of stock index series, which are defined as the periods between change-points, match the observed bear-bull market phases. [ABSTRACT FROM AUTHOR]

Determining foot touchdown and foot takeoff is an essential part of gait analysis protocols and is usually accomplished using force plate data and thresholds for the vertical component of the ground reaction force (GRF). It has been proposed that gait events can also be estimated from kinematic data, and several algorithms have already been published. However, many of these algorithms were designed and specified for application in walking gait only. Hence, the purpose of this paper is to present our newly developed foot contact algorithm (FCA) and compare its estimation accuracy for touchdown and takeoff to a selection of existing algorithms. Forty one subjects were analyzed in a laboratory setup recording ground reaction forces and 3D-kinematic data of the lower limbs during running in three different running shoes. Prediction error of touchdown and takeoff was quantified in relation to gold standard events determined from force-plate data. Out of the evaluated algorithms, only FCA was able to estimate touch down and take off with similar precision, and is recommended when analyzing running gait. Furthermore, we found no evidence that different running shoes influenced the prediction error for any of the used algorithms. [ABSTRACT FROM AUTHOR]

In a similar manner as in the papers by W. Koepf, D. Schmersau, Spaces of functions satisfying simple differential equations, Konrad-Zuse-Zentrum Berlin (ZIB), Technical Report TR 94-2 (1994) and Salvy, B., Zimmermann, P., GFUN: A package for the manipulation of generating and holonomic functions in one variable, ACM Transactions on Mathematical Software, (1994), pp. 163-177, where explicit algorithms for finding the differential equations satisfied by holonomic functions were given, in this paper we deal with the space of the q-holonomic functions which are the solutions of linear q-differential equations with polynomial coefficients. The sum, product and the composition with power functions of q-holonomic functions are also q-holonomic and the resulting q-differential equations can be computed algorithmically. [ABSTRACT FROM AUTHOR]

Our everyday practices are increasingly mediated through online technologies, entailing the navigation and also oft-simultaneous creation of large quantities of information and communication data. The scale and types of activities being undertaken, the data that are being created and engaged with, and the possibilities for analysis, archiving and distribution are now so extensive that technical constructs are necessarily required as a way to manage, interpret and distribute these. These constructs include the platforms, the software, the codes and the algorithms. This paper explores the place of the algorithm in shaping and engaging with the contemporary everyday. It does this via an exploration of some particular instances of algorithmic sorting and presentation as well as considering some of the ways these contribute to shaping our everyday practices and understandings. In doing so, it raises questions about understandings of agency and power, shifting world views and our complex relationship with technologies. [ABSTRACT FROM PUBLISHER]

The work presented in this paper is dealing with the quality monitoring problem of the electric power. It aims to introduce new technique to treat and to analyze the electrical energy quality related to the voltage dips. It concerns the detection and the classification of voltage dips based on their characterizations. The results of this work are provided using simulation studies under MATLAB / Simulink software. [ABSTRACT FROM AUTHOR]

Copyright of Regional Studies is the property of Routledge and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In this paper, we develop efficient exact and approximate algorithms for computing a maximum independent set in random graphs. In a random graphG, each pair of vertices are joined by an edge with a probabilityp, wherepis a constant between 0 and 1. We show that a maximum independent set in a random graph that containsnvertices can be computed in expected computation time. In addition, we show that, with high probability, the parameterized independent set problem is fixed parameter tractable in random graphs and the maximum independent set in a random graph innvertices can be approximated within a ratio ofin expected polynomial time. [ABSTRACT FROM AUTHOR]

Due to the extensive differential diagnoses and overlapping clinical features, determining the aetiology of a crystalline retinopathy can be challenging. More effective ways are needed to help clinicians isolate the cause of a crystalline retinopathy and determine the appropriate management of concomitant ocular and/or systemic disease. This paper reviews literature on crystalline retinopathy focusing upon the key features of each aetiology, including medical history, laterality, and examination findings. Based on this review, an algorithm was formulated to clinically classify causes of crystalline retinopathy, which may help practising clinicians identify and manage key causes of crystalline retinopathy. [ABSTRACT FROM AUTHOR]

This paper reviews the advanced differential interferometry synthetic aperture radar (A-DInSAR) techniques, with two major components in focus. First is the basic concepts, synthetic aperture radar (SAR) data sources and the different algorithms documented in the literature, primarily focusing on persistent scatterers. In the second part, the techniques are compared in order to establish more linkage in terms of the variability of their applications, strength and validation of the interpreted results. Also, current issues in sensor and algorithm development are discussed. The study identified six existing A-DInSAR algorithms used for monitoring various deformation types. Generally, reports of their performance indicate that all the techniques are capable of measuring deformation phenomena at varying spatial resolution with high level of accuracy. However, their usability in suburban and vegetated areas yields poor results, compared to urbanized areas, due to inadequate permanent features that could provide sufficient coherent point targets. Meanwhile, there is continuous development in sensors and algorithms to expand the applicability domain of the technology for a wide range of deformable surfaces and displacement patterns with higher precision. On the sensor side, most of the latest SAR sensors employ longer wavelength (X and P bands) to increase the penetrating power of the signal and two other sensors (ALOS-2 PALSA-2 and SENTINEL-1) are scheduled to be launched in 2013. Researchers are investigating the possibility of using single-pass sensors with different look angles for SAR data collection. With these, it is expected that more data will be available for various applications. Algorithms such as corner reflector interferometry SAR, along track interferometry, liqui-InSAR, and squeeSAR are emerging to increase reliable estimation of deformation from different surfaces. [ABSTRACT FROM PUBLISHER]

In this paper, we consider semi-online scheduling problems on parallel identical machine system which result from the online scheduling problem for jobs with arbitrary release times by knowing part information of the release times or processing sizes. The conditions are informed that the release times are nondecreasing sequence and the processing lengths are similar inwith. An upper bound of the competitive ratio of List Scheduling (LS) algorithm is given and it is proved that the LS schedule is optimal whenfor any. Furthermore, forwe present a tight bound when. We also show that the competitive ratio of the LS algorithm is improved when additional information is known by letting each job have release time zero. However, if the processing lengths are arbitrary, then no impact on the competitive ratio of the LS algorithm occurs after imposing the additional information. [ABSTRACT FROM AUTHOR]

A number of features, such as settlements and islands, are represented using point symbols on intermediate and micro scale maps. If the maps are reduced to smaller scale, the point features need to be simplified to make the maps legible. Hence, it is necessary to develop algorithms for point feature generalisation. For the reason above, an algorithm based on the multiplicatively weighted Voronoi diagram (MWVD) is proposed in the paper. To ensure statistical, thematic, metric and topological information contained in the original point features can be transmitted correctly after simplification, the algorithm selects corresponding measures (i.e. the number of points, weight, Voronoi neighbour, Voronoi polygon and distribution range) to quantify the four types of information, and integrates the measures in the process of point feature generalisation. First, the algorithm detects the range polygon of the given point features; second, it adds the pseudo points (i.e. the vertices of the range polygon) to the original points to form a new point set and tessellates the new point set to get the MWVD; then it computes the selection probability of each point using the area of each Voronoi polygon, and sorts all points in decreasing order by their selection probability values; after this, it marks those to-be-deleted points as ‘deleted’ according to their selection probability values and their Voronoi neighbouring relations, and determines if they can be physically deleted. Finally, the algorithm is ended by comparing the number of points retained on the map with that computed by the Radical Law. The algorithm is parameter-free, automatic and easy to understand, owing to the use of the MWVD. As the experiments show, it can be used in simplification of point features arranged in clusters, such as settlements, islands and control points on topographic maps at intermediate/ micro scale. [ABSTRACT FROM AUTHOR]

The numerical simulation of Bileaflet Mechanical Heart Valves (BMHVs) has gained strong interest in the last years, as a design and optimisation tool. In this paper, a strong coupling algorithm for the partitioned fluid–structure interaction simulation of a BMHV is presented. The convergence of the coupling iterations between the flow solver and the leaflet motion solver is accelerated by using the Jacobian with the derivatives of the pressure and viscous moments acting on the leaflets with respect to the leaflet accelerations. This Jacobian is numerically calculated from the coupling iterations. An error analysis is done to derive a criterion for the selection of useable coupling iterations. The algorithm is successfully tested for two 3D cases of a BMHV and a comparison is made with existing coupling schemes. It is observed that the developed coupling scheme outperforms these existing schemes in needed coupling iterations per time step and CPU time. [ABSTRACT FROM PUBLISHER]

This paper shows a characterization of digraphs of three vertices associated with Lie algebras, as well as determining the list of isomorphism classes for Lie algebras associated with these digraphs. Additionally, we introduce and implement two algorithmic procedures related to this study: the first is devoted to draw, if exists, the digraph associated with a given Lie algebra; whereas the other corresponds to the converse problem and allows us to test if a given digraph is associated or not with a Lie algebra. Finally, we give the complete list of all non-isomorphic combinatorial structures of three vertices associated with Lie algebras and we study the type of Lie algebra associated with each configuration. [ABSTRACT FROM PUBLISHER]

In this paper, we show an algorithmic procedure to compute abelian subalgebras and ideals of finite-dimensional Lie algebras, starting from the non-zero brackets in its law. In order to implement this method, we use the symbolic computation package MAPLE 12. Moreover, we also give a brief computational study considering both the computing time and the memory used in the two main routines of the implementation. Finally, we determine the maximal dimension of abelian subalgebras and ideals for non-decomposable solvable non-nilpotent Lie algebras of dimension 6 over both the fields R and C, showing the differences between these fields. [ABSTRACT FROM AUTHOR]

The HY-2 satellite was successfully launched on 16 August 2011. It carried four microwave instruments into space for operationally observing dynamic ocean environment parameters on a global scale. The HY-2 satellite altimeter provides sea surface height (SSH), significant wave height (SWH), sea surface wind (SSW) speed, and polar ice sheet elevation, while the HY-2 satellite scatterometer provides SSW fields. At the same time, other oceanic and atmospheric parameters such as sea surface temperature (SST) and wind speed, water vapor and liquid water content can also be obtained by its onboard scanning microwave radiometer. In this paper, we show the data processing methods of the HY-2 satellite's payloads. The preliminary results show that wind vector, SSH, SWH, and SST conform to the designed technical specifications. [ABSTRACT FROM AUTHOR]

Bregman-Minc theorem gives the best known upper bound of the permanent of (0, 1)-matrices. A new proof of the theorem is presented in this paper, using an unbiased estimator of permanent [L.E. Rasmussen, Approximating the permanent: a simple approach, Random Structures Algorithms 5 (1994), p. 349]. This proof establishes a connection between the randomized approximate algorithm and the bound estimation for permanents. [ABSTRACT FROM AUTHOR]

This paper describes an algorithm intended for use in the U.S. Navy's next-generation air particle detector designed for measuring 60Co air contamination. The algorithm measures both alpha and beta activity from an air filter utilizing passivated implanted planar silicon detectors for spectrometry of both particle types and is designed to compensate for radon progeny to discriminate this from the beta emissions of 60Co. This is done by correlating the specific alpha emissions with their beta emission parents, or their beta emission progeny, as appropriate. In addition, the algorithm is unique in that by using region of interest (ROI) windows, it is less sensitive to spectral smearing due to dust or humidity effects on the particle depositions or more specifically to variable energy loss of alpha particles to the detector from deposited material on the filter. A weakness of this approach is that thoron B (212pb) does not have a detectable alpha parent and the next alpha progeny must decay through an isotope (212Bi) with a half-life of 60.6 min. This causes predictions of the 212pb activity to lag in time to some extent. Mitigation of this effect is realized by using a first-order correction utilizing appropriate mathematical equations to account for the physics of this buildup and decay. This paper concludes by demonstrating that the beta assay value is a linear superposition of the alpha ROI values from the three dominant alpha peaks. Initial estimates on the coefficients of the alpha ROI values are derived with final values recommended to be determined from operational measurements. [ABSTRACT FROM AUTHOR]

The Array redistribution problem is the heart of a number of applications in parallel computing. This paper presents a message combining approach for scheduling runtime array redistribution of one-dimensional arrays. The important contribution of the proposed scheme is that it eliminates the need for local data reorganization, as noted by Sundar in 2001; the blocks destined for each processor are combined in a series of messages exchanged between neighbouring nodes, so that the receiving processors do not need to reorganize the incoming data blocks before storing them to memory locations. Local data reorganization is of great importance, especially in networks where there is no direct communication between all nodes (like tori, meshes, and trees). Thus, a block must travel through a number of relays before reaching the target processor. This requires a higher number of messages generated, therefore, a higher number of data permutations within the memory of each target processor should be made to assure correct data order. The strategy is based on a relation between groups of communicating processor pairs called superclasses. [ABSTRACT FROM AUTHOR]

This paper introduces a new algorithm for constrained Delaunay triangulation, which is built upon sets of points and constraining edges. It has various applications in geographical information system (GIS), for example, iso-lines triangulation or the triangulation of polygons in land cadastre. The presented algorithm uses a sweep-line paradigm combined with Lawson's legalisation. An advancing front moves by following the sweep-line. It separates the triangulated and non-triangulated regions of interest. Our algorithm simultaneously triangulates points and constraining edges and thus avoids consuming location of those triangles containing constraining edges, as used by other approaches. The implementation of the algorithm is also considerably simplified by introducing two additional artificial points. Experiments show that the presented algorithm is among the fastest constrained Delaunay triangulation algorithms available at the moment. [ABSTRACT FROM AUTHOR]

A successive method of descending degree has been presented by Guo, Liu and Jia in 2002 to judge whether or not a matrix is a generalized diagonally dominant matrix. In this paper, an alternative approach and comments on one of their examples are provided. Numerical examples are given to illustrate the algorithm processing. [ABSTRACT FROM AUTHOR]

This paper studies the wireless sensor networks (WSN) application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling algorithm and its distributed implementation. We first give a general many-to-one packet scheduling algorithm for wireless networks, and then prove that it is time-optimum and costs [image omitted] , N(u0) - 1) time slots, assuming each node reports one unit of data in each round. Here [image omitted] is the total number of sensors, while [image omitted] denotes the number of sensors in a sink's largest branch subtree. With a few adjustments, we then show that our algorithm also achieves time-optimum scheduling in heterogeneous scenarios, where each sensor reports a heterogeneous amount of data in each round. Then we give a distributed implementation to let each node calculate its duty-cycle locally and maximize efficiency globally. In this packet-scheduling algorithm, each node goes to sleep whenever it is not transceiving, so that the energy waste of idle listening is also mitigated. Finally, simulations are conducted to evaluate network performance using the Qualnet simulator. Among other contributions, our study also identifies the maximum reporting frequency that a deployed sensor network can handle. [ABSTRACT FROM AUTHOR]

Airway management, including endotracheal intubation, is considered one of the most important aspects of prehospital medical care. This concept paper proposes a systematic algorithm for performing prehospital airway management. The algorithm may be valuable as a tool for ensuring patient safety and reducing errors as well as for training rescuers in airway management. [ABSTRACT FROM AUTHOR]

This paper describes an operational-psychological concept of the design of the operator's performance that derives from the AT. This concept can be used to describe precision, reliability and strategies of human performance. Furthermore, it can be applied at the earlier stages of design when experimental procedures are not available. This concept provides analytic description of activity and its comparison with the equipment configuration. Application of the operational-psychological concept of design in ergonomics is demonstrated in the study of navigation-tactical tasks in aviation. Such tasks are common for operators who control moving objects in outer space, moving ships in the ocean, etc. [ABSTRACT FROM AUTHOR]

A signed graph H =( V , E , σ) consists of a graph G =( V , E ) together with a sign function σ : E → {-, +}. A fundamental concept in both, the theory and applications of signed graphs is that of balance . We present a new dynamic programming algorithm to detect balance in signed graphs which traverses each line of the signed graph at most once. Furthermore the computer implementation of the proposed algorithm requires three linear arrays of length | V | only, and the graph need not be stored in computer's memory. Thus the proposed algorithm is optimal with respect to both time and space complexities: The line index for balance of an unbalanced signed graph is the minimum number of lines needed to be removed to make the signed graph balanced. Barahona has proved that finding the line index for balance of a signed graph is an NP- complete problem. In this paper, we prove a stronger result, namely that the problem remains NP- complete even when restricted to signed graphs having negative signs only. [ABSTRACT FROM AUTHOR]