ppxscal/embedding_network huggingface dataset:
Negative Ternary Set-Sharing
Authors: Eric Trias, Jorge Navas, Elena S. Ackley, Stephanie Forrest, M. Hermenegildo
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

The Set-Sharing domain has been widely used to infer at compile-time interesting properties of logic programs such as occurs-check reduction, automatic parallelization, and finite-tree analysis. However, performing abstract unification in this domain requires a closure operation that increases the number of sharing groups exponentially. Much attention has been given to mitigating this key inefficiency in this otherwise very useful domain. In this paper we present a novel approach to Set-Sharing: we define a new representation that leverages the complement (or negative) sharing relationships of the original sharing set, without loss of accuracy. Intuitively, given an abstract state $sh_{\mathcal{V}}$ over the finite set of variables of interest $\mathcal{V}$, its negative representation is $\wp(\mathcal{V}) \setminus sh_{\mathcal{V}}$. Using this encoding during analysis dramatically reduces the number of elements that need to be represented in the abstract states and during abstract unification as the cardinality of the original set grows toward $2^{|\mathcal{V}|}$. To further compress the number of elements, we express the set-sharing relationships through a set of ternary strings that compacts the representation by eliminating redundancies among the sharing sets. Our experiments show that our approach can compress the number of relationships, reducing significantly the memory usage and running time of all abstract operations, including abstract unification.
Dilute nitrides and 1.3µm GaInNAs quantum well lasers on GaAs
Authors: S. M. Wang, H. Zhao, G. Adolfsson, Y. Q. Wei, Q. X. Zhao, J. S. Gustavsson, M. Sadeghi, A. Larsson
Venue: Microelectronics Journal (2009)

We present epitaxial growth of GaInNAs on GaAs by molecular beam epitaxy (MBE) using analog, digital and N irradiation methods. It is possible to realize GaInNAs quantum wells (QWs) with a maximum substitutional N concentration up to 6% and a strong light emission up to 1.71&mu;m at 300K. High quality 1.3&mu;m GaInNAs multiple QW edge emitting laser diodes have been demonstrated. The threshold current density (for a cavity of 100x1000&mu;m2) is 300, 300, 400 and 940A/cm2 for single, double, triple and quadruple QW lasers, respectively. The maximum 3dB bandwidth reaches 17GHz and high-speed transmission at 10Gb/s up to 110°C under a constant voltage has been demonstrated.
SSWiM: A Semantic Service, Wrapper and Invocation Manager
Authors: Anna Sibirtseva, Zhongnan Shen, Jianwen Su, Fuliang Weng, Baoshi Yan, Yao Meng
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

Integrating service description, discovery, and invocation functionalities presents several fundamental problems in the management of web services and is a basic problem for composing web services over a network. In this paper, we present the design of a system called "Semantic service, Wrapper, and Invocation Manager" (SSWiM) which provides these key functionalities. In particular, SSWiM manages storage of and queries over service descriptions in a service registry, wraps existing REST services with WSDL service interfaces, and supports for service invocation at run time. We describe WSDL services based on two levels of ontologies: a domain ontology for data sets and a service ontology for services. The input/output messages (data) and the functionality of a (WSDL) service are mapped to the domain ontology and the service ontology, respectively. We developed the data mapping methodology and the mapping algorithm. Service descriptions are registered in our service registry which supports a set of service discovery queries. The wrapper builder in SSWiM can generate WSDL services automatically from REST services so that services can be invoked uniformly in WSDL format.
STEEL: a technique for stress-enhanced standard cell library design
Authors: Brian T. Cline, Vivek Joshi, Dennis Sylvester, David Blaauw
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Mobility degradation and device scaling limitations have led process engineers to develop new techniques that introduce mechanical stress in MOSFET channels, which results in enhanced carrier transport. New fabrication steps strive to increase carrier mobility which, consequently, increases both Ion and Ioff in CMOS devices. However, most stress-enhancement techniques are dependent on layout parameters and their effects can be exploited within standard cell library design. In this work, we propose a new standard cell library design methodology that shares VDD and VSS source/drain connections across standard cell boundaries. Such sharing allows for increased channel stress in both the corresponding device as well as its neighboring devices. Using an industrial 65nm process and standard cell library, we show that our standard cell design methodology can be seamlessly integrated into current, state-of-the-art digital IC design flows. The new shared source/drain technique improves critical path delay by 11% on average over a number of benchmarks for only a ~35% increase in leakage. Further-more, stress-enhanced standard cell libraries offer a superior power/delay tradeoff compared to dual-Vth across a wide range of operating points with reduced manufacturing costs. Specifically, our stress-enhanced library (with a single Vth) consumes ~2.5X less leakage than its dual-Vth counterpart.
Keynote Speech: Agent Oriented Software Engineering: Why and How
Authors: Lin Padgham
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

