ppxscal/embedding_network huggingface dataset:
Efficient path delay test generation based on stuck-at test generation using checker circuitry
Authors: Tsuyoshi Iwagaki, Satoshi Ohtake, Mineo Kaneko, Hideo Fujiwara
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

This paper proposes an approach to non-robust and functionally sensitizable path delay test generation through stuck-at test generation. In this approach, to generate two-pattern tests for path delay faults in a combinational circuit, checker circuitry is constructed which is composed of logic gates corresponding to the mandatory assignments for detecting the faults. This checker circuitry allows us to use any existing combinational stuck-at test generation tool. Since today's stuck-at test generation tools reach a mature level, the proposed approach can efficiently solve the path delay test generation problem for combinational circuits. Experimental results show that the approach can speed up path delay test generation and can improve fault efficiency. This paper also discusses how a scan circuit and the issues of over-testing and test power are handled in the proposed test generation framework.
An algorithm of job shop rolling scheduling based on singular rough sets
Authors: Yongmei Hu, Yanan Fu, Lei Jia, Qiqiang Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

A new kind of rolling scheduling algorithm based on singular rough sets is put forward in the article. Under dynamic processing environment, a job identification problem in a rolling horizon optimal scheduling window is investigated. Using a new artificial intelligence method, singular rough sets, this article presents a new job identification algorithm of job shop rolling scheduling. It bases on the dynamic transfer characteristic and the assistant set of singular rough sets. In case of the machine failure, the due date of the jobs changed and the urgent job, the re-selection and re-scheduling of the jobs in the rolling window are executed once more. Solved by genetic algorithm, the illustration example verifies the effectively of the algorithm, not only the dynamic processing environment is adapted and a satisfied rescheduling result is obtained, but also the re-scheduling dimension is decreased.
Magical experiences in interaction design
Authors: Sam de Jongh Hepworth
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

This paper is a description of design experiments performed to investigate the use of magical experiences in interaction design of consumer electronics. Magical experiences are usually associated with a passive audience watching a magician, but it is interesting to see if interaction can also be a magical experience. Using inspiration from stage magic, industrial design, the consumer electronics company Bang & Olufsen, and related research in interaction design a set of key topics for developing magical experiences are proposed. The key topics are used to develop three design experiments. The design experiments are tested and the results are analyzed and discussed.
Integrating gene expression profiling and clinical data
Authors: Silvano Paoli, Giuseppe Jurman, Davide Albanese, Stefano Merler, Cesare Furlanello
Venue: International Journal of Approximate Reasoning (2008)

We propose a combination of machine learning techniques to integrate predictive profiling from gene expression with clinical and epidemiological data. Starting from BioDCV, a complete software setup for predictive classification and feature ranking without selection bias, we apply semisupervised profiling for detecting outliers and deriving informative subtypes of patients. During the profiling process, sampletracking curves are extracted, and then clustered according to a distance derived from dynamic time warping. Sampletracking allows also the identification of outlier cases, whose removal is shown to improve predictive accuracy and stability of derived gene profiles. Here we propose to employ clinical features to validate the semisupervising procedure. The procedure is demonstrated in the analysis of a liver cancer dataset of 213 samples described by 1993 genes and by pathological features.
Thermal and plasma enhanced atomic layer deposition ruthenium and electrical characterization as a metal electrode
Authors: Sang-Joon Park, Woo-Hee Kim, Han-Bo-Ram Lee, W. J. Maeng, H. Kim
Venue: Microelectronic Engineering (2008)

