ppxscal/embedding_network huggingface dataset:
Internet Research Skills: How To Do Your Literature Search and Find Research Information Online, 2nd edition
Authors: Niall O Dochartaigh
Venue:  (2007)

Internet Research Skills is a clear and concise guide to the effective use of the Internet for students in the social sciences. The open web is becoming central to student research practice, not least because of its accessibility, and this clear text describes search strategies and outlines the critical skills necessary to deal with such diverse and disorganized materials. Internet Research Skills covers all of the essential aspects of Internet research, with each chapter containing a number of illustrations, inset boxes, and short exercises. The first half of the book deals with publications online, devoting separate chapters to the academic articles, books, official publications and news sources which form the core secondary sources for social science research. The second half of the book deals with the open web, a vast and confusing realm of materials, many of which have no direct print counterpart. Key Features: Inset boxes, including search tips, technical explanations, examples and warning tips on avoiding common pitfalls Exercises at the end of each chapter that cover the key skills Worked examples throughout the book, drawing on a range of social science disciplines Illustration with relevant screengrabs This concise and accessible introduction to Internet research skills will be a perfect guide for undergraduate students carrying out research projects and for postgraduate students working on theses and dissertations. (20070621)
Algorithms for clustering clickstream data
Authors: Panagiotis Antonellis, Christos Makris, Nikos Tsirakis
Venue: Information Processing Letters (2009)

Clustering is a classic problem in the machine learning and pattern recognition area, however a few complications arise when we try to transfer proposed solutions in the data stream model. Recently there have been proposed new algorithms for the basic clustering problem for massive data sets that produce an approximate solution using efficiently the memory, which is the most critical resource for streaming computation. In this paper, based on these solutions, we present a new model for clustering clickstream data which applies three different phases in the data processing, and is validated through a set of experiments.
Extending logic programming beyond computability
Authors: Peter Gabrovsky
Venue: Journal of Computing Sciences in Colleges (2009)

From a practical point of view, any extension of a logic programming language based on a first-order logic should stay within the realm of computability. Indeed, over the last several years many such extensions have been proposed, resulting in languages based on various logics such as modal, temporal, higher-order, non-monotonic, etc. In this paper however, we propose an extension which leads to a proper generalization of the notion of computability. We obtain this by allowing universal quantification in the body of program clauses, and we refer to the resulting language as UNILOG. We show that in UNILOG, in addition to the computable functions, one can also define functions that are non-computable. We argue that such an extension is valuable from a theoretical point of view. The claim that UNILOG is indeed a logic programming language is justified by our demonstration that it has an appropriate fixed-point semantics. Building upon an idea of Fitting [1], we present a recursion-theoretic semantics by generalizing the notion of a unary enumeration operator to that of a binary enumeration operator. We then show that there is one-to-one correspondence between the logic programs in UNILOG and a set of these binary enumeration operators. In the context of an earlier work by the present author, this paper refers to an axiomatic theory of generalized computability, arguing that within it, this semantics can be used as a foundation for future theoretical studies of UNILOG.
An algorithm to compute the Wedderburn decomposition of semisimple group algebras implemented in the GAP package wedderga
Authors: Gabriela Olteanu, Ángel del Río
Venue: Journal of Symbolic Computation (2009)

We present an algorithm to compute the Wedderburn decomposition of semisimple group algebras based on a computational approach of the Brauer-Witt theorem. The algorithm was implemented in the GAP package wedderga.
Two aspects of optimal diet determination for pig production: efficiency of solution and incorporation of cost variation
Authors: Duangdaw Sirisatien, Graham R. Wood, Mingqiang Dong, Patrick C. Morel
Venue: Journal of Global Optimization (2009)

For many decades linear programming has been used to find minimum cost diets, notably in the chicken and pig meat industries. More recently, animal growth models together with nonlinear optimisation methods have been used to find feeding schedules which simultaneously minimise feed costs and maximise market return, so maximising gross margin. Genetic algorithms can handle these problems, albeit slowly. In this paper we study the particular nature of the objective function (for pig meat production) and develop a global optimisation algorithm tailored to its discontinuous structure. We also demonstrate the use of stochastic programming to cope with changing feed costs and changing price at slaughter.
Performance of multiuser network-aware prefetching in heterogeneous wireless systems
Authors: Ben Liang, Stephen Drew, Da Wang
Venue: Wireless Networks (2009)