Intelligent agents are a new paradigm for developing a wide range of software systems. Just as object oriented programming is at a higher level of abstraction than procedural programming, so agent oriented is at a higher abstraction level than object oriented. This facilitates faster and easier development of more complex systems, than is possible with a less powerful paradigm. Some research has shown that efficiency gains of more than 300 oriented approach to development.
The Shortcut Problem --- Complexity and Approximation
Authors: Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Dorothea Wagner
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

During the last years, speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road networks. The most sophisticated methods enhance the graph by inserting shortcuts, i.e. additional edges, that represent shortest paths in the graph. Until now, all existing shortcut-insertion strategies are heuristics and no theoretical results on the topic are known. In this work, we formalize the problem of adding shortcuts as a graph augmentation problem, study the algorithmic complexity of the problem, give approximation algorithms and show how to stochastically evaluate a given shortcut assignment on graphs that are too big to evaluate it exactly.
Security Scheme for Online Banking Based on Secret Key Encryption
Authors: Xiangyi Hu, Guifen Zhao, Guanning Xu
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

The secret key based security scheme is proposed for achieving secure online banking. Encryption equipments are adopted at certification servers and client terminals. A secure certification protocol is established by using secret key encryption, combined secret key and smart card techniques. The one-time secret key generated automatically according to the protocol is unrepeatable. Consequently, the online banking system is secure.
Hierarchical fuzzy rule based classification systems with genetic rule selection for imbalanced data-sets
Authors: Alberto Fernández, María José del Jesus, Francisco Herrera
Venue: International Journal of Approximate Reasoning (2009)

In many real application areas, the data used are highly skewed and the number of instances for some classes are much higher than that of the other classes. Solving a classification task using such an imbalanced data-set is difficult due to the bias of the training towards the majority classes. The aim of this paper is to improve the performance of fuzzy rule based classification systems on imbalanced domains, increasing the granularity of the fuzzy partitions on the boundary areas between the classes, in order to obtain a better separability. We propose the use of a hierarchical fuzzy rule based classification system, which is based on the refinement of a simple linguistic fuzzy model by means of the extension of the structure of the knowledge base in a hierarchical way and the use of a genetic rule selection process in order to get a compact and accurate model. The good performance of this approach is shown through an extensive experimental study carried out over a large collection of imbalanced data-sets.
Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic
Authors: Marc Denecker, Joost Vennekens
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

This paper presents a Knowledge Base project for FO(ID), an extension of classical logic with inductive definitions. This logic is a natural integration of classical logic and logic programming based on the view of a logic program as a definition. We discuss the relationship between inductive definitions and common sense reasoning and the strong similarities and striking differences with ASP and Abductive LP. We report on inference systems that combine state-of-the-art techniques of SAT and ASP. Experiments show that FO(ID) model expansion systems are competitive with the best ASP-solvers.
An image score inference system for RNAi genome-wide screening based on fuzzy mixture regression modeling
Authors: Jun Wang, Xiaobo Zhou, Fuhai Li, Pamela L. Bradley, Shih-Fu Chang, Norbert Perrimon, Stephen T. C. Wong
Venue: Journal of Biomedical Informatics (2009)

With recent advances in fluorescence microscopy imaging techniques and methods of gene knock down by RNA interference (RNAi), genome-scale high-content screening (HCS) has emerged as a powerful approach to systematically identify all parts of complex biological processes. However, a critical barrier preventing fulfillment of the success is the lack of efficient and robust methods for automating RNAi image analysis and quantitative evaluation of the gene knock down effects on huge volume of HCS data. Facing such opportunities and challenges, we have started investigation of automatic methods towards the development of a fully automatic RNAi-HCS system. Particularly important are reliable approaches to cellular phenotype classification and image-based gene function estimation. We have developed a HCS analysis platform that consists of two main components: fluorescence image analysis and image scoring. For image analysis, we used a two-step enhanced watershed method to extract cellular boundaries from HCS images. Segmented cells were classified into several predefined phenotypes based on morphological and appearance features. Using statistical characteristics of the identified phenotypes as a quantitative description of the image, a score is generated that reflects gene function. Our scoring model integrates fuzzy gene class estimation and single regression models. The final functional score of an image was derived using the weighted combination of the inference from several support vector-based regression models. We validated our phenotype classification method and scoring system on our cellular phenotype and gene database with expert ground truth labeling. We built a database of high-content, 3-channel, fluorescence microscopy images of Drosophila Kc"1"6"7 cultured cells that were treated with RNAi to perturb gene function. The proposed informatics system for microscopy image analysis is tested on this database. Both of the two main components, automated phenotype classification and image scoring system, were evaluated. The robustness and efficiency of our system were validated in quantitatively predicting the biological relevance of genes.
A Frame of Operational Risk Management System Based on Case-Based Reasoning
Authors: Qian Chen, Jinlin Li, Lun Ran
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

