ppxscal/embedding_network huggingface dataset:
An Integrated Database Programming and Querying Language with Support for Simultaneous Processing
Authors: Markus Kirchberg
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

The integration of query languages and programming languages is still a central problem of database research. In particular, issues with respect to the impedance mismatch are of interest. In this paper, we introduce features of a newly developed integrated database programming and querying language (i)DBPQL, which unites properties from object-oriented programming languages, query languages and database programming languages. Our main focus is on those integrated language properties that support simultaneous processing and their implications on other database system components.
Hybrid Modeling for Nosiheptide Fermentation Process Based on Prior Knowledge and SVM
Authors: Haifeng Sang, Weiqi Yuan, Zhijia Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Fermentation is always characteristic of multiple nonlinearity and time-varying. In order to know and control the fermentation process, many process models are used to formulate knowledge about process behavior. They are applied, e.g., to predict the process' future behavior and for state estimation when reliable on-line measuring techniques to monitor the key variables of the process are not available. The sources of information available for modeling come from two ways. First, some equilibrium equation can be described by first principles or obtained rules of thumb. Secondly, some information may still be hidden in the process data recorded during previous runs of the process. This work proposes a hybrid modeling strategy and a correcting method on-line. This hybrid model is a combination of classical fermentation models and support vector machines modeling based data. In case study, the hybrid model is applied in the Nosiheptide fermentation process. Results show that this method has a good estimation performance.
Inter-neuron communication strategies for spiking neural networks
Authors: F. Tuffy, L. J. McDaid, V. W. Kwan, J. Alderman, T. M. McGinnity, J. A. Santos, P. M. Kelly, H. Sayers
Venue: Neurocomputing (2007)

This paper investigates alternative approaches to conventional metal interconnect for inter-neuron communication in spiking neural networks (SNNs). Two communication methodologies are considered where the first approach uses a time multiplexing architecture (TMA) where neurons on one layer are sampled sequentially and the associated spikes are transmitted to neurons in subsequent layers via a single metal track. Pulse transmission delays occur between neuron layers and the consequence of these delays on the performance of a SNN is investigated. In the second approach, capacitive coupling (CC) between neuron layers is used as the communication method and a model that predicts the dependency of the coupling signals between neuron layers as a function of the neuron density, frequency and track loading is presented. To maximise the available bandwidth and also the number of frequencies that can be utilised, micro-electro-mechanical systems (MEMS) are considered because of their high Q value. Issues such as frequency matching, MEMS processing, fabrication of capacitors and associated oscillator/filter circuits are discussed. The paper investigates both approaches and a comparison between the silicon area occupied by these and conventional metal is given for a 1.5@mm CMOS process.
Building Ultralow-Latency Interconnection Networks Using Photonic Integration
Authors: Assaf Shacham, Keren Bergman
Venue: IEEE Micro (2007)

Ultralow-latency interconnection networks have become a necessity in modern high-performance computing systems. Recent advances in photonic integration technology are paving the way for a disruptive step in the design of these networks. We present SPINet, an optical interconnection network architecture designed for implementation using photonic integration, providing an end-to-end photonic path while completely avoiding optical buffering. SPINet resolves contentions through message dropping, but facilitates message recovery using a novel physical-layer acknowledgment protocol.
Investment Decision-Making Based on Fuzzy and Artificial Neural Network
Authors: Li Zhang, Aiping Yang, Wenzhan Dai
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

In this paper, the investment decision-making based on fuzzy and artificial neural network is proposed. The model of fuzzy estimation is put forward first and then architecture of BP neural network for decision-making is constructed. Finally the method is applied in investment decision-making and the results show the effectiveness of the proposed approach.
Fabrication of microfluidic channels derived from a UV/thermally cured preceramic polymer via a soft lithographic technique
Authors: Hong-Joo Lee, Tae-Ho Yoon, Dong-Pyo Kim
Venue: Microelectronic Engineering (2007)