We study the performance of multiuser document prefetching in a two-tier heterogeneous wireless system. Mobility-aware prefetching was previously introduced to enhance the experience of a mobile user roaming between heterogeneous wireless access networks. However, an undesirable effect of multiple prefetching users is the potential for system instability due to the racing behavior between the document access delay and the user prefetching quantity. This phenomenon is particularly acute in the heterogeneous environment. We investigate into alleviating the system traffic load through prefetch thresholding, accounting for server queuing prioritization. We propose a novel analysis framework to evaluate the performance of the thresholding approach. Numerical and simulation results show that the proposed analysis is accurate for a wide variety of access, service, and mobility patterns. We further demonstrate that stability can be maintained even under heavy usage, providing both the same scalability as a non-prefetching system and the performance gain associated with prefetching.
A Method to Recognize and Count Leaves on the Surface of a River Using User's Knowledge about Color of Leaves
Authors: Fujio Tsutsumi, Yutaka Tateda
Venue: New Frontiers in Applied Data Mining: PAKDD 2008 International Workshops, Osaka, Japan, May 20-23, 2008. Revised Selected Papers (2009)

This paper proposes a recognition and count method of leaves on the surface of a river to be used in mangrove ecosystem monitoring. Conventionally counting leaves required considerable manual labor for precise monitoring of material flow in the ecosystem. Therefore an efficient counting method was needed. Our method automatically recognizes and counts the number of floating leaves in recorded video using color and motion features. The color feature is represented by 3 dimensional histogram of a color space. We have developed a user interface based on the interactive machine learning model to acquire the color feature from video images. The user can easily produce a huge number of sample data to extract the color feature by the user interface in the same way as coloring a picture. For the motion feature, speed and acceleration of the targets are used. The counting method proposed in this paper has been applied to three videos (total five hours) which recorded about 20,000 leaves, and high recall and precision rates of 96% and 94%, respectively, have been achieved.
The Underwater Acoustic OFDM Channel Estimation Based on Wavelet and MMSE
Authors: Xue-fei Ma, Chun-hui Zhao, Gang Qiao
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

In this paper we proposed a novel approach of channel estimation based on wavelet and MMSE. Recently, there have been tremendous demands for high-speed data transmission in underwater acoustic communications. Accurate channel estimation is necessary for coherent detection of the underwater acoustic orthogonal frequency division multiplexing (OFDM) signals. Pilot-assisted channel estimation using training sequence to obtains the channel information, the transmitter rate decrease rapidly along with the number of training sequence increase. We proposed a approach using less training to estimate the channel by wavelet and Minimum Mean Square Error ( MMSE), the pilot sequence before transmitting is convolutionnal encoded for the correlation of symbol, at the receive wavelet denoise is imposed to eliminate the Additive white Gaussian noise (AWGN) then using MMSE to obtain others frequency bin channel impulse response inner the same block
Leveraging the Upcoming Internet of Services through an Open User-Service Front-End Framework
Authors: David Lizcano, Miguel Jiménez, Javier Soriano, José M. Cantera, Marcos Reyes, Juan J. Hierro, Francisco Garijo, Nikolaos Tsouroulas
Venue: Proceedings of the 1st European Conference on Towards a Service-Based Internet (2008)

The Internet of the Future is expected to be composed of a mesh of interoperable Web Services accessed from all over the Web. This approach has not yet caught on since a global user-service interaction is still an open issue. This paper states our position with regard to the next generation front-end technology for the Internet of the Future. This approach will enable the massive deployment of services over the Internet in a user-centric fashion. This paper advocates the full development of front-end technologies to bring services closer to users, empowering them anytime and anywhere. It also outlines all the main gaps and technological challenges that have to be addressed. Finally, a model and an architecture are proposed for building these technologies into NESSI's Open Framework Reference Architecture, NEXOF-RA.
Compensation of Partly Photographed Page-Images Using 3D Shape Information
Authors: Toshifumi Nakajima, Masaaki Kashimura, Shinji Ozawa
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper propose a new method in order to compensate distortion of a book page image caused by photographing a opened book on a table with digital camera. This image distortion is caused by 3D shape of the page, therefore 3D shape information of the page is necessary to apply some geometric compensations. If high resolution is required for archiving, books are usually partly photographed because the photograph range is small for desirable resolution at the present time. In this case, each neighboring image necessarily has a overlap area for joining partial images together after photographing. We put the characters in the overlap areas to good use for seeking of the corresponding points in the stereo method to obtain 3D shape information of the page. On supposition that the page cross sections along book-binding have no change, compensation of image distortion and joint of partial images are well performed.
Who's your tiger? Using simulation to optimize the lineup of the Detroit Tigers offense
Authors: Jared Davis, Barbara Fordyce, James Cicala, Matthew Cooper, Omer Tsimhoni
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

