ppxscal/embedding_network huggingface dataset:
Pre-service teacher training in mathematics using tablet PC technology
Authors: Olga Kosheleva, Ana Medina-Rusch, Vera Ioudina
Venue: Informatics in education (2007)

This study focuses on the use of innovative Tablet PC technology in learning and teaching mathematics. Specifically the effects of incorporating Tablet PC technology in pre-service teachers' mathematics education were analyzed. The significant impact of technology use in mathematics education was assessed by evaluating and comparing students' final project and course grades. Grade performance of two groups of students was compared. One group was the treatment group where students extensively used Tablet PCs to work on mathematical investigations and explorations and to create lesson plans and animated games through PowerPoint presentations. The other group was the control group where students worked on identical mathematics investigations and created lesson plans without utilizing any technology. The outcome shows that the technology enhanced group achieved significantly higher scores than the control group. This outcome indicates a greater improvement in the treatment group's understanding of mathematical content versus that of the control group's.
Flexible multi-sensorial system for automatic disassembly using cooperative robots
Authors: P. Gil, J. Pomares, S. vT. Puente, C. Diaz, F. Candelas, F. Torres
Venue: International Journal of Computer Integrated Manufacturing (2007)

Flexible multisensorial systems are a very important issue in the current industry when disassembling and recycling tasks have to be performed. These tasks can be performed by a human operator or by a robot system. In the current paper a robotic system to perform the required tasks is presented. This system takes into consideration the distribution of the necessary tasks to perform the disassembly of a component using several robots in a parallel or in a cooperative way. The algorithm proposed to distribute the task among robots takes into consideration the characteristics of each task and the sequence that needs to be followed to perform the required disassembly of the product. Furthermore, this paper presents a disassembly system based on a sensorized cooperative robots interaction framework for the planning of movements and detections of objects in the disassembly tasks. To determine the sequence of the disassembly of some products, a new strategy to distribute a set of tasks among robots is presented. Subsequently, the visual detection system used for detecting targets and characteristics is described. To carry out this detection process, different well known strategies, such as matching templates, polygonal approach and edge detection, are applied. Finally, a visual-force control system has been implemented in order to track disassembly trajectories. An important aspect of this system is the processing of the sensorial information in order to guarantee coherence. This aspect allows the application of both sensors, visual and force sensors, co-ordinately to disassembly tasks. The proposed system is validated by experiments using several types of components such as the covers of batteries and electronic circuits from toys, and drives and screws from PCs.
Non-Cayley-isomorphic self-complementary circulant graphs
Authors: Valery Liskovets, Reinhard Pöschel
Venue: Journal of Graph Theory (2000)

Non-CI self-complementary circulant graphs of prime-squared order are constructed and enumerated. It is shown that for prime p, there exists a self-complementary circulant graph of order p2 not Cayley isomorphic to its complement if and only if p&thinsp;&equiv;&thinsp;1 (mod 8). Such graphs are also enumerated. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 34: 128&ndash;141, 2000
Pro SQL Server 2008 XML (Pro)
Authors: Michael Coles
Venue:  (2008)

Knowledge and ability to apply XML are de rigueur in todays world, and SQL Server developers and administrators are no exception to that rule. Pro SQL Server 2008 XML is your key to unlocking the powerful XML feature set first introduced in SQL Server 2005 and since refined in SQL Server 2008. Author Michael Coles shows how to store XML using SQL Servers builtin XML data type. Learn to query and manipulate XML data using standard technologies such as XQuery and XSLT. No SQL Server database professional can afford to be without knowledge of the XML feature set. Pro SQL Server 2008 XML delivers on the knowledge that you need to remain competitive in your career. Shows how to store, query, and manipulate XML documents in SQL Server Provides stepbystep examples showing best practices and advanced features Accurately discusses how SQL Servers XML feature set stacks up against the ISO XML standards What youll learn Store XML documents using SQL Servers builtin XML data type. Query those stored documents using SQL/XML and XQuery. Manipulate and transform XML using XSLT and XPath. Understand how SQL Servers XML support compares to the ISO XML standards. Create SOAP endpoints for use in web services applications. Create primary and secondary XML indexes to improve performance of XML queries. Who is this book for? SQL Server SQL/TSQL developers and .NET developers who want to take advantage of the specific serverside XML functionality available in SQL Server 2008 About the Apress Pro Series The Apress Pro series books are practical, professional tutorials to keep you on and moving up the professional ladder. You have gotten the job, now you need to hone your skills in these tough competitive times. The Apress Pro series expands your skills and expertise in exactly the areas you need. Master the content of a Pro book, and you will always be able to get the job done in a professional development project. Written by experts in their field, Pro series books from Apress give you the hardwon solutions to problems you will face in your professional programming career. Related Titles Accelerated SQL Server 2008 SQL Server 2008 Transact-SQL Recipes: A Problem-Solution Approach Beginning SQL Server 2008 for Developers: From Novice to Professional Pro T-SQL 2008 Programmer's Guide
High Performance Relay Mechanism for MPI Communication Libraries Run on Multiple Private IP Address Clusters
Authors: Ryousei Takano, Motohiko Matsuda, Tomohiro Kudoh, Yuetsu Kodama, Fumihiro Okazaki, Yutaka Ishikawa, Yasufumi Yoshizawa
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

