ppxscal/embedding_network huggingface dataset:
The impact of instructor initiative on student learning: a tutoring study
Authors: Kristy Elizabeth Boyer, Robert Phillips, Michael D. Wallis, Mladen A. Vouk, James C. Lester
Venue: ACM SIGCSE Bulletin (2009)

In the quest to find instructional approaches that benefit student learning, engagement, and retention, evidence suggests providing students with hands-on practice is a worthwhile use of class time. This paper presents results from an exploratory study of two different instructional approaches that were encountered in a study of experienced human tutors working with novice computing students engaged in a programming exercise. No difference in average learning gains was found between a moderate approach, in which students were given control of problem solving nearly half the time, and a proactive approach in which the tutor took initiative nearly three-fourths of the time. Implications of this finding for fine-grained instructional strategy, as well as for broader classroom management decisions, are discussed. This paper also makes the case for the value of one-on-one tutoring studies as an exploratory research methodology for the comparative evaluation of computer science teaching strategies.
A reversible data hiding scheme based on dual steganographic images
Authors: Chin-Feng Lee, Kuo-Hui Wang, Chin-Chen Chang, Yu-Lin Huang
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

This paper proposes a novel data hiding scheme for grayscale images with high embedding capacity and low image distortion, able to provide the desired security and full reversibility. The embedding capacity of proposed scheme is about 0.75 bpp providing high visual steganographic image quality. The experimental PSNR values are very high (up to 52.3 dB); therefore, the steganographic image is not only perceptually indistinguishable from the carrier but can also resist the increasingly sophisticated steganalytic techniques. Moreover, without two steganographic images obtained simultaneously, it is impossible for attackers to retrieve the complete secret message.
Complexity of Bezout&#x2019;s Theorem VI: Geodesics in the Condition (Number) Metric
Authors: Michael Shub
Venue: Foundations of Computational Mathematics (2009)

We introduce a new complexity measure of a path of (problems, solutions) pairs in terms of the length of the path in the condition metric which we define in the article. The measure gives an upper bound for the number of Newton steps sufficient to approximate the path discretely starting from one end and thus produce an approximate zero for the endpoint. This motivates the study of short paths or geodesics in the condition metric.
A low-overhead fault tolerance scheme for TSV-based 3D network on chip links
Authors: Igor Loi, Subhasish Mitra, Thomas H. Lee, Shinobu Fujita, Luca Benini
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Three-dimensional die stacking integration provides the ability to stack multiple layers of processed silicon with a large number of vertical interconnects. Through Silicon Vias (TSVs) provide a promising area- and power-efficient way to support communication between different stack layers. Unfortunately, low TSV yield significantly impacts design of three-dimensional die stacks with a large number of TSVs. This paper presents a defecttolerance technique for TSVs-based multi-bit links through an efficient and effective use of redundancy. This technique is ideally suited for three-dimensional network-on-chip (NoC) links. Simulation results demonstrate significant yield improvement, from 66% to 98%, with a low area cost (17% on a vertical link in a NoC switch, which leads a modest 2.1% increase the total switch area) in 130nm technology, with minimal impact of VLSI design and test flows.
A Study on CMOS Time Uncertainty with Technology Scaling
Authors: Monica Figueiredo, Rui L. Aguiar
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

This paper evaluates the clock generation quality of different digital circuits associated with clock generation and distribution. Circuit's noise response, jitter, and uncertainty are evaluated for different noise sources and loading conditions. We present performance simulations for inverters and inverter chains implemented in different technologies from AMS and UMC foundries. We show that the device size-scaling trend is increasing the uncertainty associated with this circuits, decreasing their precision. The correlation between circuit's parameters and selected performance metrics is also highlighted.
A numerical method for fully resolved simulation (FRS) of rigid particle-flow interactions in complex flows
Authors: Sourabh V. Apte, Mathieu Martin, Neelesh A. Patankar
Venue: Journal of Computational Physics (2009)

