ppxscal/embedding_network huggingface dataset:
Progress reports and novices' understanding of program code
Authors: Linda Mannila
Venue: Proceedings of the 6th Baltic Sea conference on Computing education research: Koli Calling 2006 (2006)

This paper introduces progress reports and describes how these can be used as a tool to evaluate student learning and understanding during programming courses. A progress report includes a short piece of program code (on paper), covering topics recently introduced in the course, and four questions. The two first questions are of a "trace and explain" type, asking the students to describe the functionality of the program using their own words - both line by line and as a whole. The two other questions aim at gaining insight into the students' own opinions of their learning, as they are asked to write down what they think they have learned so far in the course and what they have experienced as most difficult. Results from using progress reports in an introductory programming course at secondary level are presented. The responses to the "trace and explain" questions were categorized based on the level of overall understanding manifested. We also analyzed students' understanding of individual programming concepts, both based on their code explanations and on their own opinions on what they had experienced as difficult. Our initial experience from using the progress reports is positive, as we feel that they provide valuable information during the course, which most likely would remain uncovered otherwise.
Technical communique: The Lambert W function and the spectrum of some multidimensional time-delay systems
Authors: Elias Jarlebring, Tobias Damm
Venue: Automatica (Journal of IFAC) (2007)

In this note we find an explicit expression for the eigenvalues of a retarded time-delay system with one delay, for the special case that the system matrices are simultaneously triangularizable, which includes the case where they commute. Using matrix function definitions we define a matrix version of the Lambert W function, from which we form the expression. We prove by counter-example that some expressions in other publications on Lambert W for time-delay systems do not always hold.
Reduction of Graphical Model and Genetic Algorithm for Computing Approximate Nash Equilibrium in Static Games
Authors: Wei-Yi Liu, Jin Li, Kun Yue, Ning Song
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

In order to describe the relationship between strategies of various agents, the concepts of the influence degree and the strategy dependency are presented. Accordingly, an approach for reducing a graphical model is given, and the relationship between the discrete degree and the approximate degree is developed, and then the genetic-algorithm-based approach for computing approximate Nash equilibrium is given.
Resource Manager for Non-preemptive Heterogeneous Multiprocessor System-on-chip
Authors: A. Kumar, B. Mesman, B. Theelen, H. Corporaal
Venue: Proceedings of the 2006 IEEE/ACM/IFIP Workshop on Embedded Systems for Real Time Multimedia (2006)

Increasingly more MPSoC platforms are being developed to meet the rising demands from concurrently executing applications. These systems are often heterogeneous with the use of dedicated IP blocks and application domain specific processors. While there is a host of research done to provide good performance guarantees and to analyze applications for preemptive uniprocessor systems, the field of heterogeneous, non-preemptive MPSoCs is a mostly unexplored territory. In this paper, we propose to use a resource manager (RM) to improve the resource utilization of these systems. The basic functionalities of such a component are introduced. A high-level simulation model of such a system is developed to study the performance of RM, and a case study is performed for a system running an H.263 and a JPEG decoder. The case study illustrates at what control granularity a resource manager can effectively regulate the progress of applications such that they meet their performance requirements
Living in the Next-Generation Operating System
Authors: R. M. Baizer
Venue: IEEE Software (1987)

A new generaffon of operating system, based on extended databases, will supplant the original phase-sequencing and current pipelining program composition mechanisms. This article describes a working prototype.
Data mining of search engine logs
Authors: Martin Whittle, Barry Eaglestone, Nigel Ford, Valerie J. Gillet, Andrew Madden
Venue: Journal of the American Society for Information Science and Technology (2007)

This article reports on the development of a novel method for the analysis of Web logs. The method uses techniques that look for similarities between queries and identify sequences of &ldquo;query transformation&rdquo;. It allows sequences of query transformations to be represented as graphical networks, thereby giving a richer view of search behavior than is possible with the usual sequential descriptions. We also perform a basic analysis to study the correlations between observed transformation codes, with results that appear to show evidence of behavior habits. The method was developed using transaction logs from the Excite search engine to provide a tool for an ongoing research project that is endeavoring to develop a greater understanding of Web-based searching by the general public. &copy; 2007 Wiley Periodicals, Inc.
Microprocessor Design and Application
Authors: D. C. Collins
Venue: Computer (1975)

