ppxscal/embedding_network huggingface dataset:
Fully dynamic techniques for point location and transitive closure in planar structures
Authors: F. P. Preparata, R. Tamassia
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

It is shown that a planar st-graph G admits two total orders on the set V union E union F, where V, E, and F are, respectively, the sets of vertices, edges and faces of G, with mod V mod =n. An O(n) space data structure for the maintenance of the two orders is exhibited that supports an update of G (insertion of an edge and expansion of a vertex, and their inverses) in time O(log n). This data structure also supports transitive-closure queries in O(log n). Moreover, planar st-graphs provide the topological underpinning of a fully dynamic planar point location technique in monotone subdivisions, which is an interesting (unique) specialization of the chain method of Lee-Preparata (1977). While maintaining storage O(n) and query time O(log/sup 2/ n), insertion/deletion of a chain with k edges can be done in time O(log/sup 2/ n+k), and insertion/deletion of a vertex on an edge can be done in time O(log n).
Optimum design of cyclic storage systems; distributed parameter approach: 2-model solution methodology and analysis of results
Authors: Saeed Alimohammadi, Abbas Afshar
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

A cyclic storage system is a conjunctive use system, containing two major sub-systems: surface water and groundwater, which could meet the guaranteed demands via an interactive trade-off cycle. In these two companion papers (both have published in this issue); a distributed parameter approach has been implemented for optimum planning of cyclic storage systems. For this purpose the modified and generalized form of unit response matrix has been developed and used to connect the distributed parameter groundwater simulation model to the optimization model. The resulted optimization model has a form of a nonlinear programming. In order to validate the model, it has been implemented in a hypothetical simple cyclic storage system. For verification and testing of model outputs, the results of optimization model evaluated for two purposes. First for global optimality of model solution, and second for validation of model structure. The first one is implemented with converting the nonlinear model to linear form and comparing of two model results. The second one is done with assessing of model results with a simulation model. The results show the model is valid both in global optimality and structure of it.
Power-constrained high-frequency circuits for the IBM POWER6 microprocessor
Authors: B. Curran, E. Fluhr, J. Paredes, L. Sigal, J. Friedrich, Y.-H. Chan, C. Hwang
Venue: IBM Journal of Research and Development (2007)

The IBM POWER6™ microprocessor is a high-frequency (>5-G Hz) microprocessor fabricated in the IBM 65-nm silicon-on-insulator (SOI) complementary metal-oxide semiconductor (CMOS) process technology. This paper describes the circuit, physical design, clocking, timing, power, and hardware characterization challenges faced in the pursuit of this industry-leading frequency. Traditional high-power, high-frequency techniques were abandoned in favor of more-power-efficient circuit design methodologies. The hardware frequency and power characterization are reviewed.
4th international workshop on predictor models in SE (PROMISE 2008)
Authors: Gary D. Boetticher, Tim Menzies, Tom Ostrand, Guenther H. Ruhe
Venue: Companion of the 30th international conference on Software engineering (2008)

The PROMISE workshop seeks to deliver to the software engineering community useful, usable, verifiable, and repeatable models. To provide a sound and realistic basis for creating predictive models, and to allow researchers to conduct repeatable software engineering experiments, we maintain the PROMISE repository, a growing collection that now contains 57 empirically-based data sets.
Deep classification in large-scale text hierarchies
Authors: Gui-Rong Xue, Dikan Xing, Qiang Yang, Yong Yu
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Most classification algorithms are best at categorizing the Web documents into a few categories, such as the top two levels in the Open Directory Project. Such a classification method does not give very detailed topic-related class information for the user because the first two levels are often too coarse. However, classification on a large-scale hierarchy is known to be intractable for many target categories with cross-link relationships among them. In this paper, we propose a novel deep-classification approach to categorize Web documents into categories in a large-scale taxonomy. The approach consists of two stages: a search stage and a classification stage. In the first stage, a category-search algorithm is used to acquire the category candidates for a given document. Based on the category candidates, we prune the large-scale hierarchy to focus our classification effort on a small subset of the original hierarchy. As a result, the classification model is trained on the small subset before being applied to assign the category for a new document. Since the category candidates are sufficiently close to each other in the hierarchy, a statistical-language-model based classifier using n-gram features is exploited. Furthermore, the structure of the taxonomy can be utilized in this stage to improve the performance of classification. We demonstrate the performance of our proposed algorithms on the Open Directory Project with over 130,000 categories. Experimental results show that our proposed approach can reach 51.8% on the measure of Mi-F1 at the 5th level, which is 77.7% improvement over top-down based SVM classification algorithms.
Social-oriented engineering of intelligent software
Authors: Loris Penserini, Manuel Kolp, Luca Spalazzi
Venue: Web Intelligence and Agent Systems (2007)

