ppxscal/embedding_network huggingface dataset:
Fabrication of Activated Carbon Electrodes by Inkjet Deposition
Authors: Véronique Conédéra, Fabien Mesnilgrente, Magali Brunet, Norbert Fabre
Venue: Proceedings of the 2009 Third International Conference on Quantum, Nano and Micro Technologies (2009)

The inkjet deposition technology turns out to be interesting in various applications when one attempts to reduce manufacturing costs, simplify technological steps, and implement materials that could not be deposited in any other way. One of the limitations however, is the issue raised by resolution which is directly linked to the ejection head manufacturing technology. In this paper, a method of activated carbon deposition based on inkjet is presented. Activated carbon is extensively used in chemistry for its impurity absorption capabilities and in other applications like the fabrication of supercapacitors. It is shown in particular that by using a localized surface treatment with OTS and an activated carbon suspension stabilized by a surfactant, one can get 10 µm structures, which are, therefore, much smaller than the ejection head nozzle diameter. To implement and optimize the process, the contact angle measurement technique is utilized.
NMR Quantum Information Processing, 1st edition
Authors: Ivan Oliveira, Roberto Sarthour, Tito Bonagamba, Eduardo Azevedo, Jair C. C. Freitas
Venue:  (2007)

Quantum Computation and Quantum Information (QIP) deals with the identification and use of quantum resources for information processing. This includes three main branches of investigation: quantum algorithm design, quantum simulation andquantum communication, including quantum cryptography. Along the past few years, QIP has become one of the most active area ofresearch in both, theoretical and experimental physics, attracting students and researchers fascinated, not only by the potentialpractical applications of quantum computers, but also by the possibility of studying fundamental physics at the deepest level of quantum phenomena.NMR Quantum Computation and Quantum Information Processing describes the fundamentals of NMR QIP, and the main developments which can lead to a large-scale quantum processor. The text starts with a general chapter onthe interesting topic of the physics of computation. The very first ideas which sparkled the development of QIP came from basic considerations of the physical processes underlying computational actions. In Chapter 2 it is made an introduction to NMR, including the hardware and other experimental aspects of the technique. InChapter 3 we revise the fundamentals of Quantum Computation and Quantum Information. The chapter is very much based on the extraordinary book of Michael A. Nielsen and Isaac L. Chuang, withan upgrade containing some of the latest developments, such as QIP in phase space, and telecloning. Chapter 4 describes how NMRgenerates quantum logic gates from radiofrequency pulses, upon which quantum protocols are built. It also describes the important technique of Quantum State Tomography for both, quadrupole and spin1/2 nuclei. Chapter 5 describes some of the main experiments of quantum algorithm implementation by NMR, quantum simulation and QIP in phase space. The important issue of entanglement in NMR QIPexperiments is discussed in Chapter 6. This has been a particularly exciting topic in the literature. The chapter contains a discussionon the theoretical aspects of NMR entanglement, as well as some of the main experiments where this phenomenon is reported. Finally, Chapter 7 is an attempt to address the future of NMR QIP, based invery recent developments in nanofabrication and single-spin detection experiments. Each chapter is followed by a number of problems and solutions. * Presents a large number of problems with solutions, ideal for students* Brings together topics in different areas: NMR, nanotechnology, quantum computation * Extensive references
Motivation for a new formal framework for agent-oriented software engineering
Authors: R. Ahmad, S. Rahimi
Venue: International Journal of Agent-Oriented Software Engineering (2009)