During the past year, as more and more microprocessors (as well as information about microprocessors) have become available, the competition for the market has become fierce. The potential user now has a choice of many CPU's varying widely in computing power and price. The price of the low-cost CPU's even in small volume is now below $10 and for the powerful microprocessors ranges from $50 to $100. As the price of the microprocessor decreases toward the $2 to $12 range, the cost of the microcomputer system resides predominantly in the memory and I/O circuitry. This means that additional processors can be added and computing power can be given to applications which might have been uneconomical in the past. This issue of Computer deals with some of the problems that must be dealt with in applying these incredibly low-cost computing elements. 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
A High Performance Exact Histogram Specification Algorithm
Authors: Alessandro Bevilacqua, Pietro Azzari
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

Real-time histogram specification methods aims to find a continuous function that transforms a source image to match a target distribution with the highest possible degree of accuracy. Many approaches privilege exact specifi- cation exploiting multi-valued ordering functions but incur in highly computational expensive implementations. Histogram specification algorithms can be classified according to computational complexity, image distortion and accuracy of reproduction of the target histogram. The method we propose permits an exact match of a given target histogram independently of the source image meanwhile introducing negligible image distortion. The simplicity of the method enables fast computation making the algorithm suitable for real time applications. Exhaustive experiments and accurate comparisons are carried out against the most representative approaches reported in literature.
Efficient evaluation of high-selective xml twig patterns with parent child edges in tree-unaware rdbms
Authors: Sourav S. Bhowmick, Erwin Leonardi, Hongmei Sun
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Recent study showed that native twig join algorithms and tree-aware relational framework significantly outperform tree-unaware approaches in evaluating structural relationships in XML twig queries. In this paper, we present an efficient strategy to evaluate high-selective twig queries containing only parent-child relationships in a tree-unaware relational environment. Our scheme is built on top of our S<scp>UCXENT</scp>++ system. We show that by exploiting the encoding scheme of S<scp>UCXENT</scp>++, we can devise efficient strategy for evaluating such twig queries. Extensive performance studies on various data sets and queries show that our approach performs better than a representative tree-unaware approach (G<scp>LOBAL</scp>-O<scp>RDER</scp>) and a state-of-the-art native twig join algorithm (TJF<scp>AST</scp>) on all benchmark queries with the highest observed gain factors being 243 and 95, respectively. Additionally, our approach reduces significantly the performance gap between tree-aware and tree-unaware approaches and even outperforms a tree-aware approach(M<scp>ONET</scp>DB/XQ<scp>UERY</scp>) for certain high-selective twig queries. We also report our insights to the plan choices a relational optimizer made during twig query evaluation by visually characterizing its behavior over the relational selectivity space.
Graph indexing: tree + delta <= graph
Authors: Peixiang Zhao, Jeffrey Xu Yu, Philip S. Yu
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Recent scientific and technological advances have witnessed an abundance of structural patterns modeled as graphs. As a result, it is of special interest to process graph containment queries effectively on large graph databases. Given a graph database G, and a query raph q, the graph containment query is to retrieve all graphs in G which contain q as subgraph(s). Due to the vast number of graphs in G and the nature of complexity for subgraph isomorphism testing, it is desirable to make use of high-quality graph indexing mechanisms to reduce the overall query processing cost. In this paper, we propose a new cost-effective graph indexing method based on frequent tree-features of the graph database. We analyze the effectiveness and efficiency of tree as indexing feature from three critical aspects: feature size, feature selection cost, and pruning power. In order to achieve better pruning ability than existing graph-based indexing methods, we select, in addition to frequent tree-features (Tree), a small number of discriminative graphs (&Delta;) on demand, without a costly graph mining process beforehand. Our study verifies that (Tree+&Delta;) is a better choice than graph for indexing purpose, denoted (Tree+&Delta; &ge;Graph), to address the graph containment query problem. It has two implications: (1) the index construction by (Tree+&Delta;) is efficient, and (2) the graph containment query processing by (Tree+&Delta;) is efficient. Our experimental studies demonstrate that (Tree+&Delta;) has a compact index structure, achieves an order of magnitude better performance in index construction, and most importantly, outperforms up-to-date graph-based indexing methods: gIndex and C-Tree, in graph containment query processing.
Inferring structural patterns for concern traceability in evolving software
Authors: Barthélémy Dagenais, Silvia Breu, Frédéric Weigand Warr, Martin P. Robillard
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