Of SiC-based non-oxide ceramics, SiCN is considered to be one of the most interesting materials due to its unique physical and chemical properties such as high thermal conductivity, excellent thermal stability, high mechanical strength and chemical inertness. In the characterization of the mechanical properties, the characteristic values of the elastic modulus and hardness notably increased for the heat-treated SiCN. This study utilized the unique hydrophobic nature of the cured preceramic polymers after fabricating the non-oxide SiCN microchannels derived from the preceramic polymers that are solvent resistant and thermally stable. It is believed that the fabrication of microchannels using cured inorganic polymers has enormous potential in the field of microfluidics, where materials with a high optical transparency, thermal stability and chemical inertness are in demand.
SVM Theory and Its Application in Fault Diagnosis of HVDC System
Authors: Xi-Mei Liu, Wan-Yun Wei, Fei Yu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Support Vector Machine (SVM), which based on Statistical Learning Theory, is a universal machine learning method. The fault diagnosis of nonlinear and high-controllable High Voltage Direct Current (HVDC) system based on SVM method is proposed, which can take full advantage of effective ability and superiority of SVM in dealing with small samples, and solve many familiar problems in fault diagnosis of HVDC system. A simulation model of HVDC system is set up, and performance of SVM models under different parameters using polynomial kernel function and RBF kernel function respectively are compared. Results show the superiority of SVM method, also the validity and feasibility of the proposed method.
Optimal Fuzzy Control for a Time-Delay System Using Simulated Annealing: An Application to High-Performance Drilling
Authors: Rodolfo E. Haber, Angel Alique, Jose R. Alique
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

This paper shows a strategy for optimal tuning of a fuzzy controller to deal with time-varying delay based on simulated annealing. The main goal is to minimize the integral time absolute error (ITAE) performance index for a drilling force control system. The proposed strategy is applied in real-time force control of a high-performance drilling process. The results demonstrate that simulated annealing provides an optimal tuning of the fuzzy controller that means less ITAE and better transient response (less overshoot).
Understanding web credibility: a synthesis of the research literature
Authors: Jonathan Lazar, Gabriele Meiselwitz, Jinjuan Feng
Venue: Foundations and Trends in Human-Computer Interaction (2007)

As more of our communication, commerce, and personal data goes online, credibility becomes an increasingly important issue. How do we determine if our e-commerce sites, our healthcare sites, or our online communication partners are credible? This paper examines the research literature in the area of web credibility. This review starts by examining the cognitive foundations of credibility. Other sections of the paper examine not only the general credibility of web sites, but also online communication, such as e-mail, instant messaging, and online communities. Training and education, as well as future issues (such as CAPTCHAs and phishing), will be addressed. The implications for multiple populations (users, web developers, browser designers, and librarians) will be discussed.
Near Optimum and Highly Efficient Decision-Feedback Receivers for Direct Sequence Ultra-Wideband Radio
Authors: Jeng-Kuang Hwang, Yu-Lun Chiu, Rih-Lung Chung
Venue: Wireless Personal Communications: An International Journal (2007)

This paper investigates three decision- feedback receivers for Direct-Sequence Ultra-Wideband Radio (DS-UWB) based on two-channel BPSK modulation with ternary spreading code. A compact and insightful vector-matrix signal model is built up for receiver design under UWB channel dispersion over many consecutive symbols. First, we consider the design of a RAKE with Decision Feedback (RAKE-DF) receiver. Using the Gaussian approximation technique, we derive its analytic performance under no error propagation. It is shown that the RAKE-DF receiver suffers from a significant error floor due to the uncancelled pre-cursor ISI (or pre-ISI abbreviated). Next, we design the MMSE-DF receiver to achieve a better performance by suppressing the pre-ISI, too. However, the MMSE receiver requires costly matrix inversion. Then a new receiver is investigated as the third one, which is called the RAKE with Bi-Directional Decision Feedback (RAKE-BDDF) receiver, for efficiently canceling both the post-(cursor) ISI and pre-ISI at symbol rate. It cannot only attain the matched filter bound approximately, but also maintain a similar complexity as that of the RAKE-DF receiver. Simulation and semi-analytic BER curves are included for performance comparison of the three receivers in the presence of the CM2 and CM4 UWB channels.
A Component Model supporting Decomposition and Composition of Consumer Electronics Software Product Lines
Authors: Chong-Mok Park, Seokjin Hong, Kyoung-Ho Son, Jagun Kwon
Venue: Proceedings of the 11th International Software Product Line Conference (2007)

The component-based software engineering has been gaining attention in consumer electronics (CE) industry. New component models for CE software are emerging, but unfortunately there is no common standard established yet. Each of the proposed models focuses on satisfying some subset of requirements from CE software and there is no unified model that can handle all different requirements of CE software.We propose a component model for componentbased CE software development in the context of software product lines. The component model focuses on handling build-time structures of the software and attempts to provide a unified model that can support both componentization of legacy code and composition of new CE software in an efficient way. We also describe our experiences in prototyping a tool and applying it to one of our initial CE product line implementations.
The ghost in the browser analysis of web-based malware
Authors: Niels Provos, Dean McNamee, Panayiotis Mavrommatis, Ke Wang, Nagendra Modadugu
Venue: Proceedings of the first conference on First Workshop on Hot Topics in Understanding Botnets (2007)