Agent-Oriented Software Engineering (AOSE) poses several challenges to the traditional theory and practice of software engineering with the emergence of a variety of theories and tools proposed to deal with this challenge. Agent frameworks with formal foundations have an important role to play in this scenario by allowing analysis based on a mathematical model. It is our contention that the available frameworks and languages do not fulfil all aspects of agent-based system analysis and development. We perform a survey of the available formal theories and tools for Multi-Agent Systems (MAS) and derive a strong motivation for a new formal framework to support AOSE. Several aspects of agent behaviour in this framework have been inspired by the popular Belief-Desire-Intention (BDI) model of cognitive agents. The new framework introduced concisely in the second half tackles the issues raised in the first half, including those regarding mobility, proactive behaviour, organisation and inter-agent communication.
A distributed system for support and explanation of shared decision-making in the prenatal testing domain
Authors: Itay Segal, Yuval Shahar
Venue: Journal of Biomedical Informatics (2009)

Medical domains involve numerous tests and treatments, the sheer variety of which confounds both care providers and patients. Many of the decisions depend on the patient's preferences. Shared decision-making, which explicitly involves the patients and their preferences, is therefore imperative, but requires also a sufficient explanatory infrastructure. We introduce a distributed application, PANDEX, that, by using decision-analytic methods, assists patients and care providers to reach optimal decisions. Based on a generic architecture, the PANDEX prototype, which focuses on the domain of genetic prenatal consultation, is designed to calculate the optimal treatment strategy based on the patient's clinical data and preferences. A major focus of our study was on developing several types of in-depth sensitivity and importance analysis methods and on the implementation of the respective graphical tools embedded in the system, to help the patient fully understand the recommended strategy. A preliminary assessment of PANDEX by six genetic consultants demonstrated a relative unwillingness to work with PANDEX (mean=2.16+/-0.98 (SD), on a scale of 1-5), but a tendency to agree with its recommended strategies (mean=3.48+/-1.4) and with its capability to provide insights into the recommended strategies (3.28+/-1.23). PANDEX was considered by the consultants to be a potentially useful tool for patients.
Universal Problem of Attribute Reduction
Authors: Mikhail Ju. Moshkov, Marcin Piliszczuk, Beata Zielosko
Venue: Transactions on Rough Sets IX (2008)

In the paper, some generalizations of the notions of reduct, test (superreduct), partial (approximate) reduct and partial test are considered. The accuracy of greedy algorithm for construction of partial test is investigated. A lower bound on the minimal cardinality of partial reducts based on an information about greedy algorithm work is studied. A bound on the precision of greedy algorithm which does not depend on the number of pairs of rows of a decision table which should be separated is obtained. Results of experiments with greedy algorithm are discussed.
Joint rate and cooperative MIMO scheme optimization for uniform energy distribution in Wireless Sensor Networks
Authors: Irfan Ahmed, Mugen Peng, Wenbo Wang, Syed Ismail Shah
Venue: Computer Communications (2009)

An energy efficient adaptive rate cooperative MIMO selection scheme is proposed for uniform load distribution in the cluster based wireless sensor networks. The intrinsic data flow direction in multi-hop cluster based sensor networks causes uneven load distribution in the network. The transit clusters and the clusters near the base station carry more network traffic than the other clusters. Cooperative MIMO can artistically reduce the per bit energy consumption, Space-Time Block Codes are designed to achieve maximum diversity for a given number of transmit and receive antennas with very simple decoding algorithm. In radio fading channel, STBC require less transmission energy than SISO technique for the same Bit Error Rate and can be employed practically in Wireless Sensor Networks by using the cooperative MIMO scheme. Considering Alamouti and Tarokh Space-Time Block Codes, the number of antennas at both the transmission and the reception sides are selected with respect to the cluster load. The crude energy consumption per cluster then refined through adaptive rate transmission. It has been shown that the load based joint adaptive selection of rate and cooperative nodes in clusters renders uniform energy consumption in the network.
Coverage and service bounds for UMTS
Authors: Leigh E. Hodge, Sasthi C. Ghosh, Steve Hurley, Roger M. Whitaker, Stuart M. Allen
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Although upper bounds on cell planning have been derived for UMTS systems, little has been done to address lower bounds. In this paper we present the findings of a preliminary investigation into techniques for deriving upper and lower bounds for 3G network design. Lower bounds are derived via an integer linear programming (ILP) approach and upper bounds are derived using a meta-heuristic approach (tabu search). The lower bound provides a bench-mark against which the effectiveness of the meta-heuristic approach can be evaluated. We propose three optimization models addressing transmitter and pilot power requirements, and derive and contrast upper and lower bounds. The results of experimentation show that the tabu search is competitive with the lower bounds derived from the ILP and has substantially lower execution time for larger problems.
Fast MIP Handover Amelioration in Wireless Networks by Cross-Layer Solution
Authors: Anne Wei, GouZhi Wei, Gerard Dupeyrat, Benoit Geller
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

