ppxscal/embedding_network huggingface dataset:
Aspects into the use of renewable energy sources in cereals drying process
Authors: Gaceu Liviu, Lepadatescu Badea
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

With increasing concern for environmental degradation, it is desirable to decrease energy consumption in all sectors. Thus, the paper presents the cereals drying process as an important energy consumer. The main input and output thermal components involved in the heat balance are investigated. Likewise, the possibilities to use the gasification process as energy source are further analyzed. Using the MathCAD and Labview software, the behavior of the drying system was simulated considering both temperature variation and humidity content of the environment. In conclusion, the paper shows the great potential for using gasification in cereals drying process from the following points of view: quality of dried products, energetic efficiency and global costs.
A Constraint-Based Tutor for Learning Object-Oriented Analysis and Design using UML
Authors: Nilufar Baghaei, Antonija Mitrovic, Warwick Irwin
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

COLLECT-UML is an intelligent tutoring system that teaches Object-Oriented design using Unified Modelling Language (UML). UML is one of the most popular techniques used in the design and development of Object-Oriented systems nowadays. The Constraint-Based Modelling (CBM) has been used successfully in several systems and they have proved to be extremely effective in evaluations performed in real classrooms. In this paper, we present our experiences in implementing another constraint-based tutor, in the area of Object-Oriented design. We present the system's architecture and functionality and describe the results of a preliminary study with postgraduate students who interacted with the system as part of a think-aloud study. Participants felt that using the system helped them improve their UML knowledge. A full evaluation study is planned for May 2005, which aims to evaluate the interface and the effect of using the system on students' learning.
Tools for performance assessment of OLSR protocol
Authors: Makoto Ikeda, Leonard Barolli, Giuseppe De Marco, Tao Yang, Arjan Durresi, Fatos Xhafa
Venue: Mobile Information Systems (2009)

In this paper, we evaluate the performance of Optimized Link State Routing (OLSR) protocol by experimental and simulation results. The experiments are carried out by using our implemented testbed and the simulations by using ns-2 simulator. We also designed and implemented a new interface for the ad-hoc network testbed in order to make more easier the experiments. The comparison between experimental and simulation results shows that for the same parameters set, in the simulation we did not notice any packet loss. On the other hand, in the experiments we experienced packet loss because of the environment effects and traffic interference.
Predicting interconnect delay for physical synthesis in a FPGA CAD flow
Authors: Valavan Manohararajah, Gordon R. Chiu, Deshanand P. Singh, Stephen D. Brown
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

This paper studies the prediction of interconnect delay in an industrial setting. Industrial circuits and two industrial field-programmable gate-array (FPGA) architectures were used in this paper. We show that there is a large amount of inherent randomness in a state-of-the-art FPGA placement algorithm. Thus, it is impossible to predict interconnect delay with a high degree of accuracy. Futhermore, we show that a simple timing model can be used to predict some aspects of interconnect timing with just as much accuracy as predictions obtained by running the placement tool itself. Using this simple timing model in a two-phase timing driven physical synthesis flow can both improve quality of results and decrease runtime. Next, we present a metric for predicting the accuracy of our interconnect delay model and show how this metric can be used to reduce the runtime of a timing driven physical synthesis flow. Finally, we examine the benefits of using the simple timing model in a timing driven physical synthesis flow, and attempt to establish an upper bound on these possible gains, given the difficulty of interconnect delay prediction.
Beyond the code-and-count analysis of tutoring dialogues
Authors: Stellan Ohlsson, Barbara Di Eugenio, Bettina Chow, Davide Fossati, Xin Lu, Trina C. Kershaw
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

In this paper, we raise a methodological issue concerning the empirical analysis of tutoring dialogues: The frequencies of tutoring moves do not necessarily reveal their causal efficacy. We propose to develop coding schemes that are better informed by theories of learning; stop equating higher frequencies of tutoring moves with effectiveness; and replace ANOVAs and chi-squares with multiple regression. As motivation for our proposal, we will present an initial analysis of tutoring dialogues, in the domain of introductory Computer Science.
ZnO as a dielectric for organic thin film transistor-based non-volatile memory
Authors: N. Tjitra Salim, K. C. Aw, W. Gao, Z. W. Li, B. Wright
Venue: Microelectronic Engineering (2009)

