ppxscal/embedding_network huggingface dataset:
Argumentation and Artifact for Dialogue Support
Authors: Enrico Oliva, Mirko Viroli, Andrea Omicini, Peter Mcburney
Venue: Argumentation in Multi-Agent Systems: Fifth International Workshop, ArgMAS 2008, Estoril, Portugal, May 12, 2008. Revised Selected and Invited Papers (2009)

Intelligent and autonomous software agents may engage in dialogue and argument with one another, and much recent research has considered protocols, architectures and frameworks for this. Just as with human dialogues, such agent dialogues may be facilitated by the presence of a mediator, able to summarise different positions, identify common assumptions and inconsistencies, and make appropriate interventions in the dialogue. Drawing on the theory of co-ordination artifacts in multi-agent systems, we propose a formal framework to explicitly represent the functions of a mediator artifact. We then describe an implementation of this framework using the TuCS oN coordination infrastructure for MAS, where the mediator artifact is realised by a tuple centre--a programmable tuple space.
Surfactant-mediated growth of InAs-GaAs superlattices and quantum dot structures grown at different temperatures
Authors: M. Alduraibi, C. Mitchell, S. Chakraborty, M. Missous
Venue: Microelectronics Journal (2009)

The structural and optical qualities of superlattice InAs-GaAs structures and quantum dots (QDs), grown by molecular beam epitaxy (MBE) at low (250°C) and normal (~450°C) growth temperatures, have been investigated. The InAs layers (3 monolayers) were grown under conditions where only the indium beam impinged upon the growth surface (surfactant growth mode). This growth mode still resulted in the formation of QDs at normal growth temperatures, but with dot sizes that were much smaller than those for "normal" growth of 3ML InAs-GaAs QD structures. In addition, at low temperature under such "arsenic-free" conditions a very high quality InAs-GaAs superlattice structure with 3ML of InAs was formed, as demonstrated by transmission electron microscopy (TEM). This is a direct confirmation that the critical thickness of InAs can be extended well beyond the 1.7ML limit seen at higher growth temperatures.
Simple, Black-Box Constructions of Adaptively Secure Protocols
Authors: Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

We present a compiler for transforming an oblivious transfer (OT) protocol secure against an adaptive semi-honest adversary into one that is secure against an adaptive malicious adversary. Our compiler achieves security in the universal composability framework, assuming access to an ideal commitment functionality, and improves over previous work achieving the same security guarantee in two ways: it uses black-box access to the underlying protocol and achieves a constant multiplicative overhead in the round complexity. As a corollary, we obtain the first constructions of adaptively secure protocols in the stand-alone model using black-box access to a low-level primitive.
Tests of independence among continuous random vectors based on Cramér-von Mises functionals of the empirical copula process
Authors: Ivan Kojadinovic, Mark Holmes
Venue: Journal of Multivariate Analysis (2009)

A decomposition of the independence empirical copula process into a finite number of asymptotically independent sub-processes was studied by Deheuvels. Starting from this decomposition, Genest and Remillard recently investigated tests of independence among random variables based on Cramer-von Mises statistics derived from the sub-processes. A generalization of Deheuvels' decomposition to the case where independence is to be tested among continuous random vectors is presented. The asymptotic behavior of the resulting collection of Cramer-von Mises statistics is derived. It is shown that they are not distribution-free. One way of carrying out the resulting tests of independence then involves using the bootstrap or the permutation methodology. The former is shown to behave consistently, while the latter is employed in practice. Finally, simulations are used to study the finite-sample behavior of the tests.
Filling in the Blanks - Krimp Minimisation for Missing Data
Authors: Jilles Vreeken, Arno Siebes
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Many data sets are incomplete. For correct analysis of such data, one can either use algorithms that are designed to handle missing data or use imputation. Imputation has the benefit that it allows for any type of data analysis. Obviously, this can only lead to proper conclusions if the provided data completion is both highly accurate and maintains all statistics of the original data. In this paper, we present three data completion methods that are built on the MDL-based {\sc Krimp} algorithm. Here, we also follow the MDL principle, i.e. the completed database that can be compressed best, is the best completion because it adheres best to the patterns in the data. By using local patterns, as opposed to a global model, Krimp captures the structure of the data in detail. Experiments show that both in terms of accuracy and expected differences of any marginal, better data reconstructions are provided than the state of the art, Structural EM.
Modulobe: a creation and sharing platform for articulated models with complex motion
Authors: Kouichirou Eto, Masahiro Hamasaki, Kuniaki Watanabe, Yoshinori Kawasaki, Takuichi Nishimura
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

