ppxscal/embedding_network huggingface dataset:
Interview with David Brailsford
Authors: Claus Atzenbeck
Venue: Issue Summer (June 2009) (2009)

David Brailsford is the John Dunford Emeritus Professor of Computer Science at the University of Nottingham, UK. In 1986 he co-founded the Computer Science department and he was appointed to the Dunford chair in 1990. He served as Head of Department from 1990 to 1998. Since 1982 his research interests have focused on digital documents and on document engineering. He was General Chair for the first of the biennial "EP" conferences, which was held in Nottingham in 1986. This conference series then transformed into the annual, ACM-sponsored, Document Engineering Symposium from 2001 onwards. He has been on the program committee for these conferences since 1986 and he served as Program Chair for DocEng2006. In 1988 he founded the Wiley journal "Electronic Publishing" which he edited for 10 years. Arising from this journal John Wiley Ltd funded a long-running research project, at Nottingham, on the automated internal hyperlinking of journals in PDF format. This led to a further collaboration with Wendy Hall, at the University of Southampton, on the more general hyperlinking of journal articles in a variety of formats. David has collaborated with Adobe Systems Inc. on digital document research for more than 20 years. His research group became the first UK beta test site for Adobe Acrobat in 1992 and, over the years, six of his graduate students have supplemented their research training by undertaking summer internships at Adobe. Most of the joint research has centered around structured document components in PDF but more recently interest has turned to the possibilities for rich media documents in Adobe's AIR. Since 2003 his Document Engineering Research Group has also collaborated with HP Laboratories on research topics ranging from XSLT transformations through to Variable Data Printing and eBooks.
Itinerary Planner: A Mashup Case Study
Authors: Shyam Govardhan, George Feuerlicht
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

The wide adoption of Web Services and the availability of web APIs are transforming the web into a programmatic environment for developing innovative web applications that combine information from various sources to provide a rich user experience. These mashup applications are characterized by rapid development using existing data sources and the use of new technologies such as AJAX, JSON, etc. Developers often focus on delivering rich functionality via the browser environment and pay little attention to the design and maintainability of the applications. In this paper we describe our experience in developing an Itinerary Planner travel application, and discuss the challenges associated with developing mashups. In the conclusion, we briefly discuss the lessons learned in addressing these challenges and how these lessons can be applied to future mashup projects.
Performance Evolution of Mobile Web-Based Services
Authors: Claudia Canali, Michele Colajanni, Riccardo Lancellotti
Venue: IEEE Internet Computing (2009)

The mobile Web's widespread diffusion opens many interesting design and management issues about server infrastructures that must satisfy present and future client demand. Future mobile Web-based services will have growing computational costs. Even requests for the same Web resource will require services to dynamically generate content that takes into account specific devices, user profiles, and contexts. The authors consider the evolution of the mobile Web workload and trends in server and client devices with the goal of anticipating future bottlenecks and developing management strategies.
Demand-driven evaluation of collection attributes
Authors: Eva Magnusson, Torbjörn Ekman, Görel Hedin
Venue: Automated Software Engineering (2009)

In order to make attribute grammars useful for complicated analysis tasks, a number of extensions to the original Knuth formalism have been suggested. One such extension is the collection attribute mechanism, which allows the value of an attribute to be defined as a combination of contributions from distant nodes in the abstract syntax tree. Another extension that has proven useful is circular attributes, evaluated using fixed-point iteration. In this paper we show how collection attributes and the combined formalism, circular collection attributes, have been implemented in our declarative meta programming system JastAdd, and how they can be used for a variety of applications including devirtualization analysis, metrics and flow analysis. A number of evaluation algorithms are introduced and compared for applicability and efficiency. The key design criterion for our algorithms is that they work well with demand evaluation, i.e., defined properties are computed only if they are actually needed for a particular program. We show that the best algorithms work well on large practical problems including the analysis of large Java programs.
Everyday sensor system for music instruments: possibilities and usage in daily musical instrument playing, exercising and teaching
Authors: Tobias Großhauser, Ralph Trautner
Venue: Proceedings of the 5th conference on Applied electromagnetics, wireless and optical communications (2007)

Methods, technics and expression in playing and teaching musical instruments means a lot of analysing of gesture, posture, pressure and movement of several parts of the human body. For many of these parameters, the everyday use Sensor System provides a possibility to record and show most of the significant Data in real time. This new possibilities of analysing and recording datasets of audio and sensors will show new ways in technology based pedagogy and even more important: Extended instruments, to create unheard and up to now yet unplayable music. Practical experiments show a huge range of new ways to teach, practice and perform with violin, viola, cello, guitar, piano and double base. The are used several magnetic field sensors, pressure sensors, position tracking and bending sensors. The following setup records and aligns data to the audio file and the score, making the everyday use simple for musicians, from beginners to professionals.
Easigami: a reconfigurable folded-sheet TUI
Authors: Yingdan Huang, Mark D Gross, Ellen Yi-Luen Do, Mike Eisenberg
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