In the last few years, software applications are increased in complexity and in stakeholders' expectations, principally due to new Internet-centric application areas such as eBusiness, eGovernment, web services, ubiquitous computing, and peer-to-peer networks. From a software engineering point of view, such applications have brought in new challenging requirements to deal with. Therefore, the paper aims to cope with complex system development taking benefit from the use of an agent oriented software engineering methodology, named Tropos. The paper focuses both on the socially-driven approach of Tropos and on the agent capabilities characterization, in order to build up an agent-based information system prototype. Specifically, we revise and improve the Tropos architectural design phase, motivating the need for two correlated dimensions: organization styles based macro-level architectural design and social patterns based micro-level architectural design. Moreover, we illustrate how the architectural design phase drives and supports detailed design activities, e.g., agent cooperation, by means of some agent specification abstractions.
On the complexity of a game related to the dictionary problem
Authors: K. Mehlhorn, S. Naher, M. Rauch
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

A game on trees, which is related to the dictionary problem is considered. There are two players A and B who take turns. Player A models the user of the dictionary, and player B models its implementation. Player A modifies the tree by adding new leaves, and player B modifies the tree by replacing subtrees. The cost of an insertion is the depth of the new leaf, and the cost of an update is the size of the subtree replaced. The goal of player A is to maximize cost, and the goal of B is to minimize it. It is shown that there is a strategy for player A that forces a cost of Omega (n log log n) for an n-game, that is, a game consisting of n turns of both players, and a strategy for player B that keeps the cost in O(n log log n).
Residual layer thickness in nanoimprint: Experiments and coarse-grain simulation
Authors: Nikolaos Kehagias, Vincent Reboud, Clivia M. Sotomayor Torres, Vadim Sirotkin, Alexander Svintsov, Sergey Zaitsev
Venue: Microelectronic Engineering (2008)

A refined coarse-grain method for simultaneous calculation of the resist viscous flow in nanoimprint lithography and the stamp/substrate deformation is presented. The method has been realized in an effective simulation tool for the verification of stamp structures on standard personal computers, by using the GDS data of the stamp design. From the presented comparison of calculated and experimental results, it can be concluded that the coarse-grain modeling allows predicting the residual layer thickness with accuracy better than 10%.
AFID: an automated fault identification tool
Authors: Alex Edwards, Sean Tucker, Sébastien Worms, Rahul Vaidya, Brian Demsky
Venue: Proceedings of the 2008 international symposium on Software testing and analysis (2008)

We present the Automatic Fault IDentification Tool (AFID). AFID automatically constructs repositories of real software faults by monitoring the software development process. AFID records both a fault revealing test case and a faulty version of the source code for any crashing faults that the developer discovers and a fault correcting source code change for any crashing faults that the developer corrects. The test cases are a significant contribution, because they enable new research that explores the dynamic behaviors of the software faults. AFID uses a ptrace-based monitoring mechanism to monitor both the compilation and execution of the application. The ptrace-based technique makes it straightforward for AFID to support a wide range of programming languages and compilers. Our benchmark results indicate that the monitoring overhead will be acceptable for most developers. We performed a short case study to evaluate how effectively the AFID tool records software faults. In our case study, AFID recorded 12 software faults from the 8 participants.
Design, fabrication, and testing of microporous wicking structure
Authors: Yongkang Chen, Lawrence S. Melvin,  III, Mark M. Weislogel, Ryan M. Jenson, Scott Dhuey, Paul F. Nealey
Venue: Microelectronic Engineering (2008)

Wicking structures based on interior corner geometry as the fundamental transport mechanism have been studied in microgravity environments. These structures provide for highly efficient passive transport that can be exploited in advanced two-phase passive cooling systems for applications in areas such as thermal control for microelectronics. Several pilot designs have been manufactured and tested and their performance is reported.
Spreadsheet debugging behaviour of expert and novice end-users
Authors: Brian Bishop, Kevin McDaid
Venue: Proceedings of the 4th international workshop on End-user software engineering (2008)

In recent years the reliability of end-user developed spreadsheet programs has been shown to be very poor. Surprisingly, relatively little research has been carried out in the areas of spreadsheet testing and debugging. With the aim of recording and analysing end-user behaviour and performance in spreadsheet error detection and correction, an experiment was conducted with 13 industry-based professionals and 34 accounting & finance students. The work utilised a novel approach for acquiring experimental data through the unobtrusive recording of participants debugging actions using a custom built VBA tool. Based on the findings from analysis of debugging behaviour, a simple debugging tool was developed by the authors, and its effects on debugging performance were investigated by means of a controlled experiment.
Family of quadratic spline difference schemes for a convection-diffusion problem
Authors: Ljiljana Teofanov, Zorica Uzelac
Venue: International Journal of Computer Mathematics (2007)