A fictitious-domain based formulation for fully resolved simulations of arbitrary shaped, freely moving rigid particles in unsteady flows is presented. The entire fluid-particle domain is assumed to be an incompressible, but variable density, fluid. The numerical method is based on a finite-volume approach on a co-located, Cartesian grid together with a fractional step method for variable density, low-Mach number flows. The flow inside the fluid region is constrained to be divergence-free for an incompressible fluid, whereas the flow inside the particle domain is constrained to undergo rigid body motion. In this approach, the rigid body motion constraint is imposed by avoiding the explicit calculation of distributed Lagrange multipliers and is based upon the formulation developed by Patankar [N. Patankar, A formulation for fast computations of rigid particulate flows, Center for Turbulence Research Annual Research Briefs 2001 (2001) 185-196]. The rigidity constraint is imposed and the rigid body motion (translation and rotational velocity fields) is obtained directly in the context of a two-stage fractional step scheme. The numerical approach is applied to both imposed particle motion and fluid-particle interaction problems involving freely moving particles. Grid and time-step convergence studies are performed to evaluate the accuracy of the approach. Finally, simulation of rigid particles in a decaying isotropic turbulent flow is performed to study the feasibility of simulations of particle-laden turbulent flows.
Learning-Based Image Restoration for Compressed Image through Neighboring Embedding
Authors: Lin Ma, Feng Wu, Debin Zhao, Wen Gao, Siwei Ma
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

In this paper, we propose a novel learning-based image restoration scheme for compressed images by suppressing compression artifacts and recovering high frequency components with the priors learned from a training set of natural images. Specifically, Deblocking is performed to alleviate the blocking artifacts. Moreover, consistency of the primitives is enhanced by estimating the high frequency components, which are simply truncated during quantization. Furthermore, with the assumption that small image patches in the enhanced and real high frequency images form manifolds with similar local geometry in the corresponding image feature spaces, a neighboring embedding-based mapping strategy is utilized to reconstruct the target high frequency components. And experimental results have demonstrated that the proposed scheme can reproduce higher-quality images in terms of visual quality and PSNR, especially the regions relating to the contours.
Advances in Ultralightweight Cryptography for Low-Cost RFID Tags: Gossamer Protocol
Authors: Pedro Peris-Lopez, Julio Cesar Hernandez-Castro, Juan M. Tapiador, Arturo Ribagorda
Venue: Information Security Applications: 9th International Workshop, WISA 2008, Jeju Island, Korea, September 23-25, 2008, Revised Selected Papers (2009)

The design of ultralightweight authentication protocols that conform to low-cost tag requirements is imperative. This paper analyses the most important proposals (except for those based in hard problems such as the HB [1-3] family) in the area [4-6] and identifies the common weaknesses that have left all of them open to various attacks [7-11]. Finally, we present Gossamer, a new protocol inspired by the recently published SASI scheme [13], that was lately also the subject of a disclosure attack by Hernandez-Castro et al.[14]. Specifically, this new protocol is designed to avoid the problems of the past, and we examine in some deep its security and performance.
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Authors: Seunghwa Kang, David A. Bader
Venue: ACM SIGPLAN Notices (2009)

Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising as a new paradigm to pursue. However, to fully exploit all the cores in a chip, parallel programming is often required, and the complexity of parallel programming raises a significant concern. Data synchronization is a major source of this programming complexity, and Transactional Memory is proposed to reduce the difficulty caused by data synchronization requirements, while providing high scalability and low performance overhead. The previous literature on Transactional Memory mostly focuses on architectural designs. Its impact on algorithms and applications has not yet been studied thoroughly. In this paper, we investigate Transactional Memory from the algorithm designer's perspective. This paper presents an algorithmic model to assist in the design of efficient Transactional Memory algorithms and a novel Transactional Memory algorithm for computing a minimum spanning forest of sparse graphs. We emphasize multiple Transactional Memory related design issues in presenting our algorithm. We also provide experimental results on an existing software Transactional Memory system. Our algorithm demonstrates excellent scalability in the experiments, but at the same time, the experimental results reveal the clear limitation of software Transactional Memory due to its high performance overhead. Based on our experience, we highlight the necessity of efficient hardware support for Transactional Memory to realize the potential of the technology.
How to Describe Workflow Information Systems to Support Business Process
Authors: Josefina Guerrero García, Jean Vanderdonckt, Christophe Lemaige, Juan M. González Calleros
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

