ppxscal/embedding_network huggingface dataset:
Application of Modified Backpropagation Algorithm to the Prediction of the Chloride Ion Concentration in Cracked Concrete
Authors: Xinzhu Zhou, Jianjun Zheng, Kefeng Mao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Chloride ions will initiate the corrosion of reinforced steel in concrete once the concentration on the steel surface attains its critical value, resulting in concrete cracking, spalling, and debonding between the concrete and steel bars. Therefore, it is essential to determine the chloride ion concentration in cracked concrete in order to control and monitor the premature deterioration of reinforced concrete structures. This paper discusses an application of the modified backpropagation algorithm to the prediction of the chloride ion concentration in cracked concrete. First, three possible diffusion mechanisms of chloride ions into concrete cracks are reviewed and the primary factors that affect the diffusive process are identified. A modified backpropagation algorithm is then used to evaluate the chloride ion concentration in cracked concrete. Finally, the theoretical prediction of the chloride ion concentration in cracked concrete is verified with experimental results obtained from the literature.
An Internet Query Language based on Intuitionistic Linear Logic
Authors: Keehang Kwon, JaeWoo Kim, Jang-Wu Jo
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

We propose an internet query language based on intuitionistic linear logic. This language extends regular expressions with linear implications and additive (classical) conjunctions. To be precise, it allows goals of the form D -\circ G and G_1&G_2 where D is a text and G is a goal. The first goal is intended to be solved by adding D to the current text and then solving G. This goal is flexible in controlling the current text dynamically. The second goal is intended to be solved by solving both G_1 and G_2 from the current text. This goal is particularly useful for internet search.
Random-Accessible Compressed Triangle Meshes
Authors: Sung-eui Yoon, Peter Lindstrom
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

With the exponential growth in size of geometric data, it is becoming increasingly important to make effective use of multilevel caches, limited disk storage, and bandwidth. As a result, recent work in the visualization community has focused either on designing sequential access compression schemes or on producing cache-coherent layouts of (uncompressed) meshes for random access. Unfortunately combining these two strategies is challenging as they fundamentally assume conflicting modes of data access. In this paper, we propose a novel order-preserving compression method that supports transparent random access to compressed triangle meshes. Our decompression method selectively fetches from disk, decodes, and caches in memory requested parts of a mesh. We also provide a general mesh access API for seamless mesh traversal and incidence queries. While the method imposes no particular mesh layout, it is especially suitable for cache-oblivious layouts, which minimize the number of decompression I/O requests and provide high cache utilization during access to decompressed, in-memory portions of the mesh. Moreover, the transparency of our scheme enables improved performance without the need for application code changes. We achieve compression rates on the order of 20:1 and significantly improved I/O performance due to reduced data transfer. To demonstrate the benefits of our method, we implement two common applications as benchmarks. By using cache-oblivious layouts for the input models, we observe 2?6 times overall speedup compared to using uncompressed meshes.
Chain programming over difference constraints
Authors: K. Subramani, John Argentieri
Venue: Nordic Journal of Computing (2006)

Chain Programming is a restricted form of Linear Programming with a number of interesting properties. A Chain Program is characterized by a total ordering on the program variables (of a linear program). In other words, the constraints x1 ≤ x2...xn are either implicitly or explicitly part of the constraint system defined by a linear program. At the present juncture, it is not clear whether an arbitrary linear program augmented with a chain is easier to solve than linear programs in general, either asymptotically or computationally; however, it is definitely the case that Chain Programs possess a number of useful properties. In this paper, we restrict ourselves to linear programs that are constituted entirely of difference constraints. For such linear programs (also called Difference Constraint Systems), we show that the total ordering of the program variables results in an elegant divide and conquer algorithm for the problem of feasibility testing. This approach can be parallelized in straightforward fashion to run on any SIMD or MIMD architecture, thereby greatly enhancing its effectiveness. Inasmuch as difference constraint logic is an integral part of a number of verification problems in both Model-checking and real-time scheduling, our result is of particular importance to these communities. Secondly, difference constraint systems are duals of shortest path problems in directed graphs and hence our study is important from the perspectives of the Artificial Intelligence and Operations Research communities as well. One of the surprising consequences of our research is the establishment of a link between Chain Programs over Difference Constraints (CPD) and a specialized class of Totally Unimodular (TUM) matrices called interval matrices. This connection makes it likely that there exists a more efficient algorithm for the problem of feasibility testing in CPDs.
Information-theoretic inference of large transcriptional regulatory networks
Authors: Patrick E. Meyer, Kevin Kontos, Frederic Lafitte, Gianluca Bontempi
Venue: EURASIP Journal on Bioinformatics and Systems Biology (2007)

