ppxscal/embedding_network huggingface dataset:
Implications of Device Timing Variability on Full Chip Timing
Authors: Murali Annavaram, Ed Grochowski, Paul Reed
Venue: Proceedings of the 2007 IEEE 13th International Symposium on High Performance Computer Architecture (2007)

As process technologies continue to scale, the magnitude of within-die device parameter variations is expected to increase and may lead to significant timing variability. This paper presents a quantitative evaluation of how low level device timing variations impact the timing at the functional block level. We evaluate two types of timing variations: random and systematic variations. The study introduces random and systematic timing variations to several functional blocks in Intel® Core¿ Duo microprocessor design database and measures the resulting timing margins. The primary conclusion of this research is that as a result of combining two probability distributions (the distribution of the random variation and the distribution of path timing margins) functional block timing margins degrade non-linearly with increasing variability.
An LSB Data Hiding Technique Using Prime Numbers
Authors: Sandipan Dey, Ajith Abraham, Sugata Sanyal
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

In this paper, a novel data hiding technique is proposed, as an improvement over the Fibonacci LSB data-hiding technique proposed by Battisti et al. [1]. First we mathematically model and generalize our approach. Then we propose our novel technique, based on decomposition of a number (pixel-value) in sum of prime numbers. The particular representation generates a different set of (virtual) bit-planes altogether, suitable for embedding purposes. They not only allow one to embed secret message in higher bit-planes but also do it without much distortion, with a much better stego-image quality, and in a reliable and secured manner, guaranteeing efficient retrieval of secret message. A comparative performance study between the classical Least Significant Bit (LSB) method, the Fibonacci LSB data-hiding technique and our proposed schemes has been done. Analysis indicates that image quality of the stego-image hidden by the technique using Fibonacci decomposition improves against that using simple LSB substitution method, while the same using the prime decomposition method improves drastically against that using Fibonacci decomposition technique. Experimental results show that, the stego-image is visually indistinguishable from the original cover-image.
Imaging and Sleeping Beauty: a case for double-halfers
Authors: Mikal Cozic
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

(Elga 2000) introduced philosophers to the troubling scenario of Sleeping Beauty. On Sunday evening (t0), Sleeping Beauty is put to sleep by an experimental philosopher. She is awaken on Monday morning and at this moment (t1), the experimenter doesn't tell her which day it is. Some time later (t2), she is told that it is actually Monday. At this point, what follows depends on the toss of a fair coin that took place on Sunday evening - Sleeping Beauty is not aware of the outcome. If the coin landed heads (HEADS), then Sleeping Beauty is put to sleep until the end of the week. If the coin landed tails (TAILS), then Sleeping Beauty is awaken on Tuesday morning. The crucial fact is that a drug that is given to her is such that she cannot distinguish her awakening on Monday from her awakening on Tuesday. Of course, Sleeping Beauty is perfectly informed of every detail of the protocol before the experiment. The question that has drawn so much attention since (Elga 2000) is the following: what should be Sleeping Beauty's degree of belief that HEADS? Actually, the question will be asked at two different times: at t1 - when Sleeping Beauty is just awaken on Monday - and t2 - when Sleeping Beauty has been told that it is Monday. Let us call the first question Q1 and the second Q2. In the sequel, Pi (i &epsilon; {0, 1, 2}) will denote Sleeping Beauty's credence at ti, that is, her beliefs concerning the relevant propositions.
Exploiting synchronous and asynchronous DVS for feedback EDF scheduling on an embedded platform
Authors: Yifan Zhu, Frank Mueller
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2007)

Contemporary processors support dynamic voltage scaling (DVS) to reduce power consumption by varying processor voltage/frequency dynamically. We develop power-aware feedback--DVS algorithms for hard real-time systems that adapt to dynamically changing workloads. The algorithms lower execution speed while guaranteeing timing constraints. We study energy consumption for synchronous and asynchronous DVS switching on a PowerPC board. Energy, measured via data acquisition, is reduced up to 70&percnt; over na&iuml;ve DVS for our feedback scheme with 24&percnt; peak savings over previous algorithms. These results, albeit differing in quantity, confirm trends observed under simulation. They are the first of their kind on an embedded board.
Disintermediating the PC: a product centric view on Web 2.0
Authors: Tom Djajadiningrat, Steven Kyffin
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

