ppxscal/embedding_network huggingface dataset:
Transactional contexts: harnessing the power of context-oriented reflection
Authors: Sebastián González, Marcus Denker, Kim Mens
Venue: International Workshop on Context-Oriented Programming (2009)

The emerging field of context-oriented programming gives a predominant role to the execution context of applications, and advocates the use of dedicated mechanisms to allow the elegant expression of behavioural adaptations to such context. With suitable reflective facilities, language semantics can be adapted to context by reusing the same context-oriented mechanisms that allow base-level adaptability. This kind of meta-level adaptability, in which the computation model itself becomes adaptable to context, gives rise to context-oriented computational reflection. To explore this idea, we set out to implement a simple software transactional memory system that exploits meta-level adaptability by regarding transactions as contexts, and adapting fundamental system behaviour to such transactional contexts. The implementation is succinct and non-intrusive, giving us an indication of the power lying at the crossroads of context-oriented programming and computational reflection.
Adapting to Web Standards: CSS and Ajax for Big Sites, 1st edition
Authors: Christopher Schmitt, Kimberly Blessing, Rob Cherny, Meryl K. Evans, Kevin Lawver, Mark Trammell
Venue: Voices That Matter (2007)

After learning the language of design, how does one effectively use standards-based technologies to create visually strong Web sites? The full-color Adapting to Web Standards: CSS and Ajax for Big Sites gives developers a peek into the process of the best designers in the world through the work of high profile, real-world Web sites that made them famous. The book focuses on deconstructing these top-tier large-scale sites with particular attention given to deconstructing CSS.
Device with analogical circuits for protection to the lack of the pulse for the three-phase rectifiers in bridge
Authors: Borcosi Ilie, Olaru Onisifor, Popescu Marius-Constantin, Dinca Alina, Antonie Nicolae, Ionescu Marian
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

In this work is proposed a device for protection at the lack of pulse for the triphase rectifiers in bridge with load inductive resistive (dc motors).
Ldpc coding for magnetic storage: low floor decoding algorithms, system design, and performance analysis
Authors: William E. Ryan
Venue:  (2008)

Low-density parity check (LDPC) codes have experienced tremendous popularity due to their capacity-achieving performance. In this dissertation, several different aspects of LDPC coding and its applications to magnetic storage are investigated. One of the most significant issues that impedes the use of LDPC codes in many systems is the error-rate floor phenomenon associated with their iterative decoders. By delineating the fundamental principles, we extend to partial response channels algorithms for predicting the error rate performance in the floor region for the binary-input AWGN channel. We develop three classes of decoding algorithms for mitigating the error floor by directly tackling the cause of the problem: trapping sets. In our experiments, these algorithms provide multiple orders of improvement over conventional decoders at the cost of various implementation complexity increases. Product codes are widely used in magnetic recording systems where errors are both isolated and bursty. A dual-mode decoding technique for Reed-Solomon-code-based product codes is proposed, where the second decoding mode involves maximum-likelihood erasure decoding of the binary images of the Reed-Solomon codewords. By exploring a tape storage application, we demonstrate that this dual-mode decoding system dramatically improves the performance of product codes. Moreover, the complexity added by the second decoding mode is manageable. We also show the performance of this technique on a product code which has an LDPC code in the columns. Run-length-limited (RLL) codes are ubiquitous in today's disk drives. Using RLL codes has enabled drive designers to pack data very efficiently onto the platter surface by ensuring stable symbol-timing recovery. We consider a concatenation system design with an LDPC code and an RLL code as components to simultaneously achieve desirable features such as: soft information availability to the LDPC decoder, the preservation of the LDPC code's structure, and the capability of correcting long erasure bursts. We analyze the performance of LDPC-coded magnetic recording channel in the presence of media noise. We employ advanced signal processing for the pattern-dependent-noise-predictive channel detectors, and demonstrate that a gain of over 1 dB or a linear density gain of about 8% relative to a comparable Reed-Solomon is attainable by using an LDPC code.
Distributed modules for text annotation and IE applied to the biomedical domain
Authors: Harald Kirsch, Dietrich Rebholz-Schuhmann
Venue: Proceedings of the International Joint Workshop on Natural Language Processing in Biomedicine and its Applications (2004)

