ppxscal/embedding_network huggingface dataset:
Computer Diagnosis - Will it help cure you or kill you?
Venue: Computer (1970)

Our Forum editor, Harry Larson, was diligently reading his L. A. Times last April 26 and he ran across a nationally syndicated column by the well-known Dr. Walter Alvarez. In his column, Dr. Alvarez expressed some grave doubts about computer diagnosis as substituted for the personal patient interview by a competent physician. The column and the exchange of letters that followed make interesting reading and are reprinted below. After reading them you may have some comments of your own ... if so, we'd like to hear from you. -Ed. 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
Evaluating the Performance of Basic Linear Algebra Subroutines on a Torus Array Processor
Authors: Ahmed S. Zekri, Stanislav G. Sedukhin
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

The basic linear algebra subroutines (BLAS) are stan- dard operations to efficiently solve the linear algebra prob- lems on high performance and parallel systems. In this pa- per, we study the implementation of some important BLAS operations on a N×N torus array processor. We show that the performance of the Level-3 BLAS represented by the n×n matrix multiply-add operation, n>N, approaches the theoretical peak as n increases since the degree of data reusing is high. While the performance of Level-1 and Level-2 BLAS operations is low as a result of low data reusing. Fortunately, many applications are based on inten- sive use of Level-3 BLAS with small percentage of Level-1 and Level-2 BLAS.
Mixing It Up
Authors: David H. Albonesi
Venue: IEEE Micro (2007)

Micro's editor in chief introduces the topics covered by the four articles in this general-interest issue: an interconnection network using highly integrated photonic technology; the ManySim simulation framework for future large-scale chip-multiprocessors; the SimWattch simulation framework, which integrates the Simics functional simulator with the SimpleScalar/Wattch microarchitecture simulators; and self-configuring embedded systems.
Optical Flow Computation on Compute Unified Device Architecture
Authors: Yoshiki Mizukami, Katsumi Tadamura
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In this study, the implementation of an image processing technique on Compute Unified Device Architecture (CUDA) is discussed. CUDA is a new hardware and software architecture developed by NVIDIA Corporation for the generalpurpose computation on graphics processing units. CUDA features an on-chip shared memory with very fast general read and write access, which enables threads in a block to share their data effectively. CUDA also provides a userfriendly development environment through an extension to the C programming language. This study focused on CUDA implementation of a representative optical flow computation proposed by Horn and Schunck in 1981. Their method produces the dense displacement field and has a straightforward processing procedure. A CUDA implementation of Horn and Schunck's method is proposed and investigated based on simulation results.
The Automatic Defense Mechanism for Malicious Injection Attack
Authors: Jin-Cherng Lin, Jan-Min Chen
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Injection attack is a technique to inject codes into a computer program or system by taking advantage of the unchecked assumptions the system makes about its inputs. The purpose of the injected code is typically to bypass or modify the originally intended functionality of the program. It is popular in system hacking or cracking to gain information, Privilege escalation or unauthorized access to a system [13]. Many application's security vulnerabilities result from generic injection problems. Examples of such vulnerabilities are SQL injection, Shell injection and Script injection (Cross Site Scripting). Some applications attempt to protect themselves by filtering malicious input data, but it may not be viable to modify the source of such components (either because the code was shipped in binary form or because the license agreement is prohibitive). We have tried to develop a defense mechanism that can automatically produce a proper input validation function on security gateway to filter malicious injection. The security gateway is allocated in front of application server to eliminate malicious injection vulnerabilities. To verify the efficiency of the tool, we pick the websites made up of some Web applications that often contain third-party vulnerable components shipped in binary form. Among these experiments, our defense mechanism has proved their efficiency to avoid malicious injection attack. Keywords Black box testing, Malicious injection, Input validation, Security gateway.
Etching characteristics of photoresist and low-k dielectrics by Ar/O2 ferrite-core inductively coupled plasmas
Authors: Hyoun Woo Kim, Jong Woo Lee, Woon Suk Hwang, Beom Hoan O, Seung Gol Lee, Se-Geun Park, Joohee Kim, Duck Jin Chung, Sung Pil Chang, Young-Chang Joo, Junghoon Joo, Chin Wook Chung, Wan Jae Park, Chang-Jin Kang, Sukho Joo, Soon Oh Park, Chung-Gon Yoo, Sung Kyeong Kim, Joung Ho Lee, Sang-Deog Cho, Dae-Kyu Choi, Keeho Kim, Jeong-Yeol Jang
Venue: Microelectronic Engineering (2008)