In this paper, we propose Modulobe: a creation and sharing platform for articulated 3D models with complex motion. Modulobe has two components: a 3D modeling application and a model sharing web site. The former is intended to achieve complex motion simulation of a 3D model and provide a user-friendly interface. Motion pattern of angle for each hinge can be set easily by specifying pattern on a graph. The latter has a feature to show uploaded models on bases of tags, comments and popularity which is designed to stimulate users to create new models. This paper presents design concept of Modulobe and show the user interface and model sharing site. We are delivering Modulobe application and opened the model sharing site for about two years. Modulobe application had been downloaded about 170,000 times and the web site had been accessed 686 million times from various sites whose unique IP is about 100,000 variations. More than 3,000 models were uploaded.
Neural network model-based automotive engine air/fuel ratio control and robustness evaluation
Authors: Yu-Jia Zhai, Ding-Li Yu
Venue: Engineering Applications of Artificial Intelligence (2009)

Automotive engines are multivariable system with severe non-linear dynamics, and their modelling and control are challenging tasks for control engineers. Current control of engine used look-up table combined with proportional and integral (PI) control and is not robust to system uncertainty and time varying effects. In this paper the model predictive control strategy is applied to engine air/fuel ratio control using neural network model. The neural network model uses information from multivariables and considers engine dynamics to do multi-step ahead prediction. The model is adapted in on-line mode to cope with system uncertainty and time varying effects. Thus, the control performance is more accurate and robust compared with non-adaptive model based methods. To speed up algorithm calculation, different optimisation algorithms are investigated and performance compared. Finally, the developed method is evaluated on a well-known engine benchmark, a simulated mean value engine model (MVEM). The simulation results demonstrate the effectiveness of the developed method.
Fuzzy-rough attribute reduction via mutual information with an application to cancer classification
Authors: F. F. Xu, D. Q. Miao, L. Wei
Venue: Computers Mathematics with Applications (2009)

Establishing a classification model for cancer recognition based on DNA microarrays is useful for cancer diagnosis. Feature selection is a key step to perform cancer classification with DNA microarrays, for there is a large number of genes from which to predict classes and a relatively small number of samples. Automatic methods must be developed for extracting relevant genes which are essential for classification. This paper proposes a novel approach for reducing data redundancy based on fuzzy rough set theory and information theory. A mutual information-based algorithm for attribute reduction is suggested. The method is applied to the problem of gene selection for cancer classification. Experimental results show that the algorithm is more effective than conventional rough sets based approaches.
Admission control and scheduling for QoS guarantees for variable-bit-rate applications on wireless channels
Authors: I-Hong Hou, P. R. Kumar
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

Providing differentiated Quality of Service (QoS) over unreliable wireless channels is an important challenge for supporting several future applications. We analyze a model that has been proposed to describe the QoS requirements by four criteria: traffic pattern, channel reliability, delay bound, and throughput bound. We study this mathematical model and extend it to handle variable bit rate applications. We then obtain a sharp characterization of schedulability vis-a-vis latencies and timely throughput. Our results extend the results so that they are general enough to be applied on a wide range of wireless applications, including MPEG Variable-Bit-Rate (VBR) video streaming, VoIP with differentiated quality, and wireless sensor networks (WSN). Two major issues concerning QoS over wireless are admission control and scheduling. Based on the model incorporating the QoS criteria, we analytically derive a necessary and sufficient condition for a set of variable bit-rate clients to be feasible. Admission control is reduced to evaluating the necessary and sufficient condition. We further analyze two scheduling policies that have been proposed, and show that they are both optimal in the sense that they can fulfill every set of clients that is feasible by some scheduling algorithms. The policies are easily implemented on the IEEE 802.11 standard. Simulation results under various settings support the theoretical study.
Analysis of TCP live experiments on a real GEO satellite testbed
Authors: C. Caini, R. Firrincieli, D. Lacamera, T. de Cola, M. Marchese, C. Marcondes, M. Y. Sanadidi, M. Gerla
Venue: Performance Evaluation (2009)

The paper describes a measurement campaign carried out by the University of Bologna (UoB), the National Inter-University Consortium for Telecommunications (CNIT) and the University of California Los Angeles (UCLA). The aim of the experiments was the performance assessment of a wide range of TCP enhancements on network environments that include a real GEO satellite link. To this end, UoB and CNIT integrated their network tools and set up a testbed composed of a cluster of UoB Linux PCs connected to the CNIT GEO Skyplex satellite platform. Tests were conducted considering both end-to-end TCP enhancements and a TCP-splitting Performance Enhancing Proxy (PEP) developed by UoB. The analysis was not limited to isolated satellite links, but embraced more complex heterogeneous networks, where satellite connections have to compete with wired cross traffic for the network resources. The analysis of the large set of experimental data presented in the paper confirms the challenges posed by GEO satellite channels, which, in this case, were worsened also by the presence of Bandwidth on Demand technique, which impacts TCP performance. Among the end-to-end TCP variants, best results are generally shown by TCP Hybla, especially when heterogeneous environments are considered. On the other hand, the splitting PEP solution offers the best performance with respect to all TCP enhancements, due to its ability to isolate satellite channel impairments. The possible drawback of this approach is in that it violates the end-to-end semantics and is incompatible with IPsec protocol implementation.
Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?
Authors: Tetsuo Asano
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

