ppxscal/embedding_network huggingface dataset:
A Supercomputer Workstation for VLSI CAD
Authors: Rolf-dieter Fiebrich
Venue: IEEE Design Test (1986)

This article describes a VLSI CAD workstation with a massively parallel computer the connection machine, as hardware accelerator.The connection machine offers workstation users general-purpose acceleration capabilities and high interactivity. Workstationsoftware includes a novel CAD-system kernel and tools operating on the connection machine. The system kernel, designed topermit efficient interfaces to existing tools and tool environments, also includes more advanced design tools (proceduraltools, for example) providing a suitable basis for knowledge-based tool development.
Applications of On-chip Trace on Debugging Embedded Processor
Authors: Xiao Hu, Shuming Chen
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

On-chip trace system records run-time information of the embedded processor with special hardware to overcome the obstacle of non-intrusive debug and optimization of traditional techniques. This paper explores the mechanism, characteristics and applications of on-chip trace technique with TraceDo, an on-chip trace system of a multi-core SoC. The functions and structures of TraceDo are introduced, the working process of path trace is explained and the trace applications with two cases of debug and optimization are also discussed.
A Method for the Construction of a Probabilistic Hierarchical Structure Based on a Statistical Analysis of a Large-scale Corpus
Authors: Asuka Terai, Bin Liu, Masanori Nakagawa
Venue: Proceedings of the International Conference on Semantic Computing (2007)

The purpose of this study is to develop a method of constructing a probabilistic hierarchical structure based on a statistical analysis of a Japanese corpus using a combination of Kameya and Sato's statistical language analysis[7] and Rose's model[10]. First, the co-occurrence frequencies of adjectives and nouns are calculated from a Japanese corpus based on modification relations. Second, latent classes are extracted from a statistical language analysis of the co-occurrence data. Third, the centroid vectors of the latent classes are calculated from the analysis results and a probabilistic hierarchical structure of the latent classes is constructed by utilizing Rose's model. Finally, the conditional probabilities of the categories given the latent classes are computed as the association probabilities of the concepts to the categories and the conditional probabilities of the categories given the concepts are computed as the association probabilities of the concepts to the categories.
Identification of Latin-Based Languages through Character Stroke Categorization
Authors: S. J. Lu, L. Li, Chew Lim Tan
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

This paper presents a language identification technique that detects Latin-based languages of imaged documents without OCR. The proposed technique detects languages through the word shape coding, which converts each word image into a word shape code and accordingly transforms each document image into an electronic document vector. For each Latin-based language under study, a language template is first constructed through a corpus-based learn- ing process. The underlying language of the query docu- ment is then determined based on the similarity between the query document vector and multiple constructed language templates. Compared with the reported methods, the pro- posed language identification technique is fast, accurate, and tolerant to text segmentation error caused by noise and various types of document degradation. Experimental re- sults show some promising results.
Accurate Lung Segmentation For X-ray CT Images
Authors: Qixin Gao, ShengJun Wang, Dazhe Zhao, Jiren Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Segmentation of pulmonary X-ray computed tomography image is the first step to detect nodule of lung. This paper presents a fully automatic method for segmenting lung from three-dimensional thorax. First, the large airway is removed from lung region by anisotropic diffusion to smooth edges and region-growth. Second, we use an optimal threshold to automatically choose a threshold value, get binary images, and remove vessel of pulmonary using the optimal threshold. Third, left and right lungs are separated by detecting the anterior and posterior junctions using the largest threshold. Finally, we smooth the lung boundary along the mediastinum and lung wall by morphological smoothing. We show that our results are better than that achieved manually. Since there are no accepted criteria for defining the lung boundary near the mediastinum, we believe that our method of defining the boundary of lung near the mediastinum based on the structure of the airway tree provides a good basis for three-dimensional smoothing.
PAC-Bayes Risk Bounds for Stochastic Averages and Majority Votes of Sample-Compressed Classifiers
Authors: François Laviolette, Mario Marchand
Venue: The Journal of Machine Learning Research (2007)

We propose a PAC-Bayes theorem for the sample-compression setting where each classifier is described by a compression subset of the training data and a message string of additional information. This setting, which is the appropriate one to describe many learning algorithms, strictly generalizes the usual data-independent setting where classifiers are represented only by data-independent message strings (or parameters taken from a continuous set). The proposed PAC-Bayes theorem for the sample-compression setting reduces to the PAC-Bayes theorem of Seeger (2002) and Langford (2005) when the compression subset of each classifier vanishes. For posteriors having all their weights on a single sample-compressed classifier, the general risk bound reduces to a bound similar to the tight sample-compression bound proposed in Laviolette et al. (2005). Finally, we extend our results to the case where each sample-compressed classifier of a data-dependent ensemble may abstain of predicting a class label.
Application of Uniform Loading Theory to Circuit Packaging and Memory Arrays in High-Speed Computers
Authors: H. S. Hou
Venue: IEEE Transactions on Computers (1972)