Mobile IP allows a mobile node to maintain a continuous connectivity to the Internet when moving from one access point to another. However, due to the link switching operations packets designated to mobile nodes can be delayed or lost during the handover period. This paper presents a two-layer solution to improve the handover performance both at the Link Layer and the Network Layer in the context of Mobile IP over wireless networks. At the Network Layer, we use a new function named Extended Handover Control Function (\emph {EHCF}) which allow us to delete the \emph {DAD} operation. At the Link Layer, a neighbor graphical prediction approach (\emph{NGP}) reduces the probe latency. Moreover, the \emph{EHCF} can buffer the packets during the handover process in order to decrease the packet loss. With an analytical model and some OPNET simulations, we show in this paper that our solution allows to provide low latency, low packet loss to the standard handover of Mobile IPv6.
Interactive Graphics for Data Analysis: Principles and Examples (Computer Science and Data Analysis), 1 edition
Authors: Martin Theus, Simon Urbanek
Venue:  (2008)

Interactive Graphics for Data Analysis: Principles and Examples discusses exploratory data analysis (EDA) and how interactive graphical methods can help gain insights as well as generate new questions and hypotheses from datasets.Fundamentals of Interactive Statistical Graphics The first part of the book summarizes principles and methodology, demonstrating how the different graphical representations of variables of a dataset are effectively used in an interactive setting. The authors introduce the most important plots and their interactive controls. They also examine various types of data, relations between variables, and plot ensembles.Case Studies Illustrate the Principles The second section focuses on nine case studies. Each case study describes the background, lists the main goals of the analysis and the variables in the dataset, shows what further numerical procedures can add to the graphical analysis, and summarizes important findings. Wherever applicable, the authors also provide the numerical analysis for datasets found in Cox and Snells landmark book.This full-color text shows that interactive graphical methods complement the traditional statistical toolbox to achieve more complete, easier to understand, and easier to interpret analyses.
Considering role-based conflicts of interest in analyzing and designing e-health systems with goal-oriented methodologies
Authors: Vic Chung
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

Our study discusses the use of goal-oriented methodologies to analyze and design e-health systems. By considering stakeholders' goals in an organization, goal-oriented methodologies complement the main-stream, technology-oriented methodologies. Our study will coarsely demonstrate two goal-oriented modeling techniques, i* and NFR. Further, we will extend the goal-oriented modeling techniques to analyze and mitigate role-based conflicts of interest in health-care. The result will suggest an innovative approach to model conflicts of interest systematically and integrate concerns about conflicts of interest in system design.
Taming Heterogenity and Complexity of Embedded Control
Authors: FranCoise Lamnabhi-Lagarrigue, Antonio Loria, Elena Panteley, Salah Laghrouche
Venue:  (2007)

Collected in this book is a selection of papers presented at the Joint CTS-HYCON Workshop on Nonlinear and Hybrid Control held at the Paris Sorbonne in July of2006. The main objective of the workshop was to promote the exchange of ideas and experiences and reinforce scientific contacts in the large multidisciplinary area of the control of nonlinear and hybrid systems.
Online Control Techniques for Management of Shared Bandwidth in Multimedia Networks
Authors: K. Ravindran, M. Rabby
Venue: Proceedings of the 10th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services: Real-Time Mobile Multimedia Services (2008)