This paper addresses a methodology for developing the various user interfaces (UI) of a workflow information system (WIS), which are advocated to automate business processes, following a model-centric approach based on the requirements and processes of the organization. The methodology applies to: 1) integrate human and machines based activities, in particular those involving interaction with IT applications and tools, 2) to identify how tasks are structured, who per-form them, what their relative order is, how they are offered or assigned, and how tasks are being tracked. For this purpose, workflow is recursively decomposed into processes which are in turn decomposed into tasks. Each task gives rise to a task model whose struc-ture, ordering, and connection with the domain model allows the automated generation of corresponding UIs in a transformational approach.
New approaches for inference of unobservable queues
Authors: Yun Bae Kim, Jinsoo Park
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Many inference methods of queueing systems have been developed on the basis of Larson's QIE(queue inference engine) with the assumption of homogeneous Poisson arrivals. It inferred the queueing systems with starting and ending times of service. However, the arrival processes are becoming complex lately, so there are some limits to apply the method. Our study introduces new methods of queue inference which can find the internal behaviors of queueing systems with only external observations, arrival and departure time. This study deals with general GI/G/c queueing systems. (a) FCFC (first come first served) (b) LCFS (last come first served) (c) RSS (random selection for service) The accurate inferences were obtained from FCFS and LCFS systems, and the approximate solutions from RSS systems.
Mass Property Estimation for Mated Flight Control
Authors: Yang Zhao, Dawei Zhang, Hao Tian, Na Li
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Mass property of space vehicle changes apparently during and after mating and cannot be predicted or measured at times, yet it needs to be accurately known for mated flight control or attitude control and momentum management. A discrete Kalman Filter (KF) based estimation method is developed, measurements of single point acceleration, angular velocity and angular acceleration are employed to extract the inertia matrix and mass center. Simulation results show that the method can be used for continues online estimation without propellant consumption.
Ruby On Rails Bible
Authors: Timothy Fisher
Venue:  (2008)

Allowing users to quickly and easily build powerful Web applications, Ruby on Rails (RoR) continues to grow in popularity among developers thanks to its ease of use and speed Examines how RoR uses less code for application development by avoiding redundancy and encouraging increased performance that boasts less development time Includes in-depth coverage of the RoR framework, and follows the development of a complete RoR Web application that uses various features of RoR that are taught earlier in the book Addresses the latest trends such as Agile development, Web Services, Web 2.0, and Ajax from an RoR perspective
Policy-driven middleware for self-adaptation of web services compositions
Authors: Abdelkarim Erradi, Piyush Maheshwari, Vladimir Tosic
Venue: Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware (2006)

We present our policy-based middleware, called Manageable and Adaptive Service Compositions (MASC), for dynamic self-adaptation of Web services compositions to various changes. MASC integrates and extends our earlier middleware called the Web Services Message Bus (wsBus). In particular, we discuss MASC support for customization of Web services compositions to address business exceptions and wsBus support for correction (fault management) of Web services compositions to improve reliability. We have evaluated the former support on a stock trading case study and the latter support on a supply chain management case study. Our solutions are complementary to the existing approaches and provide: coordination of fault management between SOAP messaging and business process orchestration, greater diversity of monitoring and control constructs, specification of both technical and business aspects used for adaptation decisions, higher level of abstraction easier for use by non-technical people, and externalization of monitoring and adaptation actions from definitions of business processes.
TopLog: ILP Using a Logic Program Declarative Bias
Authors: Stephen H. Muggleton, José Carlos Santos, Alireza Tamaddoni-Nezhad
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

This paper introduces a new Inductive Logic Programming (ILP) framework called Top Directed Hypothesis Derivation (TDHD). In this framework each hypothesised clause must be derivable from a given logic program called top theory (⊤). The top theory can be viewed as a declarative bias which defines the hypothesis space. This replaces the metalogical mode statements which are used in many ILP systems. Firstly we present a theoretical framework for TDHD and show that standard SLD derivation can be used to efficiently derive hypotheses from ⊤. Secondly, we present a prototype implementation of TDHD within a new ILP system called TopLog. Thirdly, we show that the accuracy and efficiency of TopLog, on several benchmark datasets, is competitive with a state of the art ILP system like Aleph.
Comments on 'A 70 MHz Multiplierless FIR Hilbert Transformer in 0.35 μm Standard CMOS Library'
Authors: Oscar Gustafsson
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this comment we point out that the mapping from carry-propagation adders to carry-save adders in the context of shift-and-add multiplication is inconsistent. Based on this it is shown that the implementation in Ref. [1] does not achieve any complexity reduction in practice.
Integrated multistage logistics network design by using hybrid evolutionary algorithm
Authors: Lin Lin, Mitsuo Gen, Xiaoguang Wang
Venue: Computers and Industrial Engineering (2009)