In this position paper, we chart the internet's transition to Web 2.0 and the accompanying rise in user generated content. We trace back this transition to social needs: people's need for a sense of identity and a sense of belonging. We point out that working with digital content has become near impossible without the use of a PC: the PC has established itself as the 'spider in the web' of content capturing and rendering devices. We then argue that if we accept Web 2.0 leisure activities as a predominantly social phenomenon, these activities belong in the living room. However, for a number of reasons the PC is poorly suited to use in a living room context. As an alternative to a system configuration with centralized, PC-based control, we suggest that a network of dedicated, networked devices may be better suited to the home context.
Developing recommender systems with the consideration of product profitability for sellers
Authors: Long-Sheng Chen, Fei-Hao Hsu, Mu-Chen Chen, Yuan-Chia Hsu
Venue: Information Sciences: an International Journal (2008)

In electronic commerce web sites, recommender systems are popularly being employed to help customers in selecting suitable products to meet their personal needs. These systems learn about user preferences over time and automatically suggest products that fit the learned model of user preferences. Traditionally, recommendations are provided to customers depending on purchase probability and customers' preferences, without considering the profitability factor for sellers. This study attempts to integrate the profitability factor into the traditional recommender systems. Based on this consideration, we propose two profitability-based recommender systems called CPPRS (Convenience plus Profitability Perspective Recommender System) and HPRS (Hybrid Perspective Recommender System). Moreover, comparisons between our proposed systems (considering both purchase probability and profitability) and traditional systems (emphasizing an individual's preference) are made to clarify the advantages and disadvantages of these systems in terms of recommendation accuracy and/or profit from cross-selling. The experimental results show that the proposed HPRS can increase profit from cross-selling without losing recommendation accuracy.
PhyloGena—a user-friendly system for automated phylogenetic annotation of unknown sequences
Authors: Kristian Hanekamp, Uta Bohnebeck, Bánk Beszteri, Klaus Valentin
Venue: Bioinformatics (2007)

Motivation: Phylogenomic approaches towards functional and evolutionary annotation of unknown sequences have been suggested to be superior to those based only on pairwise local alignments. User-friendly software tools making the advantages of phylogenetic annotation available for the ever widening range of bioinformatically uninitiated biologists involved in genome/EST annotation projects are, however, not available. We were particularly confronted with this issue in the annotation of sequences from different groups of complex algae originating from secondary endosymbioses, where the identification of the phylogenetic origin of genes is often more problematic than in taxa well represented in the databases (e.g. animals, plants or fungi). Results: We present a flexible pipeline with a user-friendly, interactive graphical user interface running on desktop computers that automatically performs a basic local alignment search tool (BLAST) search of query sequences, selects a representative subset of them, then creates a multiple alignment from the selected sequences, and finally computes a phylogenetic tree. The pipeline, named PhyloGena, uses public domain software for all standard bioinformatics tasks (similarity search, multiple alignment, and phylogenetic reconstruction). As the major technological innovation, selection of a meaningful subset of BLAST hits was implemented using logic programing, mimicing the selection procedure (BLAST tables, multiple alignments and phylogenetic trees) are displayed graphically, allowing the user to interact with the pipeline and deduce the function and phylogenetic origin of the query. PhyloGena thus makes phylogenomic annotation available also for those biologists without access to large computing facilities and with little informatics background. Although phylogenetic annotation is particularly useful when working with composite genomes (e.g. from complex algae), PhyloGena can be helpful in expressed sequence tag and genome annotation also in other organisms. Availability: PhyloGena (executables for LINUX and Windows 2000/XP as well as source code) is available by anonymous ftp from http://www.awi.de/en/phylogena Contact: kvalentin@awi-bremerhaven.de
Evaluation of the Model Curriculum in Computer Science and Engineering
Authors: M. E. Sloan
Venue: Computer (1977)

Curriculum reports in computer science and engineering have traditionally resulted from committees, working in relative isolation. Once chosen, the members of such committees as the ACM Curriculum Committee on Computer Science and the COSINE Committee have held meetings, debated, occasionally consulted with resource people, and then have published their results. Informal prepublication reviews have occurred, but no formal, formative evaluation of previous work in CSE curriculum has ever been published. 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
Session II Structured Programming: A Quantitative Assessment
Authors: B. Boehm
Venue: Computer (1975)

It has now been about four years since the first impressive experience using structured programming* techniques on a large production software project.1 Yet one still hears wildly varying claims about its effectiveness in general. Here are some recent samples.
Century: Automated Aspects of Patient Care
Authors: Marion Blount, John Davis, Maria Ebling, Ji Hyun Kim, Kyun Hyun Kim, KangYoon Lee, Archan Misra, SeHun Park, Daby Sow, Young Ju Tak, Min Wang, Karen Witting
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