The paper presents MRNET, an original method for inferring genetic networks from microarray data. The method is based on maximum relevance/minimum redundancy (MRMR), an effective information-theoretic technique for feature selection in supervised learning. The MRMR principle consists in selecting among the least redundant variables the ones that have the highest mutual information with the target. MRNET extends this feature selection principle to networks in order to infer gene-dependence relationships from microarray data. The paper assesses MRNET by benchmarking it against RELNET, CLR, and ARACNE, three state-of-the-art information-theoretic methods for large (up to several thousands of genes) network inference. Experimental results on thirty synthetically generated microarray datasets show that MRNET is competitive with these methods.
Optimal pattern recognition procedures and their application
Authors: I. V. Sergienko, A. M. Gupal
Venue: Cybernetics and Systems Analysis (2007)

Results on Bayesian classification procedures, optimal on structures such as Markov chain and independent features, are reviewed. Numerical results of predicting protein secondary structure based on Bayesian classification procedures on non-stationary Markov chains are discussed. Complementarity relations for encoding bases in one DNA strand are presented.
Aspects of Applicative Programming for Parallel Processing
Authors: D. P. Friedman
Venue: IEEE Transactions on Computers (1978)

Early results of a project on compiling stylized recursion into stackless iterative code are reviewed as they apply to a target environment with multiprocessing. Parallelism is possible in executing the compiled image of argument evaluation (collateral argument evaluation of Algol 68), of data structure construction when suspensions are used, and of functional combinations. The last facility provides generally, concise expression for all operations performed in Lisp by mapping functions and in APL by typed operators; there are other uses as well.
Software Vulnerability Assessment Version Extraction and Verification
Authors: Martin Boldt, Bengt Carlsson, Roy Martinsson
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Software vendors do not on a regular basis label their products with the exact software version. This is contrary to branded household products where model numbers and serial numbers allows the consumer to identify the product and get assistance if something goes wrong. We investigated version and product information within 8468 different software programs, where freeware and shareware showed a considerable lack of relevant information. A tool is proposed for identifying relevant version information and for verifying potential threats matched against a software vulnerability database. We suggest that software vendors in the future conform to general conventions of storing version information in a standardized way.
Storage optimization for large-scale distributed stream-processing systems
Authors: Kirsten Hildrum, Fred Douglis, Joel L. Wolf, Philip S. Yu, Lisa Fleischer, Akshay Katta
Venue: ACM Transactions on Storage (TOS) (2008)

We consider storage in an extremely large-scale distributed computer system designed for stream processing applications. In such systems, both incoming data and intermediate results may need to be stored to enable analyses at unknown future times. The quantity of data of potential use would dominate even the largest storage system. Thus, a mechanism is needed to keep the data most likely to be used. One recently introduced approach is to employ retention value functions, which effectively assign each data object a value that changes over time in a prespecified way &lsqb;Douglis et al.2004&rsqb;. Storage space for data entering the system is reclaimed automatically by deleting data of the lowest current value. In such large systems, there will naturally be multiple file systems available, each with different properties. Choosing the right file system for a given incoming stream of data presents a challenge. In this article we provide a novel and effective scheme for optimizing the placement of data within a distributed storage subsystem employing retention value functions. The goal is to keep the data of highest overall value, while simultaneously balancing the read load to the file system. The key aspects of such a scheme are quite different from those that arise in traditional file assignment problems. We further motivate this optimization problem and describe a solution, comparing its performance to other reasonable schemes via simulation experiments.
ParzenWindows Estimation Using Laplace Kernel: A Novel Parametric Analysis with Information Content
Authors: Jingsong He, Jian Tang, QianSheng Fang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Parzen windows estimation is one of the classical nonparametric methods in the field of machine learning and pattern classification, and usually uses Gaussian density function as the kernel. Although the relation between the kernel density estimation (KDE) and low-pass filtering is well known, it is vary difficult to setting the parameters of the other kinds of density functions. This paper proposes a novel method to deal with the parameters of Laplace kernel through measuring the degree of exchanged information among interpolating points. Experimental results showed that the proposed method can improve the performance of Parzen windows significantly.
Recognition of Broken Characters from Historical Printed Books Using Dynamic Bayesian Networks
Authors: L. Likforman-Sulem, M. Sigelle
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