We have been developing a Grid-enabled MPI communication library called GridMPI, which is designed to run on multiple clusters connected to a wide-area network. Some of these clusters may use private IP addresses. Therefore, some mechanism to enable communication between private IP address clusters is required. Such a mechanism should be widely adoptable, and should provide high communication performance.In this paper, we propose a message relay mechanism to support privateIP address clusters in the manner of the Interoperable MPI (IMPI) standard. Therefore, any MPI implementations which follow the IMPI standard cancommunicate with the relay. Furthermore, we also propose a trunking method in which multiple pairs ofrelay nodes simultaneously communicate between clusters to improve the available communication bandwidth. While the relay mechanism introduces an one-way latency of about 25 usec,the extra overhead is negligible, since the communication latency through a wide area network is a few hundred times as large as this. By using trunking, the inter-cluster communication bandwidth can improveas the number of trunks increases. We confirmed the effectivenessof the proposed method by experiments using a 10~Gbps emulated WAN environment. When relay nodes with 1 Gbps NICs are used, the performance of most of the NAS Parallel Benchmarks improved proportional to the number of trunks. Especially, using 8 trunks, FT and IS are 4.4 and 3.4 times faster, respectively, compared with the single trunk case. The results showed that the proposed method is effective for running MPI programs over high bandwidth-delay product networks.
ω, Δ, and χ
Authors: B. Reed
Venue: Journal of Graph Theory (1998)

We discuss bounding the chromatic number of a graph by a convex combination of its clique number and its maximum degree plus 1. We will often have recourse to the probabilistic method. &copy; 1998 John Wiley & Sons, Inc. J Graph Theory 27: 177&ndash;212, 1998
Robust stability and robust H∞ control of 2-D discrete systems with polytopic uncertainty
Authors: Lixin Gao
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

In this note, a new sufficient LMI condition for the robust stability is first established with respect to polytopic uncertainty. Then we establish Bounded Real Lemma and extended H∞ control condition for 2-D systems, from which guaranteed H∞ cost condition for uncertain 2-D systems in convex polytopic domains is given in terms of a set of linear matrix inequalities defined at the vertices of uncertainty domain. This approach is less conservative by using a parameter-dependent Lyapunov function and extends the results of the related references. Finally, some numerical examples are given to illustrate the results.
Analysis and design of a web-agent-based distributed learning environment
Authors: Qiangguo Pu, Zhengqin Wu, Nikos Mastorakis
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

In this paper the authors advocate using agent technologies to maximize the advantages of distance learning using the Internet. They introduce the concepts of agents and distributed learning environments. Then they start by analyzing the needs and tasks for students, tutors, and professors in a Web-based learning environment. The basic agent, agent server, agent system architecture are then described. With the proposed architecture the users (professors, tutors, and students) can delegate a range of tasks to personalized agents that can act on the their behalf. It also enables natural, mobile, multi-modal user interfaces to distributed educational services.
An approach for congestion control in sensor network using priority based application
Authors: Md. Obaidur Rahman, Muhammad Mostafa Monowar, Byung Goo Choi, Choong Seon Hong
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Congestion causes packet loss which in turn drastically decreases network performance and throughput. As sensors are energy constraint so it is a decisive task to detect congestion and perform congestion control. Additionally, varieties of application have different requirement (i.e. delay, link utilization, and packet loss). In this paper we proposed an application priority based rate control algorithm to mitigate congestion in sensor network. This approach also maintains an interactive queue management scheme so that requirements of different application can be fulfilled. To ensure varieties application priority, concept of intra queue priority and inter queue priority are evolved. Node priority based hop by hop rate adjustment is also proposed here to ensure high link utilization. Finally experimental outputs have demonstrated the effectiveness of this task and show a noticeable performance in terms of energy analysis and throughput of the network.
Finding Biconnected Componemts And Computing Tree Functions In Logarithmic Parallel Time
Authors: R. E. Tarjan
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