Ruthenium thin films were grown by thermal and plasma-enhanced atomic layer deposition (PE-ALD) using O"2 and ammonia (NH"3) plasma, respectively. RuCp"2 and Ru(EtCp)"2 were used as Ru precursors. Pure and low resistivity (
The Knowledge Based Software Process Improvement Program: A Rational Analysis
Authors: Alagarsamy K, Justus S, Iyakutti K
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Knowledge management is the key area of focus in the present information technology scenario. It forms a basis to derive standards and models and steers organizations through an enjoyable journey, an improved endeavor to reach the destination. Software process improvement program is a crucial venture for organizations functioning under a framework model and aspiring for higher maturity levels. While earlier works for software process improvement have been considering wider range of initiatives, we deem knowledge management to be a contemporary approach for refining software process improvement activities. This paper is committed to a rational analysis into the knowledge-based guidance for implementing a software process improvement program. The work is directed by four research questions that focus on the knowledge based SPI initiative. The role of knowledge components and a knowledge driven model (KDM) are assessed by a measurement model. The impact of KDM on the end-product and its real effect on SPI is measured by quantifying the productivity of the projects, eventually the organization. An implementation of the knowledge driven software process improvement (SPI) program is explained with a suitable case study, an organization working towards attaining CMM level. Future issues pertaining to knowledge based process improvement forms the concluding note of this work.
Fun and usable: augmented reality instructions in a hospital setting
Authors: Susanna Nilsson, Björn Johansson
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

The differences between Augmented Reality (AR) systems and computer display based systems create a need for a different approach than "traditional" HCI to the design and development of AR systems. This paper presents theoretical and empirical work which uses holistic approach compared to traditional guidelines in human computer interaction. The paper includes a usability study where AR was used for giving instructions to professional users in a hospital. The theoretical stance of Cognitive Systems Engineering is suggested as a possible approach to the design of AR system. The analysis show that the users in the context of medical care are positive towards AR systems as a technology and as a tool for instructions. This indicates that AR technology may become an accepted part of every day work in such a context.
Efficient Mapping of Dimensionality Reduction Designs onto Heterogeneous FPGAs
Authors: Christos-S Bouganis, Iosifina Pournara, Peter Y. K. Cheung
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

Dimensionality reduction or feature extraction has been widely used in applications that require to reduce the amount of original data, like in image compression, or to represent the original data by a small set of variables that capture the main modes of data variation, as in face recognition and detection applications. A linear projection is often chosen due to its computational attractiveness. The calculation of the linear basis that best explains the data is usually addressed using the Karhunen-Loeve Transform (KLT). Moreover, for applications where real-time performance and flexibility to accommodate new data are required, the linear projection is implemented in FPGAs due to their fine-grain parallelism and reconfigurability properties. Currently, the optimization of such a design, in terms of area usage and efficient allocation of the embedded multipliers that exist in modern FPGAs, is considered as a separate problem to the basis calculation. In this paper, we propose a novel approach that couples the calculation of the linear projection basis, the area optimization problem, and the heterogeneity exploration of modern FPGAs under a probabilistic Bayesian framework. The power of the proposed framework is based on the flexibility to insert information regarding the implementation requirements of the linear basis by assigning a proper prior distribution. Results using real-life examples demonstrate the effectiveness of our approach.
Key drivers of mobile commerce adoption an exploratory study of Spanish mobile users
Authors: Enrique Bigné, Carla Ruiz, Silvia Sanz
Venue: Journal of Theoretical and Applied Electronic Commerce Research (2007)

Despite dramatic differences between non-store shoppers were discovered, very limited research has been conducted to examine them. This paper analyses the background of M-commerce and key drivers of future M-commerce decision among Spanish mobile users. Our objective is two-fold: (1) to determine the influence of relations with the Mobile (frequency of Mobile use, length of Mobile use and Mobile affinity), demographics, non-store shopping previous experience (mail, catalogue, Television and Internet) and attitude to M-commerce and its influence on the M-commerce decision and (2) to identify key drivers of future M-commerce intention. We examined data from 606 personal interviews given to Spanish mobile users (270 Mobile shoppers and 336 non Mobile-shoppers) over 14 years old. Data analysis shows that age, attitude towards M-commerce, Internet shopping previous experience and relations with the Mobile (frequency, length of Mobile use and Mobile affinity) are the main predictors of M-commerce decision while age, length of Mobile use, Mobile affinity, consumer attitude towards M-commerce and previous M-commerce experience are the most relevant factors influencing future M-commerce intention. Based on these empirical results this research enables companies to know the key drivers influencing M-commerce adoption and, therefore, what aspects to highlight in their marketing strategies.
Power Grid Physics and Implications for CAD
Authors: Sanjay Pant, Eli Chiprout, David Blaauw
Venue: IEEE Design Test (2007)

An accurate analysis of supply noise in power distribution networks is essential to ensure reliable performance in high-performance designs. Recently, several analysis and optimization techniques for on-chip power grid networks have been proposed. However, all of these approaches assume a particular simplified model or behavior of the complex power delivery network. This article describes the first detailed, full-die, dynamic model of an Intel Pentium IV microprocessor design. The authors justify this model from the ground up, starting with a full-wave model and then using increasingly larger, but less detailed models, with only the irrelevant elements removed at each step. Using these models, the authors show that there is little impact of on-die inductance in such a design, and that package-die cosimulation is critical to understanding the grid's resonant properties. The authors also show that transient supply noise is sensitive to the nonuniform decoupling-capacitor (decap) distribution and that supply drop locality is a tight function of frequency and package-die resonance. All of these points have an impact on the kind of analysis and optimization required from CAD.
Proceedings of the 2007 ACM workshop on Formal methods in security engineering
Venue: Workshop on Formal Methods in Security Engineering (2007)

Welcome to the Fifth ACM Workshop on Formal Methods in Security Engineering (FMSE 2007) held in conjunction with the 14th ACM Conference on Computer and Communication Security (CCS 2007) on the Campus of George Mason University. The tradition of FMSE is to bring together researchers from both the security and the software engineering communities, from academia and industry, who are working on applying formal methods to designing and validating large-scale security-critical systems. The scope of the workshop covers security-related and formal-methods-related aspects of all activities in software ndevelopment, including requirement and risk analysis, security models like access control, information flow and trust models, the specification and analysis of security properties, aspects of stepwise development by refinement and composition, computationally sound abstraction, static and dynamic security analysis techniques like program logics, type systems and security monitors, tool support for the development and analysis of security-critical systems, and applications of formal methods, for instance, in the design and analysis of security protocols or operating systems. The paper selection process was very competitive this year. The call for papers attracted 28 submissions by authors from 15 different countries. The program committee accepted 8 papers for presentation, which unfortunately means that also some high-quality papers had to be rejected. In addition, the program features invited talks by Jeff Lewis and by John D. McLean.
Automatic Configuration of Ad-Hoc Networks: Establishing unique IP Link-Local Addresses
Authors: Raquel Lacuesta Gilaberte, Lourdes Penalver Herrero
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

One of the main problems when configuring ad-hoc networks is that with these networks don't have a central server with all the information of the network. If a new user wants to form part of a network must configure his device firstly. On the one hand, in this article we make an analysis of the different proposals for the configuration of ad-hoc networks presented on the bibliography consulted. On the other hand, we propose a distributed protocol to network data configuration based on the use of diffusion tools (multicast/broadcast) and where the user's intervention isn't necessary. The protocol proposed focus on IPv4 link-local addresses configuration to let the creation of MANETs (Mobile Ad hoc Networks). What's more, this protocol will be able to be also used to make both IPv6 link-local addresses configuration and other needed ad hoc networks parameters configuration.
Quantitative Evaluation Method for the Significance of Worsted Forespinning Parameters Based on BP Network
Authors: Gui Liu, Wei-dong Yu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

The BP neural network characteristic has been summarily analyzed. Based on its error back propagation method, the peculiarity of modifying its weightiness and threshold value to make the calculated error come down along the negative gradient direction, the article proposed a new approach that used the weightiness distribution between the input and output layer to appraise the input parameters' significant degree. Take the worsted craft as the example, each input parameter's contribution rate has been calculated to the roving unevenness (R1) and roving weight (R2) respectively, and the remarkable and effective parameters are excavated out. Meanwhile contrasting to the multivariate regression significance analysis (MRSA), the BP neural network method is more exact than MRSA and also can be used in the forecast and control of the actual produce and manufacture.
Performance Improvement Methodology for ClearSpeed's CSX600
Authors: Yuri Nishikawa, Michihiro Koibuchi, Masato Yoshimi, Kenichi Miura, Hideharu Amano
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

This paper focuses on a performance of network-on-achip (NoC) and I/O of ClearSpeed's CSX600 coprocessor with 96 multithread processing elements. Two versions of the Himeno Benchmark were implemented on the CSX600 to evaluate its performance when it encounters frequent memory transfers between shared and local memories, or between local memories. In order to efficiently use the NoC bandwidth, the dataflow was customized to the one-dimensional array structure of CSX600's NoC . The results of evaluation and profiling indicate that the performance was lower than 1/50 of the sustained performance. We show three key points to improve the performance on such a case: 1) exploiting bandwidth between mono and poly memory, 2) further program tuning, and 3) architectural reform.
New Developments on Recurrent Neural Networks Training
Authors: Suwat Pattamavorakun, Suwarin Pattamavorakun
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