As part of the evolution of software systems, effort is often invested to discover in what parts of the source code a feature (or other concern) is implemented. Unfortunately, knowledge about a concern's implementation can become invalid as the system evolves. We propose to mitigate this problem by automatically inferring structural patterns among the elements identified as relevant to a concern's implementation. We then document the inferred patterns as rules that can be checked as the source code evolves. Checking whether structural patterns hold across different versions of a system enables the automatic identification of new elements related to a documented concern. We implemented our technique for JAVA in an Eclipse plug-in called ISIS and applied it to a number of concerns. With a case study spanning 34 versions of the development history of an open-source system, we show how our approach supports the tracking of a concern's implementation through modifications such as extensions and refactorings
Design and implementation of an optical link using blown-fibre cable
Authors: M. H. Reeve, S. A. Cassidy, S. Hornung, P. Yennadhiou
Venue: BT Technology Journal (2007)

The blown-fibre technique has been used to install a trial network between British Telecommunications buildings in the centre of Leeds. This paper describes the design of the components, the trial layout and the results achieved.
Constrained Single- and Multiple-Objective Optimization with Differential Evolution
Authors: Yongxiang Zhao, Shengwu Xiong, Meifang Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Most real-world optimization problems are single-or multiple-objective optimization problems with constraints. However, the most common approach adopted to deal with constrained search spaces is the use of penalty functions which require a careful and difficult tuning of the penalty factors. In this paper, we proposed a multi-objective optimization concept to handle constraints. Firstly, we redefine the problems by converting all the constraints into new objective functions. Thus, the problems with m objective functions and n constraints become unconstrained optimization problems with m+n objective functions. Then we could utilize all kinds of multi-objective evolutionary algorithms to optimize the redefined problems. In this work a recent multi-objective Differential Evolution (DEMO) was used for multi-objective optimization. In order to evaluate the ability of our method we chose eight famous constrained test functions, including four single-objective test functions (g06, g08, g11 and Gearbox) and four multiple-objective test functions (CONSTR, SRN, TNK and KITA). Experimental results from eight constrained test functions show that the proposed method is capable of successfully optimizing constrained single-and multiple-objective problems.
Facilitating Pedagogical Practices through a Large-Scale Tablet PC Deployment
Authors: Joseph G. Tront
Venue: Computer (2007)

The Virginia Tech College of Engineering has begun to explore the use of Tablet PCs in engineering and computer science courses. Using a multifaceted, collaborative approach, the faculty developed an implementation process that includes computer acquisition, faculty training, infrastructure modifications, and multiple evaluation assessments demonstrating positive initial results.
Understanding user acceptance of multimedia messaging services: An empirical study
Authors: Matthew K. O. Lee, Christy M. K. Cheung, Zhaohui Chen
Venue: Journal of the American Society for Information Science and Technology (2007)

Multimedia Messaging Services (MMS) is a new medium that enriches people's personal communication with their business partners, friends, or family. Following the success of Short Message Services, MMS has the potential to be the next mobile commerce &ldquo;killer application&rdquo; which is useful and popular among consumers; however, little is known about why people intend to accept and use it. Building upon the motivational theory and media richness theory, the research model captures both extrinsic (e.g., perceived usefulness and perceived ease of use) and intrinsic (e.g., perceived enjoyment) motivators as well as perceived media richness to explain user intention to use MMS. An online survey was conducted and 207 completed questionnaires were collected. By integrating the motivation and the media richness perspectives, the research model explains 65&percnt; of the variance. In addition, the results present strong support to the existing theoretical links as well as to those newly hypothesized in this study. Implications from the current investigation for research and practice are provided. &copy; 2007 Wiley Periodicals, Inc.
Semantics-Based Art Image Retrieval Using Linguistic Variable
Authors: Qingyong Li, Siwei Luo, Zhongzhi Shi
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