In this paper we propose a new algorithm for finding the blocks (biconnected components) of an undirected graph. A serial implementation runs in 0[n+m] time and space on a graph of n vertices and m edges. A parallel implmentation runs in 0[log n] time and 0[n+m] space using 0[n+m] processors on a concurrent-read, concurrent-write parallel RAM. An alternative implementation runs in 0[n/sup 2/p] time and 0[n/sup 2/] space using any number p /spl les/ n/sup 2/log/sup 2/-n of processors, on a concurrent-read, exclusive-write parallel RAM. The latter algorithm has optimal speedup, assuming an adjacency matrix representation of the input. A general algorithmic technique which simplifies and improve computation of various functions on tress is introduced. This technique typically requires 0(log n) time using 0(n) space on an exclusive-read exclusive-write parallel RAM.
Lossless filter for multiple repetitions with Hamming distance
Authors: Pierre Peterlongo, Nadia Pisanti, Frédéric Boyer, Alair Pereira do Lago, Marie-France Sagot
Venue: Journal of Discrete Algorithms (2008)

Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been created in order to speed up the solution of the problem. However, previous filters were made for speeding up pattern matching, or for finding repetitions between two strings or occurring twice in the same string. In this paper, we present an algorithm called Nimbus for filtering strings prior to finding repetitions occurring twice or more in a string, or in two or more strings. Nimbus uses gapped seeds that are indexed with a new data structure, called a bi-factor array, that is also presented in this paper. Experimental results show that the filter can be very efficient: preprocessing with Nimbus a data set where one wants to find functional elements using a multiple local alignment tool such as Glam, the overall execution time can be reduced from 7.5 hours to 2 minutes.
Email Categorization Using (2+1)-Tier Classification Algorithms
Authors: M. Rafiqul Islam, Wanlei Zhou, Morshed U. Chowdhury
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

In this paper we have proposed a spam filtering technique using (2+1)-tier classification approach. The main focus of this paper is to reduce the false positive (FP) rate which is considered as an important research issue in spam filtering. In our approach, firstly the email message will classify using first two tier classifiers and the outputs will appear to the analyzer. The analyzer will check the labeling of the output emails and send to the corresponding mailboxes based on labeling, for the case of identical prediction. If there are any misclassifications occurred by first two tier classifiers then tier-3 classifier will invoked by the analyzer and the tier-3 will take final decision. This technique reduced the analyzing complexity of our previous work [11,12]. It has also been shown that the proposed technique gives better performance in terms of reducing false positive as well as better accuracy.
Semantically-enhanced on-demand resource provision and management for the grid
Authors: Mumtaz Siddiqui, Thomas Fahringer
Venue: Multiagent and Grid Systems (2007)

On-demand resource provision can play a significant role in shielding the Grid middleware complexities and leading towards an invisible Grid. However, in the Grid, on-demand provision has been mostly ignored due to the dynamic Grid behavior, multi-constrained environment, and lack of support for a powerful description, discovery, and correlation mechanism. These problems force the Grid users to perform an impractical manual selection of the resources. A remedy is proposed as a dynamically scalable and customizable resource management, with an ontology-based resource description and correlation mechanism. The classic syntax-based symmetric resource description model is replaced with an extensible semantics-based asymmetric model. Now the resources can be clearly described, unambiguously interpreted, and automatically delivered on-demand. A WSRF-based implementation and an OWL-based semantics enhancement is provided with the demonstrations to prove the effectiveness of the proposed approach.
Do air pollution emissions and fuel consumption models for roadways include the effects of congestion in the roadway traffic flow?
Authors: R. Smit, A. L. Brown, Y. C. Chan
Venue: Environmental Modelling Software (2008)