In this talk I will present a new direction of algorithms which do not use any extra working array. More formally, we want to design efficient algorithms which require no extra array of size depending on input size n but use only constant working storage cells (variables), each having O(logn) bits. As an example, consider a problem of finding the median among n given numbers. A linear-time algorithm for the problem is well known. An ordinary implementation of the algorithm requires another array of the same size. It is not very hard to implement the algorithm without using any additional array, in other words, to design an in-place algorithm. Unfortunately, it is not a constant working space algorithm in our model since it requires some space, say O(logn) space, for maintaining recursive calls. A good news is that an efficient algorithm is known which finds the median in O(n1 + &epsilon;) time using O(1/&epsilon;) working space for any small positive constant &epsilon;. The algorithm finds the median without altering any element of an input array. In other words, the input array is considered as a read-only array. 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
Macroscopic defects in GaN/AlN multiple quantum well structures grown by MBE on GaN templates
Authors: T. G. Andersson, X. Y. Liu, T. Aggerstam, P. Holmström, S. Lourdudoss, L. Thylen, Y. L. Chen, C. H. Hsieh, I. Lo
Venue: Microelectronics Journal (2009)

We have used MBE to grow in AlN/GaN superlattices, with different number of periods, on 2.5-@mm-thick MOVPE-GaN templates to study the development of defects such as surface deformation due to strain. After growth the samples were studied by atomic force microscopy (AFM), transmission electron microscopy (TEM), XRD and Fourier transform infrared spectroscopy (FT-IR). The strain increased with the number of quantum wells (QWs) and eventually caused defects such as microcracks visible by optical microscopy at four or more QW periods. High-resolution TEM images showed shallow recessions on the surface (surface deformation) indicating formation of microcracks in the MQW region. The measured intersubband (IS) absorption linewidth from a four period structure was 97meV, which is comparable with the spectrum from a 10 period structure at an absorption energy of ~700meV. This indicates that the interface quality of the MQW is not substantially affected by the presence of cracks.
Improvement of Beam Scanning Characteristics of a Dielectric Lens Antenna by Array Feeds
Authors: Yousuke Tajima, Yoshihide Yamada
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In the Intelligent Transportation System, millimeter waves are used and antennas are required beam scanning ability. In the millimeter wave operation, a lens antenna is one of the prominent candidates which achieves wide angle beam scanning. Wide angle scanning can be achieved by introducing Abbe sine condition to lens surface shaping. Authors designed the shaped lens antenna that could achieve beam scanning ±30°. The narrow beam widths were maintained on the scanning plane. However, the beam widths were broadened on the transverse plane and large gain reduction was appeared. It was clarified that the reason of this beam deterioration was due to the phase delay on the antenna aperture. In this paper, an array feed composed of a group of rectangular horns is employed to compensate the phase delay on the antenna aperture. In designing the array feed, because there were no examples of phase radiation pattern synthesis, a new radiation pattern synthesis method is studied. Ability of the weighting matrix contained in the Least Mean Square synthesis method is paid attention. Adequate weighting matrix is found out. Satisfactory phase radiation pattern that can compensate the phase delay and an adequate amplitude radiation pattern are achieved. As a result, the improvement of scanned beam widths and antenna gains through the array feed are ensured. And adequate horn arrangements of the array feed for improving scanned beam are clarified. Moreover, in order to examine the realization of an actual array feed, the exact electromagnetic simulation is conducted. The validity of the radiation pattern synthesis is clarified.
Low voltage current mirrors with enhanced bandwidth
Authors: Maneesha Gupta, Prashant Aggarwal, Pritender Singh, Naveen Kumar Jindal
Venue: Analog Integrated Circuits and Signal Processing (2009)

This paper presents an improved low voltage cascode and flipped voltage follower (FVF) based current mirror with the enhancement of the bandwidth obtained by using a compensation resistor between the gates of the primary transistor pair. In this technique a carefully determined resistance is used in the diode connected MOS transistor of the current mirror for enhancing the bandwidth. Active realization of the compensation resistance using MOS operating in the triode region has also been applied to both the cascode and FVF based current mirror circuits. The proposed circuits have been simulated using PSpice for 0.25 μm CMOS technology and the obtained results are compared with their uncompensated topologies to show their effectiveness.
High Performance On-line Session-adaptation for Handling Inter-session Speaker Variability in Variable-text Speaker-recognition
Authors: S. Thiyagarajan, V. Ramasubramanian
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