This paper investigates the application of dynamic Bayesian networks (DBNs) to the recognition of degraded characters from historical printed books. This framework allows us to capture the 2D nature of character images by the coupling of two HMMs (Hidden Markov Models). The vertical HMM observes image columns while the horizontal HMM observes image rows respectively. Two coupled DBN architectures are proposed to model interactions between these two streams. We present experiments on real degraded characters extracted from an ancient printed book (17th century). These experiments demonstrate that coupled architectures significantly better cope with broken characters than non coupled ones and than discriminative methods such as SVMs.
A natural language processing approach to automatic plagiarism detection
Authors: Chi-Hong Leung, Yuen-Yan Chan
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

The problem of plagiarism has existed for a long time but with the advance of information technology the problem becomes worse. It is because there are many electronic versions of published materials available to everyone. The Web is an important and common source for plagiarism. Some plagiarism detection programs (such as Turnitin) were developed to attempt to deal with this problem. To determine whether an article is copied from the Web or other electronic sources, the plagiarism detection program should calculate the similarity between two articles. However, it is often difficult to detect plagiarism accurately after modification of the copied contents. For example, it is possible to simply replace a word with its synonym (e.g. "program" -- "software ") and change the entire sentence structure. Most plagiarism detection programs can only compare whether two words are the same lexically and count how many matched words are there in a paper. Thus, if the copied materials are modified deliberately, it becomes difficult to detect plagiarism. Application of natural language processing can help to resolve this kind of problem. The underlying syntactic structure and semantic meaning of two sentences can be compared to reveal their similarity. There are several steps in the matching procedure. First, the thesaurus (or the lexical hierarchical structure) is referenced to find out the synonyms, broader terms and narrower terms used in the paper being checked. Then, the paper will be compared with the documents in the database. Wordnet is a typical example of the thesaurus that can be used for this purpose. If it is suspected that the paper contains some contents from the database, the sentences of the paper may be parsed to construct their parsing trees and semantic representations for further detailed comparison. The context free grammar and the case grammar are used to represent the syntactic structure and semantic meaning of sentences in the system. It is found that plagiarism that cannot be detected by the traditional methods can be identified by this new approach.
Guest Editor's Introduction: Computational Science and Engineering for the US Department of Defense
Authors: Douglass E. Post
Venue: Computing in Science and Engineering (2007)

The US Department of Defense is reducing its dependence on the traditional "design, build, break, and fix" paradigm for designing and testing weapons systems by supplementing empirical testing with computational science and engineering. This introduction to the theme issue explores how the DoD's computational systems have contributed to various scientific works.
Device-aware yield-centric dual-Vt design under parameter variations in nanoscale technologies
Authors: Amit Agarwal, Kunhyuk Kang, Swarup Bhunia, James D. Gallagher, Kaushik Roy
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Dual-Vt design technique has proven to be extremely effective in reducing subthreshold leakage in both active and standby mode of operation of a circuit in submicrometer technologies. However, aggressive scaling of technology results in different leakage components (subthreshold, gate and junction tunneling) to become significant portion of total power dissipation in CMOS circuits. High-Vt devices are expected to have high junction tunneling current (due to stronger halo doping) compared to low-Vt devices, which in the worst case can increase the total leakage in dual-Vt design. Moreover, process parameter variations (and in turn Vt variations) are expected to be significantly high in sub-50-nm technology regime, which can severely affect the yield. In this paper, we propose a device aware simultaneous sizing and dual-Vt design methodology that considers each component of leakage and the impact of process variation (on both delay and leakage power) to minimize the total leakage while ensuring a target yield. Our results show that conventional dual-Vt design can overestimate leakage savings by 36% while incurring 17% average yield loss in 50-nm predictive technology. The proposed scheme results in 10%-20% extra leakage power savings compared to conventional dual-Vt design, while ensuring target yield: This paper also shows that nonscalability of the present way of realizing high-Vt devices results in negligible power savings beyond 25-nm technology. Hence, different dual-Vt process options, such as metal gate work function engineering, are required to realize high-performance and low-leakage dual-Vt designs in future technologies.
Ad hoc transient communities to enhance social interaction and spread tutor responsibilities
Authors: Peter Sloep, Liesbeth Kester, Francis Brouns, Peter van Rosmalen, Fred de Vries, Marcel de Croock, Rob Koper
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