A new algorithm is proposed for improving the convergence of recurrent neural networks. This algorithm is obtained by combining the methods of weight update of Atiya-Parlos algorithm (the algorithm find the direction of weight change by approximation), and Y-N algorithm technique (the algorithm estimate fictitious target signals of hidden nodes to update hidden weight separately from output weights), and then by adding the error self-recurrent (ESR) network to improve the error functions (to speed up the convergence and not sensitive to initial weight by calculating the errors from output unit and then these errors are fed back for determining weight updates of output unit nodes). The results showed that both fully RNN and partially RNNs on some selected and the proposed algorithm could forecast the daily flow data quite satisfactorily.
What is the optimal architecture for visual information routing?
Authors: Philipp Wolfrum, Christoph von der Malsburg
Venue: Neural Computation (2007)

Analyzing the design of networks for visual information routing is an underconstrained problem due to insufficient anatomical and physiological data. We propose here optimality criteria for the design of routing networks. For a very general architecture, we derive the number of routing layers and the fanout that minimize the required neural circuitry. The optimal fanout l is independent of network size, while the number k of layers scales logarithmically (with a prefactor below 1), with the number n of visual resolution units to be routed independently. The results are found to agree with data of the primate visual system.
Development of Low Power ISDB-T One-Segment Decoder by Mobile Multi-Media Engine SoC (S1G)
Authors: K. Mori, M. Suzuki, Y. Ohara, S. Matsuo, A. Asano
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