Biological databases contain facts from scientific literature, which have been curated by hand to ensure high quality. Curation is time-consuming and can be supported by information extraction methods. We present a server which identifies biological facts in scientific text and presents the annotation to the curator. Such facts are: UniProt, UMLS and GO terminology, identification of gene and protein names, mutations and protein-protein interactions. UniProt, UMLS and GO concepts are automatically linked to the original source. The module for mutations is based on syntax patterns and the one for protein-protein interactions on NLP. All modules work independently of each other in single threads and are combined in a pipeline to ensure proper meta data integration. For fast response time the modules are distributed on a Linux cluster. The server is at present available to curation teams of biomedical data and will be opened to the public in the future.
Using Natural Language Generation Technology to Improve Information Flows in Intensive Care Units
Authors: Jim Hunter, Albert Gatt, François Portet, Ehud Reiter, Somayajulu Sripada
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

In the drive to improve patient safety, patients in modern intensive care units are closely monitored with the generation of very large volumes of data. Unless the data are further processed, it is difficult for medical and nursing staff to assimilate what is important. It has been demonstrated that data summarization in natural language has the potential to improve clinical decision making; we have implemented and evaluated a prototype system which generates such textual summaries automatically. Our evaluation of the computer generated summaries showed that the decisions made by medical and nursing staff after reading the summaries were as good as those made after viewing the currently available graphical presentations with the same information content. Since our automatically generated textual summaries can be improved by including additional content and expert knowledge, they promise to enhance information exchange between the medical and nursing staff, particularly when integrated with the currently available graphical presentations. The main feature of this technology is that it brings together a diverse set of techniques such as medical signal analysis, knowledge based reasoning, medical ontology and natural language generation. In this paper we discuss the main components of our approach with a critical analysis of their strengths and limitations and present options for improvement to address these limitations.
Reconstruction of spectral function from effective permittivity of a composite material using rational function approximations
Authors: Dali Zhang, Elena Cherkaev
Venue: Journal of Computational Physics (2009)

The paper deals with the problem of reconstruction of microstructural information from known effective complex permittivity of a composite material. A numerical method for recovering geometric information from measurements of frequency dependent effective complex permittivity is developed based on Stieltjes analytic representation of the effective permittivity tensor of a two-component mixture. We derive the Stieltjes representation for the effective permittivity of the medium using the eigenfunction expansion of the solution of a boundary-value problem. The spectral function in this representation contains all information about the microgeometry of the mixture. A discrete approximation of the spectral measure is derived from a rational (Pade) approximation followed by its partial fractions decomposition. The approach is based on the least squares minimization with regularization constraints provided by the spectral properties of the operator. The method is applied to calculation of volume fractions of the components in a mixture of two materials in a Bruggeman effective medium analytic model which has a continuous spectral density and to analytical models of two-phase composites with coated cylindrical and ellipsoidal inclusions. The numerical results of reconstruction of spectral measure for a mixture of silver and silicon dioxide and a composite of magnesium and magnesium fluoride show good agreement between theoretical and predicted values. The approach is applicable to geological materials, biocomposites, porous media, etc.
Improving the Team-work in Heterogeneous Multi-agent Systems: Situation Matching Approach
Authors: Salvador Ibarra, Christian Quintero, Didac Busquets, Josep Ramón, Josep Ll. de la Rosa, José A. Castán
Venue: Proceeding of the 2006 conference on Artificial Intelligence Research and Development (2006)

This paper presents a method called “Situation Matching” that aids to improve cooperative tasks in heterogeneous multi-agent systems. The situation matching (SM) above represent a match between the system requirements and the agents' capabilities. In this sense, the agents have a set of information denoted “Agent Situation” by means of three parameters: Proximity, Introspection and Trust. Thus, the agents are represented by autonomous mobile cooperative robots. In our approach, the agents have different controllers to generate dynamic diversity (heterogeneity) in the system. So, these systems can be considered as a team of heterogeneous agents that must work together to fulfill some cooperative tasks. In particular, this paper studies how the heterogeneous agents' performance improves by means of the “situation matching”. Conclusions show the advantages of our proposal in the improvement of intelligent agents' performance in the robot soccer testbed.
Web services synchronization in composition scenarios: the centralized view
Authors: Hamdi Yahyaoui, Zakaria Maamar, Khouloud Boukadi
Venue: Proceedings of the 2009 conference on Information Science, Technology and Applications (2009)