Road transport emission and fuel consumption models are currently used extensively to predict levels of air pollution along roadway links and networks. This paper examines how, and to what extent, models which are currently used to predict emissions and fuel consumption from road traffic include the effects of congestion. A classification framework is presented in which a key factor, driving pattern, connects emissions to congestion. Prediction of the effects of different driving patterns in emission models is generally restricted to certain aspects of modelling, i.e. hot-running emissions of regulated pollutants. As a consequence, the effects of congestion are only partially incorporated in the predictions. The majority of emission models explicitly incorporate congestion in the modelling process, but for one important family of emission models, namely average speed models, this could not be determined directly. Re-examination of the (light-duty) driving patterns on which three average speed models (COPERT, MOBILE, EMFAC) are based, shows that it is likely that congestion is represented in these patterns. Since (hot-running) emission factors are based on these patterns, this implies that the emission factors used in these emission models also reflect different levels of congestion. Congestion is thus indirectly incorporated in these models. It is recommended, that, in order to get more accurate (local) emission predictions and to achieve correct application in particular situations, it is important to improve current average speed models by including a congestion algorithm, or alternatively, at least provide information on the level of congestion in the driving patterns on which these models are based and recommendations on what applications the models are suitable for.
Multithreaded simulation for synchronous dataflow graphs
Authors: Chia-Jui Hsu, José Luis Pino, Shuvra S. Bhattacharyya
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Synchronous dataflow (SDF) has been successfully used in design tools for system-level simulation of wireless communication systems. Modern wireless communication standards involve large complexity and highly-multirate behavior, and typically result in long simulation time. The traditional approach for simulating SDF graphs is to compute and execute static single-processor schedules. Nowadays, multi-core processors are increasingly popular for their potential performance improvements through on-chip, thread-level parallelism. However, without novel scheduling and simulation techniques that explicitly explore multithreading capability, current design tools gain only minimal performance improvements. In this paper, we present a new multithreaded simulation scheduler, called MSS, to provide simulation runtime speed-up for executing SDF graphs on multi-core processors. We have implemented MSS in the Advanced Design System (ADS) from Agilent Technologies. On an Intel dualcore, hyper-threading (4 processing units) processor, our results from this implementation demonstrate up to 3.5 times speed-up in simulating modern wireless communication systems (e.g., WCDMA3G, CDMA 2000, WiMax, EDGE, and Digital TV).
An asymptotic analysis of generative, discriminative, and pseudolikelihood estimators
Authors: Percy Liang, Michael I. Jordan
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Statistical and computational concerns have motivated parameter estimators based on various forms of likelihood, e.g., joint, conditional, and pseudolikelihood. In this paper, we present a unified framework for studying these estimators, which allows us to compare their relative (statistical) efficiencies. Our asymptotic analysis suggests that modeling more of the data tends to reduce variance, but at the cost of being more sensitive to model misspecification. We present experiments validating our analysis.
Attomole (amol) myoglobin Raman detection from plasmonic nanostructures
Authors: G. Das, F. Mecarini, F. De Angelis, M. Prasciolu, C. Liberale, Maddalena Patrini, E. Di Fabrizio
Venue: Microelectronic Engineering (2008)

We have demonstrated the fabrication of nano-structures using electro-plating and electron beam lithography techniques to obtain a pattern of gold nanograin aggregate structures of diameter in the range between 80 and 100nm with interstitial gap of 10-30nm. The nanostructure based SERS substrate enables one to have better control and reproducibility on generation of plasmon polaritons. Using calculation, we have shown that Raman spectra are derived for the myoglobin concentration down up to attomole. These results are obtained using drop coating deposition Raman (DCDR) method in which solution of interest is microdeposited (2@mL) on SERS substrate.
General solution and learning method for binary classification with performance constraints
Authors: Abdenour Bounsiar, Pierre Beauseroy, Edith Grall-Maës
Venue: Pattern Recognition Letters (2008)

In this paper, the problem of binary classification is studied with one or two performance constraints. When the constraints cannot be satisfied, the initial problem has no solution and an alternative problem is solved by introducing a rejection option. The optimal solution for such problems in the framework of statistical hypothesis testing is shown to be based on likelihood ratio with one or two thresholds depending on whether it is necessary to introduce a rejection option or not. These problems are then addressed when classes are only defined by labelled samples. To illustrate the resolution of cases with and without rejection option, the problem of Neyman-Pearson and the one of minimizing reject probability subject to a constraint on error probability are studied. Solutions based on SVMs and on a kernel based classifier are experimentally compared and discussed.
Establishing a Bayesian predictive survival model adjusting for random effects
Authors: Alfred A. Bartolucci, Sejong Bae, Karan P. Singh
Venue: Mathematics and Computers in Simulation (2008)

Myelodysplastic syndrome (MDS), sometimes referred to as pre-leukemia or smoldering leukemia, is a group of diseases usually characterized by failure of the bone marrow to produce enough normal blood cells. In about one-third of patients, the disease transforms into acute leukemia. In high-risk MDS, the bone marrow contains too many immature blood cells known as blasts. Patients with high-risk MDS survive for an average of 6-12 months. We have taken data from a large clinical trial and re-examined it considering the pre-leukemia as a random event in a Weibull distribution model. The issue becomes that of examining the affect of the variable on the predictive survival. We have taken the intercept, stress effect and shape parameter of the distribution to be random effects as well with realistic prior distributions based on previous shapes of the survival experience of subjects with this disease. We demonstrate how the model performs under relevant clinical conditions. The conditions are all tested using a Bayesian statistical approach allowing for the robust testing of the model parameters under various stress conditions which we introduce into the model. The convergence of the parameters to stable values are seen in trace plots which follow the convergence patterns This allows for precise estimation for determining clinical conditions under which the survival pattern will change. We give a numerical example of our results. The major platform for the theoretical development follows the Bayesian methodology and the multiple parameter Weibull model with random effects having carefully chosen hyper parameters. We have implemented the basic infrastructure for the analysis using the commercially available WinBugs software employing the Markov Chain Monte Carlo (MCMC) methodology.