The uniform loading theory [1] has been approximated and used to analyze a class of interconnection problems usually encountered in the design of high-speed circuit packaging and memory arrays in today's computers. The uniform loads are, for example, IC gates and via holes on multilayered printed circuit board and cross-coupling capacitance in memory arrays. They are treated as discrete loads along smooth transmission lines. The input and output transfer function, impulse response, unit step response, and propagation delay are calculated. To a first-order approximation, the pure resistive loaded line impedance and voltage reflection coefficient can be easily derived. Matching conditions and some experimental results are included. Oscillation due to second-order effects is also discussed.
PAS: Prediction-based Adaptive Sleeping for Environment Monitoring in Sensor Networks
Authors: Zheng Yang, Bin Xu, Jingyao Dai, Tao Gu
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Energy efficiency has proven to be an important factor dominating the working period of WSN surveillance systems. Intensive studies have been done to provide energy efficient power management mechanisms. In this paper, we present PAS, a Prediction-based Adaptive Sleeping mechanism for environment monitoring sensor networks to conserve energy. PAS focuses on the diffusion stimulus (DS) scenario, which is very common and important in the application of environment monitoring. Different with most of previous works, PAS explores the features of DS spreading process to obtain higher energy efficiency. In PAS, sensors determine their sleeping schedules based on the observed emergency of DS spreading. While sensors near the DS boundary stay awake to accurately capture the possible stimulus arrival, the far away sensors turn into sleeping mode to conserve energy. Simulation experiment shows that PAS largely reduces the energy cost without decreasing system performance.
A decentralized probabilistic approach to articulated body tracking
Authors: Gang Hua, Ying Wu
Venue: Computer Vision and Image Understanding (2007)

We present a novel decentralized probabilistic approach to visual tracking of articulated objects. Analyzing articulated motion is challenging because (1) the high degrees of freedom potentially demands tremendous computation, and (2) the solution is confronted by the numerous local optima existed in a high dimensional parametric space. To ease these problems, we propose a decentralized approach that analyzes limbs locally and reinforces the spatial coherence among them at the same time. The computational model of the proposed approach is based on a dynamic Markov network, a generative model which characterizes the dynamics, the image observations of each individual limb, as well as the spatial coherence among them. Probabilistic mean field variational analysis provides an efficient computational diagram to obtain the approximate inference of the motion posteriors. We thus design the mean field Monte Carlo (MFMC) algorithm, where a set of low dimensional particle filters interact with one another and solve the high dimensional problem collaboratively. We also present a variational maximum a posteriori (MAP) algorithm, which has a rigorous theoretic foundation, to approach to the optimal MAP estimate of the articulated motion. Both algorithms achieve linear complexity w.r.t. the number of articulated subparts and have the potential of parallel computing. Experiments on human body tracking demonstrate the significance, effectiveness and efficiency of the proposed methods.
Bounds On the Sequency Content of the Circular Functions
Authors: G. R. Redinbo
Venue: IEEE Transactions on Computers (1973)

The Walsh series coefficients for the circular functions are considered. Specifically we determine the sequency content of eJptand present bounds on the corresponding sequency-line spectrum.
Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems
Venue: ACM International Conference Proceeding Series; Vol. 275 (2006)

As the technical program chair, we would like to warmly welcome you to BIONETICS 2006 (Bio-Inspired mOdels of NEtwork, Information and Computing Systems, 2006). The conference promises to be an exciting event with an extensive overview of the latest developments in biologically inspired approaches to several fields in information and communication technology (ICT); the topics include mathematical models/methods/tools, software, networks and communication systems, security mechanisms, and nano-scale communication/information systems. It is now being recognized that nature and especially biology offer a large array of fascinating phenomena, and their high stability and efficiency are highly applicable to ICT systems. However, we believe that only mimicking biological systems should not be the final goal for ICT researchers and engineers. The goal of this conference is to present and discuss different approaches of how these phenomena, and the disciplines underlying them, could be applied to ICT developments. We received 54 papers (45 full papers and 9 short papers), out of which 36 papers (25 papers for oral presentation, 4 papers for poster presentation, and 7 work-in-progress papers) were selected to be presented at the conference after careful reviews by the Technical Program Committee. We have categorized all submitted papers into five areas: - bio-inspired mathematical models, methods and tools - bio-inspired software - bio-inspired networks and communication systems - bio-inspired security mechanisms - bio-inspired and bio-based nano-scale communication and information systems
A Medical Information System and Data Language for Ambulatory Practices
Authors: P. D. Beaman
Venue: Computer (1979)