This paper discusses Web services synchronization at the composition level. Synchronization aims at assisting independent parties coordinate their actions and thus, avoid conflicts. Our previous work on synchronization primarily focussed on the component level and shed the light on two types of behaviors related to specifying Web services. The operational behavior defines the business logic that underpins the functioning of a Web service, and the control behavior regulates the execution progress of this operational behavior by stating the actions to carry out and the constraints to put on this progress. Operational and control behaviors continue to be used to specify composite Web services with respect to the orchestration schemas that these composite Web services have to comply with whether centralized or peer-to-peer. As a result, various types of messages to achieve synchronization are developed per type of orchestration schema. Experiments showing the use of these messages are reported in this paper as well.
Complexity and Occlusion Management for the World-in-Miniature Metaphor
Authors: Ramón Trueba, Carlos Andujar, Ferran Argelaguet
Venue: Proceedings of the 10th International Symposium on Smart Graphics (2009)

The World in Miniature (WIM) metaphor allows users to interact and travel efficiently in virtual environments. In addition to the first-person perspective offered by typical VR applications, the WIM offers a second dynamic viewpoint through a hand-held miniature copy of the environment. In the original WIM paper the miniature was a scaled down replica of the whole scene, thus limiting its application to simple models being manipulated at a single level of scale. Several WIM extensions have been proposed where the replica shows only a part of the environment. In this paper we present a new approach to handle complexity and occlusion in the WIM. We discuss algorithms for selecting the region of the scene which will be covered by the miniature copy and for handling occlusion from an exocentric viewpoint. We also present the results of a user-study showing that our technique can greatly improve user performance on spatial tasks in densely-occluded scenes.
Toward a cloud computing research agenda
Authors: Ken Birman, Gregory Chockler, Robbert van Renesse
Venue: ACM SIGACT News (2009)

The 2008 LADIS workshop on Large Scale Distributed Systems brought together leaders from the commercial cloud computing community with researchers working on a variety of topics in distributed computing. The dialog yielded some surprises: some hot research topics seem to be of limited near-term importance to the cloud builders, while some of their practical challenges seem to pose new questions to us as systems researchers. This brief note summarizes our impressions.
Data Mining, Systems Analysis, and Optimization in Biomedicine, 1st edition
Authors: Onur Seref, O. Erhun Kundakcioglu, Panos M. Pardalos
Venue: Aip Conference Proceedings (2007)

This book is a collection of a sample of the latest research methods in data mining across diverse fields of biomedicine, neuroscience, engineering, and computer science. The problems and methods discussed in this book will be of great interest to new and established theoreticians and practitioners in these fields and provide them with new directions for research.
Resource-Limited Multiattribute Value Analysis of Alternatives for Immobilizing Radioactive Liquid Process Waste Stored in Saluggia, Italy
Authors: Alan J. Brothers, Shas V. Mattigod, Denis M. Strachan, Gordon H. Beeman, Paul K. Kearns, Angelo Papa, Carlo Monti
Venue: Decision Analysis (2009)

This large Italian public works project started with the development of engineering data to support the evaluation of three alternatives for processing nuclear waste. After an analysis of the alternatives' performance from an engineering perspective was completed, Società Gestione Impianti Nucleari (Sogin), which is the Italian authority with the responsibility to decommission Italy's four nuclear power plants, asked Battelle, a company thoroughly familiar with nuclear waste processing, to provide an independent assessment of this important decision. The initial analysis did not include an evaluation of alternative performance from the perspective of a broad set of public values. As part of the assessment, we developed a decision methodology as a practical variation of the data-intensive decision processes often found in textbooks. In this paper, we describe a decision process in which we made use of engineering data and expert judgment to minimize expensive additional data collection so that we could perform a multiattribute decision analysis that was theoretically grounded and economical to implement, while incorporating both engineering and stakeholder objectives. Through this process, the Battelle staff verified the initial selection made by the staff at Sogin.
The Analysis of Aircraft Maneuver Efficiency within Extend Flight Envelop
Authors: Hao Long, Shujie Song
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

Using thrust vector must be one of key technique characters for the forth generation fighters especially in condition of High AOA(Angle of attack). The general effectors lost the maneuver efficiency or get poorly, so new type of control law must be found to improve the maneuver efficiency of aircraft within extended flight envelop. The control law should not only overcome those problems but also satisfy requirement of the forth generation aircraft. For those reasons, the Receding Horizon Optimal (RHO) control law is brought out to solve those problems. Simulation results comparison between using the general effectors and using the general effectors with thrust vector all together show: within the extend flight envelop thrust and thrust vector use together can guarantee aircraft following pilot command exactly, the RHO control law can solve those problems perfectly and satisfy the requirement of the forth generation fighter.
Social influence analysis in large-scale networks
Authors: Jie Tang, Jimeng Sun, Chi Wang, Zi Yang
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

