ppxscal/embedding_network huggingface dataset:
Qualitative Analysis of the Crank-Nicolson Method for the Heat Conduction Equation
Authors: István Faragó
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

The preservation of the basic qualitative properties --- besides the convergence --- is a basic requirement in the numerical solution process. For solving the heat conduction equation, the finite difference/linear finite element Crank-Nicolson type full discretization process is a widely used approach. In this paper we formulate the discrete qualitative properties and we also analyze the condition w.r.t. the discretization step sizes under which the different qualitative properties are preserved. We give exact conditions for the discretization of the one-dimensional heat conduction problem under which the basic qualitative properties are preserved.
Extensions of discrete classical orthogonal polynomials beyond the orthogonality
Authors: R. S. Costas-Santos, J. F. Sánchez-Lara
Venue: Journal of Computational and Applied Mathematics (2009)

It is well-known that the family of Hahn polynomials {h"n^@a^,^@b(x;N)}"n">="0 is orthogonal with respect to a certain weight function up to degree N. In this paper we prove, by using the three-term recurrence relation which this family satisfies, that the Hahn polynomials can be characterized by a @D-Sobolev orthogonality for every n and present a factorization for Hahn polynomials for a degree higher than N. We also present analogous results for dual Hahn, Krawtchouk, and Racah polynomials and give the limit relations among them for all n@?N"0. Furthermore, in order to get these results for the Krawtchouk polynomials we will obtain a more general property of orthogonality for Meixner polynomials.
A multiscale finite element space-time discretization method for transient transport phenomena using bubble functions
Authors: V. Nassehi, M. Parvazinia
Venue: Finite Elements in Analysis and Design (2009)

A space-time finite element discretization method for unsteady transport phenomena is formulated using a variational multiscale finite element scheme. The described discretization is based on the utilization of bubble function enriched finite elements. The scheme is applied to model unsteady diffusion and convection-diffusion equations. It is shown that any temporal and spatial instabilities can be removed by appropriate enrichment of linear Lagrangian finite element approximations in the context of the standard Galerkin method. The proposed scheme is compared with widely used @q time stepping method. Numerical results generated by the proposed scheme are validated via their comparison with the analytical solution of a bench mark problem.
Errors made by first year students in an integral calculus course using web-based learning
Authors: R. Haripersad, R. Naidoo
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

Calculus is extremely important for engineering and science studies at the University of Technology. Recent studies show that first year students exhibit many conceptual errors in calculus. In order to reduce the frequency of errors, blended learning (a combination of conventional lectures with Web based Learning) was used. The WBL course is designed such that it allows for algebraic, numerical and graphical methods of understanding of mathematics and track the student's progress regularly during which times the lecturer offers recommendations for the student's progress. In this way lecturers have a one to one tutoring with students in a large class. To determine the effectiveness of the strategy, we compared whether the students make the same category of errors and frequency as in the conventional lecture. A qualitative study was performed on control (traditional) and experimental (WBL) groups each consisting of 33 students. The results indicate WBL students exhibit less structural errors than conventionally taught students.
A Kind of WorldFIP Distributed Intelligent Measurement and Control Network Based on Single Neuron Predictive Identification Control Algorithm
Authors: Geng Liang
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

Traditional PID control can not meet the control requirement of time-varying process with transport delay. Neural network related algorithms are difficult to be implemented in distributed measurement and control based on fieldbus. A kind of adaptive predicative identification control algorithm based on single neuron was proposed in this paper. A single neuron was used to implement the dynamic identification of controlled object. Tapped delay links (TDL) were used to input information to neuron. Former information was used to correct the predicted output values of predictor to improve prediction precision. Another neuron was used to implement intelligent adaptive control. Three inputs were constructed similarly to PID control. Gradient descent algorithm was used in modifying weights in the neuron. WorldFIP distributed intelligent measurement and control network based on the proposed algorithm was designed. Architecture and construction of the designed system were expounded. Hardware and software design for measurement node, control node and supervisory node were presented. Simulation research and site practice were done. The proposed SNPIC algorithm and designed control network were easier to be implemented and showed better control effects.
A communication mechanism for resource isolation
Authors: Matthieu Lemerre, Vincent David, Guy Vidal-Naquet
Venue: Proceedings of the Second Workshop on Isolation and Integration in Embedded Systems (2009)

Sharing resources between multiple untrusted clients requires a shared service that provides access to the resources upon client requests. But executing these requests needs other resources, like memory or CPU time, which must be carefully allocated. In this paper, we investigate a communication mechanism that allows access to shared services without changing existing allocation decisions. This is achieved by systematically using the new resource lending principle, that allows a service to use the resources of its clients to perform the request. We present an easily understandable design model for this communication mechanism named the thread lending model, that completely avoids any allocation by the service, and demonstrate its implementation in our prototype OS Anaxagoros. We finally investigate the consequences of using this model on the structure and implementation of the shared services.
Towards Efficient Detection of Two-Dimensional Intersymbol Interference Channels
Authors: Brian M. Kurkoski
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper gives a survey and comparison of algorithms for the detection of binary data in the presence of two-dimensional (2-D) intersymbol interference. This is a general problem of communication theory, because it can be applied to various practical problems in data storage and transmission. Major results on trellis-based detection algorithms, previously disparate are drawn together, and placed into a common framework. All algorithms have better complexity than optimal detection, and complexity is compared. On the one hand, many algorithms perform within 1.0 dB or better of optimal performance. On the other hand, none of these proposed algorithms can find the optimal solution at high SNR, which is surprising. Extensive discussion outlines further open problems.
A closer look at the Russian roulette problem: A re-examination of the nonlinearity of the prospect theory's decision weight π
Authors: Li-Bo Li, Shu-Hong He, Shu Li, Jie-Hong Xu, Li-Lin Rao
Venue: International Journal of Approximate Reasoning (2009)

Utilizing the Russian roulette problem as an exemplar, Kahneman and Tversky (1979) developed a weighting function @p to explain that the Allais Paradox arises because people behave so as to maximize overall value rather than expected utility (EU). Following the way that ''overweighting of small probabilities'' originated from the Russian roulette problem, this research measured individuals' willingness to pay (WTP) as well as their happiness for a reduction of the probability of death, and examined whether the observed figures were compatible with the nonlinearity of the weighting function. Data analysis revealed that the nonlinear properties estimated by straight measures differed from those derived from preferential choices [D. Kahneman, A. Tversky, Prospect theory: an analysis of decision under risk, Econometrica 47 (1979) 263-291] and formulated by [A. Tversky, D. Kahneman, Advances in prospect theory: Cumulative representation of uncertainty, Journal of Risk and Uncertainty 5 (1992) 297-323]. The controversies and questions to the proposed properties of the decision weight were discussed. An attempt was made to draw the research attention from which function was being maximized to whether people behave as if they were trying to maximize some generalized expectation.
A hybrid CMA-ES and HDE optimisation algorithm with application to solar energy potential
Authors: Jérôme Henri Kämpf, Darren Robinson
Venue: Applied Soft Computing (2009)

This paper describes the results of initial experiments to apply computational algorithms to explore a large parameter space containing many variables in the search for an optimal solution for the sustainable design of an urban development using a potentially complicated fitness function. This initial work concentrates on varying the placement of buildings to optimise solar irradiation availability. For this we propose a hybrid of the covariance matrix adaptation evolution strategy (CMA-ES) and hybrid differential evolution (HDE) algorithms coupled with an efficient backwards ray tracing technique. In this paper we concentrate on the formulation of the new hybrid algorithm and its testing using standard benchmarks as well as a solar optimisation problem. The new algorithm outperforms both the standalone CMA-ES and HDE algorithms in benchmark tests and an alternative multi-objective optimisation tool in the case of the solar optimisation problem.
Tree Drawings on the Hexagonal Grid
Authors: Christian Bachmaier, Franz J. Brandenburg, Wolfgang Brunner, Andreas Hofmeier, Marco Matzeder, Thomas Unfried
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

We consider straight-line drawings of trees on a hexagonal grid. The hexagonal grid is an extension of the common grid with inner nodes of degree six. We restrict the number of directions used for the edges from each node to its children from one to five, and to five patterns: straight, Y, &psi;, X, and full. The &psi;&ndash;drawings generalize hv- or strictly upward drawings to ternary trees. We show that complete ternary trees have a &psi;&ndash;drawing on a square of size $\O(n^{1.262})$ and general ternary trees can be drawn within $\O(n^{1.631})$ area. Both bounds are optimal. Sub&ndash;quadratic bounds are also obtained for X&ndash;pattern drawings of complete tetra trees, and for full&ndash;pattern drawings of complete penta trees, which are 4&ndash;ary and 5&ndash;ary trees. These results parallel and complement the ones of Frati [8] for straight&ndash;line orthogonal drawings of ternary trees. Moreover, we provide an algorithm for compacted straight&ndash;line drawings of penta trees on the hexagonal grid, such that the direction of the edges from a node to its children is given by our patterns and these edges have the same length. However, drawing trees on a hexagonal grid within a prescribed area or with unit length edges is $\mathcal{NP}$&ndash;hard.
Robust and adaptive design of numerical optimization-based extremum seeking control
Authors: Chunlei Zhang, Raúl Ordóñez
Venue: Automatica (Journal of IFAC) (2009)

We consider the employment of numerical optimization and state regulation to solve the extremum seeking control (ESC) problem, which does not assume the time scale separation between the plant dynamics and the extremum seeking loop. Extremum seeking is realized via a state regulator that drives the state traveling along a convergent set point sequence generated by a numerical optimization algorithm. In this paper, we propose a novel design of an asymptotic state regulator via output tracking for state feedback linearizable systems, where we trade off finite time state regulation to obtain flexibility in designing a robust extremum seeking controller. Existing techniques such as nonlinear damping and nonlinear adaptive control are then used to deal with input disturbance and unmodeled plant dynamics. Simulation examples illustrate the effectiveness of the basic and robust extremum seeking schemes, and some design guidelines are provided for engineering applications.
On being one's own programming self
Authors: Peter J. Denning
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

"Structured programming" has become the name of a popular movement toward better programming in the past two years. Among the popular interpretations of the advice advanced by the masters, are many strong proclamations that anyone, by following a few simple prescribed rules, can be transformed into a programmer of top grade, and the productivity of programming shops everywhere can be multiplied. Experience, particularly with students in programming courses, leads to the tentative conclusion that some (but not all) will be helped by the "rules of structured programming;" and that the quality of their products will rise, though not to the extent one might expect from the inflated claims of some structuralists.
LRM: A Local Band Resource Management System
Authors: Guang-Qian Kong, Xun Duan, Jian-Shi Li
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

In conventional Best-Effort forwarding (BE) service network (e.g., Internet), the bandwidth resource for video streaming is unfixed and service performance is highly dependent on the rest local bandwidth. In this paper, local band resource management (LRM) system is developed for managing the bandwidth of local access network as well as providing Assured Forwarding (AF) service. Test results show that LRM not only provides effective management for local band resource but improves the QoS of video streaming greatly.
Metadata management for integration and analysis of earth observation data
Authors: Akira Takahashi, Masashi Tatedoko, Hiroko Kinutani, Masatoshi Yoshikawa
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Earth observation technologies have developed rapidly during the last decades. Substantial amounts of earth observation data have been acquired and stored among the literature and databases of various research fields such as climatology, oceanography, agriculture, and ecology. Analysis and integration of such data might produce valuable data products to promote understanding of the global environment, and to solve global environmental issues. However, most institutions store and manage their Earth observation data in their own manner, with little metadata. Scientists have to struggle hard to search for valuable data from data out of their research domain and seek their usage. In this paper we introduce a conceptual model for earth observation data. Utilizing a model to express earth observation item associated with ontologies, The model is an simple quintuple with information extracted from conventional data models, and is used to uniquely determine portions of earth observation data, which enables flexible annotation of earth observation data. We also introduce our systems for metadata management and user interfaces for encouraging user annotations of earth observation data that can help scientists discover and understand useful data that can support their research.
An Ethical Analysis of Automation, Risk, and the Financial Crises of 2008
Authors: George F. Hurlburt, Keith W. Miller, Jeffrey M. Voas
Venue: IT Professional (2009)

The unprecedented financial market volatility of 2008 has profound implications. Although there is plenty of "blame" to be shared, some key elements of the instability are relatively straightforward to identify. The authors contend that a fundamental, underlying cause is the cavalier approach taken to applied risk management, an approach that was only possible because of the use (and some would say abuse) of automation. This article examines ethical issues associated with general behaviors leading to the market volatility of 2008. It then isolates some related ethical factors that can be singularly attributed to automation. While the effects of market automation can't be realistically blamed for the overall market situation, automation certainly contributed to and still contributes to market uncertainty. Some of this uncertainty is due not merely to automation but to decisions made as risk management was automated. These findings are reinforced by research work employing latent semantic analysis (LSA).
Estimating Null Values in Relational Database Systems Having Negative Dependency Relationships Between Attributes
Authors: Shyi-Ming Chen, Shu-Ting Chang
Venue: Cybernetics and Systems (2009)

In recent years, some methods have been proposed to estimate the null values in relational database systems (Chang and Chen 2006; Chen and Chang 2008; Chen and Hsiao 2005; Chen and Huang 2003, 2008; Chen and Lee 2005; Cheng and Wang 2006). In this paper, we present a new method for estimating the null values in relational database systems having negative dependency relationships between attributes. First, we apply the automatic clustering algorithm we presented in Chang and Chen (2006) for clustering the tuples in the relational database. Based on the clustering results and multiple regression techniques (Kvanli et al. 1986), we present a new method for estimate null values in relational database systems having negative dependency relationships between attributes, where the “Benz secondhand car database” (Chen and Huang 2008) is used for the experiment. The experimental results show that the proposed method gets a higher average estimated accuracy rate than Chen and Huang's method (2003, 2008) for estimating null values in relational database systems having negative dependency relationships between attributes.
Electromechanical coupling analysis for MEMS featured by stepped-height structure and concentrated load
Authors: Kai Li, Wenyuan Chen, Weiping Zhang, Gaoyin Ma
Venue: Microsystem Technologies (2009)

A method is presented for MEMS&#x2019;s electromechanical coupling analysis after a discussion about the limitation of traditional methods. Models for stepped-height beam subjected to arbitrary concentrated force or moment, and models for stepped-height circular plate subjected to central concentrated force are developed. Deflections and pull-in voltages obtained from the new method are in good agreement with Ansys FEM simulation results. The new method is also applicable to beam and circular plate with unvaried or smoothly varied height and under distributed load, with an obvious calculation speed advantage over finite difference method when strict convergence criterion is demanded. As same as a numerical method, it can replace finite difference method in electromechanical coupling analysis of beam or circular plate with more functions and better performance.
Rotationally monotone polygons
Authors: Prosenjit Bose, Pat Morin, Michiel Smid, Stefanie Wuhrer
Venue: Computational Geometry: Theory and Applications (2009)

We introduce a generalization of monotonicity. An n-vertex polygon P is rotationally monotone with respect to a point r if there exists a partitioning of the boundary of P into exactly two polygonal chains, such that one chain can be rotated clockwise around r and the other chain can be rotated counterclockwise around r with neither chain intersecting the interior of the polygon. We present the following two results: (1) Given P and a center of rotation r in the plane, we determine in O(n) time whether P is rotationally monotone with respect to r. (2) We can find all the points in the plane from which P is rotationally monotone in O(n) time for convex polygons and in O(n^2) time for simple polygons. We show that both algorithms are worst-case optimal by constructing a class of simple polygons with @W(n^2) distinct valid centers of rotation. A direct application of rotational monotonicity is the popular manufacturing technique of clamshell casting, where liquid is poured into a cast and the cast is removed by rotations once the liquid has hardened.
Measuring appropriate use of antibiotics in pyelonephritis in Belgian hospitals
Authors: Cécile Camberlin, Dirk Ramaekers
Venue: Computer Methods and Programs in Biomedicine (2009)

Inappropriate use of antibiotics can induce antibiotic resistance, treatment failure, increased costs and even mortality. We developed a methodology for measuring guideline compliance of hospital antibiotic prescriptions in community-acquired acute pyelonephritis in Belgium. The claims and clinical data of all Belgian hospitalizations for community-acquired acute pyelonephritis were extracted from a nationwide administrative database. In a clinically homogeneous subset of patients, the percentage of patients who received a guideline-compliant prescription was calculated according to prescription guidelines disseminated in Belgium. In the group of non-pregnant adult female patients, 31% of the prescriptions were not in strict compliance with the guideline. Interhospital variability ranged from 0% to 100% compliance. We conclude that administrative databases can be used to analyze antibiotic prescription behavior in hospitals for homogeneous and clinically relevant patient groups. The interhospital variability observed in Belgian hospitals indicate that there is a clear room for improvement.
Scheduling projects with limited number of preemptions
Authors: Francisco Ballestín, Vicente Valls, Sacramento Quintanilla
Venue: Computers and Operations Research (2009)

A recent paper (Ballestin F, Valls V, Quintanilla S. Preemption in resource-constrained project scheduling. European Journal of Operational Research 2008;189:1136-152) revealed the potential benefits of allowing one interruption when scheduling activities in a resource-constrained project. This paper further investigates the effect of interruption on project length in more general cases. To achieve this, a new model that covers most practical applications of discrete activity preemption is proposed and a metaheuristic algorithm for the problem is developed. Computational experiments on the standard j120 and j30 sets generated using ProGen study the difference in makespan between allowing m interruptions per activity, m=0,1,2,.... In the second part of the paper the usefulness of preemption in the presence of due dates is analysed.
Research on Lifetime Grey Prediction of Electronic Equipment Based on Improved Genetic Algorithm
Authors: Jing Li, Xiao-dong Mu, Shuai Zheng, Jing Mao
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Grey theory has been applied widely in the field of prediction and decision, but model precision is influenced extremely by sequence smooth degree, boundary condition and background value. Genetic algorithm has well effect in searching for best result because it is an effective way. The paper advances a new method, sin function is used to deal with sequence, and genetic algorithm is used to optimize the boundary value and background value of GM(1,1) model. It has been shown that the improved model is better through predicting the lifetime of electronic equipment on the missile.