The COSTAR system keeps medical records and does accounting and administrative tasks for group practices. It also offers clinical researchers a useful query language for manipulating medical data.
An algebraic semantics of event-based architectures
Authors: José Luiz Fiadeiro, Antónia Lopes
Venue: Mathematical Structures in Computer Science (2007)

We propose a mathematical semantics for event-based architectures that serves two main purposes: to characterise the modularisation properties that result from the algebraic structures induced on systems by this discipline of coordination; and to further validate and extend the categorical approach to architectural modelling that we have been building around the language CommUnity with the ‘implicit invocation’, also known as ‘publish/subscribe’ architectural style. We then use this formalisation to bring together synchronous and asynchronous interactions within the same modelling approach. We see this effort as a first step towards a form of engineering of architectural styles. Our approach adopts transition systems extended with events as a mathematical model of implicit invocation, and a family of logics that support abstract levels of modelling.
A Hybrid Approach to Improving Semantic Extraction of News Video
Authors: A. G. Hauptmann, M.-Y. Chen, M. Christel, W.-H. Lin, J. Yang
Venue: Proceedings of the International Conference on Semantic Computing (2007)

In this paper we describe a hybrid approach to improving semantic extraction from news video. Experiments show the value of careful parameter tuning, exploiting multiple feature sets and multilingual linguistic resources, applying text retrieval approaches for image features, and establishing synergy between multiple concepts through undirected graphical models. No single approach provides a consistently better result for every concept detection, which suggests that extracting video semantics should exploit multiple resources and techniques rather than a single approach.
Some Properties of Disjoint Variation of Fuzzy Set Functions
Authors: Fengye Wang, Qiang Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Disjoint variation is one of the variations of set functions, which plays an important role in the decomposition of set functions. In the paper, we generalize the definition of disjoint variation to the fuzzy set functions and the fundamental t-norm T and S are considered as the operation of the fuzzy sets. Some theories are proved for finitely T -additive fuzzy set functions with bounded disjoint variation and some properties of disjoint variation of the non-additive fuzzy set functions are given.
Values of upper secondary learners and role of mathematics in their development
Authors: Vanda Aramaviciute
Venue: Informatics in education (2007)

The article aims at raising the problem of culture in the context of globalisation, at characterising influence of globalisation and globalisation culture on human values and relation as expression of their spiritual world. In this context, a question of intermediary communication influence on individual's spiritual becoming is also raised. On the basis of own research data, the author defines peculiarities of internalisation level of upper secondary learners' spiritual values, observed in 1998, 2001 and 2005. On the basis of comparison, information regarding cognitive, emotional and behaviour level of internalisation and tendencies of its changes are analysed. The possibilities of teaching process, as a relevant factor of education, internalising values are concretised and the role of mathematics in this process is defined.
A hybrid scheme for compacting test responses with unknown values
Authors: Mango C.-T. Chao, Kwang-Ting Cheng, Seongmoon Wang, Srimat T. Chakradhar, Wen-Long Wei
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

This paper presents a hybrid compaction scheme for test responses containing unknown values, which consists of a space compactor and an unknown-blocking Multiple Input Signature Registers (MISR). The proposed scheme guarantees no coverage loss for the modeled faults. The proposed hybrid scheme can also be tuned to observe any user-specified percentage of responses for controlling the coverage loss for un-modeled faults. The experimental results demonstrate that, in comparison with a space compactor or an unknown-blocking MISR alone, the hybrid compaction scheme achieves a lower coverage loss without demanding more test-data volume. In addition, we propose a quantitative approach to estimate the required percentage of observable responses for the proposed scheme, directly based on a test-quality metric of un-modeled faults.
Special Feature: Structures for Advanced Information Systems
Authors: E. J. Smura
Venue: Computer (1981)

More effective means for processing and communicating information are now at hand. However, certain problems must be solved to achieve satisfactory structures for integrated information systems.
The Design of a Multicore Extension of the SPIN Model Checker
Authors: Gerard J. Holzmann, Dragan Bosnacki
Venue: IEEE Transactions on Software Engineering (2007)