More and more digitized art images are accumulated and expanded in our daily life and techniques need to be established on how to organize and retrieval them. Though content-based image retrieval (CBIR) got great progress, current low-level visual information based retrieval technology does not allow users to retrieval images by high-level semantics. We propose an approach to describe and to extract the fuzzy aesthetic semantics of art images. Accordance with the subjectivity and vagueness of human aesthetic perception, we utilize the linguistic variable to describe the image aesthetic semantics, so it becomes possible to depict the image in linguistic expression such as 'very action'. Furthermore, we apply the feedforward neural network to model the process of human aesthetic perception and to extract the fuzzy semantic feature vector. The retrieval methodology makes users more naturally find desired images by linguistic expression and experimental implementation demonstrates good potential on retrieval art images with a human-accustomed manner.
Impulsive Noise Removal by Nonlocal Fuzzy Diffusion
Authors: Xiuping Liu, Bo Li, Zhixun Su, Xiquan Shi, Fengshan Liu
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Standard image deconvolution methods perform well with the Gaussian noise model based on the piecewise smooth assumption. But the performance on impulsive noise is poor because the noised image is far away from assumption of piecewise smooth. The challenge is how to handle the discontinuities and at the same time remove the impulsive noise. Median-based approaches are inadequate, because at high noise levels they induce nonlinear distortion that hampers the denoising process. Here an improved nonlocal diffusion method based on fuzzy metric is proposed. The experiments results indicate that the new method is suitable for impulsive noise.
A genetic algorithm for channel routing in vlsi circuits
Authors: Jens Lienig, K. Thulasiraman
Venue: Evolutionary Computation (1993)

A new genetic algorithm for channel routing in the physical design process of VLSI circuits is presented. The algorithm is based on a problem-specific representation scheme and problem-specific genetic operators. The genetic encoding and our genetic operators are described in detail. The performance of the algorithm is tested on different benchmarks, and it is shown that the results obtained using the proposed algorithm are either qualitatively similar to or better than the best published results.
IMS Social Network Application with J2ME compatible Push-To-Talk Service
Authors: Christian Menkens, Nils Kjellin, Anders Davoust
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

People in any type of community use different kinds of systems, social network services and technologies to interact, communicate, inform themselves and others about news, events etc. within their community. So far it was necessary to use different systems and technologies like bulletin boards, cell phones, pagers, instant messaging, E-Mail, social network services etc. to do that. This paper describes an IMS social network application that can be used to do all these tasks using IMS enabled cell phones. A typical "community" for the application would be a college campus, metropolitan business or downtown area or large scale events with multiple locations such as the Olympic Games or World Cups. Typical users would be students, professors, businessmen, travelers, spectators etc. The main interface of the application is an interactive map of the community/ area that enables users to interacting with their whole community.
Teaching recursive programming using BASIC
Authors: P. N. Daykin
Venue: ACM SIGCUE Outlook (1974)

The value of a recursive programming capability in a high level programming language is now generally recognized. The teaching of recursive programming, however, is often postponed to a second-semester college course in computing science, as if the topic belonged to an advanced level, though it has been shown (1, 2) that recursion can be grasped by students of mathematics at the secondary school level or earlier. One unfortunate result of this postponement of recursion in computing science teaching is that students who take one semester only carry away with them the false notion that computers are limited intrinsically to understanding iterative processes.
Structured Placement with Topological Regularity Evaluation
Authors: Shigetoshi Nakatake
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

This paper introduces a new concept of floorplanning and block placement, called structured placement. Regularity is a key criterion of structured placement so that placement can make progress beyond constraint-driven approaches. This paper formulates the topological regularity that is extractable from a sequence-pair. Regular structures like arrays and rows are defined on a single-sequence that is a kind of standard representation of a sequence-pair. We extract regular structures from a single-sequence in O(n), and then evaluate the structures by quantifying the regularity as an objective function. Besides, we propose a new simulated annealing (SA) framework, called dual SA, where we convey a constructive feature to an SA framework, so that it attains a placement balancing the size of regular structures against the area efficiency. In experiments, we apply our structured placement to analog block designs, and reveal the definite advantage that our placements contain many regular structures such as rows and arrays without increasing the chip area and the wire length, compared to the existing placement.
Thermal-aware Steiner routing for 3D stacked ICs
Authors: Mohit Pathak, Sung Kyu Lim
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

In this paper, we present the first work on the Steiner routing for 3D stacked ICs. In the 3D Steiner routing problem, the pins are located in multiple device layers, which makes it more general than its 2D counterpart. Our algorithm consists of two steps: tree construction and tree refinement. Our tree construction algorithm builds a delay-oriented Steiner tree under a given thermal profile. We show that thermal-aware 3D tree construction involves the minimization of two-variable Elmore delay function. In our tree refinement algorithm, we reposition the through-vias while preserving the original routing topology for further thermal optimization under performance constraint. We employ a novel scheme to relax the initial NLP formulation to ILP and consider all through-vias from all nets simultaneously. Our related experiments show the effectiveness of our proposed solutions.