As part of an undergraduate engineering class project, a simulation of the Detroit Tigers offense was created to explore potential changes that would increase number of wins. More specifically, we seek to determine a lineup for an MLB team, the Detroit Tigers, that would maximize their potential runs. To answer our ultimate question of whether a manager actually maximizes runs scores, we compare our results to the Tigers' 2007 performance. We determine that though the Tigers did not use the ideal lineup as determined by our model, the lineup they did utilize was moderately robust, with ours winning 89.6 games versus the actual wins of 88 games. Additionally, we apply our model to a normative analysis of the Tigers ideal lineup for the 2008 season. This ideal lineup only changes the middle of the batting order (acceptable by management) and is predicted to win 99 games in the 2008 season.
Towards Context-Aware Telecom End User Services through SOA
Authors: Philipp H. Mohr, Giuseppe Raffa, Marina Pettinari, Tullio Salmon Cinotti, Cristina Frà, Claudio Venezia, Paolo Protto
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

In this paper a SOA inspired context-aware platform for enabling context-aware Telecom services is presented. The SOA related components are highlighted and the platform's integration into a Telecom provider's service architecture is described -- pointing out challenges in terms of protocols and semantic interoperability. An example application bridging the gap between data collected through a user's mobile phone and a web based portal in order to provide a Virtual Location Application through our platform is presented.
Tangibles for toddlers learning language
Authors: Bart Hengeveld, Caroline Hummels, Kees Overbeeke, Riny Voort, Hans van Balkom, Jan de Moor
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

Here we present LinguaBytes, a modular, tangible play-and-learning system developed to stimulate the language and communication skills of toddlers (with a developmental age between 1 and 4 years) with multiple disabilities. The typical characteristics of these children and their common learning environment call for intelligent systems that are quickly and easily adaptable, or, even better, adjust themselves proactively. Over the last two and a half years we have designed and tested such a system within LinguaBytes. In this paper we will outline starting points, indicate the opportunities of Tangible Interaction and finally give an overview of the current LinguaBytes prototype.
My world: dinner address Friday, April 3, 2009
Authors: Larry Dablemont
Venue: Journal of Computing Sciences in Colleges (2009)

Larry Dablemont, a nationally known naturalist, storyteller, and freelance writer, will appear as the banquet speaker for the 2009 CCSC-CP. Larry's very first national magazine article was published in 1972 in Outdoor Life, entitled "Old Paint" the story of his boyhood on the Big Piney River with an old wooden johnboat. That article was selected by a New York Publishing Company, Ehre and Dutton, as the best outdoor story of the year, and published in a book entitled, "Best Sport Stories of 1972". In 1975, living in North Arkansas, Dablemont decided to become a full-time freelance writer, and has now written several hundred magazine articles for more than a dozen national magazines and about 3500 newspaper columns for more than 100 newspapers. More than 30 of his outdoor photographs have illustrated the covers of various outdoor magazines.
Strict and practical bounds through a non-intrusive and goal-oriented error estimation method for linear viscoelasticity problems
Authors: Ludovic Chamoin, Pierre Ladevèze
Venue: Finite Elements in Analysis and Design (2009)

In this work, we set up a non-intrusive procedure that yields for strict and high-quality error bounds of quantities of interest in linear viscoelasticity problems solved by means of the finite element method (FEM). The goal-oriented error estimation approach uses the concept of dissipation error and classical duality techniques involving the solution of an adjoint problem. The non-intrusive feature of this approach is achieved by introducing enrichment functions, via a partition of unity, when solving the adjoint problem numerically (handbook techniques), so that the discretization parameters defined for the primal problem can be reused. The resulting local error estimation method is thus highly effective, easy to implement in a finite element code, and it enables to consider discretization error on truly pointwise quantities of interest.
FaceBots: robots utilizing and publishing social information in facebook
Authors: Nikolaos Mavridis, Chandan Datta, Shervin Emami, Andry Tanoto, Chiraz BenAbdelkader, Tamer Rabie
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