Remote health monitoring affords the possibility of improving the quality of health care by enabling relatively inexpensive out-patient care. However, remote health monitoring raises new a problem: the potential for data explosion in health care systems. To address this problem, the remote health monitoring systems must be integrated with analysis tools that provide automated trend analysis and event detection in real time. In this paper, we propose an overview of Century, an extensible framework for analysis of large numbers of remote sensor-based medical data streams.
Learning programming by programming: a case study
Authors: Marko Hassinen, Hannu Mäyrä
Venue: Proceedings of the 6th Baltic Sea conference on Computing education research: Koli Calling 2006 (2006)

Programming is a challenging field of computer science for both to teach and learn. Although studied extensively, a definite method for teaching programming is yet to be found. In quest of finding success factors in both elementary and more advanced programming courses, this paper discusses some findings made studying exam success and home assignment activity in programming courses. Our claim is that there is no shortcut in learning to program, but extensive practise and sufficient time to become familiar with programming concepts is needed.
Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors
Authors: Sivaram Gopalakrishnan, Priyank Kalla, M. Brandon Meredith, Florian Enescu
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Polynomial computations over fixed-size bit-vectors are found in many practical datapath designs. For efficient RTL synthesis, it is important to identify good decompositions of the polynomial into smaller/simpler units. Symbolic computer algebra algorithms and tools have been used for this purpose. However, fixed-size (m) bit-vector arithmetic is polynomial algebra over the finite integer ring Z2m, which is a non-unique factorization domain (non-UFD). While non-UFDs provide an extra freedom to search for decompositions, they complicate polynomial manipulation as traditional division-based algorithms are inapplicable. This paper presents new mathematical concepts for polynomial decomposition over Z2m, for RTL synthesis over fixed-size m-bit vectors. Given a polynomial, we identify a specific set of linear expressions and compute the Gr&ouml;bner bases of their ideal (over non-UFD Z2m) using syzygies. This basis serves as good building-blocks for the given computation. A decomposition is identified by subsequent Gr&ouml;bner basis reduction. Experimental results demonstrate significant area savings due to our approach, as compared against contemporary datapath synthesis techniques.
Backlog Aware Low Complexity Schedulers for Input Queued Packet Switches
Authors: Aditya Dua, Nicholas Bambos, Wladek Olesinski, Hans Eberle, Nils Gura
Venue: Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects (2007)

We study the problem of packet scheduling in input queued packet switches, with an emphasis on low complexity and ease of implementation. Toward this end, we propose a class of subset based schedulers, wherein an N × N switch is operated using only a small set of N configurations in every time-slot. We show that the performance of subset based scheduling is comparable to that of the benchmark maximum weight matching (MWM) scheduler, albeit at much lower complexity. Next, we relate subset based scheduling to the well known wrapped wavefront arbiter (WWFA) [14] and propose BA-WWFA, a backlog aware version of WWFA. The BA-WWFA scheduler significantly enhances the performance of WWFA, while retaining its ease of hardware implementation. The performance gains are especially noteworthy under non-uniform loading of the switch. Given their ease of implementation and MWM like performance, the schedulers proposed in this paper represent an attractive option for high performance packet switching.
Design and Simulation of Adaptive Fuzzy Controller for Active Suspension System
Authors: Jianmin Sun, Qingmei Yang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

An adaptive fuzzy controller which fuzzy control rule table can be obtained with the numerical calculation is designed in order to improve vehicle comfort and road holding capability. There is no membership function choice of fuzzy subset for input and output of controller. The rectification factor is adjusted online according to adaptive method. The factor can be influenced by exciting signal and controlled signal, so the adaptive fuzzy controller has adaptive ability. For two degree-of-freedom (DOF) vehicle model, the simulation of vehicle performance in road signal is studied, its results show the acceleration of sprung mass can be declined effectively in resonance frequency band, even more obviously in the lower frequency, and its power spectral density (PSD) is reduced to 5%. The dynamic tyre load of wheels, is declined 20% in the resonance band of high frequency. It proves that the dynamic tyre load can meet the request for handling safety under random road excitation.
Direction Code Based Features for Recognition of Online Handwritten Characters of Bangla
Authors: U. Bhattacharya, B. K. Gupta, S. Parui
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

