ppxscal/embedding_network huggingface dataset:
The development of a cognitive tool for teaching and learning fractions in the mathematics classroom: A design-based study
Authors: Siu Cheung Kong
Venue: Computers Education (2008)

Two cycles of design-based research of a cognitive tool (CT) for teaching fractions have been completed. Following the success of a quasi-experimental study of the enhanced CT derived from the second cycle of design-based research, this article reports the findings of a pre-test-post-test control group empirical study using the enhanced CT in the classroom. The results indicate that there were no statistically significant differences in learning outcomes between the exploratory learning approach, using the CT, and the traditional direct teaching approach. The CT enabled students to generate a procedural knowledge of adding and subtracting fractions with like and unlike denominators through an exploratory learning process. Teachers asserted that the CT was effective for stimulating reciprocal tutoring among students, and students were enthusiastic about using the CT as an educational tool. Hence, the CT has potential for further development as a tool for promoting collaborative learning in the classroom.
Timing-aware power-optimal ordering of signals
Authors: Konstantin Moiseev, Avinoam Kolodny, Shmuel Wimer
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2008)

A computationally efficient technique for reducing interconnect active power in VLSI systems is presented. Power reduction is accomplished by simultaneous wire spacing and net ordering, such that cross-capacitances between wires are optimally shared. The existence of a unique power-optimal wire order within a bundle is proven, and a method to construct this order is derived. The optimal order of wires depends only on the activity factors of the underlying signals; hence, it can be performed prior to spacing optimization. By using this order of wires, optimality of the combined solution is guaranteed (as compared with any other ordering and spacing of the wires). Timing-aware power optimization is enabled by simultaneously considering timing criticality weights and activity factors for the signals. The proposed algorithm has been applied to various interconnect layouts, including wire bundles from high-end microprocessor circuits in 65 nm technology. Interconnect power reduction of 17&percnt; on average has been observed in such bundles.
Computer simulation of uterine contraction dynamics
Authors: Kemal Aydin, Tansel Halic, Coskun Bayrak, Kamran Iqbal
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

The aim of this study is to simulate the contraction phenomena in pregnant uterine. Differential equations are used to model the uterine contractions for three states, namely contracting, refractory, and resting. Since verification and validation are vital for simulation systems, we compared our model with uterine magnetomyogram (MMG) data which are recorded non-invasively using SQUID-Array for Reproductive Assessment (SARA) system at University of Arkansas for Medical Sciences (UAMS). It is possible to identify the contraction locations from the data via Hilbert-Huang Transform (HHT). Two simulations were done; first one was based on the mathematical model and the second one was based on the contraction data. Comparison between those simulations revealed similar characteristics.
Cyber Physical Systems: Design Challenges
Authors: Edward A. Lee
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

Cyber-Physical Systems (CPS) are integrations of computation and physical processes. Embedded computers and networks monitor and control the physical processes, usually with feedback loops where physical processes affect computations and vice versa. The economic and societal potential of such systems is vastly greater than what has been realized, and major investments are being made worldwide to develop the technology. There are considerable challenges, particularly because the physical components of such systems introduce safety and reliability requirements qualitatively different from those in general-purpose computing. Moreover, physical components are qualitatively different from object-oriented software components. Standard abstractions based on method calls and threads do not work. This paper examines the challenges in designing such systems, and in particular raises the question of whether today’s computing and networking technologies provide an adequate foundation for CPS. It concludes that it will not be sufficient to improve design processes, raise the level of abstraction, or verify (formally or otherwise) designs that are built on today’s abstractions. To realize the full potential of CPS, we will have to rebuild computing and networking abstractions. These abstractions will have to embrace physical dynamics and computation in a unified way.
A Tutorial on Conformal Prediction
Authors: Glenn Shafer, Vladimir Vovk
Venue: The Journal of Machine Learning Research (2008)

Conformal prediction uses past experience to determine precise levels of confidence in new predictions. Given an error probability ε, together with a method that makes a prediction ŷ of a label y, it produces a set of labels, typically containing ŷ, that also contains y with probability 1  ε. Conformal prediction can be applied to any method for producing ŷ: a nearest-neighbor method, a support-vector machine, ridge regression, etc. Conformal prediction is designed for an on-line setting in which labels are predicted successively, each one being revealed before the next is predicted. The most novel and valuable feature of conformal prediction is that if the successive examples are sampled independently from the same distribution, then the successive predictions will be right 1  ε of the time, even though they are based on an accumulating data set rather than on independent data sets. In addition to the model under which successive examples are sampled independently, other on-line compression models can also use conformal prediction. The widely used Gaussian linear model is one of these. This tutorial presents a self-contained account of the theory of conformal prediction and works through several numerical examples. A more comprehensive treatment of the topic is provided in Algorithmic Learning in a Random World, by Vladimir Vovk, Alex Gammerman, and Glenn Shafer (Springer, 2005).
An improved physico-chemical model of hybridization on high-density oligonucleotide microarrays
Authors: Naoaki Ono, Shingo Suzuki, Chikara Furusawa, Tomoharu Agata, Akiko Kashiwagi, Hiroshi Shimizu, Tetsuya Yomo
Venue: Bioinformatics (2008)