Easigami is a novel tangible user interface (TUI) and interactive system intended to help children to learn to fold 3D geometric forms and to explore 2D-3D transformations. We present the design of Easigami's physical interface: a reconfigurable system of thin flat polygon pieces connected by electronically instrumented hinges. Using the Easigami TUI as an input device, we have developed early prototype applications to develop children's visualization and spatial recognition skills. We discuss our experience in integrating traditional craft with computation, which may inform future tangible and graspable user interface design.
Middleware support for adaptive dependability
Authors: Lorenz Froihofer, Karl M. Goeschka, Johannes Osrael
Venue: Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware (2007)

Generic middleware can often not provide satisfactory solutions, but neither is it acceptable to let the application developer reinvent the wheel each time. Therefore, middleware shall support reuse of infrastructural services while leaving the application in control. In particular, we contribute with a middleware approach to support adaptive dependability by balancing integrity and availability in distributed systems. To achieve this goal, we add a new middleware service for explicit runtime management of data integrity constraints. In order to provide the desired balancing with respect to an application's requirements and environment conditions, our approach supports the application developer with explicit interaction between middleware, application, and metadata. Based on our prototype implementation, we show how adaptive balancing of integrity and availability improves the overall dependability. The performance impairments of our approach are typically worth their costs in systems where the read-to-write ratio is high or write performance is not a limiting factor.
Removal of Line Artefacts for Digital Dissemination of Archived Film and Video
Authors: Anil Kokaram
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Line scratches are a common form of degradation in archived motion picture film. The automatic restoration of such material has become of increasing interest in the last few years with the rise of consumer digital video applications and the need to supply more programming material of an acceptable quality in a multimedia context. This paper introduces mechanisms for removing line artefacts from degraded images. It also proposes schemes which solve for both the image data and the hidden model parameters simultaneously. The algorithms introduced are based on the use of the 2D-AR process as an underlying image model and employ a Bayesian approach. The Gibbs sampler is used to draw samples from the underlying image texture and so create a convincing interpolation in the region previously obscured by the line feature.
Texture filter memory: a power-efficient and scalable texture memory architecture for mobile graphics processors
Authors: B. V. N. Silpa, Anjul Patney, Tushar Krishna, Preeti Ranjan Panda, G. S. Visweswaran
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

With increasing interest in sophisticated graphics capabilities in mobile systems, energy consumption of graphics hardware is becoming a major design concern in addition to the traditional performance enhancement criteria. Among the different steps in the graphics processing pipeline, we have observed that memory accesses during texture mapping -- a highly memory intensive phase - contribute 30-40% of the energy consumed in typical embedded graphics processors. This makes the texture mapping subsystem an attractive candidate for energy optimization. We argue that a standard cache hierarchy, commonly used by researchers and commercial graphics processors for texture mapping, is wasteful of energy, and propose the Texture Filter Memory, an energy efficient architecture that exploits locality and the relatively high degree of predictability in texture memory access patterns. Our architecture consumes 75% lesser energy for texturing in a fixed function pipeline, incurring no performance overhead and a small area overhead over conventional texture mapping hardware.
Pattern-based time-series subsequence clustering using radial distribution functions
Authors: Anne M. Denton, Christopher A. Besemann, Dietmar H. Dorr
Venue: Knowledge and Information Systems (2009)

Clustering of time series subsequence data commonly produces results that are unspecific to the data set. This paper introduces a clustering algorithm, that creates clusters exclusively from those subsequences that occur more frequently in a data set than would be expected by random chance. As such, it partially adopts a pattern mining perspective into clustering. When subsequences are being labeled based on such clusters, they may remain without label. In fact, if the clustering was done on an unrelated time series it is expected that the subsequences should not receive a label. We show that pattern-based clusters are indeed specific to the data set for 7 out of 10 real-world sets we tested, and for window-lengths up to 128 time points. While kernel-density-based clustering can be used to find clusters with similar properties for window sizes of 8&#x2013;16 time points, its performance degrades fast for increasing window sizes.
Evolutionary algorithms based design of multivariable PID controller
Authors: M. Willjuice Iruthayarajan, S. Baskar
Venue: Expert Systems with Applications: An International Journal (2009)