We propose an on-line session-adaptation algorithm for making variable-text speaker-recognition systems robust to inter-session variability, by a continuous update of registered speakers' multiple templates from test utterances during actual usage of the system. The algorithm is set in a speaker-verification mode of operation and uses an enhanced verification step to ensure reliable selection of input utterances for template updation in an unsupervised way.
Evaluating industry performance using extracted RGR rules based on feature selection and rough sets classifier
Authors: You-Shyang Chen, Ching-Hsue Cheng
Venue: Expert Systems with Applications: An International Journal (2009)

In strategy of investment, an important thing for investors is to correctly predict firm's revenue growth rate (RGR), which is an effective evaluation indicator for them to see how big the potential power of future development is and measure how about the growth of future development for a target firm that may be selected to investment portfolios. However, conventional methods of forecasting RGR have some shortcomings such as statistical methods based on strict assumptions of linearity and/or normality limit applications in real world. Additionally, due to rapid changing of information technology (IT) today, some techniques (i.e. rough sets and data mining tools) have become important research trends to both practitioners and academicians. With these reasons above, a new procedure, using the feature selection method and rough sets classifier, is proposed to extract decision rules and improve accuracy rate for classifying RGR. In empirical study, an actual RGR dataset collected from publicly traded company of stock markets is employed to illustrate the proposed procedure. The experimental results of RGR dataset analyses indicate that the proposed procedure surpasses the listing methods in terms of both higher accuracy and fewer attributes, and the output of proposed procedure is to generate a set of easily understandable decision rules that are readily applied in knowledge-based investment systems by investors.
Sanitizable and Deletable Signature
Authors: Tetsuya Izu, Noboru Kunihiro, Kazuo Ohta, Makoto Sano, Masahiko Takenaka
Venue: Information Security Applications: 9th International Workshop, WISA 2008, Jeju Island, Korea, September 23-25, 2008, Revised Selected Papers (2009)

Recently, the sanitizable signature attracts much attention since it allows to modify (sanitize) the document for hiding partial information without keeping the integrity of the disclosed subdocuments. Sanitizable signatures are quite useful in governmental or military offices, where there is a dilemma between disclosure laws for public documents and privacy or diplomatic secrets. Since a verifier can detect whether the document was sanitized or not, especially which subdocuments was sanitized, the scheme does not establish the perfect hiding. In order to solve the problem, the deletable signature was introduced in 2006. However, because these schemes are not compatible to each other, we have to select the scheme to meet the requirement. In this paper, we propose the sanitizable and deletable signature as a combination of the sanitizable signature and the deletable signature. We also establish two concrete sanitizable and deletable signatures based on the deletable signature by Miyazaki, Hanaoka and Imai.
Pro Excel Financial Modeling: Building Models for Technology Startups, 1 edition
Authors: Tom Y. Sawyer
Venue:  (2009)

Learn the business thinking behind financial modeling and execute what you know effectively using Microsoft Excel. Many believe that sales and profitability projections shown in financial models are the keys to success in attracting investors. The truth is that investors will come up with their own projections. The investor wants to understand the assumptions, structure, and relationships within the modeling of a startup. If the investor is satiated, the entrepreneur has successfully demonstrated a complete understanding of the business side of the enterprise. Pro Excel Financial Modeling provides the keys necessary to learn this thinking and to build the models that will illustrate it. Stepbystep approach to developing financial models in Excel Extensive case studies and Excel templates provided What youll learn Learn the business thinking behind successful financial modeling aimed at investors. Communicate effectively with investors. Explore advanced modeling with Microsoft Excel, including Cost of Information Technology, Customer ROI, Cost of Sales and Marketing, Cost of Goods Sold, Team and Staffing, Profit and Loss. Discover best practices for modeling using Microsoft Excel. Who is this book for? Anyone who wants to think critically about their business models, communicate these models to investors, and successfully build them in Microsoft Excel will find the information they need within this material. Additional readers who will benefit include entrepreneurs, technologists, and developers who wish to start a business utilizing their technology ideas, and business and technology consultants. About the Apress Pro Series The Apress Pro series books are practical, professional tutorials to keep you on and moving up the professional ladder. You have gotten the job, now you need to hone your skills in these tough competitive times. The Apress Pro series expands your skills and expertise in exactly the areas you need. Master the content of a Pro book, and you will always be able to get the job done in a professional development project. Written by experts in their field, Pro series books from Apress give you the hardwon solutions to problems you will face in your professional programming career.