A Learning Network is an ensemble of individual users, institutions and learning resources which are mutually connected through and supported by information and communication technologies. Learning Networks are particularly attractive to self-directed learners, who themselves decide on their learning programme as well as on the timing, pace and place of their studies. Such learners may easily become isolated, which is detrimental to their studies. Supporting them, furthermore, may rapidly lead to staff overload. This paper proposes that setting up peer support in ad hoc, transient communities helps tackle both problems. An overview of pertinent literature is presented to substantiate this proposal.
An overlapping scan architecture for reducing both test time and test power by pipelining fault detection
Authors: Xiaoding Chen, Michael S. Hsiao
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

We present a novel scan architecture for simultaneously reducing test application time and test power (both average and peak power). Unlike previous works where the scan chain is partitioned only based on the excitation properties of the flip-flops (FFs), our work considers both the excitation and propagation properties of the scan FFs. In the proposed scan architecture, the scan chain is partitioned to maximize the overlapping between the excitation and propagation on different fault sets. The scan architecture also allows the entire set of detectable faults in the circuit under test (CUT) to be detected with only a portion of the scan elements active at a time, and thereby completely eliminates the need for the "serial full-scan" mode which is inefficient for both the test time and test power. Experimental results show that by introducing minimal hardware overhead, and without sacrificing fault coverage, an average peak power reduction of 22.8%, average power reduction of 41.6%, and an average reduction of 18.5% on the test application time can be achieved, compared with the ordinary full-scan architecture.
Computing Epipolar Geometry from Unsynchronized Cameras
Authors: Ying Piao, Jun Sato
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

Recently, many application systems have been developed by using a large number of cameras. If the 3D points are observed from synchronized cameras, the multiple view geometry of these cameras can be computed and the 3D reconstruction of the scene is available. Thus, the synchronization of multiple cameras is essential. In this paper, we propose a method for finding synchronization of multiple cameras and for computing the epipolar geometry from uncalibrated and unsynchronized cameras. In particular we use the affine invariance on frame numbers of camera images for finding the synchronization. The proposed method is tested by using real image sequences taken from uncalibrated and unsynchronized cameras.
An experimental study of the impact of visual semantic feedback on novice programming
Authors: Christopher D. Hundhausen, Jonathan Lee Brown
Venue: Journal of Visual Languages and Computing (2007)

Prior empirical studies of programming have shown that novice programmers tend to program by exploration, relying on frequent compilation and execution of their code in order to make progress. One way visual and end-user programming environments have attempted to facilitate this exploratory programming process is through their support of ''live'' editing models, in which immediate visual feedback on a program's execution is provided automatically at edit time. Notice that the notion of ''liveness'' actually encompasses two distinct dimensions: (a) the amount of time a programmer must wait between editing a program and receiving visual feedback (feedback delay); and (b) whether such feedback is provided automatically, or whether the programmer must explicitly request it (feedback self-selection). While a few prior empirical studies of ''live'' editing do exist, none has specifically evaluated the impact of these dimensions of ''live'' editing within the context of the imperative programming paradigm commonly taught in first-semester computer science courses. As a preliminary step toward that end, we conducted an experimental study that investigated the impact of feedback self-selection on novice imperative programming. Our within-subjects design compared the impact of three different levels of feedback self-selection on syntactic and semantic correctness: (a) no visual feedback at all (the No Feedback treatment); (b) visual feedback, in the form of a visualization of the program's execution state, provided on request when a ''run'' button is hit (the Self-Select treatment); and (c) visual feedback, in the form of a visualization of the program's execution state, updated on every keystroke (the Automatic treatment). Participants in the Automatic and Self-Select treatments produced programs that had significantly fewer syntactic and semantic errors than those of the No Feedback treatment; however, no significant differences were found between the Automatic and Self-Select treatments. These results suggest that, at least in the case of novice imperative programming environments, the benefits of delivering a continuously updated visual representation of a program's execution may fail to justify the substantial costs of implementing such feedback. We recommend that programming environment designers instead direct their efforts toward carefully considering when programmers will be ready to take advantage of the feedback that is coming toward them, along with what content will be of most benefit to them.
Advanced Architecture and Applications of Microcomputers
Authors: F. F. Coury
Venue: Computer (1976)

BY the time April, 1975 rolled around, most of us who are any way connected with microcomputers were up to our ears in papers, articles, and specifications on microcomputers, and inundated with announcements of seminars, conferences, courses, and tutorials on the same subject. Why, then, hold a workshop on "The Advanced Architecture and Applications of Microcomputers?" 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