We have investigated the characteristics of Ar/O"2 plasmas in terms of the photoresist (PR) and low-k material etching using a ferrite-core inductively coupled plasma (ICP) etcher. We found that the O"2/(O"2+Ar) gas flow ratio significantly affected the PR etching rate and the PR to low-k material etch selectivity. Fourier transform infrared spectroscopy (FTIR) and HF dipping test indicated that the etching damage to the low-k material decreased with decreasing O"2/(O"2+Ar) gas flow ratio.
A note on fibered projective plane geometry
Authors: A. Bayar, S. Ekmekçi, Z. Akça
Venue: Information Sciences: an International Journal (2008)

In this work, we consider the role of the triangular norm in the theory of fibered projective planes as introduced in Kuijken and Van Maldeghem [L. Kuijken, H. Van Maldeghem, Fibered geometries, Discrete Mathematics 255 (2002) 259-274]. As a way of example, we consider fibered harmonic conjugates and a fibered version of Reidemeister's condition.
SOR: a practical system for ontology storage, reasoning and search
Authors: Jing Lu, Li Ma, Lei Zhang, Jean-Sébastien Brunner, Chen Wang, Yue Pan, Yong Yu
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Ontology, an explicit specification of shared conceptualization, has been increasingly used to define formal data semantics and improve data reusability and interoperability in enterprise information systems. In this paper, we present and demonstrate SOR (Scalable Ontology Repository), a practical system for ontology storage, reasoning, and search. SOR uses Relational DBMS to store ontologies, performs inference over them, and supports SPARQL language for query. Furthermore, a faceted search with relationship navigation is designed and implemented for ontology search. This demonstration shows how to efficiently solve three key problems in practical ontology management in RDBMS, namely storage, reasoning, and search. Moreover, we show how the SOR system is used for semantic master data management.
Engineering Software Correctness
Authors: Rex Page
Venue: Journal of Functional Programming (2007)

Design and quality are fundamental themes in engineering education. Functional programming builds software from small components, a central element of good design, and facilitates reasoning about correctness, an important aspect of quality. Software engineering courses that employ functional programming provide a platform for educating students in the design of quality software. This pearl describes experiments in the use of ACL2, a purely functional subset of Common Lisp with an embedded mechanical logic, to focus on design and correctness in software engineering courses. Students find the courses challenging and interesting. A few acquire enough skill to use an automated theorem prover on the job without additional training. Many students, but not quite a majority, find enough success to suggest that additional experience would make them effective users of mechanized logic in commercial software development. Nearly all gain a new perspective on what it means for software to be correct and acquire a good understanding of functional programming.
HPDC 2005 Organization
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

The Large Hadron Collider (LHC) at CERN, the European Organization for Nuclear Research, needs to produce unprecedented volumes of data when it starts operation in 2007. To provide for its computational needs, the LHC computing grid (LCG) should be deployed as a worldwide computational grid service, providing the middleware upon which the physics analysis for the LHC can be carried out. In 2003, versions of this middleware were deployed which were based on the middleware produced by the European Data Grid project (EDG). In 2004 the LCG-2 release, which consisted of the EDG middleware with some minor modifications, was deployed for use by the LHC experiments. A series of data challenges by these experiments were the first real experiment production use of LCG. During the course of the data challenges, many issues and problems were exposed which had not shown up in more limited tests. The deployment, service and development teams worked closely with the experiments to understand these issues and while some of the problems were solved during the data challenges, others exposed fundamental problems with the middleware as deployed in LCG-2. One of these fundamental problems was the performance under real load of the catalog component provided by EDG, the replica location service. To solve these problems a new component was designed, the LCG file catalog (LFC). The LFC moves away from the replica location service model used in previous LCG releases, towards a hierarchical file system model which is more like a UNIX file system. It also adds missing functionality which was requested by the experiments. This paper presents the architecture and implementation of the LFC and evaluates it in a series of performance tests, with up to forty million entries and one hundred requesting threads from multiple clients. The results show good scalability up to the limits of these tests, and compare favourably with other grid catalog implementations. 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
Detection of Hidden Information in Webpages Based on Randomness
Authors: Junwei Huang, Xingming Sun, Huajun Huang, Gang Luo
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

An effective detection algorithm based on the randomness is devised in this paper for stego-webpages with different steganographies. The parts where secret information embedded in a webpage can generally be represented as two states, which can be described in binary code string. The randomness of the states varies a great deal depending on the webpage part carrying secret information or not. This paper presents a procedure to transform the binary code string into octal string to capture the randomness, from which some statistical features have been discovered. The theoretical description and proof are given that these features can be employed as a criterion to test whether a webpage contains secret information or not. Experiments show that this algorithm can effectively detect the stego-webpages based on letter changing in tags and invisible characters embedding.
Checklists for Software Engineering Case Study Research
Authors: Martin Host, Per Runeson
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

Case study is an important research methodology for software engineering. We have identified the need for checklists supporting researchers and reviewers in conducting and reviewing case studies. We derived checklists for researchers and reviewers respectively, using systematic qualitative procedures. Based on nine sources on case studies, checklists are derived and validated, and hereby presented for further use and improvement.
Artificial Immune System with ART Memory Hibridization
Authors: Jose Lima Alexandrino, Cleber Zanchettin, Edson Costa de Barros Carvalho Filho
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

The present work proposes the architecture Clonart (Clonal Adaptive Resonance Theory) that employs many different techniques like intelligent operators, clonal selection principle, local search, memory antibodies and ART clusterization in order to increase the performance of the algorithm. The approach uses a mechanism similar to the ART 1 network for storing a population of memory antibodies that will be responsible for the acquired knowledge of the algorithm. This characteristic allows the algorithm a self-organization of the antibodies in accordance with the complexity of the database used.
Variation-aware performance verification using at-speed structural test and statistical timing
Authors: Vikram Iyengar, Jinjun Xiong, Subbayyan Venkatesan, Vladimir Zolotov, David Lackey, Peter Habitz, Chandu Visweswariah
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Meeting the tight performance specifications mandated by the customer is critical for contract manufactured ASICs. To address this, at speed test has been employed to detect subtle delay failures in manufacturing. However, the increasing process spread in advanced nanometer ASICs poses considerable challenges to predicting hardware performance from timing models. Performance verification in the presence of process variation is difficult because the critical path is no longer unique. Different paths become frequency limiting in different process corners. In this paper, we present a novel variation-aware method based on statistical timing to select critical paths for structural test. Node criticalities are computed to determine the probabilities of different circuit nodes being on the critical path across process variation. Moreover, path delays are projected into different process corners using their linear delay function forms. Experimental results for three multimillion gate ASICs demonstrate the effectiveness of our methods.
Hybrid Computer Solution of Optimal Control Problems
Authors: G. C. Michales, V. Gourishankar
Venue: IEEE Transactions on Computers (1971)

This paper discusses limitations which arise when a method proposed by Miura et al. [1] is used for solving certain two-point boundary value problems on the hybrid computer. It is shown that the method proposed in [1] will not work in all cases. An example where the method fails is given. However, to emphasize the basic elegance and usefulness of this method, an extension to cover a more general target set is also introduced.
Design of an intelligent manufacturing scheduling and control system using fuzzy logic: Sensitivity analysis and parameter optimization
Authors: M. A. S. Monfared, J. B. Yang
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2004)

Techniques and concepts from fuzzy logic theory, control theory, and optimisation theory are integrated together, to provide a novel intelligent manufacturing control system that operates in real-time, and is capable of responding to both structural and order related disturbances in a fully automated manner. In this paper we further developed our previous research on a second order intelligent scheduling and control system by performing an extensive sensitivity analysis and parameter optimization in order to achieve an optimal scheduling and control system.
Smart bag: managing home and raising children
Authors: Min Kyung Lee, Scott Davidoff, John Zimmerman, Anind K. Dey
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

Dual-income families experience stress as they attempt to manage the conflicting responsibilities of work, school, home, and enrichment activities. Opportunities exist for technology to provide support in managing their children's activities, helping parents feel more in control of their lives. In this paper, we explore opportunities to support children's activities. Based on our contextual fieldwork with dual-income families, we suggest a concept of the Smart Bag, which addresses two design opportunities: (i) a reminder system that helps people remember their schedules and what they need to take, and (ii) a reminder system that allows parents to engage in parenting.
Mixing Wheat with the Chaff: Creating Useful Test Data for IDS Evaluation
Authors: William H. Allen
Venue: IEEE Security and Privacy (2007)

Testing and validating new anomaly-based intrusion detection techniques requires a record of typical (that is, normal) behaviors for use in constructing statistical models, training learning-based systems, or creating rules that describe acceptable actions.
Modelling surface radioactive, chemical and oil spills in the Strait of Gibraltar
Authors: R. Periáñez, A. Pascual-Granged
Venue: Computers Geosciences (2008)

A model that simulates the dispersion of chemical/radioactive and oil spills in the Strait of Gibraltar has been developed. Water currents over the Strait have been obtained from a hydrodynamic model. Computed tides and residual currents have been compared with observations in the area. The dispersion model, based on a particle-tracking technique, is solved off-line. Standard tidal analysis, carried out over results provided by the hydrodynamic model, is applied to obtain currents at any time and position of the Strait. Specific processes for each contaminant (decay of radioactive material, oil evaporation and decomposition) are included and simulated by means of a stochastic method. A Monte Carlo method is applied for turbulent diffusion. The model can deal with instantaneous and continuous releases. MatLab graphic user interfaces have been developed to introduce input data and visualize simulation results. Some dispersion calculations have been carried out. In general, contaminants are flushed towards the east due to the residual currents. Nevertheless, dominant east winds tend to retain contamination in the Strait and to enhance mixing. This is also the case if the release occurs close to the coast, where currents are weaker than in the central part of the Strait.
A real-time sensor network visualization system using KVS: Kyoto visualization system
Authors: Norihisa Segawa, Yukio Yasuhara, Naohisa Sakamoto, Tomoki Yoshihisa, Yasuo Ebara, Koji Koyamada
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

We report the system that collects the data from the sensor network and visualizes the data on real time by three dimensions on a computer. It becomes possible for this system to make a user make the measurement data on space intuitive.
Transmission Scheduling for Multimedia Traffic over Wireless Cellular Networks with Capture
Authors: Polychronis Koutsakis
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

In this paper we design and study the performance of a Multiple Access Control (MAC) scheme for the multiplexing and the integrated delivery of voice, mobile messaging, IP and H.264 videoconference traffic over a high-speed next-generation cellular TDMA channel with errors and capture. To the best of our knowledge, this is one of the first papers in the literature investigating the integration of H.264 video traffic with other types of traffic over wireless networks. Our results show that the proposed scheme achieves high throughput results while preserving the strict Quality of Service (QoS) requirements of each traffic type, and outperforms an efficient scheme previously proposed in the literature.
An Ant Colony System Hybridized with Randomized Algorithm for TSP
Authors: Chengming Qi
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Ant algorithms are a recently developed, population-based approach which has been successfully applied to several NP-hard combinatorial optimization problems. In this paper, through an analysis of the constructive procedure of the solution in the Ant Colony System (ACS),we present an Ant Colony System Hybridized with Randomized Algorithm( RAACS). In RAACS, only partial cities are randomly chosen to compute the state transition probability. Experimental results for solving the Traveling Salesman Problems( TSP) with both ACS and RAACS demonstrate that averagely speaking, the proposed method is better in both the quality of solutions and the speed of convergence compared with the ACS.
Multi-point queries in large spatial databases
Authors: Hoong Kee Ng, Hon Wai Leong
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

This paper revisits multi-point range query (MPRQ) for 2-d spatial database. In a previous paper, we introduced an efficient algorithm, PRQ, to answer the query for the case where database resides in main memory. This paper extends the algorithm to the general case in which the database is large and has to reside on disk. The MPRQ is defined as: Given a set of query points, P = {p1, p2, ..., pn}, and a search distance d, report all points in the spatial database that are within a distance d of some point pi in P. The simple method of performing Repeated Range Query (RRQ), i.e. the standard range query for each query point pi (1 ≤ i ≤ n) and combining the results is inefficient as it involves multiple searches on the database. We show that PRQ-Disk still achieve better results and outperform RRQ-Disk, as in the case of main memory. Extensive experiments using various real-life datasets, different R-tree variants (including bulk-loaded ones), over different query paths P, search distances d, and LRU buffering show that PRQ-Disk outperforms RRQ-Disk in terms of both query time and I/Os.
Segmentation of three-dimensional objects from background in digital holograms
Authors: C. P. Mc Elhinney, J. B. McDonald, Albertina Castro, Yann Frauel, Bahram Javidi, T. J. Naughton
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

We present a technique for performing segmentation of three-dimensional objects encoded using in-line digital holography from the scenes background. We create a volume of reconstructions through numerically reconstructing a digital hologram at a range of depths. For each reconstruction a variance map is created through calculating variance about a neighbourhood for each of the reconstructions pixels. We can then classify a pixel as object or background by thresholding the maximum variance of every pixel over all depths. We present segmentation results for objects of low and high contrast.