In this paper, we provide an online monitor and control approach for adaptive bandwidth allocations in a QoS-aware multimedia network system. Accurate management of bandwidth allocations with a goal of maximizing the revenues is quite complex, due to the interactions among various data flows that dynamically share the network bandwidth. So, we adopt a heuristics-aided control that iteratively adjusts the bandwidth allocation based on the observed packet loss rate and delays. In terms of 'control theory', the bandwidth allocation and the packet loss rate constitute the system input and output respectively, with the heuristics-based bandwidth adjustment strategies incorporated in a controller along the feedback loop. A 'control-theoretic' treatment of the QoS adaptation problem allows studying the stability and convergence properties of the QoS delivered to the applications, while maximizing the connectivity service provider's revenues.
Photoshop Lightroom 2 Adventure
Authors: Mikkel Aaland
Venue:  (2008)

This beautifully illustrated and eminently practical book offers a complete tour of Lightroom 2, the integrated digital photography workflow application that allows serious photographers to import, select, develop and showcase large volumes of digital images. Augmented by photos and case studies from a demanding road test in Tasmania, award-winning photographer Mikkel Aaland explains how Lightroom can improve the way you work. After watching -- and often helping -- Adobe create Lightroom entirely from the ground up, Aaland (author of Photoshop CS3 RAW) decided to try it out in the field. He organized a group of top-notch photographers for a trek to Tasmania, the exotic island south of mainland Australia, where the only studio was Lightroom on a laptop. In Photoshop Lightroom 2 Adventure, Aaland uses hands-on knowledge from the trip to demonstrate how Lightroom can help you create the best possible image under any conditions. This unique tutorial walks you step-by-step through Lightroom's: Library module for uploading, sorting, tagging, ranking and adding keywords to your images Develop module with Adobe Camera RAW for complete non-destructive color and tonal adjustments Slideshow module, where you select and size images, and export the show to HTML, Flash, or PDF formats Print module, which includes several templates for printing contact sheets or full images Web module, where you can create Flash or HTML web galleries With many gorgeous examples shot in the exotic wilds of Tasmania, this book lets you see the results for yourself. Mikkel Aaland's trademark ability to teach complicated topics on digital imaging with straightforward, easy-to-follow text makes this book a valuable learning tool for anyone serious about digital photography.
Extracting story units from long programs for video browsing and navigation
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Abstract: Content based browsing and navigation in digital video collections have been centered on sequential and linear presentation of images. To facilitate such applications, nonlinear and non sequential access into video documents is essential, especially with long programs. For many programs, this can be achieved by identifying underlying story structures which are reflected both by visual content and temporal organization of composing elements. A new framework of video analysis and associated techniques are proposed to automatically parse long programs, to extract story structures and identify story units. The proposed analysis and representation contribute to the extraction of scenes and story units, each representing a distinct locale or event, that cannot be achieved by shot boundary detection alone. Analysis is performed on MPEG compressed video and without a prior models. The result is a compact representation that serves as a summary of the story and allows hierarchical organization of video documents.
Sponsored Search Auctions with Reserve Prices: Going Beyond Separability
Authors: Rica Gonen, Sergei Vassilvitskii
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