In this paper, performance comparison of evolutionary algorithms (EAs) such as real coded genetic algorithm (RGA), modified particle swarm optimization (MPSO), covariance matrix adaptation evolution strategy (CMAES) and differential evolution (DE) on optimal design of multivariable PID controller design is considered. Decoupled multivariable PI and PID controller structure for Binary distillation column plant described by Wood and Berry, having 2 inputs and 2 outputs is taken. EAs simulations are carried with minimization of IAE as objective using two types of stopping criteria, namely, maximum number of functional evaluations (Fevalmax) and Fevalmax along with tolerance of PID parameters and IAE. To compare the performances of various EAs, statistical measures like best, mean, standard deviation of results and average computation time, over 20 independent trials are considered. Results obtained by various EAs are compared with previously reported results using BLT and GA with multi-crossover approach. Results clearly indicate the better performance of CMAES and MPSO designed PI/PID controller on multivariable system. Simulations also reveal that all the four algorithms considered are suitable for off-line tuning of PID controller. However, only CMAES and MPSO algorithms are suitable for on-line tuning of PID due to their better consistency and minimum computation time.
DIA: A Complexity-Effective Decoding Architecture
Authors: Oliverio J. Santana, Ayose Falcón, Alex Ramirez, Mateo Valero
Venue: IEEE Transactions on Computers (2009)

Fast instruction decoding is a true challenge for the design of CISC microprocessors implementing variable-length instructions. A well-known solution to overcome this problem is caching decoded instructions in a hardware buffer. Fetching already decoded instructions avoids the need for decoding them again, improving processor performance. However, introducing such special--purpose storage in the processor design involves an important increase in the fetch architecture complexity. In this paper, we propose a novel decoding architecture that reduces the fetch engine implementation cost. Instead of using a special-purpose hardware buffer, our proposal stores frequently decoded instructions in the memory hierarchy. The address where the decoded instructions are stored is kept in the branch prediction mechanism, enabling it to guide our decoding architecture. This makes it possible for the processor front end to fetch already decoded instructions from the memory instead of the original nondecoded instructions. Our results show that using our decoding architecture, a state-of-the-art superscalar processor achieves competitive performance improvements, while requiring less chip area and energy consumption in the fetch architecture than a hardware code caching mechanism.
The Discontinuous Galerkin Method for Two-dimensional Hyperbolic Problems Part II: A Posteriori Error Estimation
Authors: Slimane Adjerid, Mahboub Baccouch
Venue: Journal of Scientific Computing (2009)

In this manuscript we construct simple, efficient and asymptotically correct a posteriori error estimates for discontinuous finite element solutions of scalar first-order hyperbolic partial differential problems on triangular meshes. We explicitly write the basis functions for the error spaces corresponding to several finite element spaces. The leading term of the discretization error on each triangle is estimated by solving a local problem. We also show global superconvergence for discontinuous solutions on triangular meshes. The a posteriori error estimates are tested on several linear and nonlinear problems to show their efficiency and accuracy under mesh refinement for smooth and discontinuous solutions.
Application of least square support vector machines in the prediction of aeration performance of plunging overfall jets from weirs
Authors: Ahmet Baylar, Davut Hanbay, Murat Batan
Venue: Expert Systems with Applications: An International Journal (2009)

Aeration is a mass transfer process between the atmosphere and water. Aeration is used for water quality enhancement in sewage treatment plants and in polluted rivers and lakes. This can be enhanced by creating turbulence in the water. Plunging overfall jets from weirs are a particular instance of producing such turbulence. In this paper, two intelligent models are realized to predict the air entrainment rate and aeration efficiency of weirs. Least square support vector machine (LS-SVM) is used as intelligent tool. Threefold cross validation test method is used to evaluate the performance of LS-SVM models. The correlation between predicted and measured values is found 0.99 for air entrainment rate and 0.98 for aeration efficiency. The test results indicate that the LS-SVM can be used successfully in predicting the air entrainment rate and aeration efficiency of weirs. Moreover, the performances of the LS-SVM models are compared with multi nonlinear and linear regression models.
Performance engineering of software systems: a case study
Authors: C. U. Smith, J. C. Browne
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

This paper summarizes the concepts of performance engineering in large software systems and illustrates the application of performance engineering techniques to the early design phase of a large database system. Performance engineering is a methodology for evaluating the performance of software systems throughout their life cycles. The case study given here demonstrates that it is possible to predict resource usage patterns of complex software systems even in early design phases of the system, although detailed predictions of resource usage are not likely to be validated. The results presented here show the leverage of considering performance implications in the early design phases of a software project.
Location-based storytelling in the urban environment
Authors: Jeni Paay, Jesper Kjeldskov, Anders Christensen, Andreas Ibsen, Dan Jensen, Glen Nielsen, René Vutborg
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