In the present article, we describe a novel direction code based feature extraction approach for recognition of online Bangla handwritten basic characters. We have implemented the proposed approach on a database of 7043 online handwritten Bangla (a major script of the Indian subcontinent) character samples, which has been developed by us. This is a 50-class recognition problem and we achieved 93.90% and 83.61% recognition accuracies respectively on its training and test sets.
Non-linear dimensional variation analysis for sheet metal assemblies by contact modeling
Authors: Xiaoyun Liao, G. Gary Wang
Venue: Finite Elements in Analysis and Design (2007)

The dimensional quality of product assembly is one of the most concerned issues in modern product design and manufacturing. During the assembly process, contact between rigid or non-rigid parts and/or fixtures is inevitable. The contact phenomenon of non-rigid parts, however, received little attention as compared with that of the rigid parts. We present in this paper the study of the contact problem of the non-rigid sheet metal assemblies. A systematic procedure of the non-linear dimensional variation analysis for the sheet metal assemblies is developed by using the contact finite element method and considering the friction force between the assembly surfaces. The proposed approach is validated in a case study of two sheet metal parts assembly via physical experiments. The simulation results agree well with the results obtained from physical experiments. This work provides a systematical and high-precision approach for dimensional variation analysis for non-rigid assemblies by contact modeling.
Path queries on compressed XML
Authors: Peter Buneman, Martin Grohe, Christoph Koch
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Central to any XML query language is a path language such as XPath which operates on the tree structure of the XML document. We demonstrate in this paper that the tree structure can be effectively compressed and manipulated using techniques derived from symbolic model checking. Specifically, we show first that succinct representations of document tree structures based on sharing subtrees are highly effective. Second, we show that compressed structures can be queried directly and efficiently through a process of manipulating selections of nodes and partial decompression. We study both the theoretical and experimental properties of this technique and provide algorithms for querying our compressed instances using node-selecting path query languages such as XPath. We believe the ability to store and manipulate large portions of the structure of very large XML documents in main memory is crucial to the development of efficient, scalable native XML databases and query engines.
Formal Efficiency Analysis for Tree Transducer Composition
Authors: Janis Voigtlander
Venue: Theory of Computing Systems (2007)

We study the question of efficiency improvement or deterioration for a semantics-preserving program transformation technique for (lazy) functional languages, based on composition of restricted macro tree transducers. By annotating programs to reflect the intensional property "computation time" explicitly in the computed output and by manipulating such annotations, we formally prove syntactic conditions under which the composed program is guaranteed to be no less efficient than the original program with respect to the number of call-by-need reduction steps required to reach normal form. The criteria developed can be checked automatically and efficiently, and thus they are suitable for integration into an optimizing compiler.
Literature review and experience with whole classroom peer tutoring for IT students
Authors: S. Jeff Cold, George D. Hickman
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

Having been accustomed to passive learning for years, students can sometimes "tune out" their Information Technology (IT) professors during classroom lecture, especially when they are tempted to surf the Web. Sometimes students have a tendency to listen more attentively to peers explaining an IT concept than to the professor. Whole classroom peer tutoring is a teaching technique based on active learning that has shown to be very effective in teaching concepts from basic reading skills to advanced medical procedures. The authors review the current literature on peer tutoring and then present their experience effectively using whole classroom peer tutoring facilitated by CrossTec's NetOp School v4 (now renamed SchoolVUE). With NetOp School, a single IT student can be given monitor focus so that whatever is on their screen is sent to all other screens in the classroom. While a student has focus, other students do not have control of their monitors. Coordinating with the IT professor in advance, a student explains to other students how they successfully completed an IT homework challenge. Afterwards, focus is released so that peers regain control of their workstations where they are given some classroom time to work through challenging homework with a fresh perspective. Those students who complete the challenge early, are encouraged to visit with fellow classmates and help them complete the homework challenge.
Fast Decoupling Capacitor Budgeting for Power/Ground Network Using Random Walk Approach
Authors: Le Kang, Yici Cai, Yi Zou, Jin Shi, Xianlong Hong
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified random walk process to partition the circuit. Then, by utilizing the isolation property of decaps, this new method avoids solving the large nonlinear programming problem in traditional decap optimization process. Also, this method integrates leakage currents optimization algorithm using a refined leakage model. Experimental results demonstrate that our proposed method achieves approximate a 10times speed up over the heuristic method based on sensitivity and only about 6% decap area deviation from the optimal budget using the programming method.