Design and optimization of logistics is very important issue, which plans, implements and controls the efficient, effective forward and reverse flow and storage of goods, services and related information between the point of origin and the point of consumption in order to meet customers' requirements. In this paper, we formulate an integrated multistage logistics network model with considering the direct shipment and direct delivery of logistics and inventory. In addition, we propose an effective hybrid evolutionary algorithm (hEA) to solve this problem: (1) we employ an extended priority-based encoding method, (2) combine a local search (LS) technique and (3) proposed a new fuzzy logic control (FLC) to enhance the search ability of EA. Finally, numerical analysis of case study is carried out to show the effectiveness of the proposed approach.
Multiplicative synopses for relative-error metrics
Authors: Panagiotis Karras
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Existing hierarchical summarization techniques fail to provide synopses good in terms of relative-error metrics. This paper introduces multiplicative synopses: a summarization paradigm tailored for effective relative-error summarization. This paradigm is inspired from previous hierarchical index-based summarization schemes, but goes beyond them by altering their underlying data representation mechanism. Existing schemes have decomposed the summarized data based on sums and differences of values, resulting in what we call additive synopses. We argue that the incapacity of these models to handle relative-error metrics stems exactly from this additive nature of their representation mechanism. We substitute this additive nature by a multiplicative one. We argue that this is more appropriate for achieving low-relative-error data approximations. We develop an efficient linear-time dynamic programming scheme for one-dimensional multiplicative synopsis construction under general relative-error-based metrics, and a special scheme for the case of maximum relative error. We generalize our schemes to higher data dimensionality and we show a surprising additional benefit gained by our special scheme for maximum relative error in this case. In our experimental study, we verify the higher efficacy of our model on relative-error-oriented summarization problems.
LinkedIn For Dummies
Authors: Joel Elad
Venue: For Dummies (2008)

Once you're LinkedIn, you're part of the largest online network of professionals in the world! When you know how to make the most of your profile, manage your contacts, and handle invitations effectively, you'll go far. This book is packed with advice that will help you market yourself and find a job, an employee, an investor, or more business for your business!
The Palantir Grid Meta-Information System
Authors: F. Guim, I. Rodero, M. Tomas, J. Corbalan, J. Labarta
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

Grids allow large scale resource-sharing across different administrative domains. Those diverse resources are likely to join or quit the Grid at any moment or possibly to break down. Grid monitoring tools have to adapt supporting access information to these heterogeneous and not reliable environments. There is a wide rage of types of resources to be monitored, with different nature, characteristics and so on. For instance Grid users want to monitor from which is the state of the jobs that submit till how many processors has a given resources of a given centre. These issues make the task of monitoring complex to treat, and it is difficult to provide a generals ways for accessing to all this information. In this work we propose a set of functionalities that a Grid Information System should provide. We describe the Palantir meta-information system that has been designed for uniform the access to different monitoring and information systems and that implements all the discussed functionalities. This meta-information system tries to abstract the resource information that underlies on the local systems, and homogenize the access to all this. We present the architecture of Palantir and its main characteristics
A multiline model for time-efficient estimation of crosstalk
Authors: Selahattin Sayıl, Uday K. Borra
Venue: Analog Integrated Circuits and Signal Processing (2009)

This work proposes a novel and accurate crosstalk noise estimation method in the presence of multiple RC lines for use in design automation tools. Using the realistic exponential waveform and a reduced transfer function, the proposed model presents a complete multiline noise model by representing active and passive aggressors simultaneously on the victim line. In the model, active aggressors are easily represented by current sources and passive aggressors are accurately modeled as equivalent capacitances to victim. Each current source representing an active aggressor carries the same accuracy as the 2-&pi; representation. Equivalent capacitances for passive aggressors, on the other hand, consider resistive shielding effect and the realistic exponential aggressor waveform. This approach allows one to obtain a general noise model that considers the effect of many active and passive aggressors and general formulas derived can easily be applied to real cases. Noise peak and width expressions are derived and results are in good agreement with HSPICE results. Results show that average error for noise peak is 4.3% and for the width is 6.9% while allowing for very fast analysis.