As more users are connected to the Internet and conduct their daily activities electronically, computer users have become the target of an underground economy that infects hosts with malware or adware for financial gain. Unfortunately, even a single visit to an infected web site enables the attacker to detect vulnerabilities in the user's applications and force the download a multitude of malware binaries. Frequently, this malware allows the adversary to gain full control of the compromised systems leading to the ex-filtration of sensitive information or installation of utilities that facilitate remote control of the host. We believe that such behavior is similar to our traditional understanding of botnets. However, the main difference is that web-based malware infections are pull-based and that the resulting command feedback loop is looser. To characterize the nature of this rising thread, we identify the four prevalent mechanisms used to inject malicious content on popular web sites: web server security, user contributed content, advertising and third-party widgets. For each of these areas, we present examples of abuse found on the Internet. Our aim is to present the state of malware on the Web and emphasize the importance of this rising threat.
Video Abstraction Based on Relational Graphs
Authors: Su-lan Zhai, Bin Luo, Jin Tang, Chun-Yan Zhang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Video abstraction plays an important role in video browsing, video indexing, video retrieval and other video applications. In the paper, an automatic video abstraction method is developed based on relational graph representations. Firstly, a relational graph is constructed for all the frames in a video sequence. Secondly, the graph is partitioned into different connected subgraphs. Thirdly, Isomap is performed to reduce the dimensionality of the data set, and the output of Isomap is used as feature vector of the video frames. Lastly, a mixture model with model selection is introduced to generate the fine grain video abstraction with the centre of each clustering as the keyframes. Experiments are conducted on real world video sets with satisfying video abstraction results.
Testing concurrent programs using value schedules
Authors: Jun Chen, Steve MacDonald
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Concurrent programs are difficult to debug and verify because of the nondeterministic nature of concurrent executions. A particular concurrency-related bug may only show up under certain rarely-executed thread interleavings. Therefore, commonly used debugging methodologies, such as inserting print statements, are no longer sufficient for uncovering concurrency-related bugs. However, many existing bug detection methods, such as dynamic analysis and model checking, have a very high computational cost. In this paper, we introduce a new technique for uncovering concurrency-related bugs from multithreaded Java programs. Our technique uncovers concurrency-related bugs by generating and testing read-write assignment sequences, referred to as value schedules, of a multithreaded Java program. Our value-schedule-based technique distinguishes itself in its ability to avoid exploring superfluous program state space caused by speculative permutation on transitions. Therefore, our technique can achieve a higher degree of POR (Partial Order Reduction) than existing methods. We demonstrate our technique using some programs, with an implementation built using an explicit state model checker called JPF
Design of Interconnection Networks
Authors: Dennis Abts Cray, John Kim
Venue: Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects (2007)

Digital systems of all types are rapidly becoming communication limited. Movement of data, not arithmetic or control logic, is the factor limiting cost, performance, size, and power in these systems. Historically used only in high-end supercomputers and telecom switches, interconnection networks are now found in systems of all sizes and all types - from large supercomputers to small embedded systems-on-a-chip (SoC) and from inter-processor networks to router fabrics. Indeed, as system complexity and integration continues to increase, many designers are finding it more efficient to route packets, not wires.
A simulation study comparing weighted estimating equations with multiple imputation based estimating equations for longitudinal binary data
Authors: Caroline Beunckens, Cristina Sotto, Geert Molenberghs
Venue: Computational Statistics Data Analysis (2008)

Missingness frequently complicates the analysis of longitudinal data. A popular solution for dealing with incomplete longitudinal data is the use of likelihood-based methods, when, for example, linear, generalized linear, or non-linear mixed models are considered, due to their validity under the assumption of missing at random (MAR). Semi-parametric methods such as generalized estimating equations (GEEs) offer another attractive approach but require the assumption of missing completely at random (MCAR). Weighted GEE (WGEE) has been proposed as an elegant way to ensure validity under MAR. Alternatively, multiple imputation (MI) can be used to pre-process incomplete data, after which GEE is applied (MI-GEE). Focusing on incomplete binary repeated measures, both methods are compared using the so-called asymptotic, as well as small-sample, simulations, in a variety of correctly specified as well as incorrectly specified models. In spite of the asymptotic unbiasedness of WGEE, results provide striking evidence that MI-GEE is both less biased and more accurate in the small to moderate sample sizes which typically arise in clinical trials.
An Interactive Hyper Knowledge Discovery System for Chinese Medicine
Authors: Tongyuan Wang, Huzhan Zheng, Yanjiang Qiao
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