TOSHIBA has developed mobile multi-media engine SoC, we call as S1G, which can realize low power ISDB-T one-segment decode in 42mW for eight months short period of time. Since MPEG2 TS (transport stream) de-multiplexing, AAC decoding and H.264 decoding should be simultaneously processed in ISDB-T one-segment decode, two TOSHIBA MeP (Media embedded Processor) processors and one DSP and hardware blocks are used effectively with pipeline operation in this LSI. Although it is generally considered that dedicated hardware accelerator should be used to realize low power operation for ISDB-T one-segment decode, TOSHBA succeeded in developing low power ISDB-T one-segment decoder using maximum software resources.
Constructing vertex-disjoint paths in (n, k)-star graphs
Authors: Tsung-Chi Lin, Dyi-Rong Duh
Venue: Information Sciences: an International Journal (2008)

This work describes a novel routing algorithm for constructing a container of width n-1 between a pair of vertices in an (n, k)-star graph with connectivity n-1. Since Lin et al. [T.C. Lin, D.R. Duh, H.C. Cheng, Wide diameter of (n, k)-star networks, in: Proceedings of the International Conference on Computing, Communications and Control Technologies, vol. 5, 2004, pp. 160-165] already calculated the wide diameters in (n, n-1)-star and (n, 1)-star graphs, this study only considers an (n, k)-star with 2=
Modified constrained learning algorithms incorporating additional functional constraints into neural networks
Authors: Fei Han, Qing-Hua Ling, De-Shuang Huang
Venue: Information Sciences: an International Journal (2008)

In this paper, two modified constrained learning algorithms are proposed to obtain better generalization performance and faster convergence rate. The additional cost terms of the first algorithm are selected based on the first-order derivatives of the activation functions of the hidden neurons and the second-order derivatives of the activation functions of the output neurons, while the additional cost terms of the second one are selected based on the first-order derivatives of the activation functions of the output neurons and the second-order derivatives of the activation functions of the hidden neurons. In the course of training, the additional cost terms of the proposed algorithms can penalize the input-to-output mapping sensitivity and the high frequency components simultaneously so that the better generalization performance can be obtained. Finally, theoretical justifications and simulation results are given to verify the efficiency and effectiveness of our proposed learning algorithms.
Secure, Real-Time and Multi-Threaded General-Purpose Embedded Java Microarchitecture
Authors: Martin Zabel, Thomas B. Preuber, Peter Reichel, Rainer G. Spallek
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

This paper presents a novel implementation of an embedded Java microarchitecture for secure, real-time, and multi-threaded applications. A general-purpose platform is established through the support of modern features of object-oriented languages, such as exception handling, automatic garbage collection and interface types. New techniques have been implemented for specific real-time issues, such as an integrated stack and thread management for fast context switching, concurrent garbage collection for real-time threads and autonomous control flows through preemptive round-robin scheduling.
A Policy-Based Energy Efficient Clustering Scheme for Wireless Sensor Networks
Authors: Min Xiao, Gaolin Chen, Debao Xiao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

The recent interest in sensor networks has led to a number of clustering and routing schemes that use the limited resources available at sensor nodes more efficiently. In this paper, we introduce policy into such a power-limited, cluster-based environment to enhance the flexibility and efficiency of energy-aware clustering and routing schemes in wireless sensor networks. We explain the implementation of policies in detail and simulation results are also provided to evaluate the performance of policy interference.
A Unified Algorithm for Boolean Shape Operations
Authors: Fujio Yamaguchi, Toshiya Tokieda
Venue: IEEE Computer Graphics and Applications (1984)

Most algorithms for Boolean shape operations are complicated, slow, and of limited applicability. This one, based on a triangulation of potentially intersecting faces, is relatively fast and simple.