We consider the finite difference approximation of a singularly perturbed one-dimensional convection-diffusion two-point boundary value problem. It is discretized using quadratic splines as approximation functions, equations with various piecewise constant coefficients as collocation equations and a piecewise uniform mesh of Shishkin type. The family of schemes is derived using the collocation method. The numerical methods developed here are non-monotone and therefore apart from the consistency error we use Green's grid function analysis to prove uniform convergence. We prove the almost first order of convergence and furthermore show that some of the schemes have almost second-order convergence. Numerical experiments presented in the paper confirm our theoretical results.
Personalized mobile health monitoring for elderly
Authors: Andreas Lorenz, Dorit Mielke, Reinhard Oppermann, Lars Zahl
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

The key for successfully deploy mobile applications is the ability to understand the specific needs of its customers. In the field of mobile health monitoring, the currently most important user group is the group of persons of the age 50+. In our project senSAVE&reg; we developed a user interface for monitoring personal vital parameters that is specifically adapted to the needs of this group. The paper illustrates our work to ensure usability of the application and the outcome of the project.
Biodegradable polylactic acid microstructures for scaffold applications
Authors: Gou-Jen Wang, Kuan-Hsuan Ho, Cheng-Chih Hsueh
Venue: Microsystem Technologies (2008)

In this research, we present a simple and cost effective soft lithographic process to fabricate polylactic acid (PLA) scaffolds for tissue engineering. In which, the negative photoresist JSR THB-120N was spun on a glass subtract followed by conventional UV lithographic processes to fabricate the master to cast the PDMS elastomeric mold. A thin poly(vinyl alcohol) (PVA) layer was used as a mode release such that the PLA scaffold can be easily peeled off. The PLA precursor solution was then cast onto the PDMS mold to form the PLA microstructures. After evaporating the solvent, the PLA microstructures can be easily peeled off from the PDMS mold. Experimental results show that the desired microvessels scaffold can be successfully transferred to the biodegradable polymer PLA. Encouraging progress in bovine endothelial cells seeding was observed.
On the calculation of convolution in actuarial applications: a case study using discrete random variables
Authors: Maria Giuseppina Bruno, Alvaro Tomassetti
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

In literature, the sum of discrete random variables becomes a problem of heavy (and often impracticable) computation no sooner does the number of convolutions exceed few units. In this paper, we show how this problem can be easily overcome in actuarial applications when using random variables with integer (positive, negative, or null) or referable to integer numerical realizations but not necessarily identically distributed. Under the above-mentioned condition, we illustrate in particular two exact methods and an approximated one for calculating convolution: - the first exact method is based on the well-known Fast Fourier Transform (FFT); - the second exact method is derived from the classical approach using Discrete Fourier Transform (DFT) by means of algebraic manipulations; - the third method is derived from the definition of convolution and it is approximated by neglecting the probabilities less than a given bound ε =10-h (51≤h≤100). As for the error bounds of the approximated method, it is worth noting that the results obtained by this method differ in relative terms from the corresponding exact values of less than 10-9. This can be tested by comparing the convoluted probability distribution obtained by the approximated method with the one obtained by the other two methods and by also comparing the first four moments with those computed directly on the original random variables. The results (in particular the exact and the approximated probability distribution) are identical in practice. It does not exist therefore the problem of a difference along the tail. As a consequence, although the proposed method is an "approximated method" under a mathematical point of view, it can be considered an "exact method" in the actuarial applications. As for the efficiency of calculation, we show that, generally speaking, the approximated method performs better (also thanks to the substantial simplification obtained by summing, after each convolution, the probabilities corresponding to the same numerical realizations) than both the exact methods.
Robust adaptive control of synchronous generators with SMES unit via Hamiltonian function method
Authors: S. Li, Y. Wang
Venue: International Journal of Systems Science (2007)

Superconducting Magnetic Energy Storage (SMES) units can be used to enhance the stability of power systems. Using Hamiltonian function method, this article investigates robust adaptive control design for synchronous generators with such a unit, and proposes an energy-based robust adaptive controller for the systems with disturbances and unknown parameters. The generator used in this article is a 4th order model with both excitation and steam valve controls. It is shown that the generator with one SMES unit can be changed as a dissipative Hamiltonian system, with which the energy-based robust adaptive control law can be designed for the system by using the structural properties of dissipative Hamiltonian systems. Study on simulations shows that the controller proposed in this article works very well.
Victor Burgin: Voyage to Italy
Authors: Victor Burgin, Hubertus von Amelunxen, Thomas Zander
Venue:  (2007)