The proposed hyper knowledge discovery system is designed to facilitate domain users to interactively discover knowledge from complex data sets. At the first stage, this system integrates data preprocess, lexicon establishment and database construction together. Then it provides domain users with flexibility and fuzzy mechanism to retrieve information and mine knowledge interactively. The system introduces an approach to obtain joint probability distributions of an arbitrary number of variables of multi valued states. This is fundamental for mining correlation and causal relations from the complex data sources. To attain these objectives, the system creatively exploits the functionalities of the relational database and SQL engine to reduce programming while achieving good performance. All the functionalities are online and hence facilitate resource and knowledge sharing. Key words: hyper knowledge discovery system, data mining, interactive information search, fuzzy search, complex data source, multi valued state data source, database construction.
Structural Semi-Join: A light-weight structural join operator for efficient XML path query pattern matching
Authors: Seokhyun Son, Hyoseop Shin, Zhiwei Xu
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

Optimal evaluation of structural relationships between XML nodes is crucial for efficient processing of XML queries. Though stack-based structural join algorithms showed improved performance over the merge-based algorithms, the algorithms still suffer potential overhead in processing XML path expressions. This is mainly because the existing structural join algorithms have been designed for returning (ancestor, descendant) node pairs even when the actual processing of the XML path queries requires the structural join operators to return either descendant nodes only or ancestor nodes only, which makes a query processor further compute for elimination of unnecessary nodes from the results. To address this problem, this paper proposes a new operator called structural semi-join and the algorithms for efficient processing XML path queries. The experiments show that the proposed algorithms improve the performance of the XML path processing by up to an order of magnitude.
Concept Hierarchies Generation for Classification using Fuzzy Formal Concept Analysis
Authors: Wen Zhou, Zongtian Liu, Yan Zhao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

A large collection of formal concepts can be a hedge of the application of Formal Concept Analysis and is not directly comprehensible for a user. It is thus an important task to develop methods which help to overcome the problem of large number of extracted formal concepts. This paper proposes concept hierarchies learning for getting more concise concept representation method using fuzzy formal concept analysis. Then, concept hierarchies based classifier is produced. At the end, experiments show that the compression rate of concept hierarchy to concept lattice is obvious while preserving the accuracy of classification.
A simple proof for open cups and caps
Authors: Jakub erný
Venue: European Journal of Combinatorics (2008)

Let X be a set of points in general position in the plane. General position means that no three points lie on a line and no two points have the same x-coordinate. Y@?X is a cup (resp. cap) if the points of Y lie on the graph of a convex (resp. concave) function. Denote the points of Y by p"1,p"2,...,p"m according to the increasing x-coordinate. The set Y is open in X if there is no point of X above the polygonal line p"1,p"2,...,p"m. Valtr [P. Valtr, Open caps and cups in planar point sets, DCG (in press)] showed that for every two positive integers k and l there exists a positive integer g(k,l) such that any g(k,l)-point set in the plane in general position contains an open k-cup or an open l-cap. This is a generalization of the Erdos-Szekeres theorem on cups and caps. We show a simple proof for this theorem and we also show better recurrences for g(k,l). This theorem implies results on empty polygons in k^'-convex sets proved by Karolyi et al. [Gy. Karolyi, J. Pach, G. Toth, A modular version of the Erdos-Szekeres theorem, Studia Sci. Math. Hungar. 38 (2001) 245-259], Kun and Lippner [G. Kun, G. Lippner, Large convex empty polygons in k-convex sets, Period. Math. Hungar. 46 (2003) 81-88] and Valtr [P. Valtr, A sufficient condition for the existence of large empty convex polygons, Discrete Comput. Geom. 28 (2002) 671-682; P. Valtr, Open caps and cups in planar point sets, DCG (in press)]. A set of points is k^'-convex if it determines no triangle with more than k^' points inside.
A reference model for successful Distributed Development of Software Systems
Authors: Brian Lings, Bjorn Lundell, Par J. Agerfalk, Brian Fitzgerald
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

Distributed Development (DD) of Software Systems is an issue of increasing significance for organisations today, all the more so given the current trend towards globalisation. In this paper we present a reference model which can be used as a reference point for any company wishing to review their own DD scenario. This is particularised in two forms, one as an exemplar model for a global (GSD) development scenario and one as a particularisation of this for intra-national DD scenarios. By drawing from eight case-studies on DD, we present ten general strategies for successful DD together with our reference model which characterises an ideal DD situation.
New Literature
Venue: Computer (1978)

Heathkit Catalog. Winter 78 edition with 104 pages of electronic kits and products including home entertainment equipment, personal computers, radio accessories, and test instruments available from Heath Co., Dept. 350-530, Benton Harbor, MI 49022. 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