In large social networks, nodes (users, entities) are influenced by others for various reasons. For example, the colleagues have strong influence on one's work, while the friends have strong influence on one's daily life. How to differentiate the social influences from different angles(topics)? How to quantify the strength of those social influences? How to estimate the model on real large networks? To address these fundamental questions, we propose Topical Affinity Propagation (TAP) to model the topic-level social influence on large networks. In particular, TAP can take results of any topic modeling and the existing network structure to perform topic-level influence propagation. With the help of the influence analysis, we present several important applications on real data sets such as 1) what are the representative nodes on a given topic? 2) how to identify the social influences of neighboring nodes on a particular node? To scale to real large networks, TAP is designed with efficient distributed learning algorithms that is implemented and tested under the Map-Reduce framework. We further present the common characteristics of distributed learning algorithms for Map-Reduce. Finally, we demonstrate the effectiveness and efficiency of TAP on real large data sets.
A hybrid nano-CMOS architecture for defect and fault tolerance
Authors: Muzaffer O. Simsir, Srihari Cadambi, Franjo Ivanvčić, Martin Roetteler, Niraj K. Jha
Venue: ACM Journal on Emerging Technologies in Computing Systems (JETC) (2009)

As the end of the semiconductor roadmap for CMOS approaches, architectures based on nanoscale molecular devices are attracting attention. Among several alternatives, silicon nanowires and carbon nanotubes are the two most promising nanotechnologies according to the ITRS. These technologies may enable scaling deep into the nanometer regime. However, they suffer from very defect-prone manufacturing processes. Although the reconfigurability property of the nanoscale devices can be used to tolerate high defect rates, it may not be possible to locate all defects. With very high device densities, testing each component may not be possible because of time or technology restrictions. This points to a scenario in which even though the devices are tested, the tests are not very comprehensive at locating defects, and hence the shipped chips are still defective. Moreover, the devices in the nanometer range will be susceptible to transient faults which can produce arbitrary soft errors. Despite these drawbacks, it is possible to make nanoscale architectures practical and realistic by introducing defect and fault tolerance. In this article, we propose and evaluate a hybrid nanowire-CMOS architecture that addresses all three problems&mdash;namely high defect rates, unlocated defects, and transient faults&mdash;at the same time. This goal is achieved by using multiple levels of redundancy and majority voters. A key aspect of the architecture is that it contains a judicious balance of both nanoscale and traditional CMOS components. A companion to the architecture is a compiler with heuristics to quickly determine if logic can be mapped onto partially defective nanoscale elements. The heuristics make it possible to introduce defect-awareness in placement and routing. The architecture and compiler are evaluated by applying the complete design flow to several benchmarks.
Scholar Agent: Auction Mechanisms for Efficient Publication Selection on Congresses and Journals
Authors: Josep Lluis de la Rosa, Maria de los Llanos Tena
Venue: Proceeding of the 2007 conference on Artificial Intelligence Research and Development (2007)

Congresses and journals (CJ) can be like displays which can be used as a publishing medium of scholarly works when space is a scarce resource, and it is desirable to expose many papers, posters and communications (adverts of scientific work) to as wide a scientific audience as possible who will eventually cite them. Although the efficiency of such publishing systems can be improved if the CJ are aware of the identity and interests of the audience, this knowledge is difficult to acquire when users are not previously identified or inscribed in the CJ. To this end, we present Scholar Agent, an intelligent public agent, which helps CJ to select and display papers, posters and communications in response to scientists inscribed to particular sessions or tracks in the audience. Here, scientists are identified and their CJ review history tracked. Within Scholar Agent we have designed an agent system that utilises a new currency and an auction-based marketplace to efficiently select papers for the display. We show, by means of an empirical evaluation, that the performance of this auction-based mechanism when used with bidding strategy, efficiently selects the best paper in response to the audience presence (inscribed). This may have utility both presential or on-line CJ. We show how our scholarly publishing agents (Scholar Agents) will behave accordingly the private value of the paper by the scientist and how to link this initial private value with the own private value of the agents that are bench-marked with two other commonly applied selection methods for displaying papers in CJ.