This paper demonstrates the novel application of d.c. sputtered zinc oxide (ZnO) as a charge trapping dielectric material for the application of an organic thin film transistor (OTFT) based non-volatile memory (NVM). The motivation of using ZnO as a dielectric is due to its chemical stability and optical transparency, enabling future development of transparent electronic devices. Unbalanced magnetron d.c. sputtering with Ar:O"2 ratio of 80:20 was used to obtained a ZnO dielectric of 50nm thick. The ZnO has an optical band gap of 3.23eV, resistivity and k-value of 5x10^7@W-cm and 50, respectively. The ZnO sandwiched between two layers of low-k methyl-silsesquioxane (MSQ) sol-gel dielectric creates a triple layer dielectric structure for charge storage. A solution-processable pentacene, 13,6-N-Sulfinylacetamodipentacene, was used as an active layer of an OTFT-NVM. It has been successfully demonstrated that this OTFT-NVM can be electrically programmed and erased at a low voltage.
Approximating the Bandwidth of Caterpillars
Authors: Uriel Feige, Kunal Talwar
Venue: Algorithmica (2009)

A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangement of the vertices of a caterpillar with bandwidth at most O(log&#x2009;n/log&#x2009;log&#x2009;n) times the local density of the caterpillar, where the local density is a well known lower bound on the bandwidth. This result is best possible in the sense that there are caterpillars whose bandwidth is larger than their local density by a factor of &#x03a9;(log&#x2009;n/log&#x2009;log&#x2009;n). The previous best approximation ratio for the bandwidth of caterpillars was O(log&#x2009;n). We show that any further improvement in the approximation ratio would require using linear arrangements that do not respect the order of the vertices of the backbone. We also show how to obtain a (1+&#x03b5;) approximation for the bandwidth of caterpillars in time $2^{\tilde{O}(\sqrt{n/\epsilon})}$. This result generalizes to trees, planar graphs, and any family of graphs with treewidth $\tilde{O}(\sqrt{n})$.
Statistical learning for multimedia information retrieval and their applications
Authors: Qi Tian
Venue:  (2008)

Recent years have witnessed a fast development of Multimedia Information Retrieval (MIR). The content extraction, indexing, and retrieval of large scale multimedia data sets continue to be one of the most challenging and fast-growing research areas. Digital libraries, education and training, media commerce, home media, bioinformatics, biometrics, and medical multimedia databases have created a worldwide need for new paradigms and techniques, such as statistical learning methods on how to browse, search, and summarize multimedia collections. However, statistical learning in Multimedia Information Retrieval still faces some challenges such as semantic gap, small sample size and high dimensionality. In this dissertation, novel methods are proposed and generalized from high to low manner to alleviate these problems and, consequently, facilitate concept selection, data modeling and classification in Multimedia Information Retrieval and other applications.At the high-level, a novel framework to develop a lexicon of high-level concepts with small semantic gaps (LCSS) is constructed. By quantitatively studying and formulating the semantic gap problem, these visually and semantically consistent concepts are automatically selected and show their promising application potential for concept detection, automatic annotation, and multimedia information retrieval. At the middle-level, Fast Adaptive Discriminant Analysis (FADA), Two-Dimensional Adaptive Discriminant Analysis (2DADA) and integrated boosting (i.Boosting) are explored to enhance the Adaptive Discriminant Analysis (ADA). At the low-level, Principal Feature Analysis (PFA) is developed for feature dimension reduction. Those algorithms are successfully applied to several real-world applications on image annotation, face recognition, and microarray analysis. In addition, in the specific application of microarray analysis, to fill a gap between comprehension and interpretation of microarray expression data, we introduce Relevance Feedback to microarray analysis and propose a generalized Kernel Discriminant-EM algorithm (KDEM), which allows for a better classification in a nonlinear feature subspace. We combine Relevance Feedback and KDEM together to construct an efficient and effective semi-supervised learning framework. We also introduce Hybrid Discriminant Analysis by combining PCA and LDA to microarray analysis. Our experiments on various applications show that these methods can efficiently alleviate the semantic gap, small sample size and high dimensionality problems.
An aspect-oriented approach to securing distributed systems
Authors: Henner Jakob, Nicolas Loriant, Charles Consel
Venue: Proceedings of the 2009 international conference on Pervasive services (2009)

The increasing size and complexity of distributed systems create a need to raise the level of abstraction for their development. This need becomes critical for pervasive computing where non-functional properties, such as security, must be guaranteed. Architecture description languages (ADLs) propose a promising approach to coping with the size and complexity of pervasive computing systems. A system is defined by a high-level description that may be used to produce a programming framework. However, non-functional properties are not specifically addressed by existing ADL works. To address this issue aspect-oriented programming is a well-proven technique to properly modularize non-functional concerns that can be dealt with by weaving dedicated code into a program. In this paper, we present DiaAspect, an aspect-oriented language for an ADL. ADLs are a key to our approach because they expose features enabling an accurate coordination of aspects. We demonstrate the expressiveness of DiaAspect with two examples of security policies in pervasive computing. We also show how, combining the knowledge of the architecture description with aspect code, improves aspect weaving in the implementation code.
Digital SLR Cameras & Photography For Dummies, 2nd edition
Authors: David D. Busch
Venue:  (2007)

Understanding exactly how a digital SLR (dSLR) works can help you use its exciting capabilities to their fullest potential. Whether you aim to become a serious photo hobbyist, are interested in turning pro, or want to take advantage of the improved control that dSLRs give you over your photography, this fun and friendly reference will show you how to maximize everything a dSLR has to offer so that you can improve your photography skills, increase your picture-taking and image-editing knowledge, and ultimately, take better photos. Written with just the right balance of technology and techniques in mind, this guide provides you with the know-how on everything from getting acquainted with the basic key features of the technology (lenses, sensors and image processors, and exposure and focusing systems) to the nuances of various dSLR techniques (setting up speedy continuous-shooting burst modes to capture fast action, applying selective and sharp focus, and shooting under the lowest levels of light). Other topics explored include: Composing your shots with an accurate viewfinder Deciding how many pixels your camera needs Cleaning the sensor yourself Choosing between a tripod or monopod Adjusting exposure and improving shutter speed Creating time-lapse sequences Fixing murky or contrasting photos With so much subject area covered, Digital SLR Cameras & Photography For Dummies, 2nd Edition not only introduces you to the fundamentals of great picture-taking with a dSLR, but goes beyond the basics. Some of the more advanced topics discussed include working with the various formats of digital photos, minimizing shutter lag and first-shot delays, and fixing up your pictures with various image-editing programs. This is just the book you need to progress from getting started with a dSLR to actually improving your dSLR photography! The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Component Interface Documentation: What do we Need and Why do we Need it?
Authors: David Lorge Parnas
Venue: Proceeding of the 2006 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fifth SoMeT_06 (2006)

For at least 4 decades, managers, customers, and anyone else who wanted to acquire software, has bemoaned our inability to specify exactly what is required when we want software built. Those who maintain software or use software complain about the lack of a precise description of what it does. Numerous specification methods, none of which have been found to be satisfactory have been proposed. This paper discusses documentation methods,why we need one and what a good one might be like.
Dynamic mixed membership blockmodel for evolving networks
Authors: Wenjie Fu, Le Song, Eric P. Xing
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

In a dynamic social or biological environment, interactions between the underlying actors can undergo large and systematic changes. Each actor can assume multiple roles and their degrees of affiliation to these roles can also exhibit rich temporal phenomena. We propose a state space mixed membership stochastic blockmodel which can track across time the evolving roles of the actors. We also derive an efficient variational inference procedure for our model, and apply it to the Enron email networks, and rewiring gene regulatory networks of yeast. In both cases, our model reveals interesting dynamical roles of the actors.
Adaptive Bayesian network classifiers
Authors: Gladys Castillo, João Gama
Venue: Intelligent Data Analysis (2009)

This paper is concerned with adaptive learning algorithms for Bayesian network classifiers in a prequential (on-line) learning scenario. In this scenario, new data is available over time. An efficient supervised learning algorithm must be able to improve its predictive accuracy by incorporating the incoming data, while optimizing the cost of updating. However, if the process is not strictly stationary, the target concept could change over time. Hence, the predictive model should be adapted quickly to these changes. The main contribution of this work is a proposal of an unified, adaptive prequential framework for supervised learning called AdPreqFr4SL, which attempts to handle the cost-performance trade-off and deal with concept drift. Starting with the simple Na&iuml;ve Bayes, we scale up the complexity by gradually increasing the maximum number of allowable attribute dependencies, and then by searching for new dependences in the extended search space. Since updating the structure is a costly task, we use new data to primarily adapt the parameters. We adapt the structure only when is actually necessary. The method for handling concept drift is based on the Shewhart P-Chart. We experimentally prove the advantages of using the AdPreqFr4SL in comparison with its non-adaptive versions.
Design for interaction
Authors: Daniel Tunkelang
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Research in information retrieval has focused on presenting the most relevant results to a user in response to a free-text search query. Research in database systems assumes a model where the user enters a formal query, and the results are exactly those the user requested. Neither community has emphasized user interaction—a critical concern for practical information access. As William Goffman noted in the 1960s and Nick Belkin continually reminds us today, the relationship between a document and query, though necessary, is not sufficient to determine relevance—yet ranked retrieval approaches rely heavily or exclusively on this relationship. Meanwhile, recent work on database usability by Jeff Naughton and H.V. Jagadish surfaces the rigidity of database systems that return nothing unless users know how to formulate precise queries. This talk presents human-computer information retrieval (HCIR) as a general approach that addresses some of the key challenges facing both research communities. A vision first put forward by Gary Marchionini, HCIR expects people and systems to work together to implement information access. Such an approach requires rethinking information access not as a matching or ranking problem, but rather as a communication problem. Specifically, we need interfaces that optimize the bidirectional communication between the user and the system, thus optimizing the symbiotic division of labor between the two. This talk reviews the history of HCIR efforts and presents ongoing work to implement the HCIR vision. In particular, it presents an interactive set retrieval approach that responds to queries with an overview of the user's current context and an organized set of options for incremental exploration.
An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs
Authors: Benjamin Birnbaum, Kenneth J. Goldman
Venue: Algorithmica (2009)

Given a positive integer k and a complete graph with non-negative edge weights satisfying the triangle inequality, the remote-clique problem is to find a subset of k vertices having a maximum-weight induced subgraph. A greedy algorithm for the problem has been shown to have an approximation ratio of 4, but this analysis was not shown to be tight. In this paper, we use the technique of factor-revealing linear programs to show that the greedy algorithm actually achieves an approximation ratio of 2, which is tight.
OntoPathView: A Simple View Definition Language for the Collaborative Development of Ontologies
Authors: E. Jimenez, R. Berlanga, I. Sanz, M. J. Aramburu, R. Danger
Venue: Proceeding of the 2005 conference on Artificial Intelligence Research and Development (2005)

In this paper we introduce a new view definition language, named OntoPathView, which combines the simplicity of XPath with the high expressiveness of RDF/S based view languages. This language will allow us to work in a collaborative environment for the development of complex ontologies.
Coverage of course topics in a student generated MCQ repository
Authors: Paul Denny, Andrew Luxton-Reilly, John Hamer, Helen Purchase
Venue: ACM SIGCSE Bulletin (2009)

A recent approach to engaging students in deep learning involves an online tool, PeerWise, through which students contribute multiple-choice questions to a shared question bank. Earlier work demonstrated a strong correlation between the use of PeerWise and student performance. In this study we investigate the quality of the MCQ repository created by students in an introductory programming course by analysing the range of topics on which students chose to write questions (i.e.~the repository coverage) without guidance from an instructor. We assess the repository coverage by comparing it with a common list of typical introductory programming topics, and by looking at its extent. We find that, despite having freedom to choose any topic, students created a repository that covered all the major topics in the curriculum.
Ontology Integration Using ε-Connections
Authors: Bernardo Cuenca Grau, Bijan Parsia, Evren Sirin
Venue: Modular Ontologies: Concepts, Theories and Techniques for Knowledge Modularization (2009)

The standardization of the Web Ontology Language, OWL, leaves (at least) two important issues for Web-based ontologies unsatisfactorily resolved, namely how to represent and reason with multiple distinct, but linked ontologies, and how to enable effective knowledge reuse and sharing on the Semantic Web. In this paper, we present a solution for these problems based on ε-Connections. We aim to use ε-Connections to provide modelers with suitable means for developing Web ontologies in a modular way and to provide an alternative to the owl:imports construct.
A Low-Complexity PTS-based PAPR Reduction Technique for OFDM Signals without Transmission of Side Information
Authors: Theodoros Giannopoulos, Vassilis Paliouras
Venue: Journal of Signal Processing Systems (2009)

Increased peak-to-average power ratio (PAPR) imposes a design challenge for orthogonal frequency division multiplexing-based signals. An efficient technique to address the increased PAPR problem is the partial transmit sequences (PTS) approach. A significant drawback of PTS is the fact that it multiplies the transmitted symbol with weighting factors selected by the transmitter. Since the weighting factors are required for decoding, they are explicitly transmitted, in most cases. This paper proposes a new low-complexity technique for retrieving the weighting factors in the receiver. The proposed decoder uses the predefined values of pilot tones and explores all the permissible combinations of weighting factors in order to identify the factor combination employed by the transmitter. The proposed decoder requires no additional pilot tones or explicit transmission of side information, therefore no data rate loss is implied. Furthermore this paper presents a digital very large scale integration implementation of the proposed PTS decoder and demonstrates its low-power properties.
Responsive elastic computing
Authors: Julien Perez, Cécile Germain-Renaud, Balázs Kégl, Charles Loomis
Venue: Proceedings of the 6th international conference industry session on Grids meets autonomic computing (2009)

Two production models are candidates for e-science computing: grids enable hardware and software sharing; clouds propose dynamic resource provisioning (elastic computing). Organized sharing is a fundamental requirement for large scientific collaborations; responsiveness, the ability to provide good response time, is a fundamental requirement for seamless integration of the large scale computing resources into everyday use. This paper focuses on a model-free resource provisioning strategy supporting both scenarios. The provisioning problem is modeled as a continuous action-state space, multi-objective reinforcement learning problem, under realistic hypotheses; the high level goals of users, administrators, and shareholders are captured through simple utility functions. We propose an implementation of this reinforcement learning framework, including an approximation of the value function through an Echo State Network, and we validate it on a real dataset.