The original analysis of sponsored search auctions by Varian and independently by Aggarwal et al. did not take into account the notion of reserve prices, which are common across all major search engines. We investigate this further and show that the separability assumption derived by Aggarwal et al. is not sufficient for aligning the greedy allocation employed by GSP and the efficient allocation in the presence of reserve prices. We extend separability and derive the condition under which the greedy ranking allocation is an efficient truthful mechanism. We call this generalization the extended separability condition.To complement the analysis of the extended separability condition we present an extension of the laddered auction in the presence of reserve prices, which we call the bi-laddered auction. We show that the bi-laddered auction is the unique truthful auction for advertisers that provides a price vector support for an extended GSP SNE scheme. Nevertheless the bi-laddered auction is shown to allow a budget deficit.Building on our model of reserve prices we continue by depicting advertising networks as double sided sponsored search markets with advertisers on one side, syndicators on the other, and the search engine as the market maker. For the latter model we provide a truthful scheme for the seller and show that by assuming separability one can design a SNE, individually rational, and nearly efficient syndicated market that allows the market maker (search engine) to run the market with a surplus/budget balance. The uniqueness of our bi-laddered auction scheme implies that without the separability condition no truthful syndicated market can run without a deficit.
Robot programming using augmented reality: An interactive method for planning collision-free paths
Authors: J. W. S. Chong, S. K. Ong, A. Y. C. Nee, K. Youcef-Youmi
Venue: Robotics and Computer-Integrated Manufacturing (2009)

Current robot programming approaches lack the intuitiveness required for quick and simple applications. As new robotic applications are being identified, there is a greater need to be able to programme robots safely and quickly. This paper discusses the use of an augmented reality (AR) environment for facilitating intuitive robot programming, and presents a novel methodology for planning collision-free paths for an n-d.o.f. (degree-of-freedom) manipulator in a 3D AR environment. The methodology is interactive because the human is involved in defining the free space or collision-free volume (CFV), and selecting the start and goal configurations. The methodology uses a heuristic beam search algorithm to generate the paths. A number of possible scenarios are discussed.
Inclusion of a Second-Order Prior into Semi-Global Matching
Authors: Simon Hermann, Reinhard Klette, Eduardo Destefanis
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

Today's stereo vision algorithms and computing technology allow real-time 3D data analysis, for example for driver assistance systems. A recently developed Semi-Global Matching (SGM) approach by H. Hirschmüller became a popular choice due to performance and robustness. This paper evaluates different parameter settings for SGM, and its main contribution consists in suggesting to include a second order prior into the smoothness term of the energy function. It also proposes and tests a new cost function for SGM. Furthermore, some preprocessing (edge images) proved to be of great value for improving SGM stereo results on real-world sequences, as previously already shown by S. Guan and R. Klette for belief propagation. There is also a performance gain for engineered stereo data (e.g.) as currently used on the Middlebury stereo website. However, the fact that results are not as impressive as on the .enpeda.. sequences indicates that optimizing for engineered data does not neccessarily improve real world stereo data analysis.
Investigation of Piezoelectrically Generated Synthetic Jet Flow
Authors: A. S. Yang, J. J. Ro, M. T. Yang, W. H. Chang
Venue: Journal of Visualization (2009)

The purpose of this paper is to investigate the compressible turbulent synthetic jet flow characteristics of a dual diaphragm piezoelectric actuator. Experimentally, a flow visualization system was established to obtain the particle streak images scattered from 10-&mu;m red fluorescent spheres for observing the synthetic jet flowfield produced by a dual diaphragm piezo actuator. The centerline velocity of the synthetic jet was also measured by using a hot-wire anemometry system. In the analysis, the computational approach adopted the transient three-dimensional conservation equations of mass and momentum with the moving boundary specified to represent the piezo diaphragm motion. The standard k-&epsilon; two-equation turbulent model was employed for turbulence closure. For the actuator operating at the frequency of 648 Hz, the particle streakline images in the cross-sectional plane visualized a turbulent jet flow pattern in the far-field area. The hot-wire anemometry data indicated that the measured centerline velocity of synthetic jets reached 3.8 m/s at y/d = 50. The predictions were compared with the visualized particle streak images and centerline velocity of the synthetic jet in order to validate the computer code. The numerical simulation revealed the time-periodic formation and advection of discrete vortex pairs. Caused by the outward movement of the piezo diaphragms, air near the orifice was entrained into the actuator cavity when the vortex pairs were sufficiently distant from the orifice.