Reality is everywhere. It is right there in our face when we wake up and it continues to sneak up on us throughout our day, in the car, in our offices, and at the dinner table. In recent years it has even invaded our TVs through eternal news streams and endlessly boring reality TV shows. However, people cannot live by reality alone. In fact, we spend quite a lot off effort on escaping reality. We daydream and immerse ourselves in imaginary worlds and stories. We immerse ourselves in fiction. Inspired by this view, we report on our research into the design and user experience of a new genre of mobile location-based services, which uses peoples' physical surroundings as a backdrop for storytelling as they move around an urban environment. We present a prototype system developed to explore the user experience of location-based interactive stories, and the use of interaction designs aimed at blurring the boundary between reality and fiction. Based on qualitative data from a series of field trials, we discuss potentials and challenges for this class of location-based services.
Establishing the credibility of a biotech simulation model
Authors: Lenrick Johnston, Lee Schruben, Arden Yang, David Zhang
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

One of the key goals for a simulation model is to accurately replicate the real system under consideration. A protocol is proposed to add credibility to the outputs of a simulation, using a double-blind method. Experimental design is outlined to maximize the value of the information obtained. Finally, experiences implementing the method for a large-scale biotech manufacturing facility are discussed.
Immune K-means and negative selection algorithms for data analysis
Authors: Michał Bereta, Tadeusz Burczyński
Venue: Information Sciences: an International Journal (2009)

During the last decade artificial immune systems have drawn much of the researchers' attention. All the work that has been done allowed to develop many interesting algorithms which come in useful when solving engineering problems such as data mining and analysis, anomaly detection and many others. Being constantly developed and improved, the algorithms based on immune metaphors have some limitations, though. In this paper we elaborate on the concept of a novel artificial immune algorithm by considering the possibility of combining the clonal selection principle and the well known K-means algorithm. This novel approach and a new way of performing suppression (based on the usefulness of the evolving lymphocytes) in clonal selection result in a very effective and stable immune algorithm for both unsupervised and supervised learning. Further improvements to the cluster analysis by means of the proposed algorithm, immune K-means, are introduced. Different methods for clusters construction are compared, together with multi-point cluster validity index and a novel strategy based on minimal spanning tree (mst) and a analysis of the midpoints of the edges of the (mst). Interesting and useful improvements of the proposed approach by means of negative selection algorithms are proposed and discussed.
A simple parallel conduction extraction method (SPCEM) for MODFETs and undoped GaN-based HEMTs
Authors: S. B. Lisesivdin, N. Balkan, E. Ozbay
Venue: Microelectronics Journal (2009)

We report a simple method to extract the mobility and sheet carrier densities of conduction channels in conventional modulation doped field-effect transistor (MODFET) structures and unintentionally doped GaN-based high-electron mobility transistor (HEMT) structures for a special case. Extraction of the conduction channels from the magnetic field-dependent data can present number of problems; even the most recent methods encounter great difficulties. For the GaN-based HEMT structures which have lower mobilities and larger effective masses than that of GaAs-based counterparts, these difficulties become more prominent. In this study, we describe a simple method for magnetotransport analysis to extract conduction channels successfully for a special case that is commonly encountered: one bulk channel and one two-dimensional electron gas (2DEG) channel. Advantage of this method is mainly its simplicity. The analysis can be done with only two magnetic field-dependent measurements per temperature step. The method is applied to the magnetotransport results of an unintentionally doped AlGaN/AlN/GaN/AlN heterostructure over a temperature range of 29-350K and in a magnetic field range of 0-1.5T (&mu;B<1). The results are then compared with those obtained using a commercial package for these calculations namely: quantitative mobility spectrum analysis (QMSA).
Innovative Mobile Learning: Techniques and Technologies
Authors: Hokyoung Ryu, David Parsons
Venue:  (2008)

Academia and industry have only begun to explore the vast capabilities that the emerging field of mobile learning has to enrich education. To help researchers and practitioners drive the realization of the potential benefits of mobile learning technology to the next level, a thorough survey of the state of knowledge in this ascending field is vital.Innovative Mobile Learning: Techniques and Technologies is the first book to comprehensively set out opportunities presented by mobile learning technologies, collecting incisive research articles from leading international experts. Covering field challenges, practical experiences, and current technological advances, this unique contribution to the current research will benefit academics and students in a variety of education and technology-related disciplines, as well as industry specialists in the field mobile technology.