We describe an extension of the SPIN model checker for use on multi-core shared-memory systems and report on its performance. We show how, with proper load balancing, the time requirements of a verification run can in some cases be reduced close to N-fold when N processing cores are used. We also analyze the types of verification problems for which multi-core algorithms cannot provide relief. The extensions discussed here require only relatively small changes in the SPIN source code, and are compatible with most existing verification modes, such as partial order reduction, the verification of temporal logic formulae, bitstate hashing, and hash-compact compression.
Automated refinement checking of concurrent systems
Authors: Sudipta Kundu, Sorin Lerner, Rajesh Gupta
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Stepwise refinement is at the core of many approaches to synthesis and optimization of hardware and software systems. For instance, it can be used to build a synthesis approach for digital circuits from high level specifications. It can also be used for post-synthesis modification such as in Engineering Change Orders (ECOs). Therefore, checking if a system, modeled as a set of concurrent processes, is a refinement of another is of tremendous value. In this paper, we focus on concurrent systems modeled as Communicating Sequential Processes (CSP) and show their refinements can be validated using insights from translation validation, automated theorem proving and relational approaches to reasoning about programs. The novelty of our approach is that it handles infinite state spaces in a fully automated manner. We have implemented our refinement checking technique and have applied it to a variety of refinements. We present the details of our algorithm and experimental results. As an example, we were able to automatically check an infinite state space buffer refinement that cannot be checked by current state of the art tools such as FDR. We were also able to check the data part of an industrial case study on the EP2 system.
Land Evaluation Method Based on Simplified Fuzzy Classification Association Rules
Authors: Jingfeng Yang, Yueju Xue, Yueming Hu, Zhimin Chen, Qiang Chen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

To improve the intelligibility and efficiency of the land evaluation knowledge, a land evaluation method integrating simplified fuzzy classification association rules with fuzzy decision is proposed in this paper Moreover, to reduce the complexity of the land evaluation models, an algorithm to eliminate redundant rules for obtaining the simplified fuzzy classification association rules is presented. The results of experiments demonstrate that land resource can be evaluated more accurately by using simplified fuzzy classification association rules, comparing with the results of the method combining the same number of original fuzzy classification association rules.
Graph theoretical representation of ANN architectures on regular two-dimensional grids for VLSI implementations
Authors: Stephan C. Stilkerich
Venue: Neurocomputing (2007)

The system-on-chip design of purely digital architectures, which are based on massively parallel Markov random field (MRF) processing principles is so far an unstructured, time consuming, fault-prone and complex task. Up to now a tool-kit is not available to systematically support the VLSI design task in a single coherent environment and along a seamless design flow for various digital semiconductor-technologies. In this contribution, we report on a completely technology-independent and graph-theoretical approach for the VLSI design of massively parallel MRF processing devices. The paper is finalized by selected results, which show generated graphs, synthesis results and prototypical implementations using FPGA technologies. All together these results demonstrate the capability of the proposed graph-theoretical approach and manifest the industrial relevance of the developed tool-kit.
Thermal management of on-chip caches through power density minimization
Authors: Ja Chun Ku, Serkan Ozdemir, Gokhan Memik, Yehea Ismail
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Various architectural power reduction techniques have been proposed for on-chip caches in the last decade. In this paper, we first show that these power reduction techniques can be suboptimal when thermal effects are considered. Then, we propose a thermal-aware cache power-down technique that minimizes the power density of the active parts by turning off alternating rows of memory cells instead of entire banks. The decrease in the power density lowers the temperature, which then exponentially reduces the leakage. Thus, leakage power of the active parts is reduced in addition to the power eliminated from the parts that are turned off. Simulations based on SPEC2000, NetBench, and MediaBench applications in a 70-nm technology show that the proposed thermal-aware architecture can reduce the total energy consumption by 53% compared to a conventional cache, and 14% compared to a cache architecture with thermal-unaware power reduction scheme. Second, we show a block permutation scheme that can be used during the design of the caches to maximize the distance between blocks with consecutive addresses. Because of spatial locality, blocks with consecutive addresses are likely to be accessed within a short time interval. By maximizing the distance between such blocks, we minimize the power density of the hot spots in the cache, and hence reduce the peak temperature. This, in return, results in an average leakage power reduction of 8.7% compared to a conventional cache without affecting the dynamic power and the latency. Overall, both of our architectures add no extra run-time penalty compared to the thermal-unaware power reduction schemes, yet they result in a significant reduction in the total energy consumption of a cache.
Designing a summative evaluation tool for the online class
Authors: Amany Saleh, Marcia Lamkin
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

Research has found that one of the biggest weaknesses of online education is the lack of consistent evaluation which provides input on the effectiveness of this methodology (McVay Lynch, 2002). The authors of this article developed and conducted pilot testing for a summative evaluation tool that can be used to provide such feedback. In the development of this instrument, the authors addressed issues that traditional class evaluation tools cannot address, such as course delivery, instructor's online input, and effectiveness of the medium.