Motivation: High-density DNA microarrays provide useful tools to analyze gene expression comprehensively. However, it is still difficult to obtain accurate expression levels from the observed microarray data because the signal intensity is affected by complicated factors involving probe–target hybridization, such as non-linear behavior of hybridization, non-specific hybridization, and folding of probe and target oligonucleotides. Various methods for microarray data analysis have been proposed to address this problem. In our previous report, we presented a benchmark analysis of probe–target hybridization using artificially synthesized oligonucleotides as targets, in which the effect of non-specific hybridization was negligible. The results showed that the preceding models explained the behavior of probe–target hybridization only within a narrow range of target concentrations. More accurate models are required for quantitative expression analysis. Results: The experiments showed that finiteness of both probe and target molecules should be considered to explain the hybridization behavior. In this article, we present an extension of the Langmuir model that reproduces the experimental results consistently. In this model, we introduced the effects of secondary structure formation, and dissociation of the probe–target duplex during washing after hybridization. The results will provide useful methods for the understanding and analysis of microarray experiments. Availability: The method was implemented for the R software and can be downloaded from our website ( http://www-shimizu.ist.osaka-u.ac.jp/shimizu_lab/FHarray/). Contact: furusawa@ist.osaka-u.ac.jp Supplementary information: Supplementary data are available at Bioinformatics online.
The approximability of MAX CSP with fixed-value constraints
Authors: Vladimir Deineko, Peter Jonsson, Mikael Klasson, Andrei Krokhin
Venue: Journal of the ACM (JACM) (2008)

In the maximum constraint satisfaction problem (MAX CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to assign values from a given finite domain to the variables so as to maximize the number (or the total weight, for the weighted case) of satisfied constraints. This problem is NP-hard in general, and, therefore, it is natural to study how restricting the allowed types of constraints affects the approximability of the problem. In this article, we show that any MAX CSP problem with a finite set of allowed constraint types, which includes all fixed-value constraints (i.e., constraints of the form x &equals; a), is either solvable exactly in polynomial time or else is APX-complete, even if the number of occurrences of variables in instances is bounded. Moreover, we present a simple description of all polynomial-time solvable cases of our problem. This description relies on the well-known algebraic combinatorial property of supermodularity.
Comparing farmer-based and satellite-derived deforestation estimates in the Amazon basin using a hybrid classifier
Authors: R. H. Wynne, K. A. Joseph, J. O. Browder, P. M. Summers
Venue: International Journal of Remote Sensing (2007)

The Amazon basin remains a major hotspot of tropical deforestation, presenting a clear need for timely, accurate and consistent data on forest cover change. We assessed the utility of a hybrid classification technique, iterative guided spectral class rejection (IGSCR), for accurately mapping Amazonian deforestation using annual imagery from the Landsat Thematic Mapper (TM) and Enhanced Thematic Mapper Plus (ETM+) from 1992 to 2002. The mean overall accuracy of the 11 annual classifications was 95% with a standard deviation of 1.4%, and z-score analysis revealed that all classifications were significant at the 0.05 level. The IGSCR thus seems inherently suitable for monitoring forest cover in the Amazon. The resulting classifications were sufficiently accurate to assess preliminarily the magnitude and causes of discrepancies between farmer-reported and satellite-based estimates of deforestation at the household level using a sample of 220 farms in Rôndonia mapped in the field in 1992 and 2002. The field-and satellite-derived estimates were significantly different only at the 0.10 level for the 220 farms studied, with the satellite-derived deforestation estimates 8.9% higher than estimates derived from in situ survey methods. Some of this difference was due to a tendency of farmers to overestimate the amount of forest within their property in our survey. Given the objectivity and reduced expense of satellite-based deforestation monitoring, we recommend that it be an integral part of household-level analysis of the causes, patterns and processes of deforestation.
Proposal for Efficient Searching and Presentation in Digital Forensics
Authors: Jooyoung Lee
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Digital forensics is a scientific, logical technique and procedure to collect, keep, and analyze digital data and to report the evidence discovered from them. And purposely, we can define it as an investigative technique to examine any kind of behavior using a computer and to prove the fact relation of it based on the data stored in the computer. Therefore, for digital forensics, it is required to obtain an image copy of original digital data without damage and to prove that the computer evidence existed in the specific time. After the evidence is analyzed, it needs to do with documentation in order to adopt it as legally effective evidence in the law court. As to the digital forensic, it is one of the important requisites of the search tool to present all matched results from the given query keyword. However, because existing forensic search tools just present the results without a kind of grouping or inappropriate filtering, a criminal investigator has to spend a lot of time in order to find documents related to the investigation among the searched results. In this paper, to solve this kind of problem, we propose a method that we find all desired results in a search procedure and thereafter evaluate and rank the results according to their fitness. As a result, meaningful information in investigative perspective is to be presented in the front part of the search result list and it is expected to minimize the time for the criminal investigator to perform filtering unnecessary data and it can contribute to improve the task efficiency.
Activity maxima in random networks in the heavy tail case
Authors: A. V. Lebedev
Venue: Problems of Information Transmission (2008)

We consider a model of information network described by an undirected random graph, where each node has a random information activity whose distribution possesses a heavy tail (with regular variation). We investigate the cases of networks described by classical and power-law random graphs. We derive sufficient conditions under which the maximum of aggregate activities (over a node and its nearest neighbors) asymptotically grows in the same way as the maximium of individual activities and the Fréchet limit law holds for them.
Parametric Modeling Using Inventor: Inventor 11 with CDROM
Authors: James P. LoFaso
Venue:  (2007)

For Autodesk Inventor 11. Includes Student CD.
Advantage Database Server: A Developer's Guide
Authors: Cary Jensen, Loy Anderson
Venue:  (2007)

Advantage Database Server: A Developer's Guide Cary Jensen, Ph.D. Loy Anderson, Ph.D. This comprehensive developer's guide to Advantage Database Server shows you how to build high-performance, low maintenance databases using the Advantage Database Server. Learn how to access large amounts of data in a multiuser environment with unbelievable speed. Discover how Advantage gives you unparalleled reliability and data integrity with little or no database administration. Leverage advanced features such as triggers, stored procedures, full-text search, user defined functions, replication, online backup, and more. Technically reviewed by the Advantage R&D team, this valuable resource will help you build and deploy reliable, scalable, relational database applications. Explore the new features added to Advantage in versions 8.0 and 8.1. Learn how to exploit Advantage's support for both set-based SQL and index-based navigation, a combination not supported by other high-performance, relational database servers. Enjoy nearly maintenance-free administration using self-tuning features. Get high-performance and advanced database features without the complexity. Support Windows NT/2000/2003/Vista, Linux, and NetWare operating systems. Use virtually any development environment including C# for .NET, C#Builder, Visual C++, C++Builder, Delphi, Delphi for .NET, Java, JBuilder, Kylix, PHP, Perl, Visual Objects, Visual Basic, and Visual Basic.NET, among others. Download a two-user developer version of ADS and Advantage clients-plus tools, utilities, and code samples.
Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs
Authors: Lewis Ntaimo, Matthew W. Tanner
Venue: Journal of Global Optimization (2008)

Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult to solve. This paper presents a first computational study of a disjunctive cutting plane method for stochastic mixed 0-1 programs that uses lift-and-project cuts based on the extensive form of the two-stage SMIP problem. An extension of the method based on where the data uncertainty appears in the problem is made, and it is shown how a valid inequality derived for one scenario can be made valid for other scenarios, potentially reducing solution time. Computational results amply demonstrate the effectiveness of disjunctive cuts in solving several large-scale problem instances from the literature. The results are compared to the computational results of disjunctive cuts based on the subproblem space of the formulation and it is shown that the two methods are equivalently effective on the test instances.
Performance of numerically computed quadrature points
Authors: Beth A. Wingate, Mark A. Taylor
Venue: Applied Numerical Mathematics (2008)

In this work we focus on the diagonal-mass-matrix spectral element method (DMM) in non-tensor product domains such as triangles and tetrahedra. For many problems, the DMM method is more efficient than methods which require the inversion of a wide bandwidth mass matrix. For elements which are tensor product domains, the method is formulated using a nodal basis derived from Gauss-Lobatto points which simultaneously provide well-conditioned interpolants and high quality quadrature. In non-tensor product domains such as triangles and tetrahedra such points are not known analytically. DMM therefore relies on numerically computed interpolation and quadrature points. Here we compare three point sets for use in DMM methods on triangles: Fekete points and two new point sets that have improved quadrature properties but less optimal interpolation properties. We show convergence results for the linear advection and Poisson problems, and the growth of the eigenspectrum for the first and second derivative operators. We conclude that these points sets, when used for DMM on triangles, suffer from numerical stability problems which can be overcome by employing common filtering techniques such as the erfc-log filter [J.P. Boyd, The erfc-log filter and the asymptotics of the Euler and Vandeven sequence accelerations, in: Proc. of 3rd Int. Conf. on Spectral and High Order Methods, 1996, pp. 267-276]. We show the growth of the maximum eigenvalues for both the first and second derivative operator is no worse than for that of tensor product domains. We also show that for the solution of the Poisson equation in weak form, the new points, which have improved quadrature properties, are superior to Fekete points.
Scheduling despite inexact job-size information
Authors: Adam Wierman, Misja Nuyens
Venue: Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2008)

Motivated by the optimality of Shortest Remaining Processing Time (SRPT) for mean response time, in recent years many computer systems have used the heuristic of "favoring small jobs" in order to dramatically reduce user response times. However, rarely do computer systems have knowledge of exact remaining sizes. In this paper, we introduce the class of ε-SMART policies, which formalizes the heuristic of "favoring small jobs" in a way that includes a wide range of policies that schedule using inexact job-size information. Examples of ε-SMART policies include (i) policies that use exact size information, e.g., SRPT and PSJF, (ii) policies that use job-size estimates, and (iii) policies that use a finite number of size-based priority levels. For many ε-SMART policies, e.g., SRPT with inexact job-size information, there are no analytic results available in the literature. In this work, we prove four main results: we derive upper and lower bounds on the mean response time, the mean slowdown, the response-time tail, and the conditional response time of ε-SMART policies. In each case, the results explicitly characterize the tradeoff between the accuracy of the job-size information used to prioritize and the performance of the resulting policy. Thus, the results provide designers insight into how accurate job-size information must be in order to achieve desired performance guarantees.
Revolutionary image compression and reconstruction via evolutionary computation, part 2: multiresolution analysis transforms
Authors: Frank Moore, Brendan Babb
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

Previous research demonstrated that a genetic algorithm (GA) can utilize supercomputers to evolve image compression and reconstruction transforms that reduce mean squared error (MSE) by more than 22% (1.126 dB) under conditions subject to quantization, while continuing to average the same amount of compression as the Daubechies-4 (D4) wavelet. This paper describes subsequent research that extends our GA to evolve multiresolution analysis (MRA) transforms. Test results indicate that our evolved MRA transforms can reduce MSE by an average of more than 10% (0.50 dB) at three levels of decomposition. This result substantially improves upon state-of-the-art MRA transforms for compression and reconstruction applications subject to quantization error.
Current gain improvement at high collector current densities for SiGe heterostructure transistors
Authors: Gagan Khanduri, Brishbhan Panwar
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

An NPN Si/SiGe/SiGe Graded Heterojunction Bipolar Transistor (SiGe GHBT) has been compared with contemporary NPN Si/SiGe/Si Double Heterojunction Bipolar Transistor (SiGe DHBT) for current gain performance at high collector current densities, using a 2-dimensional MEDICI device simulator. The analysis predicts that the base-collector homojunction of the SiGe GHBT structure is responsible for improved current gain at high collector current density in comparison with the conventional SiGe DHBT and provides the option of operation at higher collector current densities.
SH-X: An embedded processor core for consumer appliances
Authors: F. Arakawa, M. Ishikawa, Y. Kondo, T. Kamei, O. Nishii, T. Hattori
Venue: Journal of Embedded Computing (2006)

A SuperH&trade; embedded processor core SH-X implemented in a 130-nm CMOS process running at 400~MHz achieved 720 MIPS and 2.8 GFLOPS at a power of 250 mW under worst-case conditions. It has a dual-issue seven-stage pipeline architecture, but reaches the 1.8 MIPS/MHz of the previous five-stage processor. The on-chip memory configuration is tuned for digital consumer appliances. A new resume-standby mode enables a standby current of less than 100 &mu;A and a 3-ms recovery time. The processor meets the requirements of a wide range of applications, and is suitable for digital appliances aimed at the consumer market, such as cellular phones, digital still/video cameras, and car navigation systems.
Parallel Fixed-Alternative-Routing Based Provisioning Framework for Distributed Controlled Survivable WDM Mesh Networks
Authors: Emad M. Al Sukhni, Hussein T. Mouftah
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

This paper presents a novel parallel framework for online provisioning in distributed controlled survivable wavelength-division multiplexed (WDM) mesh networks. Efficient use of fixed alternative routing to select the connection’s working and protection paths as well as the wavelength(s) at the same time by probing k-link-disjoint shortest paths in parallel. The probing technique used in this framework is the first probing technique that probes each path as a candidate working path and a candidate shared protection path at the same time. Intelligent adaptive destination routing with backward reservation, and distributed local information signaling algorithm for connection management are also combined in our proposed framework. The significant contribution of this framework in terms of connection request blocking probability and connection setup time are discussed. We show through setup time analysis and simulation experiments the effectiveness of the proposed framework.