With more and more increasingly significant attention has paid to operational risk, it is urgent for the banks to find some suitable approaches to measure and manage their operational risk. An operational risk management system (ORMS) is set up, which based on case-based reasoning (CBR) methods. The frame of operational risk management system is presented. Some key techniques associated with the CBR method are discussed, such as the case representation structure and case retrieve methods, which are designed under Basel II. Finally, the functional modules and some sub-functional modules are laid out, which are developed in accordance with the process of operational risk management.
A vertex-face assignment for plane graphs
Authors: Diane L. Souvaine, Csaba D. Tóth
Venue: Computational Geometry: Theory and Applications (2009)

For every planar straight line graph (Pslg), there is a vertex-face assignment such that every vertex is assigned to at most two incident faces, and every face is assigned to all its reflex corners and one more incident vertex. Such an assignment allows us to augment every disconnected Pslg into a connected Pslg such that the degree of every vertex increases by at most two.
Shift Invariant Iris Feature Extraction Using Rotated Complex Wavelet and Complex Wavelet for Iris Recognition System
Authors: Rajesh M. Bodade, Sanjay N. Talbar
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

In this paper, authors have proposed a novel approach of feature extraction of iris images using combination of 2D Dual Tree Rotated Complex Wavelet Transform (RCWT) and 2D Dual Trace Complex Wavelet Transform(CWT). This method provides features in 12 directions against 3 and 6 directions in DWT and CWT respectively. Iris features are obtained by computing energies and standard deviation of detailed coefficients in 12 directions per stage, at 3 levels of decomposition. Canberra distance is used for matching. The results are obtained using DWT, CWT combination of CWT and RCWT on UBIRIS database of 2400 images. The performance measure, ZeroFAR, is reduced from 6.3 using DWT to 2.7 using proposed method. The method is also computationally efficient as compared to Gabor Filters.
Axial moving planes and singularities of rational space curves
Authors: Haohao Wang, Xiaohong Jia, Ron Goldman
Venue: Computer Aided Geometric Design (2009)

Relationships between the singularities of rational space curves and the moving planes that follow these curves are investigated. Given a space curve C with a generic 1-1 rational parametrization F(s,t) of homogeneous degree d, we show that if P and Q are two singular points of orders k and k^' on the space curve C, then there is a moving plane of degree d-k-k^' with axis PQ@? that follows the curve. We also show that a point P is a singular point of order k on the space curve C if and only if there are two axial moving planes L"1 and L"2 of degree d-k such that: (1) the axes of L"1, L"2 are orthogonal and intersect at P, and (2) the intersection of the moving planes L"1 and L"2 is the cone through the curve C with vertex P together with d-k copies of the plane containing the axes of L"1 and L"2. In addition, we study relationships between the singularities of rational space curves and generic moving planes that follow these curves. In particular, we show that if p(s,t),q(s,t),r(s,t) are a @m-basis for the moving planes that follow a rational space curve F(s,t), then P is a singular point of F(s,t) of order k if and only if deg(gcd(p(s,t)@?P,q(s,t)@?P,r(s,t)@?P))=k. Moreover, the roots of this gcd are the parameters, counted with proper multiplicity, that correspond to the singularity P. Using these results, we provide straightforward algorithms for finding all the singularities of low degree rational space curves. Our algorithms are easy to implement, requiring only standard techniques from linear algebra. Examples are provided to illustrate these algorithms.
Unified P4 (power-performance-process-parasitic) fast optimization of a Nano-CMOS VCO
Authors: Dhruva Ghai, Saraju P. Mohanty, Elias Kougianos
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