Our project aims at supporting the creation of sustainable and meaningful longer-term human-robot relationships through the creation of embodied robots with face recognition and natural language dialogue capabilities, which exploit and publish social information available on the web (Facebook). Our main underlying experimental hypothesis is that such relationships can be significantly enhanced if the human and the robot are gradually creating a pool of shared episodic memories that they can co-refer to (shared memories), and if they are both embedded in a social web of other humans and robots they both know and encounter (shared friends). In this paper, we are presenting such a robot, which as we will see achieves two significant novelties.
An Open, Ubiquitous and Adaptive Chronic Disease Management Platform for Chronic Respiratory and Renal Diseases (CHRONIOUS)
Authors: R. Farré, A. Papadopoulos, G. Munaro, R. Rosso
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

CHRONIOUS is a highly innovative Information and Communication Technologies (ICT) research initiative that aspires to implement its vision for ubiquitous health and lifestyle monitoring of people with chronic diseases at a European level.CHRONIOUS is funded by the European Union under its 7th Framework Program. The project started on February 1st, 2008 and has a planned duration of three years and half. The CHRONIOUS team is a consortium of internationally renowned research labs in Europe, universities and private companies, who collaborate to define a European framework for a generic health status monitoring platform addressing people with chronic health conditions. CHRONIOUS addresses a smart wearable platform, based on multi-parametric sensors processing, for monitoring people suffering from chronic diseases. In particular CHRONIOUS will be tested with chronic obstructive pulmonary disease (COPD) and chronic kidney disease (CKD) and renal insufficiency inpatients at their home.
CSMA interaction detection and capacity estimation in cognitive radio networks
Authors: Antonio Greco, Thomas Milcher, Vinay Kolar, Petri Mähönen, Marina Petrova
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

Estimation of the available capacity in a multiple hop route in cognitive radio networks is challenging. Several complex problems like channel assignment, interference estimation and routing effects needs to be addressed. In this demonstration, we exhibit a capacity estimation engine that determines the available capacity of the routes in a dynamic cognitive radio network using USRP and WARP software-defined radios. In addition to the available capacity, we show the various types of MAC interference and its effect in the network. The tool demonstrates a fundamental capacity estimation block, which provides valuable input to higher level applications like routing, network provisioning and monitoring. A scheduling aware routing algorithm that exploits the capacity estimation engine and scheduling interactions is shown as an example application.
Computer performance analysis in mixed on-line/batch workloads
Authors: Jo Ann Lockett
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Analysts may measure and analyze a mixed-workload system for a variety of reasons. As a first example, it may be necessary to cut costs by reducing equipment. Before arbitrarily removing some piece of equipment, management should determine how the on-line and batch systems will be affected. If problem areas can be identified prior to equipment removal, action can be taken to reduce any negative impact. The next decision may then involve the selection of equipment to remove. This decision could best be made if comparative data on the performance of the various configurations were obtainable.
Detection of Security Vulnerabilities Using Guided Model Checking
Authors: Aliaksei Tsitovich
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Software security problems are good candidates for application of verification techniques. Usually it is not a complex task to represent certain security-related property in a particular verification framework. For instance in any software model checking environment (MC)[1] it is possible to state buffer overflow detection as a reachability problem. The approach works in theory and in practice, but has a major scalability drawback: the state-space, which represents all possible behaviors of the system, might grow exponentially in the size of the product of a model and a property. From the other side MC has an important advantage - a counter-example is produced automatically when the bug is found. 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
LP-based online scheduling: from single to parallel machines
Authors: Jos&#x00e9; R. Correa, Michael R. Wagner
Venue: Mathematical Programming: Series A and B (2009)

We study classic machine sequencing problems in an online setting. Specifically, we look at deterministic and randomized algorithms for the problem of scheduling jobs with release dates on identical parallel machines, to minimize the sum of weighted completion times: Both preemptive and non-preemptive versions of the problem are analyzed. Using linear programming techniques, borrowed from the single machine case, we are able to design a 2.62-competitive deterministic algorithm for the non-preemptive version of the problem, improving upon the 3.28-competitive algorithm of Megow and Schulz. Additionally, we show how to combine randomization techniques with the linear programming approach to obtain randomized algorithms for both versions of the problem with competitive ratio strictly smaller than 2 for any number of machines (but approaching two as the number of machines grows). Our algorithms naturally extend several approaches for single and parallel machine scheduling. We also present a brief computational study, for randomly generated problem instances, which suggests that our algorithms perform very well in practice.