Over the past 30 years, Victor Burgin (born in 1941) has become both a highly influential artist and a renowned theorist of the still and moving image, with work in the collections of The Museum of Modern Art, New York and the Tate Modern in London. Burgin rose to prominence in the late 1960s as an originator of Conceptual art. In the 1970s he worked in large framed photographic sequences, in which printed texts were either juxtaposed with or superimposed on the images. In the 1990s he turned towards digital video. The historian and critic Stephen Bann has written that Burgin's "exploitation of new technologies is itself fairly uninteresting compared with the remarkable consistency of the underlying themes and propositions of his work," among them narrative, memory and fantasy. These duotones refute all that uninteresting technology to offer Burgin's reflections on Pompeii, gleaned through his research of nineteenth-century photographs.
Automated Vascular Geometric Analysis of Aortic Aneurysms
Authors: Vikash Ravi Goel, Roy K. Greenberg, Donald P. Greenberg
Venue: IEEE Computer Graphics and Applications (2008)

An automated geometric analysis procedure uses volumetric computerized tomography scan data to produce a fully defined analytical model of the patient's arterial geometry with minimal user interaction. This model can be a powerful tool for surgery planning and stent design in addition to providing a basis for computational simulations.
On Reducing Communication Cost for Distributed Moving Query Monitoring Systems
Authors: Fuyu Liu, Kien A. Hua, Fei Xie
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

Moving monitoring query on moving objects is an important type of query in location based services. Existing solutions suffer from high communication cost. In this paper, we propose a distributed solution to this problem. Our approach employs two ways of communications, on-demand access and broadcast channel, to reduce communication cost. Two different indexes are proposed and evaluated using simulations. The performance results indicate that our solution achieves from 30% to 60% savings in communications when compared to MobiEyes.
Logconcave random graphs
Authors: Alan Frieze, Santosh Vempala, Juan Vera
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We propose the following model of a random graph on n vertices. Let F be a distribution in R+n(n-1)/2 with a coordinate for every pair ij with 1 ≤ i,j ≤ n. Then GF,p is the distribution on graphs with n vertices obtained by picking a random point X from F and defining a graph on n vertices whose edges are pairs ij for which Xij ≤ p. The standard Erdos-Renyi model is the special case when F is uniform on the 0-1 unit cube. We determine basic properties such as the connectivity threshold for quite general distributions. We also consider cases where the Xij are the edge weights in some random instance of a combinatorial optimization problem. By choosing suitable distributions, we can capture random graphs with interesting properties such as triangle-free random graphs and weighted random graphs with bounded total weight.
Discovery in grid and web services environments: A survey and evaluation
Authors: Ioan Toma, Kashif Iqbal, Dumitru Roman, Thomas Strang, Dieter Fensel, Brahmananda Sapkota, Matthew Moran, Juan Miguel Gomez
Venue: Multiagent and Grid Systems (2007)

An important step in realizing the vision of both Web services and Grid is the provision of a robust, automatic and reliable solution for finding services or resources in such environments. Different solutions to this problem were already proposed, each with its specific model and realization. Although all solutions address the same problem, it is very difficult for a non-expert and even for an expert in the field to decide if and why one solution is better then another. This paper proposes a systematic set of criteria, a framework, that can help in the evaluation of different discovery approaches. Furthermore some of the most relevant discovery approaches in Web services and Grid environments are surveyed and evaluated according to the proposed evaluation framework.
Delineation of groundwater recharge sites using integrated remote sensing and GIS in Jammu district, India
Authors: A. S. Jasrotia, R. Kumar, A. K. Saraf
Venue: International Journal of Remote Sensing (2007)

With the increasing demands for water due to increasing population, urbanization and agricultural expansion, groundwater resources are gaining much attention, particularly in the Kandi region of Jammu district, which faces acute shortages of drinking water throughout the year. Groundwater development programmes need a large volume of data from various sources. This study used integrated remote sensing and geographic information system (GIS) techniques to provide an appropriate platform for convergent analysis of multidisciplinary data and decision making for artificial recharge to groundwater. Thematic maps were constructed using merged Linear Imaging Self Scanner (LISS)-III and Panchromatic (PAN) remote sensing data and aquifer parameter thematic layers were prepared from conventional field data. The thematic layers of the aquifer parameters were integrated and a map showing the potential zones for artificial recharge to groundwater was generated. By superimposing the drainage network map over this artificial recharge zone map, and also considering the terrain conditions for artificial recharge, suitable sites for replenishing groundwater in the study area were identified.