In this paper, we present the design of a P4 (Power-Performance-Process-Parasitic) aware voltage controlled oscillator (VCO) at nano-CMOS technologies. Through simulations, we have shown that parasitics and process have a drastic effect on the performance (center frequency) of the VCO. For process variation analysis, we propose a methodology called Design of Experiments-Monte Carlo (DOE-MC), which offers up to 6.25x time savings over a traditional Monte Carlo (TMC) method. A performance optimization of the VCO along with dual-oxide power minimization technique has been carried out in the presence of worst case process. The end product of the proposed methodology is a process aware, performance optimized, dual oxide VCO physical design. We have achieved 25% power (including leakage) minimization with only 1% degradation in center frequency compared to target frequency, in the presence of <i>worst-case process</i> and parasitics. The dual-oxide physical design of the VCO is carried out at 90nm. To the best of the authors' knowledge, this is the first research reporting a dual-oxide nano-CMOS VCO design simultaneously optimized for power (including leakage), performance, parasitics and process.
Databases in Mobile Telecommunications: Architectures and Performance Analysis
Authors: Juha Taina
Venue:  (2008)

Databases in mobile telecommunications have becomemore and more important due to growing data volumes. More efficient database solutions are needed tosupport temporal and logical consistency. This bookpresents a possible database architecture for thegrowing data dilemma. It presents a databasearchitecture for IN and GSM data, and a performanceanalysis toolbox for transaction-based software.Using the presented architecture as a test case, adetailed queue model analysis is presented. Theresult of the analysis is twofold. The mostimportant result is that even a complextransaction-based system may be analyzed accuratelyenough to get relevant and reasonable results withthe toolbox. Second, it appears that paralleldatabase architectures have a lot to offer inhigh-volume data environments.
Log summarization and anomaly detection for troubleshooting distributed systems
Authors: Dan Gunter, Brian L. Tierney, Aaron Brown, Martin Swany, John Bresnahan, Jennifer M. Schopf
Venue: Proceedings of the 8th IEEE/ACM International Conference on Grid Computing (2007)

Today’s system monitoring tools are capable of detecting system failures such as host failures, OS errors, and network partitions in near-real time. Unfortunately, the same cannot yet be said of the end-to-end distributed software stack. Any given action, for example, reliably transferring a directory of files, can involve a wide range of complex and interrelated actions across multiple pieces of software: checking user certificates and permissions, getting details for all files, performing third-party transfers, understanding re-try policy decisions, etc. We present an infrastructure for troubleshooting complex middleware, a general purpose technique for configurable log summarization, and an anomaly detection technique that works in near-real time on running Grid middleware. We present results gathered using this infrastructure from instrumented Grid middleware and applications running on the Emulab testbed. From these results, we analyze the effectiveness of several algorithms at accurately detecting a variety of performance anomalies.
Toward the development of machine: independent systems programming languages
Authors: Ken Magel, Andries Van Dam, Martin Michel
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

One of the reasons for developing high level languages has been the desire for program portability from one type of machine to another. To achieve the high degree of machine independence necessary for program portability, these languages have included general features such as arithmetic expressions, arrays, and subroutine calls which can be implemented on many machines. Facilities such as the interrupt mechanism, program status word, and device dependent input/output which are available to the assembly language programmer are hidden from the high level programmer. Unfortunately, the code generated by compilers for these high level languages is often very inefficient compared to that produced by experienced assembly language programmers. However, the added expressiveness and the ability to leave details to the compiler usually offset the inefficiency of generated code, particularly for non-systems applications. For such applications, the facilities which the high level programmer cannot use are not needed anyway.
A simulation study of interventions to reduce appointment lead-time and patient no-show rate
Authors: Ronald E. Giachetti
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

A problem in health care is the lengthy waiting time for patients to receive an appointment. Long appointment delays cause patient dissatisfaction with the health care clinic and also has clinical ramifications. Long appointment delays are also found to increase patient no-shows, which further wastes medical resources and leads to a decrease in clinical care. A model of the health care clinic is built to understand the casual relationships in the system contributing to the problem. The model is used to investigate two possible policies. A policy of eliminating multiple appointment types can be effective in reducing appointment delay and as a consequent no-shows. Using data from several clinics, our study also suggests that an effective policy is to segregate habitual no-show patients and double-book them whenever they make appointments. This policy is equally effective as general overbooking without penalizing the entire patient population.
Security Strategy: From Soup to Nuts
Authors: Mimi Herrmann
Venue: Information Security Journal: A Global Perspective (2009)

To paraphrase Calvin Coolidge, the business of the Internet is business1. The more business done on the Internet, the more need for regulation of that business. Many of the existing government and industry regulations deal with security measures, and for that reason it's more important than ever to secure your company's IT infrastructure, no matter how large or small your company. Even if for some reason you're not subject to regulations, it's still a very good idea to secure your assets as if you were. At some point, your status might change, and besides, nobody wants to be hacked.